TSTP Solution File: SWC324+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC324+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:03 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 19
% Syntax : Number of formulae : 103 ( 16 unt; 0 def)
% Number of atoms : 355 ( 150 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 411 ( 159 ~; 176 |; 34 &)
% ( 2 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 145 ( 0 sgn 69 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(X5,X6) = X2
& app(X6,X5) = X1 ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) != X3
& app(cons(X7,nil),X8) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
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(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax75,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ? [X2] :
( ssItem(X2)
& hd(X1) = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax75) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
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(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(c_0_19,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_20,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
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)
| 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,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,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_29,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_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,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_26,c_0_23]),c_0_25])]),c_0_27]) ).
cnf(c_0_31,plain,
( hd(app(X1,X2)) = hd(X1)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
( app(nil,X1) = app(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25])]) ).
fof(c_0_33,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(X5,X6) = X2
& app(X6,X5) = X1 ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) != X3
& app(cons(X7,nil),X8) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_0_34,plain,
( hd(app(X1,app(X2,X3))) = hd(app(X1,X2))
| app(X1,X2) = nil
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_23]),c_0_27]) ).
cnf(c_0_35,plain,
( app(nil,app(X1,nil)) = app(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_32]),c_0_25])]) ).
fof(c_0_36,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
& ( ~ ssList(X13)
| ~ ssList(X14)
| app(X13,X14) != esk49_0
| app(X14,X13) != esk48_0 )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(X16,cons(X15,nil)) = esk50_0
| app(cons(X15,nil),X16) != esk51_0 )
& ( nil = esk50_0
| nil != esk51_0 ) ),
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_33])])])])])])]) ).
cnf(c_0_37,plain,
( hd(app(X1,nil)) = hd(app(nil,X1))
| app(nil,X1) = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25])]) ).
cnf(c_0_38,negated_conjecture,
( app(X1,X2) != esk48_0
| app(X2,X1) != esk49_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_39,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
( hd(app(nil,X1)) = hd(X1)
| app(nil,X1) = nil
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_26]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( app(X1,X2) != esk51_0
| app(X2,X1) != esk48_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( nil = esk50_0
| nil != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_45,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_46,plain,
( hd(app(X1,nil)) = hd(X1)
| app(nil,X1) = nil
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_41,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( app(X1,nil) != esk48_0
| X1 != esk51_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_24]),c_0_25])]) ).
cnf(c_0_49,negated_conjecture,
( nil = esk48_0
| nil != esk51_0 ),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_50,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| hd(cons(X4,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)],[ax23])])])])]) ).
fof(c_0_51,plain,
! [X4] :
( ( ssList(esk44_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk45_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk45_1(X4),esk44_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
inference(distribute,[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)],[ax20])])])])])]) ).
fof(c_0_52,plain,
! [X3] :
( ( ssItem(esk46_1(X3))
| nil = X3
| ~ ssList(X3) )
& ( hd(X3) = esk46_1(X3)
| nil = X3
| ~ ssList(X3) ) ),
inference(distribute,[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)],[ax75])])])])])]) ).
cnf(c_0_53,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_54,negated_conjecture,
( hd(app(esk51_0,nil)) = hd(esk51_0)
| app(nil,esk51_0) = nil ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,negated_conjecture,
nil != esk51_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_24]),c_0_25])]),c_0_49]) ).
fof(c_0_56,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_57,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,plain,
( nil = X1
| cons(esk45_1(X1),esk44_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,plain,
( nil = X1
| ssItem(esk45_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_60,plain,
( nil = X1
| ssList(esk44_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,plain,
( nil = X1
| hd(X1) = esk46_1(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_62,negated_conjecture,
hd(app(esk51_0,nil)) = hd(esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_47]),c_0_25])]),c_0_55]) ).
cnf(c_0_63,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( hd(app(esk51_0,nil)) = hd(esk51_0)
| app(esk51_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_54]),c_0_47])]) ).
fof(c_0_65,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_66,plain,
( esk45_1(X1) = hd(X1)
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( esk46_1(app(esk51_0,nil)) = hd(esk51_0)
| app(esk51_0,nil) = nil
| ~ ssList(app(esk51_0,nil)) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
( app(esk51_0,nil) = nil
| ssItem(hd(esk51_0))
| ~ ssList(app(esk51_0,nil)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
fof(c_0_69,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])])])])]) ).
fof(c_0_70,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_71,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_72,plain,
( cons(hd(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_66]) ).
cnf(c_0_73,negated_conjecture,
hd(esk51_0) = esk46_1(esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_26]),c_0_47])]),c_0_55]) ).
cnf(c_0_74,negated_conjecture,
ssItem(hd(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_26]),c_0_47])]),c_0_55]) ).
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,
! [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_77,plain,
( tl(app(X1,X2)) = app(tl(X1),X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_78,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_79,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_26]),c_0_25])]) ).
cnf(c_0_80,negated_conjecture,
cons(esk46_1(esk51_0),esk44_1(esk51_0)) = esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_47])]),c_0_55]) ).
cnf(c_0_81,negated_conjecture,
ssItem(esk46_1(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_61]),c_0_47])]),c_0_55]) ).
cnf(c_0_82,negated_conjecture,
( app(X2,cons(X1,nil)) = esk50_0
| app(cons(X1,nil),X2) != esk51_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_83,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])])])])])])]) ).
cnf(c_0_84,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_85,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_86,plain,
( nil = X1
| ssList(tl(app(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_77]),c_0_78]) ).
cnf(c_0_87,negated_conjecture,
( app(esk51_0,nil) = esk51_0
| ~ ssList(esk44_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81])]) ).
cnf(c_0_88,negated_conjecture,
( app(X1,cons(X2,nil)) = esk48_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[c_0_82,c_0_44]) ).
cnf(c_0_89,plain,
( cons(esk5_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_90,plain,
( ssItem(esk5_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_91,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_84,c_0_85]),c_0_63]),c_0_78]) ).
cnf(c_0_92,negated_conjecture,
( ssList(tl(esk51_0))
| ~ ssList(esk44_1(esk51_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_25]),c_0_47])]),c_0_55]) ).
cnf(c_0_93,negated_conjecture,
( app(X1,X2) != esk51_0
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_42]) ).
cnf(c_0_94,negated_conjecture,
app(cons(esk46_1(esk51_0),nil),tl(esk51_0)) = esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_73]),c_0_47])]),c_0_55]) ).
cnf(c_0_95,negated_conjecture,
ssList(tl(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_60]),c_0_47])]),c_0_55]) ).
cnf(c_0_96,plain,
( singletonP(X1)
| ~ ssList(X1)
| cons(X2,nil) != X1
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_97,negated_conjecture,
( ~ singletonP(cons(esk46_1(esk51_0),nil))
| ~ ssList(cons(esk46_1(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95])]) ).
cnf(c_0_98,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_96]) ).
fof(c_0_99,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_100,negated_conjecture,
~ ssList(cons(esk46_1(esk51_0),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_81])]) ).
cnf(c_0_101,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_102,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_25]),c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC324+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.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 : Mon Jun 13 00:20:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.025 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 103
% 0.23/1.42 # Proof object clause steps : 65
% 0.23/1.42 # Proof object formula steps : 38
% 0.23/1.42 # Proof object conjectures : 32
% 0.23/1.42 # Proof object clause conjectures : 29
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 28
% 0.23/1.42 # Proof object initial formulas used : 19
% 0.23/1.42 # Proof object generating inferences : 33
% 0.23/1.42 # Proof object simplifying inferences : 67
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 96
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 199
% 0.23/1.42 # Removed in clause preprocessing : 2
% 0.23/1.42 # Initial clauses in saturation : 197
% 0.23/1.42 # Processed clauses : 2153
% 0.23/1.42 # ...of these trivial : 32
% 0.23/1.42 # ...subsumed : 1294
% 0.23/1.42 # ...remaining for further processing : 827
% 0.23/1.42 # Other redundant clauses eliminated : 1177
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 21
% 0.23/1.42 # Backward-rewritten : 31
% 0.23/1.42 # Generated clauses : 23475
% 0.23/1.42 # ...of the previous two non-trivial : 20915
% 0.23/1.42 # Contextual simplify-reflections : 1072
% 0.23/1.42 # Paramodulations : 22213
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 1243
% 0.23/1.42 # Current number of processed clauses : 760
% 0.23/1.42 # Positive orientable unit clauses : 33
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 18
% 0.23/1.42 # Non-unit-clauses : 709
% 0.23/1.42 # Current number of unprocessed clauses: 18412
% 0.23/1.42 # ...number of literals in the above : 140202
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 52
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 149741
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 15551
% 0.23/1.42 # Non-unit clause-clause subsumptions : 1776
% 0.23/1.42 # Unit Clause-clause subsumption calls : 7915
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 10
% 0.23/1.42 # BW rewrite match successes : 10
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 574608
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.419 s
% 0.23/1.42 # System time : 0.015 s
% 0.23/1.42 # Total time : 0.434 s
% 0.23/1.42 # Maximum resident set size: 24024 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------