TSTP Solution File: SWC081+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC081+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:13:20 EST 2010
% Result : Theorem 0.32s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 48
% Number of leaves : 10
% Syntax : Number of formulae : 125 ( 18 unt; 0 def)
% Number of atoms : 590 ( 140 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 771 ( 306 ~; 323 |; 110 &)
% ( 4 <=>; 28 =>; 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 : 150 ( 0 sgn 88 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpi7LOYD/sel_SWC081+1.p_1',ax46) ).
fof(7,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpi7LOYD/sel_SWC081+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/tmpi7LOYD/sel_SWC081+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/tmpi7LOYD/sel_SWC081+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/tmpi7LOYD/sel_SWC081+1.p_1',ax5) ).
fof(24,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpi7LOYD/sel_SWC081+1.p_1',ax58) ).
fof(27,axiom,
ssList(nil),
file('/tmp/tmpi7LOYD/sel_SWC081+1.p_1',ax17) ).
fof(30,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/tmp/tmpi7LOYD/sel_SWC081+1.p_1',ax55) ).
fof(32,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/tmp/tmpi7LOYD/sel_SWC081+1.p_1',ax57) ).
fof(34,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/tmp/tmpi7LOYD/sel_SWC081+1.p_1',co1) ).
fof(35,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( nil != X4
| nil != 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
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( nil != X4
| nil != 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(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
& neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X1,X5) )
& ( ? [X6] :
( ssList(X6)
& neq(X6,nil)
& frontsegP(X4,X6)
& frontsegP(X3,X6) )
| ( nil = X4
& nil = X3 ) ) ) ) ) ),
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
& neq(X8,nil)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(X8,X11)
| ~ segmentP(X7,X11) )
& ( ? [X12] :
( ssList(X12)
& neq(X12,nil)
& frontsegP(X10,X12)
& frontsegP(X9,X12) )
| ( nil = X10
& nil = X9 ) ) ) ) ) ),
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
& neq(esk9_0,nil)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk9_0,X11)
| ~ segmentP(esk8_0,X11) )
& ( ( ssList(esk12_0)
& neq(esk12_0,nil)
& frontsegP(esk11_0,esk12_0)
& frontsegP(esk10_0,esk12_0) )
| ( nil = esk11_0
& nil = esk10_0 ) ) ),
inference(skolemize,[status(esa)],[188]) ).
fof(190,negated_conjecture,
! [X11] :
( ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk9_0,X11)
| ~ segmentP(esk8_0,X11) )
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& neq(esk9_0,nil)
& ( ( ssList(esk12_0)
& neq(esk12_0,nil)
& frontsegP(esk11_0,esk12_0)
& frontsegP(esk10_0,esk12_0) )
| ( nil = esk11_0
& nil = esk10_0 ) )
& ssList(esk11_0)
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0) ),
inference(shift_quantors,[status(thm)],[189]) ).
fof(191,negated_conjecture,
! [X11] :
( ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk9_0,X11)
| ~ segmentP(esk8_0,X11) )
& esk9_0 = esk11_0
& esk8_0 = esk10_0
& neq(esk9_0,nil)
& ( nil = esk11_0
| ssList(esk12_0) )
& ( nil = esk10_0
| ssList(esk12_0) )
& ( nil = esk11_0
| neq(esk12_0,nil) )
& ( nil = esk10_0
| neq(esk12_0,nil) )
& ( nil = esk11_0
| frontsegP(esk11_0,esk12_0) )
& ( nil = esk10_0
| frontsegP(esk11_0,esk12_0) )
& ( nil = esk11_0
| frontsegP(esk10_0,esk12_0) )
& ( nil = esk10_0
| frontsegP(esk10_0,esk12_0) )
& ssList(esk11_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(193,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(197,negated_conjecture,
( frontsegP(esk10_0,esk12_0)
| nil = esk11_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(198,negated_conjecture,
( frontsegP(esk11_0,esk12_0)
| nil = esk10_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(199,negated_conjecture,
( frontsegP(esk11_0,esk12_0)
| nil = esk11_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(200,negated_conjecture,
( neq(esk12_0,nil)
| nil = esk10_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(201,negated_conjecture,
( neq(esk12_0,nil)
| nil = esk11_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(202,negated_conjecture,
( ssList(esk12_0)
| nil = esk10_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(203,negated_conjecture,
( ssList(esk12_0)
| nil = esk11_0 ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(204,negated_conjecture,
neq(esk9_0,nil),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(205,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[191]) ).
cnf(206,negated_conjecture,
esk9_0 = esk11_0,
inference(split_conjunct,[status(thm)],[191]) ).
cnf(207,negated_conjecture,
( ~ segmentP(esk8_0,X1)
| ~ segmentP(esk9_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(208,negated_conjecture,
ssList(esk10_0),
inference(rw,[status(thm)],[192,205,theory(equality)]) ).
cnf(209,negated_conjecture,
ssList(esk11_0),
inference(rw,[status(thm)],[193,206,theory(equality)]) ).
cnf(210,negated_conjecture,
neq(esk11_0,nil),
inference(rw,[status(thm)],[204,206,theory(equality)]) ).
cnf(223,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk10_0,X1)
| ~ segmentP(esk9_0,X1) ),
inference(rw,[status(thm)],[207,205,theory(equality)]) ).
cnf(224,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk10_0,X1)
| ~ segmentP(esk11_0,X1) ),
inference(rw,[status(thm)],[223,206,theory(equality)]) ).
cnf(225,negated_conjecture,
( ~ segmentP(esk10_0,esk11_0)
| ~ segmentP(esk11_0,esk11_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[224,210,theory(equality)]) ).
cnf(226,negated_conjecture,
( esk10_0 = nil
| ~ segmentP(esk10_0,esk12_0)
| ~ segmentP(esk11_0,esk12_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[224,200,theory(equality)]) ).
cnf(264,negated_conjecture,
( frontsegP(X1,esk12_0)
| esk10_0 = nil
| ~ frontsegP(X1,esk11_0)
| ~ ssList(esk12_0)
| ~ ssList(esk11_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[111,198,theory(equality)]) ).
cnf(360,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(370,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| $false
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[360,162,theory(equality)]) ).
cnf(371,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[370,theory(equality)]) ).
cnf(478,negated_conjecture,
( ~ segmentP(esk10_0,esk11_0)
| ~ segmentP(esk11_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[225,209,theory(equality)]) ).
cnf(479,negated_conjecture,
( ~ segmentP(esk10_0,esk11_0)
| ~ segmentP(esk11_0,esk11_0) ),
inference(cn,[status(thm)],[478,theory(equality)]) ).
cnf(482,negated_conjecture,
( esk10_0 = nil
| ~ segmentP(esk10_0,esk12_0)
| ~ segmentP(esk11_0,esk12_0) ),
inference(csr,[status(thm)],[226,202]) ).
cnf(547,negated_conjecture,
( frontsegP(X1,esk12_0)
| esk10_0 = nil
| ~ frontsegP(X1,esk11_0)
| ~ ssList(esk12_0)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[264,209,theory(equality)]) ).
cnf(548,negated_conjecture,
( frontsegP(X1,esk12_0)
| esk10_0 = nil
| ~ frontsegP(X1,esk11_0)
| ~ ssList(esk12_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[547,theory(equality)]) ).
cnf(549,negated_conjecture,
( esk10_0 = nil
| frontsegP(X1,esk12_0)
| ~ frontsegP(X1,esk11_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[548,202]) ).
cnf(550,negated_conjecture,
( nil = esk12_0
| esk10_0 = nil
| ~ ssList(esk12_0)
| ~ frontsegP(nil,esk11_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[63,549,theory(equality)]) ).
cnf(553,negated_conjecture,
( nil = esk12_0
| esk10_0 = nil
| ~ ssList(esk12_0)
| ~ frontsegP(nil,esk11_0)
| $false ),
inference(rw,[status(thm)],[550,162,theory(equality)]) ).
cnf(554,negated_conjecture,
( nil = esk12_0
| esk10_0 = nil
| ~ ssList(esk12_0)
| ~ frontsegP(nil,esk11_0) ),
inference(cn,[status(thm)],[553,theory(equality)]) ).
cnf(581,negated_conjecture,
( esk12_0 = nil
| esk10_0 = nil
| ~ frontsegP(nil,esk11_0) ),
inference(csr,[status(thm)],[554,202]) ).
cnf(582,negated_conjecture,
( esk10_0 = nil
| esk12_0 = nil
| nil != esk11_0
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[581,62,theory(equality)]) ).
cnf(583,negated_conjecture,
( esk10_0 = nil
| esk12_0 = nil
| nil != esk11_0
| $false ),
inference(rw,[status(thm)],[582,209,theory(equality)]) ).
cnf(584,negated_conjecture,
( esk10_0 = nil
| esk12_0 = nil
| nil != esk11_0 ),
inference(cn,[status(thm)],[583,theory(equality)]) ).
cnf(593,negated_conjecture,
( esk10_0 = nil
| ~ segmentP(esk10_0,nil)
| ~ segmentP(esk11_0,nil)
| esk11_0 != nil ),
inference(spm,[status(thm)],[482,584,theory(equality)]) ).
cnf(629,negated_conjecture,
( esk10_0 = nil
| esk11_0 != nil
| ~ segmentP(esk11_0,nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[593,180,theory(equality)]) ).
cnf(630,negated_conjecture,
( esk10_0 = nil
| esk11_0 != nil
| ~ segmentP(esk11_0,nil)
| $false ),
inference(rw,[status(thm)],[629,208,theory(equality)]) ).
cnf(631,negated_conjecture,
( esk10_0 = nil
| esk11_0 != nil
| ~ segmentP(esk11_0,nil) ),
inference(cn,[status(thm)],[630,theory(equality)]) ).
cnf(632,negated_conjecture,
( esk10_0 = nil
| esk11_0 != nil
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[631,180,theory(equality)]) ).
cnf(633,negated_conjecture,
( esk10_0 = nil
| esk11_0 != nil
| $false ),
inference(rw,[status(thm)],[632,209,theory(equality)]) ).
cnf(634,negated_conjecture,
( esk10_0 = nil
| esk11_0 != nil ),
inference(cn,[status(thm)],[633,theory(equality)]) ).
cnf(637,negated_conjecture,
( ~ segmentP(nil,esk11_0)
| ~ segmentP(esk11_0,esk11_0)
| esk11_0 != nil ),
inference(spm,[status(thm)],[479,634,theory(equality)]) ).
cnf(642,negated_conjecture,
( esk11_0 != nil
| ~ segmentP(nil,esk11_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[637,173,theory(equality)]) ).
cnf(643,negated_conjecture,
( esk11_0 != nil
| ~ segmentP(nil,esk11_0)
| $false ),
inference(rw,[status(thm)],[642,209,theory(equality)]) ).
cnf(644,negated_conjecture,
( esk11_0 != nil
| ~ segmentP(nil,esk11_0) ),
inference(cn,[status(thm)],[643,theory(equality)]) ).
cnf(679,negated_conjecture,
( esk11_0 != nil
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[644,150,theory(equality)]) ).
cnf(680,negated_conjecture,
( esk11_0 != nil
| $false ),
inference(rw,[status(thm)],[679,209,theory(equality)]) ).
cnf(681,negated_conjecture,
esk11_0 != nil,
inference(cn,[status(thm)],[680,theory(equality)]) ).
cnf(714,negated_conjecture,
ssList(esk12_0),
inference(sr,[status(thm)],[203,681,theory(equality)]) ).
cnf(715,negated_conjecture,
frontsegP(esk10_0,esk12_0),
inference(sr,[status(thm)],[197,681,theory(equality)]) ).
cnf(716,negated_conjecture,
frontsegP(esk11_0,esk12_0),
inference(sr,[status(thm)],[199,681,theory(equality)]) ).
cnf(717,negated_conjecture,
neq(esk12_0,nil),
inference(sr,[status(thm)],[201,681,theory(equality)]) ).
cnf(744,negated_conjecture,
( ~ segmentP(esk10_0,esk12_0)
| ~ segmentP(esk11_0,esk12_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[224,717,theory(equality)]) ).
cnf(747,negated_conjecture,
( ~ segmentP(esk10_0,esk12_0)
| ~ segmentP(esk11_0,esk12_0)
| $false ),
inference(rw,[status(thm)],[744,714,theory(equality)]) ).
cnf(748,negated_conjecture,
( ~ segmentP(esk10_0,esk12_0)
| ~ segmentP(esk11_0,esk12_0) ),
inference(cn,[status(thm)],[747,theory(equality)]) ).
cnf(2592,plain,
( segmentP(X1,X2)
| X3 != X1
| ~ ssList(esk7_2(X3,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X3,X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[371,126,theory(equality)]) ).
cnf(2608,plain,
( segmentP(X1,X2)
| ~ ssList(esk7_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
inference(er,[status(thm)],[2592,theory(equality)]) ).
cnf(3416,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[2608,127]) ).
cnf(3426,negated_conjecture,
( ~ segmentP(esk11_0,esk12_0)
| ~ frontsegP(esk10_0,esk12_0)
| ~ ssList(esk12_0)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[748,3416,theory(equality)]) ).
cnf(3453,negated_conjecture,
( ~ segmentP(esk11_0,esk12_0)
| $false
| ~ ssList(esk12_0)
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[3426,715,theory(equality)]) ).
cnf(3454,negated_conjecture,
( ~ segmentP(esk11_0,esk12_0)
| $false
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[3453,714,theory(equality)]) ).
cnf(3455,negated_conjecture,
( ~ segmentP(esk11_0,esk12_0)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[3454,208,theory(equality)]) ).
cnf(3456,negated_conjecture,
~ segmentP(esk11_0,esk12_0),
inference(cn,[status(thm)],[3455,theory(equality)]) ).
cnf(3483,negated_conjecture,
( ~ frontsegP(esk11_0,esk12_0)
| ~ ssList(esk12_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[3456,3416,theory(equality)]) ).
cnf(3488,negated_conjecture,
( $false
| ~ ssList(esk12_0)
| ~ ssList(esk11_0) ),
inference(rw,[status(thm)],[3483,716,theory(equality)]) ).
cnf(3489,negated_conjecture,
( $false
| $false
| ~ ssList(esk11_0) ),
inference(rw,[status(thm)],[3488,714,theory(equality)]) ).
cnf(3490,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[3489,209,theory(equality)]) ).
cnf(3491,negated_conjecture,
$false,
inference(cn,[status(thm)],[3490,theory(equality)]) ).
cnf(3492,negated_conjecture,
$false,
3491,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC081+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpi7LOYD/sel_SWC081+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC081+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC081+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC081+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
%
%------------------------------------------------------------------------------