%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX240-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:21 PM UTC 2026
% Result : Unsatisfiable 46.80s 7.26s
% Output : CNFRefutation 46.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 33
% Syntax : Number of clauses : 94 ( 94 unt; 0 nHn; 20 RR)
% Number of literals : 94 ( 93 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 32 ( 32 usr; 8 con; 0-5 aty)
% Number of variables : 160 ( 51 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_059,axiom,
eq2(low(X1),high(X2)) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_059) ).
cnf(axiom_045,axiom,
eq3(var(X1),var(X2)) = eq2(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_045) ).
cnf(axiom_018,axiom,
h = high(zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_018) ).
cnf(axiom_037,axiom,
typeCorrect(ifThenElse(X1,X2,X3)) = andb(typeCorrect(X2),typeCorrect(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_037) ).
cnf(axiom_036,axiom,
typeCorrect(seq(X1,X2)) = andb(typeCorrect(X1),typeCorrect(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_036) ).
cnf(axiom_033,axiom,
typeCorrect(skip) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_033) ).
cnf(axiom_023,axiom,
andb(btrue,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_023) ).
cnf(axiom_020,axiom,
elem(X1,cons(X2,X3)) = orb(eq2(X2,X1),elem(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_020) ).
cnf(axiom_028,axiom,
eval(X1,var(X2)) = elem(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_028) ).
cnf(axiom_015,axiom,
l = low(zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_015) ).
cnf(axiom_038,axiom,
prop(X1,X2) = impl(typeCorrect(X1),eq5(elem(l,run(X2,X1)),elem(l,run(cons(h,X2),X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_038) ).
cnf(axiom_035,axiom,
typeCorrect(assign(low(X1),X2)) = notb(secret(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_035) ).
cnf(axiom_007,axiom,
orb(bfalse,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).
cnf(axiom_058,axiom,
eq2(high(X1),low(X2)) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_058) ).
cnf(axiom_012,axiom,
secret(fF) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_012) ).
cnf(axiom_014,axiom,
notb(bfalse) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_014) ).
cnf(axiom_032,axiom,
run(X1,ifThenElse(X2,X3,X4)) = aux3(X1,X2,X3,X4,eval(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_032) ).
cnf(axiom_019,axiom,
elem(X1,nil) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).
cnf(axiom_022,axiom,
del(X1,cons(X2,X3)) = aux(X1,X2,X3,eq2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_022) ).
cnf(axiom_084,axiom,
eq3(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_084) ).
cnf(axiom_006,axiom,
orb(btrue,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_006) ).
cnf(axiom_016,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).
cnf(axiom_005,axiom,
aux3(X1,X2,X3,X4,bfalse) = run(X1,X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_005) ).
cnf(axiom_030,axiom,
run(X1,assign(X2,X3)) = aux2(X1,X2,X3,eval(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_030) ).
cnf(axiom_027,axiom,
eval(X1,fF) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_027) ).
cnf(axiom_003,axiom,
aux2(X1,X2,X3,bfalse) = del(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).
cnf(axiom,axiom,
aux(X1,X2,X3,btrue) = del(X1,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom) ).
cnf(axiom_004,axiom,
aux3(X1,X2,X3,X4,btrue) = run(X1,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_004) ).
cnf(goal,negated_conjecture,
eq5(prop(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(axiom_021,axiom,
del(X1,nil) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_021) ).
cnf(axiom_029,axiom,
run(X1,skip) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_029) ).
cnf(axiom_041,axiom,
eq5(bfalse,btrue) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_041) ).
cnf(axiom_086,axiom,
eq5(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_086) ).
cnf(c_0_33,axiom,
eq2(low(X1),high(X2)) = bfalse,
axiom_059 ).
cnf(c_0_34,axiom,
eq3(var(X1),var(X2)) = eq2(X1,X2),
axiom_045 ).
cnf(c_0_35,plain,
eq3(var(low(X1)),var(high(X2))) = bfalse,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,axiom,
h = high(zero),
axiom_018 ).
cnf(c_0_37,axiom,
typeCorrect(ifThenElse(X1,X2,X3)) = andb(typeCorrect(X2),typeCorrect(X3)),
axiom_037 ).
cnf(c_0_38,axiom,
typeCorrect(seq(X1,X2)) = andb(typeCorrect(X1),typeCorrect(X2)),
axiom_036 ).
cnf(c_0_39,axiom,
typeCorrect(skip) = btrue,
axiom_033 ).
cnf(c_0_40,axiom,
andb(btrue,X1) = X1,
axiom_023 ).
cnf(c_0_41,axiom,
elem(X1,cons(X2,X3)) = orb(eq2(X2,X1),elem(X1,X3)),
axiom_020 ).
cnf(c_0_42,axiom,
eval(X1,var(X2)) = elem(X2,X1),
axiom_028 ).
cnf(c_0_43,plain,
eq3(var(low(X1)),var(h)) = bfalse,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,axiom,
l = low(zero),
axiom_015 ).
cnf(c_0_45,axiom,
prop(X1,X2) = impl(typeCorrect(X1),eq5(elem(l,run(X2,X1)),elem(l,run(cons(h,X2),X1)))),
axiom_038 ).
cnf(c_0_46,plain,
typeCorrect(ifThenElse(X1,X2,X3)) = typeCorrect(seq(X2,X3)),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,plain,
typeCorrect(seq(skip,X1)) = typeCorrect(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_48,axiom,
typeCorrect(assign(low(X1),X2)) = notb(secret(X2)),
axiom_035 ).
cnf(c_0_49,plain,
eval(cons(X2,X3),var(X1)) = orb(eq3(var(X2),var(X1)),eval(X3,var(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_42]),c_0_34]) ).
cnf(c_0_50,plain,
eq3(var(l),var(h)) = bfalse,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,axiom,
orb(bfalse,X1) = X1,
axiom_007 ).
cnf(c_0_52,axiom,
eq2(high(X1),low(X2)) = bfalse,
axiom_058 ).
cnf(c_0_53,plain,
prop(X1,X2) = impl(typeCorrect(X1),eq5(eval(run(X2,X1),var(l)),eval(run(cons(h,X2),X1),var(l)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_42]),c_0_42]) ).
cnf(c_0_54,plain,
typeCorrect(ifThenElse(X1,skip,X2)) = typeCorrect(X2),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,plain,
notb(secret(X1)) = typeCorrect(assign(l,X1)),
inference(spm,[status(thm)],[c_0_48,c_0_44]) ).
cnf(c_0_56,axiom,
secret(fF) = bfalse,
axiom_012 ).
cnf(c_0_57,axiom,
notb(bfalse) = btrue,
axiom_014 ).
cnf(c_0_58,axiom,
run(X1,ifThenElse(X2,X3,X4)) = aux3(X1,X2,X3,X4,eval(X1,X2)),
axiom_032 ).
cnf(c_0_59,plain,
eval(cons(l,X1),var(h)) = eval(X1,var(h)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_60,axiom,
elem(X1,nil) = bfalse,
axiom_019 ).
cnf(c_0_61,axiom,
del(X1,cons(X2,X3)) = aux(X1,X2,X3,eq2(X1,X2)),
axiom_022 ).
cnf(c_0_62,axiom,
eq3(X1,X1) = btrue,
axiom_084 ).
cnf(c_0_63,axiom,
orb(btrue,X1) = btrue,
axiom_006 ).
cnf(c_0_64,plain,
eq3(var(high(X1)),var(low(X2))) = bfalse,
inference(rw,[status(thm)],[c_0_52,c_0_34]) ).
cnf(c_0_65,plain,
impl(typeCorrect(X1),eq5(eval(run(X2,ifThenElse(X3,skip,X1)),var(l)),eval(run(cons(h,X2),ifThenElse(X3,skip,X1)),var(l)))) = prop(ifThenElse(X3,skip,X1),X2),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_66,plain,
typeCorrect(assign(l,fF)) = btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_67,axiom,
impl(btrue,X1) = X1,
axiom_016 ).
cnf(c_0_68,plain,
aux3(cons(l,X1),var(h),X2,X3,eval(X1,var(h))) = run(cons(l,X1),ifThenElse(var(h),X2,X3)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_69,plain,
eval(nil,var(X1)) = bfalse,
inference(rw,[status(thm)],[c_0_60,c_0_42]) ).
cnf(c_0_70,axiom,
aux3(X1,X2,X3,X4,bfalse) = run(X1,X4),
axiom_005 ).
cnf(c_0_71,axiom,
run(X1,assign(X2,X3)) = aux2(X1,X2,X3,eval(X1,X3)),
axiom_030 ).
cnf(c_0_72,axiom,
eval(X1,fF) = bfalse,
axiom_027 ).
cnf(c_0_73,axiom,
aux2(X1,X2,X3,bfalse) = del(X2,X1),
axiom_003 ).
cnf(c_0_74,plain,
del(X1,cons(X2,X3)) = aux(X1,X2,X3,eq3(var(X1),var(X2))),
inference(rw,[status(thm)],[c_0_61,c_0_34]) ).
cnf(c_0_75,axiom,
aux(X1,X2,X3,btrue) = del(X1,X3),
axiom ).
cnf(c_0_76,plain,
eval(cons(X1,X2),var(X1)) = btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_62]),c_0_63]) ).
cnf(c_0_77,axiom,
aux3(X1,X2,X3,X4,btrue) = run(X1,X3),
axiom_004 ).
cnf(c_0_78,plain,
eq3(var(high(X1)),var(l)) = bfalse,
inference(spm,[status(thm)],[c_0_64,c_0_44]) ).
cnf(c_0_79,negated_conjecture,
eq5(prop(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_80,plain,
eq5(eval(run(X1,ifThenElse(X2,skip,assign(l,fF))),var(l)),eval(run(cons(h,X1),ifThenElse(X2,skip,assign(l,fF))),var(l))) = prop(ifThenElse(X2,skip,assign(l,fF)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_81,plain,
run(cons(l,nil),ifThenElse(var(h),X1,X2)) = run(cons(l,nil),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_82,plain,
run(X1,assign(X2,fF)) = del(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_83,plain,
del(X1,cons(X1,X2)) = del(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_62]),c_0_75]) ).
cnf(c_0_84,axiom,
del(X1,nil) = nil,
axiom_021 ).
cnf(c_0_85,plain,
run(cons(X1,X2),ifThenElse(var(X1),X3,X4)) = run(cons(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_76]),c_0_77]) ).
cnf(c_0_86,axiom,
run(X1,skip) = X1,
axiom_029 ).
cnf(c_0_87,plain,
eval(cons(X1,cons(X2,X3)),var(X2)) = orb(eq3(var(X1),var(X2)),btrue),
inference(spm,[status(thm)],[c_0_49,c_0_76]) ).
cnf(c_0_88,plain,
eq3(var(h),var(l)) = bfalse,
inference(spm,[status(thm)],[c_0_78,c_0_36]) ).
cnf(c_0_89,axiom,
eq5(bfalse,btrue) = bfalse,
axiom_041 ).
cnf(c_0_90,negated_conjecture,
eq5(prop(X1,X2),bfalse) != btrue,
c_0_79 ).
cnf(c_0_91,plain,
prop(ifThenElse(var(h),skip,assign(l,fF)),cons(l,nil)) = bfalse,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]),c_0_83]),c_0_84]),c_0_69]),c_0_85]),c_0_86]),c_0_87]),c_0_88]),c_0_51]),c_0_89]) ).
cnf(c_0_92,axiom,
eq5(X1,X1) = btrue,
axiom_086 ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX240-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n011.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 10:38:10 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 46.80/7.26 % Version: 3.5.1
% 46.80/7.26 % Preprocessing class: FSMSSMSMSSSNFFN.
% 46.80/7.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 46.80/7.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 46.80/7.26 % Starting new_bool_3 with 300s (1) cores
% 46.80/7.26 % Starting new_bool_1 with 300s (1) cores
% 46.80/7.26 % Starting sh5l with 300s (1) cores
% 46.80/7.26 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1680834 completed with status 0
% 46.80/7.26 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 46.80/7.26 % Preprocessing class: FSMSSMSMSSSNFFN.
% 46.80/7.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 46.80/7.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 46.80/7.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 46.80/7.26 % No SInE strategy applied
% 46.80/7.26 % Search class: FHUPM-FFMM32-MFFFFFNN
% 46.80/7.26 % partial match(1): FHUPM-FFMF32-MFFFFFNN
% 46.80/7.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 46.80/7.26 % Starting SubtermCWHack with 136s (1) cores
% 46.80/7.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 46.80/7.26 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 226s (1) cores
% 46.80/7.26 % Starting new_bool_3 with 226s (1) cores
% 46.80/7.26 % Starting new_bool_1 with 226s (1) cores
% 46.80/7.26 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1680842 completed with status 0
% 46.80/7.26 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 46.80/7.26 % Preprocessing class: FSMSSMSMSSSNFFN.
% 46.80/7.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 46.80/7.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 46.80/7.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 46.80/7.26 % No SInE strategy applied
% 46.80/7.26 % Search class: FHUPM-FFMM32-MFFFFFNN
% 46.80/7.26 % partial match(1): FHUPM-FFMF32-MFFFFFNN
% 46.80/7.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 46.80/7.26 % Starting SubtermCWHack with 136s (1) cores
% 46.80/7.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 46.80/7.26 % Preprocessing time : 0.002 s
% 46.80/7.26 % Presaturation interreduction done
% 46.80/7.26
% 46.80/7.26 % Proof found!
% 46.80/7.26 % SZS status Unsatisfiable
% 46.80/7.26 % SZS output start CNFRefutation
% See solution above
% 46.80/7.26 % Parsed axioms : 88
% 46.80/7.26 % Removed by relevancy pruning/SinE : 0
% 46.80/7.26 % Initial clauses : 88
% 46.80/7.26 % Removed in clause preprocessing : 3
% 46.80/7.26 % Initial clauses in saturation : 85
% 46.80/7.26 % Processed clauses : 30884
% 46.80/7.26 % ...of these trivial : 1313
% 46.80/7.26 % ...subsumed : 25626
% 46.80/7.26 % ...remaining for further processing : 3945
% 46.80/7.26 % Other redundant clauses eliminated : 0
% 46.80/7.26 % Clauses deleted for lack of memory : 0
% 46.80/7.26 % Backward-subsumed : 8
% 46.80/7.26 % Backward-rewritten : 401
% 46.80/7.26 % Generated clauses : 299942
% 46.80/7.26 % ...of the previous two non-redundant : 242910
% 46.80/7.26 % ...aggressively subsumed : 0
% 46.80/7.26 % Contextual simplify-reflections : 0
% 46.80/7.26 % Paramodulations : 299942
% 46.80/7.26 % Factorizations : 0
% 46.80/7.26 % NegExts : 0
% 46.80/7.26 % Equation resolutions : 0
% 46.80/7.26 % Disequality decompositions : 0
% 46.80/7.26 % Total rewrite steps : 380657
% 46.80/7.26 % ...of those cached : 262860
% 46.80/7.26 % Propositional unsat checks : 0
% 46.80/7.26 % Propositional check models : 0
% 46.80/7.26 % Propositional check unsatisfiable : 0
% 46.80/7.26 % Propositional clauses : 0
% 46.80/7.26 % Propositional clauses after purity: 0
% 46.80/7.26 % Propositional unsat core size : 0
% 46.80/7.26 % Propositional preprocessing time : 0.000
% 46.80/7.26 % Propositional encoding time : 0.000
% 46.80/7.26 % Propositional solver time : 0.000
% 46.80/7.26 % Success case prop preproc time : 0.000
% 46.80/7.26 % Success case prop encoding time : 0.000
% 46.80/7.26 % Success case prop solver time : 0.000
% 46.80/7.26 % Current number of processed clauses : 3453
% 46.80/7.26 % Positive orientable unit clauses : 3012
% 46.80/7.26 % Positive unorientable unit clauses: 38
% 46.80/7.26 % Negative unit clauses : 149
% 46.80/7.26 % Non-unit-clauses : 254
% 46.80/7.26 % Current number of unprocessed clauses: 211615
% 46.80/7.26 % ...number of literals in the above : 230204
% 46.80/7.26 % Current number of archived formulas : 0
% 46.80/7.26 % Current number of archived clauses : 495
% 46.80/7.26 % Clause-clause subsumption calls (NU) : 2705
% 46.80/7.26 % Rec. Clause-clause subsumption calls : 2703
% 46.80/7.26 % Non-unit clause-clause subsumptions : 12
% 46.80/7.26 % Unit Clause-clause subsumption calls : 8047
% 46.80/7.26 % Rewrite failures with RHS unbound : 3609
% 46.80/7.26 % BW rewrite match attempts : 115520
% 46.80/7.26 % BW rewrite match successes : 685
% 46.80/7.26 % Condensation attempts : 0
% 46.80/7.26 % Condensation successes : 0
% 46.80/7.26 % Termbank termtop insertions : 9697975
% 46.80/7.26 % Search garbage collected termcells : 29
% 46.80/7.26
% 46.80/7.26 % -------------------------------------------------
% 46.80/7.26 % User time : 6.047 s
% 46.80/7.26 % System time : 0.296 s
% 46.80/7.26 % Total time : 6.342 s
% 46.80/7.26 % Maximum resident set size: 3688 pages
% 46.80/7.26
% 46.80/7.26 % -------------------------------------------------
% 46.80/7.26 % User time : 31.618 s
% 46.80/7.26 % System time : 1.472 s
% 46.80/7.26 % Total time : 33.090 s
% 46.80/7.26 % Maximum resident set size: 4608 pages
% 46.80/7.26 % E exiting
%------------------------------------------------------------------------------