%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE011+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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 12:58:35 PM UTC 2026
% Result : Theorem 0.15s 5.58s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 62 ( 42 unt; 0 def)
% Number of atoms : 108 ( 52 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 77 ( 31 ~; 25 |; 14 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn 48 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> ( leq(addition(addition(multiplication(addition(X5,c(X5)),X4),multiplication(addition(X4,c(X4)),X5)),multiplication(c(X4),c(X5))),one)
& leq(one,addition(addition(multiplication(addition(X5,c(X5)),X4),multiplication(addition(X4,c(X4)),X5)),multiplication(c(X4),c(X5)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( addition(X4,X5) = one
& multiplication(X5,X4) = zero
& multiplication(X4,X5) = zero ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(c_0_12,negated_conjecture,
~ ! [X4,X5] :
( ( test(X4)
& test(X5) )
=> ( leq(addition(addition(multiplication(addition(X5,c(X5)),X4),multiplication(addition(X4,c(X4)),X5)),multiplication(c(X4),c(X5))),one)
& leq(one,addition(addition(multiplication(addition(X5,c(X5)),X4),multiplication(addition(X4,c(X4)),X5)),multiplication(c(X4),c(X5)))) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_13,plain,
! [X34,X35] :
( ( ~ test(X34)
| c(X34) = X35
| ~ complement(X34,X35) )
& ( ~ test(X34)
| complement(X34,X35)
| c(X34) != X35 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).
fof(c_0_14,plain,
! [X28,X30,X31] :
( ( test(X30)
| ~ complement(X31,X30) )
& ( complement(esk1_1(X28),X28)
| ~ test(X28) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])])]) ).
fof(c_0_15,negated_conjecture,
( ( ~ leq(addition(addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),multiplication(addition(esk2_0,c(esk2_0)),esk3_0)),multiplication(c(esk2_0),c(esk3_0))),one)
| ~ leq(one,addition(addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),multiplication(addition(esk2_0,c(esk2_0)),esk3_0)),multiplication(c(esk2_0),c(esk3_0)))) )
& test(esk2_0)
& test(esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_16,plain,
( ~ test(X1)
| c(X1) != X2
| complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_18,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_19,plain,
! [X32,X33] :
( ( complement(X33,X32)
| addition(X32,X33) != one
| multiplication(X33,X32) != zero
| multiplication(X32,X33) != zero )
& ( ~ complement(X33,X32)
| addition(X32,X33) = one )
& ( ~ complement(X33,X32)
| multiplication(X33,X32) = zero )
& ( ~ complement(X33,X32)
| multiplication(X32,X33) = zero ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])]) ).
cnf(c_0_20,plain,
( ~ test(X1)
| complement(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_24,plain,
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
complement(esk1_1(esk3_0),esk3_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
complement(esk1_1(esk2_0),esk2_0),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( ~ leq(addition(addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),multiplication(addition(esk2_0,c(esk2_0)),esk3_0)),multiplication(c(esk2_0),c(esk3_0))),one)
| ~ leq(one,addition(addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),multiplication(addition(esk2_0,c(esk2_0)),esk3_0)),multiplication(c(esk2_0),c(esk3_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_31,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
complement(esk3_0,c(esk3_0)),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
fof(c_0_33,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_34,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_35,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_36,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_37,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_38,negated_conjecture,
addition(esk3_0,esk1_1(esk3_0)) = one,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_39,negated_conjecture,
addition(esk2_0,esk1_1(esk2_0)) = one,
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_40,negated_conjecture,
( ~ leq(addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(addition(esk2_0,c(esk2_0)),esk3_0),multiplication(addition(esk3_0,c(esk3_0)),esk2_0))),one)
| ~ leq(one,addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(addition(esk2_0,c(esk2_0)),esk3_0),multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_41,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_32]),c_0_31]) ).
cnf(c_0_42,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,negated_conjecture,
complement(esk2_0,c(esk2_0)),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_47,negated_conjecture,
addition(one,esk3_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31]) ).
cnf(c_0_48,negated_conjecture,
addition(one,esk2_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_39]),c_0_31]) ).
fof(c_0_49,plain,
! [X26,X27] :
( ( leq(X26,X27)
| addition(X26,X27) != X27 )
& ( addition(X26,X27) = X27
| ~ leq(X26,X27) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
cnf(c_0_50,negated_conjecture,
( ~ leq(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),multiplication(c(esk2_0),c(esk3_0))))),one)
| ~ leq(one,addition(esk2_0,addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),multiplication(c(esk2_0),c(esk3_0)))))) ),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_31]),c_0_31]),c_0_25]),c_0_42]),c_0_31]),c_0_31]),c_0_25]),c_0_43]),c_0_25]),c_0_43]),c_0_25]) ).
cnf(c_0_51,negated_conjecture,
addition(multiplication(X1,esk3_0),multiplication(X1,c(esk3_0))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_41]),c_0_45]) ).
cnf(c_0_52,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_31]),c_0_25]) ).
cnf(c_0_53,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_46]),c_0_31]) ).
cnf(c_0_54,negated_conjecture,
addition(one,addition(esk3_0,X1)) = addition(one,X1),
inference(spm,[status(thm)],[c_0_25,c_0_47]) ).
cnf(c_0_55,negated_conjecture,
addition(X1,multiplication(esk2_0,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_48]),c_0_42]),c_0_42]) ).
cnf(c_0_56,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( ~ leq(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0))),one)
| ~ leq(one,addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0)))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
addition(esk2_0,addition(X1,c(esk2_0))) = addition(X1,one),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
addition(one,multiplication(esk2_0,esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_47]) ).
cnf(c_0_60,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_56,c_0_26]) ).
cnf(c_0_61,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(rw,[status(thm)],[c_0_57,c_0_58]),c_0_31]),c_0_59]),c_0_60]),c_0_58]),c_0_31]),c_0_59]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE011+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.38 % Computer : n010.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Sun Sep 20 22:38:30 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.58 % Version: 3.5.1
% 0.15/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.58 % Starting sh5l with 300s (1) cores
% 0.15/5.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3660766 completed with status 0
% 0.15/5.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.58 % No SInE strategy applied
% 0.15/5.58 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.15/5.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.58 % Starting U----_210g_02_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/5.58 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S00EN with 136s (1) cores
% 0.15/5.58 % Starting new_bool_3 with 136s (1) cores
% 0.15/5.58 % G-E--_208_B00_00_F1_SE_CS_SP_PS_S00EN with pid 3660775 completed with status 0
% 0.15/5.58 % Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S00EN
% 0.15/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.58 % No SInE strategy applied
% 0.15/5.58 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.15/5.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.58 % Starting U----_210g_02_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/5.58 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S00EN with 136s (1) cores
% 0.15/5.58 % Preprocessing time : 0.002 s
% 0.15/5.58 % Presaturation interreduction done
% 0.15/5.58
% 0.15/5.58 % Proof found!
% 0.15/5.58 % SZS status Theorem
% 0.15/5.58 % SZS output start CNFRefutation
% See solution above
% 0.15/5.58 % Parsed axioms : 17
% 0.15/5.58 % Removed by relevancy pruning/SinE : 0
% 0.15/5.58 % Initial clauses : 25
% 0.15/5.58 % Removed in clause preprocessing : 0
% 0.15/5.58 % Initial clauses in saturation : 25
% 0.15/5.58 % Processed clauses : 1369
% 0.15/5.58 % ...of these trivial : 103
% 0.15/5.58 % ...subsumed : 825
% 0.15/5.58 % ...remaining for further processing : 441
% 0.15/5.58 % Other redundant clauses eliminated : 90
% 0.15/5.58 % Clauses deleted for lack of memory : 0
% 0.15/5.58 % Backward-subsumed : 2
% 0.15/5.58 % Backward-rewritten : 86
% 0.15/5.58 % Generated clauses : 8212
% 0.15/5.58 % ...of the previous two non-redundant : 5661
% 0.15/5.58 % ...aggressively subsumed : 0
% 0.15/5.58 % Contextual simplify-reflections : 0
% 0.15/5.58 % Paramodulations : 8122
% 0.15/5.58 % Factorizations : 0
% 0.15/5.58 % NegExts : 0
% 0.15/5.58 % Equation resolutions : 90
% 0.15/5.58 % Disequality decompositions : 0
% 0.15/5.58 % Total rewrite steps : 11360
% 0.15/5.58 % ...of those cached : 9770
% 0.15/5.58 % Propositional unsat checks : 0
% 0.15/5.58 % Propositional check models : 0
% 0.15/5.58 % Propositional check unsatisfiable : 0
% 0.15/5.58 % Propositional clauses : 0
% 0.15/5.58 % Propositional clauses after purity: 0
% 0.15/5.58 % Propositional unsat core size : 0
% 0.15/5.58 % Propositional preprocessing time : 0.000
% 0.15/5.58 % Propositional encoding time : 0.000
% 0.15/5.58 % Propositional solver time : 0.000
% 0.15/5.58 % Success case prop preproc time : 0.000
% 0.15/5.58 % Success case prop encoding time : 0.000
% 0.15/5.58 % Success case prop solver time : 0.000
% 0.15/5.58 % Current number of processed clauses : 327
% 0.15/5.58 % Positive orientable unit clauses : 164
% 0.15/5.58 % Positive unorientable unit clauses: 4
% 0.15/5.58 % Negative unit clauses : 0
% 0.15/5.58 % Non-unit-clauses : 159
% 0.15/5.58 % Current number of unprocessed clauses: 4284
% 0.15/5.58 % ...number of literals in the above : 8402
% 0.15/5.58 % Current number of archived formulas : 0
% 0.15/5.58 % Current number of archived clauses : 113
% 0.15/5.58 % Clause-clause subsumption calls (NU) : 3827
% 0.15/5.58 % Rec. Clause-clause subsumption calls : 3611
% 0.15/5.58 % Non-unit clause-clause subsumptions : 696
% 0.15/5.58 % Unit Clause-clause subsumption calls : 1617
% 0.15/5.58 % Rewrite failures with RHS unbound : 0
% 0.15/5.58 % BW rewrite match attempts : 267
% 0.15/5.58 % BW rewrite match successes : 103
% 0.15/5.58 % Condensation attempts : 0
% 0.15/5.58 % Condensation successes : 0
% 0.15/5.58 % Termbank termtop insertions : 89167
% 0.15/5.58 % Search garbage collected termcells : 190
% 0.15/5.58
% 0.15/5.58 % -------------------------------------------------
% 0.15/5.58 % User time : 0.114 s
% 0.15/5.58 % System time : 0.011 s
% 0.15/5.58 % Total time : 0.125 s
% 0.15/5.58 % Maximum resident set size: 3652 pages
% 0.15/5.58
% 0.15/5.58 % -------------------------------------------------
% 0.15/5.58 % User time : 0.577 s
% 0.15/5.58 % System time : 0.042 s
% 0.15/5.58 % Total time : 0.619 s
% 0.15/5.58 % Maximum resident set size: 4608 pages
% 0.15/5.58 % E exiting
%------------------------------------------------------------------------------