TSTP Solution File: SWC306+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC306+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:25:28 EDT 2024
% Result : Theorem 0.18s 0.54s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 69 ( 18 unt; 0 def)
% Number of atoms : 284 ( 77 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 353 ( 138 ~; 134 |; 30 &)
% ( 2 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) )
| ( ! [X10] :
( ssItem(X10)
=> ( cons(X10,nil) != X3
| ~ memberP(X4,X10) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) )
| ( ! [X10] :
( ssItem(X10)
=> ( cons(X10,nil) != X3
| ~ memberP(X4,X10) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_12,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& ssList(esk56_0)
& app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0
& lt(esk53_0,esk52_0)
& ( nil = esk51_0
| ssItem(esk57_0) )
& ( nil = esk50_0
| ssItem(esk57_0) )
& ( nil = esk51_0
| cons(esk57_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk57_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk57_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk57_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_13,plain,
! [X229,X230] :
( ( nil = X230
| nil != app(X229,X230)
| ~ ssList(X230)
| ~ ssList(X229) )
& ( nil = X229
| nil != app(X229,X230)
| ~ ssList(X230)
| ~ ssList(X229) )
& ( nil != X230
| nil != X229
| nil = app(X229,X230)
| ~ ssList(X230)
| ~ ssList(X229) ) ),
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_14,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X134,X135] :
( ~ ssList(X134)
| ~ ssList(X135)
| ssList(app(X134,X135)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_20,negated_conjecture,
( app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)) = nil
| esk50_0 != nil
| ~ ssList(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)) = nil
| esk50_0 != nil
| ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),esk55_0))
| ~ ssList(cons(esk53_0,nil)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),esk55_0))
| ~ ssList(cons(esk53_0,nil)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X226,X227,X228] :
( ~ ssList(X226)
| ~ ssList(X227)
| ~ ssList(X228)
| app(app(X226,X227),X228) = app(X226,app(X227,X228)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_27,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_29,plain,
! [X115,X116] :
( ~ ssList(X115)
| ~ ssItem(X116)
| ssList(cons(X116,X115)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_30,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_31,plain,
! [X224,X225] :
( ~ ssList(X224)
| ~ ssItem(X225)
| cons(X225,X224) = app(cons(X225,nil),X224) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_32,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_33,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_28])]) ).
cnf(c_0_34,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_36,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,negated_conjecture,
( app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_30]),c_0_25]),c_0_28])]) ).
cnf(c_0_38,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_40,plain,
! [X206] :
( ~ ssItem(X206)
| strictorderedP(cons(X206,nil)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])])]) ).
fof(c_0_41,plain,
! [X117,X118] :
( ~ ssList(X117)
| ~ ssItem(X118)
| cons(X118,X117) != X117 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).
cnf(c_0_42,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
fof(c_0_43,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_44,plain,
! [X82,X83,X84,X85,X86,X87] :
( ( ~ strictorderedP(X82)
| ~ ssItem(X83)
| ~ ssItem(X84)
| ~ ssList(X85)
| ~ ssList(X86)
| ~ ssList(X87)
| app(app(X85,cons(X83,X86)),cons(X84,X87)) != X82
| lt(X83,X84)
| ~ ssList(X82) )
& ( ssItem(esk30_1(X82))
| strictorderedP(X82)
| ~ ssList(X82) )
& ( ssItem(esk31_1(X82))
| strictorderedP(X82)
| ~ ssList(X82) )
& ( ssList(esk32_1(X82))
| strictorderedP(X82)
| ~ ssList(X82) )
& ( ssList(esk33_1(X82))
| strictorderedP(X82)
| ~ ssList(X82) )
& ( ssList(esk34_1(X82))
| strictorderedP(X82)
| ~ ssList(X82) )
& ( app(app(esk32_1(X82),cons(esk30_1(X82),esk33_1(X82))),cons(esk31_1(X82),esk34_1(X82))) = X82
| strictorderedP(X82)
| ~ ssList(X82) )
& ( ~ lt(esk30_1(X82),esk31_1(X82))
| strictorderedP(X82)
| ~ ssList(X82) ) ),
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)],[ax12])])])])])]) ).
cnf(c_0_45,negated_conjecture,
( app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0
| ~ ssList(cons(esk52_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_25]),c_0_39])]) ).
cnf(c_0_46,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( nil = esk50_0
| cons(esk57_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_48,negated_conjecture,
( nil = esk50_0
| ssItem(esk57_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,negated_conjecture,
( cons(esk53_0,nil) = nil
| esk50_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_34]),c_0_35]),c_0_39])]) ).
fof(c_0_51,plain,
! [X148,X149] :
( ~ ssItem(X148)
| ~ ssItem(X149)
| ~ lt(X148,X149)
| ~ lt(X149,X148) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])])]) ).
cnf(c_0_52,plain,
( lt(X2,X3)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_45]),c_0_18])]) ).
cnf(c_0_54,negated_conjecture,
( esk50_0 = nil
| strictorderedP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_55,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_35]),c_0_36])]) ).
cnf(c_0_56,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_57,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_58,negated_conjecture,
lt(esk53_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_59,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_60,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_38]),c_0_18]),c_0_36])]) ).
cnf(c_0_61,negated_conjecture,
strictorderedP(esk50_0),
inference(sr,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_62,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_56,c_0_15]) ).
cnf(c_0_63,negated_conjecture,
~ lt(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_36]),c_0_39])]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]),c_0_18]),c_0_25]),c_0_28]),c_0_36]),c_0_39])]),c_0_63]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_21]),c_0_28])]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_67,negated_conjecture,
~ ssList(cons(esk52_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_34]),c_0_25]),c_0_39])]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_34]),c_0_35]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWC306+1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 02:58:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.18/0.54 # Version: 3.1.0
% 0.18/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.54 # Starting sh5l with 300s (1) cores
% 0.18/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3038 completed with status 0
% 0.18/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.54 # No SInE strategy applied
% 0.18/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.18/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.18/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.54 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.18/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.18/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.18/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 3048 completed with status 0
% 0.18/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.18/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.54 # No SInE strategy applied
% 0.18/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.18/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.18/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.54 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.18/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.18/0.54 # Preprocessing time : 0.003 s
% 0.18/0.54 # Presaturation interreduction done
% 0.18/0.54
% 0.18/0.54 # Proof found!
% 0.18/0.54 # SZS status Theorem
% 0.18/0.54 # SZS output start CNFRefutation
% See solution above
% 0.18/0.54 # Parsed axioms : 96
% 0.18/0.54 # Removed by relevancy pruning/SinE : 0
% 0.18/0.54 # Initial clauses : 209
% 0.18/0.54 # Removed in clause preprocessing : 2
% 0.18/0.54 # Initial clauses in saturation : 207
% 0.18/0.54 # Processed clauses : 603
% 0.18/0.54 # ...of these trivial : 10
% 0.18/0.54 # ...subsumed : 55
% 0.18/0.54 # ...remaining for further processing : 538
% 0.18/0.54 # Other redundant clauses eliminated : 76
% 0.18/0.54 # Clauses deleted for lack of memory : 0
% 0.18/0.54 # Backward-subsumed : 41
% 0.18/0.54 # Backward-rewritten : 4
% 0.18/0.54 # Generated clauses : 1326
% 0.18/0.54 # ...of the previous two non-redundant : 1115
% 0.18/0.54 # ...aggressively subsumed : 0
% 0.18/0.54 # Contextual simplify-reflections : 28
% 0.18/0.54 # Paramodulations : 1237
% 0.18/0.54 # Factorizations : 0
% 0.18/0.54 # NegExts : 0
% 0.18/0.54 # Equation resolutions : 81
% 0.18/0.54 # Disequality decompositions : 0
% 0.18/0.54 # Total rewrite steps : 879
% 0.18/0.54 # ...of those cached : 838
% 0.18/0.54 # Propositional unsat checks : 0
% 0.18/0.54 # Propositional check models : 0
% 0.18/0.54 # Propositional check unsatisfiable : 0
% 0.18/0.54 # Propositional clauses : 0
% 0.18/0.54 # Propositional clauses after purity: 0
% 0.18/0.54 # Propositional unsat core size : 0
% 0.18/0.54 # Propositional preprocessing time : 0.000
% 0.18/0.54 # Propositional encoding time : 0.000
% 0.18/0.55 # Propositional solver time : 0.000
% 0.18/0.55 # Success case prop preproc time : 0.000
% 0.18/0.55 # Success case prop encoding time : 0.000
% 0.18/0.55 # Success case prop solver time : 0.000
% 0.18/0.55 # Current number of processed clauses : 259
% 0.18/0.55 # Positive orientable unit clauses : 46
% 0.18/0.55 # Positive unorientable unit clauses: 0
% 0.18/0.55 # Negative unit clauses : 7
% 0.18/0.55 # Non-unit-clauses : 206
% 0.18/0.55 # Current number of unprocessed clauses: 909
% 0.18/0.55 # ...number of literals in the above : 6015
% 0.18/0.55 # Current number of archived formulas : 0
% 0.18/0.55 # Current number of archived clauses : 256
% 0.18/0.55 # Clause-clause subsumption calls (NU) : 20220
% 0.18/0.55 # Rec. Clause-clause subsumption calls : 5717
% 0.18/0.55 # Non-unit clause-clause subsumptions : 76
% 0.18/0.55 # Unit Clause-clause subsumption calls : 143
% 0.18/0.55 # Rewrite failures with RHS unbound : 0
% 0.18/0.55 # BW rewrite match attempts : 14
% 0.18/0.55 # BW rewrite match successes : 14
% 0.18/0.55 # Condensation attempts : 0
% 0.18/0.55 # Condensation successes : 0
% 0.18/0.55 # Termbank termtop insertions : 45999
% 0.18/0.55 # Search garbage collected termcells : 4361
% 0.18/0.55
% 0.18/0.55 # -------------------------------------------------
% 0.18/0.55 # User time : 0.065 s
% 0.18/0.55 # System time : 0.006 s
% 0.18/0.55 # Total time : 0.071 s
% 0.18/0.55 # Maximum resident set size: 2496 pages
% 0.18/0.55
% 0.18/0.55 # -------------------------------------------------
% 0.18/0.55 # User time : 0.291 s
% 0.18/0.55 # System time : 0.021 s
% 0.18/0.55 # Total time : 0.312 s
% 0.18/0.55 # Maximum resident set size: 1824 pages
% 0.18/0.55 % E---3.1 exiting
% 0.18/0.55 % E exiting
%------------------------------------------------------------------------------