%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE044+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 : 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:59:12 PM UTC 2026
% Result : Theorem 43.82s 6.84s
% Output : CNFRefutation 43.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 90 ( 63 unt; 0 def)
% Number of atoms : 119 ( 60 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 27 ~; 23 |; 3 &)
% ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 147 ( 1 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_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(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(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',right_annihilation) ).
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(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).
fof(star_unfold_left,axiom,
! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_left) ).
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(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(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_right_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/KLE002+0.ax',left_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] :
( leq(star(X4),star(addition(one,X4)))
& leq(star(addition(one,X4)),star(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
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(c_0_16,plain,
! [X21] : addition(X21,zero) = X21,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_17,plain,
! [X16,X17] : addition(X16,X17) = addition(X17,X16),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_18,plain,
! [X13,X14,X15] :
( leq(multiplication(X15,star(X14)),X13)
| ~ leq(addition(multiplication(X13,X14),X15),X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])])]) ).
fof(c_0_19,plain,
! [X34] : multiplication(X34,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_20,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X18,X19,X20] : addition(X20,addition(X19,X18)) = addition(addition(X20,X19),X18),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_23,plain,
! [X22] : addition(X22,X22) = X22,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_24,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X1)
| leq(multiplication(X3,star(X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_27,plain,
! [X30] : multiplication(one,X30) = X30,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_28,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,plain,
! [X6,X7] :
( ( leq(X6,X7)
| addition(X6,X7) != X7 )
& ( addition(X6,X7) = X7
| ~ leq(X6,X7) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_31,plain,
! [X9] : leq(addition(one,multiplication(star(X9),X9)),star(X9)),
inference(variable_rename,[status(thm)],[star_unfold_left]) ).
fof(c_0_32,plain,
! [X8] : leq(addition(one,multiplication(X8,star(X8))),star(X8)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
cnf(c_0_33,plain,
( ~ leq(X1,X2)
| leq(multiplication(X1,star(zero)),X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_34,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_38,plain,
! [X23,X24,X25] : multiplication(X23,addition(X24,X25)) = addition(multiplication(X23,X24),multiplication(X23,X25)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_39,plain,
! [X29] : multiplication(X29,one) = X29,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_40,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
( ~ leq(one,X1)
| leq(star(zero),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_42,plain,
! [X26,X27,X28] : multiplication(addition(X26,X27),X28) = addition(multiplication(X26,X28),multiplication(X27,X28)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_43,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_44,plain,
addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_28]),c_0_21]) ).
cnf(c_0_45,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,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_36,c_0_40]),c_0_28]),c_0_21]) ).
cnf(c_0_48,plain,
( ~ leq(one,X1)
| addition(star(zero),X1) = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_41]) ).
cnf(c_0_49,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_28]),c_0_21]),c_0_35]) ).
cnf(c_0_51,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_21]) ).
cnf(c_0_52,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_35,c_0_47]) ).
cnf(c_0_53,plain,
( ~ leq(one,X1)
| addition(X1,star(zero)) = X1 ),
inference(spm,[status(thm)],[c_0_21,c_0_48]) ).
fof(c_0_54,plain,
! [X10,X11,X12] :
( leq(multiplication(star(X10),X12),X11)
| ~ leq(addition(multiplication(X10,X11),X12),X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])])]) ).
cnf(c_0_55,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_43,c_0_47]),c_0_28]),c_0_21]),c_0_35]) ).
cnf(c_0_56,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_34]),c_0_21]) ).
cnf(c_0_57,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,plain,
( ~ leq(addition(X1,multiplication(X3,X2)),X3)
| leq(multiplication(X1,star(X2)),X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_59,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X1)
| leq(multiplication(addition(multiplication(X1,X2),X3),star(X2)),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_60,plain,
( ~ leq(one,one)
| star(zero) = one ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_62,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X2)
| leq(multiplication(star(X1),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_63,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
fof(c_0_64,negated_conjecture,
~ ! [X4] :
( leq(star(X4),star(addition(one,X4)))
& leq(star(addition(one,X4)),star(X4)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_65,plain,
( ~ leq(addition(star(X2),X1),star(X2))
| leq(multiplication(X1,star(addition(X2,one))),star(X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_57]) ).
cnf(c_0_66,plain,
leq(star(X1),star(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_37]),c_0_34]) ).
fof(c_0_67,plain,
! [X31,X32,X33] : multiplication(X31,multiplication(X32,X33)) = multiplication(multiplication(X31,X32),X33),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_68,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X1)
| addition(X1,multiplication(addition(multiplication(X1,X2),X3),star(X2))) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_59]),c_0_21]) ).
cnf(c_0_69,plain,
star(zero) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_29])]) ).
cnf(c_0_70,plain,
( ~ leq(multiplication(X1,X2),X2)
| leq(multiplication(star(X1),multiplication(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_29]) ).
cnf(c_0_71,plain,
multiplication(addition(one,X1),star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_63,c_0_21]) ).
cnf(c_0_72,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[c_0_49,c_0_34]) ).
fof(c_0_73,negated_conjecture,
( ~ leq(star(esk1_0),star(addition(one,esk1_0)))
| ~ leq(star(addition(one,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_64])])])]) ).
cnf(c_0_74,plain,
leq(star(addition(X1,one)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_34]),c_0_21]),c_0_52]),c_0_66])]) ).
cnf(c_0_75,plain,
( ~ leq(addition(X1,multiplication(X2,X3)),X2)
| leq(multiplication(addition(X1,multiplication(X2,X3)),star(X3)),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_43]) ).
cnf(c_0_76,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_77,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_78,plain,
( ~ leq(X2,X1)
| addition(X1,X2) = 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_68,c_0_69]),c_0_25]),c_0_26]),c_0_46]),c_0_25]),c_0_26]) ).
cnf(c_0_79,plain,
leq(multiplication(star(addition(one,X1)),star(X1)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_66])]) ).
cnf(c_0_80,plain,
addition(X1,multiplication(star(X2),X1)) = multiplication(star(X2),X1),
inference(spm,[status(thm)],[c_0_72,c_0_52]) ).
cnf(c_0_81,plain,
multiplication(star(X1),addition(one,X1)) = star(X1),
inference(spm,[status(thm)],[c_0_57,c_0_21]) ).
cnf(c_0_82,negated_conjecture,
( ~ leq(star(esk1_0),star(addition(one,esk1_0)))
| ~ leq(star(addition(one,esk1_0)),star(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_83,plain,
leq(star(addition(one,X1)),star(X1)),
inference(spm,[status(thm)],[c_0_74,c_0_21]) ).
cnf(c_0_84,plain,
( ~ leq(multiplication(X1,addition(one,X2)),X1)
| leq(multiplication(X1,star(X2)),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_71]) ).
cnf(c_0_85,plain,
multiplication(star(addition(one,X1)),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]) ).
cnf(c_0_86,plain,
multiplication(star(addition(one,X1)),addition(one,X1)) = star(addition(one,X1)),
inference(spm,[status(thm)],[c_0_81,c_0_35]) ).
cnf(c_0_87,negated_conjecture,
~ leq(star(esk1_0),star(addition(one,esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]) ).
cnf(c_0_88,plain,
leq(star(X1),star(addition(one,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_66])]) ).
cnf(c_0_89,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE044+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.38 % Computer : n009.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 20 22:40:42 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 43.82/6.84 % Version: 3.5.1
% 43.82/6.84 % Preprocessing class: FSMSSMSSSSSNFFN.
% 43.82/6.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.82/6.84 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 43.82/6.84 % Starting new_bool_3 with 300s (1) cores
% 43.82/6.84 % Starting new_bool_1 with 300s (1) cores
% 43.82/6.84 % Starting sh5l with 300s (1) cores
% 43.82/6.84 % sh5l with pid 206476 completed with status 0
% 43.82/6.84 % Result found by sh5l
% 43.82/6.84 % Preprocessing class: FSMSSMSSSSSNFFN.
% 43.82/6.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.82/6.84 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 43.82/6.84 % Starting new_bool_3 with 300s (1) cores
% 43.82/6.84 % Starting new_bool_1 with 300s (1) cores
% 43.82/6.84 % Starting sh5l with 300s (1) cores
% 43.82/6.84 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 43.82/6.84 % SinE strategy is gf500_gu_R04_F100_L20000
% 43.82/6.84 % Search class: FHHSM-FFSF21-MFFFFFNN
% 43.82/6.84 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 43.82/6.84 % Starting SubtermCWHack with 28s (1) cores
% 43.82/6.84 % SubtermCWHack with pid 206483 completed with status 0
% 43.82/6.84 % Result found by SubtermCWHack
% 43.82/6.84 % Preprocessing class: FSMSSMSSSSSNFFN.
% 43.82/6.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.82/6.84 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 43.82/6.84 % Starting new_bool_3 with 300s (1) cores
% 43.82/6.84 % Starting new_bool_1 with 300s (1) cores
% 43.82/6.84 % Starting sh5l with 300s (1) cores
% 43.82/6.84 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 43.82/6.84 % SinE strategy is gf500_gu_R04_F100_L20000
% 43.82/6.84 % Search class: FHHSM-FFSF21-MFFFFFNN
% 43.82/6.84 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 43.82/6.84 % Starting SubtermCWHack with 28s (1) cores
% 43.82/6.84 % Preprocessing time : 0.002 s
% 43.82/6.84
% 43.82/6.84 % Proof found!
% 43.82/6.84 % SZS status Theorem
% 43.82/6.84 % SZS output start CNFRefutation
% See solution above
% 43.82/6.84 % Parsed axioms : 17
% 43.82/6.84 % Removed by relevancy pruning/SinE : 0
% 43.82/6.84 % Initial clauses : 18
% 43.82/6.84 % Removed in clause preprocessing : 0
% 43.82/6.84 % Initial clauses in saturation : 18
% 43.82/6.84 % Processed clauses : 18240
% 43.82/6.84 % ...of these trivial : 760
% 43.82/6.84 % ...subsumed : 16220
% 43.82/6.84 % ...remaining for further processing : 1260
% 43.82/6.84 % Other redundant clauses eliminated : 92
% 43.82/6.84 % Clauses deleted for lack of memory : 0
% 43.82/6.84 % Backward-subsumed : 78
% 43.82/6.84 % Backward-rewritten : 116
% 43.82/6.84 % Generated clauses : 372252
% 43.82/6.84 % ...of the previous two non-redundant : 344708
% 43.82/6.84 % ...aggressively subsumed : 0
% 43.82/6.84 % Contextual simplify-reflections : 1
% 43.82/6.84 % Paramodulations : 372160
% 43.82/6.84 % Factorizations : 0
% 43.82/6.84 % NegExts : 0
% 43.82/6.84 % Equation resolutions : 92
% 43.82/6.84 % Disequality decompositions : 0
% 43.82/6.84 % Total rewrite steps : 411481
% 43.82/6.84 % ...of those cached : 356081
% 43.82/6.84 % Propositional unsat checks : 0
% 43.82/6.84 % Propositional check models : 0
% 43.82/6.84 % Propositional check unsatisfiable : 0
% 43.82/6.84 % Propositional clauses : 0
% 43.82/6.84 % Propositional clauses after purity: 0
% 43.82/6.84 % Propositional unsat core size : 0
% 43.82/6.84 % Propositional preprocessing time : 0.000
% 43.82/6.84 % Propositional encoding time : 0.000
% 43.82/6.84 % Propositional solver time : 0.000
% 43.82/6.84 % Success case prop preproc time : 0.000
% 43.82/6.84 % Success case prop encoding time : 0.000
% 43.82/6.84 % Success case prop solver time : 0.000
% 43.82/6.84 % Current number of processed clauses : 1066
% 43.82/6.84 % Positive orientable unit clauses : 253
% 43.82/6.84 % Positive unorientable unit clauses: 62
% 43.82/6.84 % Negative unit clauses : 198
% 43.82/6.84 % Non-unit-clauses : 553
% 43.82/6.84 % Current number of unprocessed clauses: 325791
% 43.82/6.84 % ...number of literals in the above : 629859
% 43.82/6.84 % Current number of archived formulas : 0
% 43.82/6.84 % Current number of archived clauses : 194
% 43.82/6.84 % Clause-clause subsumption calls (NU) : 58333
% 43.82/6.84 % Rec. Clause-clause subsumption calls : 58319
% 43.82/6.84 % Non-unit clause-clause subsumptions : 3771
% 43.82/6.84 % Unit Clause-clause subsumption calls : 10779
% 43.82/6.84 % Rewrite failures with RHS unbound : 0
% 43.82/6.84 % BW rewrite match attempts : 3795
% 43.82/6.84 % BW rewrite match successes : 238
% 43.82/6.84 % Condensation attempts : 0
% 43.82/6.84 % Condensation successes : 0
% 43.82/6.84 % Termbank termtop insertions : 6111775
% 43.82/6.84 % Search garbage collected termcells : 70
% 43.82/6.84
% 43.82/6.84 % -------------------------------------------------
% 43.82/6.84 % User time : 5.990 s
% 43.82/6.84 % System time : 0.292 s
% 43.82/6.84 % Total time : 6.282 s
% 43.82/6.84 % Maximum resident set size: 3648 pages
% 43.82/6.84
% 43.82/6.84 % -------------------------------------------------
% 43.82/6.84 % User time : 5.994 s
% 43.82/6.84 % System time : 0.295 s
% 43.82/6.84 % Total time : 6.289 s
% 43.82/6.84 % Maximum resident set size: 4608 pages
% 43.82/6.84 % E exiting
%------------------------------------------------------------------------------