TSTP Solution File: SWC395+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC395+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:29 EDT 2022
% Result : Theorem 0.78s 92.96s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 21
% Syntax : Number of formulae : 109 ( 16 unt; 0 def)
% Number of atoms : 502 ( 141 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 685 ( 292 ~; 295 |; 51 &)
% ( 7 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 172 ( 0 sgn 79 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax79) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X1,X5)
| memberP(X2,X5) )
| ( nil != X3
& nil = X4 )
| ( ? [X6] :
( ssList(X6)
& X3 != X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X4) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X4) = X9
& neq(nil,X4) )
& neq(nil,X4) ) ) )
& neq(X4,nil) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
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(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(c_0_19,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_20,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_21,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,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_24,plain,
( X1 = cons(X2,nil)
| app(X1,X3) != cons(X2,X3)
| ~ ssList(cons(X2,nil))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,plain,
( X1 = cons(X2,nil)
| app(X1,X3) != cons(X2,X3)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
fof(c_0_28,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_29,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X1,X5)
| memberP(X2,X5) )
| ( nil != X3
& nil = X4 )
| ( ? [X6] :
( ssList(X6)
& X3 != X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X4) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X4) = X9
& neq(nil,X4) )
& neq(nil,X4) ) ) )
& neq(X4,nil) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_0_30,plain,
( X1 = cons(X2,nil)
| app(X1,X3) != app(cons(X2,nil),X3)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_31,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_32,negated_conjecture,
! [X15,X16,X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssItem(esk5_0)
& memberP(esk1_0,esk5_0)
& ~ memberP(esk2_0,esk5_0)
& ( nil = esk3_0
| nil != esk4_0 )
& ( ~ ssList(X15)
| esk3_0 = X15
| ~ ssList(X16)
| ~ ssList(X17)
| tl(esk4_0) != X16
| app(X16,X17) != X15
| ~ ssItem(X18)
| cons(X18,nil) != X17
| hd(esk4_0) != X18
| ~ neq(nil,esk4_0)
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil) ) ),
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_29])])])])])])]) ).
cnf(c_0_33,plain,
( X1 = cons(X2,nil)
| X1 != app(cons(X2,nil),nil)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26])]) ).
cnf(c_0_34,negated_conjecture,
( esk3_0 = X4
| ~ neq(esk4_0,nil)
| ~ neq(nil,esk4_0)
| ~ neq(nil,esk4_0)
| hd(esk4_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| app(X3,X2) != X4
| tl(esk4_0) != X3
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_35,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssList(app(cons(X1,nil),nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_37,negated_conjecture,
( esk3_0 = X4
| hd(esk4_0) != X1
| tl(esk4_0) != X3
| app(X3,X2) != X4
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil) ),
inference(cn,[status(thm)],[c_0_34]) ).
fof(c_0_38,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_39,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_35,c_0_36]),c_0_26])]) ).
cnf(c_0_40,negated_conjecture,
( esk3_0 = X1
| app(X2,cons(X3,nil)) != X1
| hd(esk4_0) != X3
| tl(esk4_0) != X2
| ~ ssList(cons(X3,nil))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(X3) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_39]),c_0_26])]) ).
cnf(c_0_43,negated_conjecture,
( esk3_0 = app(X1,cons(X2,nil))
| hd(esk4_0) != X2
| tl(esk4_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_44,negated_conjecture,
memberP(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_46,negated_conjecture,
( esk3_0 = app(X1,cons(hd(esk4_0),nil))
| tl(esk4_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(hd(esk4_0)) ),
inference(er,[status(thm)],[c_0_43]) ).
fof(c_0_47,plain,
! [X4,X5,X6] :
( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X5,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ) ),
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)],[ax36])])])])])]) ).
fof(c_0_48,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])])])])])]) ).
fof(c_0_49,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_50,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ ssList(X1)
| nil != X1 ) ),
introduced(definition) ).
fof(c_0_51,plain,
! [X4,X5,X6] :
( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( X4 != X5
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) ) ),
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)],[ax37])])])])])]) ).
fof(c_0_52,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_53,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
fof(c_0_54,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_55,negated_conjecture,
memberP(esk3_0,esk5_0),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( esk3_0 = app(tl(esk4_0),cons(hd(esk4_0),nil))
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(hd(esk4_0)) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_57,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_58,plain,
( ~ epred1_0
<=> ! [X3,X2] :
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ memberP(X2,X3)
| nil != X2 ) ),
introduced(definition) ).
cnf(c_0_59,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_60,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_61,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_62,plain,
( epred2_0
| nil != X1
| ~ ssList(X1) ),
inference(split_equiv,[status(thm)],[c_0_50]) ).
cnf(c_0_63,plain,
( memberP(cons(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_64,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_65,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_66,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_67,plain,
( memberP(X3,X1)
| memberP(X2,X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(app(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_68,negated_conjecture,
( memberP(app(tl(esk4_0),cons(hd(esk4_0),nil)),esk5_0)
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(hd(esk4_0)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_69,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_70,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_71,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_72,negated_conjecture,
( memberP(nil,esk5_0)
| esk4_0 != nil ),
inference(spm,[status(thm)],[c_0_55,c_0_57]) ).
cnf(c_0_73,negated_conjecture,
~ memberP(esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_74,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_58]),c_0_50]) ).
cnf(c_0_75,plain,
epred2_0,
inference(spm,[status(thm)],[c_0_62,c_0_26]) ).
cnf(c_0_76,plain,
( nil = X1
| memberP(X1,X2)
| ~ memberP(tl(X1),X2)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_66]) ).
cnf(c_0_77,negated_conjecture,
( memberP(cons(hd(esk4_0),nil),esk5_0)
| memberP(tl(esk4_0),esk5_0)
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(hd(esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]),c_0_42]) ).
cnf(c_0_78,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_72]),c_0_69])]) ).
cnf(c_0_80,negated_conjecture,
~ memberP(esk4_0,esk5_0),
inference(rw,[status(thm)],[c_0_73,c_0_71]) ).
cnf(c_0_81,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_82,plain,
( memberP(X3,X1)
| X1 = X2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ memberP(cons(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_83,negated_conjecture,
( memberP(cons(hd(esk4_0),nil),esk5_0)
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(hd(esk4_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_69])]),c_0_79]),c_0_80]) ).
cnf(c_0_84,plain,
( nil != X1
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_58]),c_0_81]) ).
cnf(c_0_85,negated_conjecture,
( esk5_0 = hd(esk4_0)
| memberP(nil,esk5_0)
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_26]),c_0_69])]) ).
cnf(c_0_86,negated_conjecture,
( esk5_0 = hd(esk4_0)
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_26]),c_0_69])]) ).
fof(c_0_87,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])])])])])]) ).
fof(c_0_88,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk12_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ssList(esk13_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( app(esk12_2(X5,X6),cons(X6,esk13_2(X5,X6))) = X5
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(X9,cons(X6,X10)) != X5
| memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) ) ),
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)],[ax3])])])])])])]) ).
fof(c_0_89,plain,
! [X4] :
( ( ssList(esk6_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk7_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk7_1(X4),esk6_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])])])])])]) ).
cnf(c_0_90,negated_conjecture,
( ~ memberP(esk4_0,hd(esk4_0))
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(hd(esk4_0)) ),
inference(spm,[status(thm)],[c_0_80,c_0_86]) ).
cnf(c_0_91,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_92,plain,
( memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X2)
| app(X3,cons(X2,X4)) != X1
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_93,plain,
( nil = X1
| cons(esk7_1(X1),esk6_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_94,plain,
( nil = X1
| ssItem(esk7_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_95,plain,
( nil = X1
| ssList(esk6_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
fof(c_0_96,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_97,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])])])])]) ).
cnf(c_0_98,negated_conjecture,
( ~ memberP(esk4_0,hd(esk4_0))
| ~ ssList(tl(esk4_0))
| ~ neq(nil,esk4_0)
| ~ ssItem(hd(esk4_0)) ),
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_91]),c_0_26]),c_0_78])]),c_0_79]) ).
cnf(c_0_99,plain,
( nil = X1
| memberP(X2,esk7_1(X1))
| app(X3,X1) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]),c_0_95]) ).
cnf(c_0_100,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_101,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_102,negated_conjecture,
( ~ memberP(esk4_0,hd(esk4_0))
| ~ ssList(tl(esk4_0))
| ~ ssItem(hd(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_91]),c_0_78]),c_0_26])]),c_0_79]) ).
cnf(c_0_103,plain,
( nil = X1
| memberP(X1,esk7_1(X1))
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_26])])]) ).
cnf(c_0_104,plain,
( esk7_1(X1) = hd(X1)
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_93]),c_0_94]),c_0_95]) ).
cnf(c_0_105,negated_conjecture,
( ~ memberP(esk4_0,hd(esk4_0))
| ~ ssItem(hd(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_66]),c_0_78])]),c_0_79]) ).
cnf(c_0_106,plain,
( nil = X1
| memberP(X1,hd(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_107,negated_conjecture,
~ ssItem(hd(esk4_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_78])]),c_0_79]) ).
cnf(c_0_108,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_65]),c_0_78])]),c_0_79]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC395+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n017.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 20:26:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/23.43 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.36/23.43
% 0.50/46.44 eprover: CPU time limit exceeded, terminating
% 0.50/46.44 eprover: CPU time limit exceeded, terminating
% 0.50/46.44 eprover: CPU time limit exceeded, terminating
% 0.50/46.45 eprover: CPU time limit exceeded, terminating
% 0.63/69.45 eprover: CPU time limit exceeded, terminating
% 0.63/69.45 eprover: CPU time limit exceeded, terminating
% 0.63/69.47 eprover: CPU time limit exceeded, terminating
% 0.63/69.47 eprover: CPU time limit exceeded, terminating
% 0.78/92.47 eprover: CPU time limit exceeded, terminating
% 0.78/92.47 eprover: CPU time limit exceeded, terminating
% 0.78/92.48 eprover: CPU time limit exceeded, terminating
% 0.78/92.49 eprover: CPU time limit exceeded, terminating
% 0.78/92.96 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.78/92.96
% 0.78/92.96 # Failure: Resource limit exceeded (time)
% 0.78/92.96 # OLD status Res
% 0.78/92.96 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.78/92.96 # Preprocessing time : 0.020 s
% 0.78/92.96 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.78/92.96
% 0.78/92.96 # Failure: Resource limit exceeded (time)
% 0.78/92.96 # OLD status Res
% 0.78/92.96 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.78/92.96 # Preprocessing time : 0.010 s
% 0.78/92.96 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.78/92.96
% 0.78/92.96 # Failure: Resource limit exceeded (time)
% 0.78/92.96 # OLD status Res
% 0.78/92.96 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.78/92.96 # Preprocessing time : 0.020 s
% 0.78/92.96 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.78/92.96
% 0.78/92.96 # Failure: Resource limit exceeded (time)
% 0.78/92.96 # OLD status Res
% 0.78/92.96 # Preprocessing time : 0.014 s
% 0.78/92.96 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.78/92.96 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.78/92.96 # Preprocessing time : 0.020 s
% 0.78/92.96
% 0.78/92.96 # Proof found!
% 0.78/92.96 # SZS status Theorem
% 0.78/92.96 # SZS output start CNFRefutation
% See solution above
% 0.78/92.96 # Proof object total steps : 109
% 0.78/92.96 # Proof object clause steps : 69
% 0.78/92.96 # Proof object formula steps : 40
% 0.78/92.96 # Proof object conjectures : 32
% 0.78/92.96 # Proof object clause conjectures : 29
% 0.78/92.96 # Proof object formula conjectures : 3
% 0.78/92.96 # Proof object initial clauses used : 31
% 0.78/92.96 # Proof object initial formulas used : 19
% 0.78/92.96 # Proof object generating inferences : 32
% 0.78/92.96 # Proof object simplifying inferences : 62
% 0.78/92.96 # Training examples: 0 positive, 0 negative
% 0.78/92.96 # Parsed axioms : 96
% 0.78/92.96 # Removed by relevancy pruning/SinE : 63
% 0.78/92.96 # Initial clauses : 61
% 0.78/92.96 # Removed in clause preprocessing : 0
% 0.78/92.96 # Initial clauses in saturation : 61
% 0.78/92.96 # Processed clauses : 827
% 0.78/92.96 # ...of these trivial : 46
% 0.78/92.96 # ...subsumed : 455
% 0.78/92.96 # ...remaining for further processing : 326
% 0.78/92.96 # Other redundant clauses eliminated : 70
% 0.78/92.96 # Clauses deleted for lack of memory : 0
% 0.78/92.96 # Backward-subsumed : 41
% 0.78/92.96 # Backward-rewritten : 6
% 0.78/92.96 # Generated clauses : 6317
% 0.78/92.96 # ...of the previous two non-trivial : 5388
% 0.78/92.96 # Contextual simplify-reflections : 644
% 0.78/92.96 # Paramodulations : 6198
% 0.78/92.96 # Factorizations : 0
% 0.78/92.96 # Equation resolutions : 115
% 0.78/92.96 # Current number of processed clauses : 274
% 0.78/92.96 # Positive orientable unit clauses : 11
% 0.78/92.96 # Positive unorientable unit clauses: 0
% 0.78/92.96 # Negative unit clauses : 6
% 0.78/92.96 # Non-unit-clauses : 257
% 0.78/92.96 # Current number of unprocessed clauses: 4449
% 0.78/92.96 # ...number of literals in the above : 31444
% 0.78/92.96 # Current number of archived formulas : 0
% 0.78/92.96 # Current number of archived clauses : 47
% 0.78/92.96 # Clause-clause subsumption calls (NU) : 24997
% 0.78/92.96 # Rec. Clause-clause subsumption calls : 5655
% 0.78/92.96 # Non-unit clause-clause subsumptions : 1133
% 0.78/92.96 # Unit Clause-clause subsumption calls : 147
% 0.78/92.96 # Rewrite failures with RHS unbound : 0
% 0.78/92.96 # BW rewrite match attempts : 3
% 0.78/92.96 # BW rewrite match successes : 3
% 0.78/92.96 # Condensation attempts : 0
% 0.78/92.96 # Condensation successes : 0
% 0.78/92.96 # Termbank termtop insertions : 116473
% 0.78/92.96
% 0.78/92.96 # -------------------------------------------------
% 0.78/92.96 # User time : 0.255 s
% 0.78/92.96 # System time : 0.004 s
% 0.78/92.96 # Total time : 0.259 s
% 0.78/92.96 # Maximum resident set size: 7680 pages
% 0.82/115.48 eprover: CPU time limit exceeded, terminating
% 0.82/115.48 eprover: CPU time limit exceeded, terminating
% 0.82/115.50 eprover: CPU time limit exceeded, terminating
% 0.82/115.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.82/115.50 eprover: No such file or directory
% 0.82/115.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.50 eprover: No such file or directory
% 0.82/115.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.82/115.50 eprover: No such file or directory
% 0.82/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.51 eprover: No such file or directory
% 0.82/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.82/115.51 eprover: No such file or directory
% 0.82/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.51 eprover: No such file or directory
% 0.82/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.51 eprover: No such file or directory
% 0.82/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.82/115.51 eprover: No such file or directory
% 0.82/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.51 eprover: No such file or directory
% 0.82/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.52 eprover: No such file or directory
% 0.82/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.82/115.52 eprover: No such file or directory
% 0.82/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.52 eprover: No such file or directory
% 0.82/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.52 eprover: No such file or directory
% 0.82/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.82/115.52 eprover: No such file or directory
% 0.82/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.52 eprover: No such file or directory
% 0.82/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.52 eprover: No such file or directory
% 0.82/115.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.82/115.53 eprover: No such file or directory
% 0.82/115.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.53 eprover: No such file or directory
% 0.82/115.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.53 eprover: No such file or directory
% 0.82/115.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.54 eprover: No such file or directory
% 0.82/115.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/115.54 eprover: No such file or directory
%------------------------------------------------------------------------------