20.036/20.036 NO 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 20.036/20.036 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 Confluence Problem: 20.036/20.036 (VAR vNonEmpty:S x:S y:S) 20.036/20.036 (STRATEGY CONTEXTSENSITIVE 20.036/20.036 (a) 20.036/20.036 (f 1) 20.036/20.036 (g 1 2) 20.036/20.036 (b) 20.036/20.036 (c) 20.036/20.036 (fSNonEmpty) 20.036/20.036 (h 1) 20.036/20.036 ) 20.036/20.036 (RULES 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S) -> y:S | a ->* h(y:S) 20.036/20.036 g(x:S,b) -> g(f(c),x:S) | f(b) ->* x:S, x:S ->* c 20.036/20.036 ) 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 20.036/20.036 Inlining of Conditions Processor [STERN17]: 20.036/20.036 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 Confluence Problem: 20.036/20.036 (VAR vNonEmpty:S x:S y:S) 20.036/20.036 (STRATEGY CONTEXTSENSITIVE 20.036/20.036 (a) 20.036/20.036 (f 1) 20.036/20.036 (g 1 2) 20.036/20.036 (b) 20.036/20.036 (c) 20.036/20.036 (fSNonEmpty) 20.036/20.036 (h 1) 20.036/20.036 ) 20.036/20.036 (RULES 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S) -> y:S | a ->* h(y:S) 20.036/20.036 g(x:S,b) -> g(f(c),x:S) | f(b) ->* x:S, x:S ->* c 20.036/20.036 ) 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 20.036/20.036 Clean CTRS Processor: 20.036/20.036 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 Confluence Problem: 20.036/20.036 (VAR x:S y:S) 20.036/20.036 (STRATEGY CONTEXTSENSITIVE 20.036/20.036 (a) 20.036/20.036 (f 1) 20.036/20.036 (g 1 2) 20.036/20.036 (b) 20.036/20.036 (c) 20.036/20.036 (fSNonEmpty) 20.036/20.036 (h 1) 20.036/20.036 ) 20.036/20.036 (RULES 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S) -> y:S | a ->* h(y:S) 20.036/20.036 g(x:S,b) -> g(f(c),x:S) | f(b) ->* x:S, x:S ->* c 20.036/20.036 ) 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 20.036/20.036 CRule InfChecker Info: 20.036/20.036 a -> h(b) 20.036/20.036 Rule remains 20.036/20.036 Proof: 20.036/20.036 NO_CONDS 20.036/20.036 20.036/20.036 CRule InfChecker Info: 20.036/20.036 a -> h(c) 20.036/20.036 Rule remains 20.036/20.036 Proof: 20.036/20.036 NO_CONDS 20.036/20.036 20.036/20.036 CRule InfChecker Info: 20.036/20.036 f(x:S) -> y:S | a ->* h(y:S) 20.036/20.036 Rule remains 20.036/20.036 Proof: 20.036/20.036 NO 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 20.036/20.036 Infeasibility Problem: 20.036/20.036 [(VAR vNonEmpty:S vNonEmpty:S:S x:S:S y:S:S) 20.036/20.036 (STRATEGY CONTEXTSENSITIVE 20.036/20.036 (a) 20.036/20.036 (f 1) 20.036/20.036 (g 1 2) 20.036/20.036 (b) 20.036/20.036 (c) 20.036/20.036 (fSNonEmpty) 20.036/20.036 (h 1) 20.036/20.036 ) 20.036/20.036 (RULES 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S:S) -> y:S:S | a ->* h(y:S:S) 20.036/20.036 g(x:S:S,b) -> g(f(c),x:S:S) | f(b) ->* x:S:S, x:S:S ->* c 20.036/20.036 )] 20.036/20.036 20.036/20.036 Infeasibility Conditions: 20.036/20.036 a ->* h(y:S:S) 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 20.036/20.036 Obtaining a proof using Prover9: 20.036/20.036 20.036/20.036 -> Prover9 Output: 20.036/20.036 ============================== Prover9 =============================== 20.036/20.036 Prover9 (64) version 2009-11A, November 2009. 20.036/20.036 Process 109026 was started by ubuntu on ubuntu, 20.036/20.036 Fri Jul 16 15:03:02 2021 20.036/20.036 The command was "./prover9 -f /tmp/prover9109017-0.in". 20.036/20.036 ============================== end of head =========================== 20.036/20.036 20.036/20.036 ============================== INPUT ================================= 20.036/20.036 20.036/20.036 % Reading from file /tmp/prover9109017-0.in 20.036/20.036 20.036/20.036 assign(max_seconds,20). 20.036/20.036 20.036/20.036 formulas(assumptions). 20.036/20.036 ->*_s0(x,x) # label(reflexivity). 20.036/20.036 ->_s0(x,y) & ->*_s0(y,z) -> ->*_s0(x,z) # label(transitivity). 20.036/20.036 ->_s0(x1,y) -> ->_s0(f(x1),f(y)) # label(congruence). 20.036/20.036 ->_s0(x1,y) -> ->_s0(g(x1,x2),g(y,x2)) # label(congruence). 20.036/20.036 ->_s0(x2,y) -> ->_s0(g(x1,x2),g(x1,y)) # label(congruence). 20.036/20.036 ->_s0(x1,y) -> ->_s0(h(x1),h(y)) # label(congruence). 20.036/20.036 ->_s0(a,h(b)) # label(replacement). 20.036/20.036 ->_s0(a,h(c)) # label(replacement). 20.036/20.036 ->*_s0(a,h(x3)) -> ->_s0(f(x2),x3) # label(replacement). 20.036/20.036 ->*_s0(f(b),x2) & ->*_s0(x2,c) -> ->_s0(g(x2,b),g(f(c),x2)) # label(replacement). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(goals). 20.036/20.036 (exists x3 ->*_s0(a,h(x3))) # label(goal). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 ============================== end of input ========================== 20.036/20.036 20.036/20.036 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 20.036/20.036 20.036/20.036 % Formulas that are not ordinary clauses: 20.036/20.036 1 ->_s0(x,y) & ->*_s0(y,z) -> ->*_s0(x,z) # label(transitivity) # label(non_clause). [assumption]. 20.036/20.036 2 ->_s0(x1,y) -> ->_s0(f(x1),f(y)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 3 ->_s0(x1,y) -> ->_s0(g(x1,x2),g(y,x2)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 4 ->_s0(x2,y) -> ->_s0(g(x1,x2),g(x1,y)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 5 ->_s0(x1,y) -> ->_s0(h(x1),h(y)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 6 ->*_s0(a,h(x3)) -> ->_s0(f(x2),x3) # label(replacement) # label(non_clause). [assumption]. 20.036/20.036 7 ->*_s0(f(b),x2) & ->*_s0(x2,c) -> ->_s0(g(x2,b),g(f(c),x2)) # label(replacement) # label(non_clause). [assumption]. 20.036/20.036 8 (exists x3 ->*_s0(a,h(x3))) # label(goal) # label(non_clause) # label(goal). [goal]. 20.036/20.036 20.036/20.036 ============================== end of process non-clausal formulas === 20.036/20.036 20.036/20.036 ============================== PROCESS INITIAL CLAUSES =============== 20.036/20.036 20.036/20.036 % Clauses before input processing: 20.036/20.036 20.036/20.036 formulas(usable). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(sos). 20.036/20.036 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 20.036/20.036 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 20.036/20.036 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 20.036/20.036 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 20.036/20.036 ->_s0(a,h(b)) # label(replacement). [assumption]. 20.036/20.036 ->_s0(a,h(c)) # label(replacement). [assumption]. 20.036/20.036 -->*_s0(a,h(x)) | ->_s0(f(y),x) # label(replacement). [clausify(6)]. 20.036/20.036 -->*_s0(f(b),x) | -->*_s0(x,c) | ->_s0(g(x,b),g(f(c),x)) # label(replacement). [clausify(7)]. 20.036/20.036 -->*_s0(a,h(x)) # label(goal). [deny(8)]. 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(demodulators). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 ============================== PREDICATE ELIMINATION ================= 20.036/20.036 20.036/20.036 No predicates eliminated. 20.036/20.036 20.036/20.036 ============================== end predicate elimination ============= 20.036/20.036 20.036/20.036 Auto_denials: 20.036/20.036 % copying label goal to answer in negative clause 20.036/20.036 20.036/20.036 Term ordering decisions: 20.036/20.036 Predicate symbol precedence: predicate_order([ ->_s0, ->*_s0 ]). 20.036/20.036 Function symbol precedence: function_order([ a, b, c, g, f, h ]). 20.036/20.036 After inverse_order: (no changes). 20.036/20.036 Unfolding symbols: (none). 20.036/20.036 20.036/20.036 Auto_inference settings: 20.036/20.036 % set(neg_binary_resolution). % (HNE depth_diff=-5) 20.036/20.036 % clear(ordered_res). % (HNE depth_diff=-5) 20.036/20.036 % set(ur_resolution). % (HNE depth_diff=-5) 20.036/20.036 % set(ur_resolution) -> set(pos_ur_resolution). 20.036/20.036 % set(ur_resolution) -> set(neg_ur_resolution). 20.036/20.036 20.036/20.036 Auto_process settings: (no changes). 20.036/20.036 20.036/20.036 kept: 9 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 kept: 10 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 kept: 11 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 20.036/20.036 kept: 12 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 20.036/20.036 kept: 13 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 20.036/20.036 kept: 14 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 20.036/20.036 kept: 15 ->_s0(a,h(b)) # label(replacement). [assumption]. 20.036/20.036 kept: 16 ->_s0(a,h(c)) # label(replacement). [assumption]. 20.036/20.036 kept: 17 -->*_s0(a,h(x)) | ->_s0(f(y),x) # label(replacement). [clausify(6)]. 20.036/20.036 kept: 18 -->*_s0(f(b),x) | -->*_s0(x,c) | ->_s0(g(x,b),g(f(c),x)) # label(replacement). [clausify(7)]. 20.036/20.036 kept: 19 -->*_s0(a,h(x)) # label(goal) # answer(goal). [deny(8)]. 20.036/20.036 20.036/20.036 ============================== end of process initial clauses ======== 20.036/20.036 20.036/20.036 ============================== CLAUSES FOR SEARCH ==================== 20.036/20.036 20.036/20.036 % Clauses after input processing: 20.036/20.036 20.036/20.036 formulas(usable). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(sos). 20.036/20.036 9 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 10 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 11 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 20.036/20.036 12 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 20.036/20.036 13 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 20.036/20.036 14 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 20.036/20.036 15 ->_s0(a,h(b)) # label(replacement). [assumption]. 20.036/20.036 16 ->_s0(a,h(c)) # label(replacement). [assumption]. 20.036/20.036 18 -->*_s0(f(b),x) | -->*_s0(x,c) | ->_s0(g(x,b),g(f(c),x)) # label(replacement). [clausify(7)]. 20.036/20.036 19 -->*_s0(a,h(x)) # label(goal) # answer(goal). [deny(8)]. 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(demodulators). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 ============================== end of clauses for search ============= 20.036/20.036 20.036/20.036 ============================== SEARCH ================================ 20.036/20.036 20.036/20.036 % Starting search at 0.00 seconds. 20.036/20.036 20.036/20.036 given #1 (I,wt=3): 9 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 20.036/20.036 given #2 (I,wt=9): 10 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 20.036/20.036 given #3 (I,wt=8): 11 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 20.036/20.036 20.036/20.036 given #4 (I,wt=10): 12 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 20.036/20.036 20.036/20.036 given #5 (I,wt=10): 13 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 20.036/20.036 20.036/20.036 given #6 (I,wt=8): 14 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 20.036/20.036 20.036/20.036 given #7 (I,wt=4): 15 ->_s0(a,h(b)) # label(replacement). [assumption]. 20.036/20.036 20.036/20.036 ============================== PROOF ================================= 20.036/20.036 20.036/20.036 % Proof 1 at 0.00 (+ 0.00) seconds: goal. 20.036/20.036 % Length of proof is 8. 20.036/20.036 % Level of proof is 3. 20.036/20.036 % Maximum clause weight is 9.000. 20.036/20.036 % Given clauses 7. 20.036/20.036 20.036/20.036 1 ->_s0(x,y) & ->*_s0(y,z) -> ->*_s0(x,z) # label(transitivity) # label(non_clause). [assumption]. 20.036/20.036 8 (exists x3 ->*_s0(a,h(x3))) # label(goal) # label(non_clause) # label(goal). [goal]. 20.036/20.036 9 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 10 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 15 ->_s0(a,h(b)) # label(replacement). [assumption]. 20.036/20.036 19 -->*_s0(a,h(x)) # label(goal) # answer(goal). [deny(8)]. 20.036/20.036 24 ->*_s0(a,h(b)). [ur(10,a,15,a,b,9,a)]. 20.036/20.036 25 $F # answer(goal). [resolve(24,a,19,a)]. 20.036/20.036 20.036/20.036 ============================== end of proof ========================== 20.036/20.036 20.036/20.036 ============================== STATISTICS ============================ 20.036/20.036 20.036/20.036 Given=7. Generated=16. Kept=16. proofs=1. 20.036/20.036 Usable=7. Sos=3. Demods=0. Limbo=4, Disabled=12. Hints=0. 20.036/20.036 Kept_by_rule=0, Deleted_by_rule=0. 20.036/20.036 Forward_subsumed=0. Back_subsumed=1. 20.036/20.036 Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. 20.036/20.036 New_demodulators=0 (0 lex), Back_demodulated=0. Back_unit_deleted=0. 20.036/20.036 Demod_attempts=0. Demod_rewrites=0. 20.036/20.036 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. 20.036/20.036 Nonunit_fsub_feature_tests=1. Nonunit_bsub_feature_tests=11. 20.036/20.036 Megabytes=0.07. 20.036/20.036 User_CPU=0.00, System_CPU=0.00, Wall_clock=0. 20.036/20.036 20.036/20.036 ============================== end of statistics ===================== 20.036/20.036 20.036/20.036 ============================== end of search ========================= 20.036/20.036 20.036/20.036 THEOREM PROVED 20.036/20.036 20.036/20.036 Exiting with 1 proof. 20.036/20.036 20.036/20.036 Process 109026 exit (max_proofs) Fri Jul 16 15:03:02 2021 20.036/20.036 20.036/20.036 20.036/20.036 The problem is feasible. 20.036/20.036 20.036/20.036 20.036/20.036 CRule InfChecker Info: 20.036/20.036 g(x:S,b) -> g(f(c),x:S) | f(b) ->* x:S, x:S ->* c 20.036/20.036 Rule remains 20.036/20.036 Proof: 20.036/20.036 NO 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 20.036/20.036 Infeasibility Problem: 20.036/20.036 [(VAR vNonEmpty:S vNonEmpty:S:S x:S:S y:S:S) 20.036/20.036 (STRATEGY CONTEXTSENSITIVE 20.036/20.036 (a) 20.036/20.036 (f 1) 20.036/20.036 (g 1 2) 20.036/20.036 (b) 20.036/20.036 (c) 20.036/20.036 (fSNonEmpty) 20.036/20.036 (h 1) 20.036/20.036 ) 20.036/20.036 (RULES 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S:S) -> y:S:S | a ->* h(y:S:S) 20.036/20.036 g(x:S:S,b) -> g(f(c),x:S:S) | f(b) ->* x:S:S, x:S:S ->* c 20.036/20.036 )] 20.036/20.036 20.036/20.036 Infeasibility Conditions: 20.036/20.036 f(b) ->* x:S:S, x:S:S ->* c 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 20.036/20.036 Obtaining a proof using Prover9: 20.036/20.036 20.036/20.036 -> Prover9 Output: 20.036/20.036 ============================== Prover9 =============================== 20.036/20.036 Prover9 (64) version 2009-11A, November 2009. 20.036/20.036 Process 109048 was started by ubuntu on ubuntu, 20.036/20.036 Fri Jul 16 15:03:02 2021 20.036/20.036 The command was "./prover9 -f /tmp/prover9109039-0.in". 20.036/20.036 ============================== end of head =========================== 20.036/20.036 20.036/20.036 ============================== INPUT ================================= 20.036/20.036 20.036/20.036 % Reading from file /tmp/prover9109039-0.in 20.036/20.036 20.036/20.036 assign(max_seconds,20). 20.036/20.036 20.036/20.036 formulas(assumptions). 20.036/20.036 ->*_s0(x,x) # label(reflexivity). 20.036/20.036 ->_s0(x,y) & ->*_s0(y,z) -> ->*_s0(x,z) # label(transitivity). 20.036/20.036 ->_s0(x1,y) -> ->_s0(f(x1),f(y)) # label(congruence). 20.036/20.036 ->_s0(x1,y) -> ->_s0(g(x1,x2),g(y,x2)) # label(congruence). 20.036/20.036 ->_s0(x2,y) -> ->_s0(g(x1,x2),g(x1,y)) # label(congruence). 20.036/20.036 ->_s0(x1,y) -> ->_s0(h(x1),h(y)) # label(congruence). 20.036/20.036 ->_s0(a,h(b)) # label(replacement). 20.036/20.036 ->_s0(a,h(c)) # label(replacement). 20.036/20.036 ->*_s0(a,h(x3)) -> ->_s0(f(x2),x3) # label(replacement). 20.036/20.036 ->*_s0(f(b),x2) & ->*_s0(x2,c) -> ->_s0(g(x2,b),g(f(c),x2)) # label(replacement). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(goals). 20.036/20.036 (exists x2 (->*_s0(f(b),x2) & ->*_s0(x2,c))) # label(goal). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 ============================== end of input ========================== 20.036/20.036 20.036/20.036 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 20.036/20.036 20.036/20.036 % Formulas that are not ordinary clauses: 20.036/20.036 1 ->_s0(x,y) & ->*_s0(y,z) -> ->*_s0(x,z) # label(transitivity) # label(non_clause). [assumption]. 20.036/20.036 2 ->_s0(x1,y) -> ->_s0(f(x1),f(y)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 3 ->_s0(x1,y) -> ->_s0(g(x1,x2),g(y,x2)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 4 ->_s0(x2,y) -> ->_s0(g(x1,x2),g(x1,y)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 5 ->_s0(x1,y) -> ->_s0(h(x1),h(y)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 6 ->*_s0(a,h(x3)) -> ->_s0(f(x2),x3) # label(replacement) # label(non_clause). [assumption]. 20.036/20.036 7 ->*_s0(f(b),x2) & ->*_s0(x2,c) -> ->_s0(g(x2,b),g(f(c),x2)) # label(replacement) # label(non_clause). [assumption]. 20.036/20.036 8 (exists x2 (->*_s0(f(b),x2) & ->*_s0(x2,c))) # label(goal) # label(non_clause) # label(goal). [goal]. 20.036/20.036 20.036/20.036 ============================== end of process non-clausal formulas === 20.036/20.036 20.036/20.036 ============================== PROCESS INITIAL CLAUSES =============== 20.036/20.036 20.036/20.036 % Clauses before input processing: 20.036/20.036 20.036/20.036 formulas(usable). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(sos). 20.036/20.036 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 20.036/20.036 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 20.036/20.036 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 20.036/20.036 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 20.036/20.036 ->_s0(a,h(b)) # label(replacement). [assumption]. 20.036/20.036 ->_s0(a,h(c)) # label(replacement). [assumption]. 20.036/20.036 -->*_s0(a,h(x)) | ->_s0(f(y),x) # label(replacement). [clausify(6)]. 20.036/20.036 -->*_s0(f(b),x) | -->*_s0(x,c) | ->_s0(g(x,b),g(f(c),x)) # label(replacement). [clausify(7)]. 20.036/20.036 -->*_s0(f(b),x) | -->*_s0(x,c) # label(goal). [deny(8)]. 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(demodulators). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 ============================== PREDICATE ELIMINATION ================= 20.036/20.036 20.036/20.036 No predicates eliminated. 20.036/20.036 20.036/20.036 ============================== end predicate elimination ============= 20.036/20.036 20.036/20.036 Auto_denials: 20.036/20.036 % copying label goal to answer in negative clause 20.036/20.036 20.036/20.036 Term ordering decisions: 20.036/20.036 Predicate symbol precedence: predicate_order([ ->_s0, ->*_s0 ]). 20.036/20.036 Function symbol precedence: function_order([ a, b, c, g, f, h ]). 20.036/20.036 After inverse_order: (no changes). 20.036/20.036 Unfolding symbols: (none). 20.036/20.036 20.036/20.036 Auto_inference settings: 20.036/20.036 % set(neg_binary_resolution). % (HNE depth_diff=-5) 20.036/20.036 % clear(ordered_res). % (HNE depth_diff=-5) 20.036/20.036 % set(ur_resolution). % (HNE depth_diff=-5) 20.036/20.036 % set(ur_resolution) -> set(pos_ur_resolution). 20.036/20.036 % set(ur_resolution) -> set(neg_ur_resolution). 20.036/20.036 20.036/20.036 Auto_process settings: 20.036/20.036 % set(unit_deletion). % (Horn set with negative nonunits) 20.036/20.036 20.036/20.036 kept: 9 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 kept: 10 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 kept: 11 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 20.036/20.036 kept: 12 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 20.036/20.036 kept: 13 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 20.036/20.036 kept: 14 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 20.036/20.036 kept: 15 ->_s0(a,h(b)) # label(replacement). [assumption]. 20.036/20.036 kept: 16 ->_s0(a,h(c)) # label(replacement). [assumption]. 20.036/20.036 kept: 17 -->*_s0(a,h(x)) | ->_s0(f(y),x) # label(replacement). [clausify(6)]. 20.036/20.036 kept: 18 -->*_s0(f(b),x) | -->*_s0(x,c) | ->_s0(g(x,b),g(f(c),x)) # label(replacement). [clausify(7)]. 20.036/20.036 kept: 19 -->*_s0(f(b),x) | -->*_s0(x,c) # label(goal) # answer(goal). [deny(8)]. 20.036/20.036 20.036/20.036 ============================== end of process initial clauses ======== 20.036/20.036 20.036/20.036 ============================== CLAUSES FOR SEARCH ==================== 20.036/20.036 20.036/20.036 % Clauses after input processing: 20.036/20.036 20.036/20.036 formulas(usable). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(sos). 20.036/20.036 9 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 10 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 11 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 20.036/20.036 12 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 20.036/20.036 13 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 20.036/20.036 14 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 20.036/20.036 15 ->_s0(a,h(b)) # label(replacement). [assumption]. 20.036/20.036 16 ->_s0(a,h(c)) # label(replacement). [assumption]. 20.036/20.036 17 -->*_s0(a,h(x)) | ->_s0(f(y),x) # label(replacement). [clausify(6)]. 20.036/20.036 19 -->*_s0(f(b),x) | -->*_s0(x,c) # label(goal) # answer(goal). [deny(8)]. 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(demodulators). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 ============================== end of clauses for search ============= 20.036/20.036 20.036/20.036 ============================== SEARCH ================================ 20.036/20.036 20.036/20.036 % Starting search at 0.00 seconds. 20.036/20.036 20.036/20.036 given #1 (I,wt=3): 9 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 20.036/20.036 given #2 (I,wt=9): 10 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 20.036/20.036 given #3 (I,wt=8): 11 -->_s0(x,y) | ->_s0(f(x),f(y)) # label(congruence). [clausify(2)]. 20.036/20.036 20.036/20.036 given #4 (I,wt=10): 12 -->_s0(x,y) | ->_s0(g(x,z),g(y,z)) # label(congruence). [clausify(3)]. 20.036/20.036 20.036/20.036 given #5 (I,wt=10): 13 -->_s0(x,y) | ->_s0(g(z,x),g(z,y)) # label(congruence). [clausify(4)]. 20.036/20.036 20.036/20.036 given #6 (I,wt=8): 14 -->_s0(x,y) | ->_s0(h(x),h(y)) # label(congruence). [clausify(5)]. 20.036/20.036 20.036/20.036 given #7 (I,wt=4): 15 ->_s0(a,h(b)) # label(replacement). [assumption]. 20.036/20.036 20.036/20.036 given #8 (I,wt=4): 16 ->_s0(a,h(c)) # label(replacement). [assumption]. 20.036/20.036 20.036/20.036 given #9 (I,wt=8): 17 -->*_s0(a,h(x)) | ->_s0(f(y),x) # label(replacement). [clausify(6)]. 20.036/20.036 20.036/20.036 given #10 (I,wt=7): 19 -->*_s0(f(b),x) | -->*_s0(x,c) # label(goal) # answer(goal). [deny(8)]. 20.036/20.036 20.036/20.036 given #11 (A,wt=6): 20 ->_s0(h(a),h(h(b))). [ur(14,a,15,a)]. 20.036/20.036 20.036/20.036 given #12 (F,wt=4): 31 -->*_s0(f(b),c) # answer(goal). [resolve(19,a,9,a)]. 20.036/20.036 20.036/20.036 given #13 (F,wt=4): 39 -->_s0(f(b),c) # answer(goal). [ur(10,b,9,a,c,31,a)]. 20.036/20.036 20.036/20.036 ============================== PROOF ================================= 20.036/20.036 20.036/20.036 % Proof 1 at 0.00 (+ 0.00) seconds: goal. 20.036/20.036 % Length of proof is 12. 20.036/20.036 % Level of proof is 4. 20.036/20.036 % Maximum clause weight is 9.000. 20.036/20.036 % Given clauses 13. 20.036/20.036 20.036/20.036 1 ->_s0(x,y) & ->*_s0(y,z) -> ->*_s0(x,z) # label(transitivity) # label(non_clause). [assumption]. 20.036/20.036 6 ->*_s0(a,h(x3)) -> ->_s0(f(x2),x3) # label(replacement) # label(non_clause). [assumption]. 20.036/20.036 8 (exists x2 (->*_s0(f(b),x2) & ->*_s0(x2,c))) # label(goal) # label(non_clause) # label(goal). [goal]. 20.036/20.036 9 ->*_s0(x,x) # label(reflexivity). [assumption]. 20.036/20.036 10 -->_s0(x,y) | -->*_s0(y,z) | ->*_s0(x,z) # label(transitivity). [clausify(1)]. 20.036/20.036 16 ->_s0(a,h(c)) # label(replacement). [assumption]. 20.036/20.036 17 -->*_s0(a,h(x)) | ->_s0(f(y),x) # label(replacement). [clausify(6)]. 20.036/20.036 19 -->*_s0(f(b),x) | -->*_s0(x,c) # label(goal) # answer(goal). [deny(8)]. 20.036/20.036 29 ->*_s0(a,h(c)). [ur(10,a,16,a,b,9,a)]. 20.036/20.036 31 -->*_s0(f(b),c) # answer(goal). [resolve(19,a,9,a)]. 20.036/20.036 39 -->_s0(f(b),c) # answer(goal). [ur(10,b,9,a,c,31,a)]. 20.036/20.036 40 $F # answer(goal). [resolve(39,a,17,b),unit_del(a,29)]. 20.036/20.036 20.036/20.036 ============================== end of proof ========================== 20.036/20.036 20.036/20.036 ============================== STATISTICS ============================ 20.036/20.036 20.036/20.036 Given=13. Generated=35. Kept=31. proofs=1. 20.036/20.036 Usable=13. Sos=17. Demods=0. Limbo=0, Disabled=12. Hints=0. 20.036/20.036 Kept_by_rule=0, Deleted_by_rule=0. 20.036/20.036 Forward_subsumed=3. Back_subsumed=1. 20.036/20.036 Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. 20.036/20.036 New_demodulators=0 (0 lex), Back_demodulated=0. Back_unit_deleted=0. 20.036/20.036 Demod_attempts=0. Demod_rewrites=0. 20.036/20.036 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. 20.036/20.036 Nonunit_fsub_feature_tests=4. Nonunit_bsub_feature_tests=25. 20.036/20.036 Megabytes=0.09. 20.036/20.036 User_CPU=0.00, System_CPU=0.00, Wall_clock=0. 20.036/20.036 20.036/20.036 ============================== end of statistics ===================== 20.036/20.036 20.036/20.036 ============================== end of search ========================= 20.036/20.036 20.036/20.036 THEOREM PROVED 20.036/20.036 20.036/20.036 Exiting with 1 proof. 20.036/20.036 20.036/20.036 Process 109048 exit (max_proofs) Fri Jul 16 15:03:02 2021 20.036/20.036 20.036/20.036 20.036/20.036 The problem is feasible. 20.036/20.036 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 Confluence Problem: 20.036/20.036 (VAR x:S y:S) 20.036/20.036 (STRATEGY CONTEXTSENSITIVE 20.036/20.036 (a) 20.036/20.036 (f 1) 20.036/20.036 (g 1 2) 20.036/20.036 (b) 20.036/20.036 (c) 20.036/20.036 (fSNonEmpty) 20.036/20.036 (h 1) 20.036/20.036 ) 20.036/20.036 (RULES 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S) -> y:S | a ->* h(y:S) 20.036/20.036 g(x:S,b) -> g(f(c),x:S) | f(b) ->* x:S, x:S ->* c 20.036/20.036 ) 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 20.036/20.036 Critical Pairs Processor: 20.036/20.036 -> Rules: 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S) -> y:S | a ->* h(y:S) 20.036/20.036 g(x:S,b) -> g(f(c),x:S) | f(b) ->* x:S, x:S ->* c 20.036/20.036 -> Vars: 20.036/20.036 "x", "y", "x" 20.036/20.036 -> FVars: 20.036/20.036 "x3", "x4", "x5" 20.036/20.036 -> PVars: 20.036/20.036 "x": ["x3", "x5"], "y": ["x4"] 20.036/20.036 20.036/20.036 -> Rlps: 20.036/20.036 crule: a -> h(b), id: 1, possubterms: a-> [] 20.036/20.036 crule: a -> h(c), id: 2, possubterms: a-> [] 20.036/20.036 crule: f(x3:S) -> x4:S | a ->* h(x4:S), id: 3, possubterms: f(x3:S)-> [] 20.036/20.036 crule: g(x5:S,b) -> g(f(c),x5:S) | f(b) ->* x5:S, x5:S ->* c, id: 4, possubterms: g(x5:S,b)-> [], b-> [2] 20.036/20.036 20.036/20.036 -> Unifications: 20.036/20.036 R2 unifies with R1 at p: [], l: a, lp: a, conds: {}, sig: {}, l': a, r: h(c), r': h(b) 20.036/20.036 20.036/20.036 -> Critical pairs info: 20.036/20.036 => Not trivial, Overlay, N1 20.036/20.036 20.036/20.036 -> Problem conclusions: 20.036/20.036 Left linear, Right linear, Linear 20.036/20.036 Not weakly orthogonal, Not almost orthogonal, Not orthogonal 20.036/20.036 CTRS Type: 3 20.036/20.036 Deterministic, Maybe strongly deterministic 20.036/20.036 Oriented CTRS, Properly oriented CTRS, Not join CTRS 20.036/20.036 Maybe right-stable CTRS, Overlay CTRS 20.036/20.036 Maybe normal CTRS, Maybe almost normal CTRS 20.036/20.036 Maybe terminating CTRS, Maybe joinable CCPs 20.036/20.036 Maybe level confluent 20.036/20.036 Maybe confluent 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 Confluence Problem: 20.036/20.036 (VAR x:S y:S) 20.036/20.036 (STRATEGY CONTEXTSENSITIVE 20.036/20.036 (a) 20.036/20.036 (f 1) 20.036/20.036 (g 1 2) 20.036/20.036 (b) 20.036/20.036 (c) 20.036/20.036 (fSNonEmpty) 20.036/20.036 (h 1) 20.036/20.036 ) 20.036/20.036 (RULES 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S) -> y:S | a ->* h(y:S) 20.036/20.036 g(x:S,b) -> g(f(c),x:S) | f(b) ->* x:S, x:S ->* c 20.036/20.036 ) 20.036/20.036 Critical Pairs: 20.036/20.036 => Not trivial, Overlay, N1 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 20.036/20.036 Conditional Critical Pairs Distributor Processor 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 Confluence Problem: 20.036/20.036 (VAR x:S y:S) 20.036/20.036 (STRATEGY CONTEXTSENSITIVE 20.036/20.036 (a) 20.036/20.036 (f 1) 20.036/20.036 (g 1 2) 20.036/20.036 (b) 20.036/20.036 (c) 20.036/20.036 (fSNonEmpty) 20.036/20.036 (h 1) 20.036/20.036 ) 20.036/20.036 (RULES 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S) -> y:S | a ->* h(y:S) 20.036/20.036 g(x:S,b) -> g(f(c),x:S) | f(b) ->* x:S, x:S ->* c 20.036/20.036 ) 20.036/20.036 Critical Pairs: 20.036/20.036 => Not trivial, Overlay, N1 20.036/20.036 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 20.036/20.036 20.036/20.036 Infeasible Convergence No Conditions CCP Processor: 20.036/20.036 Infeasible convergence? 20.036/20.036 YES 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 20.036/20.036 Infeasibility Problem: 20.036/20.036 [(VAR vNonEmpty:S x:S y:S z:S) 20.036/20.036 (STRATEGY CONTEXTSENSITIVE 20.036/20.036 (a) 20.036/20.036 (f 1) 20.036/20.036 (g 1 2) 20.036/20.036 (b) 20.036/20.036 (c) 20.036/20.036 (fSNonEmpty) 20.036/20.036 (h 1) 20.036/20.036 ) 20.036/20.036 (RULES 20.036/20.036 a -> h(b) 20.036/20.036 a -> h(c) 20.036/20.036 f(x:S) -> y:S | a ->* h(y:S) 20.036/20.036 g(x:S,b) -> g(f(c),x:S) | f(b) ->* x:S, x:S ->* c 20.036/20.036 )] 20.036/20.036 20.036/20.036 Infeasibility Conditions: 20.036/20.036 h(b) ->* z:S, h(c) ->* z:S 20.036/20.036 20.036/20.036 Problem 1: 20.036/20.036 20.036/20.036 Obtaining a model using Mace4: 20.036/20.036 20.036/20.036 -> Usable Rules: 20.036/20.036 Empty 20.036/20.036 20.036/20.036 -> Mace4 Output: 20.036/20.036 ============================== Mace4 ================================= 20.036/20.036 Mace4 (64) version 2009-11A, November 2009. 20.036/20.036 Process 109090 was started by ubuntu on ubuntu, 20.036/20.036 Fri Jul 16 15:03:02 2021 20.036/20.036 The command was "./mace4 -c -f /tmp/mace4109065-2.in". 20.036/20.036 ============================== end of head =========================== 20.036/20.036 20.036/20.036 ============================== INPUT ================================= 20.036/20.036 20.036/20.036 % Reading from file /tmp/mace4109065-2.in 20.036/20.036 20.036/20.036 assign(max_seconds,10). 20.036/20.036 20.036/20.036 formulas(assumptions). 20.036/20.036 ->(x1,y) -> ->(f(x1),f(y)) # label(congruence). 20.036/20.036 ->(x1,y) -> ->(g(x1,x2),g(y,x2)) # label(congruence). 20.036/20.036 ->(x2,y) -> ->(g(x1,x2),g(x1,y)) # label(congruence). 20.036/20.036 ->(x1,y) -> ->(h(x1),h(y)) # label(congruence). 20.036/20.036 ->*(x,x) # label(reflexivity). 20.036/20.036 ->(x,y) & ->*(y,z) -> ->*(x,z) # label(transitivity). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 formulas(goals). 20.036/20.036 (exists x3 (->*(h(b),x3) & ->*(h(c),x3))) # label(goal). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 ============================== end of input ========================== 20.036/20.036 20.036/20.036 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 20.036/20.036 20.036/20.036 % Formulas that are not ordinary clauses: 20.036/20.036 1 ->(x1,y) -> ->(f(x1),f(y)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 2 ->(x1,y) -> ->(g(x1,x2),g(y,x2)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 3 ->(x2,y) -> ->(g(x1,x2),g(x1,y)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 4 ->(x1,y) -> ->(h(x1),h(y)) # label(congruence) # label(non_clause). [assumption]. 20.036/20.036 5 ->(x,y) & ->*(y,z) -> ->*(x,z) # label(transitivity) # label(non_clause). [assumption]. 20.036/20.036 6 (exists x3 (->*(h(b),x3) & ->*(h(c),x3))) # label(goal) # label(non_clause) # label(goal). [goal]. 20.036/20.036 20.036/20.036 ============================== end of process non-clausal formulas === 20.036/20.036 20.036/20.036 ============================== CLAUSES FOR SEARCH ==================== 20.036/20.036 20.036/20.036 formulas(mace4_clauses). 20.036/20.036 -->(x,y) | ->(f(x),f(y)) # label(congruence). 20.036/20.036 -->(x,y) | ->(g(x,z),g(y,z)) # label(congruence). 20.036/20.036 -->(x,y) | ->(g(z,x),g(z,y)) # label(congruence). 20.036/20.036 -->(x,y) | ->(h(x),h(y)) # label(congruence). 20.036/20.036 ->*(x,x) # label(reflexivity). 20.036/20.036 -->(x,y) | -->*(y,z) | ->*(x,z) # label(transitivity). 20.036/20.036 -->*(h(b),x) | -->*(h(c),x) # label(goal). 20.036/20.036 end_of_list. 20.036/20.036 20.036/20.036 ============================== end of clauses for search ============= 20.036/20.036 20.036/20.036 % There are no natural numbers in the input. 20.036/20.036 20.036/20.036 ============================== DOMAIN SIZE 2 ========================= 20.036/20.036 20.036/20.036 ============================== MODEL ================================= 20.036/20.036 20.036/20.036 interpretation( 2, [number=1, seconds=0], [ 20.036/20.036 20.036/20.036 function(b, [ 0 ]), 20.036/20.036 20.036/20.036 function(c, [ 1 ]), 20.036/20.036 20.036/20.036 function(f(_), [ 0, 0 ]), 20.036/20.036 20.036/20.036 function(h(_), [ 0, 1 ]), 20.036/20.036 20.036/20.036 function(g(_,_), [ 20.036/20.036 0, 0, 20.036/20.036 0, 0 ]), 20.036/20.036 20.036/20.036 relation(->*(_,_), [ 20.036/20.036 1, 0, 20.036/20.036 0, 1 ]), 20.036/20.036 20.036/20.036 relation(->(_,_), [ 20.036/20.036 0, 0, 20.036/20.036 0, 0 ]) 20.036/20.036 ]). 20.036/20.036 20.036/20.036 ============================== end of model ========================== 20.036/20.036 20.036/20.036 ============================== STATISTICS ============================ 20.036/20.036 20.036/20.036 For domain size 2. 20.036/20.036 20.036/20.036 Current CPU time: 0.00 seconds (total CPU time: 0.00 seconds). 20.036/20.036 Ground clauses: seen=36, kept=32. 20.036/20.036 Selections=13, assignments=17, propagations=8, current_models=1. 20.036/20.036 Rewrite_terms=80, rewrite_bools=54, indexes=23. 20.036/20.036 Rules_from_neg_clauses=1, cross_offs=1. 20.036/20.036 20.036/20.036 ============================== end of statistics ===================== 20.036/20.036 20.036/20.036 User_CPU=0.00, System_CPU=0.00, Wall_clock=0. 20.036/20.036 20.036/20.036 Exiting with 1 model. 20.036/20.036 20.036/20.036 Process 109090 exit (max_models) Fri Jul 16 15:03:02 2021 20.036/20.036 The process finished Fri Jul 16 15:03:02 2021 20.036/20.036 20.036/20.036 20.036/20.036 Mace4 cooked interpretation: 20.036/20.036 20.036/20.036 20.036/20.036 20.036/20.036 The problem is infeasible. 20.036/20.036 20.036/20.036 20.036/20.036 The problem is not joinable. 20.036/20.036 23.67user 0.86system 0:20.36elapsed 120%CPU (0avgtext+0avgdata 135912maxresident)k 20.036/20.036 8inputs+0outputs (0major+71802minor)pagefaults 0swaps