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