TSTP Solution File: SWC078+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC078+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:23:07 EDT 2024
% Result : Theorem 20.85s 3.09s
% Output : CNFRefutation 20.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 77 ( 19 unt; 0 def)
% Number of atoms : 285 ( 69 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 346 ( 138 ~; 134 |; 35 &)
% ( 4 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 105 ( 0 sgn 59 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
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_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_14,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_15,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11) )
& ( nil != esk2_0
| nil != esk1_0 )
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk5_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_13])])])])])]) ).
fof(c_0_16,plain,
! [X39,X40] :
( ~ ssList(X39)
| ~ ssItem(X40)
| cons(X40,X39) != X39 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_17,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X62,X63,X66,X67] :
( ( ssList(esk12_2(X62,X63))
| ~ segmentP(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) )
& ( ssList(esk13_2(X62,X63))
| ~ segmentP(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) )
& ( app(app(esk12_2(X62,X63),X63),esk13_2(X62,X63)) = X62
| ~ segmentP(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) )
& ( ~ ssList(X66)
| ~ ssList(X67)
| app(app(X66,X63),X67) != X62
| segmentP(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) ) ),
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])])])])])]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
( nil = esk4_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_26,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X18] :
( ~ ssList(X18)
| app(nil,X18) = X18 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_28,plain,
! [X84,X85] :
( ~ ssList(X84)
| ~ ssList(X85)
| ssList(app(X84,X85)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_29,plain,
! [X19,X20] :
( ~ ssList(X19)
| ~ ssItem(X20)
| cons(X20,X19) = app(cons(X20,nil),X19) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_30,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_31,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]),c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_33,plain,
! [X23] :
( ~ ssList(X23)
| app(X23,nil) = X23 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_34,plain,
! [X24,X25,X28,X29] :
( ( ssList(esk8_2(X24,X25))
| ~ memberP(X24,X25)
| ~ ssItem(X25)
| ~ ssList(X24) )
& ( ssList(esk9_2(X24,X25))
| ~ memberP(X24,X25)
| ~ ssItem(X25)
| ~ ssList(X24) )
& ( app(esk8_2(X24,X25),cons(X25,esk9_2(X24,X25))) = X24
| ~ memberP(X24,X25)
| ~ ssItem(X25)
| ~ ssList(X24) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| app(X28,cons(X25,X29)) != X24
| memberP(X24,X25)
| ~ ssItem(X25)
| ~ ssList(X24) ) ),
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)],[ax3])])])])])]) ).
cnf(c_0_35,negated_conjecture,
( nil = esk3_0
| memberP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_37,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_42,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_44,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_45,plain,
( app(esk8_2(X1,X2),cons(X2,esk9_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_46,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_48,plain,
( ssList(esk8_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_49,plain,
! [X68,X69,X70] :
( ~ ssList(X68)
| ~ ssList(X69)
| ~ ssList(X70)
| ~ segmentP(X68,X69)
| ~ segmentP(X69,X70)
| segmentP(X68,X70) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
cnf(c_0_50,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23])]),c_0_39]) ).
cnf(c_0_51,negated_conjecture,
( app(esk3_0,X1) = cons(esk5_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_43,c_0_18]) ).
cnf(c_0_53,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_44]),c_0_23])]),c_0_39]) ).
cnf(c_0_54,negated_conjecture,
app(esk8_2(esk4_0,esk5_0),cons(esk5_0,esk9_2(esk4_0,esk5_0))) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_42])]) ).
cnf(c_0_55,negated_conjecture,
ssList(esk8_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_47]),c_0_42])]) ).
fof(c_0_56,plain,
! [X37,X38] :
( ~ ssList(X37)
| ~ ssItem(X38)
| ssList(cons(X38,X37)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_57,plain,
( ssList(esk9_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_59,plain,
! [X73] :
( ~ ssList(X73)
| segmentP(X73,X73) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_60,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_61,negated_conjecture,
( segmentP(cons(esk5_0,X1),esk3_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_62,negated_conjecture,
( ssList(cons(esk5_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_51]),c_0_52])]) ).
cnf(c_0_63,negated_conjecture,
( segmentP(esk4_0,cons(esk5_0,esk9_2(esk4_0,esk5_0)))
| ~ ssList(cons(esk5_0,esk9_2(esk4_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_64,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_65,negated_conjecture,
ssList(esk9_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_46]),c_0_47]),c_0_42])]) ).
cnf(c_0_66,negated_conjecture,
( ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_18]),c_0_19]) ).
cnf(c_0_67,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_68,negated_conjecture,
( segmentP(X1,esk3_0)
| ~ segmentP(X1,cons(esk5_0,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_52])]),c_0_62]) ).
cnf(c_0_69,negated_conjecture,
segmentP(esk4_0,cons(esk5_0,esk9_2(esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_42])]) ).
fof(c_0_70,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_71,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_52])]) ).
cnf(c_0_72,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_47]),c_0_65])]) ).
fof(c_0_73,plain,
! [X82,X83] :
( ( ~ neq(X82,X83)
| X82 != X83
| ~ ssList(X83)
| ~ ssList(X82) )
& ( X82 = X83
| neq(X82,X83)
| ~ ssList(X83)
| ~ ssList(X82) ) ),
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_70])])])])]) ).
cnf(c_0_74,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]) ).
cnf(c_0_75,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_76,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_74,c_0_75]),c_0_23]),c_0_52])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC078+1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n006.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 03:48:08 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/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
% 20.85/3.09 # Version: 3.1.0
% 20.85/3.09 # Preprocessing class: FSLSSMSSSSSNFFN.
% 20.85/3.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.85/3.09 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 20.85/3.09 # Starting new_bool_3 with 300s (1) cores
% 20.85/3.09 # Starting new_bool_1 with 300s (1) cores
% 20.85/3.09 # Starting sh5l with 300s (1) cores
% 20.85/3.09 # sh5l with pid 11237 completed with status 0
% 20.85/3.09 # Result found by sh5l
% 20.85/3.09 # Preprocessing class: FSLSSMSSSSSNFFN.
% 20.85/3.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.85/3.09 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 20.85/3.09 # Starting new_bool_3 with 300s (1) cores
% 20.85/3.09 # Starting new_bool_1 with 300s (1) cores
% 20.85/3.09 # Starting sh5l with 300s (1) cores
% 20.85/3.09 # SinE strategy is gf500_gu_R04_F100_L20000
% 20.85/3.09 # Search class: FGHSF-FSLM21-MFFFFFNN
% 20.85/3.09 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 20.85/3.09 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 20.85/3.09 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 11245 completed with status 0
% 20.85/3.09 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 20.85/3.09 # Preprocessing class: FSLSSMSSSSSNFFN.
% 20.85/3.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.85/3.09 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 20.85/3.09 # Starting new_bool_3 with 300s (1) cores
% 20.85/3.09 # Starting new_bool_1 with 300s (1) cores
% 20.85/3.09 # Starting sh5l with 300s (1) cores
% 20.85/3.09 # SinE strategy is gf500_gu_R04_F100_L20000
% 20.85/3.09 # Search class: FGHSF-FSLM21-MFFFFFNN
% 20.85/3.09 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 20.85/3.09 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 20.85/3.09 # Preprocessing time : 0.002 s
% 20.85/3.09 # Presaturation interreduction done
% 20.85/3.09
% 20.85/3.09 # Proof found!
% 20.85/3.09 # SZS status Theorem
% 20.85/3.09 # SZS output start CNFRefutation
% See solution above
% 20.85/3.09 # Parsed axioms : 96
% 20.85/3.09 # Removed by relevancy pruning/SinE : 8
% 20.85/3.09 # Initial clauses : 181
% 20.85/3.09 # Removed in clause preprocessing : 2
% 20.85/3.09 # Initial clauses in saturation : 179
% 20.85/3.09 # Processed clauses : 18191
% 20.85/3.09 # ...of these trivial : 209
% 20.85/3.09 # ...subsumed : 13747
% 20.85/3.09 # ...remaining for further processing : 4235
% 20.85/3.09 # Other redundant clauses eliminated : 504
% 20.85/3.09 # Clauses deleted for lack of memory : 0
% 20.85/3.09 # Backward-subsumed : 182
% 20.85/3.09 # Backward-rewritten : 491
% 20.85/3.09 # Generated clauses : 110740
% 20.85/3.09 # ...of the previous two non-redundant : 98756
% 20.85/3.09 # ...aggressively subsumed : 0
% 20.85/3.09 # Contextual simplify-reflections : 1369
% 20.85/3.09 # Paramodulations : 110207
% 20.85/3.09 # Factorizations : 4
% 20.85/3.09 # NegExts : 0
% 20.85/3.09 # Equation resolutions : 527
% 20.85/3.09 # Disequality decompositions : 0
% 20.85/3.09 # Total rewrite steps : 131173
% 20.85/3.09 # ...of those cached : 130631
% 20.85/3.09 # Propositional unsat checks : 0
% 20.85/3.09 # Propositional check models : 0
% 20.85/3.09 # Propositional check unsatisfiable : 0
% 20.85/3.09 # Propositional clauses : 0
% 20.85/3.09 # Propositional clauses after purity: 0
% 20.85/3.09 # Propositional unsat core size : 0
% 20.85/3.09 # Propositional preprocessing time : 0.000
% 20.85/3.09 # Propositional encoding time : 0.000
% 20.85/3.09 # Propositional solver time : 0.000
% 20.85/3.09 # Success case prop preproc time : 0.000
% 20.85/3.09 # Success case prop encoding time : 0.000
% 20.85/3.09 # Success case prop solver time : 0.000
% 20.85/3.09 # Current number of processed clauses : 3366
% 20.85/3.09 # Positive orientable unit clauses : 595
% 20.85/3.09 # Positive unorientable unit clauses: 0
% 20.85/3.09 # Negative unit clauses : 468
% 20.85/3.09 # Non-unit-clauses : 2303
% 20.85/3.09 # Current number of unprocessed clauses: 79975
% 20.85/3.09 # ...number of literals in the above : 496951
% 20.85/3.09 # Current number of archived formulas : 0
% 20.85/3.09 # Current number of archived clauses : 849
% 20.85/3.09 # Clause-clause subsumption calls (NU) : 1042377
% 20.85/3.09 # Rec. Clause-clause subsumption calls : 198680
% 20.85/3.09 # Non-unit clause-clause subsumptions : 8045
% 20.85/3.09 # Unit Clause-clause subsumption calls : 58801
% 20.85/3.09 # Rewrite failures with RHS unbound : 0
% 20.85/3.09 # BW rewrite match attempts : 1762
% 20.85/3.09 # BW rewrite match successes : 131
% 20.85/3.09 # Condensation attempts : 0
% 20.85/3.09 # Condensation successes : 0
% 20.85/3.09 # Termbank termtop insertions : 2894180
% 20.85/3.09 # Search garbage collected termcells : 3913
% 20.85/3.09
% 20.85/3.09 # -------------------------------------------------
% 20.85/3.09 # User time : 2.538 s
% 20.85/3.09 # System time : 0.054 s
% 20.85/3.09 # Total time : 2.592 s
% 20.85/3.09 # Maximum resident set size: 2432 pages
% 20.85/3.09
% 20.85/3.09 # -------------------------------------------------
% 20.85/3.09 # User time : 2.540 s
% 20.85/3.09 # System time : 0.056 s
% 20.85/3.09 # Total time : 2.596 s
% 20.85/3.09 # Maximum resident set size: 1828 pages
% 20.85/3.09 % E---3.1 exiting
% 20.85/3.09 % E exiting
%------------------------------------------------------------------------------