%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE043+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 : n013.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:43 PM UTC 2026
% Result : Theorem 14.89s 2.65s
% Output : CNFRefutation 14.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 73 ( 47 unt; 0 def)
% Number of atoms : 101 ( 61 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 58 ( 30 ~; 22 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 9 ( 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 : 118 ( 2 sgn 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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_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_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).
fof(goals,conjecture,
! [X4,X5] :
( leq(addition(X5,multiplication(multiplication(X4,star(X4)),X5)),multiplication(star(X4),X5))
& leq(multiplication(star(X4),X5),addition(X5,multiplication(multiplication(X4,star(X4)),X5))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
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(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).
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(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(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',right_annihilation) ).
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(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(c_0_16,plain,
! [X33,X34,X35] :
( leq(multiplication(X35,star(X34)),X33)
| ~ leq(addition(multiplication(X33,X34),X35),X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])])]) ).
fof(c_0_17,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_18,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X1)
| leq(multiplication(X3,star(X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X28] : leq(addition(one,multiplication(X28,star(X28))),star(X28)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_21,plain,
! [X25] : multiplication(zero,X25) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_22,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_23,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_24,plain,
( ~ leq(addition(X2,X1),one)
| leq(multiplication(X1,star(X2)),one) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_25,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_26,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( ~ leq(addition(X1,one),one)
| leq(star(X1),one) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_31,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
leq(one,star(zero)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
fof(c_0_33,negated_conjecture,
~ ! [X4,X5] :
( leq(addition(X5,multiplication(multiplication(X4,star(X4)),X5)),multiplication(star(X4),X5))
& leq(multiplication(star(X4),X5),addition(X5,multiplication(multiplication(X4,star(X4)),X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_34,plain,
! [X30,X31,X32] :
( leq(multiplication(star(X30),X32),X31)
| ~ leq(addition(multiplication(X30,X31),X32),X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])])]) ).
cnf(c_0_35,plain,
( ~ leq(addition(X1,one),one)
| addition(one,star(X1)) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_36,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_37,plain,
addition(one,star(zero)) = star(zero),
inference(spm,[status(thm)],[c_0_29,c_0_32]) ).
fof(c_0_38,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_39,negated_conjecture,
( ~ leq(addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)),multiplication(star(esk1_0),esk2_0))
| ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])]) ).
cnf(c_0_40,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X2)
| leq(multiplication(star(X1),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_42,plain,
! [X13,X14,X15] : multiplication(X13,multiplication(X14,X15)) = multiplication(multiplication(X13,X14),X15),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_43,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_44,plain,
( ~ leq(one,one)
| star(zero) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_45,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_46,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_47,plain,
! [X24] : multiplication(X24,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_48,negated_conjecture,
( ~ leq(addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)),multiplication(star(esk1_0),esk2_0))
| ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
( addition(X3,addition(multiplication(X1,X3),X2)) != X3
| leq(multiplication(star(X1),X2),X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31]) ).
cnf(c_0_50,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,plain,
( addition(X3,addition(multiplication(X3,X2),X1)) != X3
| leq(multiplication(X1,star(X2)),X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_41]),c_0_31]) ).
cnf(c_0_53,plain,
star(zero) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_41]),c_0_45])]) ).
cnf(c_0_54,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_55,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( ~ leq(addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))),multiplication(star(esk1_0),esk2_0))
| addition(esk2_0,addition(multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)),addition(esk2_0,multiplication(esk1_0,addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_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(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_50]),c_0_50]),c_0_31]),c_0_51]),c_0_50]) ).
cnf(c_0_57,plain,
( addition(X2,X1) != X2
| leq(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55]),c_0_36]) ).
fof(c_0_58,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_59,negated_conjecture,
( addition(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))) != multiplication(star(esk1_0),esk2_0)
| addition(esk2_0,addition(multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)),addition(esk2_0,multiplication(esk1_0,addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_31,c_0_51]) ).
cnf(c_0_61,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
fof(c_0_62,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_63,negated_conjecture,
( addition(esk2_0,addition(multiplication(star(esk1_0),esk2_0),multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))) != multiplication(star(esk1_0),esk2_0)
| addition(esk2_0,addition(esk2_0,multiplication(esk1_0,addition(esk2_0,addition(multiplication(star(esk1_0),esk2_0),multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_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)],[c_0_59,c_0_60]),c_0_61]),c_0_51]),c_0_31]),c_0_60]),c_0_31]) ).
cnf(c_0_64,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_51,c_0_45]) ).
cnf(c_0_65,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_66,negated_conjecture,
( addition(esk2_0,addition(multiplication(star(esk1_0),esk2_0),multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))) != multiplication(star(esk1_0),esk2_0)
| addition(esk2_0,multiplication(esk1_0,addition(esk2_0,addition(multiplication(star(esk1_0),esk2_0),multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))) ),
inference(rw,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_19]),c_0_31]) ).
cnf(c_0_68,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_29,c_0_26]),c_0_51]),c_0_31]) ).
cnf(c_0_69,negated_conjecture,
( addition(esk2_0,multiplication(addition(esk1_0,one),multiplication(star(esk1_0),esk2_0))) != multiplication(star(esk1_0),esk2_0)
| addition(esk2_0,multiplication(esk1_0,addition(esk2_0,multiplication(addition(esk1_0,one),multiplication(star(esk1_0),esk2_0))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_67]) ).
cnf(c_0_70,plain,
addition(X1,multiplication(X2,multiplication(X3,X1))) = multiplication(addition(one,multiplication(X2,X3)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_50]),c_0_31]) ).
cnf(c_0_71,plain,
addition(one,multiplication(addition(X1,one),star(X1))) = star(X1),
inference(rw,[status(thm)],[c_0_68,c_0_67]) ).
cnf(c_0_72,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)],[c_0_69,c_0_70]),c_0_71]),c_0_70]),c_0_70]),c_0_70]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE043+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.13/0.36 % Computer : n013.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8046.5625MB
% 0.13/0.36 % OS : Linux 6.8.0-71-generic
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun Sep 20 22:40:06 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 14.89/2.65 % Version: 3.5.1
% 14.89/2.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.89/2.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.89/2.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.89/2.65 % Starting new_bool_3 with 300s (1) cores
% 14.89/2.65 % Starting new_bool_1 with 300s (1) cores
% 14.89/2.65 % Starting sh5l with 300s (1) cores
% 14.89/2.65 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3564712 completed with status 0
% 14.89/2.65 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 14.89/2.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.89/2.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.89/2.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.89/2.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.89/2.65 % No SInE strategy applied
% 14.89/2.65 % Search class: FHHSM-FFSF21-MFFFFFNN
% 14.89/2.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.89/2.65 % Starting SubtermCWHack with 136s (1) cores
% 14.89/2.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.89/2.65 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 14.89/2.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 14.89/2.65 % Starting new_bool_3 with 136s (1) cores
% 14.89/2.65 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 3564721 completed with status 0
% 14.89/2.65 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 14.89/2.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.89/2.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.89/2.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.89/2.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.89/2.65 % No SInE strategy applied
% 14.89/2.65 % Search class: FHHSM-FFSF21-MFFFFFNN
% 14.89/2.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.89/2.65 % Starting SubtermCWHack with 136s (1) cores
% 14.89/2.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.89/2.65 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 14.89/2.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 14.89/2.65 % Preprocessing time : 0.002 s
% 14.89/2.65 % Presaturation interreduction done
% 14.89/2.65
% 14.89/2.65 % Proof found!
% 14.89/2.65 % SZS status Theorem
% 14.89/2.65 % SZS output start CNFRefutation
% See solution above
% 14.89/2.65 % Parsed axioms : 17
% 14.89/2.65 % Removed by relevancy pruning/SinE : 0
% 14.89/2.65 % Initial clauses : 18
% 14.89/2.65 % Removed in clause preprocessing : 0
% 14.89/2.65 % Initial clauses in saturation : 18
% 14.89/2.65 % Processed clauses : 7013
% 14.89/2.65 % ...of these trivial : 185
% 14.89/2.65 % ...subsumed : 5896
% 14.89/2.65 % ...remaining for further processing : 932
% 14.89/2.65 % Other redundant clauses eliminated : 264
% 14.89/2.65 % Clauses deleted for lack of memory : 0
% 14.89/2.65 % Backward-subsumed : 54
% 14.89/2.65 % Backward-rewritten : 166
% 14.89/2.65 % Generated clauses : 60176
% 14.89/2.65 % ...of the previous two non-redundant : 50607
% 14.89/2.65 % ...aggressively subsumed : 0
% 14.89/2.65 % Contextual simplify-reflections : 6
% 14.89/2.65 % Paramodulations : 59912
% 14.89/2.65 % Factorizations : 0
% 14.89/2.65 % NegExts : 0
% 14.89/2.65 % Equation resolutions : 264
% 14.89/2.65 % Disequality decompositions : 0
% 14.89/2.65 % Total rewrite steps : 81348
% 14.89/2.65 % ...of those cached : 72443
% 14.89/2.65 % Propositional unsat checks : 0
% 14.89/2.65 % Propositional check models : 0
% 14.89/2.65 % Propositional check unsatisfiable : 0
% 14.89/2.65 % Propositional clauses : 0
% 14.89/2.65 % Propositional clauses after purity: 0
% 14.89/2.65 % Propositional unsat core size : 0
% 14.89/2.65 % Propositional preprocessing time : 0.000
% 14.89/2.65 % Propositional encoding time : 0.000
% 14.89/2.65 % Propositional solver time : 0.000
% 14.89/2.65 % Success case prop preproc time : 0.000
% 14.89/2.65 % Success case prop encoding time : 0.000
% 14.89/2.65 % Success case prop solver time : 0.000
% 14.89/2.65 % Current number of processed clauses : 694
% 14.89/2.65 % Positive orientable unit clauses : 89
% 14.89/2.65 % Positive unorientable unit clauses: 16
% 14.89/2.65 % Negative unit clauses : 2
% 14.89/2.65 % Non-unit-clauses : 587
% 14.89/2.65 % Current number of unprocessed clauses: 43092
% 14.89/2.65 % ...number of literals in the above : 92184
% 14.89/2.65 % Current number of archived formulas : 0
% 14.89/2.65 % Current number of archived clauses : 238
% 14.89/2.65 % Clause-clause subsumption calls (NU) : 66554
% 14.89/2.65 % Rec. Clause-clause subsumption calls : 51569
% 14.89/2.65 % Non-unit clause-clause subsumptions : 4265
% 14.89/2.65 % Unit Clause-clause subsumption calls : 309
% 14.89/2.65 % Rewrite failures with RHS unbound : 0
% 14.89/2.65 % BW rewrite match attempts : 981
% 14.89/2.65 % BW rewrite match successes : 256
% 14.89/2.65 % Condensation attempts : 0
% 14.89/2.65 % Condensation successes : 0
% 14.89/2.65 % Termbank termtop insertions : 904857
% 14.89/2.65 % Search garbage collected termcells : 76
% 14.89/2.65
% 14.89/2.65 % -------------------------------------------------
% 14.89/2.65 % User time : 2.056 s
% 14.89/2.65 % System time : 0.070 s
% 14.89/2.65 % Total time : 2.127 s
% 14.89/2.65 % Maximum resident set size: 3612 pages
% 14.89/2.65
% 14.89/2.65 % -------------------------------------------------
% 14.89/2.65 % User time : 10.046 s
% 14.89/2.65 % System time : 0.394 s
% 14.89/2.65 % Total time : 10.440 s
% 14.89/2.65 % Maximum resident set size: 4608 pages
% 14.89/2.65 % E exiting
%------------------------------------------------------------------------------