%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX217-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:14:17 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 25
% Syntax : Number of clauses : 78 ( 78 unt; 0 nHn; 37 RR)
% Number of literals : 78 ( 77 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 6 con; 0-2 aty)
% Number of variables : 63 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_008,axiom,
evenNat(suc(X1)) = notb(evenNat(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_008) ).
cnf(axiom_007,axiom,
evenNat(zero) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).
cnf(axiom_002,axiom,
notb(btrue) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).
cnf(axiom_003,axiom,
notb(bfalse) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
cnf(axiom_017,axiom,
rd(cons(i,X1)) = suc(double(rd(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_017) ).
cnf(axiom_015,axiom,
double(X1) = addNat(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_015) ).
cnf(axiom_018,axiom,
rd(cons(o,X1)) = double(rd(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_018) ).
cnf(goal,negated_conjecture,
eq2(sat_comm(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(axiom_020,axiom,
sat_comm(X1,X2) = eq(x(X1,X2),x(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_020) ).
cnf(axiom_019,axiom,
x(X1,X2) = rd(append(shw(X1),shw(X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_019) ).
cnf(axiom_010,axiom,
shw(suc(X1)) = aux(X1,evenNat(suc(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_010) ).
cnf(axiom_001,axiom,
aux(X1,bfalse) = cons(i,shw(half(suc(X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_001) ).
cnf(axiom_005,axiom,
half(suc(zero)) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_005) ).
cnf(axiom_009,axiom,
shw(zero) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_009) ).
cnf(axiom_014,axiom,
addNat(suc(X1),X2) = suc(addNat(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_014) ).
cnf(axiom_016,axiom,
rd(nil) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_016) ).
cnf(axiom_013,axiom,
addNat(zero,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_013) ).
cnf(axiom,axiom,
aux(X1,btrue) = cons(o,shw(half(suc(X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom) ).
cnf(axiom_006,axiom,
half(suc(suc(X1))) = suc(half(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).
cnf(axiom_004,axiom,
half(zero) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_004) ).
cnf(axiom_012,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_012) ).
cnf(axiom_011,axiom,
append(nil,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_011) ).
cnf(axiom_025,axiom,
eq(suc(X1),suc(X2)) = eq(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_025) ).
cnf(axiom_027,axiom,
eq(suc(X1),zero) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_027) ).
cnf(axiom_029,axiom,
eq2(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_029) ).
cnf(c_0_25,axiom,
evenNat(suc(X1)) = notb(evenNat(X1)),
axiom_008 ).
cnf(c_0_26,axiom,
evenNat(zero) = btrue,
axiom_007 ).
cnf(c_0_27,axiom,
notb(btrue) = bfalse,
axiom_002 ).
cnf(c_0_28,plain,
evenNat(suc(zero)) = bfalse,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_29,axiom,
notb(bfalse) = btrue,
axiom_003 ).
cnf(c_0_30,plain,
evenNat(suc(suc(zero))) = btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_28]),c_0_29]) ).
cnf(c_0_31,axiom,
rd(cons(i,X1)) = suc(double(rd(X1))),
axiom_017 ).
cnf(c_0_32,axiom,
double(X1) = addNat(X1,X1),
axiom_015 ).
cnf(c_0_33,axiom,
rd(cons(o,X1)) = double(rd(X1)),
axiom_018 ).
cnf(c_0_34,plain,
evenNat(suc(suc(suc(zero)))) = bfalse,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_27]) ).
cnf(c_0_35,plain,
rd(cons(i,X1)) = suc(addNat(rd(X1),rd(X1))),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
rd(cons(o,X1)) = addNat(rd(X1),rd(X1)),
inference(rw,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
eq2(sat_comm(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_38,axiom,
sat_comm(X1,X2) = eq(x(X1,X2),x(X2,X1)),
axiom_020 ).
cnf(c_0_39,axiom,
x(X1,X2) = rd(append(shw(X1),shw(X2))),
axiom_019 ).
cnf(c_0_40,axiom,
shw(suc(X1)) = aux(X1,evenNat(suc(X1))),
axiom_010 ).
cnf(c_0_41,axiom,
aux(X1,bfalse) = cons(i,shw(half(suc(X1)))),
axiom_001 ).
cnf(c_0_42,axiom,
half(suc(zero)) = zero,
axiom_005 ).
cnf(c_0_43,axiom,
shw(zero) = nil,
axiom_009 ).
cnf(c_0_44,plain,
evenNat(suc(suc(suc(suc(zero))))) = btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_34]),c_0_29]) ).
cnf(c_0_45,plain,
rd(cons(i,X1)) = suc(rd(cons(o,X1))),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_46,axiom,
addNat(suc(X1),X2) = suc(addNat(X1,X2)),
axiom_014 ).
cnf(c_0_47,axiom,
rd(nil) = zero,
axiom_016 ).
cnf(c_0_48,axiom,
addNat(zero,X1) = X1,
axiom_013 ).
cnf(c_0_49,axiom,
aux(X1,btrue) = cons(o,shw(half(suc(X1)))),
axiom ).
cnf(c_0_50,axiom,
half(suc(suc(X1))) = suc(half(X1)),
axiom_006 ).
cnf(c_0_51,axiom,
half(zero) = zero,
axiom_004 ).
cnf(c_0_52,negated_conjecture,
eq2(sat_comm(X1,X2),bfalse) != btrue,
c_0_37 ).
cnf(c_0_53,plain,
sat_comm(X1,X2) = eq(rd(append(shw(X1),shw(X2))),rd(append(shw(X2),shw(X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]) ).
cnf(c_0_54,axiom,
append(cons(X1,X2),X3) = cons(X1,append(X2,X3)),
axiom_012 ).
cnf(c_0_55,plain,
cons(i,nil) = shw(suc(zero)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_28]),c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_56,axiom,
append(nil,X1) = X1,
axiom_011 ).
cnf(c_0_57,plain,
evenNat(suc(suc(suc(suc(suc(zero)))))) = bfalse,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_44]),c_0_27]) ).
cnf(c_0_58,plain,
suc(addNat(rd(cons(o,X1)),suc(rd(cons(o,X1))))) = rd(cons(o,cons(i,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_45]),c_0_46]) ).
cnf(c_0_59,plain,
rd(cons(o,nil)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_47]),c_0_48]) ).
cnf(c_0_60,plain,
cons(o,shw(suc(zero))) = shw(suc(suc(zero))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_30]),c_0_49]),c_0_50]),c_0_51]) ).
cnf(c_0_61,negated_conjecture,
eq2(eq(rd(append(shw(X1),shw(X2))),rd(append(shw(X2),shw(X1)))),bfalse) != btrue,
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,plain,
append(shw(suc(zero)),X1) = cons(i,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_63,plain,
evenNat(suc(suc(suc(suc(suc(suc(zero))))))) = btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_57]),c_0_29]) ).
cnf(c_0_64,plain,
rd(shw(suc(suc(zero)))) = suc(suc(zero)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_48]),c_0_55]),c_0_60]) ).
cnf(c_0_65,plain,
cons(o,shw(suc(suc(zero)))) = shw(suc(suc(suc(suc(zero))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_44]),c_0_49]),c_0_50]),c_0_50]),c_0_51]) ).
cnf(c_0_66,plain,
cons(i,shw(suc(zero))) = shw(suc(suc(suc(zero)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_34]),c_0_41]),c_0_50]),c_0_42]) ).
cnf(c_0_67,negated_conjecture,
eq2(eq(rd(append(shw(X1),shw(suc(zero)))),suc(rd(cons(o,shw(X1))))),bfalse) != btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_45]) ).
cnf(c_0_68,plain,
append(shw(suc(suc(zero))),X1) = cons(o,cons(i,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_60]),c_0_62]) ).
cnf(c_0_69,plain,
cons(o,shw(suc(suc(suc(zero))))) = shw(suc(suc(suc(suc(suc(suc(zero))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_63]),c_0_49]),c_0_50]),c_0_50]),c_0_50]),c_0_51]) ).
cnf(c_0_70,plain,
rd(shw(suc(suc(suc(suc(zero)))))) = suc(suc(suc(suc(zero)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_64]),c_0_46]),c_0_46]),c_0_48]),c_0_65]) ).
cnf(c_0_71,plain,
rd(shw(suc(suc(suc(zero))))) = suc(suc(suc(zero))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_66]),c_0_60]),c_0_64]) ).
cnf(c_0_72,negated_conjecture,
eq2(eq(rd(shw(suc(suc(suc(suc(suc(suc(zero)))))))),suc(suc(suc(suc(suc(zero)))))),bfalse) != btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_66]),c_0_69]),c_0_65]),c_0_70]) ).
cnf(c_0_73,plain,
rd(shw(suc(suc(suc(suc(suc(suc(zero)))))))) = suc(suc(suc(suc(suc(suc(zero)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_71]),c_0_46]),c_0_46]),c_0_46]),c_0_48]),c_0_69]) ).
cnf(c_0_74,axiom,
eq(suc(X1),suc(X2)) = eq(X1,X2),
axiom_025 ).
cnf(c_0_75,axiom,
eq(suc(X1),zero) = bfalse,
axiom_027 ).
cnf(c_0_76,axiom,
eq2(X1,X1) = btrue,
axiom_029 ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_74]),c_0_74]),c_0_74]),c_0_74]),c_0_75]),c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX217-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n014.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 10:35:05 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.57 % Version: 3.5.1
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3842416 completed with status 0
% 0.23/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.57 % No SInE strategy applied
% 0.23/0.57 % Search class: FUUPM-FFSM21-MFFFFFNN
% 0.23/0.57 % partial match(1): FUUPM-FFSF21-MFFFFFNN
% 0.23/0.57 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.57 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.23/0.57 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.23/0.57 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.23/0.57 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 3842425 completed with status 0
% 0.23/0.57 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.57 % No SInE strategy applied
% 0.23/0.57 % Search class: FUUPM-FFSM21-MFFFFFNN
% 0.23/0.57 % partial match(1): FUUPM-FFSF21-MFFFFFNN
% 0.23/0.57 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.57 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.23/0.57 % Preprocessing time : 0.001 s
% 0.23/0.57
% 0.23/0.57 % Proof found!
% 0.23/0.57 % SZS status Unsatisfiable
% 0.23/0.57 % SZS output start CNFRefutation
% See solution above
% 0.23/0.57 % Parsed axioms : 32
% 0.23/0.57 % Removed by relevancy pruning/SinE : 0
% 0.23/0.57 % Initial clauses : 32
% 0.23/0.57 % Removed in clause preprocessing : 3
% 0.23/0.57 % Initial clauses in saturation : 29
% 0.23/0.57 % Processed clauses : 117
% 0.23/0.57 % ...of these trivial : 4
% 0.23/0.57 % ...subsumed : 39
% 0.23/0.57 % ...remaining for further processing : 74
% 0.23/0.57 % Other redundant clauses eliminated : 0
% 0.23/0.57 % Clauses deleted for lack of memory : 0
% 0.23/0.57 % Backward-subsumed : 0
% 0.23/0.57 % Backward-rewritten : 0
% 0.23/0.57 % Generated clauses : 140
% 0.23/0.57 % ...of the previous two non-redundant : 131
% 0.23/0.57 % ...aggressively subsumed : 0
% 0.23/0.57 % Contextual simplify-reflections : 0
% 0.23/0.57 % Paramodulations : 140
% 0.23/0.57 % Factorizations : 0
% 0.23/0.57 % NegExts : 0
% 0.23/0.57 % Equation resolutions : 0
% 0.23/0.57 % Disequality decompositions : 0
% 0.23/0.57 % Total rewrite steps : 361
% 0.23/0.57 % ...of those cached : 256
% 0.23/0.57 % Propositional unsat checks : 0
% 0.23/0.57 % Propositional check models : 0
% 0.23/0.57 % Propositional check unsatisfiable : 0
% 0.23/0.57 % Propositional clauses : 0
% 0.23/0.57 % Propositional clauses after purity: 0
% 0.23/0.57 % Propositional unsat core size : 0
% 0.23/0.57 % Propositional preprocessing time : 0.000
% 0.23/0.57 % Propositional encoding time : 0.000
% 0.23/0.57 % Propositional solver time : 0.000
% 0.23/0.57 % Success case prop preproc time : 0.000
% 0.23/0.57 % Success case prop encoding time : 0.000
% 0.23/0.57 % Success case prop solver time : 0.000
% 0.23/0.57 % Current number of processed clauses : 74
% 0.23/0.57 % Positive orientable unit clauses : 63
% 0.23/0.57 % Positive unorientable unit clauses: 0
% 0.23/0.57 % Negative unit clauses : 11
% 0.23/0.57 % Non-unit-clauses : 0
% 0.23/0.57 % Current number of unprocessed clauses: 40
% 0.23/0.57 % ...number of literals in the above : 40
% 0.23/0.57 % Current number of archived formulas : 0
% 0.23/0.57 % Current number of archived clauses : 3
% 0.23/0.57 % Clause-clause subsumption calls (NU) : 0
% 0.23/0.57 % Rec. Clause-clause subsumption calls : 0
% 0.23/0.57 % Non-unit clause-clause subsumptions : 0
% 0.23/0.57 % Unit Clause-clause subsumption calls : 37
% 0.23/0.57 % Rewrite failures with RHS unbound : 0
% 0.23/0.57 % BW rewrite match attempts : 66
% 0.23/0.57 % BW rewrite match successes : 0
% 0.23/0.57 % Condensation attempts : 0
% 0.23/0.57 % Condensation successes : 0
% 0.23/0.57 % Termbank termtop insertions : 3468
% 0.23/0.57 % Search garbage collected termcells : 2
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.006 s
% 0.23/0.57 % System time : 0.006 s
% 0.23/0.57 % Total time : 0.012 s
% 0.23/0.57 % Maximum resident set size: 3652 pages
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.037 s
% 0.23/0.57 % System time : 0.023 s
% 0.23/0.57 % Total time : 0.060 s
% 0.23/0.57 % Maximum resident set size: 4864 pages
% 0.23/0.57 % E exiting
%------------------------------------------------------------------------------