TSTP Solution File: SWC015+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC015+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 20:26:09 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 13
% Syntax : Number of formulae : 81 ( 12 unt; 0 def)
% Number of atoms : 343 ( 133 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 442 ( 180 ~; 192 |; 36 &)
% ( 3 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn 49 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X4 != X5
& ? [X6] :
( ssList(X6)
& tl(X4) = X6
& app(X3,X6) = X5
& neq(nil,X4) ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& cons(X7,nil) = X1
& app(cons(X7,nil),X8) = X2 ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',co1) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax79) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X4 != X5
& ? [X6] :
( ssList(X6)
& tl(X4) = X6
& app(X3,X6) = X5
& neq(nil,X4) ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& cons(X7,nil) = X1
& app(cons(X7,nil),X8) = X2 ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_14,negated_conjecture,
! [X13,X14,X15,X16] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( neq(esk49_0,nil)
| neq(esk49_0,nil) )
& ( ~ neq(esk51_0,nil)
| neq(esk49_0,nil) )
& ( neq(esk49_0,nil)
| ~ ssList(X13)
| esk51_0 = X13
| ~ ssList(X14)
| tl(esk51_0) != X14
| app(esk50_0,X14) != X13
| ~ neq(nil,esk51_0) )
& ( ~ neq(esk51_0,nil)
| ~ ssList(X13)
| esk51_0 = X13
| ~ ssList(X14)
| tl(esk51_0) != X14
| app(esk50_0,X14) != X13
| ~ neq(nil,esk51_0) )
& ( neq(esk49_0,nil)
| ~ ssItem(X15)
| ~ ssList(X16)
| cons(X15,nil) != esk48_0
| app(cons(X15,nil),X16) != esk49_0 )
& ( ~ neq(esk51_0,nil)
| ~ ssItem(X15)
| ~ ssList(X16)
| cons(X15,nil) != esk48_0
| app(cons(X15,nil),X16) != esk49_0 ) ),
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_13])])])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( neq(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_16,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_15]) ).
cnf(c_0_17,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( esk51_0 = X2
| ~ neq(nil,esk51_0)
| app(esk50_0,X1) != X2
| tl(esk51_0) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( esk51_0 = X1
| app(esk48_0,X2) != X1
| tl(esk51_0) != X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
fof(c_0_22,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_23,negated_conjecture,
( app(esk48_0,X1) = esk51_0
| tl(esk51_0) != X1
| ~ ssList(app(esk48_0,X1))
| ~ ssList(X1)
| ~ neq(nil,esk51_0) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_26,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(X6,X5) != app(X4,X5)
| X6 = 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)],[ax79])])])])]) ).
fof(c_0_27,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_28,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_29,negated_conjecture,
( app(esk48_0,X1) = esk51_0
| tl(esk51_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_33,plain,
( tl(app(X1,X2)) = app(tl(X1),X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( app(esk48_0,tl(esk51_0)) = esk51_0
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
( X1 = nil
| app(X1,X2) != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
( app(tl(esk48_0),tl(esk51_0)) = tl(esk51_0)
| esk48_0 = nil
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_25])]) ).
fof(c_0_37,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_38,negated_conjecture,
( tl(esk48_0) = nil
| esk48_0 = nil
| ~ ssList(tl(esk51_0))
| ~ ssList(tl(esk48_0))
| ~ neq(nil,esk51_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_41,negated_conjecture,
( app(cons(X1,nil),X2) != esk49_0
| cons(X1,nil) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_42,plain,
! [X3,X5] :
( ( ssItem(esk5_1(X3))
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( cons(esk5_1(X3),nil) = X3
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( ~ ssItem(X5)
| cons(X5,nil) != X3
| singletonP(X3)
| ~ ssList(X3) ) ),
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)],[ax4])])])])])])]) ).
fof(c_0_43,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_44,negated_conjecture,
( tl(esk48_0) = nil
| esk48_0 = nil
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_25])]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_46,negated_conjecture,
( app(cons(X1,nil),X2) != esk51_0
| cons(X1,nil) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_17]),c_0_20])]) ).
cnf(c_0_47,plain,
( cons(esk5_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
( ssItem(esk5_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,plain,
( singletonP(X1)
| ~ ssList(X1)
| cons(X2,nil) != X1
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( tl(esk48_0) = nil
| esk51_0 = nil
| esk48_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_45])]) ).
fof(c_0_52,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(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)],[ax83])])])])])]) ).
cnf(c_0_53,negated_conjecture,
( app(X1,X2) != esk51_0
| X1 != esk48_0
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_54,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( cons(hd(esk48_0),nil) = esk48_0
| esk51_0 = nil
| esk48_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_25])]) ).
cnf(c_0_56,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( ~ singletonP(esk48_0)
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_34]),c_0_25])]) ).
cnf(c_0_58,negated_conjecture,
( esk48_0 = nil
| esk51_0 = nil
| singletonP(esk48_0)
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_25])]) ).
cnf(c_0_59,negated_conjecture,
( esk48_0 = nil
| esk51_0 != nil
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_34]),c_0_25])]) ).
cnf(c_0_60,negated_conjecture,
( esk48_0 = nil
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk48_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
fof(c_0_61,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_62,negated_conjecture,
( esk51_0 = nil
| esk48_0 = nil
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_39]),c_0_45])]) ).
cnf(c_0_63,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
fof(c_0_64,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_65,negated_conjecture,
( esk48_0 = nil
| esk51_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_25])]) ).
cnf(c_0_66,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( esk51_0 = nil
| esk48_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_45]),c_0_32])]) ).
cnf(c_0_68,negated_conjecture,
( app(nil,tl(esk51_0)) = esk51_0
| esk51_0 = nil
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_67]) ).
cnf(c_0_69,negated_conjecture,
( tl(esk51_0) = esk51_0
| esk51_0 = nil
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_68]) ).
fof(c_0_70,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| 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)],[ax18])])])])]) ).
cnf(c_0_71,negated_conjecture,
( tl(esk51_0) = esk51_0
| esk51_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_39]),c_0_45])]) ).
cnf(c_0_72,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( cons(hd(esk51_0),esk51_0) = esk51_0
| esk51_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_71]),c_0_45])]) ).
cnf(c_0_74,negated_conjecture,
( esk51_0 = nil
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_45])]) ).
cnf(c_0_75,negated_conjecture,
( esk51_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_63]),c_0_45])]) ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_77,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_66]),c_0_45]),c_0_32])]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_76]) ).
cnf(c_0_79,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_20,c_0_77]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC015+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 21:18:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.25/1.42 # Preprocessing time : 0.026 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 81
% 0.25/1.42 # Proof object clause steps : 55
% 0.25/1.42 # Proof object formula steps : 26
% 0.25/1.42 # Proof object conjectures : 40
% 0.25/1.42 # Proof object clause conjectures : 37
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 22
% 0.25/1.42 # Proof object initial formulas used : 13
% 0.25/1.42 # Proof object generating inferences : 26
% 0.25/1.42 # Proof object simplifying inferences : 51
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 96
% 0.25/1.42 # Removed by relevancy pruning/SinE : 0
% 0.25/1.42 # Initial clauses : 202
% 0.25/1.42 # Removed in clause preprocessing : 2
% 0.25/1.42 # Initial clauses in saturation : 200
% 0.25/1.42 # Processed clauses : 444
% 0.25/1.42 # ...of these trivial : 11
% 0.25/1.42 # ...subsumed : 103
% 0.25/1.42 # ...remaining for further processing : 330
% 0.25/1.42 # Other redundant clauses eliminated : 87
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 59
% 0.25/1.42 # Backward-rewritten : 37
% 0.25/1.42 # Generated clauses : 1896
% 0.25/1.42 # ...of the previous two non-trivial : 1671
% 0.25/1.42 # Contextual simplify-reflections : 110
% 0.25/1.42 # Paramodulations : 1786
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 110
% 0.25/1.42 # Current number of processed clauses : 228
% 0.25/1.42 # Positive orientable unit clauses : 15
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 2
% 0.25/1.42 # Non-unit-clauses : 211
% 0.25/1.42 # Current number of unprocessed clauses: 1044
% 0.25/1.42 # ...number of literals in the above : 7765
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 96
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 14062
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 3324
% 0.25/1.42 # Non-unit clause-clause subsumptions : 267
% 0.25/1.42 # Unit Clause-clause subsumption calls : 77
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 2
% 0.25/1.42 # BW rewrite match successes : 2
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 50007
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.087 s
% 0.25/1.42 # System time : 0.003 s
% 0.25/1.42 # Total time : 0.090 s
% 0.25/1.42 # Maximum resident set size: 5408 pages
% 0.25/23.42 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: CPU time limit exceeded, terminating
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51 eprover: No such file or directory
% 0.25/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.52 eprover: No such file or directory
%------------------------------------------------------------------------------