TSTP Solution File: SWC307+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC307+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:58 EDT 2024
% Result : Theorem 0.72s 0.56s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 74 ( 29 unt; 0 def)
% Number of atoms : 264 ( 48 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 302 ( 112 ~; 110 |; 28 &)
% ( 5 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn 67 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,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) ) ) ) ) ) )
| ( ~ singletonP(X3)
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax69) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,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) ) ) ) ) ) )
| ( ~ singletonP(X3)
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_14,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& segmentP(esk51_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)
& ( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_15,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_14]) ).
cnf(c_0_16,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X225,X226,X227] :
( ~ ssList(X225)
| ~ ssList(X226)
| ~ ssList(X227)
| app(app(X225,X226),X227) = app(X225,app(X226,X227)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_18,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_15,c_0_16]) ).
cnf(c_0_19,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X114,X115] :
( ~ ssList(X114)
| ~ ssItem(X115)
| ssList(cons(X115,X114)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_23,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_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_27,plain,
! [X223,X224] :
( ~ ssList(X223)
| ~ ssItem(X224)
| cons(X224,X223) = app(cons(X224,nil),X223) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_28,negated_conjecture,
app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
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_29,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20]),c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,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)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_31])]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_34,plain,
! [X133,X134] :
( ~ ssList(X133)
| ~ ssList(X134)
| ssList(app(X133,X134)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_35,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_36,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))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_25]),c_0_33])]) ).
cnf(c_0_37,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_38,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_39,plain,
! [X205] :
( ~ ssItem(X205)
| strictorderedP(cons(X205,nil)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])])]) ).
fof(c_0_40,plain,
! [X20,X22] :
( ( ssItem(esk5_1(X20))
| ~ singletonP(X20)
| ~ ssList(X20) )
& ( cons(esk5_1(X20),nil) = X20
| ~ singletonP(X20)
| ~ ssList(X20) )
& ( ~ ssItem(X22)
| cons(X22,nil) != X20
| singletonP(X20)
| ~ ssList(X20) ) ),
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)],[ax4])])])])])]) ).
fof(c_0_41,plain,
! [X112,X113] :
( ( ~ neq(X112,X113)
| X112 != X113
| ~ ssList(X113)
| ~ ssList(X112) )
& ( X112 = X113
| neq(X112,X113)
| ~ ssList(X113)
| ~ ssList(X112) ) ),
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_35])])])])]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_44,plain,
! [X81,X82,X83,X84,X85,X86] :
( ( ~ strictorderedP(X81)
| ~ ssItem(X82)
| ~ ssItem(X83)
| ~ ssList(X84)
| ~ ssList(X85)
| ~ ssList(X86)
| app(app(X84,cons(X82,X85)),cons(X83,X86)) != X81
| lt(X82,X83)
| ~ ssList(X81) )
& ( ssItem(esk30_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ssItem(esk31_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ssList(esk32_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ssList(esk33_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ssList(esk34_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( app(app(esk32_1(X81),cons(esk30_1(X81),esk33_1(X81))),cons(esk31_1(X81),esk34_1(X81))) = X81
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ~ lt(esk30_1(X81),esk31_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) ) ),
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(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21])]) ).
fof(c_0_46,plain,
! [X147,X148] :
( ~ ssItem(X147)
| ~ ssItem(X148)
| ~ lt(X147,X148)
| ~ lt(X148,X147) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).
cnf(c_0_47,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
( cons(esk5_1(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_49,plain,
( ssItem(esk5_1(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_50,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_51,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,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_55,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_24]),c_0_20]),c_0_26])]) ).
cnf(c_0_56,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_57,negated_conjecture,
lt(esk53_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_58,plain,
( strictorderedP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_59,negated_conjecture,
( esk51_0 = nil
| singletonP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_25]),c_0_52])]) ).
cnf(c_0_60,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_53,c_0_16]) ).
cnf(c_0_61,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_54]) ).
cnf(c_0_62,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_29]),c_0_31]),c_0_33])]) ).
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_56,c_0_57]),c_0_26]),c_0_33])]) ).
cnf(c_0_64,negated_conjecture,
( esk51_0 = nil
| strictorderedP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_65,negated_conjecture,
~ strictorderedP(esk50_0),
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(spm,[status(thm)],[c_0_61,c_0_62]),c_0_60]),c_0_31]),c_0_20]),c_0_21]),c_0_33]),c_0_26])]),c_0_63]) ).
fof(c_0_66,plain,
! [X198] :
( ( ~ segmentP(nil,X198)
| nil = X198
| ~ ssList(X198) )
& ( nil != X198
| segmentP(nil,X198)
| ~ ssList(X198) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_67,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_68,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_70,negated_conjecture,
segmentP(nil,esk50_0),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_60])]) ).
cnf(c_0_72,plain,
strictorderedP(nil),
inference(split_conjunct,[status(thm)],[ax69]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_71]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC307+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.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:11:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.72/0.56 # Version: 3.1.0
% 0.72/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.72/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.72/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.72/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.72/0.56 # Starting sh5l with 300s (1) cores
% 0.72/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4029 completed with status 0
% 0.72/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.72/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.72/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.72/0.56 # No SInE strategy applied
% 0.72/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.72/0.56 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.72/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.72/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.72/0.56 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.72/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.72/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.72/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 4040 completed with status 0
% 0.72/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.72/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.72/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.72/0.56 # No SInE strategy applied
% 0.72/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.72/0.56 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.72/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.72/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.72/0.56 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.72/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.72/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.72/0.56 # Preprocessing time : 0.003 s
% 0.72/0.56 # Presaturation interreduction done
% 0.72/0.56
% 0.72/0.56 # Proof found!
% 0.72/0.56 # SZS status Theorem
% 0.72/0.56 # SZS output start CNFRefutation
% See solution above
% 0.72/0.56 # Parsed axioms : 96
% 0.72/0.56 # Removed by relevancy pruning/SinE : 0
% 0.72/0.56 # Initial clauses : 205
% 0.72/0.56 # Removed in clause preprocessing : 2
% 0.72/0.56 # Initial clauses in saturation : 203
% 0.72/0.56 # Processed clauses : 706
% 0.72/0.56 # ...of these trivial : 7
% 0.72/0.56 # ...subsumed : 108
% 0.72/0.56 # ...remaining for further processing : 591
% 0.72/0.56 # Other redundant clauses eliminated : 62
% 0.72/0.56 # Clauses deleted for lack of memory : 0
% 0.72/0.56 # Backward-subsumed : 14
% 0.72/0.56 # Backward-rewritten : 107
% 0.72/0.56 # Generated clauses : 1327
% 0.72/0.56 # ...of the previous two non-redundant : 1171
% 0.72/0.56 # ...aggressively subsumed : 0
% 0.72/0.56 # Contextual simplify-reflections : 33
% 0.72/0.56 # Paramodulations : 1261
% 0.72/0.56 # Factorizations : 0
% 0.72/0.56 # NegExts : 0
% 0.72/0.56 # Equation resolutions : 67
% 0.72/0.56 # Disequality decompositions : 0
% 0.72/0.56 # Total rewrite steps : 932
% 0.72/0.56 # ...of those cached : 890
% 0.72/0.56 # Propositional unsat checks : 0
% 0.72/0.56 # Propositional check models : 0
% 0.72/0.56 # Propositional check unsatisfiable : 0
% 0.72/0.56 # Propositional clauses : 0
% 0.72/0.56 # Propositional clauses after purity: 0
% 0.72/0.56 # Propositional unsat core size : 0
% 0.72/0.56 # Propositional preprocessing time : 0.000
% 0.72/0.56 # Propositional encoding time : 0.000
% 0.72/0.56 # Propositional solver time : 0.000
% 0.72/0.56 # Success case prop preproc time : 0.000
% 0.72/0.56 # Success case prop encoding time : 0.000
% 0.72/0.56 # Success case prop solver time : 0.000
% 0.72/0.56 # Current number of processed clauses : 249
% 0.72/0.56 # Positive orientable unit clauses : 26
% 0.72/0.56 # Positive unorientable unit clauses: 0
% 0.72/0.56 # Negative unit clauses : 4
% 0.72/0.56 # Non-unit-clauses : 219
% 0.72/0.56 # Current number of unprocessed clauses: 862
% 0.72/0.56 # ...number of literals in the above : 4966
% 0.72/0.56 # Current number of archived formulas : 0
% 0.72/0.56 # Current number of archived clauses : 319
% 0.72/0.56 # Clause-clause subsumption calls (NU) : 26374
% 0.72/0.56 # Rec. Clause-clause subsumption calls : 7495
% 0.72/0.56 # Non-unit clause-clause subsumptions : 148
% 0.72/0.56 # Unit Clause-clause subsumption calls : 214
% 0.72/0.56 # Rewrite failures with RHS unbound : 0
% 0.72/0.56 # BW rewrite match attempts : 39
% 0.72/0.56 # BW rewrite match successes : 20
% 0.72/0.56 # Condensation attempts : 0
% 0.72/0.56 # Condensation successes : 0
% 0.72/0.56 # Termbank termtop insertions : 45304
% 0.72/0.56 # Search garbage collected termcells : 4320
% 0.72/0.56
% 0.72/0.56 # -------------------------------------------------
% 0.72/0.56 # User time : 0.073 s
% 0.72/0.56 # System time : 0.006 s
% 0.72/0.56 # Total time : 0.079 s
% 0.72/0.56 # Maximum resident set size: 2492 pages
% 0.72/0.56
% 0.72/0.56 # -------------------------------------------------
% 0.72/0.56 # User time : 0.278 s
% 0.72/0.56 # System time : 0.022 s
% 0.72/0.56 # Total time : 0.299 s
% 0.72/0.56 # Maximum resident set size: 1824 pages
% 0.72/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------