TSTP Solution File: SWC052+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC052+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 10:09:21 EST 2010
% Result : Theorem 1.44s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 10
% Syntax : Number of formulae : 132 ( 17 unt; 0 def)
% Number of atoms : 656 ( 160 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 900 ( 376 ~; 377 |; 120 &)
% ( 4 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 172 ( 0 sgn 94 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',ax28) ).
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',ax7) ).
fof(19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',ax5) ).
fof(24,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',ax58) ).
fof(25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',ax15) ).
fof(27,axiom,
ssList(nil),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',ax17) ).
fof(28,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',ax53) ).
fof(30,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',ax55) ).
fof(32,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',ax57) ).
fof(34,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X3,X5) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ),
file('/tmp/tmpRPPPtK/sel_SWC052+1.p_1',co1) ).
fof(35,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X3,X5) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[34]) ).
fof(36,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X3,X5) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[35,theory(equality)]) ).
fof(64,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(65,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[64]) ).
cnf(66,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
fof(112,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(X1,X2)
| ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) )
& ( ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| app(app(X3,X2),X4) != X1 ) )
| segmentP(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(113,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,X6),X8) = X5 ) ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(skolemize,[status(esa)],[113]) ).
fof(115,plain,
! [X5,X6,X9,X10] :
( ( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6) )
& ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) ) )
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(shift_quantors,[status(thm)],[114]) ).
fof(116,plain,
! [X5,X6,X9,X10] :
( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk5_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk6_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[115]) ).
cnf(120,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[116]) ).
fof(121,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ frontsegP(X1,X2)
| ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) )
& ( ! [X3] :
( ~ ssList(X3)
| app(X2,X3) != X1 )
| frontsegP(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(122,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ( ( ~ frontsegP(X4,X5)
| ? [X6] :
( ssList(X6)
& app(X5,X6) = X4 ) )
& ( ! [X7] :
( ~ ssList(X7)
| app(X5,X7) != X4 )
| frontsegP(X4,X5) ) ) ) ),
inference(variable_rename,[status(thm)],[121]) ).
fof(123,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ( ( ~ frontsegP(X4,X5)
| ( ssList(esk7_2(X4,X5))
& app(X5,esk7_2(X4,X5)) = X4 ) )
& ( ! [X7] :
( ~ ssList(X7)
| app(X5,X7) != X4 )
| frontsegP(X4,X5) ) ) ) ),
inference(skolemize,[status(esa)],[122]) ).
fof(124,plain,
! [X4,X5,X7] :
( ( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5) )
& ( ~ frontsegP(X4,X5)
| ( ssList(esk7_2(X4,X5))
& app(X5,esk7_2(X4,X5)) = X4 ) ) )
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[123]) ).
fof(125,plain,
! [X4,X5,X7] :
( ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ssList(esk7_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk7_2(X4,X5)) = X4
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[124]) ).
cnf(126,plain,
( app(X2,esk7_2(X1,X2)) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(127,plain,
( ssList(esk7_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[125]) ).
fof(147,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(nil,X1)
| nil = X1 )
& ( nil != X1
| segmentP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(148,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(nil,X2)
| nil = X2 )
& ( nil != X2
| segmentP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[147]) ).
fof(149,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[148]) ).
cnf(150,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[149]) ).
fof(152,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(153,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[152]) ).
fof(154,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[153]) ).
fof(155,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[154]) ).
cnf(156,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[155]) ).
cnf(162,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[27]) ).
fof(163,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| segmentP(X1,X3) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(164,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ~ segmentP(X4,X5)
| ~ segmentP(X5,X6)
| segmentP(X4,X6) ) ) ),
inference(variable_rename,[status(thm)],[163]) ).
fof(165,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| ~ segmentP(X4,X5)
| ~ segmentP(X5,X6)
| segmentP(X4,X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[164]) ).
cnf(166,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[165]) ).
fof(171,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(172,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[171]) ).
cnf(173,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[172]) ).
fof(178,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(179,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[178]) ).
cnf(180,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[179]) ).
fof(187,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( nil = X3
| nil != X4 )
& ( ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X4,X5)
& frontsegP(X3,X5) )
| ~ neq(X4,nil) )
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(X2,X6)
| ~ segmentP(X1,X6) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(188,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& ( nil = X9
| nil != X10 )
& ( ? [X11] :
( ssList(X11)
& neq(X11,nil)
& frontsegP(X10,X11)
& frontsegP(X9,X11) )
| ~ neq(X10,nil) )
& ( ( nil = X8
& nil != X7 )
| ( neq(X8,nil)
& ! [X12] :
( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(X8,X12)
| ~ segmentP(X7,X12) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[187]) ).
fof(189,negated_conjecture,
( ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& ( nil = esk10_0
| nil != esk11_0 )
& ( ( ssList(esk12_0)
& neq(esk12_0,nil)
& frontsegP(esk11_0,esk12_0)
& frontsegP(esk10_0,esk12_0) )
| ~ neq(esk11_0,nil) )
& ( ( nil = esk9_0
& nil != esk8_0 )
| ( neq(esk9_0,nil)
& ! [X12] :
( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk9_0,X12)
| ~ segmentP(esk8_0,X12) ) ) ) ),
inference(skolemize,[status(esa)],[188]) ).
fof(190,negated_conjecture,
! [X12] :
( ( ( ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk9_0,X12)
| ~ segmentP(esk8_0,X12) )
& neq(esk9_0,nil) )
| ( nil = esk9_0
& nil != esk8_0 ) )
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& ( nil = esk10_0
| nil != esk11_0 )
& ( ( ssList(esk12_0)
& neq(esk12_0,nil)
& frontsegP(esk11_0,esk12_0)
& frontsegP(esk10_0,esk12_0) )
| ~ neq(esk11_0,nil) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0) ),
inference(shift_quantors,[status(thm)],[189]) ).
fof(191,negated_conjecture,
! [X12] :
( ( nil = esk9_0
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk9_0,X12)
| ~ segmentP(esk8_0,X12) )
& ( nil != esk8_0
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk9_0,X12)
| ~ segmentP(esk8_0,X12) )
& ( nil = esk9_0
| neq(esk9_0,nil) )
& ( nil != esk8_0
| neq(esk9_0,nil) )
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& ( nil = esk10_0
| nil != esk11_0 )
& ( ssList(esk12_0)
| ~ neq(esk11_0,nil) )
& ( neq(esk12_0,nil)
| ~ neq(esk11_0,nil) )
& ( frontsegP(esk11_0,esk12_0)
| ~ neq(esk11_0,nil) )
& ( frontsegP(esk10_0,esk12_0)
| ~ neq(esk11_0,nil) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0) ),
inference(distribute,[status(thm)],[190]) ).
cnf(192,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(193,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(195,negated_conjecture,
( frontsegP(esk10_0,esk12_0)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(196,negated_conjecture,
( frontsegP(esk11_0,esk12_0)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(197,negated_conjecture,
( neq(esk12_0,nil)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(198,negated_conjecture,
( ssList(esk12_0)
| ~ neq(esk11_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(199,negated_conjecture,
( nil = esk10_0
| nil != esk11_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(200,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[191]) ).
cnf(201,negated_conjecture,
esk9_0 = esk11_0,
inference(split_conjunct,[status(thm)],[191]) ).
cnf(203,negated_conjecture,
( neq(esk9_0,nil)
| nil != esk8_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(204,negated_conjecture,
( neq(esk9_0,nil)
| nil = esk9_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(205,negated_conjecture,
( ~ segmentP(esk8_0,X1)
| ~ segmentP(esk9_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != esk8_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(206,negated_conjecture,
( nil = esk9_0
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk9_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(209,negated_conjecture,
ssList(esk11_0),
inference(rw,[status(thm)],[193,201,theory(equality)]) ).
cnf(210,negated_conjecture,
( esk8_0 = nil
| esk11_0 != nil ),
inference(rw,[status(thm)],[199,200,theory(equality)]) ).
cnf(213,negated_conjecture,
( esk11_0 = nil
| neq(esk9_0,nil) ),
inference(rw,[status(thm)],[204,201,theory(equality)]) ).
cnf(214,negated_conjecture,
( esk11_0 = nil
| neq(esk11_0,nil) ),
inference(rw,[status(thm)],[213,201,theory(equality)]) ).
cnf(215,negated_conjecture,
( ssList(esk12_0)
| esk11_0 = nil ),
inference(spm,[status(thm)],[198,214,theory(equality)]) ).
cnf(216,negated_conjecture,
( neq(esk11_0,nil)
| esk8_0 != nil ),
inference(rw,[status(thm)],[203,201,theory(equality)]) ).
cnf(218,negated_conjecture,
( frontsegP(esk8_0,esk12_0)
| ~ neq(esk11_0,nil) ),
inference(rw,[status(thm)],[195,200,theory(equality)]) ).
cnf(219,negated_conjecture,
( frontsegP(esk8_0,esk12_0)
| esk11_0 = nil ),
inference(spm,[status(thm)],[218,214,theory(equality)]) ).
cnf(241,negated_conjecture,
( esk11_0 = nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk9_0,X1) ),
inference(rw,[status(thm)],[206,201,theory(equality)]) ).
cnf(242,negated_conjecture,
( esk11_0 = nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk11_0,X1) ),
inference(rw,[status(thm)],[241,201,theory(equality)]) ).
cnf(246,negated_conjecture,
( esk11_0 = nil
| X1 = nil
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk11_0,X1)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[242,156,theory(equality)]) ).
cnf(247,negated_conjecture,
( esk11_0 = nil
| X1 = nil
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk11_0,X1)
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[246,162,theory(equality)]) ).
cnf(248,negated_conjecture,
( esk11_0 = nil
| X1 = nil
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk11_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[247,theory(equality)]) ).
cnf(282,negated_conjecture,
( esk8_0 != nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk11_0,X1) ),
inference(rw,[status(thm)],[205,201,theory(equality)]) ).
cnf(284,negated_conjecture,
( esk8_0 != nil
| ~ segmentP(esk8_0,esk11_0)
| ~ segmentP(esk11_0,esk11_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[282,216,theory(equality)]) ).
cnf(299,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,nil)
| ~ ssList(X2)
| ~ ssList(nil)
| ~ ssList(X1)
| nil != X2 ),
inference(spm,[status(thm)],[166,150,theory(equality)]) ).
cnf(302,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,nil)
| ~ ssList(X2)
| $false
| ~ ssList(X1)
| nil != X2 ),
inference(rw,[status(thm)],[299,162,theory(equality)]) ).
cnf(303,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,nil)
| ~ ssList(X2)
| ~ ssList(X1)
| nil != X2 ),
inference(cn,[status(thm)],[302,theory(equality)]) ).
cnf(384,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[120,66,theory(equality)]) ).
cnf(394,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| $false
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[384,162,theory(equality)]) ).
cnf(395,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[394,theory(equality)]) ).
cnf(510,negated_conjecture,
( esk8_0 != nil
| ~ segmentP(esk8_0,esk11_0)
| ~ segmentP(esk11_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[284,209,theory(equality)]) ).
cnf(511,negated_conjecture,
( esk8_0 != nil
| ~ segmentP(esk8_0,esk11_0)
| ~ segmentP(esk11_0,esk11_0) ),
inference(cn,[status(thm)],[510,theory(equality)]) ).
cnf(512,negated_conjecture,
( ~ segmentP(nil,esk11_0)
| ~ segmentP(esk11_0,esk11_0)
| esk11_0 != nil ),
inference(spm,[status(thm)],[511,210,theory(equality)]) ).
cnf(513,negated_conjecture,
( esk11_0 != nil
| ~ segmentP(nil,esk11_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[512,173,theory(equality)]) ).
cnf(514,negated_conjecture,
( esk11_0 != nil
| ~ segmentP(nil,esk11_0)
| $false ),
inference(rw,[status(thm)],[513,209,theory(equality)]) ).
cnf(515,negated_conjecture,
( esk11_0 != nil
| ~ segmentP(nil,esk11_0) ),
inference(cn,[status(thm)],[514,theory(equality)]) ).
cnf(516,negated_conjecture,
( esk11_0 != nil
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[515,150,theory(equality)]) ).
cnf(517,negated_conjecture,
( esk11_0 != nil
| $false ),
inference(rw,[status(thm)],[516,209,theory(equality)]) ).
cnf(518,negated_conjecture,
esk11_0 != nil,
inference(cn,[status(thm)],[517,theory(equality)]) ).
cnf(519,negated_conjecture,
neq(esk11_0,nil),
inference(sr,[status(thm)],[214,518,theory(equality)]) ).
cnf(520,negated_conjecture,
ssList(esk12_0),
inference(sr,[status(thm)],[215,518,theory(equality)]) ).
cnf(521,negated_conjecture,
frontsegP(esk8_0,esk12_0),
inference(sr,[status(thm)],[219,518,theory(equality)]) ).
cnf(526,negated_conjecture,
( neq(esk12_0,nil)
| $false ),
inference(rw,[status(thm)],[197,519,theory(equality)]) ).
cnf(527,negated_conjecture,
neq(esk12_0,nil),
inference(cn,[status(thm)],[526,theory(equality)]) ).
cnf(528,negated_conjecture,
( frontsegP(esk11_0,esk12_0)
| $false ),
inference(rw,[status(thm)],[196,519,theory(equality)]) ).
cnf(529,negated_conjecture,
frontsegP(esk11_0,esk12_0),
inference(cn,[status(thm)],[528,theory(equality)]) ).
cnf(555,negated_conjecture,
( esk11_0 = nil
| ~ segmentP(esk8_0,esk12_0)
| ~ segmentP(esk11_0,esk12_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[242,527,theory(equality)]) ).
cnf(557,negated_conjecture,
( esk11_0 = nil
| ~ segmentP(esk8_0,esk12_0)
| ~ segmentP(esk11_0,esk12_0)
| $false ),
inference(rw,[status(thm)],[555,520,theory(equality)]) ).
cnf(558,negated_conjecture,
( esk11_0 = nil
| ~ segmentP(esk8_0,esk12_0)
| ~ segmentP(esk11_0,esk12_0) ),
inference(cn,[status(thm)],[557,theory(equality)]) ).
cnf(559,negated_conjecture,
( ~ segmentP(esk8_0,esk12_0)
| ~ segmentP(esk11_0,esk12_0) ),
inference(sr,[status(thm)],[558,518,theory(equality)]) ).
cnf(565,negated_conjecture,
( X1 = nil
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk11_0,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[248,518,theory(equality)]) ).
cnf(736,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[303,180]) ).
cnf(744,negated_conjecture,
( ~ segmentP(esk11_0,esk12_0)
| nil != esk12_0
| ~ ssList(esk12_0)
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[559,736,theory(equality)]) ).
cnf(758,negated_conjecture,
( ~ segmentP(esk11_0,esk12_0)
| nil != esk12_0
| $false
| ~ ssList(esk8_0) ),
inference(rw,[status(thm)],[744,520,theory(equality)]) ).
cnf(759,negated_conjecture,
( ~ segmentP(esk11_0,esk12_0)
| nil != esk12_0
| $false
| $false ),
inference(rw,[status(thm)],[758,192,theory(equality)]) ).
cnf(760,negated_conjecture,
( ~ segmentP(esk11_0,esk12_0)
| nil != esk12_0 ),
inference(cn,[status(thm)],[759,theory(equality)]) ).
cnf(762,negated_conjecture,
( esk12_0 != nil
| ~ ssList(esk12_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[760,736,theory(equality)]) ).
cnf(763,negated_conjecture,
( esk12_0 != nil
| $false
| ~ ssList(esk11_0) ),
inference(rw,[status(thm)],[762,520,theory(equality)]) ).
cnf(764,negated_conjecture,
( esk12_0 != nil
| $false
| $false ),
inference(rw,[status(thm)],[763,209,theory(equality)]) ).
cnf(765,negated_conjecture,
esk12_0 != nil,
inference(cn,[status(thm)],[764,theory(equality)]) ).
cnf(2219,plain,
( segmentP(X1,X2)
| X3 != X1
| ~ ssList(esk7_2(X3,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X3,X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[395,126,theory(equality)]) ).
cnf(2233,plain,
( segmentP(X1,X2)
| ~ ssList(esk7_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
inference(er,[status(thm)],[2219,theory(equality)]) ).
cnf(29673,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[2233,127]) ).
cnf(29680,negated_conjecture,
( X1 = nil
| ~ segmentP(esk11_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk8_0,X1)
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[565,29673,theory(equality)]) ).
cnf(29714,negated_conjecture,
( X1 = nil
| ~ segmentP(esk11_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk8_0,X1)
| $false ),
inference(rw,[status(thm)],[29680,192,theory(equality)]) ).
cnf(29715,negated_conjecture,
( X1 = nil
| ~ segmentP(esk11_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk8_0,X1) ),
inference(cn,[status(thm)],[29714,theory(equality)]) ).
cnf(29796,negated_conjecture,
( X1 = nil
| ~ frontsegP(esk8_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk11_0,X1)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[29715,29673,theory(equality)]) ).
cnf(29818,negated_conjecture,
( X1 = nil
| ~ frontsegP(esk8_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk11_0,X1)
| $false ),
inference(rw,[status(thm)],[29796,209,theory(equality)]) ).
cnf(29819,negated_conjecture,
( X1 = nil
| ~ frontsegP(esk8_0,X1)
| ~ ssList(X1)
| ~ frontsegP(esk11_0,X1) ),
inference(cn,[status(thm)],[29818,theory(equality)]) ).
cnf(29820,negated_conjecture,
( esk12_0 = nil
| ~ frontsegP(esk11_0,esk12_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[29819,521,theory(equality)]) ).
cnf(29841,negated_conjecture,
( esk12_0 = nil
| $false
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[29820,529,theory(equality)]) ).
cnf(29842,negated_conjecture,
( esk12_0 = nil
| $false
| $false ),
inference(rw,[status(thm)],[29841,520,theory(equality)]) ).
cnf(29843,negated_conjecture,
esk12_0 = nil,
inference(cn,[status(thm)],[29842,theory(equality)]) ).
cnf(29844,negated_conjecture,
$false,
inference(sr,[status(thm)],[29843,765,theory(equality)]) ).
cnf(29845,negated_conjecture,
$false,
29844,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC052+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpRPPPtK/sel_SWC052+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC052+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC052+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC052+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------