TSTP Solution File: SWC113+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC113+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:41:33 EDT 2023
% Result : Theorem 398.66s 51.81s
% Output : CNFRefutation 398.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 21
% Syntax : Number of formulae : 154 ( 27 unt; 0 def)
% Number of atoms : 582 ( 181 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 747 ( 319 ~; 326 |; 45 &)
% ( 5 <=>; 52 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 231 ( 0 sgn; 97 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax18) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.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/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax82) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax26) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax28) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax17) ).
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/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax19) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax81) ).
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/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax27) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax84) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax83) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax16) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax38) ).
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/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax7) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax36) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax20) ).
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/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax3) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax53) ).
fof(ax54,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p',ax54) ).
fof(c_0_21,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) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_22,negated_conjecture,
( 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) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
fof(c_0_23,plain,
! [X54,X55] :
( ~ ssList(X54)
| ~ ssItem(X55)
| cons(X55,X54) != X54 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_24,negated_conjecture,
( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( nil = esk4_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X70,X71,X72] :
( ~ ssList(X70)
| ~ ssList(X71)
| ~ ssList(X72)
| app(X72,X71) != app(X70,X71)
| X72 = X70 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])]) ).
fof(c_0_29,plain,
! [X76,X77,X78] :
( ~ ssList(X76)
| ~ ssList(X77)
| ~ ssList(X78)
| app(app(X76,X77),X78) = app(X76,app(X77,X78)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
fof(c_0_30,plain,
! [X67,X68] :
( ~ ssList(X67)
| ~ ssList(X68)
| ssList(app(X67,X68)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_31,plain,
! [X69] :
( ~ ssList(X69)
| app(nil,X69) = X69 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_32,plain,
! [X32,X33] :
( ( ~ neq(X32,X33)
| X32 != X33
| ~ ssList(X33)
| ~ ssList(X32) )
& ( X32 = X33
| neq(X32,X33)
| ~ ssList(X33)
| ~ ssList(X32) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| esk2_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_35,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_36,negated_conjecture,
( esk2_0 = nil
| ssItem(esk5_0) ),
inference(rw,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_37,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X3,X2) != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_43,negated_conjecture,
( esk2_0 = nil
| esk1_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),c_0_36]) ).
cnf(c_0_44,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_37,c_0_38]),c_0_39]) ).
cnf(c_0_45,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_38,c_0_40]),c_0_35])]) ).
cnf(c_0_46,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( neq(nil,nil)
| esk1_0 != nil ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_50,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_44,c_0_45]),c_0_35])]) ).
cnf(c_0_51,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_52,plain,
! [X56,X57,X58,X59] :
( ( X58 = X59
| cons(X58,X56) != cons(X59,X57)
| ~ ssItem(X59)
| ~ ssItem(X58)
| ~ ssList(X57)
| ~ ssList(X56) )
& ( X57 = X56
| cons(X58,X56) != cons(X59,X57)
| ~ ssItem(X59)
| ~ ssItem(X58)
| ~ ssList(X57)
| ~ ssList(X56) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])]) ).
cnf(c_0_53,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| esk1_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_26]),c_0_26]) ).
cnf(c_0_54,negated_conjecture,
esk1_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_35])]) ).
cnf(c_0_55,negated_conjecture,
( esk1_0 = nil
| ssItem(esk5_0) ),
inference(rw,[status(thm)],[c_0_49,c_0_26]) ).
fof(c_0_56,plain,
! [X63,X64] :
( ~ ssList(X63)
| ~ ssItem(X64)
| cons(X64,X63) = app(cons(X64,nil),X63) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_57,negated_conjecture,
( X1 = app(nil,X2)
| app(X1,esk2_0) != app(X2,esk2_0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,plain,
( X1 = X2
| cons(X3,X2) != cons(X4,X1)
| ~ ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,negated_conjecture,
cons(esk5_0,nil) = esk1_0,
inference(sr,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_55,c_0_54]) ).
fof(c_0_61,plain,
! [X60,X61,X62] :
( ~ ssList(X60)
| ~ ssList(X61)
| ~ ssItem(X62)
| cons(X62,app(X61,X60)) = app(cons(X62,X61),X60) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
fof(c_0_62,plain,
! [X81] :
( ~ ssList(X81)
| app(X81,nil) = X81 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_63,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( app(nil,X1) = esk2_0
| app(esk2_0,esk2_0) != app(X1,esk2_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_51]) ).
fof(c_0_65,plain,
! [X79,X80] :
( ( nil = X80
| nil != app(X79,X80)
| ~ ssList(X80)
| ~ ssList(X79) )
& ( nil = X79
| nil != app(X79,X80)
| ~ ssList(X80)
| ~ ssList(X79) )
& ( nil != X80
| nil != X79
| nil = app(X79,X80)
| ~ ssList(X80)
| ~ ssList(X79) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_66,negated_conjecture,
( nil = X1
| cons(X2,X1) != esk1_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_35]),c_0_60])]) ).
cnf(c_0_67,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_68,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_69,negated_conjecture,
( cons(esk5_0,X1) = app(esk1_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_59]),c_0_60])]) ).
cnf(c_0_70,negated_conjecture,
app(nil,esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_64]),c_0_51])]) ).
cnf(c_0_71,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
fof(c_0_72,plain,
! [X52,X53] :
( ~ ssList(X52)
| ~ ssItem(X53)
| ssList(cons(X53,X52)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_73,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_74,negated_conjecture,
( app(X1,X2) = nil
| app(cons(X3,X1),X2) != esk1_0
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_39]) ).
cnf(c_0_75,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_67,c_0_68]),c_0_35])]) ).
cnf(c_0_76,negated_conjecture,
( app(cons(esk5_0,X1),X2) = app(esk1_0,app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_69]),c_0_60])]),c_0_39]) ).
cnf(c_0_77,negated_conjecture,
( app(cons(X1,nil),esk2_0) = cons(X1,esk2_0)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_70]),c_0_35]),c_0_51])]) ).
fof(c_0_78,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_79,plain,
( app(X1,X2) = nil
| app(X1,app(X2,X3)) != nil
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_38]),c_0_39]) ).
cnf(c_0_80,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_68,c_0_38]),c_0_35])]),c_0_39]) ).
fof(c_0_81,plain,
! [X12,X13,X16,X17] :
( ( ssList(esk6_2(X12,X13))
| ~ segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( ssList(esk7_2(X12,X13))
| ~ segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( app(app(esk6_2(X12,X13),X13),esk7_2(X12,X13)) = X12
| ~ segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( ~ ssList(X16)
| ~ ssList(X17)
| app(app(X16,X13),X17) != X12
| segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) ) ),
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_82,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_83,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_73])]),c_0_35])]) ).
fof(c_0_84,plain,
! [X45,X46,X47] :
( ( ~ memberP(app(X46,X47),X45)
| memberP(X46,X45)
| memberP(X47,X45)
| ~ ssList(X47)
| ~ ssList(X46)
| ~ ssItem(X45) )
& ( ~ memberP(X46,X45)
| memberP(app(X46,X47),X45)
| ~ ssList(X47)
| ~ ssList(X46)
| ~ ssItem(X45) )
& ( ~ memberP(X47,X45)
| memberP(app(X46,X47),X45)
| ~ ssList(X47)
| ~ ssList(X46)
| ~ ssItem(X45) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).
cnf(c_0_85,negated_conjecture,
( app(X1,nil) = nil
| cons(X2,X1) != esk1_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_35])]) ).
cnf(c_0_86,negated_conjecture,
cons(esk5_0,esk2_0) = app(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_70]),c_0_35]),c_0_51]),c_0_60])]) ).
fof(c_0_87,plain,
! [X51] :
( ~ ssItem(X51)
| ~ memberP(nil,X51) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_78])]) ).
cnf(c_0_88,negated_conjecture,
( nil = esk3_0
| memberP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_89,plain,
( app(X1,nil) = nil
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_40]),c_0_35])]) ).
cnf(c_0_90,plain,
( app(X1,nil) = app(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_45]),c_0_35])]) ).
cnf(c_0_91,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_81]) ).
cnf(c_0_92,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_67]),c_0_39]) ).
cnf(c_0_93,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_83]),c_0_35])]) ).
fof(c_0_94,plain,
! [X34] :
( ( ssList(esk8_1(X34))
| nil = X34
| ~ ssList(X34) )
& ( ssItem(esk9_1(X34))
| nil = X34
| ~ ssList(X34) )
& ( cons(esk9_1(X34),esk8_1(X34)) = X34
| nil = X34
| ~ ssList(X34) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_95,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_96,negated_conjecture,
( app(esk2_0,nil) = nil
| app(esk1_0,esk2_0) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_51]),c_0_60])]) ).
cnf(c_0_97,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_98,negated_conjecture,
( esk1_0 = nil
| memberP(esk2_0,esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_26]),c_0_25]) ).
cnf(c_0_99,negated_conjecture,
app(app(esk1_0,esk2_0),nil) = app(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_86]),c_0_51]),c_0_60])]) ).
cnf(c_0_100,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_101,plain,
( app(X1,nil) = nil
| app(nil,X1) != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_35])]) ).
cnf(c_0_102,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_91]) ).
cnf(c_0_103,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_35])]) ).
cnf(c_0_104,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_39]) ).
cnf(c_0_105,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_67]),c_0_39]) ).
fof(c_0_106,plain,
! [X39,X40,X43,X44] :
( ( ssList(esk10_2(X39,X40))
| ~ memberP(X39,X40)
| ~ ssItem(X40)
| ~ ssList(X39) )
& ( ssList(esk11_2(X39,X40))
| ~ memberP(X39,X40)
| ~ ssItem(X40)
| ~ ssList(X39) )
& ( app(esk10_2(X39,X40),cons(X40,esk11_2(X39,X40))) = X39
| ~ memberP(X39,X40)
| ~ ssItem(X40)
| ~ ssList(X39) )
& ( ~ ssList(X43)
| ~ ssList(X44)
| app(X43,cons(X40,X44)) != X39
| memberP(X39,X40)
| ~ ssItem(X40)
| ~ ssList(X39) ) ),
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_107,plain,
( cons(esk9_1(X1),esk8_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_108,plain,
( ssItem(esk9_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_109,plain,
( ssList(esk8_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_110,negated_conjecture,
( app(esk1_0,esk2_0) != esk1_0
| ~ memberP(esk2_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_35]),c_0_51])]),c_0_97]) ).
cnf(c_0_111,negated_conjecture,
memberP(esk2_0,esk5_0),
inference(sr,[status(thm)],[c_0_98,c_0_54]) ).
cnf(c_0_112,negated_conjecture,
app(esk1_0,app(esk2_0,nil)) = app(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_99]),c_0_35]),c_0_51]),c_0_100])]) ).
cnf(c_0_113,negated_conjecture,
( app(esk2_0,nil) = nil
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_70]),c_0_51])]) ).
cnf(c_0_114,negated_conjecture,
app(esk1_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_69]),c_0_35])]) ).
cnf(c_0_115,plain,
( segmentP(app(cons(X1,X2),X3),X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_63]),c_0_103]),c_0_92]) ).
cnf(c_0_116,negated_conjecture,
( ssList(app(X1,esk2_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_70]),c_0_51]),c_0_35])]) ).
cnf(c_0_117,negated_conjecture,
( app(app(esk1_0,X1),X2) != app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_69]),c_0_60])]) ).
cnf(c_0_118,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_119,plain,
! [X18,X19,X20] :
( ~ ssList(X18)
| ~ ssList(X19)
| ~ ssList(X20)
| ~ segmentP(X18,X19)
| ~ segmentP(X19,X20)
| segmentP(X18,X20) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])]) ).
cnf(c_0_120,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_106]) ).
cnf(c_0_121,plain,
( ssList(esk10_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_122,negated_conjecture,
( cons(esk9_1(esk2_0),esk8_1(esk2_0)) = esk2_0
| esk2_0 = nil ),
inference(spm,[status(thm)],[c_0_107,c_0_51]) ).
cnf(c_0_123,negated_conjecture,
( esk2_0 = nil
| ssItem(esk9_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_108,c_0_51]) ).
cnf(c_0_124,negated_conjecture,
( esk2_0 = nil
| ssList(esk8_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_109,c_0_51]) ).
cnf(c_0_125,negated_conjecture,
app(esk1_0,esk2_0) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_60])]) ).
cnf(c_0_126,negated_conjecture,
( app(esk1_0,esk2_0) = esk1_0
| esk2_0 != nil ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]) ).
fof(c_0_127,plain,
! [X21,X22] :
( ~ ssList(X21)
| ~ ssList(X22)
| ~ segmentP(X21,X22)
| ~ segmentP(X22,X21)
| X21 = X22 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])]) ).
cnf(c_0_128,plain,
( segmentP(cons(X1,X2),X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_75]),c_0_35])]) ).
cnf(c_0_129,negated_conjecture,
( ssList(cons(X1,esk2_0))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_63]),c_0_51])]),c_0_103]) ).
cnf(c_0_130,negated_conjecture,
( app(esk1_0,app(X1,X2)) != app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_38]),c_0_100])]) ).
cnf(c_0_131,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_35]) ).
cnf(c_0_132,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_133,plain,
( segmentP(app(X1,X2),cons(X3,esk11_2(X1,X3)))
| ~ memberP(X1,X3)
| ~ ssList(cons(X3,esk11_2(X1,X3)))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_120]),c_0_121]),c_0_39]) ).
cnf(c_0_134,negated_conjecture,
( ssList(app(esk1_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_69]),c_0_60])]) ).
cnf(c_0_135,negated_conjecture,
( app(esk2_0,nil) = esk2_0
| esk2_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_122]),c_0_123]),c_0_124]) ).
cnf(c_0_136,negated_conjecture,
esk2_0 != nil,
inference(spm,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_137,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_138,negated_conjecture,
segmentP(app(esk1_0,esk2_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_86]),c_0_51]),c_0_60])]) ).
cnf(c_0_139,negated_conjecture,
ssList(app(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_69]),c_0_60]),c_0_51])]) ).
cnf(c_0_140,negated_conjecture,
app(esk1_0,esk2_0) != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_70]),c_0_35]),c_0_51])]) ).
cnf(c_0_141,negated_conjecture,
( nil = esk2_0
| ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_142,negated_conjecture,
neq(esk1_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_100]),c_0_54]) ).
cnf(c_0_143,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,app(app(X3,X2),X4))
| ~ ssList(app(app(X3,X2),X4))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_132,c_0_102]) ).
cnf(c_0_144,negated_conjecture,
( segmentP(app(X1,X2),app(esk1_0,esk11_2(X1,esk5_0)))
| ~ memberP(X1,esk5_0)
| ~ ssList(esk11_2(X1,esk5_0))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_69]),c_0_60])]),c_0_134]) ).
cnf(c_0_145,negated_conjecture,
app(esk2_0,nil) = esk2_0,
inference(sr,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_146,negated_conjecture,
~ segmentP(esk2_0,app(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139]),c_0_51])]),c_0_140]) ).
cnf(c_0_147,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk2_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_142])]) ).
cnf(c_0_148,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_40]),c_0_35])]),c_0_39]) ).
cnf(c_0_149,negated_conjecture,
( segmentP(esk2_0,app(esk1_0,esk11_2(esk2_0,esk5_0)))
| ~ ssList(esk11_2(esk2_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_144,c_0_145]),c_0_111]),c_0_35]),c_0_51])]) ).
cnf(c_0_150,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_126]),c_0_147]) ).
cnf(c_0_151,negated_conjecture,
~ ssList(esk11_2(esk2_0,esk5_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_100]),c_0_51])]),c_0_150]) ).
cnf(c_0_152,plain,
( ssList(esk11_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_153,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_151,c_0_152]),c_0_111]),c_0_51]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.99 % Problem : SWC113+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/1.00 % Command : run_E %s %d THM
% 0.15/1.20 % Computer : n011.cluster.edu
% 0.15/1.20 % Model : x86_64 x86_64
% 0.15/1.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/1.20 % Memory : 8042.1875MB
% 0.15/1.20 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/1.20 % CPULimit : 2400
% 0.15/1.20 % WCLimit : 300
% 0.15/1.20 % DateTime : Tue Oct 3 01:52:11 EDT 2023
% 0.15/1.20 % CPUTime :
% 0.17/1.32 Running first-order model finding
% 0.17/1.32 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/tmp/tmp.rCuCU4vxPb/E---3.1_14644.p
% 398.66/51.81 # Version: 3.1pre001
% 398.66/51.81 # Preprocessing class: FSLSSMSSSSSNFFN.
% 398.66/51.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 398.66/51.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 398.66/51.81 # Starting new_bool_3 with 300s (1) cores
% 398.66/51.81 # Starting new_bool_1 with 300s (1) cores
% 398.66/51.81 # Starting sh5l with 300s (1) cores
% 398.66/51.81 # new_bool_3 with pid 14722 completed with status 0
% 398.66/51.81 # Result found by new_bool_3
% 398.66/51.81 # Preprocessing class: FSLSSMSSSSSNFFN.
% 398.66/51.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 398.66/51.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 398.66/51.81 # Starting new_bool_3 with 300s (1) cores
% 398.66/51.81 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 398.66/51.81 # Search class: FGHSF-FFMM21-MFFFFFNN
% 398.66/51.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 398.66/51.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 398.66/51.81 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14725 completed with status 0
% 398.66/51.81 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 398.66/51.81 # Preprocessing class: FSLSSMSSSSSNFFN.
% 398.66/51.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 398.66/51.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 398.66/51.81 # Starting new_bool_3 with 300s (1) cores
% 398.66/51.81 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 398.66/51.81 # Search class: FGHSF-FFMM21-MFFFFFNN
% 398.66/51.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 398.66/51.81 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 398.66/51.81 # Preprocessing time : 0.002 s
% 398.66/51.81 # Presaturation interreduction done
% 398.66/51.81
% 398.66/51.81 # Proof found!
% 398.66/51.81 # SZS status Theorem
% 398.66/51.81 # SZS output start CNFRefutation
% See solution above
% 398.66/51.81 # Parsed axioms : 96
% 398.66/51.81 # Removed by relevancy pruning/SinE : 66
% 398.66/51.81 # Initial clauses : 65
% 398.66/51.81 # Removed in clause preprocessing : 0
% 398.66/51.81 # Initial clauses in saturation : 65
% 398.66/51.81 # Processed clauses : 64077
% 398.66/51.81 # ...of these trivial : 1208
% 398.66/51.81 # ...subsumed : 48970
% 398.66/51.81 # ...remaining for further processing : 13899
% 398.66/51.81 # Other redundant clauses eliminated : 253
% 398.66/51.81 # Clauses deleted for lack of memory : 0
% 398.66/51.81 # Backward-subsumed : 1732
% 398.66/51.81 # Backward-rewritten : 1641
% 398.66/51.81 # Generated clauses : 1864192
% 398.66/51.81 # ...of the previous two non-redundant : 1846457
% 398.66/51.81 # ...aggressively subsumed : 0
% 398.66/51.81 # Contextual simplify-reflections : 3066
% 398.66/51.81 # Paramodulations : 1862369
% 398.66/51.81 # Factorizations : 0
% 398.66/51.81 # NegExts : 0
% 398.66/51.81 # Equation resolutions : 330
% 398.66/51.81 # Total rewrite steps : 767295
% 398.66/51.81 # Propositional unsat checks : 2
% 398.66/51.81 # Propositional check models : 0
% 398.66/51.81 # Propositional check unsatisfiable : 0
% 398.66/51.81 # Propositional clauses : 0
% 398.66/51.81 # Propositional clauses after purity: 0
% 398.66/51.81 # Propositional unsat core size : 0
% 398.66/51.81 # Propositional preprocessing time : 0.000
% 398.66/51.81 # Propositional encoding time : 4.167
% 398.66/51.81 # Propositional solver time : 5.005
% 398.66/51.81 # Success case prop preproc time : 0.000
% 398.66/51.81 # Success case prop encoding time : 0.000
% 398.66/51.81 # Success case prop solver time : 0.000
% 398.66/51.81 # Current number of processed clauses : 8962
% 398.66/51.81 # Positive orientable unit clauses : 1406
% 398.66/51.81 # Positive unorientable unit clauses: 0
% 398.66/51.81 # Negative unit clauses : 1442
% 398.66/51.81 # Non-unit-clauses : 6114
% 398.66/51.81 # Current number of unprocessed clauses: 1773654
% 398.66/51.81 # ...number of literals in the above : 8358593
% 398.66/51.81 # Current number of archived formulas : 0
% 398.66/51.81 # Current number of archived clauses : 4930
% 398.66/51.81 # Clause-clause subsumption calls (NU) : 5707054
% 398.66/51.81 # Rec. Clause-clause subsumption calls : 2662255
% 398.66/51.81 # Non-unit clause-clause subsumptions : 31108
% 398.66/51.81 # Unit Clause-clause subsumption calls : 962059
% 398.66/51.81 # Rewrite failures with RHS unbound : 0
% 398.66/51.81 # BW rewrite match attempts : 32540
% 398.66/51.81 # BW rewrite match successes : 122
% 398.66/51.81 # Condensation attempts : 0
% 398.66/51.81 # Condensation successes : 0
% 398.66/51.81 # Termbank termtop insertions : 63855518
% 398.66/51.81
% 398.66/51.81 # -------------------------------------------------
% 398.66/51.81 # User time : 48.027 s
% 398.66/51.81 # System time : 1.526 s
% 398.66/51.81 # Total time : 49.553 s
% 398.66/51.81 # Maximum resident set size: 2044 pages
% 398.66/51.81
% 398.66/51.81 # -------------------------------------------------
% 398.66/51.81 # User time : 48.034 s
% 398.66/51.81 # System time : 1.529 s
% 398.66/51.81 # Total time : 49.563 s
% 398.66/51.81 # Maximum resident set size: 1800 pages
% 398.66/51.81 % E---3.1 exiting
%------------------------------------------------------------------------------