TSTP Solution File: SWC390+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC390+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:26:19 EDT 2024
% Result : Theorem 105.92s 13.85s
% Output : CNFRefutation 105.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of formulae : 98 ( 20 unt; 0 def)
% Number of atoms : 359 ( 80 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 445 ( 184 ~; 180 |; 36 &)
% ( 5 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-2 aty)
% Number of variables : 131 ( 0 sgn 69 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) )
| ( segmentP(X2,X1)
& ( ~ neq(X2,nil)
| singletonP(X1) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) )
| ( segmentP(X2,X1)
& ( ~ neq(X2,nil)
| singletonP(X1) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_17,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) )
& ( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| ~ segmentP(esk2_0,esk1_0) )
& ( ~ singletonP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])]) ).
cnf(c_0_18,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_19,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( neq(esk2_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( neq(esk4_0,nil)
| ~ segmentP(esk4_0,esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_26,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_27,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_28,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| ~ segmentP(esk4_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( esk1_0 = nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[c_0_24,c_0_19]) ).
fof(c_0_30,plain,
! [X40] :
( ~ ssList(X40)
| segmentP(X40,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_32,negated_conjecture,
( ssItem(esk5_0)
| ~ segmentP(esk4_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
fof(c_0_33,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_26])])])])]) ).
fof(c_0_34,plain,
! [X57,X58] :
( ~ ssList(X57)
| ~ ssItem(X58)
| cons(X58,X57) != X57 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
cnf(c_0_35,negated_conjecture,
( cons(esk5_0,nil) = nil
| esk4_0 != nil
| ~ segmentP(esk4_0,nil) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_38,negated_conjecture,
( ssItem(esk5_0)
| esk4_0 != nil
| ~ segmentP(esk4_0,nil) ),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_39,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( cons(esk5_0,nil) = nil
| esk4_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_43,negated_conjecture,
( ssItem(esk5_0)
| esk4_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_36]),c_0_37])]) ).
cnf(c_0_44,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
esk4_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_40])]),c_0_43]) ).
fof(c_0_46,plain,
! [X24,X25,X28,X29] :
( ( ssList(esk9_2(X24,X25))
| ~ segmentP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( ssList(esk10_2(X24,X25))
| ~ segmentP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( app(app(esk9_2(X24,X25),X25),esk10_2(X24,X25)) = X24
| ~ segmentP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| app(app(X28,X25),X29) != X24
| segmentP(X24,X25)
| ~ ssList(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)],[ax7])])])])])]) ).
fof(c_0_47,plain,
! [X66,X67] :
( ~ ssList(X66)
| ~ ssItem(X67)
| cons(X67,X66) = app(cons(X67,nil),X66) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_48,negated_conjecture,
neq(esk4_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_37]),c_0_45]) ).
cnf(c_0_49,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_46]) ).
fof(c_0_50,plain,
! [X42,X43,X46,X47] :
( ( ssList(esk11_2(X42,X43))
| ~ memberP(X42,X43)
| ~ ssItem(X43)
| ~ ssList(X42) )
& ( ssList(esk12_2(X42,X43))
| ~ memberP(X42,X43)
| ~ ssItem(X43)
| ~ ssList(X42) )
& ( app(esk11_2(X42,X43),cons(X43,esk12_2(X42,X43))) = X42
| ~ memberP(X42,X43)
| ~ ssItem(X43)
| ~ ssList(X42) )
& ( ~ ssList(X46)
| ~ ssList(X47)
| app(X46,cons(X43,X47)) != X42
| memberP(X42,X43)
| ~ ssItem(X43)
| ~ ssList(X42) ) ),
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])])])])])]) ).
fof(c_0_51,plain,
! [X70,X71] :
( ~ ssList(X70)
| ~ ssList(X71)
| ssList(app(X70,X71)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_52,plain,
! [X55,X56] :
( ~ ssList(X55)
| ~ ssItem(X56)
| ssList(cons(X56,X55)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_53,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,negated_conjecture,
cons(esk5_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_48])]) ).
cnf(c_0_55,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_48])]) ).
fof(c_0_56,plain,
! [X63,X64,X65] :
( ~ ssList(X63)
| ~ ssList(X64)
| ~ ssItem(X65)
| cons(X65,app(X64,X63)) = app(cons(X65,X64),X63) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_57,plain,
! [X84] :
( ~ ssList(X84)
| app(X84,nil) = X84 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_58,plain,
! [X19] :
( ( ssList(esk7_1(X19))
| nil = X19
| ~ ssList(X19) )
& ( ssItem(esk8_1(X19))
| nil = X19
| ~ ssList(X19) )
& ( cons(esk8_1(X19),esk7_1(X19)) = X19
| nil = X19
| ~ ssList(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
fof(c_0_59,plain,
! [X12,X14] :
( ( ssItem(esk6_1(X12))
| ~ singletonP(X12)
| ~ ssList(X12) )
& ( cons(esk6_1(X12),nil) = X12
| ~ singletonP(X12)
| ~ ssList(X12) )
& ( ~ ssItem(X14)
| cons(X14,nil) != X12
| singletonP(X12)
| ~ ssList(X12) ) ),
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_60,plain,
! [X30,X31,X32] :
( ~ ssList(X30)
| ~ ssList(X31)
| ~ ssList(X32)
| ~ segmentP(X30,X31)
| ~ segmentP(X31,X32)
| segmentP(X30,X32) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
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_49]) ).
cnf(c_0_62,plain,
( app(esk11_2(X1,X2),cons(X2,esk12_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_63,plain,
( ssList(esk11_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_64,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_65,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_66,negated_conjecture,
( cons(esk5_0,X1) = app(esk1_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_67,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_68,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_69,plain,
( cons(esk8_1(X1),esk7_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_70,plain,
( ssList(esk7_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_71,plain,
( ssItem(esk8_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_72,plain,
( singletonP(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_73,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
fof(c_0_74,plain,
! [X72] :
( ~ ssList(X72)
| app(nil,X72) = X72 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_75,plain,
( segmentP(app(X1,X2),cons(X3,esk12_2(X1,X3)))
| ~ memberP(X1,X3)
| ~ ssList(cons(X3,esk12_2(X1,X3)))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64]) ).
cnf(c_0_76,negated_conjecture,
( ssList(app(esk1_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_55])]) ).
cnf(c_0_77,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_40])]) ).
cnf(c_0_78,negated_conjecture,
cons(esk8_1(esk4_0),esk7_1(esk4_0)) = esk4_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_37]),c_0_45]) ).
cnf(c_0_79,negated_conjecture,
ssList(esk7_1(esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_37]),c_0_45]) ).
cnf(c_0_80,negated_conjecture,
ssItem(esk8_1(esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_37]),c_0_45]) ).
cnf(c_0_81,negated_conjecture,
( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_82,negated_conjecture,
( ~ singletonP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_83,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_84,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_85,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,app(app(X3,X2),X4))
| ~ ssList(app(app(X3,X2),X4))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_73,c_0_61]) ).
cnf(c_0_86,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_87,negated_conjecture,
( segmentP(app(X1,X2),app(esk1_0,esk12_2(X1,esk5_0)))
| ~ memberP(X1,esk5_0)
| ~ ssList(esk12_2(X1,esk5_0))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_66]),c_0_55])]),c_0_76]) ).
cnf(c_0_88,negated_conjecture,
app(esk4_0,nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_80])]) ).
cnf(c_0_89,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_48])]) ).
cnf(c_0_90,negated_conjecture,
( ~ segmentP(esk4_0,esk1_0)
| ~ singletonP(esk1_0) ),
inference(rw,[status(thm)],[c_0_82,c_0_21]) ).
cnf(c_0_91,negated_conjecture,
singletonP(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_54]),c_0_84]),c_0_55])]) ).
cnf(c_0_92,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_40])]),c_0_64]) ).
cnf(c_0_93,negated_conjecture,
( segmentP(esk4_0,app(esk1_0,esk12_2(esk4_0,esk5_0)))
| ~ ssList(esk12_2(esk4_0,esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_40]),c_0_37])]) ).
cnf(c_0_94,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]) ).
cnf(c_0_95,negated_conjecture,
~ ssList(esk12_2(esk4_0,esk5_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_84]),c_0_37])]),c_0_94]) ).
cnf(c_0_96,plain,
( ssList(esk12_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_89]),c_0_37]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC390+1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 02:49:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 105.92/13.85 # Version: 3.1.0
% 105.92/13.85 # Preprocessing class: FSLSSMSSSSSNFFN.
% 105.92/13.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 105.92/13.85 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 105.92/13.85 # Starting new_bool_3 with 300s (1) cores
% 105.92/13.85 # Starting new_bool_1 with 300s (1) cores
% 105.92/13.85 # Starting sh5l with 300s (1) cores
% 105.92/13.85 # new_bool_3 with pid 1714 completed with status 0
% 105.92/13.85 # Result found by new_bool_3
% 105.92/13.85 # Preprocessing class: FSLSSMSSSSSNFFN.
% 105.92/13.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 105.92/13.85 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 105.92/13.85 # Starting new_bool_3 with 300s (1) cores
% 105.92/13.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 105.92/13.85 # Search class: FGHSF-FFMM21-MFFFFFNN
% 105.92/13.85 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 105.92/13.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 105.92/13.85 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1717 completed with status 0
% 105.92/13.85 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 105.92/13.85 # Preprocessing class: FSLSSMSSSSSNFFN.
% 105.92/13.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 105.92/13.85 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 105.92/13.85 # Starting new_bool_3 with 300s (1) cores
% 105.92/13.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 105.92/13.85 # Search class: FGHSF-FFMM21-MFFFFFNN
% 105.92/13.85 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 105.92/13.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 105.92/13.85 # Preprocessing time : 0.002 s
% 105.92/13.85 # Presaturation interreduction done
% 105.92/13.85
% 105.92/13.85 # Proof found!
% 105.92/13.85 # SZS status Theorem
% 105.92/13.85 # SZS output start CNFRefutation
% See solution above
% 105.92/13.85 # Parsed axioms : 96
% 105.92/13.85 # Removed by relevancy pruning/SinE : 64
% 105.92/13.85 # Initial clauses : 65
% 105.92/13.85 # Removed in clause preprocessing : 0
% 105.92/13.85 # Initial clauses in saturation : 65
% 105.92/13.85 # Processed clauses : 39180
% 105.92/13.85 # ...of these trivial : 276
% 105.92/13.85 # ...subsumed : 30690
% 105.92/13.85 # ...remaining for further processing : 8214
% 105.92/13.85 # Other redundant clauses eliminated : 703
% 105.92/13.85 # Clauses deleted for lack of memory : 0
% 105.92/13.85 # Backward-subsumed : 611
% 105.92/13.85 # Backward-rewritten : 438
% 105.92/13.85 # Generated clauses : 814766
% 105.92/13.85 # ...of the previous two non-redundant : 800703
% 105.92/13.85 # ...aggressively subsumed : 0
% 105.92/13.85 # Contextual simplify-reflections : 2378
% 105.92/13.85 # Paramodulations : 813957
% 105.92/13.85 # Factorizations : 0
% 105.92/13.85 # NegExts : 0
% 105.92/13.85 # Equation resolutions : 772
% 105.92/13.85 # Disequality decompositions : 0
% 105.92/13.85 # Total rewrite steps : 409651
% 105.92/13.85 # ...of those cached : 409172
% 105.92/13.85 # Propositional unsat checks : 1
% 105.92/13.85 # Propositional check models : 0
% 105.92/13.85 # Propositional check unsatisfiable : 0
% 105.92/13.85 # Propositional clauses : 0
% 105.92/13.85 # Propositional clauses after purity: 0
% 105.92/13.85 # Propositional unsat core size : 0
% 105.92/13.85 # Propositional preprocessing time : 0.000
% 105.92/13.85 # Propositional encoding time : 0.645
% 105.92/13.85 # Propositional solver time : 0.487
% 105.92/13.85 # Success case prop preproc time : 0.000
% 105.92/13.85 # Success case prop encoding time : 0.000
% 105.92/13.85 # Success case prop solver time : 0.000
% 105.92/13.85 # Current number of processed clauses : 7056
% 105.92/13.85 # Positive orientable unit clauses : 621
% 105.92/13.85 # Positive unorientable unit clauses: 0
% 105.92/13.85 # Negative unit clauses : 931
% 105.92/13.85 # Non-unit-clauses : 5504
% 105.92/13.85 # Current number of unprocessed clauses: 758687
% 105.92/13.85 # ...number of literals in the above : 4579052
% 105.92/13.85 # Current number of archived formulas : 0
% 105.92/13.85 # Current number of archived clauses : 1150
% 105.92/13.85 # Clause-clause subsumption calls (NU) : 2396077
% 105.92/13.85 # Rec. Clause-clause subsumption calls : 630329
% 105.92/13.85 # Non-unit clause-clause subsumptions : 16309
% 105.92/13.85 # Unit Clause-clause subsumption calls : 127009
% 105.92/13.85 # Rewrite failures with RHS unbound : 0
% 105.92/13.85 # BW rewrite match attempts : 10992
% 105.92/13.85 # BW rewrite match successes : 84
% 105.92/13.85 # Condensation attempts : 0
% 105.92/13.85 # Condensation successes : 0
% 105.92/13.85 # Termbank termtop insertions : 25876247
% 105.92/13.85 # Search garbage collected termcells : 1815
% 105.92/13.85
% 105.92/13.85 # -------------------------------------------------
% 105.92/13.85 # User time : 12.616 s
% 105.92/13.85 # System time : 0.529 s
% 105.92/13.85 # Total time : 13.145 s
% 105.92/13.85 # Maximum resident set size: 2040 pages
% 105.92/13.85
% 105.92/13.85 # -------------------------------------------------
% 105.92/13.85 # User time : 12.618 s
% 105.92/13.85 # System time : 0.532 s
% 105.92/13.85 # Total time : 13.151 s
% 105.92/13.85 # Maximum resident set size: 1824 pages
% 105.92/13.85 % E---3.1 exiting
% 105.92/13.85 % E exiting
%------------------------------------------------------------------------------