%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE010+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 : n026.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:35 PM UTC 2026
% Result : Theorem 2.97s 0.84s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 76 ( 47 unt; 0 def)
% Number of atoms : 133 ( 63 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 101 ( 44 ~; 36 |; 14 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 113 ( 7 sgn 54 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(goals,conjecture,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> ( leq(addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one)
& leq(one,addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
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/KLE001+0.ax',right_distributivity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( addition(X4,X5) = one
& multiplication(X5,X4) = zero
& multiplication(X4,X5) = zero ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
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/KLE001+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
fof(c_0_15,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_16,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_17,negated_conjecture,
~ ! [X4,X5] :
( ( test(X4)
& test(X5) )
=> ( leq(addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one)
& leq(one,addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5)))) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_18,plain,
! [X34,X35] :
( ( ~ test(X34)
| c(X34) = X35
| ~ complement(X34,X35) )
& ( ~ test(X34)
| complement(X34,X35)
| c(X34) != X35 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).
fof(c_0_19,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_20,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_23,negated_conjecture,
( ( ~ leq(addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0)))) )
& test(esk2_0)
& test(esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
fof(c_0_24,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_25,plain,
! [X32,X33] :
( ( complement(X33,X32)
| addition(X32,X33) != one
| multiplication(X33,X32) != zero
| multiplication(X32,X33) != zero )
& ( ~ complement(X33,X32)
| addition(X32,X33) = one )
& ( ~ complement(X33,X32)
| multiplication(X33,X32) = zero )
& ( ~ complement(X33,X32)
| multiplication(X32,X33) = zero ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])]) ).
cnf(c_0_26,plain,
( ~ test(X1)
| c(X1) != X2
| complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,plain,
! [X28,X30,X31] :
( ( test(X30)
| ~ complement(X31,X30) )
& ( complement(esk1_1(X28),X28)
| ~ test(X28) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ leq(addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_33,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_34,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
addition(multiplication(X1,X2),addition(multiplication(X1,X3),X4)) = addition(multiplication(X1,addition(X2,X3)),X4),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_38,plain,
( ~ test(X1)
| complement(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,negated_conjecture,
( ~ leq(addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0))))),one)
| ~ leq(one,addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_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_31,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]) ).
cnf(c_0_40,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,plain,
( ~ test(X1)
| addition(X1,c(X1)) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32]) ).
cnf(c_0_42,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_43,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_44,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_45,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_46,plain,
leq(multiplication(X1,X2),addition(multiplication(X1,addition(X2,X3)),X4)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,plain,
( ~ test(X1)
| addition(X1,esk1_1(X1)) = one ),
inference(spm,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( ~ leq(addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))),one)
| ~ leq(one,addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),multiplication(addition(esk3_0,c(esk3_0)),esk2_0))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_40]) ).
cnf(c_0_49,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_50,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_32]),c_0_20]) ).
cnf(c_0_54,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(spm,[status(thm)],[c_0_41,c_0_45]) ).
cnf(c_0_55,plain,
( ~ test(multiplication(X1,addition(X2,X3)))
| leq(multiplication(X1,X2),one) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
fof(c_0_56,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_57,plain,
! [X25] : multiplication(zero,X25) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_58,plain,
! [X24] : multiplication(X24,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_59,negated_conjecture,
( ~ leq(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0))),one)
| ~ leq(one,addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(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(rw,[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)],[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]),c_0_32]),c_0_20]),c_0_49]),c_0_20]),c_0_29]),c_0_32]),c_0_50]),c_0_52]),c_0_49]),c_0_50]),c_0_51]),c_0_32]),c_0_20]),c_0_49]),c_0_20]),c_0_29]),c_0_32]),c_0_50]),c_0_52]) ).
cnf(c_0_60,negated_conjecture,
addition(esk2_0,addition(X1,c(esk2_0))) = addition(X1,one),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_62,negated_conjecture,
( ~ test(X1)
| leq(multiplication(X1,esk3_0),one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_50]),c_0_52]) ).
cnf(c_0_63,plain,
( addition(X1,X2) != one
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_64,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_65,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_66,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_67,negated_conjecture,
~ leq(addition(one,multiplication(esk2_0,esk3_0)),one),
inference(cn,[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_32]),c_0_36]),c_0_60]),c_0_32])]) ).
cnf(c_0_68,plain,
( ~ test(X1)
| leq(X1,one) ),
inference(spm,[status(thm)],[c_0_36,c_0_47]) ).
cnf(c_0_69,negated_conjecture,
( ~ test(X1)
| addition(one,multiplication(X1,esk3_0)) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_32]) ).
cnf(c_0_70,plain,
( ~ complement(X1,X2)
| test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_71,plain,
complement(zero,one),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_66])])]) ).
cnf(c_0_72,negated_conjecture,
~ test(addition(one,multiplication(esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_73,negated_conjecture,
addition(one,multiplication(esk2_0,esk3_0)) = one,
inference(spm,[status(thm)],[c_0_69,c_0_45]) ).
cnf(c_0_74,plain,
test(one),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE010+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.09/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 22:40:37 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 2.97/0.84 % Version: 3.5.1
% 2.97/0.84 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.97/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.97/0.84 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.97/0.84 % Starting new_bool_3 with 300s (1) cores
% 2.97/0.84 % Starting new_bool_1 with 300s (1) cores
% 2.97/0.84 % Starting sh5l with 300s (1) cores
% 2.97/0.84 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 745939 completed with status 0
% 2.97/0.84 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.97/0.84 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.97/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.97/0.84 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.97/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.97/0.84 % No SInE strategy applied
% 2.97/0.84 % Search class: FGHSM-FFMF21-DFFFFFNN
% 2.97/0.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.97/0.84 % Starting SubtermCWHack with 136s (1) cores
% 2.97/0.84 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.97/0.84 % Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.97/0.84 % Starting new_bool_3 with 136s (1) cores
% 2.97/0.84 % Starting new_bool_1 with 136s (1) cores
% 2.97/0.84 % new_bool_1 with pid 745950 completed with status 0
% 2.97/0.84 % Result found by new_bool_1
% 2.97/0.84 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.97/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.97/0.84 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.97/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.97/0.84 % No SInE strategy applied
% 2.97/0.84 % Search class: FGHSM-FFMF21-DFFFFFNN
% 2.97/0.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.97/0.84 % Starting SubtermCWHack with 136s (1) cores
% 2.97/0.84 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.97/0.84 % Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.97/0.84 % Starting new_bool_3 with 136s (1) cores
% 2.97/0.84 % Starting new_bool_1 with 136s (1) cores
% 2.97/0.84 % Preprocessing time : 0.001 s
% 2.97/0.84 % Presaturation interreduction done
% 2.97/0.84
% 2.97/0.84 % Proof found!
% 2.97/0.84 % SZS status Theorem
% 2.97/0.84 % SZS output start CNFRefutation
% See solution above
% 2.97/0.84 % Parsed axioms : 17
% 2.97/0.84 % Removed by relevancy pruning/SinE : 0
% 2.97/0.84 % Initial clauses : 25
% 2.97/0.84 % Removed in clause preprocessing : 0
% 2.97/0.84 % Initial clauses in saturation : 25
% 2.97/0.84 % Processed clauses : 3928
% 2.97/0.84 % ...of these trivial : 334
% 2.97/0.84 % ...subsumed : 2769
% 2.97/0.84 % ...remaining for further processing : 825
% 2.97/0.84 % Other redundant clauses eliminated : 353
% 2.97/0.84 % Clauses deleted for lack of memory : 0
% 2.97/0.84 % Backward-subsumed : 6
% 2.97/0.84 % Backward-rewritten : 138
% 2.97/0.84 % Generated clauses : 26828
% 2.97/0.84 % ...of the previous two non-redundant : 19870
% 2.97/0.84 % ...aggressively subsumed : 0
% 2.97/0.84 % Contextual simplify-reflections : 20
% 2.97/0.84 % Paramodulations : 26473
% 2.97/0.84 % Factorizations : 2
% 2.97/0.84 % NegExts : 0
% 2.97/0.84 % Equation resolutions : 353
% 2.97/0.84 % Disequality decompositions : 0
% 2.97/0.84 % Total rewrite steps : 33572
% 2.97/0.84 % ...of those cached : 29931
% 2.97/0.84 % Propositional unsat checks : 0
% 2.97/0.84 % Propositional check models : 0
% 2.97/0.84 % Propositional check unsatisfiable : 0
% 2.97/0.84 % Propositional clauses : 0
% 2.97/0.84 % Propositional clauses after purity: 0
% 2.97/0.84 % Propositional unsat core size : 0
% 2.97/0.84 % Propositional preprocessing time : 0.000
% 2.97/0.84 % Propositional encoding time : 0.000
% 2.97/0.84 % Propositional solver time : 0.000
% 2.97/0.84 % Success case prop preproc time : 0.000
% 2.97/0.84 % Success case prop encoding time : 0.000
% 2.97/0.84 % Success case prop solver time : 0.000
% 2.97/0.84 % Current number of processed clauses : 655
% 2.97/0.84 % Positive orientable unit clauses : 213
% 2.97/0.84 % Positive unorientable unit clauses: 4
% 2.97/0.84 % Negative unit clauses : 1
% 2.97/0.84 % Non-unit-clauses : 437
% 2.97/0.84 % Current number of unprocessed clauses: 15789
% 2.97/0.84 % ...number of literals in the above : 36829
% 2.97/0.84 % Current number of archived formulas : 0
% 2.97/0.84 % Current number of archived clauses : 169
% 2.97/0.84 % Clause-clause subsumption calls (NU) : 49550
% 2.97/0.84 % Rec. Clause-clause subsumption calls : 43234
% 2.97/0.84 % Non-unit clause-clause subsumptions : 2564
% 2.97/0.84 % Unit Clause-clause subsumption calls : 6299
% 2.97/0.84 % Rewrite failures with RHS unbound : 0
% 2.97/0.84 % BW rewrite match attempts : 408
% 2.97/0.84 % BW rewrite match successes : 162
% 2.97/0.84 % Condensation attempts : 0
% 2.97/0.84 % Condensation successes : 0
% 2.97/0.84 % Termbank termtop insertions : 340262
% 2.97/0.84 % Search garbage collected termcells : 192
% 2.97/0.84
% 2.97/0.84 % -------------------------------------------------
% 2.97/0.84 % User time : 0.391 s
% 2.97/0.84 % System time : 0.018 s
% 2.97/0.84 % Total time : 0.409 s
% 2.97/0.84 % Maximum resident set size: 3652 pages
% 2.97/0.84
% 2.97/0.84 % -------------------------------------------------
% 2.97/0.84 % User time : 1.894 s
% 2.97/0.84 % System time : 0.105 s
% 2.97/0.84 % Total time : 1.998 s
% 2.97/0.84 % Maximum resident set size: 4864 pages
% 2.97/0.84 % E exiting
%------------------------------------------------------------------------------