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