%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE029+1 : 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 : n008.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.71s 0.69s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 66 ( 14 unt; 0 def)
% Number of atoms : 198 ( 13 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 218 ( 86 ~; 109 |; 16 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 110 ( 6 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ismeet(X4,X5,X6)
<=> ismeetu(X4,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(ismeetu,axiom,
! [X4,X5,X6] :
( ismeetu(X6,X4,X5)
<=> ! [X7] :
( ( leq(X7,X5)
& leq(X7,X4) )
<=> leq(X7,X6) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+3.ax',ismeetu) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(ismeet,axiom,
! [X4,X5,X6] :
( ismeet(X6,X4,X5)
<=> ( ! [X7] :
( ( leq(X7,X5)
& leq(X7,X4) )
=> leq(X7,X6) )
& leq(X6,X5)
& leq(X6,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+3.ax',ismeet) ).
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(c_0_6,negated_conjecture,
~ ! [X4,X5,X6] :
( ismeet(X4,X5,X6)
<=> ismeetu(X4,X5,X6) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X38,X39,X40,X41,X42,X43,X44,X45] :
( ( ismeetu(X45,X43,X44)
| leq(esk2_3(X43,X44,X45),X45)
| leq(esk2_3(X43,X44,X45),X44) )
& ( ismeetu(X45,X43,X44)
| leq(esk2_3(X43,X44,X45),X45)
| leq(esk2_3(X43,X44,X45),X43) )
& ( ismeetu(X45,X43,X44)
| ~ leq(esk2_3(X43,X44,X45),X45)
| ~ leq(esk2_3(X43,X44,X45),X44)
| ~ leq(esk2_3(X43,X44,X45),X43) )
& ( ~ ismeetu(X40,X38,X39)
| ~ leq(X42,X40)
| leq(X42,X39) )
& ( ~ ismeetu(X40,X38,X39)
| ~ leq(X42,X40)
| leq(X42,X38) )
& ( ~ ismeetu(X40,X38,X39)
| leq(X41,X40)
| ~ leq(X41,X39)
| ~ leq(X41,X38) ) ),
inference(distribute,[status(thm)],[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)],[ismeetu])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( ( ismeetu(esk3_0,esk4_0,esk5_0)
| ismeet(esk3_0,esk4_0,esk5_0) )
& ( ~ ismeetu(esk3_0,esk4_0,esk5_0)
| ~ ismeet(esk3_0,esk4_0,esk5_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X28,X29] :
( ( leq(X28,X29)
| addition(X28,X29) != X29 )
& ( addition(X28,X29) = X29
| ~ leq(X28,X29) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_10,plain,
! [X14] : addition(X14,X14) = X14,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_11,plain,
( ~ ismeetu(X3,X4,X2)
| ~ leq(X1,X3)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( ismeetu(esk3_0,esk4_0,esk5_0)
| ismeet(esk3_0,esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X30,X31,X32,X33,X34,X35,X36] :
( ( ismeet(X36,X34,X35)
| ~ leq(X36,X35)
| ~ leq(X36,X34)
| ~ leq(esk1_3(X34,X35,X36),X36) )
& ( ismeet(X36,X34,X35)
| ~ leq(X36,X35)
| ~ leq(X36,X34)
| leq(esk1_3(X34,X35,X36),X35) )
& ( ismeet(X36,X34,X35)
| ~ leq(X36,X35)
| ~ leq(X36,X34)
| leq(esk1_3(X34,X35,X36),X34) )
& ( ~ ismeet(X32,X30,X31)
| leq(X33,X32)
| ~ leq(X33,X31)
| ~ leq(X33,X30) )
& ( ~ ismeet(X32,X30,X31)
| leq(X32,X31) )
& ( ~ ismeet(X32,X30,X31)
| leq(X32,X30) ) ),
inference(distribute,[status(thm)],[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)],[ismeet])])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ leq(X1,esk3_0)
| leq(X1,esk5_0)
| ismeet(esk3_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ ismeet(X1,X3,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ ismeetu(X3,X2,X4)
| ~ leq(X1,X3)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( ~ leq(X3,X2)
| ~ leq(X3,X1)
| ismeet(X3,X1,X2)
| leq(esk1_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
leq(esk3_0,esk5_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ leq(X1,esk3_0)
| leq(X1,esk4_0)
| ismeet(esk3_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_23,plain,
( ~ ismeet(X1,X2,X3)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_24,plain,
! [X10,X11,X12] : addition(X12,addition(X11,X10)) = addition(addition(X12,X11),X10),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_25,negated_conjecture,
( ~ ismeetu(esk3_0,esk4_0,esk5_0)
| ~ ismeet(esk3_0,esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( ismeetu(X3,X1,X2)
| leq(esk2_3(X1,X2,X3),X3)
| leq(esk2_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
( ~ leq(esk3_0,X1)
| leq(esk1_3(X1,esk5_0,esk3_0),esk5_0)
| ismeet(esk3_0,X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
leq(esk3_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]) ).
cnf(c_0_29,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ~ leq(X3,X2)
| ~ leq(X3,X1)
| ismeet(X3,X1,X2)
| leq(esk1_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_31,plain,
( ~ ismeetu(X4,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X1,X2)
| leq(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,plain,
( ~ ismeet(X4,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X1,X2)
| leq(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_33,negated_conjecture,
( ~ ismeet(esk3_0,esk4_0,esk5_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
( leq(esk1_3(esk4_0,esk5_0,esk3_0),esk5_0)
| ismeet(esk3_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( ~ leq(X3,X2)
| ~ leq(X3,X1)
| ~ leq(esk1_3(X1,X2,X3),X3)
| ismeet(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,plain,
( ~ leq(esk2_3(X1,X2,X3),X3)
| ~ leq(esk2_3(X1,X2,X3),X2)
| ~ leq(esk2_3(X1,X2,X3),X1)
| ismeetu(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_37,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_14]) ).
cnf(c_0_38,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_39,plain,
( ismeetu(X3,X1,X2)
| leq(esk2_3(X1,X2,X3),X3)
| leq(esk2_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_40,negated_conjecture,
( ~ leq(esk3_0,X1)
| leq(esk1_3(X1,esk5_0,esk3_0),X1)
| ismeet(esk3_0,X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_41,negated_conjecture,
( ~ leq(X1,esk4_0)
| ~ leq(X1,esk5_0)
| leq(X1,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_12]),c_0_32]) ).
cnf(c_0_42,negated_conjecture,
( leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0)
| leq(esk1_3(esk4_0,esk5_0,esk3_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( ~ leq(esk1_3(esk4_0,esk5_0,esk3_0),esk3_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_35]),c_0_21]),c_0_28])]) ).
cnf(c_0_44,negated_conjecture,
( ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0)
| ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0)
| ~ ismeet(esk3_0,esk4_0,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_32]) ).
cnf(c_0_45,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_37]) ).
cnf(c_0_46,plain,
( ~ leq(addition(X1,X2),X3)
| addition(X1,addition(X2,X3)) = X3 ),
inference(spm,[status(thm)],[c_0_38,c_0_29]) ).
cnf(c_0_47,negated_conjecture,
( ~ ismeet(esk3_0,esk4_0,esk5_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( leq(esk1_3(esk4_0,esk5_0,esk3_0),esk4_0)
| ismeet(esk3_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_28]) ).
cnf(c_0_49,negated_conjecture,
( ~ leq(esk1_3(esk4_0,esk5_0,esk3_0),esk4_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0)
| ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0)
| leq(esk1_3(esk4_0,esk5_0,esk3_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_51,negated_conjecture,
( ~ leq(esk1_3(esk4_0,esk5_0,esk3_0),esk3_0)
| ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0)
| ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_35]),c_0_21]),c_0_28])]) ).
cnf(c_0_52,plain,
( ~ leq(addition(X1,X3),X2)
| leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0)
| leq(esk1_3(esk4_0,esk5_0,esk3_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_34]) ).
cnf(c_0_54,negated_conjecture,
( ~ leq(esk1_3(esk4_0,esk5_0,esk3_0),esk3_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_21]),c_0_28])]) ).
cnf(c_0_55,negated_conjecture,
( leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_48]),c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0)
| ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0)
| ~ leq(esk1_3(esk4_0,esk5_0,esk3_0),esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_50]),c_0_51]) ).
cnf(c_0_57,plain,
( ~ leq(X1,X3)
| ~ leq(X3,X2)
| leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_38]) ).
cnf(c_0_58,negated_conjecture,
( ~ leq(esk1_3(esk4_0,esk5_0,esk3_0),esk4_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_53]),c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0)
| leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0)
| ~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_48]),c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( ~ leq(X1,esk3_0)
| leq(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_21]) ).
cnf(c_0_62,negated_conjecture,
leq(esk2_3(esk4_0,esk5_0,esk3_0),esk3_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_58]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
~ leq(esk2_3(esk4_0,esk5_0,esk3_0),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_64,negated_conjecture,
( ~ leq(X1,esk3_0)
| leq(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_28]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE029+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 % Computer : n008.cluster.edu
% 0.17/0.50 % Model : x86_64 x86_64
% 0.17/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.50 % Memory : 8046.5625MB
% 0.17/0.50 % OS : Linux 6.8.0-71-generic
% 0.17/0.50 % CPULimit : 300
% 0.17/0.50 % WCLimit : 300
% 0.17/0.50 % DateTime : Sun Sep 20 22:40:39 UTC 2026
% 0.17/0.50 % CPUTime :
% 0.17/0.50 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.58 Running first-order theorem proving
% 0.23/0.58 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
% 0.71/0.69 % Version: 3.5.1
% 0.71/0.69 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.71/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.71/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.71/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.71/0.69 % Starting sh5l with 300s (1) cores
% 0.71/0.69 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3752696 completed with status 0
% 0.71/0.69 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.71/0.69 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.71/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.71/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.71/0.69 % No SInE strategy applied
% 0.71/0.69 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.71/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.71/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.71/0.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.71/0.69 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 0.71/0.69 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.71/0.69 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 0.71/0.69 % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3752706 completed with status 0
% 0.71/0.69 % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.71/0.69 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.71/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.71/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.71/0.69 % No SInE strategy applied
% 0.71/0.69 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.71/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.71/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.71/0.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.71/0.69 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 0.71/0.69 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.71/0.69 % Preprocessing time : 0.002 s
% 0.71/0.69 % Presaturation interreduction done
% 0.71/0.69
% 0.71/0.69 % Proof found!
% 0.71/0.69 % SZS status Theorem
% 0.71/0.69 % SZS output start CNFRefutation
% See solution above
% 0.71/0.70 % Parsed axioms : 15
% 0.71/0.70 % Removed by relevancy pruning/SinE : 0
% 0.71/0.70 % Initial clauses : 27
% 0.71/0.70 % Removed in clause preprocessing : 0
% 0.71/0.70 % Initial clauses in saturation : 27
% 0.71/0.70 % Processed clauses : 370
% 0.71/0.70 % ...of these trivial : 11
% 0.71/0.70 % ...subsumed : 142
% 0.71/0.70 % ...remaining for further processing : 217
% 0.71/0.70 % Other redundant clauses eliminated : 8
% 0.71/0.70 % Clauses deleted for lack of memory : 0
% 0.71/0.70 % Backward-subsumed : 34
% 0.71/0.70 % Backward-rewritten : 20
% 0.71/0.70 % Generated clauses : 1272
% 0.71/0.70 % ...of the previous two non-redundant : 990
% 0.71/0.70 % ...aggressively subsumed : 0
% 0.71/0.70 % Contextual simplify-reflections : 13
% 0.71/0.70 % Paramodulations : 1262
% 0.71/0.70 % Factorizations : 0
% 0.71/0.70 % NegExts : 0
% 0.71/0.70 % Equation resolutions : 8
% 0.71/0.70 % Disequality decompositions : 0
% 0.71/0.70 % Total rewrite steps : 550
% 0.71/0.70 % ...of those cached : 411
% 0.71/0.70 % Propositional unsat checks : 0
% 0.71/0.70 % Propositional check models : 0
% 0.71/0.70 % Propositional check unsatisfiable : 0
% 0.71/0.70 % Propositional clauses : 0
% 0.71/0.70 % Propositional clauses after purity: 0
% 0.71/0.70 % Propositional unsat core size : 0
% 0.71/0.70 % Propositional preprocessing time : 0.000
% 0.71/0.70 % Propositional encoding time : 0.000
% 0.71/0.70 % Propositional solver time : 0.000
% 0.71/0.70 % Success case prop preproc time : 0.000
% 0.71/0.70 % Success case prop encoding time : 0.000
% 0.71/0.70 % Success case prop solver time : 0.000
% 0.71/0.70 % Current number of processed clauses : 134
% 0.71/0.70 % Positive orientable unit clauses : 21
% 0.71/0.70 % Positive unorientable unit clauses: 3
% 0.71/0.70 % Negative unit clauses : 1
% 0.71/0.70 % Non-unit-clauses : 109
% 0.71/0.70 % Current number of unprocessed clauses: 653
% 0.71/0.70 % ...number of literals in the above : 1650
% 0.71/0.70 % Current number of archived formulas : 0
% 0.71/0.70 % Current number of archived clauses : 83
% 0.71/0.70 % Clause-clause subsumption calls (NU) : 7550
% 0.71/0.70 % Rec. Clause-clause subsumption calls : 4376
% 0.71/0.70 % Non-unit clause-clause subsumptions : 169
% 0.71/0.70 % Unit Clause-clause subsumption calls : 66
% 0.71/0.70 % Rewrite failures with RHS unbound : 0
% 0.71/0.70 % BW rewrite match attempts : 42
% 0.71/0.70 % BW rewrite match successes : 25
% 0.71/0.70 % Condensation attempts : 0
% 0.71/0.70 % Condensation successes : 0
% 0.71/0.70 % Termbank termtop insertions : 19565
% 0.71/0.70 % Search garbage collected termcells : 358
% 0.71/0.70
% 0.71/0.70 % -------------------------------------------------
% 0.71/0.70 % User time : 0.061 s
% 0.71/0.70 % System time : 0.007 s
% 0.71/0.70 % Total time : 0.068 s
% 0.71/0.70 % Maximum resident set size: 3648 pages
% 0.71/0.70
% 0.71/0.70 % -------------------------------------------------
% 0.71/0.70 % User time : 0.233 s
% 0.71/0.70 % System time : 0.028 s
% 0.71/0.70 % Total time : 0.261 s
% 0.71/0.70 % Maximum resident set size: 4608 pages
% 0.71/0.70 % E exiting
%------------------------------------------------------------------------------