TSTP Solution File: SWC315+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC315+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:35 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 83 ( 12 unt; 0 def)
% Number of atoms : 302 ( 141 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 344 ( 125 ~; 149 |; 31 &)
% ( 2 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 62 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X2
| app(X6,cons(X5,nil)) = X1 ) )
& ( nil != X2
| nil = X1 ) )
| ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ~ ssList(X8)
| app(cons(X7,nil),X8) != X4
| app(X8,cons(X7,nil)) != X3 ) )
& neq(X4,nil) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ( cons(X3,X1) = cons(X4,X2)
=> ( X3 = X4
& X2 = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax19) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(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(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X2
| app(X6,cons(X5,nil)) = X1 ) )
& ( nil != X2
| nil = X1 ) )
| ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ~ ssList(X8)
| app(cons(X7,nil),X8) != X4
| app(X8,cons(X7,nil)) != X3 ) )
& neq(X4,nil) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_12,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_13,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( nil = esk2_0
| ssItem(esk5_0) )
& ( nil != esk1_0
| ssItem(esk5_0) )
& ( nil = esk2_0
| ssList(esk6_0) )
& ( nil != esk1_0
| ssList(esk6_0) )
& ( nil = esk2_0
| app(cons(esk5_0,nil),esk6_0) = esk2_0 )
& ( nil != esk1_0
| app(cons(esk5_0,nil),esk6_0) = esk2_0 )
& ( nil = esk2_0
| app(esk6_0,cons(esk5_0,nil)) != esk1_0 )
& ( nil != esk1_0
| app(esk6_0,cons(esk5_0,nil)) != esk1_0 )
& ( ssItem(esk7_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk8_0)
| ~ neq(esk4_0,nil) )
& ( app(cons(esk7_0,nil),esk8_0) = esk4_0
| ~ neq(esk4_0,nil) )
& ( app(esk8_0,cons(esk7_0,nil)) = esk3_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_11])])])])]) ).
fof(c_0_14,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_15,plain,
! [X19,X20] :
( ( ~ neq(X19,X20)
| X19 != X20
| ~ ssList(X20)
| ~ ssList(X19) )
& ( X19 = X20
| neq(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) ) ),
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_12])])])])]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X50,X51,X52,X53] :
( ( X52 = X53
| cons(X52,X50) != cons(X53,X51)
| ~ ssItem(X53)
| ~ ssItem(X52)
| ~ ssList(X51)
| ~ ssList(X50) )
& ( X51 = X50
| cons(X52,X50) != cons(X53,X51)
| ~ ssItem(X53)
| ~ ssItem(X52)
| ~ ssList(X51)
| ~ ssList(X50) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])])]) ).
fof(c_0_19,plain,
! [X21] :
( ( ssList(esk9_1(X21))
| nil = X21
| ~ ssList(X21) )
& ( ssItem(esk10_1(X21))
| nil = X21
| ~ ssList(X21) )
& ( cons(esk10_1(X21),esk9_1(X21)) = X21
| nil = X21
| ~ ssList(X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
fof(c_0_20,plain,
! [X46,X47] :
( ~ ssList(X46)
| ~ ssItem(X47)
| ssList(cons(X47,X46)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_21,plain,
! [X24,X25] :
( ~ ssList(X24)
| ~ ssItem(X25)
| nil != cons(X25,X24) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_22,plain,
! [X38,X39] :
( ~ ssList(X38)
| ~ ssItem(X39)
| cons(X39,X38) = app(cons(X39,nil),X38) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_23,negated_conjecture,
( app(cons(esk7_0,nil),esk8_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_27,negated_conjecture,
( ssItem(esk7_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
( ssList(esk8_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk2_0
| app(cons(esk5_0,nil),esk6_0) = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,negated_conjecture,
( nil = esk2_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,negated_conjecture,
( nil = esk2_0
| ssList(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_32,plain,
( X1 = X2
| cons(X3,X2) != cons(X4,X1)
| ~ ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,plain,
( cons(esk10_1(X1),esk9_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,plain,
( ssItem(esk10_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_35,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_37,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_38,negated_conjecture,
( app(cons(esk7_0,nil),esk8_0) = esk4_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_39,negated_conjecture,
( esk4_0 = nil
| ssItem(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_40,negated_conjecture,
( esk4_0 = nil
| ssList(esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_41,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk4_0
| esk4_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_17]),c_0_17]) ).
cnf(c_0_42,negated_conjecture,
( esk4_0 = nil
| ssItem(esk5_0) ),
inference(rw,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_43,negated_conjecture,
( esk4_0 = nil
| ssList(esk6_0) ),
inference(rw,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_44,plain,
( esk9_1(cons(X1,X2)) = X2
| ~ ssList(esk9_1(cons(X1,X2)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33])]),c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_45,negated_conjecture,
( cons(esk7_0,esk8_0) = esk4_0
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( cons(esk5_0,esk6_0) = esk4_0
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_37]),c_0_42]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( esk9_1(esk4_0) = esk8_0
| esk4_0 = nil
| ~ ssList(esk9_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_39]),c_0_40]) ).
cnf(c_0_48,plain,
( ssList(esk9_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_49,plain,
! [X32,X33,X34] :
( ~ ssList(X32)
| ~ ssList(X33)
| ~ ssList(X34)
| app(X34,X33) != app(X32,X33)
| X34 = X32 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
cnf(c_0_50,negated_conjecture,
( esk9_1(esk4_0) = esk6_0
| esk4_0 = nil
| ~ ssList(esk9_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_46]),c_0_42]),c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( esk9_1(esk4_0) = esk8_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_26])]) ).
cnf(c_0_52,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X3,X2) != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( esk4_0 = nil
| esk8_0 = esk6_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_40]) ).
cnf(c_0_54,negated_conjecture,
( app(esk8_0,cons(esk7_0,nil)) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_55,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_56,negated_conjecture,
( X1 = cons(esk5_0,nil)
| esk4_0 = nil
| app(X1,esk6_0) != esk4_0
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_43]) ).
cnf(c_0_57,negated_conjecture,
( app(cons(esk7_0,nil),esk6_0) = esk4_0
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_38,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( app(esk8_0,cons(esk7_0,nil)) = esk1_0
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( cons(esk7_0,nil) = cons(esk5_0,nil)
| esk4_0 = nil
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(cons(esk7_0,nil)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( app(esk8_0,cons(esk7_0,nil)) = esk1_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_61,negated_conjecture,
( cons(esk7_0,nil) = cons(esk5_0,nil)
| esk4_0 = nil
| ~ ssList(cons(esk7_0,nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_35]),c_0_25])]),c_0_42]) ).
cnf(c_0_62,negated_conjecture,
( nil = esk2_0
| app(esk6_0,cons(esk5_0,nil)) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_63,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_64,negated_conjecture,
( app(esk6_0,cons(esk7_0,nil)) = esk1_0
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_60,c_0_53]) ).
cnf(c_0_65,negated_conjecture,
( cons(esk7_0,nil) = cons(esk5_0,nil)
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_35]),c_0_25])]),c_0_39]) ).
cnf(c_0_66,negated_conjecture,
( esk4_0 = nil
| app(esk6_0,cons(esk5_0,nil)) != esk1_0 ),
inference(rw,[status(thm)],[c_0_62,c_0_17]) ).
fof(c_0_67,plain,
! [X28,X29,X30] :
( ~ ssList(X28)
| ~ ssList(X29)
| ~ ssItem(X30)
| cons(X30,app(X29,X28)) = app(cons(X30,X29),X28) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_68,plain,
! [X26,X27] :
( ~ ssList(X26)
| ~ ssList(X27)
| ssList(app(X26,X27)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_69,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_70,negated_conjecture,
( esk1_0 = nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[c_0_63,c_0_55]) ).
cnf(c_0_71,negated_conjecture,
esk4_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_72,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_73,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_74,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk4_0
| esk1_0 != nil ),
inference(rw,[status(thm)],[c_0_69,c_0_17]) ).
cnf(c_0_75,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_76,negated_conjecture,
( ssList(esk6_0)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_77,negated_conjecture,
( ssItem(esk5_0)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_78,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_72]),c_0_73]) ).
cnf(c_0_79,negated_conjecture,
app(cons(esk5_0,nil),esk6_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_71]),c_0_75])]) ).
cnf(c_0_80,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_75])]) ).
cnf(c_0_81,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_75])]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_25]),c_0_80]),c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC315+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n022.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 : 300
% 0.13/0.34 % DateTime : Sun May 19 03:30:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # new_bool_3 with pid 11372 completed with status 0
% 0.19/0.51 # Result found by new_bool_3
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 11375 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.19/0.51 # Preprocessing time : 0.002 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 96
% 0.19/0.51 # Removed by relevancy pruning/SinE : 77
% 0.19/0.51 # Initial clauses : 46
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 46
% 0.19/0.51 # Processed clauses : 357
% 0.19/0.51 # ...of these trivial : 2
% 0.19/0.51 # ...subsumed : 147
% 0.19/0.51 # ...remaining for further processing : 208
% 0.19/0.51 # Other redundant clauses eliminated : 12
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 7
% 0.19/0.51 # Backward-rewritten : 95
% 0.19/0.51 # Generated clauses : 584
% 0.19/0.51 # ...of the previous two non-redundant : 519
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 94
% 0.19/0.51 # Paramodulations : 569
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 16
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 392
% 0.19/0.51 # ...of those cached : 382
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 59
% 0.19/0.51 # Positive orientable unit clauses : 11
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 2
% 0.19/0.51 # Non-unit-clauses : 46
% 0.19/0.51 # Current number of unprocessed clauses: 240
% 0.19/0.51 # ...number of literals in the above : 1310
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 146
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 4310
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 2223
% 0.19/0.51 # Non-unit clause-clause subsumptions : 248
% 0.19/0.51 # Unit Clause-clause subsumption calls : 48
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 2
% 0.19/0.51 # BW rewrite match successes : 2
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 12760
% 0.19/0.51 # Search garbage collected termcells : 1405
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.025 s
% 0.19/0.51 # System time : 0.003 s
% 0.19/0.51 # Total time : 0.028 s
% 0.19/0.51 # Maximum resident set size: 1900 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.029 s
% 0.19/0.51 # System time : 0.005 s
% 0.19/0.51 # Total time : 0.034 s
% 0.19/0.51 # Maximum resident set size: 1828 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------