TSTP Solution File: SWC057+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC057+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:10:08 EST 2010
% Result : Theorem 0.33s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 41
% Number of leaves : 9
% Syntax : Number of formulae : 111 ( 14 unt; 0 def)
% Number of atoms : 557 ( 144 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 752 ( 306 ~; 314 |; 107 &)
% ( 4 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 143 ( 0 sgn 82 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmp1HyrGy/sel_SWC057+1.p_1',ax46) ).
fof(7,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmp1HyrGy/sel_SWC057+1.p_1',ax28) ).
fof(17,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X2)
& frontsegP(X2,X3) )
=> frontsegP(X1,X3) ) ) ) ),
file('/tmp/tmp1HyrGy/sel_SWC057+1.p_1',ax40) ).
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/tmp1HyrGy/sel_SWC057+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/tmp1HyrGy/sel_SWC057+1.p_1',ax5) ).
fof(24,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmp1HyrGy/sel_SWC057+1.p_1',ax58) ).
fof(27,axiom,
ssList(nil),
file('/tmp/tmp1HyrGy/sel_SWC057+1.p_1',ax17) ).
fof(30,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/tmp/tmp1HyrGy/sel_SWC057+1.p_1',ax55) ).
fof(34,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ),
file('/tmp/tmp1HyrGy/sel_SWC057+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 != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ),
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 != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[35,theory(equality)]) ).
fof(59,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(nil,X1)
| nil = X1 )
& ( nil != X1
| frontsegP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(60,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ frontsegP(nil,X2)
| nil = X2 )
& ( nil != X2
| frontsegP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[59]) ).
fof(61,plain,
! [X2] :
( ( ~ frontsegP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| frontsegP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[60]) ).
cnf(62,plain,
( frontsegP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(63,plain,
( nil = X1
| ~ ssList(X1)
| ~ frontsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[61]) ).
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(108,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X3)
| frontsegP(X1,X3) ) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(109,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X5,X6)
| frontsegP(X4,X6) ) ) ),
inference(variable_rename,[status(thm)],[108]) ).
fof(110,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X5,X6)
| frontsegP(X4,X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[109]) ).
cnf(111,plain,
( frontsegP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[110]) ).
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]) ).
cnf(162,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[27]) ).
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(187,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X1,X5) ) ) )
& ( ( nil = X4
& nil = X3 )
| ( neq(X3,nil)
& frontsegP(X4,X3) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(188,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& ( ( nil = X7
& nil != X6 )
| ( neq(X7,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(X7,X10)
| ~ segmentP(X6,X10) ) ) )
& ( ( nil = X9
& nil = X8 )
| ( neq(X8,nil)
& frontsegP(X9,X8) ) ) ) ) ) ),
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 = esk9_0
& nil != esk8_0 )
| ( neq(esk9_0,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk9_0,X10)
| ~ segmentP(esk8_0,X10) ) ) )
& ( ( nil = esk11_0
& nil = esk10_0 )
| ( neq(esk10_0,nil)
& frontsegP(esk11_0,esk10_0) ) ) ),
inference(skolemize,[status(esa)],[188]) ).
fof(190,negated_conjecture,
! [X10] :
( ( ( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk9_0,X10)
| ~ segmentP(esk8_0,X10) )
& neq(esk9_0,nil) )
| ( nil = esk9_0
& nil != esk8_0 ) )
& ssList(esk11_0)
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& ( ( nil = esk11_0
& nil = esk10_0 )
| ( neq(esk10_0,nil)
& frontsegP(esk11_0,esk10_0) ) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0) ),
inference(shift_quantors,[status(thm)],[189]) ).
fof(191,negated_conjecture,
! [X10] :
( ( nil = esk9_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk9_0,X10)
| ~ segmentP(esk8_0,X10) )
& ( nil != esk8_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk9_0,X10)
| ~ segmentP(esk8_0,X10) )
& ( 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
& ( neq(esk10_0,nil)
| nil = esk11_0 )
& ( frontsegP(esk11_0,esk10_0)
| nil = esk11_0 )
& ( neq(esk10_0,nil)
| nil = esk10_0 )
& ( frontsegP(esk11_0,esk10_0)
| nil = esk10_0 )
& 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(195,negated_conjecture,
( nil = esk10_0
| frontsegP(esk11_0,esk10_0) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(197,negated_conjecture,
( nil = esk11_0
| frontsegP(esk11_0,esk10_0) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(198,negated_conjecture,
( nil = esk11_0
| neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(199,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[191]) ).
cnf(200,negated_conjecture,
esk9_0 = esk11_0,
inference(split_conjunct,[status(thm)],[191]) ).
cnf(201,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(202,negated_conjecture,
( neq(esk9_0,nil)
| nil != esk8_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(204,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(205,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(206,negated_conjecture,
ssList(esk10_0),
inference(rw,[status(thm)],[192,199,theory(equality)]) ).
cnf(207,negated_conjecture,
ssList(esk9_0),
inference(rw,[status(thm)],[201,200,theory(equality)]) ).
cnf(208,negated_conjecture,
( esk10_0 = nil
| frontsegP(esk9_0,esk10_0) ),
inference(rw,[status(thm)],[195,200,theory(equality)]) ).
cnf(209,negated_conjecture,
( esk9_0 = nil
| frontsegP(esk11_0,esk10_0) ),
inference(rw,[status(thm)],[197,200,theory(equality)]) ).
cnf(210,negated_conjecture,
( esk9_0 = nil
| frontsegP(esk9_0,esk10_0) ),
inference(rw,[status(thm)],[209,200,theory(equality)]) ).
cnf(211,negated_conjecture,
( esk9_0 = nil
| neq(esk10_0,nil) ),
inference(rw,[status(thm)],[198,200,theory(equality)]) ).
cnf(212,negated_conjecture,
( neq(esk9_0,nil)
| esk10_0 != nil ),
inference(rw,[status(thm)],[202,199,theory(equality)]) ).
cnf(222,negated_conjecture,
( esk9_0 = nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk10_0,X1)
| ~ segmentP(esk9_0,X1) ),
inference(rw,[status(thm)],[205,199,theory(equality)]) ).
cnf(262,negated_conjecture,
( esk10_0 != nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk8_0,X1)
| ~ segmentP(esk9_0,X1) ),
inference(rw,[status(thm)],[204,199,theory(equality)]) ).
cnf(263,negated_conjecture,
( esk10_0 != nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk10_0,X1)
| ~ segmentP(esk9_0,X1) ),
inference(rw,[status(thm)],[262,199,theory(equality)]) ).
cnf(267,negated_conjecture,
( esk10_0 != nil
| ~ segmentP(esk10_0,esk9_0)
| ~ segmentP(esk9_0,esk9_0)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[263,212,theory(equality)]) ).
cnf(274,negated_conjecture,
( frontsegP(X1,esk10_0)
| esk10_0 = nil
| ~ frontsegP(X1,esk9_0)
| ~ ssList(esk10_0)
| ~ ssList(esk9_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[111,208,theory(equality)]) ).
cnf(368,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(378,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| $false
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[368,162,theory(equality)]) ).
cnf(379,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[378,theory(equality)]) ).
cnf(490,negated_conjecture,
( esk10_0 != nil
| ~ segmentP(esk10_0,esk9_0)
| ~ segmentP(esk9_0,esk9_0)
| $false ),
inference(rw,[status(thm)],[267,207,theory(equality)]) ).
cnf(491,negated_conjecture,
( esk10_0 != nil
| ~ segmentP(esk10_0,esk9_0)
| ~ segmentP(esk9_0,esk9_0) ),
inference(cn,[status(thm)],[490,theory(equality)]) ).
cnf(557,negated_conjecture,
( frontsegP(X1,esk10_0)
| esk10_0 = nil
| ~ frontsegP(X1,esk9_0)
| $false
| ~ ssList(esk9_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[274,206,theory(equality)]) ).
cnf(558,negated_conjecture,
( frontsegP(X1,esk10_0)
| esk10_0 = nil
| ~ frontsegP(X1,esk9_0)
| $false
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[557,207,theory(equality)]) ).
cnf(559,negated_conjecture,
( frontsegP(X1,esk10_0)
| esk10_0 = nil
| ~ frontsegP(X1,esk9_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[558,theory(equality)]) ).
cnf(560,negated_conjecture,
( nil = esk10_0
| ~ ssList(esk10_0)
| ~ frontsegP(nil,esk9_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[63,559,theory(equality)]) ).
cnf(563,negated_conjecture,
( nil = esk10_0
| $false
| ~ frontsegP(nil,esk9_0)
| ~ ssList(nil) ),
inference(rw,[status(thm)],[560,206,theory(equality)]) ).
cnf(564,negated_conjecture,
( nil = esk10_0
| $false
| ~ frontsegP(nil,esk9_0)
| $false ),
inference(rw,[status(thm)],[563,162,theory(equality)]) ).
cnf(565,negated_conjecture,
( nil = esk10_0
| ~ frontsegP(nil,esk9_0) ),
inference(cn,[status(thm)],[564,theory(equality)]) ).
cnf(570,negated_conjecture,
( esk10_0 = nil
| nil != esk9_0
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[565,62,theory(equality)]) ).
cnf(571,negated_conjecture,
( esk10_0 = nil
| nil != esk9_0
| $false ),
inference(rw,[status(thm)],[570,207,theory(equality)]) ).
cnf(572,negated_conjecture,
( esk10_0 = nil
| nil != esk9_0 ),
inference(cn,[status(thm)],[571,theory(equality)]) ).
cnf(577,negated_conjecture,
( ~ segmentP(nil,esk9_0)
| ~ segmentP(esk9_0,esk9_0)
| esk9_0 != nil ),
inference(spm,[status(thm)],[491,572,theory(equality)]) ).
cnf(585,negated_conjecture,
( esk9_0 != nil
| ~ segmentP(nil,esk9_0)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[577,173,theory(equality)]) ).
cnf(586,negated_conjecture,
( esk9_0 != nil
| ~ segmentP(nil,esk9_0)
| $false ),
inference(rw,[status(thm)],[585,207,theory(equality)]) ).
cnf(587,negated_conjecture,
( esk9_0 != nil
| ~ segmentP(nil,esk9_0) ),
inference(cn,[status(thm)],[586,theory(equality)]) ).
cnf(588,negated_conjecture,
( esk9_0 != nil
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[587,150,theory(equality)]) ).
cnf(589,negated_conjecture,
( esk9_0 != nil
| $false ),
inference(rw,[status(thm)],[588,207,theory(equality)]) ).
cnf(590,negated_conjecture,
esk9_0 != nil,
inference(cn,[status(thm)],[589,theory(equality)]) ).
cnf(592,negated_conjecture,
frontsegP(esk9_0,esk10_0),
inference(sr,[status(thm)],[210,590,theory(equality)]) ).
cnf(593,negated_conjecture,
neq(esk10_0,nil),
inference(sr,[status(thm)],[211,590,theory(equality)]) ).
cnf(612,negated_conjecture,
( esk9_0 = nil
| ~ segmentP(esk10_0,esk10_0)
| ~ segmentP(esk9_0,esk10_0)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[222,593,theory(equality)]) ).
cnf(616,negated_conjecture,
( esk9_0 = nil
| ~ segmentP(esk10_0,esk10_0)
| ~ segmentP(esk9_0,esk10_0)
| $false ),
inference(rw,[status(thm)],[612,206,theory(equality)]) ).
cnf(617,negated_conjecture,
( esk9_0 = nil
| ~ segmentP(esk10_0,esk10_0)
| ~ segmentP(esk9_0,esk10_0) ),
inference(cn,[status(thm)],[616,theory(equality)]) ).
cnf(618,negated_conjecture,
( ~ segmentP(esk10_0,esk10_0)
| ~ segmentP(esk9_0,esk10_0) ),
inference(sr,[status(thm)],[617,590,theory(equality)]) ).
cnf(625,negated_conjecture,
( ~ segmentP(esk9_0,esk10_0)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[618,173,theory(equality)]) ).
cnf(627,negated_conjecture,
( ~ segmentP(esk9_0,esk10_0)
| $false ),
inference(rw,[status(thm)],[625,206,theory(equality)]) ).
cnf(628,negated_conjecture,
~ segmentP(esk9_0,esk10_0),
inference(cn,[status(thm)],[627,theory(equality)]) ).
cnf(2563,plain,
( segmentP(X1,X2)
| X3 != X1
| ~ ssList(esk7_2(X3,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X3,X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[379,126,theory(equality)]) ).
cnf(2581,plain,
( segmentP(X1,X2)
| ~ ssList(esk7_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
inference(er,[status(thm)],[2563,theory(equality)]) ).
cnf(3324,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[2581,127]) ).
cnf(3325,negated_conjecture,
( ~ frontsegP(esk9_0,esk10_0)
| ~ ssList(esk10_0)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[628,3324,theory(equality)]) ).
cnf(3342,negated_conjecture,
( $false
| ~ ssList(esk10_0)
| ~ ssList(esk9_0) ),
inference(rw,[status(thm)],[3325,592,theory(equality)]) ).
cnf(3343,negated_conjecture,
( $false
| $false
| ~ ssList(esk9_0) ),
inference(rw,[status(thm)],[3342,206,theory(equality)]) ).
cnf(3344,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[3343,207,theory(equality)]) ).
cnf(3345,negated_conjecture,
$false,
inference(cn,[status(thm)],[3344,theory(equality)]) ).
cnf(3346,negated_conjecture,
$false,
3345,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC057+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp1HyrGy/sel_SWC057+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC057+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC057+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC057+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
%
%------------------------------------------------------------------------------