%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE145+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:26 PM UTC 2026
% Result : Theorem 128.09s 20.13s
% Output : CNFRefutation 128.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 99 ( 76 unt; 0 def)
% Number of atoms : 124 ( 69 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 23 ~; 19 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 169 ( 6 sgn 62 !; 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/KLE004+0.ax',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
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(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
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(infty_coinduction,axiom,
! [X1,X2,X3] :
( leq(X3,addition(multiplication(X1,X3),X2))
=> leq(X3,multiplication(strong_iteration(X1),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_coinduction) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',order) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
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(goals,conjecture,
! [X4] :
( leq(strong_iteration(X4),star(strong_iteration(X4)))
& leq(star(strong_iteration(X4)),strong_iteration(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_17,plain,
! [X32,X33,X34] : addition(X34,addition(X33,X32)) = addition(addition(X34,X33),X32),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_18,plain,
! [X35] : addition(X35,X35) = X35,
inference(variable_rename,[status(thm)],[idempotence]) ).
cnf(c_0_19,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X30,X31] : addition(X30,X31) = addition(X31,X30),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_22,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_24,plain,
! [X17] : addition(one,multiplication(X17,star(X17))) = star(X17),
inference(variable_rename,[status(thm)],[star_unfold1]) ).
fof(c_0_25,plain,
! [X27,X28,X29] : multiplication(addition(X27,X28),X29) = addition(multiplication(X27,X29),multiplication(X28,X29)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
fof(c_0_26,plain,
! [X37] : multiplication(one,X37) = X37,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_27,plain,
! [X18] : addition(one,multiplication(star(X18),X18)) = star(X18),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
fof(c_0_28,plain,
! [X24,X25,X26] : multiplication(X24,addition(X25,X26)) = addition(multiplication(X24,X25),multiplication(X24,X26)),
inference(variable_rename,[status(thm)],[distributivity1]) ).
fof(c_0_29,plain,
! [X36] : multiplication(X36,one) = X36,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_30,plain,
! [X12,X13,X14] :
( leq(X14,multiplication(strong_iteration(X12),X13))
| ~ leq(X14,addition(multiplication(X12,X14),X13)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infty_coinduction])])]) ).
fof(c_0_31,plain,
! [X15,X16] :
( ( leq(X15,X16)
| addition(X15,X16) != X16 )
& ( addition(X15,X16) = X16
| ~ leq(X15,X16) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_32,plain,
! [X19] : strong_iteration(X19) = addition(multiplication(X19,strong_iteration(X19)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
cnf(c_0_33,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_34,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( ~ leq(X1,addition(multiplication(X2,X1),X3))
| leq(X1,multiplication(strong_iteration(X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_43,plain,
! [X39] : multiplication(zero,X39) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_44,plain,
! [X38] : addition(X38,zero) = X38,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_45,plain,
! [X9,X10,X11] :
( leq(multiplication(X10,star(X9)),X11)
| ~ leq(addition(multiplication(X11,X9),X10),X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])])]) ).
cnf(c_0_46,plain,
addition(star(X1),multiplication(X1,star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23]) ).
cnf(c_0_47,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_23]) ).
cnf(c_0_48,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_37]),c_0_23]) ).
cnf(c_0_49,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_23]) ).
cnf(c_0_50,plain,
( addition(X1,addition(multiplication(X2,X1),X3)) != addition(multiplication(X2,X1),X3)
| leq(X1,multiplication(strong_iteration(X2),X3)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_51,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_42,c_0_23]) ).
cnf(c_0_52,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_53,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_54,plain,
! [X21,X22,X23] : multiplication(X21,multiplication(X22,X23)) = multiplication(multiplication(X21,X22),X23),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_55,plain,
( ~ leq(addition(multiplication(X1,X2),X3),X1)
| leq(multiplication(X3,star(X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_57,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_58,plain,
addition(X1,addition(X2,addition(X3,X1))) = addition(X2,addition(X3,X1)),
inference(spm,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_59,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_60,plain,
leq(X1,multiplication(strong_iteration(X2),X1)),
inference(spm,[status(thm)],[c_0_50,c_0_33]) ).
cnf(c_0_61,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_62,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_63,plain,
( ~ leq(addition(X2,addition(multiplication(X4,X3),X1)),X4)
| leq(multiplication(addition(X1,X2),star(X3)),X4) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_64,plain,
addition(one,addition(multiplication(star(X1),X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_65,plain,
multiplication(addition(one,X1),star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_57,c_0_23]) ).
cnf(c_0_66,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_22,c_0_37]) ).
cnf(c_0_67,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_19]) ).
cnf(c_0_68,plain,
leq(X1,multiplication(strong_iteration(X2),addition(X3,X1))),
inference(spm,[status(thm)],[c_0_50,c_0_58]) ).
cnf(c_0_69,plain,
( ~ leq(addition(star(X2),X1),star(X2))
| leq(multiplication(X1,star(addition(X2,one))),star(X2)) ),
inference(spm,[status(thm)],[c_0_55,c_0_59]) ).
cnf(c_0_70,plain,
leq(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_36]) ).
cnf(c_0_71,plain,
( ~ leq(multiplication(addition(X3,X1),X2),X3)
| leq(multiplication(X1,multiplication(X2,star(X2))),X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_35]),c_0_62]) ).
cnf(c_0_72,plain,
( ~ leq(addition(star(X2),X1),star(X2))
| leq(multiplication(addition(X1,one),star(X2)),star(X2)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_73,plain,
multiplication(star(X1),star(star(X1))) = star(star(X1)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,plain,
addition(one,addition(X1,multiplication(star(X2),X2))) = addition(X1,star(X2)),
inference(spm,[status(thm)],[c_0_67,c_0_37]) ).
cnf(c_0_75,plain,
( ~ leq(X1,addition(X3,multiplication(X2,X1)))
| leq(X1,multiplication(strong_iteration(X2),X3)) ),
inference(spm,[status(thm)],[c_0_40,c_0_23]) ).
cnf(c_0_76,plain,
addition(one,multiplication(X1,multiplication(X2,star(multiplication(X1,X2))))) = star(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_34,c_0_62]) ).
fof(c_0_77,negated_conjecture,
~ ! [X4] :
( leq(strong_iteration(X4),star(strong_iteration(X4)))
& leq(star(strong_iteration(X4)),strong_iteration(X4)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_78,plain,
leq(X1,addition(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_61]),c_0_36]) ).
cnf(c_0_79,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_69,c_0_36]),c_0_23]),c_0_66]),c_0_70])]) ).
cnf(c_0_80,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_81,plain,
( ~ leq(multiplication(X1,X2),X1)
| leq(multiplication(X1,multiplication(X2,star(X2))),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_20]),c_0_62]) ).
cnf(c_0_82,plain,
leq(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_71,c_0_72]),c_0_36]),c_0_73]),c_0_20]),c_0_70])]) ).
cnf(c_0_83,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_47]),c_0_23]),c_0_66]),c_0_37]) ).
cnf(c_0_84,plain,
( ~ leq(multiplication(X1,star(multiplication(X2,X1))),star(multiplication(X2,X1)))
| leq(multiplication(X1,star(multiplication(X2,X1))),strong_iteration(X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_39]) ).
cnf(c_0_85,plain,
multiplication(strong_iteration(X1),star(multiplication(X1,strong_iteration(X1)))) = star(multiplication(X1,strong_iteration(X1))),
inference(spm,[status(thm)],[c_0_65,c_0_51]) ).
fof(c_0_86,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),star(strong_iteration(esk1_0)))
| ~ leq(star(strong_iteration(esk1_0)),strong_iteration(esk1_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_77])])])]) ).
cnf(c_0_87,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_78,c_0_23]) ).
cnf(c_0_88,plain,
leq(star(addition(one,X1)),star(X1)),
inference(spm,[status(thm)],[c_0_79,c_0_23]) ).
cnf(c_0_89,plain,
( ~ leq(multiplication(X1,X2),X1)
| multiplication(X1,star(X2)) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_23]),c_0_49]),c_0_23]),c_0_34]) ).
cnf(c_0_90,plain,
star(star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_82]),c_0_23]),c_0_83]) ).
cnf(c_0_91,plain,
leq(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_70])]) ).
cnf(c_0_92,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),star(strong_iteration(esk1_0)))
| ~ leq(star(strong_iteration(esk1_0)),strong_iteration(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_93,plain,
leq(X1,star(X1)),
inference(spm,[status(thm)],[c_0_87,c_0_83]) ).
cnf(c_0_94,plain,
leq(star(strong_iteration(X1)),star(multiplication(X1,strong_iteration(X1)))),
inference(spm,[status(thm)],[c_0_88,c_0_51]) ).
cnf(c_0_95,plain,
star(multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_85]),c_0_90]),c_0_85]),c_0_91])]) ).
cnf(c_0_96,negated_conjecture,
~ leq(star(strong_iteration(esk1_0)),strong_iteration(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]) ).
cnf(c_0_97,plain,
leq(star(strong_iteration(X1)),strong_iteration(X1)),
inference(rw,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE145+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 % Computer : n009.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Sun Sep 20 22:46:28 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.49 Running first-order theorem proving
% 0.16/0.50 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
% 128.09/20.13 % Version: 3.5.1
% 128.09/20.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 128.09/20.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 128.09/20.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 128.09/20.13 % Starting new_bool_3 with 300s (1) cores
% 128.09/20.13 % Starting new_bool_1 with 300s (1) cores
% 128.09/20.13 % Starting sh5l with 300s (1) cores
% 128.09/20.13 % new_bool_1 with pid 217326 completed with status 0
% 128.09/20.13 % Result found by new_bool_1
% 128.09/20.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 128.09/20.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 128.09/20.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 128.09/20.13 % Starting new_bool_3 with 300s (1) cores
% 128.09/20.13 % Starting new_bool_1 with 300s (1) cores
% 128.09/20.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 128.09/20.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 128.09/20.13 % Search class: FHHSM-FFSF21-MFFFFFNN
% 128.09/20.13 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 128.09/20.13 % Starting SubtermCWHack with 31s (1) cores
% 128.09/20.13 % SubtermCWHack with pid 217334 completed with status 0
% 128.09/20.13 % Result found by SubtermCWHack
% 128.09/20.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 128.09/20.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 128.09/20.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 128.09/20.13 % Starting new_bool_3 with 300s (1) cores
% 128.09/20.13 % Starting new_bool_1 with 300s (1) cores
% 128.09/20.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 128.09/20.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 128.09/20.13 % Search class: FHHSM-FFSF21-MFFFFFNN
% 128.09/20.13 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 128.09/20.13 % Starting SubtermCWHack with 31s (1) cores
% 128.09/20.13 % Preprocessing time : 0.002 s
% 128.09/20.13
% 128.09/20.13 % Proof found!
% 128.09/20.13 % SZS status Theorem
% 128.09/20.13 % SZS output start CNFRefutation
% See solution above
% 128.09/20.13 % Parsed axioms : 19
% 128.09/20.13 % Removed by relevancy pruning/SinE : 0
% 128.09/20.13 % Initial clauses : 20
% 128.09/20.13 % Removed in clause preprocessing : 0
% 128.09/20.13 % Initial clauses in saturation : 20
% 128.09/20.13 % Processed clauses : 36396
% 128.09/20.13 % ...of these trivial : 4014
% 128.09/20.13 % ...subsumed : 29199
% 128.09/20.13 % ...remaining for further processing : 3183
% 128.09/20.13 % Other redundant clauses eliminated : 169
% 128.09/20.13 % Clauses deleted for lack of memory : 0
% 128.09/20.13 % Backward-subsumed : 97
% 128.09/20.13 % Backward-rewritten : 378
% 128.09/20.13 % Generated clauses : 795828
% 128.09/20.13 % ...of the previous two non-redundant : 570764
% 128.09/20.13 % ...aggressively subsumed : 0
% 128.09/20.13 % Contextual simplify-reflections : 1
% 128.09/20.13 % Paramodulations : 795659
% 128.09/20.13 % Factorizations : 0
% 128.09/20.13 % NegExts : 0
% 128.09/20.13 % Equation resolutions : 169
% 128.09/20.13 % Disequality decompositions : 0
% 128.09/20.13 % Total rewrite steps : 1044825
% 128.09/20.13 % ...of those cached : 916040
% 128.09/20.13 % Propositional unsat checks : 0
% 128.09/20.13 % Propositional check models : 0
% 128.09/20.13 % Propositional check unsatisfiable : 0
% 128.09/20.13 % Propositional clauses : 0
% 128.09/20.13 % Propositional clauses after purity: 0
% 128.09/20.13 % Propositional unsat core size : 0
% 128.09/20.13 % Propositional preprocessing time : 0.000
% 128.09/20.13 % Propositional encoding time : 0.000
% 128.09/20.13 % Propositional solver time : 0.000
% 128.09/20.13 % Success case prop preproc time : 0.000
% 128.09/20.13 % Success case prop encoding time : 0.000
% 128.09/20.13 % Success case prop solver time : 0.000
% 128.09/20.13 % Current number of processed clauses : 2708
% 128.09/20.13 % Positive orientable unit clauses : 1450
% 128.09/20.13 % Positive unorientable unit clauses: 45
% 128.09/20.13 % Negative unit clauses : 271
% 128.09/20.13 % Non-unit-clauses : 942
% 128.09/20.13 % Current number of unprocessed clauses: 533093
% 128.09/20.13 % ...number of literals in the above : 823488
% 128.09/20.13 % Current number of archived formulas : 0
% 128.09/20.13 % Current number of archived clauses : 475
% 128.09/20.13 % Clause-clause subsumption calls (NU) : 119269
% 128.09/20.13 % Rec. Clause-clause subsumption calls : 118922
% 128.09/20.13 % Non-unit clause-clause subsumptions : 6234
% 128.09/20.13 % Unit Clause-clause subsumption calls : 7754
% 128.09/20.13 % Rewrite failures with RHS unbound : 0
% 128.09/20.13 % BW rewrite match attempts : 20004
% 128.09/20.13 % BW rewrite match successes : 349
% 128.09/20.13 % Condensation attempts : 0
% 128.09/20.13 % Condensation successes : 0
% 128.09/20.13 % Termbank termtop insertions : 11918961
% 128.09/20.13 % Search garbage collected termcells : 82
% 128.09/20.13
% 128.09/20.13 % -------------------------------------------------
% 128.09/20.13 % User time : 18.528 s
% 128.09/20.13 % System time : 0.741 s
% 128.09/20.13 % Total time : 19.269 s
% 128.09/20.13 % Maximum resident set size: 3652 pages
% 128.09/20.13
% 128.09/20.13 % -------------------------------------------------
% 128.09/20.13 % User time : 18.529 s
% 128.09/20.13 % System time : 0.751 s
% 128.09/20.13 % Total time : 19.280 s
% 128.09/20.13 % Maximum resident set size: 4608 pages
% 128.09/20.13 % E exiting
%------------------------------------------------------------------------------