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