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