TSTP Solution File: SWC388+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC388+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:29:25 EDT 2024
% Result : Theorem 15.96s 2.38s
% Output : CNFRefutation 15.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 80 ( 18 unt; 0 def)
% Number of atoms : 310 ( 72 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 393 ( 163 ~; 156 |; 31 &)
% ( 7 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn 64 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ( ~ singletonP(X3)
& neq(X4,nil) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).
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(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
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(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ( ~ singletonP(X3)
& neq(X4,nil) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_15,plain,
! [X154,X155,X156] :
( ( ~ memberP(cons(X155,X156),X154)
| X154 = X155
| memberP(X156,X154)
| ~ ssList(X156)
| ~ ssItem(X155)
| ~ ssItem(X154) )
& ( X154 != X155
| memberP(cons(X155,X156),X154)
| ~ ssList(X156)
| ~ ssItem(X155)
| ~ ssItem(X154) )
& ( ~ memberP(X156,X154)
| memberP(cons(X155,X156),X154)
| ~ ssList(X156)
| ~ ssItem(X155)
| ~ ssItem(X154) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
fof(c_0_16,negated_conjecture,
! [X255] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& segmentP(esk51_0,esk50_0)
& ( ~ ssItem(X255)
| cons(X255,nil) != esk48_0
| ~ memberP(esk49_0,X255) )
& ( singletonP(esk50_0)
| ~ neq(esk51_0,nil) )
& ( nil != esk49_0
| nil != esk48_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_14])])])])]) ).
fof(c_0_17,plain,
! [X220,X221] :
( ~ ssList(X220)
| ~ ssItem(X221)
| cons(X221,X220) = app(cons(X221,nil),X220) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_18,plain,
! [X17,X19] :
( ( ssItem(esk5_1(X17))
| ~ singletonP(X17)
| ~ ssList(X17) )
& ( cons(esk5_1(X17),nil) = X17
| ~ singletonP(X17)
| ~ ssList(X17) )
& ( ~ ssItem(X19)
| cons(X19,nil) != X17
| singletonP(X17)
| ~ ssList(X17) ) ),
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)],[ax4])])])])])]) ).
fof(c_0_19,plain,
! [X151,X152,X153] :
( ( ~ memberP(app(X152,X153),X151)
| memberP(X152,X151)
| memberP(X153,X151)
| ~ ssList(X153)
| ~ ssList(X152)
| ~ ssItem(X151) )
& ( ~ memberP(X152,X151)
| memberP(app(X152,X153),X151)
| ~ ssList(X153)
| ~ ssList(X152)
| ~ ssItem(X151) )
& ( ~ memberP(X153,X151)
| memberP(app(X152,X153),X151)
| ~ ssList(X153)
| ~ ssList(X152)
| ~ ssItem(X151) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])])]) ).
cnf(c_0_20,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X111,X112] :
( ~ ssList(X111)
| ~ ssItem(X112)
| ssList(cons(X112,X111)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_22,plain,
! [X28,X29,X32,X33] :
( ( ssList(esk8_2(X28,X29))
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( ssList(esk9_2(X28,X29))
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( ~ ssList(X32)
| ~ ssList(X33)
| app(app(X32,X29),X33) != X28
| segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) ) ),
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_23,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssItem(X1)
| cons(X1,nil) != esk48_0
| ~ memberP(esk49_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
( cons(esk5_1(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( ssItem(esk5_1(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_31,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_32,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_34,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_35,plain,
! [X222,X223,X224] :
( ~ ssList(X222)
| ~ ssList(X223)
| ~ ssList(X224)
| app(app(X222,X223),X224) = app(X222,app(X223,X224)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_36,plain,
( app(app(esk8_2(X1,X2),X2),esk9_2(X1,X2)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_37,negated_conjecture,
segmentP(esk51_0,esk48_0),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_40,plain,
( ssList(esk9_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_41,plain,
( ssList(esk8_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_42,negated_conjecture,
( cons(X1,nil) != esk48_0
| ~ memberP(esk51_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_43,plain,
( cons(esk5_1(X1),X2) = app(X1,X2)
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_44,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_45,plain,
! [X227] :
( ~ ssList(X227)
| app(X227,nil) = X227 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_46,plain,
! [X125,X126] :
( ~ ssList(X125)
| ~ ssItem(X126)
| hd(cons(X126,X125)) = X126 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
cnf(c_0_47,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_48,plain,
! [X109,X110] :
( ( ~ neq(X109,X110)
| X109 != X110
| ~ ssList(X110)
| ~ ssList(X109) )
& ( X109 = X110
| neq(X109,X110)
| ~ ssList(X110)
| ~ ssList(X109) ) ),
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_31])])])])]) ).
cnf(c_0_49,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_50,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_51,negated_conjecture,
app(app(esk8_2(esk51_0,esk48_0),esk48_0),esk9_2(esk51_0,esk48_0)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk9_2(esk51_0,esk48_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_53,negated_conjecture,
ssList(esk8_2(esk51_0,esk48_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_54,negated_conjecture,
( app(X1,nil) != esk48_0
| ~ singletonP(X1)
| ~ memberP(esk51_0,esk5_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_30]) ).
cnf(c_0_55,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_57,negated_conjecture,
( singletonP(esk48_0)
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_47,c_0_24]) ).
cnf(c_0_58,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_59,plain,
( memberP(app(X1,app(X2,X3)),esk5_1(X2))
| ~ singletonP(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_43]),c_0_30]) ).
cnf(c_0_60,negated_conjecture,
app(esk8_2(esk51_0,esk48_0),app(esk48_0,esk9_2(esk51_0,esk48_0))) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_38]),c_0_53])]) ).
cnf(c_0_61,negated_conjecture,
( ~ singletonP(esk48_0)
| ~ memberP(esk51_0,esk5_1(esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55])]),c_0_38])]) ).
fof(c_0_62,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_63,plain,
( esk5_1(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_29]),c_0_44])]),c_0_30]) ).
cnf(c_0_64,negated_conjecture,
( esk51_0 = nil
| singletonP(esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_44]),c_0_39])]) ).
cnf(c_0_65,negated_conjecture,
~ singletonP(esk48_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_53]),c_0_52]),c_0_38])]),c_0_61]) ).
fof(c_0_66,plain,
! [X122,X123] :
( ~ ssList(X122)
| ~ ssItem(X123)
| nil != cons(X123,X122) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_62])])])]) ).
cnf(c_0_67,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_63]) ).
cnf(c_0_68,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_63]) ).
cnf(c_0_69,negated_conjecture,
( nil != esk49_0
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_70,plain,
! [X195] :
( ( ~ segmentP(nil,X195)
| nil = X195
| ~ ssList(X195) )
& ( nil != X195
| segmentP(nil,X195)
| ~ ssList(X195) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_71,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_73,negated_conjecture,
( cons(hd(esk48_0),nil) = esk48_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_64]),c_0_38])]) ).
cnf(c_0_74,negated_conjecture,
( esk51_0 = nil
| ssItem(hd(esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_64]),c_0_38])]) ).
cnf(c_0_75,negated_conjecture,
( esk48_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[c_0_69,c_0_26]) ).
cnf(c_0_76,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_77,negated_conjecture,
segmentP(nil,esk48_0),
inference(rw,[status(thm)],[c_0_37,c_0_71]) ).
cnf(c_0_78,negated_conjecture,
esk48_0 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_44])]),c_0_74]),c_0_75]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_38])]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SWC388+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sun May 19 03:09:07 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.35 Running first-order model finding
% 0.11/0.35 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.96/2.38 # Version: 3.1.0
% 15.96/2.38 # Preprocessing class: FSLSSMSSSSSNFFN.
% 15.96/2.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.96/2.38 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.96/2.38 # Starting new_bool_3 with 300s (1) cores
% 15.96/2.38 # Starting new_bool_1 with 300s (1) cores
% 15.96/2.38 # Starting sh5l with 300s (1) cores
% 15.96/2.38 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1566 completed with status 0
% 15.96/2.38 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 15.96/2.38 # Preprocessing class: FSLSSMSSSSSNFFN.
% 15.96/2.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.96/2.38 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.96/2.38 # No SInE strategy applied
% 15.96/2.38 # Search class: FGHSF-FSLM21-MFFFFFNN
% 15.96/2.38 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 15.96/2.38 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 15.96/2.38 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 15.96/2.38 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 15.96/2.38 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 15.96/2.38 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 15.96/2.38 # G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with pid 1575 completed with status 0
% 15.96/2.38 # Result found by G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S
% 15.96/2.38 # Preprocessing class: FSLSSMSSSSSNFFN.
% 15.96/2.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.96/2.38 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.96/2.38 # No SInE strategy applied
% 15.96/2.38 # Search class: FGHSF-FSLM21-MFFFFFNN
% 15.96/2.38 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 15.96/2.38 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 15.96/2.38 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 15.96/2.38 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 15.96/2.38 # Preprocessing time : 0.002 s
% 15.96/2.38 # Presaturation interreduction done
% 15.96/2.38
% 15.96/2.38 # Proof found!
% 15.96/2.38 # SZS status Theorem
% 15.96/2.38 # SZS output start CNFRefutation
% See solution above
% 15.96/2.38 # Parsed axioms : 96
% 15.96/2.38 # Removed by relevancy pruning/SinE : 0
% 15.96/2.38 # Initial clauses : 200
% 15.96/2.38 # Removed in clause preprocessing : 2
% 15.96/2.38 # Initial clauses in saturation : 198
% 15.96/2.38 # Processed clauses : 15684
% 15.96/2.38 # ...of these trivial : 20
% 15.96/2.38 # ...subsumed : 12659
% 15.96/2.38 # ...remaining for further processing : 3005
% 15.96/2.38 # Other redundant clauses eliminated : 937
% 15.96/2.38 # Clauses deleted for lack of memory : 0
% 15.96/2.38 # Backward-subsumed : 102
% 15.96/2.38 # Backward-rewritten : 923
% 15.96/2.38 # Generated clauses : 114791
% 15.96/2.38 # ...of the previous two non-redundant : 111161
% 15.96/2.38 # ...aggressively subsumed : 0
% 15.96/2.38 # Contextual simplify-reflections : 1786
% 15.96/2.38 # Paramodulations : 113835
% 15.96/2.38 # Factorizations : 4
% 15.96/2.38 # NegExts : 0
% 15.96/2.38 # Equation resolutions : 953
% 15.96/2.38 # Disequality decompositions : 0
% 15.96/2.38 # Total rewrite steps : 66369
% 15.96/2.38 # ...of those cached : 66310
% 15.96/2.38 # Propositional unsat checks : 0
% 15.96/2.38 # Propositional check models : 0
% 15.96/2.38 # Propositional check unsatisfiable : 0
% 15.96/2.38 # Propositional clauses : 0
% 15.96/2.38 # Propositional clauses after purity: 0
% 15.96/2.38 # Propositional unsat core size : 0
% 15.96/2.38 # Propositional preprocessing time : 0.000
% 15.96/2.38 # Propositional encoding time : 0.000
% 15.96/2.38 # Propositional solver time : 0.000
% 15.96/2.38 # Success case prop preproc time : 0.000
% 15.96/2.38 # Success case prop encoding time : 0.000
% 15.96/2.38 # Success case prop solver time : 0.000
% 15.96/2.38 # Current number of processed clauses : 1764
% 15.96/2.38 # Positive orientable unit clauses : 33
% 15.96/2.38 # Positive unorientable unit clauses: 0
% 15.96/2.38 # Negative unit clauses : 4
% 15.96/2.38 # Non-unit-clauses : 1727
% 15.96/2.38 # Current number of unprocessed clauses: 95381
% 15.96/2.38 # ...number of literals in the above : 622390
% 15.96/2.38 # Current number of archived formulas : 0
% 15.96/2.38 # Current number of archived clauses : 1218
% 15.96/2.38 # Clause-clause subsumption calls (NU) : 1460344
% 15.96/2.38 # Rec. Clause-clause subsumption calls : 198450
% 15.96/2.38 # Non-unit clause-clause subsumptions : 11487
% 15.96/2.38 # Unit Clause-clause subsumption calls : 5839
% 15.96/2.38 # Rewrite failures with RHS unbound : 0
% 15.96/2.38 # BW rewrite match attempts : 15
% 15.96/2.38 # BW rewrite match successes : 15
% 15.96/2.38 # Condensation attempts : 0
% 15.96/2.38 # Condensation successes : 0
% 15.96/2.38 # Termbank termtop insertions : 2610459
% 15.96/2.38 # Search garbage collected termcells : 4265
% 15.96/2.38
% 15.96/2.38 # -------------------------------------------------
% 15.96/2.38 # User time : 1.919 s
% 15.96/2.38 # System time : 0.053 s
% 15.96/2.38 # Total time : 1.972 s
% 15.96/2.38 # Maximum resident set size: 2468 pages
% 15.96/2.38
% 15.96/2.38 # -------------------------------------------------
% 15.96/2.38 # User time : 9.566 s
% 15.96/2.38 # System time : 0.244 s
% 15.96/2.38 # Total time : 9.809 s
% 15.96/2.38 # Maximum resident set size: 1824 pages
% 15.96/2.38 % E---3.1 exiting
%------------------------------------------------------------------------------