TSTP Solution File: SWC295+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC295+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:28:53 EDT 2024
% Result : Theorem 0.67s 0.61s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 13
% Syntax : Number of formulae : 81 ( 18 unt; 0 def)
% Number of atoms : 313 ( 119 equ)
% Maximal formula atoms : 41 ( 3 avg)
% Number of connectives : 352 ( 120 ~; 142 |; 40 &)
% ( 2 <=>; 48 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 10 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 67 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ! [X8] :
( ssItem(X8)
=> ( ( ~ memberP(X6,X8)
| lt(X8,X5) )
& ( ~ memberP(X7,X8)
| lt(X5,X8) ) ) ) ) ) ) )
| ( ! [X9] :
( ssItem(X9)
=> ( cons(X9,nil) != X3
| ~ memberP(X4,X9)
| ? [X10] :
( ssItem(X10)
& X9 != X10
& memberP(X4,X10)
& leq(X9,X10) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
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(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ! [X8] :
( ssItem(X8)
=> ( ( ~ memberP(X6,X8)
| lt(X8,X5) )
& ( ~ memberP(X7,X8)
| lt(X5,X8) ) ) ) ) ) ) )
| ( ! [X9] :
( ssItem(X9)
=> ( cons(X9,nil) != X3
| ~ memberP(X4,X9)
| ? [X10] :
( ssItem(X10)
& X9 != X10
& memberP(X4,X10)
& leq(X9,X10) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_14,negated_conjecture,
! [X264] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& ssList(esk53_0)
& ssList(esk54_0)
& app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0
& ssItem(esk55_0)
& ( memberP(esk54_0,esk55_0)
| memberP(esk53_0,esk55_0) )
& ( ~ lt(esk52_0,esk55_0)
| memberP(esk53_0,esk55_0) )
& ( memberP(esk54_0,esk55_0)
| ~ lt(esk55_0,esk52_0) )
& ( ~ lt(esk52_0,esk55_0)
| ~ lt(esk55_0,esk52_0) )
& ( nil = esk51_0
| ssItem(esk56_0) )
& ( nil = esk50_0
| ssItem(esk56_0) )
& ( nil = esk51_0
| cons(esk56_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk56_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk56_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk56_0) )
& ( nil = esk51_0
| ~ ssItem(X264)
| esk56_0 = X264
| ~ memberP(esk51_0,X264)
| ~ leq(esk56_0,X264) )
& ( nil = esk50_0
| ~ ssItem(X264)
| esk56_0 = X264
| ~ memberP(esk51_0,X264)
| ~ leq(esk56_0,X264) ) ),
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])])])])])]) ).
cnf(c_0_15,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_16,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X226,X227,X228] :
( ~ ssList(X226)
| ~ ssList(X227)
| ~ ssList(X228)
| app(app(X226,X227),X228) = app(X226,app(X227,X228)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_18,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk50_0,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X115,X116] :
( ~ ssList(X115)
| ~ ssItem(X116)
| ssList(cons(X116,X115)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_23,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[ax86]) ).
cnf(c_0_24,negated_conjecture,
( app(esk53_0,app(cons(esk52_0,nil),esk54_0)) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_28,plain,
! [X224,X225] :
( ~ ssList(X224)
| ~ ssItem(X225)
| cons(X225,X224) = app(cons(X225,nil),X224) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_29,plain,
! [X234,X235] :
( ~ ssList(X234)
| ~ ssList(X235)
| nil = X234
| tl(app(X234,X235)) = app(tl(X234),X235) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
cnf(c_0_30,negated_conjecture,
app(esk53_0,app(cons(esk52_0,nil),esk54_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
app(esk53_0,cons(esk52_0,esk54_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_20]),c_0_27])]) ).
fof(c_0_34,plain,
! [X229,X230] :
( ( nil = X230
| nil != app(X229,X230)
| ~ ssList(X230)
| ~ ssList(X229) )
& ( nil = X229
| nil != app(X229,X230)
| ~ ssList(X230)
| ~ ssList(X229) )
& ( nil != X230
| nil != X229
| nil = app(X229,X230)
| ~ ssList(X230)
| ~ ssList(X229) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_35,negated_conjecture,
( app(tl(esk53_0),cons(esk52_0,esk54_0)) = tl(esk50_0)
| esk53_0 = nil
| ~ ssList(cons(esk52_0,esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21])]) ).
fof(c_0_36,plain,
! [X132,X133] :
( ~ ssList(X132)
| ~ ssItem(X133)
| tl(cons(X133,X132)) = X132 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
cnf(c_0_37,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( app(tl(esk53_0),cons(esk52_0,esk54_0)) = tl(esk50_0)
| esk53_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_25]),c_0_20]),c_0_27])]) ).
cnf(c_0_39,plain,
( tl(cons(X2,X1)) = X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( nil = esk51_0
| cons(esk56_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_41,negated_conjecture,
( nil = esk51_0
| ssItem(esk56_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_42,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_43,negated_conjecture,
( cons(esk52_0,esk54_0) = nil
| esk53_0 = nil
| tl(esk50_0) != nil
| ~ ssList(cons(esk52_0,esk54_0))
| ~ ssList(tl(esk53_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( tl(esk50_0) = nil
| esk51_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_26])]),c_0_41]) ).
fof(c_0_45,plain,
! [X131] :
( ~ ssList(X131)
| nil = X131
| ssList(tl(X131)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
fof(c_0_46,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_47,negated_conjecture,
( cons(esk52_0,esk54_0) = nil
| esk51_0 = nil
| esk53_0 = nil
| ~ ssList(cons(esk52_0,esk54_0))
| ~ ssList(tl(esk53_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_49,plain,
! [X126,X127] :
( ~ ssList(X126)
| ~ ssItem(X127)
| nil != cons(X127,X126) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])]) ).
cnf(c_0_50,negated_conjecture,
( cons(esk52_0,esk54_0) = nil
| esk53_0 = nil
| esk51_0 = nil
| ~ ssList(cons(esk52_0,esk54_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_21])]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( cons(esk52_0,esk54_0) = nil
| esk51_0 = nil
| esk53_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_25]),c_0_20]),c_0_27])]) ).
fof(c_0_53,plain,
! [X139] :
( ~ ssList(X139)
| app(nil,X139) = X139 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_54,negated_conjecture,
( esk53_0 = nil
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_20]),c_0_27])]) ).
cnf(c_0_55,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( app(nil,cons(esk52_0,esk54_0)) = esk50_0
| esk51_0 = nil ),
inference(spm,[status(thm)],[c_0_33,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( cons(esk52_0,esk54_0) = esk50_0
| esk51_0 = nil
| ~ ssList(cons(esk52_0,esk54_0)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
( cons(esk52_0,esk54_0) = esk50_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_25]),c_0_20]),c_0_27])]) ).
cnf(c_0_59,negated_conjecture,
( tl(esk50_0) = esk54_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_58]),c_0_20]),c_0_27])]) ).
fof(c_0_60,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_61,negated_conjecture,
( memberP(esk54_0,esk55_0)
| memberP(esk53_0,esk55_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_62,negated_conjecture,
( esk51_0 = nil
| esk54_0 = nil ),
inference(spm,[status(thm)],[c_0_44,c_0_59]) ).
fof(c_0_63,plain,
! [X161] :
( ~ ssItem(X161)
| ~ memberP(nil,X161) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])]) ).
cnf(c_0_64,negated_conjecture,
( esk51_0 = nil
| memberP(nil,esk55_0)
| memberP(esk53_0,esk55_0) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
fof(c_0_65,plain,
! [X15,X16,X19,X20] :
( ( ssList(esk3_2(X15,X16))
| ~ memberP(X15,X16)
| ~ ssItem(X16)
| ~ ssList(X15) )
& ( ssList(esk4_2(X15,X16))
| ~ memberP(X15,X16)
| ~ ssItem(X16)
| ~ ssList(X15) )
& ( app(esk3_2(X15,X16),cons(X16,esk4_2(X15,X16))) = X15
| ~ memberP(X15,X16)
| ~ ssItem(X16)
| ~ ssList(X15) )
& ( ~ ssList(X19)
| ~ ssList(X20)
| app(X19,cons(X16,X20)) != X15
| memberP(X15,X16)
| ~ ssItem(X16)
| ~ ssList(X15) ) ),
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_66,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_67,negated_conjecture,
( esk51_0 = nil
| memberP(nil,esk55_0) ),
inference(spm,[status(thm)],[c_0_64,c_0_54]) ).
cnf(c_0_68,negated_conjecture,
ssItem(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_69,plain,
( memberP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,cons(X3,X2)) != X4
| ~ ssItem(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_70,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_71,negated_conjecture,
( nil = esk50_0
| memberP(esk51_0,esk56_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_72,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]) ).
cnf(c_0_73,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_69]) ).
cnf(c_0_74,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_70,c_0_16]) ).
cnf(c_0_75,negated_conjecture,
( esk50_0 = nil
| memberP(nil,esk56_0) ),
inference(rw,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_76,negated_conjecture,
( nil = esk50_0
| ssItem(esk56_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_77,negated_conjecture,
memberP(esk50_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_33]),c_0_74]),c_0_20]),c_0_21]),c_0_27])]) ).
cnf(c_0_78,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_75]),c_0_76]) ).
cnf(c_0_79,negated_conjecture,
memberP(nil,esk52_0),
inference(rw,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_79]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC295+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n025.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 03:29:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.67/0.61 # Version: 3.1.0
% 0.67/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.67/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.67/0.61 # Starting sh5l with 300s (1) cores
% 0.67/0.61 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21634 completed with status 0
% 0.67/0.61 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.67/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.61 # No SInE strategy applied
% 0.67/0.61 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.67/0.61 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.61 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.67/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.67/0.61 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.67/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.67/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.67/0.61 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 21645 completed with status 0
% 0.67/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.67/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.61 # No SInE strategy applied
% 0.67/0.61 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.67/0.61 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.61 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.67/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.67/0.61 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.67/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.67/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.67/0.61 # Preprocessing time : 0.003 s
% 0.67/0.61 # Presaturation interreduction done
% 0.67/0.61
% 0.67/0.61 # Proof found!
% 0.67/0.61 # SZS status Theorem
% 0.67/0.61 # SZS output start CNFRefutation
% See solution above
% 0.67/0.61 # Parsed axioms : 96
% 0.67/0.61 # Removed by relevancy pruning/SinE : 0
% 0.67/0.61 # Initial clauses : 213
% 0.67/0.61 # Removed in clause preprocessing : 2
% 0.67/0.61 # Initial clauses in saturation : 211
% 0.67/0.61 # Processed clauses : 1138
% 0.67/0.61 # ...of these trivial : 5
% 0.67/0.61 # ...subsumed : 428
% 0.67/0.61 # ...remaining for further processing : 705
% 0.67/0.61 # Other redundant clauses eliminated : 96
% 0.67/0.61 # Clauses deleted for lack of memory : 0
% 0.67/0.61 # Backward-subsumed : 20
% 0.67/0.61 # Backward-rewritten : 177
% 0.67/0.61 # Generated clauses : 3049
% 0.67/0.61 # ...of the previous two non-redundant : 2760
% 0.67/0.61 # ...aggressively subsumed : 0
% 0.67/0.61 # Contextual simplify-reflections : 97
% 0.67/0.61 # Paramodulations : 2950
% 0.67/0.61 # Factorizations : 0
% 0.67/0.61 # NegExts : 0
% 0.67/0.61 # Equation resolutions : 101
% 0.67/0.61 # Disequality decompositions : 0
% 0.67/0.61 # Total rewrite steps : 2312
% 0.67/0.61 # ...of those cached : 2279
% 0.67/0.61 # Propositional unsat checks : 0
% 0.67/0.61 # Propositional check models : 0
% 0.67/0.61 # Propositional check unsatisfiable : 0
% 0.67/0.61 # Propositional clauses : 0
% 0.67/0.61 # Propositional clauses after purity: 0
% 0.67/0.61 # Propositional unsat core size : 0
% 0.67/0.61 # Propositional preprocessing time : 0.000
% 0.67/0.61 # Propositional encoding time : 0.000
% 0.67/0.61 # Propositional solver time : 0.000
% 0.67/0.61 # Success case prop preproc time : 0.000
% 0.67/0.61 # Success case prop encoding time : 0.000
% 0.67/0.61 # Success case prop solver time : 0.000
% 0.67/0.61 # Current number of processed clauses : 280
% 0.67/0.61 # Positive orientable unit clauses : 25
% 0.67/0.61 # Positive unorientable unit clauses: 0
% 0.67/0.61 # Negative unit clauses : 2
% 0.67/0.61 # Non-unit-clauses : 253
% 0.67/0.61 # Current number of unprocessed clauses: 2024
% 0.67/0.61 # ...number of literals in the above : 12701
% 0.67/0.61 # Current number of archived formulas : 0
% 0.67/0.61 # Current number of archived clauses : 402
% 0.67/0.61 # Clause-clause subsumption calls (NU) : 29766
% 0.67/0.61 # Rec. Clause-clause subsumption calls : 9706
% 0.67/0.61 # Non-unit clause-clause subsumptions : 531
% 0.67/0.61 # Unit Clause-clause subsumption calls : 267
% 0.67/0.61 # Rewrite failures with RHS unbound : 0
% 0.67/0.61 # BW rewrite match attempts : 12
% 0.67/0.61 # BW rewrite match successes : 12
% 0.67/0.61 # Condensation attempts : 0
% 0.67/0.61 # Condensation successes : 0
% 0.67/0.61 # Termbank termtop insertions : 73205
% 0.67/0.61 # Search garbage collected termcells : 4459
% 0.67/0.61
% 0.67/0.61 # -------------------------------------------------
% 0.67/0.61 # User time : 0.110 s
% 0.67/0.61 # System time : 0.011 s
% 0.67/0.61 # Total time : 0.121 s
% 0.67/0.61 # Maximum resident set size: 2500 pages
% 0.67/0.61
% 0.67/0.61 # -------------------------------------------------
% 0.67/0.61 # User time : 0.515 s
% 0.67/0.61 # System time : 0.026 s
% 0.67/0.61 # Total time : 0.541 s
% 0.67/0.61 # Maximum resident set size: 1828 pages
% 0.67/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------