%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE039+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 : n009.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:42 PM UTC 2026
% Result : Theorem 1.26s 0.79s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 46 unt; 0 def)
% Number of atoms : 96 ( 55 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 25 ~; 22 |; 1 &)
% ( 1 <=>; 2 =>; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 125 ( 0 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).
fof(star_induction_right,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X1)
=> leq(multiplication(X3,star(X2)),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_induction_right) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).
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/KLE002+0.ax',left_distributivity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_associativity) ).
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/KLE002+0.ax',right_distributivity) ).
fof(star_induction_left,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X2)
=> leq(multiplication(star(X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_induction_left) ).
fof(goals,conjecture,
! [X4] : star(star(X4)) = star(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_13,plain,
! [X7,X8,X9] : addition(X9,addition(X8,X7)) = addition(addition(X9,X8),X7),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_14,plain,
! [X11] : addition(X11,X11) = X11,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_15,plain,
! [X32,X33,X34] :
( leq(multiplication(X34,star(X33)),X32)
| ~ leq(addition(multiplication(X32,X33),X34),X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])])]) ).
fof(c_0_16,plain,
! [X15] : multiplication(X15,one) = X15,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_17,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X5,X6] : addition(X5,X6) = addition(X6,X5),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_20,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X1)
| leq(multiplication(X3,star(X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X25,X26] :
( ( leq(X25,X26)
| addition(X25,X26) != X26 )
& ( addition(X25,X26) = X26
| ~ leq(X25,X26) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
cnf(c_0_23,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ leq(addition(X2,X1),X2)
| leq(multiplication(X1,star(one)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_28,plain,
! [X16] : multiplication(one,X16) = X16,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_29,plain,
! [X27] : leq(addition(one,multiplication(X27,star(X27))),star(X27)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
cnf(c_0_30,plain,
( addition(X1,X2) != X2
| leq(multiplication(X1,star(one)),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]),c_0_27]) ).
cnf(c_0_31,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( addition(one,X1) != X1
| leq(star(one),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
leq(addition(one,star(one)),star(one)),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_36,plain,
( addition(one,X1) != X1
| addition(star(one),X1) = X1 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
addition(one,star(one)) = star(one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_35]),c_0_17]),c_0_18]) ).
cnf(c_0_38,plain,
( addition(one,X1) != X1
| addition(X1,star(one)) = X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_36]) ).
cnf(c_0_39,plain,
( ~ leq(addition(X1,multiplication(X3,X2)),X3)
| leq(multiplication(X1,star(X2)),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_40,plain,
star(one) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_18])]) ).
fof(c_0_41,plain,
! [X20,X21,X22] : multiplication(addition(X20,X21),X22) = addition(multiplication(X20,X22),multiplication(X21,X22)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_42,plain,
( ~ leq(addition(X1,X2),X2)
| leq(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_21]),c_0_40]),c_0_21]) ).
cnf(c_0_43,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_17]),c_0_24]) ).
cnf(c_0_44,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_45,plain,
! [X12,X13,X14] : multiplication(X12,multiplication(X13,X14)) = multiplication(multiplication(X12,X13),X14),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_46,plain,
! [X17,X18,X19] : multiplication(X17,addition(X18,X19)) = addition(multiplication(X17,X18),multiplication(X17,X19)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_47,plain,
! [X29,X30,X31] :
( leq(multiplication(star(X29),X31),X30)
| ~ leq(addition(multiplication(X29,X30),X31),X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])])]) ).
cnf(c_0_48,plain,
( ~ leq(addition(X1,addition(X2,X3)),X3)
| leq(addition(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_17]) ).
cnf(c_0_49,plain,
addition(star(X1),multiplication(X1,star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_43]),c_0_17]),c_0_24]),c_0_23]) ).
cnf(c_0_50,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_31]),c_0_24]) ).
cnf(c_0_51,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X2)
| leq(multiplication(star(X1),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,plain,
( ~ leq(addition(X2,X1),X1)
| leq(addition(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_18]),c_0_17]),c_0_27]) ).
cnf(c_0_55,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
fof(c_0_56,negated_conjecture,
~ ! [X4] : star(star(X4)) = star(X4),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_57,plain,
( ~ leq(multiplication(X1,X2),X1)
| leq(multiplication(X1,multiplication(X2,star(X2))),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_51]) ).
cnf(c_0_58,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_21]),c_0_24]) ).
cnf(c_0_59,plain,
( ~ leq(addition(X2,multiplication(X1,X3)),X3)
| leq(multiplication(star(X1),X2),X3) ),
inference(spm,[status(thm)],[c_0_53,c_0_24]) ).
cnf(c_0_60,plain,
( addition(X2,X1) != X1
| leq(addition(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_26]),c_0_17]),c_0_18]) ).
cnf(c_0_61,plain,
multiplication(addition(one,X1),star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_55,c_0_24]) ).
cnf(c_0_62,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_23,c_0_43]) ).
fof(c_0_63,negated_conjecture,
star(star(esk1_0)) != star(esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])])])]) ).
cnf(c_0_64,plain,
( ~ leq(multiplication(X1,X2),X1)
| multiplication(X1,addition(one,multiplication(X2,star(X2)))) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_57]),c_0_24]),c_0_58]),c_0_24]) ).
cnf(c_0_65,plain,
( multiplication(addition(X1,one),X2) != X2
| leq(multiplication(star(X1),X2),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_24]),c_0_50]) ).
cnf(c_0_66,plain,
multiplication(star(X1),star(star(X1))) = star(star(X1)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
star(star(esk1_0)) != star(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_68,plain,
star(star(X1)) = star(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_62]),c_0_66]),c_0_55])]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KLE039+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n009.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.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sun Sep 20 22:40:28 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.54 Running first-order theorem proving
% 0.27/0.54 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
% 1.26/0.79 % Version: 3.5.1
% 1.26/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.26/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.26/0.79 % Starting new_bool_3 with 300s (1) cores
% 1.26/0.79 % Starting new_bool_1 with 300s (1) cores
% 1.26/0.79 % Starting sh5l with 300s (1) cores
% 1.26/0.79 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 205658 completed with status 0
% 1.26/0.79 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.26/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.26/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.26/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.26/0.79 % No SInE strategy applied
% 1.26/0.79 % Search class: FHUSM-FFSF21-MFFFFFNN
% 1.26/0.79 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.26/0.79 % Starting SubtermCWHack with 136s (1) cores
% 1.26/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.26/0.79 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 1.26/0.79 % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 1.26/0.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.26/0.79 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 205666 completed with status 0
% 1.26/0.79 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.26/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.26/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.26/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.26/0.79 % No SInE strategy applied
% 1.26/0.79 % Search class: FHUSM-FFSF21-MFFFFFNN
% 1.26/0.79 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.26/0.79 % Starting SubtermCWHack with 136s (1) cores
% 1.26/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.26/0.79 % Preprocessing time : 0.001 s
% 1.26/0.79 % Presaturation interreduction done
% 1.26/0.79
% 1.26/0.79 % Proof found!
% 1.26/0.79 % SZS status Theorem
% 1.26/0.79 % SZS output start CNFRefutation
% See solution above
% 1.26/0.79 % Parsed axioms : 17
% 1.26/0.79 % Removed by relevancy pruning/SinE : 0
% 1.26/0.79 % Initial clauses : 18
% 1.26/0.79 % Removed in clause preprocessing : 0
% 1.26/0.79 % Initial clauses in saturation : 18
% 1.26/0.79 % Processed clauses : 3439
% 1.26/0.79 % ...of these trivial : 126
% 1.26/0.79 % ...subsumed : 2917
% 1.26/0.79 % ...remaining for further processing : 396
% 1.26/0.79 % Other redundant clauses eliminated : 37
% 1.26/0.79 % Clauses deleted for lack of memory : 0
% 1.26/0.79 % Backward-subsumed : 29
% 1.26/0.79 % Backward-rewritten : 87
% 1.26/0.79 % Generated clauses : 19120
% 1.26/0.79 % ...of the previous two non-redundant : 13306
% 1.26/0.79 % ...aggressively subsumed : 0
% 1.26/0.79 % Contextual simplify-reflections : 3
% 1.26/0.79 % Paramodulations : 19083
% 1.26/0.79 % Factorizations : 0
% 1.26/0.79 % NegExts : 0
% 1.26/0.79 % Equation resolutions : 37
% 1.26/0.79 % Disequality decompositions : 0
% 1.26/0.79 % Total rewrite steps : 25559
% 1.26/0.79 % ...of those cached : 23839
% 1.26/0.79 % Propositional unsat checks : 0
% 1.26/0.79 % Propositional check models : 0
% 1.26/0.79 % Propositional check unsatisfiable : 0
% 1.26/0.79 % Propositional clauses : 0
% 1.26/0.79 % Propositional clauses after purity: 0
% 1.26/0.79 % Propositional unsat core size : 0
% 1.26/0.79 % Propositional preprocessing time : 0.000
% 1.26/0.79 % Propositional encoding time : 0.000
% 1.26/0.79 % Propositional solver time : 0.000
% 1.26/0.79 % Success case prop preproc time : 0.000
% 1.26/0.79 % Success case prop encoding time : 0.000
% 1.26/0.79 % Success case prop solver time : 0.000
% 1.26/0.79 % Current number of processed clauses : 262
% 1.26/0.79 % Positive orientable unit clauses : 54
% 1.26/0.79 % Positive unorientable unit clauses: 4
% 1.26/0.79 % Negative unit clauses : 36
% 1.26/0.79 % Non-unit-clauses : 168
% 1.26/0.79 % Current number of unprocessed clauses: 9632
% 1.26/0.79 % ...number of literals in the above : 21612
% 1.26/0.79 % Current number of archived formulas : 0
% 1.26/0.79 % Current number of archived clauses : 134
% 1.26/0.79 % Clause-clause subsumption calls (NU) : 7926
% 1.26/0.79 % Rec. Clause-clause subsumption calls : 7895
% 1.26/0.79 % Non-unit clause-clause subsumptions : 1631
% 1.26/0.79 % Unit Clause-clause subsumption calls : 691
% 1.26/0.79 % Rewrite failures with RHS unbound : 0
% 1.26/0.79 % BW rewrite match attempts : 230
% 1.26/0.79 % BW rewrite match successes : 111
% 1.26/0.79 % Condensation attempts : 0
% 1.26/0.79 % Condensation successes : 0
% 1.26/0.79 % Termbank termtop insertions : 207649
% 1.26/0.79 % Search garbage collected termcells : 57
% 1.26/0.79
% 1.26/0.79 % -------------------------------------------------
% 1.26/0.79 % User time : 0.204 s
% 1.26/0.79 % System time : 0.012 s
% 1.26/0.79 % Total time : 0.216 s
% 1.26/0.79 % Maximum resident set size: 3648 pages
% 1.26/0.79
% 1.26/0.79 % -------------------------------------------------
% 1.26/0.79 % User time : 0.911 s
% 1.26/0.79 % System time : 0.061 s
% 1.26/0.79 % Total time : 0.972 s
% 1.26/0.79 % Maximum resident set size: 4864 pages
% 1.26/0.79 % E exiting
%------------------------------------------------------------------------------