63.041/63.041 NO 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 Confluence Problem: 63.041/63.041 (VAR vNonEmpty:S x:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (g 1 2) 63.041/63.041 (h 1) 63.041/63.041 (A) 63.041/63.041 (B) 63.041/63.041 (C) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 g(x:S,x:S) -> C | A ->* B 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 ) 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Inlining of Conditions Processor [STERN17]: 63.041/63.041 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 Confluence Problem: 63.041/63.041 (VAR vNonEmpty:S x:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (g 1 2) 63.041/63.041 (h 1) 63.041/63.041 (A) 63.041/63.041 (B) 63.041/63.041 (C) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 g(x:S,x:S) -> C | A ->* B 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 ) 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Clean CTRS Processor: 63.041/63.041 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 Confluence Problem: 63.041/63.041 (VAR x:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (g 1 2) 63.041/63.041 (h 1) 63.041/63.041 (A) 63.041/63.041 (B) 63.041/63.041 (C) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 ) 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 a -> c 63.041/63.041 Rule remains 63.041/63.041 Proof: 63.041/63.041 NO_CONDS 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 a -> d 63.041/63.041 Rule remains 63.041/63.041 Proof: 63.041/63.041 NO_CONDS 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 b -> c 63.041/63.041 Rule remains 63.041/63.041 Proof: 63.041/63.041 NO_CONDS 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 b -> d 63.041/63.041 Rule remains 63.041/63.041 Proof: 63.041/63.041 NO_CONDS 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 c -> e 63.041/63.041 Rule remains 63.041/63.041 Proof: 63.041/63.041 NO_CONDS 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 c -> k 63.041/63.041 Rule remains 63.041/63.041 Proof: 63.041/63.041 NO_CONDS 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 d -> k 63.041/63.041 Rule remains 63.041/63.041 Proof: 63.041/63.041 NO_CONDS 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 Rule remains 63.041/63.041 Proof: 63.041/63.041 NO 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Infeasibility Problem: 63.041/63.041 [(VAR vNonEmpty:S vNonEmpty:S:S x:S:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (g 1 2) 63.041/63.041 (h 1) 63.041/63.041 (A) 63.041/63.041 (B) 63.041/63.041 (C) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S:S) -> x:S:S | x:S:S ->* e 63.041/63.041 g(x:S:S,x:S:S) -> C | A ->* B 63.041/63.041 h(x:S:S) -> i(x:S:S,x:S:S) 63.041/63.041 )] 63.041/63.041 63.041/63.041 Infeasibility Conditions: 63.041/63.041 x:S:S ->* e 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Obtaining a proof using Prover9: 63.041/63.041 63.041/63.041 -> Prover9 Output: 63.041/63.041 ============================== Prover9 =============================== 63.041/63.041 Prover9 (64) version 2009-11A, November 2009. 63.041/63.041 Process 50192 was started by ubuntu on ubuntu, 63.041/63.041 Wed Jul 14 10:53:55 2021 63.041/63.041 The command was "./prover9 -f /tmp/prover950183-0.in". 63.041/63.041 ============================== end of head =========================== 63.041/63.041 63.041/63.041 ============================== INPUT ================================= 63.041/63.041 63.041/63.041 % Reading from file /tmp/prover950183-0.in 63.041/63.041 63.041/63.041 assign(max_seconds,20). 63.041/63.041 63.041/63.041 formulas(assumptions). 63.041/63.041 ->*_s0(x,x) # label(reflexivity). 63.041/63.041 ->_s0(x,y) & ->*_s0(y,z) -> ->*_s0(x,z) # label(transitivity). 63.041/63.041 ->_s0(x1,y) -> ->_s0(f(x1),f(y)) # label(congruence). 63.041/63.041 ->_s0(x1,y) -> ->_s0(g(x1,x2),g(y,x2)) # label(congruence). 63.041/63.041 ->_s0(x2,y) -> ->_s0(g(x1,x2),g(x1,y)) # label(congruence). 63.041/63.041 ->_s0(x1,y) -> ->_s0(h(x1),h(y)) # label(congruence). 63.041/63.041 ->_s0(x1,y) -> ->_s0(i(x1,x2),i(y,x2)) # label(congruence). 63.041/63.041 ->_s0(x2,y) -> ->_s0(i(x1,x2),i(x1,y)) # label(congruence). 63.041/63.041 ->_s0(a,c) # label(replacement). 63.041/63.041 ->_s0(a,d) # label(replacement). 63.041/63.041 ->_s0(b,c) # label(replacement). 63.041/63.041 ->_s0(b,d) # label(replacement). 63.041/63.041 ->_s0(c,e) # label(replacement). 63.041/63.041 ->_s0(c,k) # label(replacement). 63.041/63.041 ->_s0(d,k) # label(replacement). 63.041/63.041 ->*_s0(x2,e) -> ->_s0(f(x2),x2) # label(replacement). 63.041/63.041 ->*_s0(A,B) -> ->_s0(g(x2,x2),C) # label(replacement). 63.041/63.041 ->_s0(h(x2),i(x2,x2)) # label(replacement). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 formulas(goals). 63.041/63.041 (exists x2 ->*_s0(x2,e)) # label(goal). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 ============================== end of input ========================== 63.041/63.041 63.041/63.041 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 63.041/63.041 63.041/63.041 % Formulas that are not ordinary clauses: 63.041/63.041 1 ->_s0(x,y) & ->*_s0(y,z) -> ->*_s0(x,z) # label(transitivity) # label(non_clause). [assumption]. 63.041/63.041 2 ->_s0(x1,y) -> ->_s0(f(x1),f(y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 3 ->_s0(x1,y) -> ->_s0(g(x1,x2),g(y,x2)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 4 ->_s0(x2,y) -> ->_s0(g(x1,x2),g(x1,y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 5 ->_s0(x1,y) -> ->_s0(h(x1),h(y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 6 ->_s0(x1,y) -> ->_s0(i(x1,x2),i(y,x2)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 7 ->_s0(x2,y) -> ->_s0(i(x1,x2),i(x1,y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 8 ->*_s0(x2,e) -> ->_s0(f(x2),x2) # label(replacement) # label(non_clause). [assumption]. 63.041/63.041 9 ->*_s0(A,B) -> ->_s0(g(x2,x2),C) # label(replacement) # label(non_clause). [assumption]. 63.041/63.041 10 (exists x2 ->*_s0(x2,e)) # label(goal) # label(non_clause) # label(goal). [goal]. 63.041/63.041 63.041/63.041 ============================== end of process non-clausal formulas === 63.041/63.041 63.041/63.041 ============================== PROCESS INITIAL CLAUSES =============== 63.041/63.041 63.041/63.041 % Clauses before input processing: 63.041/63.041 63.041/63.041 formulas(usable). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 formulas(sos). 63.041/63.041 ->*_s0(x,x) # label(reflexivity). [assumption]. 63.041/63.041 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 63.041/63.041 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 63.041/63.041 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 63.041/63.041 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 63.041/63.041 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 63.041/63.041 -->_s0(x,y) | ->_s0(i(x,z),i(y,z)) # label(congruence). [clausify(6)]. 63.041/63.041 -->_s0(x,y) | ->_s0(i(z,x),i(z,y)) # label(congruence). [clausify(7)]. 63.041/63.041 ->_s0(a,c) # label(replacement). [assumption]. 63.041/63.041 ->_s0(a,d) # label(replacement). [assumption]. 63.041/63.041 ->_s0(b,c) # label(replacement). [assumption]. 63.041/63.041 ->_s0(b,d) # label(replacement). [assumption]. 63.041/63.041 ->_s0(c,e) # label(replacement). [assumption]. 63.041/63.041 ->_s0(c,k) # label(replacement). [assumption]. 63.041/63.041 ->_s0(d,k) # label(replacement). [assumption]. 63.041/63.041 -->*_s0(x,e) | ->_s0(f(x),x) # label(replacement). [clausify(8)]. 63.041/63.041 -->*_s0(A,B) | ->_s0(g(x,x),C) # label(replacement). [clausify(9)]. 63.041/63.041 ->_s0(h(x),i(x,x)) # label(replacement). [assumption]. 63.041/63.041 -->*_s0(x,e) # label(goal). [deny(10)]. 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 formulas(demodulators). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 ============================== PREDICATE ELIMINATION ================= 63.041/63.041 63.041/63.041 No predicates eliminated. 63.041/63.041 63.041/63.041 ============================== end predicate elimination ============= 63.041/63.041 63.041/63.041 Auto_denials: 63.041/63.041 % copying label goal to answer in negative clause 63.041/63.041 63.041/63.041 Term ordering decisions: 63.041/63.041 Predicate symbol precedence: predicate_order([ ->_s0, ->*_s0 ]). 63.041/63.041 Function symbol precedence: function_order([ c, d, e, k, a, b, B, C, A, i, g, f, h ]). 63.041/63.041 After inverse_order: (no changes). 63.041/63.041 Unfolding symbols: (none). 63.041/63.041 63.041/63.041 Auto_inference settings: 63.041/63.041 % set(neg_binary_resolution). % (HNE depth_diff=-8) 63.041/63.041 % clear(ordered_res). % (HNE depth_diff=-8) 63.041/63.041 % set(ur_resolution). % (HNE depth_diff=-8) 63.041/63.041 % set(ur_resolution) -> set(pos_ur_resolution). 63.041/63.041 % set(ur_resolution) -> set(neg_ur_resolution). 63.041/63.041 63.041/63.041 Auto_process settings: (no changes). 63.041/63.041 63.041/63.041 kept: 11 ->*_s0(x,x) # label(reflexivity). [assumption]. 63.041/63.041 kept: 12 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 63.041/63.041 kept: 13 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 63.041/63.041 kept: 14 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 63.041/63.041 kept: 15 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 63.041/63.041 kept: 16 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 63.041/63.041 kept: 17 -->_s0(x,y) | ->_s0(i(x,z),i(y,z)) # label(congruence). [clausify(6)]. 63.041/63.041 kept: 18 -->_s0(x,y) | ->_s0(i(z,x),i(z,y)) # label(congruence). [clausify(7)]. 63.041/63.041 kept: 19 ->_s0(a,c) # label(replacement). [assumption]. 63.041/63.041 kept: 20 ->_s0(a,d) # label(replacement). [assumption]. 63.041/63.041 kept: 21 ->_s0(b,c) # label(replacement). [assumption]. 63.041/63.041 kept: 22 ->_s0(b,d) # label(replacement). [assumption]. 63.041/63.041 kept: 23 ->_s0(c,e) # label(replacement). [assumption]. 63.041/63.041 kept: 24 ->_s0(c,k) # label(replacement). [assumption]. 63.041/63.041 kept: 25 ->_s0(d,k) # label(replacement). [assumption]. 63.041/63.041 kept: 26 -->*_s0(x,e) | ->_s0(f(x),x) # label(replacement). [clausify(8)]. 63.041/63.041 kept: 27 -->*_s0(A,B) | ->_s0(g(x,x),C) # label(replacement). [clausify(9)]. 63.041/63.041 kept: 28 ->_s0(h(x),i(x,x)) # label(replacement). [assumption]. 63.041/63.041 kept: 29 -->*_s0(x,e) # label(goal) # answer(goal). [deny(10)]. 63.041/63.041 63.041/63.041 ============================== PROOF ================================= 63.041/63.041 63.041/63.041 % Proof 1 at 0.00 (+ 0.00) seconds: goal. 63.041/63.041 % Length of proof is 4. 63.041/63.041 % Level of proof is 2. 63.041/63.041 % Maximum clause weight is 3.000. 63.041/63.041 % Given clauses 0. 63.041/63.041 63.041/63.041 10 (exists x2 ->*_s0(x2,e)) # label(goal) # label(non_clause) # label(goal). [goal]. 63.041/63.041 11 ->*_s0(x,x) # label(reflexivity). [assumption]. 63.041/63.041 29 -->*_s0(x,e) # label(goal) # answer(goal). [deny(10)]. 63.041/63.041 30 $F # answer(goal). [resolve(29,a,11,a)]. 63.041/63.041 63.041/63.041 ============================== end of proof ========================== 63.041/63.041 63.041/63.041 ============================== STATISTICS ============================ 63.041/63.041 63.041/63.041 Given=0. Generated=19. Kept=19. proofs=1. 63.041/63.041 Usable=0. Sos=0. Demods=0. Limbo=18, Disabled=19. Hints=0. 63.041/63.041 Kept_by_rule=0, Deleted_by_rule=0. 63.041/63.041 Forward_subsumed=0. Back_subsumed=0. 63.041/63.041 Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. 63.041/63.041 New_demodulators=0 (0 lex), Back_demodulated=0. Back_unit_deleted=0. 63.041/63.041 Demod_attempts=0. Demod_rewrites=0. 63.041/63.041 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. 63.041/63.041 Nonunit_fsub_feature_tests=2. Nonunit_bsub_feature_tests=0. 63.041/63.041 Megabytes=0.07. 63.041/63.041 User_CPU=0.00, System_CPU=0.00, Wall_clock=0. 63.041/63.041 63.041/63.041 ============================== end of statistics ===================== 63.041/63.041 63.041/63.041 ============================== end of search ========================= 63.041/63.041 63.041/63.041 THEOREM PROVED 63.041/63.041 63.041/63.041 Exiting with 1 proof. 63.041/63.041 63.041/63.041 Process 50192 exit (max_proofs) Wed Jul 14 10:53:55 2021 63.041/63.041 63.041/63.041 63.041/63.041 The problem is feasible. 63.041/63.041 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 g(x:S,x:S) -> C | A ->* B 63.041/63.041 Rule deleted 63.041/63.041 Proof: 63.041/63.041 YES 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Infeasibility Problem: 63.041/63.041 [(VAR vNonEmpty:S vNonEmpty:S:S x:S:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (g 1 2) 63.041/63.041 (h 1) 63.041/63.041 (A) 63.041/63.041 (B) 63.041/63.041 (C) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S:S) -> x:S:S | x:S:S ->* e 63.041/63.041 g(x:S:S,x:S:S) -> C | A ->* B 63.041/63.041 h(x:S:S) -> i(x:S:S,x:S:S) 63.041/63.041 )] 63.041/63.041 63.041/63.041 Infeasibility Conditions: 63.041/63.041 A ->* B 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Obtaining a model using Mace4: 63.041/63.041 63.041/63.041 -> Usable Rules: 63.041/63.041 Empty 63.041/63.041 63.041/63.041 -> Mace4 Output: 63.041/63.041 ============================== Mace4 ================================= 63.041/63.041 Mace4 (64) version 2009-11A, November 2009. 63.041/63.041 Process 50219 was started by ubuntu on ubuntu, 63.041/63.041 Wed Jul 14 10:53:55 2021 63.041/63.041 The command was "./mace4 -c -f /tmp/mace450205-2.in". 63.041/63.041 ============================== end of head =========================== 63.041/63.041 63.041/63.041 ============================== INPUT ================================= 63.041/63.041 63.041/63.041 % Reading from file /tmp/mace450205-2.in 63.041/63.041 63.041/63.041 assign(max_seconds,20). 63.041/63.041 63.041/63.041 formulas(assumptions). 63.041/63.041 ->(x1,y) -> ->(f(x1),f(y)) # label(congruence). 63.041/63.041 ->(x1,y) -> ->(g(x1,x2),g(y,x2)) # label(congruence). 63.041/63.041 ->(x2,y) -> ->(g(x1,x2),g(x1,y)) # label(congruence). 63.041/63.041 ->(x1,y) -> ->(h(x1),h(y)) # label(congruence). 63.041/63.041 ->(x1,y) -> ->(i(x1,x2),i(y,x2)) # label(congruence). 63.041/63.041 ->(x2,y) -> ->(i(x1,x2),i(x1,y)) # label(congruence). 63.041/63.041 ->*(x,x) # label(reflexivity). 63.041/63.041 ->(x,y) & ->*(y,z) -> ->*(x,z) # label(transitivity). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 formulas(goals). 63.041/63.041 ->*(A,B) # label(goal). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 ============================== end of input ========================== 63.041/63.041 63.041/63.041 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 63.041/63.041 63.041/63.041 % Formulas that are not ordinary clauses: 63.041/63.041 1 ->(x1,y) -> ->(f(x1),f(y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 2 ->(x1,y) -> ->(g(x1,x2),g(y,x2)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 3 ->(x2,y) -> ->(g(x1,x2),g(x1,y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 4 ->(x1,y) -> ->(h(x1),h(y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 5 ->(x1,y) -> ->(i(x1,x2),i(y,x2)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 6 ->(x2,y) -> ->(i(x1,x2),i(x1,y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 7 ->(x,y) & ->*(y,z) -> ->*(x,z) # label(transitivity) # label(non_clause). [assumption]. 63.041/63.041 8 ->*(A,B) # label(goal) # label(non_clause) # label(goal). [goal]. 63.041/63.041 63.041/63.041 ============================== end of process non-clausal formulas === 63.041/63.041 63.041/63.041 ============================== CLAUSES FOR SEARCH ==================== 63.041/63.041 63.041/63.041 formulas(mace4_clauses). 63.041/63.041 -->(x,y) | ->(f(x),f(y)) # label(congruence). 63.041/63.041 -->(x,y) | ->(g(x,z),g(y,z)) # label(congruence). 63.041/63.041 -->(x,y) | ->(g(z,x),g(z,y)) # label(congruence). 63.041/63.041 -->(x,y) | ->(h(x),h(y)) # label(congruence). 63.041/63.041 -->(x,y) | ->(i(x,z),i(y,z)) # label(congruence). 63.041/63.041 -->(x,y) | ->(i(z,x),i(z,y)) # label(congruence). 63.041/63.041 ->*(x,x) # label(reflexivity). 63.041/63.041 -->(x,y) | -->*(y,z) | ->*(x,z) # label(transitivity). 63.041/63.041 -->*(A,B) # label(goal). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 ============================== end of clauses for search ============= 63.041/63.041 63.041/63.041 % There are no natural numbers in the input. 63.041/63.041 63.041/63.041 ============================== DOMAIN SIZE 2 ========================= 63.041/63.041 63.041/63.041 ============================== MODEL ================================= 63.041/63.041 63.041/63.041 interpretation( 2, [number=1, seconds=0], [ 63.041/63.041 63.041/63.041 function(B, [ 0 ]), 63.041/63.041 63.041/63.041 function(A, [ 1 ]), 63.041/63.041 63.041/63.041 function(f(_), [ 0, 0 ]), 63.041/63.041 63.041/63.041 function(h(_), [ 0, 0 ]), 63.041/63.041 63.041/63.041 function(i(_,_), [ 63.041/63.041 0, 0, 63.041/63.041 0, 0 ]), 63.041/63.041 63.041/63.041 function(g(_,_), [ 63.041/63.041 0, 0, 63.041/63.041 0, 0 ]), 63.041/63.041 63.041/63.041 relation(->*(_,_), [ 63.041/63.041 1, 0, 63.041/63.041 0, 1 ]), 63.041/63.041 63.041/63.041 relation(->(_,_), [ 63.041/63.041 0, 0, 63.041/63.041 0, 0 ]) 63.041/63.041 ]). 63.041/63.041 63.041/63.041 ============================== end of model ========================== 63.041/63.041 63.041/63.041 ============================== STATISTICS ============================ 63.041/63.041 63.041/63.041 For domain size 2. 63.041/63.041 63.041/63.041 Current CPU time: 0.00 seconds (total CPU time: 0.00 seconds). 63.041/63.041 Ground clauses: seen=51, kept=47. 63.041/63.041 Selections=15, assignments=15, propagations=7, current_models=1. 63.041/63.041 Rewrite_terms=82, rewrite_bools=57, indexes=7. 63.041/63.041 Rules_from_neg_clauses=1, cross_offs=1. 63.041/63.041 63.041/63.041 ============================== end of statistics ===================== 63.041/63.041 63.041/63.041 User_CPU=0.00, System_CPU=0.00, Wall_clock=0. 63.041/63.041 63.041/63.041 Exiting with 1 model. 63.041/63.041 63.041/63.041 Process 50219 exit (max_models) Wed Jul 14 10:53:55 2021 63.041/63.041 The process finished Wed Jul 14 10:53:55 2021 63.041/63.041 63.041/63.041 63.041/63.041 Mace4 cooked interpretation: 63.041/63.041 63.041/63.041 63.041/63.041 63.041/63.041 The problem is infeasible. 63.041/63.041 63.041/63.041 63.041/63.041 CRule InfChecker Info: 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 Rule remains 63.041/63.041 Proof: 63.041/63.041 NO_CONDS 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 Confluence Problem: 63.041/63.041 (VAR x:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (g 1 2) 63.041/63.041 (h 1) 63.041/63.041 (A) 63.041/63.041 (B) 63.041/63.041 (C) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 ) 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 63.041/63.041 Critical Pairs Processor: 63.041/63.041 -> Rules: 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 -> Vars: 63.041/63.041 "x", "x" 63.041/63.041 -> FVars: 63.041/63.041 "x2", "x3" 63.041/63.041 -> PVars: 63.041/63.041 "x": ["x2", "x3"] 63.041/63.041 63.041/63.041 -> Rlps: 63.041/63.041 crule: a -> c, id: 1, possubterms: a-> [] 63.041/63.041 crule: a -> d, id: 2, possubterms: a-> [] 63.041/63.041 crule: b -> c, id: 3, possubterms: b-> [] 63.041/63.041 crule: b -> d, id: 4, possubterms: b-> [] 63.041/63.041 crule: c -> e, id: 5, possubterms: c-> [] 63.041/63.041 crule: c -> k, id: 6, possubterms: c-> [] 63.041/63.041 crule: d -> k, id: 7, possubterms: d-> [] 63.041/63.041 crule: f(x2:S) -> x2:S | x2:S ->* e, id: 8, possubterms: f(x2:S)-> [] 63.041/63.041 crule: h(x3:S) -> i(x3:S,x3:S), id: 9, possubterms: h(x3:S)-> [] 63.041/63.041 63.041/63.041 -> Unifications: 63.041/63.041 R2 unifies with R1 at p: [], l: a, lp: a, conds: {}, sig: {}, l': a, r: d, r': c 63.041/63.041 R4 unifies with R3 at p: [], l: b, lp: b, conds: {}, sig: {}, l': b, r: d, r': c 63.041/63.041 R6 unifies with R5 at p: [], l: c, lp: c, conds: {}, sig: {}, l': c, r: k, r': e 63.041/63.041 63.041/63.041 -> Critical pairs info: 63.041/63.041 => Not trivial, Overlay, N1 63.041/63.041 => Not trivial, Overlay, N2 63.041/63.041 63.041/63.041 -> Problem conclusions: 63.041/63.041 Left linear, Not right linear, Not linear 63.041/63.041 Not weakly orthogonal, Not almost orthogonal, Not orthogonal 63.041/63.041 CTRS Type: 1 63.041/63.041 Deterministic, Strongly deterministic 63.041/63.041 Oriented CTRS, Properly oriented CTRS, Not join CTRS 63.041/63.041 Maybe right-stable CTRS, Overlay CTRS 63.041/63.041 Maybe normal CTRS, Maybe almost normal CTRS 63.041/63.041 Maybe terminating CTRS, Maybe joinable CCPs 63.041/63.041 Maybe level confluent 63.041/63.041 Maybe confluent 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 Confluence Problem: 63.041/63.041 (VAR x:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (g 1 2) 63.041/63.041 (h 1) 63.041/63.041 (A) 63.041/63.041 (B) 63.041/63.041 (C) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 ) 63.041/63.041 Critical Pairs: 63.041/63.041 => Not trivial, Overlay, N1 63.041/63.041 => Not trivial, Overlay, N2 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 63.041/63.041 Conditional Critical Pairs Distributor Processor 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 Confluence Problem: 63.041/63.041 (VAR x:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (g 1 2) 63.041/63.041 (h 1) 63.041/63.041 (A) 63.041/63.041 (B) 63.041/63.041 (C) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 ) 63.041/63.041 Critical Pairs: 63.041/63.041 => Not trivial, Overlay, N1 63.041/63.041 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 63.041/63.041 63.041/63.041 InfChecker Different Ground and Normal No Conditions CCP Terms Processor: 63.041/63.041 Proof: 63.041/63.041 YES 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Infeasibility Problem: 63.041/63.041 [(VAR vNonEmpty:S x:S y:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (h 1) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 )] 63.041/63.041 63.041/63.041 Infeasibility Conditions: 63.041/63.041 e -> y:S 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Obtaining a model using Mace4: 63.041/63.041 63.041/63.041 -> Usable Rules: 63.041/63.041 Empty 63.041/63.041 63.041/63.041 -> Mace4 Output: 63.041/63.041 ============================== Mace4 ================================= 63.041/63.041 Mace4 (64) version 2009-11A, November 2009. 63.041/63.041 Process 50264 was started by ubuntu on ubuntu, 63.041/63.041 Wed Jul 14 10:54:16 2021 63.041/63.041 The command was "./mace4 -c -f /tmp/mace450237-2.in". 63.041/63.041 ============================== end of head =========================== 63.041/63.041 63.041/63.041 ============================== INPUT ================================= 63.041/63.041 63.041/63.041 % Reading from file /tmp/mace450237-2.in 63.041/63.041 63.041/63.041 assign(max_seconds,6). 63.041/63.041 63.041/63.041 formulas(assumptions). 63.041/63.041 ->(x1,y) -> ->(f(x1),f(y)) # label(congruence). 63.041/63.041 ->(x1,y) -> ->(h(x1),h(y)) # label(congruence). 63.041/63.041 ->(x1,y) -> ->(i(x1,x2),i(y,x2)) # label(congruence). 63.041/63.041 ->(x2,y) -> ->(i(x1,x2),i(x1,y)) # label(congruence). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 formulas(goals). 63.041/63.041 (exists x2 ->(e,x2)) # label(goal). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 ============================== end of input ========================== 63.041/63.041 63.041/63.041 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 63.041/63.041 63.041/63.041 % Formulas that are not ordinary clauses: 63.041/63.041 1 ->(x1,y) -> ->(f(x1),f(y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 2 ->(x1,y) -> ->(h(x1),h(y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 3 ->(x1,y) -> ->(i(x1,x2),i(y,x2)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 4 ->(x2,y) -> ->(i(x1,x2),i(x1,y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 5 (exists x2 ->(e,x2)) # label(goal) # label(non_clause) # label(goal). [goal]. 63.041/63.041 63.041/63.041 ============================== end of process non-clausal formulas === 63.041/63.041 63.041/63.041 ============================== CLAUSES FOR SEARCH ==================== 63.041/63.041 63.041/63.041 formulas(mace4_clauses). 63.041/63.041 -->(x,y) | ->(f(x),f(y)) # label(congruence). 63.041/63.041 -->(x,y) | ->(h(x),h(y)) # label(congruence). 63.041/63.041 -->(x,y) | ->(i(x,z),i(y,z)) # label(congruence). 63.041/63.041 -->(x,y) | ->(i(z,x),i(z,y)) # label(congruence). 63.041/63.041 -->(e,x) # label(goal). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 ============================== end of clauses for search ============= 63.041/63.041 63.041/63.041 % There are no natural numbers in the input. 63.041/63.041 63.041/63.041 ============================== DOMAIN SIZE 2 ========================= 63.041/63.041 63.041/63.041 ============================== MODEL ================================= 63.041/63.041 63.041/63.041 interpretation( 2, [number=1, seconds=0], [ 63.041/63.041 63.041/63.041 function(e, [ 0 ]), 63.041/63.041 63.041/63.041 function(f(_), [ 0, 0 ]), 63.041/63.041 63.041/63.041 function(h(_), [ 0, 0 ]), 63.041/63.041 63.041/63.041 function(i(_,_), [ 63.041/63.041 0, 0, 63.041/63.041 0, 0 ]), 63.041/63.041 63.041/63.041 relation(->(_,_), [ 63.041/63.041 0, 0, 63.041/63.041 0, 0 ]) 63.041/63.041 ]). 63.041/63.041 63.041/63.041 ============================== end of model ========================== 63.041/63.041 63.041/63.041 ============================== STATISTICS ============================ 63.041/63.041 63.041/63.041 For domain size 2. 63.041/63.041 63.041/63.041 Current CPU time: 0.00 seconds (total CPU time: 0.00 seconds). 63.041/63.041 Ground clauses: seen=26, kept=26. 63.041/63.041 Selections=9, assignments=9, propagations=4, current_models=1. 63.041/63.041 Rewrite_terms=50, rewrite_bools=28, indexes=2. 63.041/63.041 Rules_from_neg_clauses=0, cross_offs=0. 63.041/63.041 63.041/63.041 ============================== end of statistics ===================== 63.041/63.041 63.041/63.041 User_CPU=0.00, System_CPU=0.00, Wall_clock=0. 63.041/63.041 63.041/63.041 Exiting with 1 model. 63.041/63.041 63.041/63.041 Process 50264 exit (max_models) Wed Jul 14 10:54:16 2021 63.041/63.041 The process finished Wed Jul 14 10:54:16 2021 63.041/63.041 63.041/63.041 63.041/63.041 Mace4 cooked interpretation: 63.041/63.041 63.041/63.041 63.041/63.041 63.041/63.041 The problem is infeasible. 63.041/63.041 YES 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Infeasibility Problem: 63.041/63.041 [(VAR vNonEmpty:S x:S) 63.041/63.041 (STRATEGY CONTEXTSENSITIVE 63.041/63.041 (a) 63.041/63.041 (b) 63.041/63.041 (c) 63.041/63.041 (d) 63.041/63.041 (f 1) 63.041/63.041 (h 1) 63.041/63.041 (e) 63.041/63.041 (fSNonEmpty) 63.041/63.041 (i 1 2) 63.041/63.041 (k) 63.041/63.041 ) 63.041/63.041 (RULES 63.041/63.041 a -> c 63.041/63.041 a -> d 63.041/63.041 b -> c 63.041/63.041 b -> d 63.041/63.041 c -> e 63.041/63.041 c -> k 63.041/63.041 d -> k 63.041/63.041 f(x:S) -> x:S | x:S ->* e 63.041/63.041 h(x:S) -> i(x:S,x:S) 63.041/63.041 )] 63.041/63.041 63.041/63.041 Infeasibility Conditions: 63.041/63.041 k -> x:S 63.041/63.041 63.041/63.041 Problem 1: 63.041/63.041 63.041/63.041 Obtaining a model using Mace4: 63.041/63.041 63.041/63.041 -> Usable Rules: 63.041/63.041 Empty 63.041/63.041 63.041/63.041 -> Mace4 Output: 63.041/63.041 ============================== Mace4 ================================= 63.041/63.041 Mace4 (64) version 2009-11A, November 2009. 63.041/63.041 Process 50303 was started by ubuntu on ubuntu, 63.041/63.041 Wed Jul 14 10:54:36 2021 63.041/63.041 The command was "./mace4 -c -f /tmp/mace450290-2.in". 63.041/63.041 ============================== end of head =========================== 63.041/63.041 63.041/63.041 ============================== INPUT ================================= 63.041/63.041 63.041/63.041 % Reading from file /tmp/mace450290-2.in 63.041/63.041 63.041/63.041 assign(max_seconds,6). 63.041/63.041 63.041/63.041 formulas(assumptions). 63.041/63.041 ->(x1,y) -> ->(f(x1),f(y)) # label(congruence). 63.041/63.041 ->(x1,y) -> ->(h(x1),h(y)) # label(congruence). 63.041/63.041 ->(x1,y) -> ->(i(x1,x2),i(y,x2)) # label(congruence). 63.041/63.041 ->(x2,y) -> ->(i(x1,x2),i(x1,y)) # label(congruence). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 formulas(goals). 63.041/63.041 (exists x1 ->(k,x1)) # label(goal). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 ============================== end of input ========================== 63.041/63.041 63.041/63.041 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 63.041/63.041 63.041/63.041 % Formulas that are not ordinary clauses: 63.041/63.041 1 ->(x1,y) -> ->(f(x1),f(y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 2 ->(x1,y) -> ->(h(x1),h(y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 3 ->(x1,y) -> ->(i(x1,x2),i(y,x2)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 4 ->(x2,y) -> ->(i(x1,x2),i(x1,y)) # label(congruence) # label(non_clause). [assumption]. 63.041/63.041 5 (exists x1 ->(k,x1)) # label(goal) # label(non_clause) # label(goal). [goal]. 63.041/63.041 63.041/63.041 ============================== end of process non-clausal formulas === 63.041/63.041 63.041/63.041 ============================== CLAUSES FOR SEARCH ==================== 63.041/63.041 63.041/63.041 formulas(mace4_clauses). 63.041/63.041 -->(x,y) | ->(f(x),f(y)) # label(congruence). 63.041/63.041 -->(x,y) | ->(h(x),h(y)) # label(congruence). 63.041/63.041 -->(x,y) | ->(i(x,z),i(y,z)) # label(congruence). 63.041/63.041 -->(x,y) | ->(i(z,x),i(z,y)) # label(congruence). 63.041/63.041 -->(k,x) # label(goal). 63.041/63.041 end_of_list. 63.041/63.041 63.041/63.041 ============================== end of clauses for search ============= 63.041/63.041 63.041/63.041 % There are no natural numbers in the input. 63.041/63.041 63.041/63.041 ============================== DOMAIN SIZE 2 ========================= 63.041/63.041 63.041/63.041 ============================== MODEL ================================= 63.041/63.041 63.041/63.041 interpretation( 2, [number=1, seconds=0], [ 63.041/63.041 63.041/63.041 function(k, [ 0 ]), 63.041/63.041 63.041/63.041 function(f(_), [ 0, 0 ]), 63.041/63.041 63.041/63.041 function(h(_), [ 0, 0 ]), 63.041/63.041 63.041/63.041 function(i(_,_), [ 63.041/63.041 0, 0, 63.041/63.041 0, 0 ]), 63.041/63.041 63.041/63.041 relation(->(_,_), [ 63.041/63.041 0, 0, 63.041/63.041 0, 0 ]) 63.041/63.041 ]). 63.041/63.041 63.041/63.041 ============================== end of model ========================== 63.041/63.041 63.041/63.041 ============================== STATISTICS ============================ 63.041/63.041 63.041/63.041 For domain size 2. 63.041/63.041 63.041/63.041 Current CPU time: 0.00 seconds (total CPU time: 0.00 seconds). 63.041/63.041 Ground clauses: seen=26, kept=26. 63.041/63.041 Selections=9, assignments=9, propagations=4, current_models=1. 63.041/63.041 Rewrite_terms=50, rewrite_bools=28, indexes=2. 63.041/63.041 Rules_from_neg_clauses=0, cross_offs=0. 63.041/63.041 63.041/63.041 ============================== end of statistics ===================== 63.041/63.041 63.041/63.041 User_CPU=0.00, System_CPU=0.00, Wall_clock=0. 63.041/63.041 63.041/63.041 Exiting with 1 model. 63.041/63.041 63.041/63.041 Process 50303 exit (max_models) Wed Jul 14 10:54:36 2021 63.041/63.041 The process finished Wed Jul 14 10:54:36 2021 63.041/63.041 63.041/63.041 63.041/63.041 Mace4 cooked interpretation: 63.041/63.041 63.041/63.041 63.041/63.041 63.041/63.041 The problem is infeasible. 63.041/63.041 63.041/63.041 63.041/63.041 The problem is not joinable. 63.041/63.041 81.55user 4.54system 1:03.41elapsed 135%CPU (0avgtext+0avgdata 1967024maxresident)k 63.041/63.041 0inputs+0outputs (0major+1303713minor)pagefaults 0swaps