%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE159+1 : 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 : n019.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:59 PM UTC 2026
% Result : Theorem 12.60s 2.46s
% Output : CNFRefutation 12.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 73 ( 55 unt; 0 def)
% Number of atoms : 93 ( 50 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 16 ~; 13 |; 2 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 127 ( 3 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( leq(multiplication(X4,X5),multiplication(X6,X4))
=> leq(multiplication(X4,star(X5)),multiplication(star(X6),X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',order) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(star_unfold1,axiom,
! [X1] : addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_unfold1) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_left_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(distributivity1,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
fof(star_induction1,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X3),X2),X3)
=> leq(multiplication(star(X1),X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_induction1) ).
fof(star_induction2,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X3,X1),X2),X3)
=> leq(multiplication(X2,star(X1)),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_induction2) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(c_0_14,negated_conjecture,
~ ! [X4,X5,X6] :
( leq(multiplication(X4,X5),multiplication(X6,X4))
=> leq(multiplication(X4,star(X5)),multiplication(star(X6),X4)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,plain,
! [X39,X40] :
( ( leq(X39,X40)
| addition(X39,X40) != X40 )
& ( addition(X39,X40) = X40
| ~ leq(X39,X40) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_16,negated_conjecture,
( ~ leq(multiplication(esk1_0,star(esk2_0)),multiplication(star(esk3_0),esk1_0))
& leq(multiplication(esk1_0,esk2_0),multiplication(esk3_0,esk1_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_17,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_18,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
leq(multiplication(esk1_0,esk2_0),multiplication(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X26] : addition(one,multiplication(X26,star(X26))) = star(X26),
inference(variable_rename,[status(thm)],[star_unfold1]) ).
fof(c_0_21,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
fof(c_0_22,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_23,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_24,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[idempotence]) ).
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,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),multiplication(esk3_0,esk1_0)) = multiplication(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_27,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[distributivity1]) ).
fof(c_0_28,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_29,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_34,plain,
! [X27] : addition(one,multiplication(star(X27),X27)) = star(X27),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
cnf(c_0_35,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),addition(multiplication(esk3_0,esk1_0),X1)) = addition(multiplication(esk3_0,esk1_0),X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_37,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
addition(one,addition(multiplication(X1,star(X1)),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_40,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_41,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_42,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_43,plain,
! [X28,X29,X30] :
( leq(multiplication(star(X28),X29),X30)
| ~ leq(addition(multiplication(X28,X30),X29),X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction1])])]) ).
cnf(c_0_44,negated_conjecture,
leq(multiplication(esk1_0,esk2_0),addition(multiplication(esk3_0,esk1_0),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32]) ).
cnf(c_0_46,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_29]),c_0_40]) ).
cnf(c_0_47,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X2)
| leq(multiplication(star(X1),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,negated_conjecture,
leq(multiplication(esk1_0,esk2_0),multiplication(addition(esk3_0,X1),esk1_0)),
inference(spm,[status(thm)],[c_0_44,c_0_30]) ).
cnf(c_0_50,plain,
addition(X1,star(X1)) = star(X1),
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_45,c_0_46]),c_0_25]),c_0_47]),c_0_32]),c_0_47]),c_0_46]) ).
cnf(c_0_51,plain,
( ~ leq(multiplication(addition(X1,X2),X3),X3)
| leq(multiplication(star(X1),multiplication(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_30]) ).
cnf(c_0_52,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_33]) ).
fof(c_0_53,plain,
! [X31,X32,X33] :
( leq(multiplication(X32,star(X31)),X33)
| ~ leq(addition(multiplication(X33,X31),X32),X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])])]) ).
fof(c_0_54,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_55,negated_conjecture,
leq(multiplication(esk1_0,esk2_0),multiplication(star(esk3_0),esk1_0)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
leq(multiplication(star(X1),star(X1)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_46]),c_0_31]),c_0_52])]) ).
cnf(c_0_57,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X1)
| leq(multiplication(X3,star(X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_59,plain,
( multiplication(X1,addition(X2,X3)) != multiplication(X1,X3)
| leq(multiplication(X1,X2),multiplication(X1,X3)) ),
inference(spm,[status(thm)],[c_0_35,c_0_37]) ).
cnf(c_0_60,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),multiplication(star(esk3_0),esk1_0)) = multiplication(star(esk3_0),esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_55]) ).
cnf(c_0_61,plain,
multiplication(star(X1),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_56]),c_0_32]),c_0_45]),c_0_32]),c_0_47]) ).
cnf(c_0_62,plain,
( ~ leq(addition(multiplication(X3,multiplication(X4,X2)),X1),multiplication(X3,X4))
| leq(multiplication(X1,star(X2)),multiplication(X3,X4)) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
leq(multiplication(X1,multiplication(esk1_0,esk2_0)),multiplication(X1,multiplication(star(esk3_0),esk1_0))),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,plain,
multiplication(star(X1),multiplication(star(X1),X2)) = multiplication(star(X1),X2),
inference(spm,[status(thm)],[c_0_58,c_0_61]) ).
cnf(c_0_65,plain,
( ~ leq(multiplication(X1,multiplication(X2,X3)),multiplication(X1,X2))
| leq(multiplication(X1,multiplication(X2,multiplication(X3,star(X3)))),multiplication(X1,X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_33]),c_0_58]),c_0_58]) ).
cnf(c_0_66,negated_conjecture,
leq(multiplication(star(esk3_0),multiplication(esk1_0,esk2_0)),multiplication(star(esk3_0),esk1_0)),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
( multiplication(addition(X1,X3),X2) != multiplication(X3,X2)
| leq(multiplication(X1,X2),multiplication(X3,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_68,negated_conjecture,
leq(multiplication(star(esk3_0),multiplication(esk1_0,multiplication(esk2_0,star(esk2_0)))),multiplication(star(esk3_0),esk1_0)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
leq(X1,multiplication(star(X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_47]),c_0_31]) ).
cnf(c_0_70,negated_conjecture,
multiplication(star(esk3_0),multiplication(esk1_0,star(esk2_0))) = multiplication(star(esk3_0),esk1_0),
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_18,c_0_68]),c_0_37]),c_0_32]),c_0_45]),c_0_32]),c_0_29]) ).
cnf(c_0_71,negated_conjecture,
~ leq(multiplication(esk1_0,star(esk2_0)),multiplication(star(esk3_0),esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE159+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 22:48:05 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.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
% 12.60/2.46 % Version: 3.5.1
% 12.60/2.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 12.60/2.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.60/2.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.60/2.46 % Starting new_bool_3 with 300s (1) cores
% 12.60/2.46 % Starting new_bool_1 with 300s (1) cores
% 12.60/2.46 % Starting sh5l with 300s (1) cores
% 12.60/2.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1082409 completed with status 0
% 12.60/2.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 12.60/2.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 12.60/2.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.60/2.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.60/2.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.60/2.46 % No SInE strategy applied
% 12.60/2.46 % Search class: FHUSM-FFSF21-MFFFFFNN
% 12.60/2.46 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 12.60/2.46 % Starting SubtermCWHack with 136s (1) cores
% 12.60/2.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.60/2.46 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 12.60/2.46 % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 12.60/2.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 12.60/2.46 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 1082419 completed with status 0
% 12.60/2.46 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 12.60/2.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 12.60/2.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.60/2.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.60/2.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.60/2.46 % No SInE strategy applied
% 12.60/2.46 % Search class: FHUSM-FFSF21-MFFFFFNN
% 12.60/2.46 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 12.60/2.46 % Starting SubtermCWHack with 136s (1) cores
% 12.60/2.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.60/2.46 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 12.60/2.46 % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 12.60/2.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 12.60/2.46 % Preprocessing time : 0.001 s
% 12.60/2.46 % Presaturation interreduction done
% 12.60/2.46
% 12.60/2.46 % Proof found!
% 12.60/2.46 % SZS status Theorem
% 12.60/2.46 % SZS output start CNFRefutation
% See solution above
% 12.60/2.46 % Parsed axioms : 19
% 12.60/2.46 % Removed by relevancy pruning/SinE : 0
% 12.60/2.46 % Initial clauses : 21
% 12.60/2.46 % Removed in clause preprocessing : 0
% 12.60/2.46 % Initial clauses in saturation : 21
% 12.60/2.46 % Processed clauses : 7835
% 12.60/2.46 % ...of these trivial : 773
% 12.60/2.46 % ...subsumed : 4881
% 12.60/2.46 % ...remaining for further processing : 2181
% 12.60/2.46 % Other redundant clauses eliminated : 140
% 12.60/2.46 % Clauses deleted for lack of memory : 0
% 12.60/2.46 % Backward-subsumed : 15
% 12.60/2.46 % Backward-rewritten : 620
% 12.60/2.46 % Generated clauses : 65009
% 12.60/2.46 % ...of the previous two non-redundant : 47495
% 12.60/2.46 % ...aggressively subsumed : 0
% 12.60/2.46 % Contextual simplify-reflections : 0
% 12.60/2.46 % Paramodulations : 64868
% 12.60/2.46 % Factorizations : 0
% 12.60/2.46 % NegExts : 0
% 12.60/2.46 % Equation resolutions : 141
% 12.60/2.46 % Disequality decompositions : 0
% 12.60/2.46 % Total rewrite steps : 74139
% 12.60/2.46 % ...of those cached : 64174
% 12.60/2.46 % Propositional unsat checks : 0
% 12.60/2.46 % Propositional check models : 0
% 12.60/2.46 % Propositional check unsatisfiable : 0
% 12.60/2.46 % Propositional clauses : 0
% 12.60/2.46 % Propositional clauses after purity: 0
% 12.60/2.46 % Propositional unsat core size : 0
% 12.60/2.46 % Propositional preprocessing time : 0.000
% 12.60/2.46 % Propositional encoding time : 0.000
% 12.60/2.46 % Propositional solver time : 0.000
% 12.60/2.46 % Success case prop preproc time : 0.000
% 12.60/2.46 % Success case prop encoding time : 0.000
% 12.60/2.46 % Success case prop solver time : 0.000
% 12.60/2.46 % Current number of processed clauses : 1524
% 12.60/2.46 % Positive orientable unit clauses : 682
% 12.60/2.46 % Positive unorientable unit clauses: 4
% 12.60/2.46 % Negative unit clauses : 1
% 12.60/2.46 % Non-unit-clauses : 837
% 12.60/2.46 % Current number of unprocessed clauses: 39365
% 12.60/2.46 % ...number of literals in the above : 67085
% 12.60/2.46 % Current number of archived formulas : 0
% 12.60/2.46 % Current number of archived clauses : 656
% 12.60/2.46 % Clause-clause subsumption calls (NU) : 154297
% 12.60/2.46 % Rec. Clause-clause subsumption calls : 154069
% 12.60/2.46 % Non-unit clause-clause subsumptions : 4769
% 12.60/2.46 % Unit Clause-clause subsumption calls : 18536
% 12.60/2.46 % Rewrite failures with RHS unbound : 0
% 12.60/2.46 % BW rewrite match attempts : 7008
% 12.60/2.46 % BW rewrite match successes : 295
% 12.60/2.46 % Condensation attempts : 0
% 12.60/2.46 % Condensation successes : 0
% 12.60/2.46 % Termbank termtop insertions : 1021124
% 12.60/2.46 % Search garbage collected termcells : 96
% 12.60/2.46
% 12.60/2.46 % -------------------------------------------------
% 12.60/2.46 % User time : 1.496 s
% 12.60/2.46 % System time : 0.050 s
% 12.60/2.46 % Total time : 1.546 s
% 12.60/2.46 % Maximum resident set size: 3652 pages
% 12.60/2.46
% 12.60/2.46 % -------------------------------------------------
% 12.60/2.46 % User time : 8.543 s
% 12.60/2.46 % System time : 0.339 s
% 12.60/2.46 % Total time : 8.882 s
% 12.60/2.46 % Maximum resident set size: 4864 pages
% 12.60/2.46 % E exiting
%------------------------------------------------------------------------------