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