TSTP Solution File: SWC021+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC021+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:26:59 EDT 2024
% Result : Theorem 1.65s 0.66s
% Output : CNFRefutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 27
% Syntax : Number of formulae : 154 ( 40 unt; 0 def)
% Number of atoms : 550 ( 136 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 671 ( 275 ~; 267 |; 50 &)
% ( 7 <=>; 72 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 206 ( 0 sgn 113 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ? [X6] :
( ssList(X6)
& neq(X3,X6)
& frontsegP(X4,X6)
& segmentP(X6,X3)
& strictorderedP(X6) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
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(ax50,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( rearsegP(X1,X2)
=> rearsegP(app(X3,X1),X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax50) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax51) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
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(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/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax44,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( frontsegP(cons(X1,X3),cons(X2,X4))
<=> ( X1 = X2
& frontsegP(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax44) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(c_0_27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ? [X6] :
( ssList(X6)
& neq(X3,X6)
& frontsegP(X4,X6)
& segmentP(X6,X3)
& strictorderedP(X6) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_28,negated_conjecture,
! [X255,X256] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& frontsegP(esk51_0,esk50_0)
& strictorderedP(esk50_0)
& ( ~ ssList(X255)
| ~ neq(X255,nil)
| ~ frontsegP(esk49_0,X255)
| ~ frontsegP(esk48_0,X255) )
& ( ~ ssList(X256)
| ~ neq(esk50_0,X256)
| ~ frontsegP(esk51_0,X256)
| ~ segmentP(X256,esk50_0)
| ~ strictorderedP(X256) )
& ( nil != esk49_0
| nil != esk48_0 ) ),
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_27])])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk49_0,X1)
| ~ frontsegP(esk48_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_30,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_32,plain,
! [X163] :
( ~ ssList(X163)
| frontsegP(X163,X163) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])])]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_34,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_35,negated_conjecture,
( ~ frontsegP(esk50_0,X1)
| ~ frontsegP(esk51_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_36,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
frontsegP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_33,c_0_30]) ).
fof(c_0_39,plain,
! [X109,X110] :
( ( ~ neq(X109,X110)
| X109 != X110
| ~ ssList(X110)
| ~ ssList(X109) )
& ( X109 = X110
| neq(X109,X110)
| ~ ssList(X110)
| ~ ssList(X109) ) ),
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_34])])])])]) ).
cnf(c_0_40,negated_conjecture,
~ neq(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_42,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_43,plain,
! [X20,X21,X23] :
( ( ssList(esk6_2(X20,X21))
| ~ frontsegP(X20,X21)
| ~ ssList(X21)
| ~ ssList(X20) )
& ( app(X21,esk6_2(X20,X21)) = X20
| ~ frontsegP(X20,X21)
| ~ ssList(X21)
| ~ ssList(X20) )
& ( ~ ssList(X23)
| app(X21,X23) != X20
| frontsegP(X20,X21)
| ~ ssList(X21)
| ~ 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)],[ax5])])])])])]) ).
cnf(c_0_44,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_38])]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_46,plain,
! [X135] :
( ~ ssList(X135)
| app(nil,X135) = X135 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_47,plain,
( app(X1,esk6_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
frontsegP(esk51_0,nil),
inference(rw,[status(thm)],[c_0_37,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_45,c_0_31]) ).
cnf(c_0_50,plain,
( ssList(esk6_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_51,plain,
! [X28,X29,X32,X33] :
( ( ssList(esk8_2(X28,X29))
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( ssList(esk9_2(X28,X29))
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( ~ ssList(X32)
| ~ ssList(X33)
| app(app(X32,X29),X33) != X28
| segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])])]) ).
cnf(c_0_52,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
app(nil,esk6_2(esk51_0,nil)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_42])]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk6_2(esk51_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_42]),c_0_49])]) ).
cnf(c_0_55,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_56,negated_conjecture,
esk6_2(esk51_0,nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_57,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
app(nil,esk51_0) = esk51_0,
inference(rw,[status(thm)],[c_0_53,c_0_56]) ).
fof(c_0_59,plain,
! [X227] :
( ~ ssList(X227)
| app(X227,nil) = X227 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_60,negated_conjecture,
( segmentP(app(esk51_0,X1),esk51_0)
| ~ ssList(app(esk51_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_49]),c_0_42])]) ).
cnf(c_0_61,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
fof(c_0_62,plain,
! [X130,X131] :
( ~ ssList(X130)
| ~ ssList(X131)
| ssList(app(X130,X131)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_63,plain,
! [X222,X223,X224] :
( ~ ssList(X222)
| ~ ssList(X223)
| ~ ssList(X224)
| app(app(X222,X223),X224) = app(X222,app(X223,X224)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_64,plain,
( app(app(esk8_2(X1,X2),X2),esk9_2(X1,X2)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_65,negated_conjecture,
segmentP(esk51_0,esk51_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_49]),c_0_42])]) ).
cnf(c_0_66,plain,
( ssList(esk9_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_67,plain,
( ssList(esk8_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_68,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_69,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_70,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_71,negated_conjecture,
app(app(esk8_2(esk51_0,esk51_0),esk51_0),esk9_2(esk51_0,esk51_0)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_49])]) ).
cnf(c_0_72,negated_conjecture,
ssList(esk9_2(esk51_0,esk51_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_65]),c_0_49])]) ).
cnf(c_0_73,negated_conjecture,
ssList(esk8_2(esk51_0,esk51_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_65]),c_0_49])]) ).
cnf(c_0_74,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_68]),c_0_69]) ).
cnf(c_0_75,negated_conjecture,
app(esk8_2(esk51_0,esk51_0),app(esk51_0,esk9_2(esk51_0,esk51_0))) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]),c_0_49]),c_0_73])]) ).
fof(c_0_76,plain,
! [X179,X180,X181] :
( ~ ssList(X179)
| ~ ssList(X180)
| ~ ssList(X181)
| ~ rearsegP(X179,X180)
| rearsegP(app(X181,X179),X180) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])])]) ).
fof(c_0_77,plain,
! [X182] :
( ~ ssList(X182)
| rearsegP(X182,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])]) ).
cnf(c_0_78,negated_conjecture,
( frontsegP(esk51_0,esk8_2(esk51_0,esk51_0))
| ~ ssList(app(esk51_0,esk9_2(esk51_0,esk51_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_73])]) ).
cnf(c_0_79,plain,
( rearsegP(app(X3,X1),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_80,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_81,negated_conjecture,
frontsegP(esk51_0,esk8_2(esk51_0,esk51_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_69]),c_0_72]),c_0_49])]) ).
fof(c_0_82,plain,
! [X24,X25,X27] :
( ( ssList(esk7_2(X24,X25))
| ~ rearsegP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( app(esk7_2(X24,X25),X25) = X24
| ~ rearsegP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( ~ ssList(X27)
| app(X27,X25) != X24
| rearsegP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) ) ),
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)],[ax6])])])])])]) ).
cnf(c_0_83,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_42])]) ).
cnf(c_0_84,negated_conjecture,
app(esk8_2(esk51_0,esk51_0),esk6_2(esk51_0,esk8_2(esk51_0,esk51_0))) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_81]),c_0_49]),c_0_73])]) ).
cnf(c_0_85,negated_conjecture,
ssList(esk6_2(esk51_0,esk8_2(esk51_0,esk51_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_81]),c_0_73]),c_0_49])]) ).
fof(c_0_86,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_87,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax85]) ).
cnf(c_0_88,plain,
( app(esk7_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_89,negated_conjecture,
rearsegP(esk51_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_73]),c_0_85])]) ).
cnf(c_0_90,plain,
( ssList(esk7_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
fof(c_0_91,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_92,plain,
! [X213] :
( ~ ssList(X213)
| nil = X213
| cons(hd(X213),tl(X213)) = X213 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_86])])]) ).
fof(c_0_93,plain,
! [X228,X229] :
( ~ ssList(X228)
| ~ ssList(X229)
| nil = X228
| hd(app(X228,X229)) = hd(X228) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_87])])])]) ).
fof(c_0_94,plain,
! [X225,X226] :
( ( nil = X226
| nil != app(X225,X226)
| ~ ssList(X226)
| ~ ssList(X225) )
& ( nil = X225
| nil != app(X225,X226)
| ~ ssList(X226)
| ~ ssList(X225) )
& ( nil != X226
| nil != X225
| nil = app(X225,X226)
| ~ ssList(X226)
| ~ ssList(X225) ) ),
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_95,negated_conjecture,
app(esk7_2(esk51_0,nil),nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_42]),c_0_49])]) ).
cnf(c_0_96,negated_conjecture,
ssList(esk7_2(esk51_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_89]),c_0_42]),c_0_49])]) ).
cnf(c_0_97,negated_conjecture,
( nil != esk49_0
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_98,plain,
! [X115,X116,X117,X118] :
( ( X117 = X118
| cons(X117,X115) != cons(X118,X116)
| ~ ssItem(X118)
| ~ ssItem(X117)
| ~ ssList(X116)
| ~ ssList(X115) )
& ( X116 = X115
| cons(X117,X115) != cons(X118,X116)
| ~ ssItem(X118)
| ~ ssItem(X117)
| ~ ssList(X116)
| ~ ssList(X115) ) ),
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_99,plain,
! [X119] :
( ( ssList(esk44_1(X119))
| nil = X119
| ~ ssList(X119) )
& ( ssItem(esk45_1(X119))
| nil = X119
| ~ ssList(X119) )
& ( cons(esk45_1(X119),esk44_1(X119)) = X119
| nil = X119
| ~ ssList(X119) ) ),
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_100,plain,
! [X111,X112] :
( ~ ssList(X111)
| ~ ssItem(X112)
| ssList(cons(X112,X111)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_101,plain,
! [X122,X123] :
( ~ ssList(X122)
| ~ ssItem(X123)
| nil != cons(X123,X122) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_91])])])]) ).
cnf(c_0_102,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_103,plain,
( nil = X1
| hd(app(X1,X2)) = hd(X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_104,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_105,negated_conjecture,
esk7_2(esk51_0,nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_95]),c_0_96])]) ).
cnf(c_0_106,negated_conjecture,
( esk50_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_30]),c_0_31]) ).
cnf(c_0_107,plain,
( X1 = X2
| cons(X3,X2) != cons(X4,X1)
| ~ ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_108,plain,
( cons(esk45_1(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_109,plain,
( ssItem(esk45_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_110,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_111,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_112,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_69]),c_0_104]) ).
cnf(c_0_113,negated_conjecture,
app(esk51_0,nil) = esk51_0,
inference(rw,[status(thm)],[c_0_95,c_0_105]) ).
cnf(c_0_114,negated_conjecture,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_44])]) ).
cnf(c_0_115,plain,
( esk44_1(cons(X1,X2)) = X2
| ~ ssList(esk44_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_107,c_0_108])]),c_0_109]),c_0_110]),c_0_111]) ).
cnf(c_0_116,negated_conjecture,
cons(hd(esk51_0),tl(esk51_0)) = esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_42]),c_0_49])]),c_0_114]) ).
fof(c_0_117,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_118,negated_conjecture,
( esk44_1(esk51_0) = tl(esk51_0)
| ~ ssList(esk44_1(esk51_0))
| ~ ssList(tl(esk51_0))
| ~ ssItem(hd(esk51_0)) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_119,plain,
( ssList(esk44_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
fof(c_0_120,plain,
! [X127] :
( ~ ssList(X127)
| nil = X127
| ssList(tl(X127)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_117])])]) ).
fof(c_0_121,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_122,negated_conjecture,
( esk44_1(esk51_0) = tl(esk51_0)
| ~ ssList(tl(esk51_0))
| ~ ssItem(hd(esk51_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_49])]),c_0_114]) ).
cnf(c_0_123,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
fof(c_0_124,plain,
! [X124] :
( ~ ssList(X124)
| nil = X124
| ssItem(hd(X124)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_121])])]) ).
cnf(c_0_125,negated_conjecture,
( esk44_1(esk51_0) = tl(esk51_0)
| ~ ssItem(hd(esk51_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_49])]),c_0_114]) ).
cnf(c_0_126,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
fof(c_0_127,plain,
! [X125,X126] :
( ~ ssList(X125)
| ~ ssItem(X126)
| hd(cons(X126,X125)) = X126 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
cnf(c_0_128,negated_conjecture,
esk44_1(esk51_0) = tl(esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_49])]),c_0_114]) ).
fof(c_0_129,plain,
! [X167,X168,X169,X170] :
( ( X167 = X168
| ~ frontsegP(cons(X167,X169),cons(X168,X170))
| ~ ssList(X170)
| ~ ssList(X169)
| ~ ssItem(X168)
| ~ ssItem(X167) )
& ( frontsegP(X169,X170)
| ~ frontsegP(cons(X167,X169),cons(X168,X170))
| ~ ssList(X170)
| ~ ssList(X169)
| ~ ssItem(X168)
| ~ ssItem(X167) )
& ( X167 != X168
| ~ frontsegP(X169,X170)
| frontsegP(cons(X167,X169),cons(X168,X170))
| ~ ssList(X170)
| ~ ssList(X169)
| ~ ssItem(X168)
| ~ ssItem(X167) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])])])]) ).
cnf(c_0_130,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_131,negated_conjecture,
cons(esk45_1(esk51_0),tl(esk51_0)) = esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_128]),c_0_49])]),c_0_114]) ).
cnf(c_0_132,negated_conjecture,
ssList(tl(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_128]),c_0_49])]),c_0_114]) ).
cnf(c_0_133,plain,
( frontsegP(cons(X1,X3),cons(X2,X4))
| X1 != X2
| ~ frontsegP(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_129]) ).
fof(c_0_134,plain,
! [X171] :
( ~ ssList(X171)
| frontsegP(X171,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
cnf(c_0_135,negated_conjecture,
( esk45_1(esk51_0) = hd(esk51_0)
| ~ ssItem(esk45_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132])]) ).
fof(c_0_136,plain,
! [X194] :
( ~ ssList(X194)
| segmentP(X194,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_137,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_133]) ).
cnf(c_0_138,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_139,negated_conjecture,
esk45_1(esk51_0) = hd(esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_109]),c_0_49])]),c_0_114]) ).
cnf(c_0_140,negated_conjecture,
( ~ ssList(X1)
| ~ neq(esk50_0,X1)
| ~ frontsegP(esk51_0,X1)
| ~ segmentP(X1,esk50_0)
| ~ strictorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_141,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_136]) ).
cnf(c_0_142,plain,
( frontsegP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_42])]) ).
cnf(c_0_143,negated_conjecture,
ssItem(hd(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_139]),c_0_49])]),c_0_114]) ).
cnf(c_0_144,negated_conjecture,
( ~ strictorderedP(X1)
| ~ frontsegP(esk51_0,X1)
| ~ ssList(X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_44]),c_0_44]),c_0_141]) ).
cnf(c_0_145,negated_conjecture,
frontsegP(esk51_0,cons(hd(esk51_0),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_116]),c_0_132]),c_0_143])]) ).
fof(c_0_146,plain,
! [X202] :
( ~ ssItem(X202)
| strictorderedP(cons(X202,nil)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])])]) ).
cnf(c_0_147,negated_conjecture,
( ~ strictorderedP(cons(hd(esk51_0),nil))
| ~ ssList(cons(hd(esk51_0),nil))
| ~ neq(nil,cons(hd(esk51_0),nil)) ),
inference(spm,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_148,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_149,negated_conjecture,
( ~ ssList(cons(hd(esk51_0),nil))
| ~ neq(nil,cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_143])]) ).
cnf(c_0_150,negated_conjecture,
~ neq(nil,cons(hd(esk51_0),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_110]),c_0_42]),c_0_143])]) ).
cnf(c_0_151,negated_conjecture,
( cons(hd(esk51_0),nil) = nil
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_41]),c_0_42])]) ).
cnf(c_0_152,negated_conjecture,
cons(hd(esk51_0),nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_110]),c_0_42]),c_0_143])]) ).
cnf(c_0_153,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_152]),c_0_42]),c_0_143])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC021+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:22:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.65/0.66 # Version: 3.1.0
% 1.65/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.65/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.65/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.65/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.65/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.65/0.66 # Starting sh5l with 300s (1) cores
% 1.65/0.66 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 31384 completed with status 0
% 1.65/0.66 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.65/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.65/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.65/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.65/0.66 # No SInE strategy applied
% 1.65/0.66 # Search class: FGHSF-FSLM21-MFFFFFNN
% 1.65/0.66 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.65/0.66 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 1.65/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.65/0.66 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 1.65/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 1.65/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 1.65/0.66 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 31392 completed with status 0
% 1.65/0.66 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.65/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.65/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.65/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.65/0.66 # No SInE strategy applied
% 1.65/0.66 # Search class: FGHSF-FSLM21-MFFFFFNN
% 1.65/0.66 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.65/0.66 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 1.65/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.65/0.66 # Preprocessing time : 0.004 s
% 1.65/0.66 # Presaturation interreduction done
% 1.65/0.66
% 1.65/0.66 # Proof found!
% 1.65/0.66 # SZS status Theorem
% 1.65/0.66 # SZS output start CNFRefutation
% See solution above
% 1.65/0.66 # Parsed axioms : 96
% 1.65/0.66 # Removed by relevancy pruning/SinE : 0
% 1.65/0.66 # Initial clauses : 201
% 1.65/0.66 # Removed in clause preprocessing : 2
% 1.65/0.66 # Initial clauses in saturation : 199
% 1.65/0.66 # Processed clauses : 1808
% 1.65/0.66 # ...of these trivial : 37
% 1.65/0.66 # ...subsumed : 714
% 1.65/0.66 # ...remaining for further processing : 1057
% 1.65/0.66 # Other redundant clauses eliminated : 107
% 1.65/0.66 # Clauses deleted for lack of memory : 0
% 1.65/0.66 # Backward-subsumed : 70
% 1.65/0.66 # Backward-rewritten : 136
% 1.65/0.66 # Generated clauses : 5710
% 1.65/0.66 # ...of the previous two non-redundant : 4727
% 1.65/0.66 # ...aggressively subsumed : 0
% 1.65/0.66 # Contextual simplify-reflections : 163
% 1.65/0.66 # Paramodulations : 5598
% 1.65/0.66 # Factorizations : 0
% 1.65/0.66 # NegExts : 0
% 1.65/0.66 # Equation resolutions : 113
% 1.65/0.66 # Disequality decompositions : 0
% 1.65/0.66 # Total rewrite steps : 5431
% 1.65/0.66 # ...of those cached : 5293
% 1.65/0.66 # Propositional unsat checks : 0
% 1.65/0.66 # Propositional check models : 0
% 1.65/0.66 # Propositional check unsatisfiable : 0
% 1.65/0.66 # Propositional clauses : 0
% 1.65/0.66 # Propositional clauses after purity: 0
% 1.65/0.66 # Propositional unsat core size : 0
% 1.65/0.66 # Propositional preprocessing time : 0.000
% 1.65/0.66 # Propositional encoding time : 0.000
% 1.65/0.66 # Propositional solver time : 0.000
% 1.65/0.66 # Success case prop preproc time : 0.000
% 1.65/0.66 # Success case prop encoding time : 0.000
% 1.65/0.66 # Success case prop solver time : 0.000
% 1.65/0.66 # Current number of processed clauses : 634
% 1.65/0.66 # Positive orientable unit clauses : 135
% 1.65/0.66 # Positive unorientable unit clauses: 0
% 1.65/0.66 # Negative unit clauses : 16
% 1.65/0.66 # Non-unit-clauses : 483
% 1.65/0.66 # Current number of unprocessed clauses: 3093
% 1.65/0.66 # ...number of literals in the above : 16594
% 1.65/0.66 # Current number of archived formulas : 0
% 1.65/0.66 # Current number of archived clauses : 400
% 1.65/0.66 # Clause-clause subsumption calls (NU) : 69778
% 1.65/0.66 # Rec. Clause-clause subsumption calls : 22341
% 1.65/0.66 # Non-unit clause-clause subsumptions : 781
% 1.65/0.66 # Unit Clause-clause subsumption calls : 3119
% 1.65/0.66 # Rewrite failures with RHS unbound : 0
% 1.65/0.66 # BW rewrite match attempts : 65
% 1.65/0.66 # BW rewrite match successes : 49
% 1.65/0.66 # Condensation attempts : 0
% 1.65/0.66 # Condensation successes : 0
% 1.65/0.66 # Termbank termtop insertions : 127627
% 1.65/0.66 # Search garbage collected termcells : 4320
% 1.65/0.66
% 1.65/0.66 # -------------------------------------------------
% 1.65/0.66 # User time : 0.160 s
% 1.65/0.66 # System time : 0.011 s
% 1.65/0.66 # Total time : 0.171 s
% 1.65/0.66 # Maximum resident set size: 2468 pages
% 1.65/0.66
% 1.65/0.66 # -------------------------------------------------
% 1.65/0.66 # User time : 0.771 s
% 1.65/0.66 # System time : 0.039 s
% 1.65/0.66 # Total time : 0.810 s
% 1.65/0.66 # Maximum resident set size: 1820 pages
% 1.65/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------