%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC327+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 : n026.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:43:57 PM UTC 2026
% Result : Theorem 0.15s 5.70s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 67 ( 18 unt; 0 def)
% Number of atoms : 327 ( 159 equ)
% Maximal formula atoms : 66 ( 4 avg)
% Number of connectives : 425 ( 165 ~; 176 |; 50 &)
% ( 1 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 44 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil = X2
| nil != X1 )
& ? [X9] :
( equalelemsP(X1)
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( ! [X12] :
( ssList(X12)
=> app(X12,cons(X10,nil)) != X1 )
| app(cons(X10,nil),X11) != X9 ) ) )
& app(X1,X9) = X2
& ssList(X9) ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X3
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil = X2
| nil != X1 )
& ? [X9] :
( equalelemsP(X1)
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( ! [X12] :
( ssList(X12)
=> app(X12,cons(X10,nil)) != X1 )
| app(cons(X10,nil),X11) != X9 ) ) )
& app(X1,X9) = X2
& ssList(X9) ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X3
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil = X2
| nil != X1 )
& ? [X9] :
( equalelemsP(X1)
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( ! [X12] :
( ssList(X12)
=> app(X12,cons(X10,nil)) != X1 )
| app(cons(X10,nil),X11) != X9 ) ) )
& app(X1,X9) = X2
& ssList(X9) ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X3
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,negated_conjecture,
! [X262,X263,X264,X265] :
( ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| app(esk55_1(X265),cons(esk53_1(X265),nil)) = esk48_0
| nil != esk49_0 )
& ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| app(esk55_1(X265),cons(esk53_1(X265),nil)) = esk48_0
| nil = esk48_0 )
& ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| ssList(esk55_1(X265))
| nil != esk49_0 )
& ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| ssList(esk55_1(X265))
| nil = esk48_0 )
& ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| app(cons(esk53_1(X265),nil),esk54_1(X265)) = X265
| nil != esk49_0 )
& ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| app(cons(esk53_1(X265),nil),esk54_1(X265)) = X265
| nil = esk48_0 )
& ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| ssList(esk54_1(X265))
| nil != esk49_0 )
& ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| ssList(esk54_1(X265))
| nil = esk48_0 )
& ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| ssItem(esk53_1(X265))
| nil != esk49_0 )
& ( ~ equalelemsP(esk48_0)
| app(esk48_0,X265) != esk49_0
| ~ ssList(X265)
| ssItem(esk53_1(X265))
| nil = esk48_0 )
& ( nil != esk50_0
| nil = esk51_0 )
& ( app(X264,cons(X262,nil)) != esk50_0
| ~ ssList(X264)
| app(cons(X262,nil),X263) != esk52_0
| ~ ssList(X263)
| ~ ssItem(X262) )
& equalelemsP(esk50_0)
& app(esk50_0,esk52_0) = esk51_0
& ssList(esk52_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_7])])])])])]) ).
cnf(c_0_9,negated_conjecture,
equalelemsP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( ~ equalelemsP(esk48_0)
| app(esk48_0,X1) != esk49_0
| ~ ssList(X1)
| app(esk55_1(X1),cons(esk53_1(X1),nil)) = esk48_0
| nil = esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
equalelemsP(esk48_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( ~ equalelemsP(esk48_0)
| app(esk48_0,X1) != esk49_0
| ~ ssList(X1)
| ssItem(esk53_1(X1))
| nil = esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( ~ equalelemsP(esk48_0)
| app(esk48_0,X1) != esk49_0
| ~ ssList(X1)
| ssList(esk55_1(X1))
| nil = esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( app(X3,cons(X1,nil)) != esk50_0
| ~ ssList(X3)
| app(cons(X1,nil),X2) != esk52_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssList(X1)
| app(esk48_0,X1) != esk49_0
| esk48_0 = nil
| app(esk55_1(X1),cons(esk53_1(X1),nil)) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_19,negated_conjecture,
app(esk48_0,esk52_0) = esk49_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10]),c_0_14]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(X1)
| app(esk48_0,X1) != esk49_0
| ssItem(esk53_1(X1))
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_12])]) ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(X1)
| app(esk48_0,X1) != esk49_0
| ssList(esk55_1(X1))
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_12])]) ).
cnf(c_0_23,negated_conjecture,
( ~ equalelemsP(esk48_0)
| app(esk48_0,X1) != esk49_0
| ~ ssList(X1)
| app(cons(esk53_1(X1),nil),esk54_1(X1)) = X1
| nil = esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
( ~ equalelemsP(esk48_0)
| app(esk48_0,X1) != esk49_0
| ~ ssList(X1)
| ssList(esk54_1(X1))
| nil = esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(cons(X2,nil),X3) != esk52_0
| app(X1,cons(X2,nil)) != esk48_0 ),
inference(rw,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
( esk48_0 = nil
| app(esk55_1(esk52_0),cons(esk53_1(esk52_0),nil)) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
( ssItem(esk53_1(esk52_0))
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_20])]) ).
cnf(c_0_28,negated_conjecture,
( ssList(esk55_1(esk52_0))
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_20])]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X1)
| app(esk48_0,X1) != esk49_0
| esk48_0 = nil
| app(cons(esk53_1(X1),nil),esk54_1(X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_12])]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(X1)
| app(esk48_0,X1) != esk49_0
| ssList(esk54_1(X1))
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_12])]) ).
cnf(c_0_31,negated_conjecture,
( nil != esk50_0
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(X1)
| app(cons(esk53_1(esk52_0),nil),X1) != esk52_0
| esk48_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( esk48_0 = nil
| app(cons(esk53_1(esk52_0),nil),esk54_1(esk52_0)) = esk52_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_19]),c_0_20])]) ).
cnf(c_0_34,negated_conjecture,
( ssList(esk54_1(esk52_0))
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_20])]) ).
cnf(c_0_35,negated_conjecture,
( ~ equalelemsP(esk48_0)
| app(esk48_0,X1) != esk49_0
| ~ ssList(X1)
| nil != esk49_0
| app(esk55_1(X1),cons(esk53_1(X1),nil)) = esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_36,negated_conjecture,
( esk48_0 != nil
| esk49_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_14]),c_0_10]) ).
cnf(c_0_37,negated_conjecture,
esk48_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( ~ equalelemsP(esk48_0)
| app(esk48_0,X1) != esk49_0
| ~ ssList(X1)
| nil != esk49_0
| ssList(esk55_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(X1)
| esk49_0 != nil
| app(esk48_0,X1) != esk49_0
| app(esk55_1(X1),cons(esk53_1(X1),nil)) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_12])]) ).
cnf(c_0_40,negated_conjecture,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
fof(c_0_41,plain,
! [X233] :
( app(X233,nil) = X233
| ~ ssList(X233) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(X1)
| esk49_0 != nil
| app(esk48_0,X1) != esk49_0
| ssList(esk55_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_12])]) ).
cnf(c_0_43,negated_conjecture,
( ~ equalelemsP(esk48_0)
| app(esk48_0,X1) != esk49_0
| ~ ssList(X1)
| nil != esk49_0
| ssItem(esk53_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_44,plain,
! [X231,X232] :
( ( ~ ssList(X231)
| ~ ssList(X232)
| nil = app(X231,X232)
| nil != X231
| nil != X232 )
& ( ~ ssList(X231)
| ~ ssList(X232)
| nil != app(X231,X232)
| nil = X231 )
& ( ~ ssList(X231)
| ~ ssList(X232)
| nil != app(X231,X232)
| nil = X232 ) ),
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])])])])]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(X1)
| app(nil,X1) != nil
| app(esk55_1(X1),cons(esk53_1(X1),nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_37]),c_0_37]),c_0_40]),c_0_40])]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X1)
| app(nil,X1) != nil
| ssList(esk55_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_37]),c_0_40]),c_0_40])]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(X1)
| esk49_0 != nil
| app(esk48_0,X1) != esk49_0
| ssItem(esk53_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_12])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
app(esk55_1(nil),cons(esk53_1(nil),nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk55_1(nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_47])]) ).
fof(c_0_53,plain,
! [X117,X118] :
( ssList(cons(X118,X117))
| ~ ssItem(X118)
| ~ ssList(X117) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(X1)
| app(nil,X1) != nil
| ssItem(esk53_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_37]),c_0_40]),c_0_40])]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(cons(esk53_1(nil),nil))
| esk55_1(nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_56,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
ssItem(esk53_1(nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_46]),c_0_47])]) ).
cnf(c_0_58,negated_conjecture,
esk55_1(nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_47]),c_0_57])]) ).
fof(c_0_59,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_60,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_61,negated_conjecture,
app(nil,cons(esk53_1(nil),nil)) = nil,
inference(rw,[status(thm)],[c_0_51,c_0_58]) ).
fof(c_0_62,plain,
! [X128,X129] :
( nil != cons(X129,X128)
| ~ ssItem(X129)
| ~ ssList(X128) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])])]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(cons(esk53_1(nil),nil))
| cons(esk53_1(nil),nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_47])]) ).
cnf(c_0_64,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_65,negated_conjecture,
cons(esk53_1(nil),nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_56]),c_0_47]),c_0_57])]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_47]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC327+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.11/5.57 % Computer : n026.cluster.edu
% 0.11/5.57 % Model : x86_64 x86_64
% 0.11/5.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.57 % Memory : 8046.5625MB
% 0.11/5.57 % OS : Linux 6.8.0-71-generic
% 0.11/5.57 % CPULimit : 300
% 0.11/5.57 % WCLimit : 300
% 0.11/5.57 % DateTime : Mon Sep 21 08:18:57 UTC 2026
% 0.11/5.57 % CPUTime :
% 0.11/5.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.62 Running first-order theorem proving
% 0.15/5.62 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/5.70 % Version: 3.5.1
% 0.15/5.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.70 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.70 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.70 % Starting sh5l with 300s (1) cores
% 0.15/5.70 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1818342 completed with status 0
% 0.15/5.70 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/5.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.70 % No SInE strategy applied
% 0.15/5.70 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/5.70 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.70 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.70 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/5.70 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.15/5.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.15/5.70 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 1818351 completed with status 0
% 0.15/5.70 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.15/5.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.70 % No SInE strategy applied
% 0.15/5.70 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/5.70 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.70 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.70 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/5.70 % Preprocessing time : 0.004 s
% 0.15/5.70
% 0.15/5.70 % Proof found!
% 0.15/5.70 % SZS status Theorem
% 0.15/5.70 % SZS output start CNFRefutation
% See solution above
% 0.15/5.70 % Parsed axioms : 96
% 0.15/5.70 % Removed by relevancy pruning/SinE : 0
% 0.15/5.70 % Initial clauses : 211
% 0.15/5.70 % Removed in clause preprocessing : 2
% 0.15/5.70 % Initial clauses in saturation : 209
% 0.15/5.70 % Processed clauses : 328
% 0.15/5.70 % ...of these trivial : 6
% 0.15/5.70 % ...subsumed : 34
% 0.15/5.70 % ...remaining for further processing : 288
% 0.15/5.70 % Other redundant clauses eliminated : 69
% 0.15/5.70 % Clauses deleted for lack of memory : 0
% 0.15/5.70 % Backward-subsumed : 1
% 0.15/5.70 % Backward-rewritten : 62
% 0.15/5.70 % Generated clauses : 1055
% 0.15/5.70 % ...of the previous two non-redundant : 890
% 0.15/5.70 % ...aggressively subsumed : 0
% 0.15/5.70 % Contextual simplify-reflections : 18
% 0.15/5.70 % Paramodulations : 959
% 0.15/5.70 % Factorizations : 0
% 0.15/5.70 % NegExts : 0
% 0.15/5.70 % Equation resolutions : 96
% 0.15/5.70 % Disequality decompositions : 0
% 0.15/5.70 % Total rewrite steps : 606
% 0.15/5.70 % ...of those cached : 578
% 0.15/5.70 % Propositional unsat checks : 0
% 0.15/5.70 % Propositional check models : 0
% 0.15/5.70 % Propositional check unsatisfiable : 0
% 0.15/5.70 % Propositional clauses : 0
% 0.15/5.70 % Propositional clauses after purity: 0
% 0.15/5.70 % Propositional unsat core size : 0
% 0.15/5.70 % Propositional preprocessing time : 0.000
% 0.15/5.70 % Propositional encoding time : 0.000
% 0.15/5.70 % Propositional solver time : 0.000
% 0.15/5.70 % Success case prop preproc time : 0.000
% 0.15/5.70 % Success case prop encoding time : 0.000
% 0.15/5.70 % Success case prop solver time : 0.000
% 0.15/5.70 % Current number of processed clauses : 219
% 0.15/5.70 % Positive orientable unit clauses : 27
% 0.15/5.70 % Positive unorientable unit clauses: 0
% 0.15/5.70 % Negative unit clauses : 2
% 0.15/5.70 % Non-unit-clauses : 190
% 0.15/5.70 % Current number of unprocessed clauses: 687
% 0.15/5.70 % ...number of literals in the above : 4775
% 0.15/5.70 % Current number of archived formulas : 0
% 0.15/5.70 % Current number of archived clauses : 63
% 0.15/5.70 % Clause-clause subsumption calls (NU) : 7996
% 0.15/5.70 % Rec. Clause-clause subsumption calls : 2222
% 0.15/5.70 % Non-unit clause-clause subsumptions : 52
% 0.15/5.70 % Unit Clause-clause subsumption calls : 151
% 0.15/5.70 % Rewrite failures with RHS unbound : 0
% 0.15/5.70 % BW rewrite match attempts : 10
% 0.15/5.70 % BW rewrite match successes : 10
% 0.15/5.70 % Condensation attempts : 0
% 0.15/5.70 % Condensation successes : 0
% 0.15/5.70 % Termbank termtop insertions : 39357
% 0.15/5.70 % Search garbage collected termcells : 4511
% 0.15/5.70
% 0.15/5.70 % -------------------------------------------------
% 0.15/5.70 % User time : 0.053 s
% 0.15/5.70 % System time : 0.007 s
% 0.15/5.70 % Total time : 0.060 s
% 0.15/5.70 % Maximum resident set size: 4276 pages
% 0.15/5.70
% 0.15/5.70 % -------------------------------------------------
% 0.15/5.70 % User time : 0.224 s
% 0.15/5.70 % System time : 0.025 s
% 0.15/5.70 % Total time : 0.249 s
% 0.15/5.70 % Maximum resident set size: 4864 pages
% 0.15/5.70 % E exiting
%------------------------------------------------------------------------------