TSTP Solution File: SWC327+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC327+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:25:42 EDT 2024
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 72 ( 18 unt; 0 def)
% Number of atoms : 324 ( 151 equ)
% Maximal formula atoms : 66 ( 4 avg)
% Number of connectives : 427 ( 175 ~; 181 |; 41 &)
% ( 1 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn 44 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ? [X9] :
( ssList(X9)
& app(X1,X9) = X2
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(cons(X10,nil),X11) != X9
| ! [X12] :
( ssList(X12)
=> app(X12,cons(X10,nil)) != X1 ) ) ) )
& equalelemsP(X1) )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
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(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ? [X9] :
( ssList(X9)
& app(X1,X9) = X2
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(cons(X10,nil),X11) != X9
| ! [X12] :
( ssList(X12)
=> app(X12,cons(X10,nil)) != X1 ) ) ) )
& equalelemsP(X1) )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_8,negated_conjecture,
! [X18,X19,X20,X21] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& equalelemsP(esk3_0)
& ( ~ ssItem(X18)
| ~ ssList(X19)
| app(cons(X18,nil),X19) != esk5_0
| ~ ssList(X20)
| app(X20,cons(X18,nil)) != esk3_0 )
& ( nil = esk4_0
| nil != esk3_0 )
& ( nil = esk1_0
| ssItem(esk6_1(X21))
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) )
& ( nil != esk2_0
| ssItem(esk6_1(X21))
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) )
& ( nil = esk1_0
| ssList(esk7_1(X21))
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) )
& ( nil != esk2_0
| ssList(esk7_1(X21))
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) )
& ( nil = esk1_0
| app(cons(esk6_1(X21),nil),esk7_1(X21)) = X21
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) )
& ( nil != esk2_0
| app(cons(esk6_1(X21),nil),esk7_1(X21)) = X21
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) )
& ( nil = esk1_0
| ssList(esk8_1(X21))
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) )
& ( nil != esk2_0
| ssList(esk8_1(X21))
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) )
& ( nil = esk1_0
| app(esk8_1(X21),cons(esk6_1(X21),nil)) = esk1_0
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) )
& ( nil != esk2_0
| app(esk8_1(X21),cons(esk6_1(X21),nil)) = esk1_0
| ~ ssList(X21)
| app(esk1_0,X21) != esk2_0
| ~ equalelemsP(esk1_0) ) ),
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)],[c_0_7])])])])])]) ).
fof(c_0_9,plain,
! [X57,X58] :
( ( nil = X58
| nil != app(X57,X58)
| ~ ssList(X58)
| ~ ssList(X57) )
& ( nil = X57
| nil != app(X57,X58)
| ~ ssList(X58)
| ~ ssList(X57) )
& ( nil != X58
| nil != X57
| nil = app(X57,X58)
| ~ ssList(X58)
| ~ ssList(X57) ) ),
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_10,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
equalelemsP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
app(esk1_0,esk5_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_18,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_19,negated_conjecture,
( app(cons(esk6_1(X1),nil),esk7_1(X1)) = X1
| nil != esk2_0
| ~ ssList(X1)
| app(esk1_0,X1) != esk2_0
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
equalelemsP(esk1_0),
inference(rw,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( esk5_0 = nil
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
fof(c_0_22,plain,
! [X28,X29] :
( ~ ssList(X28)
| ~ ssItem(X29)
| nil != cons(X29,X28) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
fof(c_0_23,plain,
! [X42,X43,X44] :
( ~ ssList(X42)
| ~ ssList(X43)
| ~ ssItem(X44)
| cons(X44,app(X43,X42)) = app(cons(X44,X43),X42) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_24,plain,
! [X40,X41] :
( ~ ssList(X40)
| ~ ssList(X41)
| ssList(app(X40,X41)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_25,negated_conjecture,
( app(cons(esk6_1(X1),nil),esk7_1(X1)) = X1
| app(esk1_0,X1) != esk2_0
| esk2_0 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,negated_conjecture,
( app(esk1_0,nil) = esk2_0
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
fof(c_0_28,plain,
! [X60,X61] :
( ~ ssList(X60)
| ~ ssItem(X61)
| ssList(cons(X61,X60)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( esk7_1(nil) = nil
| esk2_0 != nil
| ~ ssList(cons(esk6_1(nil),nil))
| ~ ssList(esk7_1(nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25])]),c_0_26])]),c_0_27]) ).
cnf(c_0_33,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( ssItem(esk6_1(X1))
| nil != esk2_0
| ~ ssList(X1)
| app(esk1_0,X1) != esk2_0
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_35,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( esk7_1(nil) = nil
| esk2_0 != nil
| ~ ssList(esk7_1(nil))
| ~ ssItem(esk6_1(nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26])]) ).
cnf(c_0_37,negated_conjecture,
( ssItem(esk6_1(X1))
| app(esk1_0,X1) != esk2_0
| esk2_0 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_20])]) ).
cnf(c_0_38,negated_conjecture,
( ssList(esk7_1(X1))
| nil != esk2_0
| ~ ssList(X1)
| app(esk1_0,X1) != esk2_0
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_39,negated_conjecture,
( esk2_0 != nil
| ~ ssList(esk7_1(nil))
| ~ ssItem(esk6_1(nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_25]),c_0_26])])]),c_0_26])]),c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( esk7_1(nil) = nil
| esk2_0 != nil
| ~ ssList(esk7_1(nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_26])]),c_0_27]) ).
cnf(c_0_41,negated_conjecture,
( ssList(esk7_1(X1))
| app(esk1_0,X1) != esk2_0
| esk2_0 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_20])]) ).
cnf(c_0_42,negated_conjecture,
( nil = esk1_0
| app(esk8_1(X1),cons(esk6_1(X1),nil)) = esk1_0
| ~ ssList(X1)
| app(esk1_0,X1) != esk2_0
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_43,negated_conjecture,
( esk2_0 != nil
| ~ ssList(esk7_1(nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_37]),c_0_26])]),c_0_27]) ).
cnf(c_0_44,negated_conjecture,
( esk7_1(nil) = nil
| esk2_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_26])]),c_0_27]) ).
cnf(c_0_45,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_46,negated_conjecture,
( nil = esk1_0
| ssList(esk8_1(X1))
| ~ ssList(X1)
| app(esk1_0,X1) != esk2_0
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_47,negated_conjecture,
( nil = esk1_0
| ssItem(esk6_1(X1))
| ~ ssList(X1)
| app(esk1_0,X1) != esk2_0
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_48,negated_conjecture,
( app(esk8_1(X1),cons(esk6_1(X1),nil)) = esk1_0
| esk1_0 = nil
| app(esk1_0,X1) != esk2_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_20])]) ).
cnf(c_0_49,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_26])]) ).
cnf(c_0_50,negated_conjecture,
( esk2_0 = nil
| esk1_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_12]),c_0_11]) ).
cnf(c_0_51,negated_conjecture,
( esk1_0 = nil
| ssList(esk8_1(X1))
| app(esk1_0,X1) != esk2_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_20])]) ).
cnf(c_0_52,negated_conjecture,
( esk1_0 = nil
| ssItem(esk6_1(X1))
| app(esk1_0,X1) != esk2_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_20])]) ).
cnf(c_0_53,negated_conjecture,
( nil = esk1_0
| app(cons(esk6_1(X1),nil),esk7_1(X1)) = X1
| ~ ssList(X1)
| app(esk1_0,X1) != esk2_0
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_54,negated_conjecture,
( nil = esk1_0
| ssList(esk7_1(X1))
| ~ ssList(X1)
| app(esk1_0,X1) != esk2_0
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk5_0
| ~ ssList(X3)
| app(X3,cons(X1,nil)) != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_56,negated_conjecture,
( app(esk8_1(esk5_0),cons(esk6_1(esk5_0),nil)) = esk1_0
| esk1_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_15]),c_0_17])]) ).
cnf(c_0_57,negated_conjecture,
esk1_0 != nil,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( esk1_0 = nil
| ssList(esk8_1(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_15]),c_0_17])]) ).
cnf(c_0_59,negated_conjecture,
( esk1_0 = nil
| ssItem(esk6_1(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_15]),c_0_17])]) ).
cnf(c_0_60,negated_conjecture,
( app(cons(esk6_1(X1),nil),esk7_1(X1)) = X1
| esk1_0 = nil
| app(esk1_0,X1) != esk2_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_20])]) ).
cnf(c_0_61,negated_conjecture,
( esk1_0 = nil
| ssList(esk7_1(X1))
| app(esk1_0,X1) != esk2_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_20])]) ).
cnf(c_0_62,negated_conjecture,
( app(X1,cons(X2,nil)) != esk1_0
| app(cons(X2,nil),X3) != esk5_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[c_0_55,c_0_11]) ).
cnf(c_0_63,negated_conjecture,
app(esk8_1(esk5_0),cons(esk6_1(esk5_0),nil)) = esk1_0,
inference(sr,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
ssList(esk8_1(esk5_0)),
inference(sr,[status(thm)],[c_0_58,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
ssItem(esk6_1(esk5_0)),
inference(sr,[status(thm)],[c_0_59,c_0_57]) ).
cnf(c_0_66,negated_conjecture,
( app(cons(esk6_1(esk5_0),nil),esk7_1(esk5_0)) = esk5_0
| esk1_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_15]),c_0_17])]) ).
cnf(c_0_67,negated_conjecture,
( esk1_0 = nil
| ssList(esk7_1(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_15]),c_0_17])]) ).
cnf(c_0_68,negated_conjecture,
( app(cons(esk6_1(esk5_0),nil),X1) != esk5_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65])]) ).
cnf(c_0_69,negated_conjecture,
app(cons(esk6_1(esk5_0),nil),esk7_1(esk5_0)) = esk5_0,
inference(sr,[status(thm)],[c_0_66,c_0_57]) ).
cnf(c_0_70,negated_conjecture,
ssList(esk7_1(esk5_0)),
inference(sr,[status(thm)],[c_0_67,c_0_57]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC327+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:50:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55 # Version: 3.1.0
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # new_bool_3 with pid 12141 completed with status 0
% 0.20/0.55 # Result found by new_bool_3
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12145 completed with status 0
% 0.20/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.55 # Preprocessing time : 0.003 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Theorem
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 96
% 0.20/0.55 # Removed by relevancy pruning/SinE : 76
% 0.20/0.55 # Initial clauses : 53
% 0.20/0.55 # Removed in clause preprocessing : 0
% 0.20/0.55 # Initial clauses in saturation : 53
% 0.20/0.55 # Processed clauses : 283
% 0.20/0.55 # ...of these trivial : 8
% 0.20/0.55 # ...subsumed : 77
% 0.20/0.55 # ...remaining for further processing : 198
% 0.20/0.55 # Other redundant clauses eliminated : 12
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 37
% 0.20/0.55 # Backward-rewritten : 0
% 0.20/0.55 # Generated clauses : 595
% 0.20/0.55 # ...of the previous two non-redundant : 521
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 14
% 0.20/0.55 # Paramodulations : 566
% 0.20/0.55 # Factorizations : 0
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 14
% 0.20/0.55 # Disequality decompositions : 0
% 0.20/0.55 # Total rewrite steps : 270
% 0.20/0.55 # ...of those cached : 258
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 92
% 0.20/0.55 # Positive orientable unit clauses : 24
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 8
% 0.20/0.55 # Non-unit-clauses : 60
% 0.20/0.55 # Current number of unprocessed clauses: 332
% 0.20/0.55 # ...number of literals in the above : 1425
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 104
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 1909
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 1135
% 0.20/0.55 # Non-unit clause-clause subsumptions : 96
% 0.20/0.55 # Unit Clause-clause subsumption calls : 238
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 0
% 0.20/0.55 # BW rewrite match successes : 0
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 13172
% 0.20/0.55 # Search garbage collected termcells : 1647
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.038 s
% 0.20/0.55 # System time : 0.007 s
% 0.20/0.55 # Total time : 0.045 s
% 0.20/0.55 # Maximum resident set size: 2020 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.043 s
% 0.20/0.55 # System time : 0.008 s
% 0.20/0.55 # Total time : 0.051 s
% 0.20/0.55 # Maximum resident set size: 1828 pages
% 0.20/0.55 % E---3.1 exiting
% 0.20/0.55 % E exiting
%------------------------------------------------------------------------------