TSTP Solution File: SWC421+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC421+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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 : 600s
% DateTime : Tue Jul 19 20:28:38 EDT 2022
% Result : Theorem 0.91s 95.27s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 16
% Syntax : Number of formulae : 93 ( 16 unt; 0 def)
% Number of atoms : 372 ( 135 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 485 ( 206 ~; 197 |; 47 &)
% ( 1 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 143 ( 1 sgn 59 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
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(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(app(X7,cons(X5,nil)),X6) = X1 ) ) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X8] :
( ssList(X8)
& X4 != X8
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& tl(X3) = X9
& app(X9,X10) = X8
& ? [X11] :
( ssItem(X11)
& cons(X11,nil) = X10
& hd(X3) = X11
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).
fof(ax2,axiom,
? [X1] :
( ssItem(X1)
& ? [X2] :
( ssItem(X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax2) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != cons(X4,X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])])]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])])]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| tl(cons(X4,X3)) = X3 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])])]) ).
cnf(c_0_19,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| nil = X3
| tl(app(X3,X4)) = app(tl(X3),X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax86])])])])]) ).
cnf(c_0_23,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( app(cons(X1,nil),X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_27,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])])]) ).
cnf(c_0_28,plain,
( tl(app(X1,X2)) = app(tl(X1),X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( tl(app(cons(X1,nil),X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_30,plain,
( cons(X1,nil) != nil
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_32,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(app(X7,cons(X5,nil)),X6) = X1 ) ) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X8] :
( ssList(X8)
& X4 != X8
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& tl(X3) = X9
& app(X9,X10) = X8
& ? [X11] :
( ssItem(X11)
& cons(X11,nil) = X10
& hd(X3) = X11
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_0_33,plain,
( app(tl(X1),nil) = tl(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_26])]) ).
cnf(c_0_34,plain,
( tl(cons(X1,nil)) = nil
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_26])]) ).
cnf(c_0_35,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26])]) ).
fof(c_0_36,negated_conjecture,
! [X16,X17,X18,X19,X20,X21,X22] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ( ~ ssItem(X16)
| ~ ssList(X17)
| ~ ssList(X18)
| app(app(X17,cons(X16,nil)),X18) != esk2_0
| app(app(X18,cons(X16,nil)),X17) != esk1_0 )
& ( nil = esk3_0
| nil != esk4_0 )
& ( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) )
& ( ~ ssList(X19)
| esk4_0 = X19
| ~ ssList(X20)
| ~ ssList(X21)
| tl(esk3_0) != X20
| app(X20,X21) != X19
| ~ ssItem(X22)
| cons(X22,nil) != X21
| hd(esk3_0) != X22
| ~ neq(nil,esk3_0)
| ~ neq(nil,esk3_0)
| ~ neq(esk4_0,nil) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_32])])])])])])])]) ).
cnf(c_0_37,plain,
( app(nil,nil) = nil
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
fof(c_0_38,plain,
( ssItem(esk8_0)
& ssItem(esk9_0)
& esk8_0 != esk9_0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[ax2])])])]) ).
cnf(c_0_39,negated_conjecture,
( esk4_0 = X4
| ~ neq(esk4_0,nil)
| ~ neq(nil,esk3_0)
| ~ neq(nil,esk3_0)
| hd(esk3_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| app(X3,X2) != X4
| tl(esk3_0) != X3
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_42,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])])]) ).
cnf(c_0_43,plain,
( app(nil,nil) = nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_26])]) ).
cnf(c_0_44,plain,
ssItem(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( esk4_0 = X4
| hd(esk3_0) != X1
| tl(esk3_0) != X3
| app(X3,X2) != X4
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ neq(nil,esk3_0)
| ~ neq(esk4_0,nil) ),
inference(cn,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
app(nil,nil) = nil,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( esk4_0 = X1
| cons(X2,nil) != X3
| hd(esk3_0) != X2
| tl(esk3_0) != X4
| app(X4,X3) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ neq(nil,esk3_0)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
fof(c_0_50,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])])]) ).
cnf(c_0_51,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_52,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_26])]) ).
cnf(c_0_53,negated_conjecture,
( esk4_0 = X1
| app(X2,cons(X3,nil)) != X1
| hd(esk3_0) != X3
| tl(esk3_0) != X2
| ~ ssList(cons(X3,nil))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(nil,esk3_0)
| ~ ssItem(X3) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_54,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_55,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_26])]) ).
cnf(c_0_56,negated_conjecture,
( esk4_0 = app(X1,cons(X2,nil))
| hd(esk3_0) != X2
| tl(esk3_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk3_0)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_53]),c_0_54]),c_0_55]) ).
cnf(c_0_57,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk1_0
| app(app(X3,cons(X2,nil)),X1) != esk2_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_58,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_59,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_60,negated_conjecture,
( esk4_0 = app(X1,cons(hd(esk3_0),nil))
| tl(esk3_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk4_0
| app(app(X3,cons(X2,nil)),X1) != esk3_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_41]),c_0_58]) ).
fof(c_0_62,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_63,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_59,c_0_41]) ).
cnf(c_0_64,negated_conjecture,
( esk4_0 = app(tl(esk3_0),cons(hd(esk3_0),nil))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(er,[status(thm)],[c_0_60]) ).
fof(c_0_65,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])])])]) ).
cnf(c_0_66,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_67,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk3_0
| app(X2,cons(X1,nil)) != esk4_0
| ~ ssList(app(X2,cons(X1,nil)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_25]),c_0_26])]) ).
cnf(c_0_68,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_69,negated_conjecture,
( ssList(app(tl(esk3_0),cons(hd(esk3_0),nil)))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_71,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_66,c_0_58]) ).
cnf(c_0_72,negated_conjecture,
( app(cons(X1,nil),X2) != esk3_0
| app(X2,cons(X1,nil)) != esk4_0
| ~ ssList(app(X2,cons(X1,nil)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_55]) ).
cnf(c_0_73,negated_conjecture,
( esk3_0 = nil
| ssList(app(tl(esk3_0),cons(hd(esk3_0),nil)))
| ~ ssList(tl(esk3_0))
| ~ ssItem(hd(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_26])]) ).
cnf(c_0_74,negated_conjecture,
( esk3_0 = nil
| app(cons(hd(esk3_0),nil),tl(esk3_0)) != esk3_0
| esk4_0 != app(tl(esk3_0),cons(hd(esk3_0),nil))
| ~ ssList(tl(esk3_0))
| ~ ssItem(hd(esk3_0)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
fof(c_0_75,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_76,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
fof(c_0_77,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_78,negated_conjecture,
( esk3_0 = nil
| app(cons(hd(esk3_0),nil),tl(esk3_0)) != esk3_0
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(spm,[status(thm)],[c_0_74,c_0_64]) ).
cnf(c_0_79,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_80,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_81,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_82,negated_conjecture,
( esk3_0 = nil
| app(cons(hd(esk3_0),nil),tl(esk3_0)) != esk3_0
| ~ ssList(tl(esk3_0))
| ~ ssItem(hd(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_70]),c_0_71]),c_0_26])]) ).
cnf(c_0_83,plain,
( app(cons(hd(X1),nil),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_20]),c_0_80]),c_0_81]) ).
cnf(c_0_84,negated_conjecture,
( esk3_0 = nil
| ~ ssList(tl(esk3_0))
| ~ ssItem(hd(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_71])]) ).
cnf(c_0_85,negated_conjecture,
( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_86,negated_conjecture,
( esk3_0 = nil
| ~ ssItem(hd(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_81]),c_0_71])]) ).
cnf(c_0_87,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_88,negated_conjecture,
neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_46])]) ).
cnf(c_0_89,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_80]),c_0_71])]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_87]) ).
cnf(c_0_91,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC421+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.11 % Command : run_ET %s %d
% 0.10/0.31 % Computer : n008.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 : 600
% 0.10/0.31 % DateTime : Sat Jun 11 19:48:52 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.36/23.39 eprover: CPU time limit exceeded, terminating
% 0.36/23.75 eprover: CPU time limit exceeded, terminating
% 0.38/24.94 eprover: CPU time limit exceeded, terminating
% 0.38/25.14 eprover: CPU time limit exceeded, terminating
% 0.54/46.43 eprover: CPU time limit exceeded, terminating
% 0.54/46.76 eprover: CPU time limit exceeded, terminating
% 0.56/47.96 eprover: CPU time limit exceeded, terminating
% 0.56/48.16 eprover: CPU time limit exceeded, terminating
% 0.72/69.44 eprover: CPU time limit exceeded, terminating
% 0.72/69.77 eprover: CPU time limit exceeded, terminating
% 0.72/70.98 eprover: CPU time limit exceeded, terminating
% 0.73/71.17 eprover: CPU time limit exceeded, terminating
% 0.89/92.48 eprover: CPU time limit exceeded, terminating
% 0.89/92.78 eprover: CPU time limit exceeded, terminating
% 0.90/93.99 eprover: CPU time limit exceeded, terminating
% 0.90/94.18 eprover: CPU time limit exceeded, terminating
% 0.91/95.27 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.91/95.27
% 0.91/95.27 # Failure: Resource limit exceeded (time)
% 0.91/95.27 # OLD status Res
% 0.91/95.27 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.91/95.27 # Preprocessing time : 0.019 s
% 0.91/95.27 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.91/95.27
% 0.91/95.27 # Failure: Resource limit exceeded (time)
% 0.91/95.27 # OLD status Res
% 0.91/95.27 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.91/95.27 # Preprocessing time : 0.012 s
% 0.91/95.27 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.91/95.27
% 0.91/95.27 # Failure: Resource limit exceeded (time)
% 0.91/95.27 # OLD status Res
% 0.91/95.27 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.91/95.27 # Preprocessing time : 0.013 s
% 0.91/95.27 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.91/95.27
% 0.91/95.27 # Failure: Resource limit exceeded (time)
% 0.91/95.27 # OLD status Res
% 0.91/95.27 # Preprocessing time : 0.016 s
% 0.91/95.27 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.91/95.27 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.91/95.27 # Preprocessing time : 0.023 s
% 0.91/95.27
% 0.91/95.27 # Proof found!
% 0.91/95.27 # SZS status Theorem
% 0.91/95.27 # SZS output start CNFRefutation
% See solution above
% 0.91/95.27 # Proof object total steps : 93
% 0.91/95.27 # Proof object clause steps : 61
% 0.91/95.27 # Proof object formula steps : 32
% 0.91/95.27 # Proof object conjectures : 34
% 0.91/95.27 # Proof object clause conjectures : 31
% 0.91/95.27 # Proof object formula conjectures : 3
% 0.91/95.27 # Proof object initial clauses used : 24
% 0.91/95.27 # Proof object initial formulas used : 16
% 0.91/95.27 # Proof object generating inferences : 28
% 0.91/95.27 # Proof object simplifying inferences : 48
% 0.91/95.27 # Training examples: 0 positive, 0 negative
% 0.91/95.27 # Parsed axioms : 96
% 0.91/95.27 # Removed by relevancy pruning/SinE : 67
% 0.91/95.27 # Initial clauses : 50
% 0.91/95.27 # Removed in clause preprocessing : 0
% 0.91/95.27 # Initial clauses in saturation : 50
% 0.91/95.27 # Processed clauses : 673
% 0.91/95.27 # ...of these trivial : 40
% 0.91/95.27 # ...subsumed : 359
% 0.91/95.27 # ...remaining for further processing : 274
% 0.91/95.27 # Other redundant clauses eliminated : 35
% 0.91/95.27 # Clauses deleted for lack of memory : 0
% 0.91/95.27 # Backward-subsumed : 48
% 0.91/95.27 # Backward-rewritten : 44
% 0.91/95.27 # Generated clauses : 5198
% 0.91/95.27 # ...of the previous two non-trivial : 4561
% 0.91/95.27 # Contextual simplify-reflections : 515
% 0.91/95.27 # Paramodulations : 5130
% 0.91/95.27 # Factorizations : 0
% 0.91/95.27 # Equation resolutions : 68
% 0.91/95.27 # Current number of processed clauses : 180
% 0.91/95.27 # Positive orientable unit clauses : 10
% 0.91/95.27 # Positive unorientable unit clauses: 0
% 0.91/95.27 # Negative unit clauses : 1
% 0.91/95.27 # Non-unit-clauses : 169
% 0.91/95.27 # Current number of unprocessed clauses: 3477
% 0.91/95.27 # ...number of literals in the above : 22667
% 0.91/95.27 # Current number of archived formulas : 0
% 0.91/95.27 # Current number of archived clauses : 92
% 0.91/95.27 # Clause-clause subsumption calls (NU) : 23284
% 0.91/95.27 # Rec. Clause-clause subsumption calls : 4368
% 0.91/95.27 # Non-unit clause-clause subsumptions : 922
% 0.91/95.27 # Unit Clause-clause subsumption calls : 118
% 0.91/95.27 # Rewrite failures with RHS unbound : 0
% 0.91/95.27 # BW rewrite match attempts : 3
% 0.91/95.27 # BW rewrite match successes : 3
% 0.91/95.27 # Condensation attempts : 0
% 0.91/95.27 # Condensation successes : 0
% 0.91/95.27 # Termbank termtop insertions : 95313
% 0.91/95.27
% 0.91/95.27 # -------------------------------------------------
% 0.91/95.27 # User time : 0.241 s
% 0.91/95.27 # System time : 0.008 s
% 0.91/95.27 # Total time : 0.249 s
% 0.91/95.27 # Maximum resident set size: 6884 pages
% 0.91/115.51 eprover: CPU time limit exceeded, terminating
% 0.91/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/115.52 eprover: No such file or directory
% 0.91/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/115.52 eprover: No such file or directory
% 0.91/115.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/115.53 eprover: No such file or directory
% 0.91/115.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/115.53 eprover: No such file or directory
% 0.91/115.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/115.54 eprover: No such file or directory
% 0.91/115.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/115.54 eprover: No such file or directory
% 0.91/115.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/115.54 eprover: No such file or directory
% 0.91/115.80 eprover: CPU time limit exceeded, terminating
% 0.91/115.81 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.91/115.81 eprover: No such file or directory
% 0.91/115.82 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.91/115.82 eprover: No such file or directory
% 0.91/115.83 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.91/115.83 eprover: No such file or directory
% 0.91/115.83 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.91/115.83 eprover: No such file or directory
% 0.91/115.84 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.91/115.84 eprover: No such file or directory
% 0.91/115.84 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.91/115.84 eprover: No such file or directory
% 0.91/115.85 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.91/115.85 eprover: No such file or directory
% 0.91/117.00 eprover: CPU time limit exceeded, terminating
% 0.91/117.02 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/117.02 eprover: No such file or directory
% 0.91/117.02 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/117.02 eprover: No such file or directory
% 0.91/117.03 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/117.03 eprover: No such file or directory
% 0.91/117.04 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/117.04 eprover: No such file or directory
% 0.91/117.04 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/117.04 eprover: No such file or directory
% 0.91/117.05 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/117.05 eprover: No such file or directory
% 0.91/117.05 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.91/117.05 eprover: No such file or directory
%------------------------------------------------------------------------------