%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC316+1 : TPTP v9.3.1. Released v2.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:43:54 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 66 ( 18 unt; 0 def)
% Number of atoms : 304 ( 115 equ)
% Maximal formula atoms : 52 ( 4 avg)
% Number of connectives : 388 ( 150 ~; 141 |; 57 &)
% ( 3 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 56 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ( neq(X1,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( neq(nil,X1)
& ? [X10] :
( neq(nil,X1)
& hd(X1) = X10
& cons(X10,nil) = X9
& ssItem(X10) )
& app(X8,X9) = X7
& tl(X1) = X8
& ssList(X9) )
& ssList(X8) )
& X2 = X7
& ssList(X7) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X6,cons(X5,nil)) != X4
| app(cons(X5,nil),X6) != X3 ) ) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ( neq(X1,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( neq(nil,X1)
& ? [X10] :
( neq(nil,X1)
& hd(X1) = X10
& cons(X10,nil) = X9
& ssItem(X10) )
& app(X8,X9) = X7
& tl(X1) = X8
& ssList(X9) )
& ssList(X8) )
& X2 = X7
& ssList(X7) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X6,cons(X5,nil)) != X4
| app(cons(X5,nil),X6) != X3 ) ) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ( neq(X1,nil)
& ? [X7] :
( ? [X8] :
( ? [X9] :
( neq(nil,X1)
& ? [X10] :
( neq(nil,X1)
& hd(X1) = X10
& cons(X10,nil) = X9
& ssItem(X10) )
& app(X8,X9) = X7
& tl(X1) = X8
& ssList(X9) )
& ssList(X8) )
& X2 = X7
& ssList(X7) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X6,cons(X5,nil)) != X4
| app(cons(X5,nil),X6) != X3 ) ) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,negated_conjecture,
! [X17,X18,X19,X20] :
( ( ~ neq(esk1_0,nil)
| ~ neq(nil,esk1_0)
| ~ neq(nil,esk1_0)
| hd(esk1_0) != X20
| cons(X20,nil) != X19
| ~ ssItem(X20)
| app(X18,X19) != X17
| tl(esk1_0) != X18
| ~ ssList(X19)
| ~ ssList(X18)
| esk2_0 != X17
| ~ ssList(X17)
| ~ neq(esk4_0,nil) )
& ( ~ neq(esk1_0,nil)
| ~ neq(nil,esk1_0)
| ~ neq(nil,esk1_0)
| hd(esk1_0) != X20
| cons(X20,nil) != X19
| ~ ssItem(X20)
| app(X18,X19) != X17
| tl(esk1_0) != X18
| ~ ssList(X19)
| ~ ssList(X18)
| esk2_0 != X17
| ~ ssList(X17)
| neq(esk2_0,nil) )
& ( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) )
& ( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| neq(esk2_0,nil) )
& ( app(cons(esk5_0,nil),esk6_0) = esk3_0
| ~ neq(esk4_0,nil) )
& ( app(cons(esk5_0,nil),esk6_0) = esk3_0
| neq(esk2_0,nil) )
& ( ssList(esk6_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk6_0)
| neq(esk2_0,nil) )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( ssItem(esk5_0)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_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_11])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_14,plain,
! [X67,X68] :
( ( ~ ssList(X67)
| ~ ssList(X68)
| nil = app(X67,X68)
| nil != X67
| nil != X68 )
& ( ~ ssList(X67)
| ~ ssList(X68)
| nil != app(X67,X68)
| nil = X67 )
& ( ~ ssList(X67)
| ~ ssList(X68)
| nil != app(X67,X68)
| nil = X68 ) ),
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_15,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(cons(esk5_0,nil),esk6_0) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssList(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
app(cons(esk5_0,nil),esk6_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_17]),c_0_18])]) ).
fof(c_0_23,plain,
! [X40,X41] :
( ssList(cons(X41,X40))
| ~ ssItem(X41)
| ~ ssList(X40) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| esk1_0 != nil
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_17]),c_0_18])]) ).
fof(c_0_30,plain,
! [X51,X52] :
( cons(X52,X51) = app(cons(X52,nil),X51)
| ~ ssItem(X52)
| ~ ssList(X51) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_31,plain,
! [X57] :
( app(nil,X57) = X57
| ~ ssList(X57) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_32,negated_conjecture,
app(esk6_0,cons(esk5_0,nil)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_17]),c_0_17]),c_0_18])]) ).
cnf(c_0_33,negated_conjecture,
( esk1_0 != nil
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
fof(c_0_34,plain,
! [X31,X32] :
( hd(cons(X32,X31)) = X32
| ~ ssItem(X32)
| ~ ssList(X31) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
cnf(c_0_35,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_36,plain,
! [X71,X72] :
( tl(cons(X72,X71)) = X71
| ~ ssItem(X72)
| ~ ssList(X71) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( esk1_0 != nil
| app(nil,cons(esk5_0,nil)) = esk2_0 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_39,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_40,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ neq(nil,esk1_0)
| ~ neq(nil,esk1_0)
| hd(esk1_0) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(esk1_0) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| esk2_0 != X1
| ~ ssList(X1)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_41,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| hd(cons(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
cons(esk5_0,esk6_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_35]),c_0_22]),c_0_29])]) ).
cnf(c_0_43,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| tl(cons(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| esk1_0 != nil
| cons(esk5_0,nil) = esk2_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_45,plain,
! [X28,X29] :
( nil != cons(X29,X28)
| ~ ssItem(X29)
| ~ ssList(X28) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])])]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| esk2_0 != nil
| cons(esk5_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_32]),c_0_22])]) ).
cnf(c_0_47,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil)
| ~ neq(nil,esk1_0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| tl(esk1_0) != X2
| hd(esk1_0) != X4
| esk2_0 != X1 ),
inference(cn,[status(thm)],[c_0_40]) ).
cnf(c_0_48,negated_conjecture,
hd(esk1_0) = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_22]),c_0_29])]) ).
cnf(c_0_49,negated_conjecture,
tl(esk1_0) = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_22]),c_0_29])]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_51,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_52,negated_conjecture,
( esk1_0 != nil
| cons(esk5_0,nil) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_53,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_54,negated_conjecture,
( esk2_0 != nil
| cons(esk5_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_55,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ neq(nil,esk1_0)
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_17]),c_0_18])])])])])]),c_0_32]),c_0_22]),c_0_32]),c_0_50]),c_0_29])]) ).
fof(c_0_56,plain,
! [X23,X24] :
( ( ~ ssList(X23)
| ~ ssList(X24)
| neq(X23,X24)
| X23 = X24 )
& ( ~ ssList(X23)
| ~ ssList(X24)
| X23 != X24
| ~ neq(X23,X24) ) ),
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_51])])])])]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_58,negated_conjecture,
( esk1_0 != nil
| app(esk2_0,esk6_0) = esk1_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_28]),c_0_29])]) ).
cnf(c_0_60,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ neq(nil,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_62,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_63,negated_conjecture,
esk1_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_22]),c_0_50])]),c_0_59]) ).
cnf(c_0_64,negated_conjecture,
~ neq(nil,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_28]),c_0_62])]),c_0_63]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_61]),c_0_62]),c_0_28])]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC316+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n004.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 08:14:50 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % new_bool_1 with pid 2684955 completed with status 0
% 0.12/0.45 % Result found by new_bool_1
% 0.12/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 2684958 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.45 % Preprocessing time : 0.002 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Theorem
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 96
% 0.12/0.45 % Removed by relevancy pruning/SinE : 67
% 0.12/0.45 % Initial clauses : 57
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 57
% 0.12/0.45 % Processed clauses : 179
% 0.12/0.45 % ...of these trivial : 8
% 0.12/0.45 % ...subsumed : 39
% 0.12/0.45 % ...remaining for further processing : 132
% 0.12/0.45 % Other redundant clauses eliminated : 26
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 24
% 0.12/0.45 % Backward-rewritten : 6
% 0.12/0.45 % Generated clauses : 570
% 0.12/0.45 % ...of the previous two non-redundant : 386
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 4
% 0.12/0.45 % Paramodulations : 543
% 0.12/0.45 % Factorizations : 0
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 31
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 614
% 0.12/0.45 % ...of those cached : 594
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 98
% 0.12/0.45 % Positive orientable unit clauses : 23
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 6
% 0.12/0.45 % Non-unit-clauses : 69
% 0.12/0.45 % Current number of unprocessed clauses: 236
% 0.12/0.45 % ...number of literals in the above : 1158
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 30
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 611
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 342
% 0.12/0.45 % Non-unit clause-clause subsumptions : 40
% 0.12/0.45 % Unit Clause-clause subsumption calls : 133
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 5
% 0.12/0.45 % BW rewrite match successes : 5
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 14015
% 0.12/0.45 % Search garbage collected termcells : 1649
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.019 s
% 0.12/0.45 % System time : 0.004 s
% 0.12/0.45 % Total time : 0.023 s
% 0.12/0.45 % Maximum resident set size: 3764 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.023 s
% 0.12/0.45 % System time : 0.009 s
% 0.12/0.45 % Total time : 0.032 s
% 0.12/0.45 % Maximum resident set size: 4608 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------