TSTP Solution File: SWC396+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC396+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:40:48 EDT 2023
% Result : Theorem 0.99s 0.57s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 15
% Syntax : Number of formulae : 85 ( 16 unt; 0 def)
% Number of atoms : 389 ( 125 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 493 ( 189 ~; 211 |; 48 &)
% ( 5 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn; 65 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssList(X6)
& X4 != X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X3) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X3) = X9
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',co1) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax26) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax24) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax17) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax22) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax15) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax78) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax86) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax83) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax85) ).
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/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax36) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax3) ).
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/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax37) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p',ax38) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssList(X6)
& X4 != X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X3) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X3) = X9
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_16,negated_conjecture,
! [X259,X260,X261,X262] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& memberP(esk48_0,esk52_0)
& ~ memberP(esk49_0,esk52_0)
& ( nil = esk50_0
| nil != esk51_0 )
& ( neq(esk50_0,nil)
| ~ neq(esk51_0,nil) )
& ( ~ ssList(X259)
| esk51_0 = X259
| ~ ssList(X260)
| ~ ssList(X261)
| tl(esk50_0) != X260
| app(X260,X261) != X259
| ~ ssItem(X262)
| cons(X262,nil) != X261
| hd(esk50_0) != X262
| ~ neq(nil,esk50_0)
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil) ) ),
inference(distribute,[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,
( esk51_0 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(esk50_0) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(esk50_0) != X4
| ~ neq(nil,esk50_0)
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_18,plain,
! [X133,X134] :
( ~ ssList(X133)
| ~ ssList(X134)
| ssList(app(X133,X134)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_19,negated_conjecture,
( esk51_0 = X1
| hd(esk50_0) != X4
| tl(esk50_0) != X2
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssItem(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil) ),
inference(cn,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X130] :
( ~ ssList(X130)
| nil = X130
| ssList(tl(X130)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| ~ ssList(cons(hd(esk50_0),nil))
| ~ ssList(tl(esk50_0))
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil)
| ~ ssItem(hd(esk50_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])])])]),c_0_20]) ).
cnf(c_0_25,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,plain,
! [X114,X115] :
( ~ ssList(X114)
| ~ ssItem(X115)
| ssList(cons(X115,X114)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_28,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil
| ~ ssList(cons(hd(esk50_0),nil))
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil)
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_31,plain,
! [X127] :
( ~ ssList(X127)
| nil = X127
| ssItem(hd(X127)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_32,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil)
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_34,plain,
! [X112,X113] :
( ( ~ neq(X112,X113)
| X112 != X113
| ~ ssList(X113)
| ~ ssList(X112) )
& ( X112 = X113
| neq(X112,X113)
| ~ ssList(X113)
| ~ ssList(X112) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
fof(c_0_35,plain,
! [X216] :
( ~ ssList(X216)
| nil = X216
| cons(hd(X216),tl(X216)) = X216 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_36,plain,
! [X233,X234] :
( ~ ssList(X233)
| ~ ssList(X234)
| nil = X233
| tl(app(X233,X234)) = app(tl(X233),X234) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax86])])]) ).
fof(c_0_37,plain,
! [X228,X229] :
( ( nil = X229
| nil != app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( nil = X228
| nil != app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) )
& ( nil != X229
| nil != X228
| nil = app(X228,X229)
| ~ ssList(X229)
| ~ ssList(X228) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_38,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26])]) ).
cnf(c_0_39,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_41,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_42,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil
| ~ neq(esk51_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_26]),c_0_30])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( nil = esk50_0
| nil != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_48,plain,
( cons(hd(app(X1,X2)),app(tl(X1),X2)) = app(X1,X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_20]),c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_30]),c_0_46])]),c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( cons(hd(app(esk50_0,cons(hd(esk50_0),nil))),esk51_0) = app(esk50_0,cons(hd(esk50_0),nil))
| esk50_0 = nil
| ~ ssList(cons(hd(esk50_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_26])]) ).
cnf(c_0_51,negated_conjecture,
( cons(hd(app(esk50_0,cons(hd(esk50_0),nil))),esk51_0) = app(esk50_0,cons(hd(esk50_0),nil))
| esk50_0 = nil
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_29]),c_0_30])]) ).
fof(c_0_52,plain,
! [X231,X232] :
( ~ ssList(X231)
| ~ ssList(X232)
| nil = X231
| hd(app(X231,X232)) = hd(X231) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax85])])]) ).
cnf(c_0_53,negated_conjecture,
( cons(hd(app(esk50_0,cons(hd(esk50_0),nil))),esk51_0) = app(esk50_0,cons(hd(esk50_0),nil))
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_33]),c_0_26])]) ).
cnf(c_0_54,plain,
( nil = X1
| hd(app(X1,X2)) = hd(X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
fof(c_0_55,plain,
! [X154,X155,X156] :
( ( ~ memberP(app(X155,X156),X154)
| memberP(X155,X154)
| memberP(X156,X154)
| ~ ssList(X156)
| ~ ssList(X155)
| ~ ssItem(X154) )
& ( ~ memberP(X155,X154)
| memberP(app(X155,X156),X154)
| ~ ssList(X156)
| ~ ssList(X155)
| ~ ssItem(X154) )
& ( ~ memberP(X156,X154)
| memberP(app(X155,X156),X154)
| ~ ssList(X156)
| ~ ssList(X155)
| ~ ssItem(X154) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).
cnf(c_0_56,negated_conjecture,
memberP(esk48_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_57,negated_conjecture,
( app(esk50_0,cons(hd(esk50_0),nil)) = cons(hd(esk50_0),esk51_0)
| esk50_0 = nil
| ~ ssList(cons(hd(esk50_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_26])]) ).
cnf(c_0_58,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,negated_conjecture,
memberP(esk50_0,esk52_0),
inference(rw,[status(thm)],[c_0_56,c_0_23]) ).
cnf(c_0_60,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_61,negated_conjecture,
( app(esk50_0,cons(hd(esk50_0),nil)) = cons(hd(esk50_0),esk51_0)
| esk50_0 = nil
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_29]),c_0_30])]) ).
fof(c_0_62,plain,
! [X14,X15,X18,X19] :
( ( ssList(esk3_2(X14,X15))
| ~ memberP(X14,X15)
| ~ ssItem(X15)
| ~ ssList(X14) )
& ( ssList(esk4_2(X14,X15))
| ~ memberP(X14,X15)
| ~ ssItem(X15)
| ~ ssList(X14) )
& ( app(esk3_2(X14,X15),cons(X15,esk4_2(X14,X15))) = X14
| ~ memberP(X14,X15)
| ~ ssItem(X15)
| ~ ssList(X14) )
& ( ~ ssList(X18)
| ~ ssList(X19)
| app(X18,cons(X15,X19)) != X14
| memberP(X14,X15)
| ~ ssItem(X15)
| ~ ssList(X14) ) ),
inference(distribute,[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_63,negated_conjecture,
( memberP(app(esk50_0,X1),esk52_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_26]),c_0_60])]) ).
cnf(c_0_64,negated_conjecture,
( app(esk50_0,cons(hd(esk50_0),nil)) = cons(hd(esk50_0),esk51_0)
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_33]),c_0_26])]) ).
cnf(c_0_65,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_62]) ).
cnf(c_0_66,negated_conjecture,
( esk50_0 = nil
| memberP(cons(hd(esk50_0),esk51_0),esk52_0)
| ~ ssList(cons(hd(esk50_0),nil)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,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_65]) ).
fof(c_0_68,plain,
! [X157,X158,X159] :
( ( ~ memberP(cons(X158,X159),X157)
| X157 = X158
| memberP(X159,X157)
| ~ ssList(X159)
| ~ ssItem(X158)
| ~ ssItem(X157) )
& ( X157 != X158
| memberP(cons(X158,X159),X157)
| ~ ssList(X159)
| ~ ssItem(X158)
| ~ ssItem(X157) )
& ( ~ memberP(X159,X157)
| memberP(cons(X158,X159),X157)
| ~ ssList(X159)
| ~ ssItem(X158)
| ~ ssItem(X157) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
cnf(c_0_69,negated_conjecture,
( esk50_0 = nil
| memberP(cons(hd(esk50_0),esk51_0),esk52_0)
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_29]),c_0_30])]) ).
cnf(c_0_70,negated_conjecture,
~ memberP(esk49_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_71,negated_conjecture,
( esk50_0 = nil
| memberP(esk51_0,hd(esk50_0))
| ~ ssList(tl(esk50_0))
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_49]),c_0_46]),c_0_30])]) ).
cnf(c_0_72,plain,
( X3 = X1
| memberP(X2,X3)
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_73,negated_conjecture,
( esk50_0 = nil
| memberP(cons(hd(esk50_0),esk51_0),esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_33]),c_0_26])]) ).
cnf(c_0_74,negated_conjecture,
~ memberP(esk51_0,esk52_0),
inference(rw,[status(thm)],[c_0_70,c_0_41]) ).
cnf(c_0_75,negated_conjecture,
( esk50_0 = nil
| memberP(esk51_0,hd(esk50_0))
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_25]),c_0_26])]) ).
cnf(c_0_76,negated_conjecture,
( hd(esk50_0) = esk52_0
| esk50_0 = nil
| ~ ssItem(hd(esk50_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_46]),c_0_60])]),c_0_74]) ).
fof(c_0_77,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_78,negated_conjecture,
( esk50_0 = nil
| memberP(esk51_0,hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_33]),c_0_26])]) ).
cnf(c_0_79,negated_conjecture,
( hd(esk50_0) = esk52_0
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_33]),c_0_26])]) ).
fof(c_0_80,plain,
! [X160] :
( ~ ssItem(X160)
| ~ memberP(nil,X160) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_77])]) ).
cnf(c_0_81,negated_conjecture,
esk50_0 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_74]) ).
cnf(c_0_82,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_83,negated_conjecture,
memberP(nil,esk52_0),
inference(rw,[status(thm)],[c_0_59,c_0_81]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC396+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:58:19 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/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/tmp/tmp.uVzgdWXDVw/E---3.1_15426.p
% 0.99/0.57 # Version: 3.1pre001
% 0.99/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.99/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.99/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.99/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.99/0.57 # Starting sh5l with 300s (1) cores
% 0.99/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 15504 completed with status 0
% 0.99/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.99/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.99/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.99/0.57 # No SInE strategy applied
% 0.99/0.57 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.99/0.57 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.99/0.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.99/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.99/0.57 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.99/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.99/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.99/0.57 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 15510 completed with status 0
% 0.99/0.57 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.99/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.99/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.99/0.57 # No SInE strategy applied
% 0.99/0.57 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.99/0.57 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.99/0.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.99/0.57 # Preprocessing time : 0.003 s
% 0.99/0.57 # Presaturation interreduction done
% 0.99/0.57
% 0.99/0.57 # Proof found!
% 0.99/0.57 # SZS status Theorem
% 0.99/0.57 # SZS output start CNFRefutation
% See solution above
% 0.99/0.57 # Parsed axioms : 96
% 0.99/0.57 # Removed by relevancy pruning/SinE : 0
% 0.99/0.57 # Initial clauses : 202
% 0.99/0.57 # Removed in clause preprocessing : 2
% 0.99/0.57 # Initial clauses in saturation : 200
% 0.99/0.57 # Processed clauses : 900
% 0.99/0.57 # ...of these trivial : 2
% 0.99/0.57 # ...subsumed : 189
% 0.99/0.57 # ...remaining for further processing : 709
% 0.99/0.57 # Other redundant clauses eliminated : 93
% 0.99/0.57 # Clauses deleted for lack of memory : 0
% 0.99/0.57 # Backward-subsumed : 127
% 0.99/0.57 # Backward-rewritten : 76
% 0.99/0.57 # Generated clauses : 2323
% 0.99/0.57 # ...of the previous two non-redundant : 2015
% 0.99/0.57 # ...aggressively subsumed : 0
% 0.99/0.57 # Contextual simplify-reflections : 92
% 0.99/0.57 # Paramodulations : 2230
% 0.99/0.57 # Factorizations : 0
% 0.99/0.57 # NegExts : 0
% 0.99/0.57 # Equation resolutions : 98
% 0.99/0.57 # Total rewrite steps : 1428
% 0.99/0.57 # Propositional unsat checks : 0
% 0.99/0.57 # Propositional check models : 0
% 0.99/0.57 # Propositional check unsatisfiable : 0
% 0.99/0.57 # Propositional clauses : 0
% 0.99/0.57 # Propositional clauses after purity: 0
% 0.99/0.57 # Propositional unsat core size : 0
% 0.99/0.57 # Propositional preprocessing time : 0.000
% 0.99/0.57 # Propositional encoding time : 0.000
% 0.99/0.57 # Propositional solver time : 0.000
% 0.99/0.57 # Success case prop preproc time : 0.000
% 0.99/0.57 # Success case prop encoding time : 0.000
% 0.99/0.57 # Success case prop solver time : 0.000
% 0.99/0.57 # Current number of processed clauses : 288
% 0.99/0.57 # Positive orientable unit clauses : 27
% 0.99/0.57 # Positive unorientable unit clauses: 0
% 0.99/0.57 # Negative unit clauses : 3
% 0.99/0.57 # Non-unit-clauses : 258
% 0.99/0.57 # Current number of unprocessed clauses: 1428
% 0.99/0.57 # ...number of literals in the above : 9367
% 0.99/0.57 # Current number of archived formulas : 0
% 0.99/0.57 # Current number of archived clauses : 397
% 0.99/0.57 # Clause-clause subsumption calls (NU) : 35707
% 0.99/0.57 # Rec. Clause-clause subsumption calls : 8393
% 0.99/0.57 # Non-unit clause-clause subsumptions : 378
% 0.99/0.57 # Unit Clause-clause subsumption calls : 78
% 0.99/0.57 # Rewrite failures with RHS unbound : 0
% 0.99/0.57 # BW rewrite match attempts : 5
% 0.99/0.57 # BW rewrite match successes : 5
% 0.99/0.57 # Condensation attempts : 0
% 0.99/0.57 # Condensation successes : 0
% 0.99/0.57 # Termbank termtop insertions : 62288
% 0.99/0.57
% 0.99/0.57 # -------------------------------------------------
% 0.99/0.57 # User time : 0.101 s
% 0.99/0.57 # System time : 0.008 s
% 0.99/0.57 # Total time : 0.109 s
% 0.99/0.57 # Maximum resident set size: 2524 pages
% 0.99/0.57
% 0.99/0.57 # -------------------------------------------------
% 0.99/0.57 # User time : 0.472 s
% 0.99/0.57 # System time : 0.016 s
% 0.99/0.57 # Total time : 0.487 s
% 0.99/0.57 # Maximum resident set size: 1800 pages
% 0.99/0.57 % E---3.1 exiting
% 0.99/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------