TSTP Solution File: SWC079+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC079+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 0.92s 0.55s
% Output : CNFRefutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of formulae : 82 ( 12 unt; 0 def)
% Number of atoms : 305 ( 86 equ)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 366 ( 143 ~; 144 |; 35 &)
% ( 3 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 60 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ? [X6] :
( ssList(X6)
& X3 != X6
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X4) = X7
& neq(nil,X4) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
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(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
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(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(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ? [X6] :
( ssList(X6)
& X3 != X6
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X4) = X7
& neq(nil,X4) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_16,negated_conjecture,
! [X12,X13,X14] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk2_0,X12)
| ~ segmentP(esk1_0,X12) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk2_0,X12)
| ~ segmentP(esk1_0,X12) )
& ( neq(esk2_0,nil)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_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_15])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_18,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_17]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( esk3_0 = X1
| ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(esk4_0) != X2
| ~ neq(nil,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X44,X45] :
( ~ ssList(X44)
| ~ ssItem(X45)
| ssList(cons(X45,X44)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_24,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_25,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| ~ ssList(cons(hd(esk4_0),nil))
| ~ neq(nil,esk4_0)
| ~ ssItem(hd(esk4_0)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22])])])]) ).
cnf(c_0_26,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_28,plain,
! [X24] :
( ~ ssList(X24)
| nil = X24
| ssItem(hd(X24)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_30,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_31,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| ~ neq(nil,esk4_0)
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_32,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
fof(c_0_34,plain,
! [X17,X18] :
( ( ~ neq(X17,X18)
| X17 != X18
| ~ ssList(X18)
| ~ ssList(X17) )
& ( X17 = X18
| neq(X17,X18)
| ~ ssList(X18)
| ~ ssList(X17) ) ),
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_30])])])])]) ).
fof(c_0_35,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_36,plain,
! [X35,X36] :
( ~ ssList(X35)
| ~ ssItem(X36)
| hd(cons(X36,X35)) = X36 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
cnf(c_0_37,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| esk4_0 = nil
| ~ neq(nil,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_38,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_39,plain,
! [X46,X47] :
( ~ ssList(X46)
| ~ ssItem(X47)
| cons(X47,X46) != X46 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])]) ).
cnf(c_0_40,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( cons(hd(esk4_0),nil) = esk1_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33]),c_0_27])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( hd(esk1_0) = hd(esk4_0)
| esk4_0 = nil
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_27])]) ).
cnf(c_0_44,negated_conjecture,
( esk4_0 = nil
| esk1_0 != nil
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_41]),c_0_27])]) ).
fof(c_0_45,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_46,plain,
! [X28,X29] :
( ~ ssList(X28)
| ~ ssItem(X29)
| cons(X29,X28) = app(cons(X29,nil),X28) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_47,negated_conjecture,
( hd(esk1_0) = hd(esk4_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_32]),c_0_33])]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_49,negated_conjecture,
( esk4_0 = nil
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_32]),c_0_33])]) ).
fof(c_0_50,plain,
! [X78,X79,X82,X83] :
( ( ssList(esk10_2(X78,X79))
| ~ segmentP(X78,X79)
| ~ ssList(X79)
| ~ ssList(X78) )
& ( ssList(esk11_2(X78,X79))
| ~ segmentP(X78,X79)
| ~ ssList(X79)
| ~ ssList(X78) )
& ( app(app(esk10_2(X78,X79),X79),esk11_2(X78,X79)) = X78
| ~ segmentP(X78,X79)
| ~ ssList(X79)
| ~ ssList(X78) )
& ( ~ ssList(X82)
| ~ ssList(X83)
| app(app(X82,X79),X83) != X78
| segmentP(X78,X79)
| ~ ssList(X79)
| ~ ssList(X78) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])])]) ).
fof(c_0_51,plain,
! [X43] :
( ~ ssList(X43)
| nil = X43
| cons(hd(X43),tl(X43)) = X43 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])]) ).
cnf(c_0_52,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( esk4_0 = nil
| ssItem(hd(esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_47]),c_0_48])]),c_0_49]) ).
fof(c_0_54,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_55,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_50]) ).
fof(c_0_56,plain,
! [X25] :
( ~ ssList(X25)
| app(nil,X25) = X25 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_57,plain,
! [X67,X68] :
( ~ ssList(X67)
| ~ ssList(X68)
| ssList(app(X67,X68)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_58,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,negated_conjecture,
( cons(hd(esk4_0),X1) = app(esk1_0,X1)
| esk4_0 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_53]) ).
fof(c_0_60,plain,
! [X186] :
( ~ ssList(X186)
| nil = X186
| ssList(tl(X186)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])]) ).
cnf(c_0_61,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_55]) ).
cnf(c_0_62,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_63,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil
| ~ ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_33])]) ).
cnf(c_0_65,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_67,plain,
! [X89] :
( ~ ssList(X89)
| segmentP(X89,X89) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_68,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_61,c_0_62]),c_0_27])]),c_0_63]) ).
cnf(c_0_69,negated_conjecture,
( app(esk1_0,tl(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_33])]) ).
cnf(c_0_70,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_19]),c_0_22])]) ).
cnf(c_0_71,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( esk4_0 = nil
| segmentP(esk4_0,esk1_0)
| ~ ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_48])]) ).
fof(c_0_73,plain,
! [X94] :
( ~ ssList(X94)
| segmentP(X94,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_74,negated_conjecture,
( ~ segmentP(esk4_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_48])]) ).
cnf(c_0_75,negated_conjecture,
( esk4_0 = nil
| segmentP(esk4_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_65]),c_0_33])]) ).
cnf(c_0_76,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_77,negated_conjecture,
( esk4_0 = nil
| ~ neq(esk1_0,nil) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
( ~ segmentP(esk4_0,nil)
| ~ neq(nil,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_76]),c_0_27]),c_0_48])]) ).
cnf(c_0_79,negated_conjecture,
esk4_0 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_38]),c_0_27]),c_0_48])]),c_0_49]) ).
cnf(c_0_80,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_76]),c_0_33])]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_79]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWC079+1 : TPTP v8.2.0. Released v2.4.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n004.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 03:56:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 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.92/0.55 # Version: 3.1.0
% 0.92/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.92/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.92/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.92/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.92/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.92/0.55 # Starting sh5l with 300s (1) cores
% 0.92/0.55 # sh5l with pid 8595 completed with status 0
% 0.92/0.55 # Result found by sh5l
% 0.92/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.92/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.92/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.92/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.92/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.92/0.55 # Starting sh5l with 300s (1) cores
% 0.92/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.92/0.55 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.92/0.55 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.92/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.92/0.55 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 8598 completed with status 0
% 0.92/0.55 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.92/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.92/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.92/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.92/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.92/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.92/0.55 # Starting sh5l with 300s (1) cores
% 0.92/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.92/0.55 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.92/0.55 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.92/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.92/0.55 # Preprocessing time : 0.003 s
% 0.92/0.55 # Presaturation interreduction done
% 0.92/0.55
% 0.92/0.55 # Proof found!
% 0.92/0.55 # SZS status Theorem
% 0.92/0.55 # SZS output start CNFRefutation
% See solution above
% 0.92/0.55 # Parsed axioms : 96
% 0.92/0.55 # Removed by relevancy pruning/SinE : 12
% 0.92/0.55 # Initial clauses : 168
% 0.92/0.55 # Removed in clause preprocessing : 2
% 0.92/0.55 # Initial clauses in saturation : 166
% 0.92/0.55 # Processed clauses : 916
% 0.92/0.55 # ...of these trivial : 7
% 0.92/0.55 # ...subsumed : 362
% 0.92/0.55 # ...remaining for further processing : 547
% 0.92/0.55 # Other redundant clauses eliminated : 67
% 0.92/0.55 # Clauses deleted for lack of memory : 0
% 0.92/0.55 # Backward-subsumed : 27
% 0.92/0.55 # Backward-rewritten : 132
% 0.92/0.55 # Generated clauses : 2049
% 0.92/0.55 # ...of the previous two non-redundant : 1749
% 0.92/0.55 # ...aggressively subsumed : 0
% 0.92/0.55 # Contextual simplify-reflections : 126
% 0.92/0.55 # Paramodulations : 1979
% 0.92/0.55 # Factorizations : 0
% 0.92/0.55 # NegExts : 0
% 0.92/0.55 # Equation resolutions : 72
% 0.92/0.55 # Disequality decompositions : 0
% 0.92/0.55 # Total rewrite steps : 1523
% 0.92/0.55 # ...of those cached : 1503
% 0.92/0.55 # Propositional unsat checks : 0
% 0.92/0.55 # Propositional check models : 0
% 0.92/0.55 # Propositional check unsatisfiable : 0
% 0.92/0.55 # Propositional clauses : 0
% 0.92/0.55 # Propositional clauses after purity: 0
% 0.92/0.55 # Propositional unsat core size : 0
% 0.92/0.55 # Propositional preprocessing time : 0.000
% 0.92/0.55 # Propositional encoding time : 0.000
% 0.92/0.55 # Propositional solver time : 0.000
% 0.92/0.55 # Success case prop preproc time : 0.000
% 0.92/0.55 # Success case prop encoding time : 0.000
% 0.92/0.55 # Success case prop solver time : 0.000
% 0.92/0.55 # Current number of processed clauses : 212
% 0.92/0.55 # Positive orientable unit clauses : 19
% 0.92/0.55 # Positive unorientable unit clauses: 0
% 0.92/0.55 # Negative unit clauses : 2
% 0.92/0.55 # Non-unit-clauses : 191
% 0.92/0.55 # Current number of unprocessed clauses: 1137
% 0.92/0.55 # ...number of literals in the above : 7105
% 0.92/0.55 # Current number of archived formulas : 0
% 0.92/0.55 # Current number of archived clauses : 316
% 0.92/0.55 # Clause-clause subsumption calls (NU) : 24630
% 0.92/0.55 # Rec. Clause-clause subsumption calls : 8832
% 0.92/0.55 # Non-unit clause-clause subsumptions : 513
% 0.92/0.55 # Unit Clause-clause subsumption calls : 82
% 0.92/0.55 # Rewrite failures with RHS unbound : 0
% 0.92/0.55 # BW rewrite match attempts : 3
% 0.92/0.55 # BW rewrite match successes : 3
% 0.92/0.55 # Condensation attempts : 0
% 0.92/0.55 # Condensation successes : 0
% 0.92/0.55 # Termbank termtop insertions : 52191
% 0.92/0.55 # Search garbage collected termcells : 3692
% 0.92/0.55
% 0.92/0.55 # -------------------------------------------------
% 0.92/0.55 # User time : 0.078 s
% 0.92/0.55 # System time : 0.008 s
% 0.92/0.55 # Total time : 0.085 s
% 0.92/0.55 # Maximum resident set size: 2452 pages
% 0.92/0.55
% 0.92/0.55 # -------------------------------------------------
% 0.92/0.55 # User time : 0.081 s
% 0.92/0.55 # System time : 0.010 s
% 0.92/0.55 # Total time : 0.091 s
% 0.92/0.55 # Maximum resident set size: 1824 pages
% 0.92/0.55 % E---3.1 exiting
% 0.92/0.55 % E exiting
%------------------------------------------------------------------------------