%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE023+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:38 PM UTC 2026
% Result : Theorem 86.39s 13.29s
% Output : CNFRefutation 86.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 87 ( 66 unt; 0 def)
% Number of atoms : 134 ( 84 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 75 ( 28 ~; 25 |; 13 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 117 ( 5 sgn 62 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X6)
& test(X5) )
=> ( addition(multiplication(X5,X4),multiplication(X4,X6)) = multiplication(X4,X6)
=> addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
fof(c_0_16,plain,
! [X35,X36] :
( ( ~ test(X35)
| c(X35) = X36
| ~ complement(X35,X36) )
& ( ~ test(X35)
| complement(X35,X36)
| c(X35) != X36 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).
fof(c_0_17,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X6)
& test(X5) )
=> ( addition(multiplication(X5,X4),multiplication(X4,X6)) = multiplication(X4,X6)
=> addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_18,plain,
( ~ test(X1)
| c(X1) != X2
| complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,negated_conjecture,
( addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) != multiplication(c(esk3_0),esk2_0)
& addition(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)) = multiplication(esk2_0,esk4_0)
& test(esk4_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_20,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_21,plain,
! [X33,X34] :
( ( complement(X34,X33)
| addition(X33,X34) != one
| multiplication(X34,X33) != zero
| multiplication(X33,X34) != zero )
& ( ~ complement(X34,X33)
| addition(X33,X34) = one )
& ( ~ complement(X34,X33)
| multiplication(X34,X33) = zero )
& ( ~ complement(X34,X33)
| multiplication(X33,X34) = 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_22,plain,
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_24,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_25,negated_conjecture,
addition(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)) = multiplication(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_28,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_29,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_30,plain,
( ~ complement(X1,X2)
| multiplication(X1,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,negated_conjecture,
complement(esk3_0,c(esk3_0)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_32,plain,
! [X26] : multiplication(zero,X26) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_33,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk2_0)) = multiplication(esk2_0,esk4_0),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_35,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_36,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_37,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_38,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_40,negated_conjecture,
complement(esk4_0,c(esk4_0)),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
fof(c_0_41,plain,
! [X29,X31,X32] :
( ( test(X31)
| ~ complement(X32,X31) )
& ( complement(esk1_1(X29),X29)
| ~ test(X29) ) ),
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_42,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_43,negated_conjecture,
multiplication(esk3_0,c(esk3_0)) = zero,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_44,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_45,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_46,negated_conjecture,
addition(multiplication(esk2_0,esk4_0),addition(multiplication(esk3_0,esk2_0),X1)) = addition(multiplication(esk2_0,esk4_0),X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_47,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_48,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_49,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_50,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_51,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_38]) ).
cnf(c_0_52,negated_conjecture,
addition(esk4_0,c(esk4_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_26]) ).
cnf(c_0_53,plain,
( ~ complement(X1,X2)
| test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_54,negated_conjecture,
multiplication(esk3_0,multiplication(c(esk3_0),X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_55,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,negated_conjecture,
addition(multiplication(esk2_0,esk4_0),multiplication(addition(esk3_0,X1),esk2_0)) = addition(multiplication(esk2_0,esk4_0),multiplication(X1,esk2_0)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_31]),c_0_26]) ).
cnf(c_0_58,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_59,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_26]) ).
cnf(c_0_60,negated_conjecture,
addition(one,esk4_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_26]) ).
fof(c_0_61,plain,
! [X27,X28] :
( ( leq(X27,X28)
| addition(X27,X28) != X28 )
& ( addition(X27,X28) = X28
| ~ leq(X27,X28) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
cnf(c_0_62,plain,
( ~ test(X1)
| complement(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_63,negated_conjecture,
test(c(esk4_0)),
inference(spm,[status(thm)],[c_0_53,c_0_40]) ).
cnf(c_0_64,negated_conjecture,
multiplication(esk3_0,addition(X1,multiplication(c(esk3_0),X2))) = multiplication(esk3_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_54]),c_0_55]) ).
cnf(c_0_65,negated_conjecture,
addition(multiplication(esk2_0,esk4_0),multiplication(c(esk3_0),esk2_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_56,c_0_57]),c_0_58]),c_0_26]),c_0_59]),c_0_26]),c_0_60]),c_0_50]) ).
cnf(c_0_66,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_67,negated_conjecture,
complement(esk1_1(c(esk4_0)),c(esk4_0)),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,esk4_0)) = multiplication(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
fof(c_0_69,plain,
! [X25] : multiplication(X25,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_70,plain,
( addition(X2,X1) != X2
| leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_26]) ).
cnf(c_0_71,negated_conjecture,
addition(c(esk4_0),esk1_1(c(esk4_0))) = one,
inference(spm,[status(thm)],[c_0_39,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,multiplication(esk4_0,X1))) = multiplication(esk3_0,multiplication(esk2_0,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_68]),c_0_42]),c_0_42]) ).
cnf(c_0_73,negated_conjecture,
multiplication(esk4_0,c(esk4_0)) = zero,
inference(spm,[status(thm)],[c_0_30,c_0_40]) ).
cnf(c_0_74,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_75,plain,
( multiplication(X1,addition(X3,X2)) != multiplication(X1,X3)
| leq(multiplication(X1,X2),multiplication(X1,X3)) ),
inference(spm,[status(thm)],[c_0_70,c_0_49]) ).
cnf(c_0_76,negated_conjecture,
addition(one,c(esk4_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_71]),c_0_26]) ).
cnf(c_0_77,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_74]) ).
cnf(c_0_78,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_55,c_0_26]) ).
cnf(c_0_79,negated_conjecture,
leq(multiplication(X1,c(esk4_0)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_50]) ).
cnf(c_0_80,negated_conjecture,
multiplication(addition(esk3_0,X1),multiplication(esk2_0,c(esk4_0))) = multiplication(X1,multiplication(esk2_0,c(esk4_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_77]),c_0_78]) ).
cnf(c_0_81,negated_conjecture,
leq(multiplication(X1,multiplication(X2,c(esk4_0))),multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_79,c_0_42]) ).
cnf(c_0_82,negated_conjecture,
multiplication(c(esk3_0),multiplication(esk2_0,c(esk4_0))) = multiplication(esk2_0,c(esk4_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_57]),c_0_58]) ).
cnf(c_0_83,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_84,negated_conjecture,
leq(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_85,negated_conjecture,
addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) != multiplication(c(esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE023+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.46 % Computer : n019.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Sun Sep 20 22:38:50 UTC 2026
% 0.18/0.47 % CPUTime :
% 0.18/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 86.39/13.29 % Version: 3.5.1
% 86.39/13.29 % Preprocessing class: FSMSSMSSSSSNFFN.
% 86.39/13.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 86.39/13.29 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 86.39/13.29 % Starting new_bool_3 with 300s (1) cores
% 86.39/13.29 % Starting new_bool_1 with 300s (1) cores
% 86.39/13.29 % Starting sh5l with 300s (1) cores
% 86.39/13.29 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1066658 completed with status 0
% 86.39/13.29 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 86.39/13.29 % Preprocessing class: FSMSSMSSSSSNFFN.
% 86.39/13.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 86.39/13.29 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 86.39/13.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 86.39/13.29 % No SInE strategy applied
% 86.39/13.29 % Search class: FGUSM-FFMS21-MFFFFFNN
% 86.39/13.29 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 86.39/13.29 % Starting SubtermCWHack with 136s (1) cores
% 86.39/13.29 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 86.39/13.29 % Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 86.39/13.29 % Starting new_bool_3 with 136s (1) cores
% 86.39/13.29 % Starting new_bool_1 with 136s (1) cores
% 86.39/13.29 % G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 1066667 completed with status 0
% 86.39/13.29 % Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 86.39/13.29 % Preprocessing class: FSMSSMSSSSSNFFN.
% 86.39/13.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 86.39/13.29 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 86.39/13.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 86.39/13.29 % No SInE strategy applied
% 86.39/13.29 % Search class: FGUSM-FFMS21-MFFFFFNN
% 86.39/13.29 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 86.39/13.29 % Starting SubtermCWHack with 136s (1) cores
% 86.39/13.29 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 86.39/13.29 % Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 86.39/13.29 % Preprocessing time : 0.002 s
% 86.39/13.29
% 86.39/13.29 % Proof found!
% 86.39/13.29 % SZS status Theorem
% 86.39/13.29 % SZS output start CNFRefutation
% See solution above
% 86.39/13.30 % Parsed axioms : 17
% 86.39/13.30 % Removed by relevancy pruning/SinE : 0
% 86.39/13.30 % Initial clauses : 26
% 86.39/13.30 % Removed in clause preprocessing : 0
% 86.39/13.30 % Initial clauses in saturation : 26
% 86.39/13.30 % Processed clauses : 19554
% 86.39/13.30 % ...of these trivial : 1655
% 86.39/13.30 % ...subsumed : 15189
% 86.39/13.30 % ...remaining for further processing : 2710
% 86.39/13.30 % Other redundant clauses eliminated : 0
% 86.39/13.30 % Clauses deleted for lack of memory : 0
% 86.39/13.30 % Backward-subsumed : 56
% 86.39/13.30 % Backward-rewritten : 535
% 86.39/13.30 % Generated clauses : 403826
% 86.39/13.30 % ...of the previous two non-redundant : 352588
% 86.39/13.30 % ...aggressively subsumed : 0
% 86.39/13.30 % Contextual simplify-reflections : 0
% 86.39/13.30 % Paramodulations : 403819
% 86.39/13.30 % Factorizations : 0
% 86.39/13.30 % NegExts : 0
% 86.39/13.30 % Equation resolutions : 7
% 86.39/13.30 % Disequality decompositions : 0
% 86.39/13.30 % Total rewrite steps : 805435
% 86.39/13.30 % ...of those cached : 726117
% 86.39/13.30 % Propositional unsat checks : 0
% 86.39/13.30 % Propositional check models : 0
% 86.39/13.30 % Propositional check unsatisfiable : 0
% 86.39/13.30 % Propositional clauses : 0
% 86.39/13.30 % Propositional clauses after purity: 0
% 86.39/13.30 % Propositional unsat core size : 0
% 86.39/13.30 % Propositional preprocessing time : 0.000
% 86.39/13.30 % Propositional encoding time : 0.000
% 86.39/13.30 % Propositional solver time : 0.000
% 86.39/13.30 % Success case prop preproc time : 0.000
% 86.39/13.30 % Success case prop encoding time : 0.000
% 86.39/13.30 % Success case prop solver time : 0.000
% 86.39/13.30 % Current number of processed clauses : 2119
% 86.39/13.30 % Positive orientable unit clauses : 1069
% 86.39/13.30 % Positive unorientable unit clauses: 20
% 86.39/13.30 % Negative unit clauses : 1
% 86.39/13.30 % Non-unit-clauses : 1029
% 86.39/13.30 % Current number of unprocessed clauses: 331553
% 86.39/13.30 % ...number of literals in the above : 756341
% 86.39/13.30 % Current number of archived formulas : 0
% 86.39/13.30 % Current number of archived clauses : 591
% 86.39/13.30 % Clause-clause subsumption calls (NU) : 512479
% 86.39/13.30 % Rec. Clause-clause subsumption calls : 456720
% 86.39/13.30 % Non-unit clause-clause subsumptions : 14802
% 86.39/13.30 % Unit Clause-clause subsumption calls : 15225
% 86.39/13.30 % Rewrite failures with RHS unbound : 0
% 86.39/13.30 % BW rewrite match attempts : 7271
% 86.39/13.30 % BW rewrite match successes : 417
% 86.39/13.30 % Condensation attempts : 0
% 86.39/13.30 % Condensation successes : 0
% 86.39/13.30 % Termbank termtop insertions : 11026615
% 86.39/13.30 % Search garbage collected termcells : 195
% 86.39/13.30
% 86.39/13.30 % -------------------------------------------------
% 86.39/13.30 % User time : 11.970 s
% 86.39/13.30 % System time : 0.414 s
% 86.39/13.30 % Total time : 12.384 s
% 86.39/13.30 % Maximum resident set size: 3648 pages
% 86.39/13.30
% 86.39/13.30 % -------------------------------------------------
% 86.39/13.30 % User time : 59.762 s
% 86.39/13.30 % System time : 2.239 s
% 86.39/13.30 % Total time : 62.001 s
% 86.39/13.30 % Maximum resident set size: 4864 pages
% 86.39/13.30 % E exiting
%------------------------------------------------------------------------------