TSTP Solution File: SWC055+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC055+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:39:05 EDT 2023
% Result : Theorem 18.22s 2.79s
% Output : CNFRefutation 18.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 20
% Syntax : Number of formulae : 146 ( 27 unt; 0 def)
% Number of atoms : 559 ( 172 equ)
% Maximal formula atoms : 42 ( 3 avg)
% Number of connectives : 716 ( 303 ~; 305 |; 49 &)
% ( 4 <=>; 55 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 215 ( 0 sgn; 96 !; 8 ?)
% 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.Nx8bUruJLk/E---3.1_12637.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.Nx8bUruJLk/E---3.1_12637.p',ax82) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax26) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax28) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& neq(X7,nil)
& segmentP(X2,X7)
& segmentP(X1,X7) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax18) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax27) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax81) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.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.Nx8bUruJLk/E---3.1_12637.p',ax80) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax84) ).
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.Nx8bUruJLk/E---3.1_12637.p',ax7) ).
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.Nx8bUruJLk/E---3.1_12637.p',ax56) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax16) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax15) ).
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.Nx8bUruJLk/E---3.1_12637.p',ax3) ).
fof(ax54,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax54) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax55) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p',ax53) ).
fof(c_0_20,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_21,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_22,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_23,plain,
! [X85] :
( ~ ssList(X85)
| app(nil,X85) = X85 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& neq(X7,nil)
& segmentP(X2,X7)
& segmentP(X1,X7) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_25,plain,
! [X72,X73] :
( ~ ssList(X72)
| ~ ssItem(X73)
| cons(X73,X72) != X72 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
fof(c_0_26,plain,
! [X78,X79,X80] :
( ~ ssList(X78)
| ~ ssList(X79)
| ~ ssItem(X80)
| cons(X80,app(X79,X78)) = app(cons(X80,X79),X78) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
cnf(c_0_27,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X3,X2) != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_32,negated_conjecture,
! [X13,X14] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_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(X13)
| esk5_0 = X13
| ~ memberP(esk4_0,X13)
| ~ leq(esk5_0,X13) )
& ( nil = esk3_0
| ~ ssItem(X13)
| esk5_0 = X13
| ~ memberP(esk4_0,X13)
| ~ leq(esk5_0,X13) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk2_0,X14)
| ~ segmentP(esk1_0,X14)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk2_0,X14)
| ~ segmentP(esk1_0,X14)
| nil != esk1_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_24])])])])]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_35,plain,
! [X81,X82] :
( ~ ssList(X81)
| ~ ssItem(X82)
| cons(X82,X81) = app(cons(X82,nil),X81) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
fof(c_0_36,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_37,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_27,c_0_28]),c_0_29]) ).
cnf(c_0_38,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_28,c_0_30]),c_0_31])]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
( app(cons(X1,X2),X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29]) ).
cnf(c_0_42,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_43,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_44,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_45,plain,
! [X97] :
( ~ ssList(X97)
| app(X97,nil) = X97 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_46,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_37,c_0_38]),c_0_31])]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_31])]) ).
fof(c_0_49,plain,
! [X15,X16,X19,X20] :
( ( ssList(esk6_2(X15,X16))
| ~ segmentP(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) )
& ( ssList(esk7_2(X15,X16))
| ~ segmentP(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) )
& ( app(app(esk6_2(X15,X16),X16),esk7_2(X15,X16)) = X15
| ~ segmentP(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) )
& ( ~ ssList(X19)
| ~ ssList(X20)
| app(app(X19,X16),X20) != X15
| segmentP(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) ) ),
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_50,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])]),c_0_31])]) ).
cnf(c_0_52,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_28]),c_0_29]) ).
cnf(c_0_54,negated_conjecture,
( X1 = app(nil,X2)
| app(X1,esk4_0) != app(X2,esk4_0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,plain,
( app(cons(X1,X2),X3) != app(nil,app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_34]),c_0_29]) ).
cnf(c_0_56,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_49]) ).
fof(c_0_57,plain,
! [X27,X28,X29,X30] :
( ~ ssList(X27)
| ~ ssList(X28)
| ~ ssList(X29)
| ~ ssList(X30)
| ~ segmentP(X27,X28)
| segmentP(app(app(X29,X27),X30),X28) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])]) ).
cnf(c_0_58,plain,
( X1 = nil
| app(nil,X1) != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_31])]) ).
cnf(c_0_59,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_52,c_0_28]),c_0_31])]),c_0_29]) ).
cnf(c_0_60,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_31])]) ).
cnf(c_0_61,negated_conjecture,
( app(nil,X1) = esk4_0
| app(esk4_0,esk4_0) != app(X1,esk4_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_47]) ).
cnf(c_0_62,plain,
( cons(X1,X2) != app(nil,app(nil,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_42]),c_0_31])]) ).
cnf(c_0_63,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_64,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_66,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_67,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_68,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_56]) ).
cnf(c_0_69,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_57]) ).
cnf(c_0_70,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_58,c_0_59]),c_0_31])]),c_0_60]) ).
cnf(c_0_71,negated_conjecture,
app(nil,esk4_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_61]),c_0_47])]) ).
cnf(c_0_72,plain,
( cons(X1,app(X2,nil)) != app(nil,app(nil,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_59]),c_0_31])]),c_0_60]) ).
cnf(c_0_73,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_42,c_0_63]),c_0_64]) ).
cnf(c_0_74,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_66]),c_0_40]) ).
cnf(c_0_75,negated_conjecture,
( neq(esk4_0,nil)
| esk3_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_40]),c_0_66]) ).
cnf(c_0_76,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_52]),c_0_31])]),c_0_29]) ).
cnf(c_0_77,plain,
( segmentP(app(nil,X1),X2)
| ~ segmentP(nil,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_51]),c_0_31])]) ).
cnf(c_0_78,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_68,c_0_30]),c_0_31])]),c_0_29]) ).
cnf(c_0_79,negated_conjecture,
( app(esk4_0,nil) = nil
| esk4_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_47])]) ).
fof(c_0_80,plain,
! [X70,X71] :
( ~ ssList(X70)
| ~ ssItem(X71)
| ssList(cons(X71,X70)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_81,plain,
( app(cons(X1,X2),nil) != app(nil,app(nil,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_34]),c_0_31])]) ).
cnf(c_0_82,negated_conjecture,
( cons(esk5_0,esk4_0) = app(esk3_0,esk4_0)
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_73,c_0_47]) ).
cnf(c_0_83,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_84,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,esk4_0)
| ~ segmentP(esk4_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_47])]) ).
cnf(c_0_85,negated_conjecture,
segmentP(esk4_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_71]),c_0_47]),c_0_31])]) ).
cnf(c_0_86,plain,
( segmentP(X1,X2)
| ~ segmentP(nil,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_77,c_0_30]) ).
cnf(c_0_87,negated_conjecture,
( segmentP(nil,esk4_0)
| esk4_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_47]),c_0_31])]) ).
cnf(c_0_88,negated_conjecture,
( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_89,negated_conjecture,
( nil = esk4_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_90,plain,
! [X35,X36] :
( ( ~ neq(X35,X36)
| X35 != X36
| ~ ssList(X36)
| ~ ssList(X35) )
& ( X35 = X36
| neq(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
fof(c_0_91,plain,
! [X55,X56,X59,X60] :
( ( ssList(esk10_2(X55,X56))
| ~ memberP(X55,X56)
| ~ ssItem(X56)
| ~ ssList(X55) )
& ( ssList(esk11_2(X55,X56))
| ~ memberP(X55,X56)
| ~ ssItem(X56)
| ~ ssList(X55) )
& ( app(esk10_2(X55,X56),cons(X56,esk11_2(X55,X56))) = X55
| ~ memberP(X55,X56)
| ~ ssItem(X56)
| ~ ssList(X55) )
& ( ~ ssList(X59)
| ~ ssList(X60)
| app(X59,cons(X56,X60)) != X55
| memberP(X55,X56)
| ~ ssItem(X56)
| ~ ssList(X55) ) ),
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_92,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_52]),c_0_31])]) ).
cnf(c_0_93,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_94,negated_conjecture,
( esk3_0 = nil
| app(app(esk3_0,esk4_0),nil) != app(nil,app(nil,esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_47])]),c_0_64]) ).
cnf(c_0_95,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_83,c_0_66]) ).
cnf(c_0_96,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).
cnf(c_0_97,negated_conjecture,
( segmentP(X1,esk4_0)
| esk4_0 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_47])]) ).
cnf(c_0_98,negated_conjecture,
( esk4_0 = nil
| esk3_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_88]),c_0_31])]),c_0_89]) ).
cnf(c_0_99,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_100,plain,
( ssList(esk11_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_101,negated_conjecture,
( app(app(esk3_0,esk4_0),nil) = app(esk3_0,esk4_0)
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_82]),c_0_47])]),c_0_64]) ).
cnf(c_0_102,negated_conjecture,
( esk3_0 = nil
| ssList(app(esk3_0,esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_82]),c_0_47])]),c_0_64]) ).
cnf(c_0_103,negated_conjecture,
( esk3_0 = nil
| app(esk3_0,app(esk4_0,nil)) != app(nil,app(nil,esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_28]),c_0_31]),c_0_47]),c_0_95])]) ).
cnf(c_0_104,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_95])]),c_0_98]) ).
cnf(c_0_105,negated_conjecture,
( cons(esk5_0,nil) = app(esk3_0,nil)
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_73,c_0_31]) ).
cnf(c_0_106,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_107,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_31]) ).
cnf(c_0_108,negated_conjecture,
( cons(esk5_0,esk11_2(X1,X2)) = app(esk3_0,esk11_2(X1,X2))
| esk3_0 = nil
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_100]) ).
cnf(c_0_109,negated_conjecture,
( nil = esk3_0
| memberP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_110,plain,
! [X24,X25] :
( ~ ssList(X24)
| ~ ssList(X25)
| ~ segmentP(X24,X25)
| ~ segmentP(X25,X24)
| X24 = X25 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])]) ).
cnf(c_0_111,negated_conjecture,
( esk3_0 = nil
| segmentP(app(esk3_0,esk4_0),esk4_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_101]),c_0_47]),c_0_31]),c_0_95])]),c_0_102]) ).
cnf(c_0_112,negated_conjecture,
app(esk3_0,app(esk4_0,nil)) != esk4_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_71]),c_0_71]),c_0_104]) ).
cnf(c_0_113,negated_conjecture,
app(app(esk3_0,esk4_0),nil) = app(esk3_0,esk4_0),
inference(sr,[status(thm)],[c_0_101,c_0_104]) ).
cnf(c_0_114,negated_conjecture,
( app(esk3_0,nil) = esk3_0
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_63,c_0_105]) ).
cnf(c_0_115,negated_conjecture,
( esk4_0 = nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_40]),c_0_66]),c_0_40]) ).
cnf(c_0_116,negated_conjecture,
( esk3_0 = nil
| neq(esk3_0,nil) ),
inference(spm,[status(thm)],[c_0_107,c_0_95]) ).
fof(c_0_117,plain,
! [X26] :
( ~ ssList(X26)
| segmentP(X26,X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
fof(c_0_118,plain,
! [X21,X22,X23] :
( ~ ssList(X21)
| ~ ssList(X22)
| ~ ssList(X23)
| ~ segmentP(X21,X22)
| ~ segmentP(X22,X23)
| segmentP(X21,X23) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])]) ).
cnf(c_0_119,plain,
( app(esk10_2(X1,X2),cons(X2,esk11_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_120,plain,
( ssList(esk10_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_121,negated_conjecture,
( cons(esk5_0,esk11_2(esk4_0,esk5_0)) = app(esk3_0,esk11_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_108,c_0_109]),c_0_47])]),c_0_64]) ).
cnf(c_0_122,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_110]) ).
cnf(c_0_123,negated_conjecture,
segmentP(app(esk3_0,esk4_0),esk4_0),
inference(sr,[status(thm)],[c_0_111,c_0_104]) ).
cnf(c_0_124,negated_conjecture,
ssList(app(esk3_0,esk4_0)),
inference(sr,[status(thm)],[c_0_102,c_0_104]) ).
cnf(c_0_125,negated_conjecture,
app(esk3_0,esk4_0) != esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_52]),c_0_47])]) ).
cnf(c_0_126,negated_conjecture,
app(esk3_0,app(esk4_0,nil)) = app(esk3_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_28,c_0_113]),c_0_31]),c_0_47]),c_0_95])]) ).
cnf(c_0_127,negated_conjecture,
app(esk3_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_114,c_0_104]) ).
cnf(c_0_128,negated_conjecture,
( esk4_0 = nil
| ~ segmentP(esk3_0,esk3_0)
| ~ segmentP(esk4_0,esk3_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_95])]),c_0_98]) ).
cnf(c_0_129,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_117]) ).
cnf(c_0_130,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_118]) ).
cnf(c_0_131,plain,
( segmentP(X1,cons(X2,esk11_2(X1,X2)))
| ~ memberP(X1,X2)
| ~ ssList(cons(X2,esk11_2(X1,X2)))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_119]),c_0_120]) ).
cnf(c_0_132,negated_conjecture,
cons(esk5_0,esk11_2(esk4_0,esk5_0)) = app(esk3_0,esk11_2(esk4_0,esk5_0)),
inference(sr,[status(thm)],[c_0_121,c_0_104]) ).
cnf(c_0_133,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_109,c_0_104]) ).
cnf(c_0_134,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_64,c_0_104]) ).
cnf(c_0_135,negated_conjecture,
~ segmentP(esk4_0,app(esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_124]),c_0_47])]),c_0_125]) ).
cnf(c_0_136,negated_conjecture,
( app(esk3_0,esk4_0) = esk3_0
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_79]),c_0_127]) ).
cnf(c_0_137,negated_conjecture,
( esk4_0 = nil
| ~ segmentP(esk4_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_95])]) ).
cnf(c_0_138,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_34]),c_0_29]) ).
cnf(c_0_139,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_63,c_0_104]) ).
cnf(c_0_140,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_78]),c_0_29]) ).
cnf(c_0_141,negated_conjecture,
( segmentP(esk4_0,app(esk3_0,esk11_2(esk4_0,esk5_0)))
| ~ ssList(app(esk3_0,esk11_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_131,c_0_132]),c_0_133]),c_0_47]),c_0_134])]) ).
cnf(c_0_142,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_137]) ).
cnf(c_0_143,negated_conjecture,
( ssList(app(esk3_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_31]),c_0_134])]) ).
cnf(c_0_144,negated_conjecture,
~ ssList(esk11_2(esk4_0,esk5_0)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_95]),c_0_47])]),c_0_142]),c_0_143]) ).
cnf(c_0_145,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_144,c_0_100]),c_0_133]),c_0_47]),c_0_134])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC055+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:07:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.Nx8bUruJLk/E---3.1_12637.p
% 18.22/2.79 # Version: 3.1pre001
% 18.22/2.79 # Preprocessing class: FSLSSMSSSSSNFFN.
% 18.22/2.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.22/2.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 18.22/2.79 # Starting new_bool_3 with 300s (1) cores
% 18.22/2.79 # Starting new_bool_1 with 300s (1) cores
% 18.22/2.79 # Starting sh5l with 300s (1) cores
% 18.22/2.79 # new_bool_3 with pid 12716 completed with status 0
% 18.22/2.79 # Result found by new_bool_3
% 18.22/2.79 # Preprocessing class: FSLSSMSSSSSNFFN.
% 18.22/2.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.22/2.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 18.22/2.79 # Starting new_bool_3 with 300s (1) cores
% 18.22/2.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 18.22/2.79 # Search class: FGHSF-FFMM21-MFFFFFNN
% 18.22/2.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 18.22/2.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 18.22/2.79 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12719 completed with status 0
% 18.22/2.79 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 18.22/2.79 # Preprocessing class: FSLSSMSSSSSNFFN.
% 18.22/2.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.22/2.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 18.22/2.79 # Starting new_bool_3 with 300s (1) cores
% 18.22/2.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 18.22/2.79 # Search class: FGHSF-FFMM21-MFFFFFNN
% 18.22/2.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 18.22/2.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 18.22/2.79 # Preprocessing time : 0.002 s
% 18.22/2.79 # Presaturation interreduction done
% 18.22/2.79
% 18.22/2.79 # Proof found!
% 18.22/2.79 # SZS status Theorem
% 18.22/2.79 # SZS output start CNFRefutation
% See solution above
% 18.22/2.79 # Parsed axioms : 96
% 18.22/2.79 # Removed by relevancy pruning/SinE : 57
% 18.22/2.79 # Initial clauses : 78
% 18.22/2.79 # Removed in clause preprocessing : 0
% 18.22/2.79 # Initial clauses in saturation : 78
% 18.22/2.79 # Processed clauses : 14116
% 18.22/2.79 # ...of these trivial : 539
% 18.22/2.79 # ...subsumed : 9152
% 18.22/2.79 # ...remaining for further processing : 4425
% 18.22/2.79 # Other redundant clauses eliminated : 47
% 18.22/2.79 # Clauses deleted for lack of memory : 0
% 18.22/2.79 # Backward-subsumed : 775
% 18.22/2.79 # Backward-rewritten : 316
% 18.22/2.79 # Generated clauses : 191283
% 18.22/2.79 # ...of the previous two non-redundant : 187924
% 18.22/2.79 # ...aggressively subsumed : 0
% 18.22/2.79 # Contextual simplify-reflections : 1045
% 18.22/2.79 # Paramodulations : 190737
% 18.22/2.79 # Factorizations : 0
% 18.22/2.79 # NegExts : 0
% 18.22/2.79 # Equation resolutions : 79
% 18.22/2.79 # Total rewrite steps : 109200
% 18.22/2.79 # Propositional unsat checks : 0
% 18.22/2.79 # Propositional check models : 0
% 18.22/2.79 # Propositional check unsatisfiable : 0
% 18.22/2.79 # Propositional clauses : 0
% 18.22/2.79 # Propositional clauses after purity: 0
% 18.22/2.79 # Propositional unsat core size : 0
% 18.22/2.79 # Propositional preprocessing time : 0.000
% 18.22/2.79 # Propositional encoding time : 0.000
% 18.22/2.79 # Propositional solver time : 0.000
% 18.22/2.79 # Success case prop preproc time : 0.000
% 18.22/2.79 # Success case prop encoding time : 0.000
% 18.22/2.79 # Success case prop solver time : 0.000
% 18.22/2.79 # Current number of processed clauses : 2784
% 18.22/2.79 # Positive orientable unit clauses : 416
% 18.22/2.79 # Positive unorientable unit clauses: 0
% 18.22/2.79 # Negative unit clauses : 348
% 18.22/2.79 # Non-unit-clauses : 2020
% 18.22/2.79 # Current number of unprocessed clauses: 168523
% 18.22/2.79 # ...number of literals in the above : 668722
% 18.22/2.79 # Current number of archived formulas : 0
% 18.22/2.79 # Current number of archived clauses : 1633
% 18.22/2.79 # Clause-clause subsumption calls (NU) : 512800
% 18.22/2.79 # Rec. Clause-clause subsumption calls : 186163
% 18.22/2.79 # Non-unit clause-clause subsumptions : 7438
% 18.22/2.79 # Unit Clause-clause subsumption calls : 46673
% 18.22/2.79 # Rewrite failures with RHS unbound : 0
% 18.22/2.79 # BW rewrite match attempts : 2461
% 18.22/2.79 # BW rewrite match successes : 92
% 18.22/2.79 # Condensation attempts : 0
% 18.22/2.79 # Condensation successes : 0
% 18.22/2.79 # Termbank termtop insertions : 4997756
% 18.22/2.79
% 18.22/2.79 # -------------------------------------------------
% 18.22/2.79 # User time : 2.155 s
% 18.22/2.79 # System time : 0.080 s
% 18.22/2.79 # Total time : 2.236 s
% 18.22/2.79 # Maximum resident set size: 2068 pages
% 18.22/2.79
% 18.22/2.79 # -------------------------------------------------
% 18.22/2.79 # User time : 2.158 s
% 18.22/2.79 # System time : 0.082 s
% 18.22/2.79 # Total time : 2.240 s
% 18.22/2.79 # Maximum resident set size: 1800 pages
% 18.22/2.79 % E---3.1 exiting
% 18.22/2.79 % E---3.1 exiting
%------------------------------------------------------------------------------