TSTP Solution File: SWC068+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC068+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:11:30 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 12
% Syntax : Number of formulae : 132 ( 22 unt; 0 def)
% Number of atoms : 541 ( 170 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 704 ( 295 ~; 299 |; 74 &)
% ( 4 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 176 ( 0 sgn 112 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax84) ).
fof(2,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax83) ).
fof(3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax82) ).
fof(5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax80) ).
fof(13,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax7) ).
fof(14,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X1) )
=> X1 = X2 ) ) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax54) ).
fof(17,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax58) ).
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax15) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax17) ).
fof(23,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax55) ).
fof(24,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',ax56) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( app(X4,X4) != X3
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
file('/tmp/tmpb-XWl0/sel_SWC068+1.p_1',co1) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( app(X4,X4) != X3
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(28,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(29,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[28]) ).
cnf(30,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( nil != app(X1,X2)
| ( nil = X2
& nil = X1 ) )
& ( nil != X2
| nil != X1
| nil = app(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(32,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[32]) ).
fof(34,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[33]) ).
cnf(37,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(38,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(39,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ) ) ),
inference(variable_rename,[status(thm)],[38]) ).
fof(40,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6))
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[39]) ).
cnf(41,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[40]) ).
fof(46,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,X3) != app(X2,X1)
| X3 = X1 ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(47,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(X5,X6) != app(X5,X4)
| X6 = X4 ) ) ),
inference(variable_rename,[status(thm)],[46]) ).
fof(48,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| app(X5,X6) != app(X5,X4)
| X6 = X4
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[47]) ).
cnf(49,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| app(X2,X3) != app(X2,X1)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(83,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)],[13]) ).
fof(84,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)],[83]) ).
fof(85,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)],[84]) ).
fof(86,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)],[85]) ).
fof(87,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)],[86]) ).
cnf(91,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[87]) ).
fof(92,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| X1 = X2 ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(93,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X3)
| X3 = X4 ) ),
inference(variable_rename,[status(thm)],[92]) ).
fof(94,plain,
! [X3,X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X3)
| X3 = X4
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[93]) ).
cnf(95,plain,
( X1 = X2
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[94]) ).
fof(106,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(nil,X1)
| nil = X1 )
& ( nil != X1
| segmentP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(107,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(nil,X2)
| nil = X2 )
& ( nil != X2
| segmentP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[106]) ).
fof(108,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[107]) ).
cnf(109,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[108]) ).
fof(111,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(112,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[111]) ).
fof(113,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[112]) ).
fof(114,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)],[113]) ).
cnf(115,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[114]) ).
cnf(121,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[20]) ).
fof(130,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(131,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[130]) ).
cnf(132,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[131]) ).
fof(133,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X1,X2)
| segmentP(app(app(X3,X1),X4),X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(134,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ segmentP(X5,X6)
| segmentP(app(app(X7,X5),X8),X6) ) ) ) ),
inference(variable_rename,[status(thm)],[133]) ).
fof(135,plain,
! [X5,X6,X7,X8] :
( ~ ssList(X8)
| ~ segmentP(X5,X6)
| segmentP(app(app(X7,X5),X8),X6)
| ~ ssList(X7)
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(shift_quantors,[status(thm)],[134]) ).
cnf(136,plain,
( segmentP(app(app(X3,X1),X4),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[135]) ).
fof(140,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X4,X4) = X3
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X1,X5) )
& ( nil != X2
| nil != X1 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(141,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(X9,X9) = X8
& X7 = X9
& X6 = X8
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(X7,X10)
| ~ segmentP(X6,X10) )
& ( nil != X7
| nil != X6 ) ) ) ) ),
inference(variable_rename,[status(thm)],[140]) ).
fof(142,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& app(esk10_0,esk10_0) = esk9_0
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk8_0,X10)
| ~ segmentP(esk7_0,X10) )
& ( nil != esk8_0
| nil != esk7_0 ) ),
inference(skolemize,[status(esa)],[141]) ).
fof(143,negated_conjecture,
! [X10] :
( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk8_0,X10)
| ~ segmentP(esk7_0,X10) )
& app(esk10_0,esk10_0) = esk9_0
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil != esk8_0
| nil != esk7_0 )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[142]) ).
cnf(144,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(145,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(148,negated_conjecture,
( nil != esk7_0
| nil != esk8_0 ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(149,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(150,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(151,negated_conjecture,
app(esk10_0,esk10_0) = esk9_0,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(152,negated_conjecture,
( ~ segmentP(esk7_0,X1)
| ~ segmentP(esk8_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(155,negated_conjecture,
ssList(esk10_0),
inference(rw,[status(thm)],[145,150,theory(equality)]) ).
cnf(156,negated_conjecture,
( esk7_0 != nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[148,150,theory(equality)]) ).
cnf(157,negated_conjecture,
app(esk10_0,esk10_0) = esk7_0,
inference(rw,[status(thm)],[151,149,theory(equality)]) ).
cnf(158,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(er,[status(thm)],[109,theory(equality)]) ).
cnf(159,plain,
( segmentP(nil,nil)
| $false ),
inference(rw,[status(thm)],[158,121,theory(equality)]) ).
cnf(160,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[159,theory(equality)]) ).
cnf(169,negated_conjecture,
( nil = esk10_0
| esk7_0 != nil
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[37,157,theory(equality)]) ).
cnf(181,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk7_0,X1)
| ~ segmentP(esk10_0,X1) ),
inference(rw,[status(thm)],[152,150,theory(equality)]) ).
cnf(209,negated_conjecture,
( esk10_0 = X1
| esk7_0 != app(esk10_0,X1)
| ~ ssList(X1)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[49,157,theory(equality)]) ).
cnf(239,negated_conjecture,
( segmentP(X1,esk10_0)
| app(esk7_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(esk10_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[91,157,theory(equality)]) ).
cnf(249,negated_conjecture,
( app(esk7_0,X1) = app(esk10_0,app(esk10_0,X1))
| ~ ssList(X1)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[41,157,theory(equality)]) ).
cnf(316,plain,
( segmentP(app(app(X1,nil),X2),nil)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[136,160,theory(equality)]) ).
cnf(324,plain,
( segmentP(app(app(X1,nil),X2),nil)
| ~ ssList(X2)
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[316,121,theory(equality)]) ).
cnf(325,plain,
( segmentP(app(app(X1,nil),X2),nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[324,theory(equality)]) ).
cnf(328,negated_conjecture,
( esk10_0 = nil
| esk7_0 != nil
| $false ),
inference(rw,[status(thm)],[169,155,theory(equality)]) ).
cnf(329,negated_conjecture,
( esk10_0 = nil
| esk7_0 != nil ),
inference(cn,[status(thm)],[328,theory(equality)]) ).
cnf(330,negated_conjecture,
esk7_0 != nil,
inference(csr,[status(thm)],[329,156]) ).
cnf(408,negated_conjecture,
( esk10_0 = X1
| app(esk10_0,X1) != esk7_0
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[209,155,theory(equality)]) ).
cnf(409,negated_conjecture,
( esk10_0 = X1
| app(esk10_0,X1) != esk7_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[408,theory(equality)]) ).
cnf(446,plain,
( segmentP(app(X1,X2),nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[325,30,theory(equality)]) ).
cnf(544,negated_conjecture,
( segmentP(esk7_0,nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[446,157,theory(equality)]) ).
cnf(556,negated_conjecture,
( segmentP(esk7_0,nil)
| $false ),
inference(rw,[status(thm)],[544,155,theory(equality)]) ).
cnf(557,negated_conjecture,
segmentP(esk7_0,nil),
inference(cn,[status(thm)],[556,theory(equality)]) ).
cnf(578,negated_conjecture,
( nil = esk7_0
| ~ segmentP(nil,esk7_0)
| ~ ssList(esk7_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[95,557,theory(equality)]) ).
cnf(586,negated_conjecture,
( nil = esk7_0
| ~ segmentP(nil,esk7_0)
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[578,144,theory(equality)]) ).
cnf(587,negated_conjecture,
( nil = esk7_0
| ~ segmentP(nil,esk7_0)
| $false
| $false ),
inference(rw,[status(thm)],[586,121,theory(equality)]) ).
cnf(588,negated_conjecture,
( nil = esk7_0
| ~ segmentP(nil,esk7_0) ),
inference(cn,[status(thm)],[587,theory(equality)]) ).
cnf(589,negated_conjecture,
~ segmentP(nil,esk7_0),
inference(sr,[status(thm)],[588,330,theory(equality)]) ).
cnf(887,negated_conjecture,
( app(esk10_0,app(esk10_0,X1)) = app(esk7_0,X1)
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[249,155,theory(equality)]) ).
cnf(888,negated_conjecture,
( app(esk10_0,app(esk10_0,X1)) = app(esk7_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[887,theory(equality)]) ).
cnf(889,negated_conjecture,
( app(esk10_0,esk7_0) = app(esk7_0,esk10_0)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[888,157,theory(equality)]) ).
cnf(890,negated_conjecture,
( app(esk10_0,esk10_0) = app(esk7_0,nil)
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[888,30,theory(equality)]) ).
cnf(908,negated_conjecture,
( app(esk10_0,esk7_0) = app(esk7_0,esk10_0)
| $false ),
inference(rw,[status(thm)],[889,155,theory(equality)]) ).
cnf(909,negated_conjecture,
app(esk10_0,esk7_0) = app(esk7_0,esk10_0),
inference(cn,[status(thm)],[908,theory(equality)]) ).
cnf(910,negated_conjecture,
( esk7_0 = app(esk7_0,nil)
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[890,157,theory(equality)]) ).
cnf(911,negated_conjecture,
( esk7_0 = app(esk7_0,nil)
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[910,121,theory(equality)]) ).
cnf(912,negated_conjecture,
( esk7_0 = app(esk7_0,nil)
| $false
| $false ),
inference(rw,[status(thm)],[911,155,theory(equality)]) ).
cnf(913,negated_conjecture,
esk7_0 = app(esk7_0,nil),
inference(cn,[status(thm)],[912,theory(equality)]) ).
cnf(1011,negated_conjecture,
( esk10_0 = esk7_0
| app(esk7_0,esk10_0) != esk7_0
| ~ ssList(esk7_0) ),
inference(spm,[status(thm)],[409,909,theory(equality)]) ).
cnf(1048,negated_conjecture,
( esk10_0 = esk7_0
| app(esk7_0,esk10_0) != esk7_0
| $false ),
inference(rw,[status(thm)],[1011,144,theory(equality)]) ).
cnf(1049,negated_conjecture,
( esk10_0 = esk7_0
| app(esk7_0,esk10_0) != esk7_0 ),
inference(cn,[status(thm)],[1048,theory(equality)]) ).
cnf(1149,negated_conjecture,
( segmentP(X1,esk10_0)
| app(esk7_0,X2) != X1
| ~ ssList(X2)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[239,155,theory(equality)]) ).
cnf(1150,negated_conjecture,
( segmentP(X1,esk10_0)
| app(esk7_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[1149,theory(equality)]) ).
cnf(1152,negated_conjecture,
( segmentP(X1,esk10_0)
| esk7_0 != X1
| ~ ssList(nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[1150,913,theory(equality)]) ).
cnf(1154,negated_conjecture,
( segmentP(X1,esk10_0)
| esk7_0 != X1
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[1152,121,theory(equality)]) ).
cnf(1155,negated_conjecture,
( segmentP(X1,esk10_0)
| esk7_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[1154,theory(equality)]) ).
cnf(1207,negated_conjecture,
( segmentP(esk7_0,esk10_0)
| ~ ssList(esk7_0) ),
inference(er,[status(thm)],[1155,theory(equality)]) ).
cnf(1208,negated_conjecture,
( segmentP(esk7_0,esk10_0)
| $false ),
inference(rw,[status(thm)],[1207,144,theory(equality)]) ).
cnf(1209,negated_conjecture,
segmentP(esk7_0,esk10_0),
inference(cn,[status(thm)],[1208,theory(equality)]) ).
cnf(1210,negated_conjecture,
( ~ segmentP(esk10_0,esk10_0)
| ~ neq(esk10_0,nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[181,1209,theory(equality)]) ).
cnf(1217,negated_conjecture,
( ~ segmentP(esk10_0,esk10_0)
| ~ neq(esk10_0,nil)
| $false ),
inference(rw,[status(thm)],[1210,155,theory(equality)]) ).
cnf(1218,negated_conjecture,
( ~ segmentP(esk10_0,esk10_0)
| ~ neq(esk10_0,nil) ),
inference(cn,[status(thm)],[1217,theory(equality)]) ).
cnf(1240,negated_conjecture,
( ~ neq(esk10_0,nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[1218,132,theory(equality)]) ).
cnf(1241,negated_conjecture,
( ~ neq(esk10_0,nil)
| $false ),
inference(rw,[status(thm)],[1240,155,theory(equality)]) ).
cnf(1242,negated_conjecture,
~ neq(esk10_0,nil),
inference(cn,[status(thm)],[1241,theory(equality)]) ).
cnf(1243,negated_conjecture,
( esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[1242,115,theory(equality)]) ).
cnf(1245,negated_conjecture,
( esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[1243,121,theory(equality)]) ).
cnf(1246,negated_conjecture,
( esk10_0 = nil
| $false
| $false ),
inference(rw,[status(thm)],[1245,155,theory(equality)]) ).
cnf(1247,negated_conjecture,
esk10_0 = nil,
inference(cn,[status(thm)],[1246,theory(equality)]) ).
cnf(1282,negated_conjecture,
( nil = esk7_0
| app(esk7_0,esk10_0) != esk7_0 ),
inference(rw,[status(thm)],[1049,1247,theory(equality)]) ).
cnf(1283,negated_conjecture,
( nil = esk7_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1282,1247,theory(equality)]),913,theory(equality)]) ).
cnf(1284,negated_conjecture,
nil = esk7_0,
inference(cn,[status(thm)],[1283,theory(equality)]) ).
cnf(1314,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[589,1284,theory(equality)]),160,theory(equality)]) ).
cnf(1315,negated_conjecture,
$false,
inference(cn,[status(thm)],[1314,theory(equality)]) ).
cnf(1316,negated_conjecture,
$false,
1315,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC068+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpb-XWl0/sel_SWC068+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC068+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC068+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC068+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
%
%------------------------------------------------------------------------------