TSTP Solution File: SWC284+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC284+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 300s
% DateTime : Tue May 21 04:28:49 EDT 2024
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 14
% Syntax : Number of formulae : 93 ( 28 unt; 0 def)
% Number of atoms : 355 ( 83 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 444 ( 182 ~; 177 |; 37 &)
% ( 6 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn 75 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1
| ! [X8] :
( ssItem(X8)
=> ( ( ~ memberP(X6,X8)
| leq(X8,X5) )
& ( ~ memberP(X7,X8)
| leq(X5,X8) ) ) ) ) ) )
| ( nil != X3
& nil = X4 )
| ( ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X3
| ~ memberP(X4,X9) )
& neq(X4,nil) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(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(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(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(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(ax31,axiom,
! [X1] :
( ssItem(X1)
=> leq(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax31) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1
| ! [X8] :
( ssItem(X8)
=> ( ( ~ memberP(X6,X8)
| leq(X8,X5) )
& ( ~ memberP(X7,X8)
| leq(X5,X8) ) ) ) ) ) )
| ( nil != X3
& nil = X4 )
| ( ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X3
| ~ memberP(X4,X9) )
& neq(X4,nil) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_15,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssItem(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk1_0
& ssItem(esk8_0)
& ( memberP(esk7_0,esk8_0)
| memberP(esk6_0,esk8_0) )
& ( ~ leq(esk5_0,esk8_0)
| memberP(esk6_0,esk8_0) )
& ( memberP(esk7_0,esk8_0)
| ~ leq(esk8_0,esk5_0) )
& ( ~ leq(esk5_0,esk8_0)
| ~ leq(esk8_0,esk5_0) )
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk9_0)
| ~ neq(esk4_0,nil) )
& ( cons(esk9_0,nil) = esk3_0
| ~ neq(esk4_0,nil) )
& ( memberP(esk4_0,esk9_0)
| ~ neq(esk4_0,nil) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
fof(c_0_16,plain,
! [X81,X82] :
( ( nil = X82
| nil != app(X81,X82)
| ~ ssList(X82)
| ~ ssList(X81) )
& ( nil = X81
| nil != app(X81,X82)
| ~ ssList(X82)
| ~ ssList(X81) )
& ( nil != X82
| nil != X81
| nil = app(X81,X82)
| ~ ssList(X82)
| ~ ssList(X81) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_17,negated_conjecture,
app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk3_0,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X69,X70] :
( ~ ssList(X69)
| ~ ssList(X70)
| ssList(app(X69,X70)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_23,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = nil
| esk3_0 != nil
| ~ ssList(app(esk6_0,cons(esk5_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_26,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_27,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = nil
| esk3_0 != nil
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
fof(c_0_29,plain,
! [X41,X42] :
( ~ ssList(X41)
| ~ ssItem(X42)
| ssList(cons(X42,X41)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_30,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_31,plain,
! [X43,X44] :
( ~ ssList(X43)
| ~ ssItem(X44)
| cons(X44,X43) != X43 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
cnf(c_0_32,negated_conjecture,
( cons(esk5_0,nil) = nil
| esk3_0 != nil
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25])]) ).
cnf(c_0_33,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_35,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_36,plain,
! [X21,X22] :
( ( ~ neq(X21,X22)
| X21 != X22
| ~ ssList(X22)
| ~ ssList(X21) )
& ( X21 = X22
| neq(X21,X22)
| ~ ssList(X22)
| ~ ssList(X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( cons(esk5_0,nil) = nil
| esk3_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
fof(c_0_39,plain,
! [X78,X79,X80] :
( ~ ssList(X78)
| ~ ssList(X79)
| ~ ssList(X80)
| app(app(X78,X79),X80) = app(X78,app(X79,X80)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_40,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_42,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_34]),c_0_35])]) ).
cnf(c_0_44,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_45,plain,
! [X28,X29,X32,X33] :
( ( ssList(esk12_2(X28,X29))
| ~ memberP(X28,X29)
| ~ ssItem(X29)
| ~ ssList(X28) )
& ( ssList(esk13_2(X28,X29))
| ~ memberP(X28,X29)
| ~ ssItem(X29)
| ~ ssList(X28) )
& ( app(esk12_2(X28,X29),cons(X29,esk13_2(X28,X29))) = X28
| ~ memberP(X28,X29)
| ~ ssItem(X29)
| ~ ssList(X28) )
& ( ~ ssList(X32)
| ~ ssList(X33)
| app(X32,cons(X29,X33)) != X28
| memberP(X28,X29)
| ~ ssItem(X29)
| ~ ssList(X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])])]) ).
cnf(c_0_46,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_47,plain,
! [X52,X53] :
( ~ ssList(X52)
| ~ ssItem(X53)
| cons(X53,X52) = app(cons(X53,nil),X52) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_48,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_34]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
esk4_0 != nil,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_51,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_52,plain,
( memberP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,cons(X3,X2)) != X4
| ~ ssItem(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( app(esk6_0,app(cons(esk5_0,nil),esk7_0)) = esk3_0
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_46]),c_0_21]),c_0_25])]) ).
cnf(c_0_54,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_56,plain,
! [X37,X38,X39] :
( ( ~ memberP(cons(X38,X39),X37)
| X37 = X38
| memberP(X39,X37)
| ~ ssList(X39)
| ~ ssItem(X38)
| ~ ssItem(X37) )
& ( X37 != X38
| memberP(cons(X38,X39),X37)
| ~ ssList(X39)
| ~ ssItem(X38)
| ~ ssItem(X37) )
& ( ~ memberP(X39,X37)
| memberP(cons(X38,X39),X37)
| ~ ssList(X39)
| ~ ssItem(X38)
| ~ ssItem(X37) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
cnf(c_0_57,negated_conjecture,
( cons(esk9_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_58,negated_conjecture,
neq(esk4_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_59,negated_conjecture,
( ssItem(esk9_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_60,plain,
! [X40] :
( ~ ssItem(X40)
| ~ memberP(nil,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])]) ).
cnf(c_0_61,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( app(esk6_0,cons(esk5_0,esk7_0)) = esk3_0
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_21]),c_0_35])]) ).
cnf(c_0_63,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_55,c_0_18]) ).
cnf(c_0_64,plain,
( X3 = X1
| memberP(X2,X3)
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_65,negated_conjecture,
cons(esk9_0,nil) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_66,negated_conjecture,
ssItem(esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_58])]) ).
cnf(c_0_67,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_68,negated_conjecture,
( memberP(esk3_0,esk5_0)
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_21]),c_0_25]),c_0_35])]) ).
cnf(c_0_69,negated_conjecture,
( esk9_0 = X1
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_34]),c_0_66])]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
memberP(esk3_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_71,negated_conjecture,
esk9_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_35])]) ).
fof(c_0_72,plain,
! [X34,X35,X36] :
( ( ~ memberP(app(X35,X36),X34)
| memberP(X35,X34)
| memberP(X36,X34)
| ~ ssList(X36)
| ~ ssList(X35)
| ~ ssItem(X34) )
& ( ~ memberP(X35,X34)
| memberP(app(X35,X36),X34)
| ~ ssList(X36)
| ~ ssList(X35)
| ~ ssItem(X34) )
& ( ~ memberP(X36,X34)
| memberP(app(X35,X36),X34)
| ~ ssList(X36)
| ~ ssList(X35)
| ~ ssItem(X34) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])])]) ).
cnf(c_0_73,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(rw,[status(thm)],[c_0_65,c_0_71]) ).
cnf(c_0_74,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_75,negated_conjecture,
app(app(esk6_0,esk3_0),esk7_0) = esk3_0,
inference(spm,[status(thm)],[c_0_20,c_0_73]) ).
cnf(c_0_76,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_77,negated_conjecture,
app(esk6_0,cons(esk5_0,esk7_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_73]),c_0_63])]) ).
cnf(c_0_78,negated_conjecture,
( memberP(esk3_0,X1)
| ~ memberP(esk7_0,X1)
| ~ ssList(app(esk6_0,esk3_0))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_21])]) ).
cnf(c_0_79,negated_conjecture,
( memberP(esk7_0,esk8_0)
| memberP(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_80,negated_conjecture,
ssItem(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_81,negated_conjecture,
( memberP(esk3_0,X1)
| ~ memberP(esk6_0,X1)
| ~ ssList(cons(esk5_0,esk7_0))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_25])]) ).
cnf(c_0_82,negated_conjecture,
( memberP(esk6_0,esk8_0)
| memberP(esk3_0,esk8_0)
| ~ ssList(app(esk6_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_83,negated_conjecture,
( memberP(esk3_0,X1)
| ~ memberP(esk6_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_33]),c_0_21]),c_0_35])]) ).
cnf(c_0_84,negated_conjecture,
( memberP(esk3_0,esk8_0)
| memberP(esk6_0,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_24]),c_0_63]),c_0_25])]) ).
cnf(c_0_85,negated_conjecture,
( esk5_0 = X1
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_69,c_0_71]) ).
cnf(c_0_86,negated_conjecture,
memberP(esk3_0,esk8_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_80])]) ).
cnf(c_0_87,negated_conjecture,
( ~ leq(esk5_0,esk8_0)
| ~ leq(esk8_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_88,negated_conjecture,
esk5_0 = esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_80])]) ).
fof(c_0_89,plain,
! [X61] :
( ~ ssItem(X61)
| leq(X61,X61) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax31])])]) ).
cnf(c_0_90,negated_conjecture,
~ leq(esk8_0,esk8_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88]),c_0_88])]) ).
cnf(c_0_91,plain,
( leq(X1,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC284+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n011.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 03:08:22 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.50 # Version: 3.1.0
% 0.18/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # new_bool_3 with pid 20555 completed with status 0
% 0.18/0.50 # Result found by new_bool_3
% 0.18/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20558 completed with status 0
% 0.18/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.50 # Preprocessing time : 0.002 s
% 0.18/0.50 # Presaturation interreduction done
% 0.18/0.50
% 0.18/0.50 # Proof found!
% 0.18/0.50 # SZS status Theorem
% 0.18/0.50 # SZS output start CNFRefutation
% See solution above
% 0.18/0.50 # Parsed axioms : 96
% 0.18/0.50 # Removed by relevancy pruning/SinE : 64
% 0.18/0.50 # Initial clauses : 68
% 0.18/0.50 # Removed in clause preprocessing : 0
% 0.18/0.50 # Initial clauses in saturation : 68
% 0.18/0.50 # Processed clauses : 371
% 0.18/0.50 # ...of these trivial : 4
% 0.18/0.50 # ...subsumed : 69
% 0.18/0.50 # ...remaining for further processing : 298
% 0.18/0.50 # Other redundant clauses eliminated : 13
% 0.18/0.50 # Clauses deleted for lack of memory : 0
% 0.18/0.50 # Backward-subsumed : 28
% 0.18/0.50 # Backward-rewritten : 49
% 0.18/0.50 # Generated clauses : 718
% 0.18/0.50 # ...of the previous two non-redundant : 678
% 0.18/0.50 # ...aggressively subsumed : 0
% 0.18/0.50 # Contextual simplify-reflections : 3
% 0.18/0.50 # Paramodulations : 696
% 0.18/0.50 # Factorizations : 0
% 0.18/0.50 # NegExts : 0
% 0.18/0.50 # Equation resolutions : 17
% 0.18/0.50 # Disequality decompositions : 0
% 0.18/0.50 # Total rewrite steps : 528
% 0.18/0.50 # ...of those cached : 505
% 0.18/0.50 # Propositional unsat checks : 0
% 0.18/0.50 # Propositional check models : 0
% 0.18/0.50 # Propositional check unsatisfiable : 0
% 0.18/0.50 # Propositional clauses : 0
% 0.18/0.50 # Propositional clauses after purity: 0
% 0.18/0.50 # Propositional unsat core size : 0
% 0.18/0.50 # Propositional preprocessing time : 0.000
% 0.18/0.50 # Propositional encoding time : 0.000
% 0.18/0.50 # Propositional solver time : 0.000
% 0.18/0.50 # Success case prop preproc time : 0.000
% 0.18/0.50 # Success case prop encoding time : 0.000
% 0.18/0.50 # Success case prop solver time : 0.000
% 0.18/0.50 # Current number of processed clauses : 145
% 0.18/0.50 # Positive orientable unit clauses : 33
% 0.18/0.50 # Positive unorientable unit clauses: 0
% 0.18/0.50 # Negative unit clauses : 6
% 0.18/0.50 # Non-unit-clauses : 106
% 0.18/0.50 # Current number of unprocessed clauses: 399
% 0.18/0.50 # ...number of literals in the above : 1700
% 0.18/0.50 # Current number of archived formulas : 0
% 0.18/0.50 # Current number of archived clauses : 147
% 0.18/0.50 # Clause-clause subsumption calls (NU) : 5038
% 0.18/0.50 # Rec. Clause-clause subsumption calls : 2925
% 0.18/0.50 # Non-unit clause-clause subsumptions : 64
% 0.18/0.50 # Unit Clause-clause subsumption calls : 785
% 0.18/0.50 # Rewrite failures with RHS unbound : 0
% 0.18/0.50 # BW rewrite match attempts : 6
% 0.18/0.50 # BW rewrite match successes : 6
% 0.18/0.50 # Condensation attempts : 0
% 0.18/0.50 # Condensation successes : 0
% 0.18/0.50 # Termbank termtop insertions : 16490
% 0.18/0.50 # Search garbage collected termcells : 1872
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.033 s
% 0.18/0.50 # System time : 0.004 s
% 0.18/0.50 # Total time : 0.037 s
% 0.18/0.50 # Maximum resident set size: 2060 pages
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.038 s
% 0.18/0.50 # System time : 0.006 s
% 0.18/0.50 # Total time : 0.043 s
% 0.18/0.50 # Maximum resident set size: 1828 pages
% 0.18/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------