%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE017+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:36 PM UTC 2026
% Result : Theorem 1.21s 0.61s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 78 ( 43 unt; 0 def)
% Number of atoms : 144 ( 70 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 98 ( 32 ~; 41 |; 18 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 99 ( 4 sgn 48 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X6)
& test(X5)
& test(X4) )
=> ( leq(X6,multiplication(X4,X5))
<=> ( leq(X6,X5)
& leq(X6,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
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(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(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
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(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(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(c_0_12,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X6)
& test(X5)
& test(X4) )
=> ( leq(X6,multiplication(X4,X5))
<=> ( leq(X6,X5)
& leq(X6,X4) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_13,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])])]) ).
fof(c_0_14,negated_conjecture,
( ( leq(esk4_0,multiplication(esk2_0,esk3_0))
| leq(esk4_0,esk3_0) )
& ( leq(esk4_0,multiplication(esk2_0,esk3_0))
| leq(esk4_0,esk2_0) )
& ( ~ leq(esk4_0,esk3_0)
| ~ leq(esk4_0,esk2_0)
| ~ leq(esk4_0,multiplication(esk2_0,esk3_0)) )
& test(esk4_0)
& test(esk3_0)
& test(esk2_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
cnf(c_0_15,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( leq(esk4_0,multiplication(esk2_0,esk3_0))
| leq(esk4_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_18,negated_conjecture,
( leq(esk4_0,esk2_0)
| addition(esk4_0,multiplication(esk2_0,esk3_0)) = multiplication(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_20,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])])])]) ).
fof(c_0_21,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_22,negated_conjecture,
( leq(esk4_0,multiplication(esk2_0,esk3_0))
| leq(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( addition(esk4_0,esk2_0) = esk2_0
| addition(esk4_0,multiplication(esk2_0,esk3_0)) = multiplication(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_25,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ test(X1)
| complement(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( leq(esk4_0,esk3_0)
| addition(esk4_0,multiplication(esk2_0,esk3_0)) = multiplication(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_29,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,negated_conjecture,
( addition(esk4_0,esk2_0) = esk2_0
| addition(esk4_0,addition(multiplication(esk2_0,esk3_0),X1)) = addition(multiplication(esk2_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_31,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_32,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_33,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_34,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_35,plain,
( ~ test(X1)
| addition(X1,esk1_1(X1)) = one ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_36,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_37,plain,
( ~ complement(X1,X2)
| multiplication(X1,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_38,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_39,negated_conjecture,
( addition(esk4_0,esk3_0) = esk3_0
| addition(esk4_0,multiplication(esk2_0,esk3_0)) = multiplication(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_40,negated_conjecture,
( leq(esk4_0,addition(multiplication(esk2_0,esk3_0),X1))
| addition(esk4_0,esk2_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_44,plain,
( ~ test(X1)
| addition(X1,one) = one ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_46,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
( ~ test(X1)
| multiplication(esk1_1(X1),X1) = zero ),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
cnf(c_0_48,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_49,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_50,negated_conjecture,
( addition(esk4_0,esk3_0) = esk3_0
| addition(esk4_0,addition(multiplication(esk2_0,esk3_0),X1)) = addition(multiplication(esk2_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_51,negated_conjecture,
( leq(esk4_0,addition(X1,multiplication(esk2_0,esk3_0)))
| addition(esk4_0,esk2_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_52,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_41]) ).
cnf(c_0_53,negated_conjecture,
addition(esk3_0,one) = one,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_54,plain,
( ~ test(X2)
| multiplication(addition(X1,esk1_1(X2)),X2) = multiplication(X1,X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_55,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( leq(esk4_0,addition(multiplication(esk2_0,esk3_0),X1))
| addition(esk4_0,esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_58,plain,
( multiplication(addition(X1,X3),X2) != multiplication(X3,X2)
| leq(multiplication(X1,X2),multiplication(X3,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_46]) ).
cnf(c_0_59,negated_conjecture,
addition(esk4_0,esk2_0) = esk2_0,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_43]),c_0_15]) ).
cnf(c_0_60,plain,
( ~ test(X1)
| multiplication(X1,X1) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_35]),c_0_55]) ).
cnf(c_0_61,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_62,negated_conjecture,
( leq(esk4_0,addition(X1,multiplication(esk2_0,esk3_0)))
| addition(esk4_0,esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_56,c_0_41]) ).
cnf(c_0_63,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_55]),c_0_41]) ).
cnf(c_0_64,negated_conjecture,
addition(esk2_0,one) = one,
inference(spm,[status(thm)],[c_0_44,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
leq(multiplication(esk4_0,X1),multiplication(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
multiplication(esk4_0,esk4_0) = esk4_0,
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_67,negated_conjecture,
( ~ leq(esk4_0,esk3_0)
| ~ leq(esk4_0,esk2_0)
| ~ leq(esk4_0,multiplication(esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_68,negated_conjecture,
leq(esk4_0,esk2_0),
inference(spm,[status(thm)],[c_0_29,c_0_59]) ).
cnf(c_0_69,negated_conjecture,
addition(esk4_0,esk3_0) = esk3_0,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_55]),c_0_15]) ).
cnf(c_0_70,plain,
( multiplication(X1,addition(X2,X3)) != multiplication(X1,X3)
| leq(multiplication(X1,X2),multiplication(X1,X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_42]) ).
cnf(c_0_71,negated_conjecture,
leq(esk4_0,multiplication(esk2_0,esk4_0)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_72,negated_conjecture,
( ~ leq(esk4_0,esk3_0)
| ~ leq(esk4_0,multiplication(esk2_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_73,negated_conjecture,
leq(esk4_0,esk3_0),
inference(spm,[status(thm)],[c_0_29,c_0_69]) ).
cnf(c_0_74,negated_conjecture,
leq(multiplication(X1,esk4_0),multiplication(X1,esk3_0)),
inference(spm,[status(thm)],[c_0_70,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
multiplication(esk2_0,esk4_0) = esk4_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_71]),c_0_63]),c_0_64]),c_0_55]) ).
cnf(c_0_76,negated_conjecture,
~ leq(esk4_0,multiplication(esk2_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE017+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 22:39:20 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 1.21/0.61 % Version: 3.5.1
% 1.21/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.21/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.21/0.61 % Starting new_bool_3 with 300s (1) cores
% 1.21/0.61 % Starting new_bool_1 with 300s (1) cores
% 1.21/0.61 % Starting sh5l with 300s (1) cores
% 1.21/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1067868 completed with status 0
% 1.21/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.21/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.21/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.21/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.21/0.61 % No SInE strategy applied
% 1.21/0.61 % Search class: FGHSM-FFMS21-SFFFFFNN
% 1.21/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.21/0.61 % Starting SubtermCWHack with 136s (1) cores
% 1.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.21/0.61 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1.21/0.61 % Starting new_bool_3 with 136s (1) cores
% 1.21/0.61 % Starting new_bool_1 with 136s (1) cores
% 1.21/0.61 % new_bool_3 with pid 1067876 completed with status 0
% 1.21/0.61 % Result found by new_bool_3
% 1.21/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.21/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.21/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.21/0.61 % No SInE strategy applied
% 1.21/0.61 % Search class: FGHSM-FFMS21-SFFFFFNN
% 1.21/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.21/0.61 % Starting SubtermCWHack with 136s (1) cores
% 1.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.21/0.61 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1.21/0.61 % Starting new_bool_3 with 136s (1) cores
% 1.21/0.61 % Preprocessing time : 0.001 s
% 1.21/0.61 % Presaturation interreduction done
% 1.21/0.61
% 1.21/0.61 % Proof found!
% 1.21/0.61 % SZS status Theorem
% 1.21/0.61 % SZS output start CNFRefutation
% See solution above
% 1.21/0.61 % Parsed axioms : 17
% 1.21/0.61 % Removed by relevancy pruning/SinE : 0
% 1.21/0.61 % Initial clauses : 28
% 1.21/0.61 % Removed in clause preprocessing : 0
% 1.21/0.61 % Initial clauses in saturation : 28
% 1.21/0.61 % Processed clauses : 917
% 1.21/0.61 % ...of these trivial : 48
% 1.21/0.61 % ...subsumed : 485
% 1.21/0.61 % ...remaining for further processing : 384
% 1.21/0.61 % Other redundant clauses eliminated : 71
% 1.21/0.61 % Clauses deleted for lack of memory : 0
% 1.21/0.61 % Backward-subsumed : 5
% 1.21/0.61 % Backward-rewritten : 77
% 1.21/0.61 % Generated clauses : 6994
% 1.21/0.61 % ...of the previous two non-redundant : 4848
% 1.21/0.61 % ...aggressively subsumed : 0
% 1.21/0.61 % Contextual simplify-reflections : 5
% 1.21/0.61 % Paramodulations : 6923
% 1.21/0.61 % Factorizations : 0
% 1.21/0.61 % NegExts : 0
% 1.21/0.61 % Equation resolutions : 71
% 1.21/0.61 % Disequality decompositions : 0
% 1.21/0.61 % Total rewrite steps : 7964
% 1.21/0.61 % ...of those cached : 6543
% 1.21/0.61 % Propositional unsat checks : 0
% 1.21/0.61 % Propositional check models : 0
% 1.21/0.61 % Propositional check unsatisfiable : 0
% 1.21/0.61 % Propositional clauses : 0
% 1.21/0.61 % Propositional clauses after purity: 0
% 1.21/0.61 % Propositional unsat core size : 0
% 1.21/0.61 % Propositional preprocessing time : 0.000
% 1.21/0.61 % Propositional encoding time : 0.000
% 1.21/0.61 % Propositional solver time : 0.000
% 1.21/0.61 % Success case prop preproc time : 0.000
% 1.21/0.61 % Success case prop encoding time : 0.000
% 1.21/0.61 % Success case prop solver time : 0.000
% 1.21/0.61 % Current number of processed clauses : 273
% 1.21/0.61 % Positive orientable unit clauses : 123
% 1.21/0.61 % Positive unorientable unit clauses: 3
% 1.21/0.61 % Negative unit clauses : 1
% 1.21/0.61 % Non-unit-clauses : 146
% 1.21/0.61 % Current number of unprocessed clauses: 3943
% 1.21/0.61 % ...number of literals in the above : 7578
% 1.21/0.61 % Current number of archived formulas : 0
% 1.21/0.61 % Current number of archived clauses : 110
% 1.21/0.61 % Clause-clause subsumption calls (NU) : 5663
% 1.21/0.61 % Rec. Clause-clause subsumption calls : 4843
% 1.21/0.61 % Non-unit clause-clause subsumptions : 481
% 1.21/0.61 % Unit Clause-clause subsumption calls : 921
% 1.21/0.61 % Rewrite failures with RHS unbound : 0
% 1.21/0.61 % BW rewrite match attempts : 84
% 1.21/0.61 % BW rewrite match successes : 46
% 1.21/0.61 % Condensation attempts : 0
% 1.21/0.61 % Condensation successes : 0
% 1.21/0.61 % Termbank termtop insertions : 75776
% 1.21/0.61 % Search garbage collected termcells : 232
% 1.21/0.61
% 1.21/0.61 % -------------------------------------------------
% 1.21/0.61 % User time : 0.120 s
% 1.21/0.61 % System time : 0.007 s
% 1.21/0.61 % Total time : 0.127 s
% 1.21/0.61 % Maximum resident set size: 3648 pages
% 1.21/0.61
% 1.21/0.61 % -------------------------------------------------
% 1.21/0.61 % User time : 0.661 s
% 1.21/0.61 % System time : 0.053 s
% 1.21/0.61 % Total time : 0.714 s
% 1.21/0.61 % Maximum resident set size: 4864 pages
% 1.21/0.61 % E exiting
%------------------------------------------------------------------------------