%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC053+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 : n001.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:47 PM UTC 2026
% Result : Theorem 0.15s 0.69s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 74 ( 15 unt; 0 def)
% Number of atoms : 318 ( 80 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 406 ( 162 ~; 163 |; 43 &)
% ( 5 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn 51 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil) ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(app(X3,X2),X4) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax40,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X2,X3)
& frontsegP(X1,X2) )
=> frontsegP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax40) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
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(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil) ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil) ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X28,X29,X32,X33] :
( ( ~ ssList(X28)
| ~ ssList(X29)
| segmentP(X28,X29)
| app(app(X32,X29),X33) != X28
| ~ ssList(X33)
| ~ ssList(X32) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28 )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk9_2(X28,X29)) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk8_2(X28,X29)) ) ),
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)],[ax7])])])])])]) ).
fof(c_0_14,negated_conjecture,
! [X256] :
( ( nil != esk48_0
| ~ segmentP(esk48_0,X256)
| ~ segmentP(esk49_0,X256)
| ~ neq(X256,nil)
| ~ ssList(X256) )
& ( nil != esk48_0
| neq(esk49_0,nil) )
& ( nil = esk49_0
| ~ segmentP(esk48_0,X256)
| ~ segmentP(esk49_0,X256)
| ~ neq(X256,nil)
| ~ ssList(X256) )
& ( nil = esk49_0
| neq(esk49_0,nil) )
& ( frontsegP(esk50_0,esk52_0)
| nil = esk50_0 )
& ( frontsegP(esk50_0,esk52_0)
| nil = esk51_0 )
& ( frontsegP(esk51_0,esk52_0)
| nil = esk50_0 )
& ( frontsegP(esk51_0,esk52_0)
| nil = esk51_0 )
& ( neq(esk52_0,nil)
| nil = esk50_0 )
& ( neq(esk52_0,nil)
| nil = esk51_0 )
& ( ssList(esk52_0)
| nil = esk50_0 )
& ( ssList(esk52_0)
| nil = esk51_0 )
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
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)],[c_0_12])])])])])]) ).
cnf(c_0_15,plain,
( ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,X3),X2) != X4
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X135] :
( app(nil,X135) = X135
| ~ ssList(X135) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_17,plain,
! [X130,X131] :
( ssList(app(X130,X131))
| ~ ssList(X131)
| ~ ssList(X130) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_18,negated_conjecture,
( nil != esk48_0
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( nil != esk48_0
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_27,plain,
! [X20,X21,X23] :
( ( ~ ssList(X20)
| ~ ssList(X21)
| frontsegP(X20,X21)
| app(X21,X23) != X20
| ~ ssList(X23) )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| app(X21,esk6_2(X20,X21)) = X20 )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| ssList(esk6_2(X20,X21)) ) ),
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])])])])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk51_0,X1)
| ~ segmentP(esk50_0,X1)
| esk50_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( esk50_0 != nil
| neq(esk51_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_20]),c_0_19]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk6_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_36,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk51_0,X1)
| ~ segmentP(esk50_0,X1)
| esk51_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_20]),c_0_19]),c_0_20]) ).
cnf(c_0_37,negated_conjecture,
( neq(esk52_0,nil)
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_38,negated_conjecture,
( ssList(esk52_0)
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_39,negated_conjecture,
( ~ segmentP(esk51_0,esk51_0)
| ~ segmentP(esk50_0,esk51_0)
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_35,c_0_19]) ).
fof(c_0_42,plain,
! [X189] :
( segmentP(X189,X189)
| ~ ssList(X189) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_43,negated_conjecture,
( ~ segmentP(esk51_0,esk52_0)
| ~ segmentP(esk50_0,esk52_0)
| esk51_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( frontsegP(esk50_0,esk52_0)
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,negated_conjecture,
( ~ frontsegP(esk50_0,esk51_0)
| ~ segmentP(esk51_0,esk51_0)
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_31]),c_0_41])]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( ~ segmentP(esk51_0,esk52_0)
| esk51_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_41])]),c_0_38]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( frontsegP(esk51_0,esk52_0)
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_49,plain,
! [X158,X159,X160] :
( frontsegP(X158,X160)
| ~ frontsegP(X159,X160)
| ~ frontsegP(X158,X159)
| ~ ssList(X160)
| ~ ssList(X159)
| ~ ssList(X158) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])])]) ).
cnf(c_0_50,negated_conjecture,
( ~ frontsegP(esk50_0,esk51_0)
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_31])]) ).
cnf(c_0_51,negated_conjecture,
esk51_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_40]),c_0_31])]),c_0_38]),c_0_48]) ).
fof(c_0_52,plain,
! [X171] :
( frontsegP(X171,nil)
| ~ ssList(X171) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
fof(c_0_53,plain,
! [X172] :
( ( ~ ssList(X172)
| frontsegP(nil,X172)
| nil != X172 )
& ( ~ ssList(X172)
| nil = X172
| ~ frontsegP(nil,X172) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])])]) ).
cnf(c_0_54,plain,
( ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( frontsegP(esk51_0,esk52_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_56,negated_conjecture,
( ssList(esk52_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_57,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_58,negated_conjecture,
( ~ frontsegP(esk50_0,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(X1,esk51_0)
| frontsegP(X1,esk52_0)
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_31])]),c_0_56]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
fof(c_0_63,plain,
! [X109,X110] :
( ( ~ ssList(X109)
| ~ ssList(X110)
| neq(X109,X110)
| X109 = X110 )
& ( ~ ssList(X109)
| ~ ssList(X110)
| X109 != X110
| ~ neq(X109,X110) ) ),
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_57])])])])]) ).
cnf(c_0_64,negated_conjecture,
( neq(esk52_0,nil)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_65,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_41])]) ).
cnf(c_0_66,negated_conjecture,
( ~ frontsegP(nil,esk51_0)
| esk52_0 = nil
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_25])]),c_0_56]) ).
cnf(c_0_67,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_62]),c_0_25])]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_69,negated_conjecture,
neq(esk52_0,nil),
inference(sr,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
esk52_0 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_51]),c_0_67])]),c_0_65]) ).
cnf(c_0_71,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_72,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC053+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.53 % Computer : n001.cluster.edu
% 0.12/0.53 % Model : x86_64 x86_64
% 0.12/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.53 % Memory : 8046.5625MB
% 0.12/0.53 % OS : Linux 6.8.0-71-generic
% 0.12/0.53 % CPULimit : 300
% 0.12/0.53 % WCLimit : 300
% 0.12/0.53 % DateTime : Mon Sep 21 07:57:15 UTC 2026
% 0.12/0.53 % CPUTime :
% 0.12/0.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.57 Running first-order theorem proving
% 0.15/0.57 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.15/0.69 % Version: 3.5.1
% 0.15/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.69 % Starting sh5l with 300s (1) cores
% 0.15/0.69 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2612886 completed with status 0
% 0.15/0.69 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.69 % No SInE strategy applied
% 0.15/0.69 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.69 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.69 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/0.69 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.15/0.69 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.15/0.69 % G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 2612897 completed with status 0
% 0.15/0.69 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.15/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.69 % No SInE strategy applied
% 0.15/0.69 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.69 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.69 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/0.69 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.15/0.69 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.15/0.69 % Preprocessing time : 0.004 s
% 0.15/0.69 % Presaturation interreduction done
% 0.15/0.69
% 0.15/0.69 % Proof found!
% 0.15/0.69 % SZS status Theorem
% 0.15/0.69 % SZS output start CNFRefutation
% See solution above
% 0.15/0.69 % Parsed axioms : 96
% 0.15/0.69 % Removed by relevancy pruning/SinE : 0
% 0.15/0.69 % Initial clauses : 208
% 0.15/0.69 % Removed in clause preprocessing : 2
% 0.15/0.69 % Initial clauses in saturation : 206
% 0.15/0.69 % Processed clauses : 742
% 0.15/0.69 % ...of these trivial : 2
% 0.15/0.69 % ...subsumed : 173
% 0.15/0.69 % ...remaining for further processing : 567
% 0.15/0.69 % Other redundant clauses eliminated : 85
% 0.15/0.69 % Clauses deleted for lack of memory : 0
% 0.15/0.69 % Backward-subsumed : 12
% 0.15/0.69 % Backward-rewritten : 64
% 0.15/0.69 % Generated clauses : 1421
% 0.15/0.69 % ...of the previous two non-redundant : 1239
% 0.15/0.69 % ...aggressively subsumed : 0
% 0.15/0.69 % Contextual simplify-reflections : 99
% 0.15/0.69 % Paramodulations : 1330
% 0.15/0.69 % Factorizations : 0
% 0.15/0.69 % NegExts : 0
% 0.15/0.69 % Equation resolutions : 90
% 0.15/0.69 % Disequality decompositions : 0
% 0.15/0.69 % Total rewrite steps : 577
% 0.15/0.69 % ...of those cached : 557
% 0.15/0.69 % Propositional unsat checks : 0
% 0.15/0.69 % Propositional check models : 0
% 0.15/0.69 % Propositional check unsatisfiable : 0
% 0.15/0.69 % Propositional clauses : 0
% 0.15/0.69 % Propositional clauses after purity: 0
% 0.15/0.69 % Propositional unsat core size : 0
% 0.15/0.69 % Propositional preprocessing time : 0.000
% 0.15/0.69 % Propositional encoding time : 0.000
% 0.15/0.69 % Propositional solver time : 0.000
% 0.15/0.69 % Success case prop preproc time : 0.000
% 0.15/0.69 % Success case prop encoding time : 0.000
% 0.15/0.69 % Success case prop solver time : 0.000
% 0.15/0.69 % Current number of processed clauses : 265
% 0.15/0.69 % Positive orientable unit clauses : 23
% 0.15/0.69 % Positive unorientable unit clauses: 0
% 0.15/0.69 % Negative unit clauses : 4
% 0.15/0.69 % Non-unit-clauses : 238
% 0.15/0.69 % Current number of unprocessed clauses: 899
% 0.15/0.69 % ...number of literals in the above : 6375
% 0.15/0.69 % Current number of archived formulas : 0
% 0.15/0.69 % Current number of archived clauses : 279
% 0.15/0.69 % Clause-clause subsumption calls (NU) : 33753
% 0.15/0.69 % Rec. Clause-clause subsumption calls : 7622
% 0.15/0.69 % Non-unit clause-clause subsumptions : 275
% 0.15/0.69 % Unit Clause-clause subsumption calls : 248
% 0.15/0.69 % Rewrite failures with RHS unbound : 0
% 0.15/0.69 % BW rewrite match attempts : 4
% 0.15/0.69 % BW rewrite match successes : 4
% 0.15/0.69 % Condensation attempts : 0
% 0.15/0.69 % Condensation successes : 0
% 0.15/0.69 % Termbank termtop insertions : 48140
% 0.15/0.69 % Search garbage collected termcells : 4340
% 0.15/0.69
% 0.15/0.69 % -------------------------------------------------
% 0.15/0.69 % User time : 0.090 s
% 0.15/0.69 % System time : 0.006 s
% 0.15/0.69 % Total time : 0.096 s
% 0.15/0.69 % Maximum resident set size: 4272 pages
% 0.15/0.69
% 0.15/0.69 % -------------------------------------------------
% 0.15/0.69 % User time : 0.406 s
% 0.15/0.69 % System time : 0.032 s
% 0.15/0.69 % Total time : 0.438 s
% 0.15/0.69 % Maximum resident set size: 4608 pages
% 0.15/0.69 % E exiting
%------------------------------------------------------------------------------