TSTP Solution File: SWC231+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC231+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 20:27:29 EDT 2022
% Result : Theorem 0.23s 2.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of formulae : 105 ( 12 unt; 0 def)
% Number of atoms : 404 ( 130 equ)
% Maximal formula atoms : 46 ( 3 avg)
% Number of connectives : 515 ( 216 ~; 219 |; 37 &)
% ( 1 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 158 ( 0 sgn 72 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| lt(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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(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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax92,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( leq(X1,X2)
=> ( X1 = X2
| lt(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax92) ).
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(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(c_0_17,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| lt(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_18,negated_conjecture,
! [X17,X18,X19,X24] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& nil != esk48_0
& ( ssItem(esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X18,esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X19,esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( leq(X17,esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ lt(X17,esk52_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk48_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ssItem(esk53_0)
| nil = esk50_0 )
& ( ssList(esk54_0)
| nil = esk50_0 )
& ( ssList(esk55_0)
| nil = esk50_0 )
& ( app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0
| nil = esk50_0 )
& ( ~ ssItem(X24)
| leq(X24,esk53_0)
| ~ memberP(esk54_0,X24)
| ~ memberP(esk55_0,X24)
| ~ leq(esk53_0,X24)
| nil = esk50_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_17])])])])])])])]) ).
fof(c_0_19,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_20,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
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)],[ax82])])])])]) ).
fof(c_0_21,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])])])])]) ).
fof(c_0_22,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_23,negated_conjecture,
( nil = esk50_0
| app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( nil = esk50_0
| ssList(esk55_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_30,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_32,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_33,negated_conjecture,
app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_25]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk55_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24]),c_0_25]) ).
cnf(c_0_35,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_36,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_29])]) ).
cnf(c_0_37,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( app(app(esk54_0,cons(esk53_0,nil)),app(esk55_0,X1)) = app(esk48_0,X1)
| ~ ssList(app(esk54_0,cons(esk53_0,nil)))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_33]),c_0_34])]) ).
cnf(c_0_39,plain,
( app(X1,nil) = app(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29])]) ).
fof(c_0_40,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])])])])]) ).
fof(c_0_41,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_42,plain,
( app(nil,nil) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( app(app(esk54_0,cons(esk53_0,nil)),app(nil,esk55_0)) = app(esk48_0,nil)
| ~ ssList(app(esk54_0,cons(esk53_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_29]),c_0_34])]) ).
fof(c_0_44,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ leq(X3,X4)
| X3 = X4
| lt(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)],[ax92])])])])]) ).
cnf(c_0_46,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,plain,
( app(nil,nil) = nil
| nil != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_29]) ).
cnf(c_0_49,negated_conjecture,
( app(nil,app(esk48_0,nil)) = app(esk48_0,nil)
| ~ ssList(app(esk54_0,cons(esk53_0,nil)))
| ~ ssList(app(nil,esk55_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_51,negated_conjecture,
( nil = esk50_0
| ssList(esk54_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_52,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_53,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_54,negated_conjecture,
( memberP(X2,esk52_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ lt(X1,esk52_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_56,plain,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_57,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_58,negated_conjecture,
( leq(X1,esk52_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_59,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])])])])]) ).
cnf(c_0_60,plain,
( ssList(cons(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_46]),c_0_47]) ).
cnf(c_0_61,plain,
app(nil,nil) = nil,
inference(spm,[status(thm)],[c_0_48,c_0_29]) ).
cnf(c_0_62,negated_conjecture,
( app(esk48_0,nil) = app(nil,esk48_0)
| ~ ssList(app(esk54_0,cons(esk53_0,nil)))
| ~ ssList(app(nil,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_49]),c_0_50]),c_0_29])]) ).
cnf(c_0_63,negated_conjecture,
ssList(esk54_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_24]),c_0_25]) ).
cnf(c_0_64,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_30]) ).
cnf(c_0_65,plain,
( app(X1,X2) = nil
| app(X1,app(X2,X3)) != nil
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_28]),c_0_30]) ).
cnf(c_0_66,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(esk52_3(X1,nil,X2))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_29])]) ).
cnf(c_0_67,negated_conjecture,
( esk52_3(X1,X2,X3) = X1
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]) ).
cnf(c_0_68,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_69,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_29])]) ).
fof(c_0_70,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_71,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| nil = X3
| hd(app(X3,X4)) = hd(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)],[ax85])])])])]) ).
cnf(c_0_72,negated_conjecture,
( app(esk48_0,nil) = app(nil,esk48_0)
| ~ ssList(app(nil,esk55_0))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_30]),c_0_63])]) ).
cnf(c_0_73,negated_conjecture,
( ssList(app(esk48_0,nil))
| ~ ssList(app(esk54_0,cons(esk53_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_43]),c_0_34]),c_0_29])]) ).
cnf(c_0_74,negated_conjecture,
( app(esk48_0,X1) != nil
| ~ ssList(app(esk54_0,cons(esk53_0,nil)))
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_38]),c_0_33]),c_0_34])]),c_0_25]) ).
fof(c_0_75,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
fof(c_0_76,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_77,negated_conjecture,
( app(esk48_0,nil) = esk48_0
| ~ ssList(app(esk54_0,cons(esk53_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_33]),c_0_34]),c_0_29])]) ).
cnf(c_0_78,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_29])]) ).
cnf(c_0_79,plain,
( app(nil,cons(X1,X2)) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_68]),c_0_69]) ).
cnf(c_0_80,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_81,plain,
( hd(app(X1,X2)) = hd(X1)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
fof(c_0_82,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_83,negated_conjecture,
( app(esk48_0,nil) = app(nil,esk48_0)
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_31]),c_0_34])]) ).
cnf(c_0_84,negated_conjecture,
( ssList(app(esk48_0,nil))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_30]),c_0_63])]) ).
cnf(c_0_85,negated_conjecture,
( app(esk48_0,X1) != nil
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_30]),c_0_63])]) ).
cnf(c_0_86,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_87,plain,
( tl(app(X1,X2)) = app(tl(X1),X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_88,negated_conjecture,
( app(esk48_0,nil) = esk48_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_30]),c_0_63])]) ).
cnf(c_0_89,negated_conjecture,
( app(cons(X1,nil),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_29])]) ).
cnf(c_0_90,plain,
( cons(hd(X1),tl(app(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_80,c_0_81]),c_0_30]),c_0_52]) ).
cnf(c_0_91,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_92,negated_conjecture,
( hd(app(nil,esk48_0)) = hd(esk48_0)
| ~ ssList(cons(esk53_0,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_83]),c_0_29]),c_0_50])]),c_0_25]) ).
cnf(c_0_93,negated_conjecture,
( ssList(app(nil,esk48_0))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_39]),c_0_50])]) ).
cnf(c_0_94,negated_conjecture,
( app(nil,esk48_0) != nil
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_39]),c_0_29]),c_0_50])]) ).
cnf(c_0_95,plain,
( nil = X1
| ssList(app(tl(X1),X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_30]),c_0_52]) ).
cnf(c_0_96,negated_conjecture,
( app(tl(esk48_0),nil) = tl(esk48_0)
| ~ ssList(cons(esk53_0,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_29]),c_0_50])]),c_0_25]) ).
cnf(c_0_97,negated_conjecture,
( cons(X1,X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_68]) ).
cnf(c_0_98,negated_conjecture,
( cons(hd(esk48_0),tl(esk48_0)) = esk48_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_88]),c_0_29]),c_0_50])]),c_0_25]) ).
cnf(c_0_99,negated_conjecture,
( ssItem(hd(esk48_0))
| ~ ssList(cons(esk53_0,nil)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_94]) ).
cnf(c_0_100,negated_conjecture,
( ssList(tl(esk48_0))
| ~ ssList(cons(esk53_0,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_29]),c_0_50])]),c_0_25]) ).
cnf(c_0_101,negated_conjecture,
( nil = esk50_0
| ssItem(esk53_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_102,negated_conjecture,
~ ssList(cons(esk53_0,nil)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]),c_0_100]) ).
cnf(c_0_103,negated_conjecture,
ssItem(esk53_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_24]),c_0_25]) ).
cnf(c_0_104,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_47]),c_0_29]),c_0_103])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC231+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 11 23:31:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/2.42 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.23/2.42 # Preprocessing time : 0.026 s
% 0.23/2.42
% 0.23/2.42 # Proof found!
% 0.23/2.42 # SZS status Theorem
% 0.23/2.42 # SZS output start CNFRefutation
% See solution above
% 0.23/2.42 # Proof object total steps : 105
% 0.23/2.42 # Proof object clause steps : 71
% 0.23/2.42 # Proof object formula steps : 34
% 0.23/2.42 # Proof object conjectures : 44
% 0.23/2.42 # Proof object clause conjectures : 41
% 0.23/2.42 # Proof object formula conjectures : 3
% 0.23/2.42 # Proof object initial clauses used : 28
% 0.23/2.42 # Proof object initial formulas used : 17
% 0.23/2.42 # Proof object generating inferences : 39
% 0.23/2.42 # Proof object simplifying inferences : 91
% 0.23/2.42 # Training examples: 0 positive, 0 negative
% 0.23/2.42 # Parsed axioms : 96
% 0.23/2.42 # Removed by relevancy pruning/SinE : 0
% 0.23/2.42 # Initial clauses : 207
% 0.23/2.42 # Removed in clause preprocessing : 2
% 0.23/2.42 # Initial clauses in saturation : 205
% 0.23/2.42 # Processed clauses : 5156
% 0.23/2.42 # ...of these trivial : 61
% 0.23/2.42 # ...subsumed : 3371
% 0.23/2.42 # ...remaining for further processing : 1724
% 0.23/2.42 # Other redundant clauses eliminated : 1301
% 0.23/2.42 # Clauses deleted for lack of memory : 0
% 0.23/2.42 # Backward-subsumed : 316
% 0.23/2.42 # Backward-rewritten : 2
% 0.23/2.42 # Generated clauses : 85779
% 0.23/2.42 # ...of the previous two non-trivial : 82023
% 0.23/2.42 # Contextual simplify-reflections : 4173
% 0.23/2.42 # Paramodulations : 84329
% 0.23/2.42 # Factorizations : 0
% 0.23/2.42 # Equation resolutions : 1450
% 0.23/2.42 # Current number of processed clauses : 1400
% 0.23/2.42 # Positive orientable unit clauses : 21
% 0.23/2.42 # Positive unorientable unit clauses: 0
% 0.23/2.42 # Negative unit clauses : 7
% 0.23/2.42 # Non-unit-clauses : 1372
% 0.23/2.42 # Current number of unprocessed clauses: 71519
% 0.23/2.42 # ...number of literals in the above : 635045
% 0.23/2.42 # Current number of archived formulas : 0
% 0.23/2.42 # Current number of archived clauses : 318
% 0.23/2.42 # Clause-clause subsumption calls (NU) : 714694
% 0.23/2.42 # Rec. Clause-clause subsumption calls : 188684
% 0.23/2.42 # Non-unit clause-clause subsumptions : 7019
% 0.23/2.42 # Unit Clause-clause subsumption calls : 884
% 0.23/2.42 # Rewrite failures with RHS unbound : 0
% 0.23/2.42 # BW rewrite match attempts : 1
% 0.23/2.42 # BW rewrite match successes : 1
% 0.23/2.42 # Condensation attempts : 0
% 0.23/2.42 # Condensation successes : 0
% 0.23/2.42 # Termbank termtop insertions : 2343147
% 0.23/2.42
% 0.23/2.42 # -------------------------------------------------
% 0.23/2.42 # User time : 1.593 s
% 0.23/2.42 # System time : 0.036 s
% 0.23/2.42 # Total time : 1.629 s
% 0.23/2.42 # Maximum resident set size: 80084 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: CPU time limit exceeded, terminating
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------