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