%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC021+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:42:39 PM UTC 2026
% Result : Theorem 0.86s 0.75s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 74 ( 12 unt; 0 def)
% Number of atoms : 306 ( 75 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 384 ( 152 ~; 146 |; 45 &)
% ( 4 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn 61 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X1
& nil = X2 )
| ? [X6] :
( strictorderedP(X6)
& segmentP(X6,X3)
& frontsegP(X4,X6)
& neq(X3,X6)
& ssList(X6) )
| ? [X5] :
( frontsegP(X1,X5)
& frontsegP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X1
& nil = X2 )
| ? [X6] :
( strictorderedP(X6)
& segmentP(X6,X3)
& frontsegP(X4,X6)
& neq(X3,X6)
& ssList(X6) )
| ? [X5] :
( frontsegP(X1,X5)
& frontsegP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X1
& nil = X2 )
| ? [X6] :
( strictorderedP(X6)
& segmentP(X6,X3)
& frontsegP(X4,X6)
& neq(X3,X6)
& ssList(X6) )
| ? [X5] :
( frontsegP(X1,X5)
& frontsegP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_16,negated_conjecture,
! [X11,X12] :
( ( nil != esk1_0
| nil != esk2_0 )
& ( ~ strictorderedP(X12)
| ~ segmentP(X12,esk3_0)
| ~ frontsegP(esk4_0,X12)
| ~ neq(esk3_0,X12)
| ~ ssList(X12) )
& ( ~ frontsegP(esk1_0,X11)
| ~ frontsegP(esk2_0,X11)
| ~ neq(X11,nil)
| ~ ssList(X11) )
& strictorderedP(esk3_0)
& frontsegP(esk4_0,esk3_0)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
fof(c_0_17,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_18,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X71,X72] :
( ( ~ ssList(X71)
| ~ ssList(X72)
| neq(X71,X72)
| X71 = X72 )
& ( ~ ssList(X71)
| ~ ssList(X72)
| X71 != X72
| ~ neq(X71,X72) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ frontsegP(esk4_0,X1)
| ~ frontsegP(esk3_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(esk4_0,X1)
| ~ frontsegP(esk3_0,X1)
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
frontsegP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_28,plain,
! [X59] :
( frontsegP(X59,X59)
| ~ ssList(X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ frontsegP(esk3_0,esk3_0)
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_31,plain,
! [X48] :
( segmentP(X48,nil)
| ~ ssList(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_32,plain,
! [X50,X51,X53] :
( ( ~ ssList(X50)
| ~ ssList(X51)
| frontsegP(X50,X51)
| app(X51,X53) != X50
| ~ ssList(X53) )
& ( ~ ssList(X50)
| ~ ssList(X51)
| ~ frontsegP(X50,X51)
| app(X51,esk14_2(X50,X51)) = X50 )
& ( ~ ssList(X50)
| ~ ssList(X51)
| ~ frontsegP(X50,X51)
| ssList(esk14_2(X50,X51)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])])]) ).
fof(c_0_33,plain,
! [X101,X102] :
( ssList(app(X101,X102))
| ~ ssList(X102)
| ~ ssList(X101) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_34,plain,
! [X113,X114] :
( ( ~ ssList(X113)
| ~ ssList(X114)
| nil = app(X113,X114)
| nil != X113
| nil != X114 )
& ( ~ ssList(X113)
| ~ ssList(X114)
| nil != app(X113,X114)
| nil = X113 )
& ( ~ ssList(X113)
| ~ ssList(X114)
| nil != app(X113,X114)
| nil = X114 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
fof(c_0_35,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_36,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,esk3_0)
| ~ frontsegP(esk4_0,X1)
| ~ neq(esk3_0,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_37,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_27])]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X2,X1) != X3
| ~ ssList(X1)
| frontsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_41,plain,
! [X84,X85] :
( cons(X85,X84) = app(cons(X85,nil),X84)
| ~ ssItem(X85)
| ~ ssList(X84) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_42,plain,
! [X73,X74] :
( ssList(cons(X74,X73))
| ~ ssItem(X74)
| ~ ssList(X73) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_43,plain,
! [X81,X82,X83] :
( cons(X83,app(X82,X81)) = app(cons(X83,X82),X81)
| ~ ssItem(X83)
| ~ ssList(X82)
| ~ ssList(X81) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_45,plain,
! [X16,X17] :
( nil != cons(X17,X16)
| ~ ssItem(X17)
| ~ ssList(X16) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])]) ).
cnf(c_0_46,negated_conjecture,
( ~ neq(nil,X1)
| ~ ssList(X1)
| ~ frontsegP(esk4_0,X1)
| ~ strictorderedP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]),c_0_38]) ).
fof(c_0_47,plain,
! [X29] :
( strictorderedP(cons(X29,nil))
| ~ ssItem(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])])]) ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_39]),c_0_40]) ).
cnf(c_0_49,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_50,plain,
! [X13] :
( ( ~ ssList(X13)
| nil = X13
| cons(esk6_1(X13),esk5_1(X13)) = X13 )
& ( ~ ssList(X13)
| nil = X13
| ssItem(esk6_1(X13)) )
& ( ~ ssList(X13)
| nil = X13
| ssList(esk5_1(X13)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_51,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_52,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_53,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_54,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])]),c_0_24])]) ).
cnf(c_0_55,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(esk4_0,X1)
| ~ strictorderedP(X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_23]),c_0_24])]) ).
cnf(c_0_57,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_58,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| frontsegP(cons(X1,X2),cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk6_1(X1),esk5_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_62,negated_conjecture,
( esk4_0 != nil
| esk3_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_19]),c_0_20]) ).
cnf(c_0_63,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_40]) ).
cnf(c_0_64,plain,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_24])]) ).
cnf(c_0_65,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| app(cons(X1,X2),X3) != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_53]),c_0_40]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ frontsegP(esk4_0,cons(X1,nil))
| cons(X1,nil) = nil ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| ~ ssList(cons(esk6_1(X1),nil))
| frontsegP(X1,cons(esk6_1(X1),nil))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61]) ).
cnf(c_0_68,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_69,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_37])]) ).
cnf(c_0_70,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_24])]) ).
cnf(c_0_71,plain,
( ~ ssItem(X1)
| cons(X1,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_64]),c_0_24])]) ).
cnf(c_0_72,negated_conjecture,
~ ssItem(esk6_1(esk4_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]),c_0_69]),c_0_70]),c_0_71]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_60]),c_0_68])]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC021+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n014.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 07:49:34 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.53 Running first-order theorem proving
% 0.19/0.53 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.86/0.75 % Version: 3.5.1
% 0.86/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.86/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.86/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.86/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.86/0.75 % Starting sh5l with 300s (1) cores
% 0.86/0.75 % new_bool_1 with pid 3566757 completed with status 0
% 0.86/0.75 % Result found by new_bool_1
% 0.86/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.86/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.86/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.86/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.86/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.86/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.86/0.75 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.86/0.75 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.75 % Starting SubtermCWHack with 31s (1) cores
% 0.86/0.75 % SubtermCWHack with pid 3566760 completed with status 0
% 0.86/0.75 % Result found by SubtermCWHack
% 0.86/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.86/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.86/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.86/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.86/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.86/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.86/0.75 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.86/0.75 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.75 % Starting SubtermCWHack with 31s (1) cores
% 0.86/0.75 % Preprocessing time : 0.003 s
% 0.86/0.75
% 0.86/0.75 % Proof found!
% 0.86/0.75 % SZS status Theorem
% 0.86/0.75 % SZS output start CNFRefutation
% See solution above
% 0.86/0.75 % Parsed axioms : 96
% 0.86/0.75 % Removed by relevancy pruning/SinE : 39
% 0.86/0.75 % Initial clauses : 100
% 0.86/0.75 % Removed in clause preprocessing : 1
% 0.86/0.75 % Initial clauses in saturation : 99
% 0.86/0.75 % Processed clauses : 984
% 0.86/0.75 % ...of these trivial : 0
% 0.86/0.75 % ...subsumed : 689
% 0.86/0.75 % ...remaining for further processing : 295
% 0.86/0.75 % Other redundant clauses eliminated : 73
% 0.86/0.75 % Clauses deleted for lack of memory : 0
% 0.86/0.75 % Backward-subsumed : 13
% 0.86/0.75 % Backward-rewritten : 12
% 0.86/0.75 % Generated clauses : 3664
% 0.86/0.75 % ...of the previous two non-redundant : 3160
% 0.86/0.75 % ...aggressively subsumed : 0
% 0.86/0.75 % Contextual simplify-reflections : 102
% 0.86/0.75 % Paramodulations : 3579
% 0.86/0.75 % Factorizations : 0
% 0.86/0.75 % NegExts : 0
% 0.86/0.75 % Equation resolutions : 86
% 0.86/0.75 % Disequality decompositions : 0
% 0.86/0.75 % Total rewrite steps : 2055
% 0.86/0.75 % ...of those cached : 2045
% 0.86/0.75 % Propositional unsat checks : 0
% 0.86/0.75 % Propositional check models : 0
% 0.86/0.75 % Propositional check unsatisfiable : 0
% 0.86/0.75 % Propositional clauses : 0
% 0.86/0.75 % Propositional clauses after purity: 0
% 0.86/0.75 % Propositional unsat core size : 0
% 0.86/0.75 % Propositional preprocessing time : 0.000
% 0.86/0.75 % Propositional encoding time : 0.000
% 0.86/0.75 % Propositional solver time : 0.000
% 0.86/0.75 % Success case prop preproc time : 0.000
% 0.86/0.75 % Success case prop encoding time : 0.000
% 0.86/0.75 % Success case prop solver time : 0.000
% 0.86/0.75 % Current number of processed clauses : 259
% 0.86/0.75 % Positive orientable unit clauses : 13
% 0.86/0.75 % Positive unorientable unit clauses: 0
% 0.86/0.75 % Negative unit clauses : 4
% 0.86/0.75 % Non-unit-clauses : 242
% 0.86/0.75 % Current number of unprocessed clauses: 2221
% 0.86/0.75 % ...number of literals in the above : 12394
% 0.86/0.75 % Current number of archived formulas : 0
% 0.86/0.75 % Current number of archived clauses : 25
% 0.86/0.75 % Clause-clause subsumption calls (NU) : 19319
% 0.86/0.75 % Rec. Clause-clause subsumption calls : 9273
% 0.86/0.75 % Non-unit clause-clause subsumptions : 803
% 0.86/0.75 % Unit Clause-clause subsumption calls : 33
% 0.86/0.75 % Rewrite failures with RHS unbound : 0
% 0.86/0.75 % BW rewrite match attempts : 4
% 0.86/0.75 % BW rewrite match successes : 4
% 0.86/0.75 % Condensation attempts : 0
% 0.86/0.75 % Condensation successes : 0
% 0.86/0.75 % Termbank termtop insertions : 69893
% 0.86/0.75 % Search garbage collected termcells : 2461
% 0.86/0.75
% 0.86/0.75 % -------------------------------------------------
% 0.86/0.75 % User time : 0.146 s
% 0.86/0.75 % System time : 0.008 s
% 0.86/0.75 % Total time : 0.154 s
% 0.86/0.75 % Maximum resident set size: 4272 pages
% 0.86/0.75
% 0.86/0.75 % -------------------------------------------------
% 0.86/0.75 % User time : 0.152 s
% 0.86/0.75 % System time : 0.015 s
% 0.86/0.75 % Total time : 0.167 s
% 0.86/0.75 % Maximum resident set size: 4864 pages
% 0.86/0.75 % E exiting
%------------------------------------------------------------------------------