%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE027+4 : 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 : n015.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:40 PM UTC 2026
% Result : Theorem 0.85s 0.56s
% Output : CNFRefutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 61 ( 37 unt; 0 def)
% Number of atoms : 109 ( 65 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 85 ( 37 ~; 29 |; 13 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 97 ( 3 sgn 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7,X8] :
( ( test(X8)
& test(X7) )
=> ( leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)))
& leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
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(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(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
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(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
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(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
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(c_0_13,negated_conjecture,
~ ! [X4,X5,X6,X7,X8] :
( ( test(X8)
& test(X7) )
=> ( leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)))
& leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6))) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_14,plain,
! [X37,X38] :
( ( ~ test(X37)
| c(X37) = X38
| ~ complement(X37,X38) )
& ( ~ test(X37)
| complement(X37,X38)
| c(X37) != X38 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).
fof(c_0_15,negated_conjecture,
( ( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)))
| ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) )
& test(esk6_0)
& test(esk5_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_16,plain,
! [X9,X10] : addition(X9,X10) = addition(X10,X9),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_17,plain,
! [X35,X36] :
( ( complement(X36,X35)
| addition(X35,X36) != one
| multiplication(X36,X35) != zero
| multiplication(X35,X36) != zero )
& ( ~ complement(X36,X35)
| addition(X35,X36) = one )
& ( ~ complement(X36,X35)
| multiplication(X36,X35) = zero )
& ( ~ complement(X36,X35)
| multiplication(X35,X36) = 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_18,plain,
( ~ test(X1)
| c(X1) != X2
| complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)))
| ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X29,X30] :
( ( leq(X29,X30)
| addition(X29,X30) != X30 )
& ( addition(X29,X30) = X30
| ~ leq(X29,X30) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
cnf(c_0_22,plain,
( ~ complement(X2,X1)
| multiplication(X1,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))
| ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_25,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ complement(X1,X2)
| multiplication(X1,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_27,plain,
! [X24,X25,X26] : multiplication(addition(X24,X25),X26) = addition(multiplication(X24,X26),multiplication(X25,X26)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_28,plain,
( ~ test(X1)
| multiplication(c(X1),X1) = zero ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_30,plain,
! [X14] : addition(X14,zero) = X14,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_31,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
| addition(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20]) ).
fof(c_0_32,plain,
! [X11,X12,X13] : addition(X13,addition(X12,X11)) = addition(addition(X13,X12),X11),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_33,plain,
! [X15] : addition(X15,X15) = X15,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_34,plain,
! [X16,X17,X18] : multiplication(X16,multiplication(X17,X18)) = multiplication(multiplication(X16,X17),X18),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_35,plain,
( ~ test(X1)
| multiplication(X1,c(X1)) = zero ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
fof(c_0_36,plain,
! [X28] : multiplication(zero,X28) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_37,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,negated_conjecture,
multiplication(c(esk5_0),esk5_0) = zero,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_41,plain,
! [X20] : multiplication(one,X20) = X20,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_42,negated_conjecture,
( addition(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))
| addition(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))) ),
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_43,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_45,plain,
! [X21,X22,X23] : multiplication(X21,addition(X22,X23)) = addition(multiplication(X21,X22),multiplication(X21,X23)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_46,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,negated_conjecture,
multiplication(esk5_0,c(esk5_0)) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_48,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_49,negated_conjecture,
multiplication(addition(X1,c(esk5_0)),esk5_0) = multiplication(X1,esk5_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_50,plain,
( ~ test(X1)
| addition(X1,c(X1)) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_23]),c_0_20]) ).
cnf(c_0_51,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))
| addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43]) ).
cnf(c_0_53,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_54,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_55,negated_conjecture,
multiplication(esk5_0,multiplication(c(esk5_0),X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_56,negated_conjecture,
multiplication(esk5_0,esk5_0) = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_29])]) ).
cnf(c_0_57,negated_conjecture,
( addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))
| addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2))) = multiplication(esk5_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_39]) ).
cnf(c_0_59,negated_conjecture,
multiplication(esk5_0,multiplication(esk5_0,X1)) = multiplication(esk5_0,X1),
inference(spm,[status(thm)],[c_0_46,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_20]),c_0_53]),c_0_58]),c_0_59]),c_0_20]),c_0_58]),c_0_59]),c_0_20]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE027+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n015.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:42:50 UTC 2026
% 0.05/0.38 % CPUTime :
% 0.05/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.42 Running first-order theorem proving
% 0.05/0.42 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
% 0.85/0.56 % Version: 3.5.1
% 0.85/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.85/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.85/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.85/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.85/0.56 % Starting sh5l with 300s (1) cores
% 0.85/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4104420 completed with status 0
% 0.85/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.85/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.85/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.85/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.85/0.56 % No SInE strategy applied
% 0.85/0.56 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.85/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.85/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.85/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.85/0.56 % Starting U----_210g_02_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.85/0.56 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S00EN with 136s (1) cores
% 0.85/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.85/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4104426 completed with status 0
% 0.85/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.85/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.85/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.85/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.85/0.56 % No SInE strategy applied
% 0.85/0.56 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.85/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.85/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.85/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.85/0.56 % Preprocessing time : 0.002 s
% 0.85/0.56 % Presaturation interreduction done
% 0.85/0.56
% 0.85/0.56 % Proof found!
% 0.85/0.56 % SZS status Theorem
% 0.85/0.56 % SZS output start CNFRefutation
% See solution above
% 0.85/0.56 % Parsed axioms : 19
% 0.85/0.56 % Removed by relevancy pruning/SinE : 0
% 0.85/0.56 % Initial clauses : 27
% 0.85/0.56 % Removed in clause preprocessing : 0
% 0.85/0.56 % Initial clauses in saturation : 27
% 0.85/0.56 % Processed clauses : 864
% 0.85/0.56 % ...of these trivial : 85
% 0.85/0.56 % ...subsumed : 437
% 0.85/0.56 % ...remaining for further processing : 342
% 0.85/0.56 % Other redundant clauses eliminated : 27
% 0.85/0.56 % Clauses deleted for lack of memory : 0
% 0.85/0.56 % Backward-subsumed : 39
% 0.85/0.56 % Backward-rewritten : 67
% 0.85/0.56 % Generated clauses : 6093
% 0.85/0.56 % ...of the previous two non-redundant : 4017
% 0.85/0.56 % ...aggressively subsumed : 0
% 0.85/0.56 % Contextual simplify-reflections : 13
% 0.85/0.56 % Paramodulations : 6065
% 0.85/0.56 % Factorizations : 1
% 0.85/0.56 % NegExts : 0
% 0.85/0.56 % Equation resolutions : 27
% 0.85/0.56 % Disequality decompositions : 0
% 0.85/0.56 % Total rewrite steps : 7998
% 0.85/0.56 % ...of those cached : 6790
% 0.85/0.56 % Propositional unsat checks : 0
% 0.85/0.56 % Propositional check models : 0
% 0.85/0.56 % Propositional check unsatisfiable : 0
% 0.85/0.56 % Propositional clauses : 0
% 0.85/0.56 % Propositional clauses after purity: 0
% 0.85/0.56 % Propositional unsat core size : 0
% 0.85/0.56 % Propositional preprocessing time : 0.000
% 0.85/0.56 % Propositional encoding time : 0.000
% 0.85/0.56 % Propositional solver time : 0.000
% 0.85/0.56 % Success case prop preproc time : 0.000
% 0.85/0.56 % Success case prop encoding time : 0.000
% 0.85/0.56 % Success case prop solver time : 0.000
% 0.85/0.56 % Current number of processed clauses : 208
% 0.85/0.56 % Positive orientable unit clauses : 105
% 0.85/0.56 % Positive unorientable unit clauses: 5
% 0.85/0.56 % Negative unit clauses : 1
% 0.85/0.56 % Non-unit-clauses : 97
% 0.85/0.56 % Current number of unprocessed clauses: 3081
% 0.85/0.56 % ...number of literals in the above : 6454
% 0.85/0.56 % Current number of archived formulas : 0
% 0.85/0.56 % Current number of archived clauses : 133
% 0.85/0.56 % Clause-clause subsumption calls (NU) : 7022
% 0.85/0.56 % Rec. Clause-clause subsumption calls : 6100
% 0.85/0.56 % Non-unit clause-clause subsumptions : 450
% 0.85/0.56 % Unit Clause-clause subsumption calls : 482
% 0.85/0.56 % Rewrite failures with RHS unbound : 0
% 0.85/0.56 % BW rewrite match attempts : 101
% 0.85/0.56 % BW rewrite match successes : 64
% 0.85/0.56 % Condensation attempts : 0
% 0.85/0.56 % Condensation successes : 0
% 0.85/0.56 % Termbank termtop insertions : 71446
% 0.85/0.56 % Search garbage collected termcells : 231
% 0.85/0.56
% 0.85/0.56 % -------------------------------------------------
% 0.85/0.56 % User time : 0.100 s
% 0.85/0.56 % System time : 0.011 s
% 0.85/0.56 % Total time : 0.112 s
% 0.85/0.56 % Maximum resident set size: 3656 pages
% 0.85/0.56
% 0.85/0.56 % -------------------------------------------------
% 0.85/0.56 % User time : 0.509 s
% 0.85/0.56 % System time : 0.038 s
% 0.85/0.56 % Total time : 0.547 s
% 0.85/0.56 % Maximum resident set size: 4608 pages
% 0.85/0.56 % E exiting
%------------------------------------------------------------------------------