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