TSTP Solution File: SWC368+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC368+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:42:48 EDT 2023
% Result : Theorem 20.08s 3.01s
% Output : CNFRefutation 20.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 83 ( 21 unt; 0 def)
% Number of atoms : 340 ( 107 equ)
% Maximal formula atoms : 29 ( 4 avg)
% Number of connectives : 434 ( 177 ~; 181 |; 35 &)
% ( 3 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 138 ( 0 sgn; 65 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax79) ).
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/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax82) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax26) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax28) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| segmentP(X2,X1)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',co1) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax17) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax83) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax80) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax84) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax56) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax81) ).
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/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax7) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p',ax3) ).
fof(c_0_13,plain,
! [X86,X87,X88] :
( ~ ssList(X86)
| ~ ssList(X87)
| ~ ssList(X88)
| app(X88,X87) != app(X86,X87)
| X88 = X86 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])]) ).
fof(c_0_14,plain,
! [X92,X93,X94] :
( ~ ssList(X92)
| ~ ssList(X93)
| ~ ssList(X94)
| app(app(X92,X93),X94) = app(X92,app(X93,X94)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
fof(c_0_15,plain,
! [X83,X84] :
( ~ ssList(X83)
| ~ ssList(X84)
| ssList(app(X83,X84)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_16,plain,
! [X85] :
( ~ ssList(X85)
| app(nil,X85) = X85 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| segmentP(X2,X1)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_18,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X3,X2) != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
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_14]) ).
cnf(c_0_20,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_23,negated_conjecture,
! [X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ~ segmentP(esk2_0,esk1_0)
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk4_0
| ~ ssItem(X12)
| esk5_0 = X12
| ~ memberP(esk4_0,X12)
| ~ leq(X12,esk5_0) )
& ( nil = esk3_0
| ~ ssItem(X12)
| esk5_0 = X12
| ~ memberP(esk4_0,X12)
| ~ leq(X12,esk5_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])]) ).
cnf(c_0_24,plain,
( X1 = app(X2,X3)
| app(X1,X4) != app(X2,app(X3,X4))
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_28,plain,
! [X95,X96] :
( ( nil = X96
| nil != app(X95,X96)
| ~ ssList(X96)
| ~ ssList(X95) )
& ( nil = X95
| nil != app(X95,X96)
| ~ ssList(X96)
| ~ ssList(X95) )
& ( nil != X96
| nil != X95
| nil = app(X95,X96)
| ~ ssList(X96)
| ~ ssList(X95) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_29,plain,
( X1 = app(nil,X2)
| app(X1,X3) != app(X2,X3)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,plain,
! [X89,X90,X91] :
( ~ ssList(X89)
| ~ ssList(X90)
| ~ ssList(X91)
| app(X90,X91) != app(X90,X89)
| X91 = X89 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])]) ).
cnf(c_0_32,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_33,plain,
! [X97] :
( ~ ssList(X97)
| app(X97,nil) = X97 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_36,plain,
! [X71,X72,X73,X74] :
( ~ ssList(X71)
| ~ ssList(X72)
| ~ ssList(X73)
| ~ ssList(X74)
| ~ segmentP(X71,X72)
| segmentP(app(app(X73,X71),X74),X72) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])]) ).
cnf(c_0_37,negated_conjecture,
( X1 = app(nil,X2)
| app(X1,esk4_0) != app(X2,esk4_0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_38,plain,
! [X57,X58] :
( ~ ssList(X57)
| ~ ssItem(X58)
| cons(X58,X57) = app(cons(X58,nil),X57) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
fof(c_0_39,plain,
! [X59,X60,X63,X64] :
( ( ssList(esk12_2(X59,X60))
| ~ segmentP(X59,X60)
| ~ ssList(X60)
| ~ ssList(X59) )
& ( ssList(esk13_2(X59,X60))
| ~ segmentP(X59,X60)
| ~ ssList(X60)
| ~ ssList(X59) )
& ( app(app(esk12_2(X59,X60),X60),esk13_2(X59,X60)) = X59
| ~ segmentP(X59,X60)
| ~ ssList(X60)
| ~ ssList(X59) )
& ( ~ ssList(X63)
| ~ ssList(X64)
| app(app(X63,X60),X64) != X59
| segmentP(X59,X60)
| ~ ssList(X60)
| ~ ssList(X59) ) ),
inference(distribute,[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_40,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_32])]),c_0_22])]) ).
cnf(c_0_42,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_20]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
( segmentP(app(app(X3,X1),X4),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( app(nil,X1) = esk4_0
| app(esk4_0,esk4_0) != app(X1,esk4_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_30]) ).
cnf(c_0_47,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_49,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_50,plain,
! [X31,X32,X35,X36] :
( ( ssList(esk8_2(X31,X32))
| ~ memberP(X31,X32)
| ~ ssItem(X32)
| ~ ssList(X31) )
& ( ssList(esk9_2(X31,X32))
| ~ memberP(X31,X32)
| ~ ssItem(X32)
| ~ ssList(X31) )
& ( app(esk8_2(X31,X32),cons(X32,esk9_2(X31,X32))) = X31
| ~ memberP(X31,X32)
| ~ ssItem(X32)
| ~ ssList(X31) )
& ( ~ ssList(X35)
| ~ ssList(X36)
| app(X35,cons(X32,X36)) != X31
| memberP(X31,X32)
| ~ ssItem(X32)
| ~ ssList(X31) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])]) ).
cnf(c_0_51,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_39]) ).
cnf(c_0_52,plain,
( X1 = nil
| app(nil,X1) != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_22])]) ).
cnf(c_0_53,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_19]),c_0_22])]),c_0_20]) ).
cnf(c_0_54,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_41]),c_0_22])]) ).
cnf(c_0_55,negated_conjecture,
( app(nil,X1) = esk3_0
| app(esk3_0,esk4_0) != app(X1,esk4_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_44]) ).
cnf(c_0_56,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_57,plain,
( segmentP(app(X1,X2),X3)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_21]),c_0_22])]) ).
cnf(c_0_58,negated_conjecture,
app(nil,esk4_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_30])]) ).
cnf(c_0_59,negated_conjecture,
( cons(esk5_0,X1) = app(esk3_0,X1)
| esk3_0 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_60,plain,
( ssList(esk9_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_61,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_51]) ).
cnf(c_0_62,plain,
( app(X1,nil) = nil
| app(nil,X1) != nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_22])]),c_0_54]) ).
cnf(c_0_63,negated_conjecture,
app(nil,esk3_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_55]),c_0_44])]) ).
cnf(c_0_64,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_27]),c_0_35]) ).
cnf(c_0_65,negated_conjecture,
( segmentP(esk4_0,X1)
| ~ segmentP(nil,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_30]),c_0_22])]) ).
cnf(c_0_66,negated_conjecture,
( cons(esk5_0,esk9_2(X1,X2)) = app(esk3_0,esk9_2(X1,X2))
| esk3_0 = nil
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( nil = esk3_0
| memberP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_68,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_21]),c_0_22])]),c_0_20]) ).
cnf(c_0_69,negated_conjecture,
( app(esk3_0,nil) = nil
| esk3_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_44])]) ).
cnf(c_0_70,negated_conjecture,
~ segmentP(nil,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_44])]) ).
cnf(c_0_71,negated_conjecture,
( cons(esk5_0,esk9_2(esk4_0,esk5_0)) = app(esk3_0,esk9_2(esk4_0,esk5_0))
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_30])]),c_0_49]) ).
cnf(c_0_72,negated_conjecture,
esk3_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_44]),c_0_22])]),c_0_70]) ).
cnf(c_0_73,plain,
( app(esk8_2(X1,X2),cons(X2,esk9_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_74,negated_conjecture,
cons(esk5_0,esk9_2(esk4_0,esk5_0)) = app(esk3_0,esk9_2(esk4_0,esk5_0)),
inference(sr,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_67,c_0_72]) ).
cnf(c_0_76,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_49,c_0_72]) ).
cnf(c_0_77,plain,
( segmentP(app(X1,app(X2,X3)),X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_19]),c_0_43]) ).
cnf(c_0_78,negated_conjecture,
app(esk8_2(esk4_0,esk5_0),app(esk3_0,esk9_2(esk4_0,esk5_0))) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_30]),c_0_76])]) ).
cnf(c_0_79,negated_conjecture,
( ~ ssList(esk9_2(esk4_0,esk5_0))
| ~ ssList(esk8_2(esk4_0,esk5_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_44])]),c_0_64]) ).
cnf(c_0_80,negated_conjecture,
~ ssList(esk8_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_60]),c_0_75]),c_0_30]),c_0_76])]) ).
cnf(c_0_81,plain,
( ssList(esk8_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
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_80,c_0_81]),c_0_75]),c_0_30]),c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC368+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n032.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 01:43:49 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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/tmp/tmp.xU5cxv1O5F/E---3.1_30786.p
% 20.08/3.01 # Version: 3.1pre001
% 20.08/3.01 # Preprocessing class: FSLSSMSSSSSNFFN.
% 20.08/3.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.08/3.01 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 20.08/3.01 # Starting new_bool_3 with 300s (1) cores
% 20.08/3.01 # Starting new_bool_1 with 300s (1) cores
% 20.08/3.01 # Starting sh5l with 300s (1) cores
% 20.08/3.01 # new_bool_3 with pid 30865 completed with status 0
% 20.08/3.01 # Result found by new_bool_3
% 20.08/3.01 # Preprocessing class: FSLSSMSSSSSNFFN.
% 20.08/3.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.08/3.01 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 20.08/3.01 # Starting new_bool_3 with 300s (1) cores
% 20.08/3.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 20.08/3.01 # Search class: FGHSF-FFMM21-MFFFFFNN
% 20.08/3.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 20.08/3.01 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 20.08/3.01 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30869 completed with status 0
% 20.08/3.01 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 20.08/3.01 # Preprocessing class: FSLSSMSSSSSNFFN.
% 20.08/3.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.08/3.01 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 20.08/3.01 # Starting new_bool_3 with 300s (1) cores
% 20.08/3.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 20.08/3.01 # Search class: FGHSF-FFMM21-MFFFFFNN
% 20.08/3.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 20.08/3.01 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 20.08/3.01 # Preprocessing time : 0.001 s
% 20.08/3.01 # Presaturation interreduction done
% 20.08/3.01
% 20.08/3.01 # Proof found!
% 20.08/3.01 # SZS status Theorem
% 20.08/3.01 # SZS output start CNFRefutation
% See solution above
% 20.08/3.01 # Parsed axioms : 96
% 20.08/3.01 # Removed by relevancy pruning/SinE : 59
% 20.08/3.01 # Initial clauses : 71
% 20.08/3.01 # Removed in clause preprocessing : 0
% 20.08/3.01 # Initial clauses in saturation : 71
% 20.08/3.01 # Processed clauses : 11916
% 20.08/3.01 # ...of these trivial : 488
% 20.08/3.01 # ...subsumed : 8344
% 20.08/3.01 # ...remaining for further processing : 3084
% 20.08/3.01 # Other redundant clauses eliminated : 95
% 20.08/3.01 # Clauses deleted for lack of memory : 0
% 20.08/3.01 # Backward-subsumed : 423
% 20.08/3.01 # Backward-rewritten : 406
% 20.08/3.01 # Generated clauses : 133640
% 20.08/3.01 # ...of the previous two non-redundant : 129472
% 20.08/3.01 # ...aggressively subsumed : 0
% 20.08/3.01 # Contextual simplify-reflections : 1068
% 20.08/3.01 # Paramodulations : 133224
% 20.08/3.01 # Factorizations : 2
% 20.08/3.01 # NegExts : 0
% 20.08/3.01 # Equation resolutions : 135
% 20.08/3.01 # Total rewrite steps : 90420
% 20.08/3.01 # Propositional unsat checks : 0
% 20.08/3.01 # Propositional check models : 0
% 20.08/3.01 # Propositional check unsatisfiable : 0
% 20.08/3.01 # Propositional clauses : 0
% 20.08/3.01 # Propositional clauses after purity: 0
% 20.08/3.01 # Propositional unsat core size : 0
% 20.08/3.01 # Propositional preprocessing time : 0.000
% 20.08/3.01 # Propositional encoding time : 0.000
% 20.08/3.01 # Propositional solver time : 0.000
% 20.08/3.01 # Success case prop preproc time : 0.000
% 20.08/3.01 # Success case prop encoding time : 0.000
% 20.08/3.01 # Success case prop solver time : 0.000
% 20.08/3.01 # Current number of processed clauses : 1902
% 20.08/3.01 # Positive orientable unit clauses : 274
% 20.08/3.01 # Positive unorientable unit clauses: 0
% 20.08/3.01 # Negative unit clauses : 234
% 20.08/3.01 # Non-unit-clauses : 1394
% 20.08/3.01 # Current number of unprocessed clauses: 111500
% 20.08/3.01 # ...number of literals in the above : 583352
% 20.08/3.01 # Current number of archived formulas : 0
% 20.08/3.01 # Current number of archived clauses : 1176
% 20.08/3.01 # Clause-clause subsumption calls (NU) : 333732
% 20.08/3.01 # Rec. Clause-clause subsumption calls : 111892
% 20.08/3.01 # Non-unit clause-clause subsumptions : 6896
% 20.08/3.01 # Unit Clause-clause subsumption calls : 19225
% 20.08/3.01 # Rewrite failures with RHS unbound : 0
% 20.08/3.01 # BW rewrite match attempts : 1794
% 20.08/3.01 # BW rewrite match successes : 97
% 20.08/3.01 # Condensation attempts : 0
% 20.08/3.01 # Condensation successes : 0
% 20.08/3.01 # Termbank termtop insertions : 3255132
% 20.08/3.01
% 20.08/3.01 # -------------------------------------------------
% 20.08/3.01 # User time : 2.451 s
% 20.08/3.01 # System time : 0.072 s
% 20.08/3.01 # Total time : 2.523 s
% 20.08/3.01 # Maximum resident set size: 2036 pages
% 20.08/3.01
% 20.08/3.01 # -------------------------------------------------
% 20.08/3.01 # User time : 2.453 s
% 20.08/3.01 # System time : 0.074 s
% 20.08/3.01 # Total time : 2.527 s
% 20.08/3.01 # Maximum resident set size: 1800 pages
% 20.08/3.01 % E---3.1 exiting
%------------------------------------------------------------------------------