%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU418+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 02:25:04 PM UTC 2026
% Result : Theorem 200.95s 30.27s
% Output : CNFRefutation 200.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 69 ( 48 unt; 0 def)
% Number of atoms : 118 ( 31 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 92 ( 43 ~; 30 |; 5 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 119 ( 8 sgn 65 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_relset_2,conjecture,
! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_relset_2) ).
fof(t48_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t48_xboole_1) ).
fof(t19_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X1,X3)
& r1_tarski(X1,X2) )
=> r1_tarski(X1,k3_xboole_0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t19_xboole_1) ).
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X2,X3)
& r1_tarski(X1,X2) )
=> r1_tarski(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t1_xboole_1) ).
fof(t2_boole,axiom,
! [X1] : k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+3.ax',t2_boole) ).
fof(t51_xboole_1,axiom,
! [X1,X2] : k2_xboole_0(k3_xboole_0(X1,X2),k4_xboole_0(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t51_xboole_1) ).
fof(t36_xboole_1,axiom,
! [X1,X2] : r1_tarski(k4_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t36_xboole_1) ).
fof(t49_relat_1,axiom,
! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> ( r1_tarski(X1,X2)
=> r1_tarski(k5_relat_1(X1,X3),k5_relat_1(X2,X3)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t49_relat_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t3_relat_1) ).
fof(t52_xboole_1,axiom,
! [X1,X2,X3] : k4_xboole_0(X1,k4_xboole_0(X2,X3)) = k2_xboole_0(k4_xboole_0(X1,X2),k3_xboole_0(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t52_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+3.ax',t3_boole) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k2_xboole_0) ).
fof(t39_xboole_1,axiom,
! [X1,X2] : k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t39_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k3_xboole_0) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+1.ax',reflexivity_r1_tarski) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
inference(assume_negation,[status(cth)],[t8_relset_2]) ).
fof(c_0_16,negated_conjecture,
( ~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0)))
& v1_relat_1(esk3_0)
& v1_relat_1(esk2_0)
& v1_relat_1(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_17,plain,
! [X128,X129] : k4_xboole_0(X128,k4_xboole_0(X128,X129)) = k3_xboole_0(X128,X129),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_18,plain,
! [X88,X89,X90] :
( r1_tarski(X88,k3_xboole_0(X89,X90))
| ~ r1_tarski(X88,X90)
| ~ r1_tarski(X88,X89) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])])]) ).
cnf(c_0_19,negated_conjecture,
~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( ~ r1_tarski(X1,X3)
| ~ r1_tarski(X1,X2)
| r1_tarski(X1,k3_xboole_0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_23,plain,
( ~ r1_tarski(X1,X2)
| ~ r1_tarski(X1,X3)
| r1_tarski(X1,k4_xboole_0(X2,k4_xboole_0(X2,X3))) ),
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
fof(c_0_24,plain,
! [X26,X27,X28] :
( r1_tarski(X26,X28)
| ~ r1_tarski(X27,X28)
| ~ r1_tarski(X26,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_25,plain,
! [X79] : k3_xboole_0(X79,k1_xboole_0) = k1_xboole_0,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_26,plain,
! [X136,X137] : k2_xboole_0(k3_xboole_0(X136,X137),k4_xboole_0(X136,X137)) = X136,
inference(variable_rename,[status(thm)],[t51_xboole_1]) ).
cnf(c_0_27,negated_conjecture,
( ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk1_0,esk3_0))
| ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ r1_tarski(X2,X3)
| ~ r1_tarski(X1,X2)
| r1_tarski(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_29,plain,
! [X510,X511] : r1_tarski(k4_xboole_0(X510,X511),X510),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
fof(c_0_30,plain,
! [X237,X238,X239] :
( r1_tarski(k5_relat_1(X237,X239),k5_relat_1(X238,X239))
| ~ r1_tarski(X237,X238)
| ~ v1_relat_1(X239)
| ~ v1_relat_1(X238)
| ~ v1_relat_1(X237) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t49_relat_1])])])]) ).
fof(c_0_31,plain,
! [X29,X30] :
( v1_relat_1(X29)
| ~ r1_tarski(X29,X30)
| ~ v1_relat_1(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])])]) ).
fof(c_0_32,plain,
! [X138,X139,X140] : k4_xboole_0(X138,k4_xboole_0(X139,X140)) = k2_xboole_0(k4_xboole_0(X138,X139),k3_xboole_0(X138,X140)),
inference(variable_rename,[status(thm)],[t52_xboole_1]) ).
cnf(c_0_33,plain,
k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_34,plain,
! [X496] : k4_xboole_0(X496,k1_xboole_0) = X496,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_35,plain,
k2_xboole_0(k3_xboole_0(X1,X2),k4_xboole_0(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_36,plain,
! [X378,X379] : k2_xboole_0(X378,X379) = k2_xboole_0(X379,X378),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_37,plain,
! [X416,X417] : k2_xboole_0(X416,k4_xboole_0(X417,X416)) = k2_xboole_0(X416,X417),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
cnf(c_0_38,negated_conjecture,
( ~ r1_tarski(X1,k5_relat_1(esk2_0,esk3_0))
| ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),X1)
| ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_39,plain,
r1_tarski(k4_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( ~ r1_tarski(X1,X2)
| ~ v1_relat_1(X3)
| ~ v1_relat_1(X2)
| ~ v1_relat_1(X1)
| r1_tarski(k5_relat_1(X1,X3),k5_relat_1(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
( ~ r1_tarski(X2,X1)
| ~ v1_relat_1(X1)
| v1_relat_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
k4_xboole_0(X1,k4_xboole_0(X2,X3)) = k2_xboole_0(k4_xboole_0(X1,X2),k3_xboole_0(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k1_xboole_0)) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_44,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_45,plain,
k2_xboole_0(k4_xboole_0(X1,k4_xboole_0(X1,X2)),k4_xboole_0(X1,X2)) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_20]) ).
cnf(c_0_46,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_48,negated_conjecture,
( ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk1_0,esk3_0))
| ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k4_xboole_0(k5_relat_1(esk2_0,esk3_0),X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_49,plain,
( ~ r1_tarski(X1,X3)
| ~ v1_relat_1(X3)
| ~ v1_relat_1(X2)
| r1_tarski(k5_relat_1(X1,X2),k5_relat_1(X3,X2)) ),
inference(csr,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,negated_conjecture,
v1_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_51,negated_conjecture,
v1_relat_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_52,plain,
k4_xboole_0(X1,k4_xboole_0(X2,X3)) = k2_xboole_0(k4_xboole_0(X1,X2),k4_xboole_0(X1,k4_xboole_0(X1,X3))),
inference(rw,[status(thm)],[c_0_42,c_0_20]) ).
cnf(c_0_53,plain,
k4_xboole_0(X1,X1) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_54,plain,
k2_xboole_0(X1,k4_xboole_0(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_46]) ).
cnf(c_0_55,negated_conjecture,
~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k4_xboole_0(k5_relat_1(esk2_0,esk3_0),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]),c_0_39])]) ).
cnf(c_0_56,plain,
k4_xboole_0(X1,k4_xboole_0(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_44]),c_0_46]),c_0_54]) ).
cnf(c_0_57,negated_conjecture,
~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
v1_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_59,negated_conjecture,
~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_49]),c_0_50]),c_0_58])]) ).
fof(c_0_60,plain,
! [X76,X77] : k3_xboole_0(X76,X77) = k3_xboole_0(X77,X76),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_61,negated_conjecture,
( ~ r1_tarski(X1,esk2_0)
| ~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_28]) ).
cnf(c_0_62,plain,
k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_63,negated_conjecture,
~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),k4_xboole_0(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_61,c_0_39]) ).
cnf(c_0_64,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k4_xboole_0(X2,k4_xboole_0(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_20]),c_0_20]) ).
fof(c_0_65,plain,
! [X23] : r1_tarski(X23,X23),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_66,negated_conjecture,
~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),k4_xboole_0(X1,k4_xboole_0(X1,esk2_0))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_66,c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU418+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n004.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 06:24:20 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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
% 200.95/30.27 % Version: 3.5.1
% 200.95/30.27 % Preprocessing class: FMLMSMLLSSSNFFN.
% 200.95/30.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 200.95/30.27 % Starting new_bool_3 with 900s (3) cores
% 200.95/30.27 % Starting new_bool_1 with 900s (3) cores
% 200.95/30.27 % Starting sh5l with 300s (1) cores
% 200.95/30.27 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 200.95/30.27 % G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 2445407 completed with status 0
% 200.95/30.27 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 200.95/30.27 % Preprocessing class: FMLMSMLLSSSNFFN.
% 200.95/30.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 200.95/30.27 % Starting new_bool_3 with 900s (3) cores
% 200.95/30.27 % Starting new_bool_1 with 900s (3) cores
% 200.95/30.27 % Starting sh5l with 300s (1) cores
% 200.95/30.27 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 200.95/30.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 200.95/30.27 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 200.95/30.27 % Search class: FGHSM-FSLM32-MFFFFFNN
% 200.95/30.27 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 200.95/30.27 % Starting SubtermCWHack with 28s (1) cores
% 200.95/30.27 % SubtermCWHack with pid 2445408 completed with status 8
% 200.95/30.27 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 31s (1) cores
% 200.95/30.27 % G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 2446066 completed with status 0
% 200.95/30.27 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 200.95/30.27 % Preprocessing class: FMLMSMLLSSSNFFN.
% 200.95/30.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 200.95/30.27 % Starting new_bool_3 with 900s (3) cores
% 200.95/30.27 % Starting new_bool_1 with 900s (3) cores
% 200.95/30.27 % Starting sh5l with 300s (1) cores
% 200.95/30.27 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 200.95/30.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 200.95/30.27 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 200.95/30.27 % Search class: FGHSM-FSLM32-MFFFFFNN
% 200.95/30.27 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 200.95/30.27 % Starting SubtermCWHack with 28s (1) cores
% 200.95/30.27 % SubtermCWHack with pid 2445408 completed with status 8
% 200.95/30.27 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 31s (1) cores
% 200.95/30.27 % Preprocessing time : 0.023 s
% 200.95/30.27 % Presaturation interreduction done
% 200.95/30.27
% 200.95/30.27 % Proof found!
% 200.95/30.27 % SZS status Theorem
% 200.95/30.27 % SZS output start CNFRefutation
% See solution above
% 200.95/30.27 % Parsed axioms : 4476
% 200.95/30.27 % Removed by relevancy pruning/SinE : 4127
% 200.95/30.27 % Initial clauses : 631
% 200.95/30.27 % Removed in clause preprocessing : 22
% 200.95/30.27 % Initial clauses in saturation : 609
% 200.95/30.27 % Processed clauses : 2578
% 200.95/30.27 % ...of these trivial : 30
% 200.95/30.27 % ...subsumed : 1283
% 200.95/30.27 % ...remaining for further processing : 1265
% 200.95/30.27 % Other redundant clauses eliminated : 211
% 200.95/30.27 % Clauses deleted for lack of memory : 0
% 200.95/30.27 % Backward-subsumed : 55
% 200.95/30.27 % Backward-rewritten : 23
% 200.95/30.27 % Generated clauses : 9577
% 200.95/30.27 % ...of the previous two non-redundant : 8261
% 200.95/30.27 % ...aggressively subsumed : 0
% 200.95/30.27 % Contextual simplify-reflections : 13
% 200.95/30.27 % Paramodulations : 9365
% 200.95/30.27 % Factorizations : 1
% 200.95/30.27 % NegExts : 0
% 200.95/30.27 % Equation resolutions : 215
% 200.95/30.27 % Disequality decompositions : 0
% 200.95/30.27 % Total rewrite steps : 4339
% 200.95/30.27 % ...of those cached : 3585
% 200.95/30.27 % Propositional unsat checks : 0
% 200.95/30.27 % Propositional check models : 0
% 200.95/30.27 % Propositional check unsatisfiable : 0
% 200.95/30.27 % Propositional clauses : 0
% 200.95/30.27 % Propositional clauses after purity: 0
% 200.95/30.27 % Propositional unsat core size : 0
% 200.95/30.27 % Propositional preprocessing time : 0.000
% 200.95/30.27 % Propositional encoding time : 0.000
% 200.95/30.27 % Propositional solver time : 0.000
% 200.95/30.27 % Success case prop preproc time : 0.000
% 200.95/30.27 % Success case prop encoding time : 0.000
% 200.95/30.27 % Success case prop solver time : 0.000
% 200.95/30.27 % Current number of processed clauses : 589
% 200.95/30.27 % Positive orientable unit clauses : 106
% 200.95/30.27 % Positive unorientable unit clauses: 3
% 200.95/30.27 % Negative unit clauses : 113
% 200.95/30.27 % Non-unit-clauses : 367
% 200.95/30.27 % Current number of unprocessed clauses: 6771
% 200.95/30.27 % ...number of literals in the above : 17438
% 200.95/30.27 % Current number of archived formulas : 0
% 200.95/30.27 % Current number of archived clauses : 613
% 200.95/30.27 % Clause-clause subsumption calls (NU) : 94040
% 200.95/30.27 % Rec. Clause-clause subsumption calls : 47317
% 200.95/30.27 % Non-unit clause-clause subsumptions : 532
% 200.95/30.27 % Unit Clause-clause subsumption calls : 6208
% 200.95/30.27 % Rewrite failures with RHS unbound : 0
% 200.95/30.27 % BW rewrite match attempts : 210
% 200.95/30.27 % BW rewrite match successes : 117
% 200.95/30.27 % Condensation attempts : 0
% 200.95/30.27 % Condensation successes : 0
% 200.95/30.27 % Termbank termtop insertions : 220077
% 200.95/30.27 % Search garbage collected termcells : 41725
% 200.95/30.27
% 200.95/30.27 % -------------------------------------------------
% 200.95/30.27 % User time : 27.628 s
% 200.95/30.27 % System time : 1.026 s
% 200.95/30.27 % Total time : 28.654 s
% 200.95/30.27 % Maximum resident set size: 11428 pages
% 200.95/30.27
% 200.95/30.27 % -------------------------------------------------
% 200.95/30.27 % User time : 27.852 s
% 200.95/30.27 % System time : 1.049 s
% 200.95/30.27 % Total time : 28.901 s
% 200.95/30.27 % Maximum resident set size: 9984 pages
% 200.95/30.27 % E exiting
%------------------------------------------------------------------------------