TSTP Solution File: SWC083+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC083+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:34 EST 2010
% Result : Theorem 0.42s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 47
% Number of leaves : 8
% Syntax : Number of formulae : 127 ( 29 unt; 0 def)
% Number of atoms : 506 ( 112 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 648 ( 269 ~; 273 |; 78 &)
% ( 2 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 168 ( 0 sgn 83 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmpDssb33/sel_SWC083+1.p_1',ax84) ).
fof(3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/tmp/tmpDssb33/sel_SWC083+1.p_1',ax82) ).
fof(6,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpDssb33/sel_SWC083+1.p_1',ax28) ).
fof(8,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/tmp/tmpDssb33/sel_SWC083+1.p_1',ax26) ).
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/tmpDssb33/sel_SWC083+1.p_1',ax7) ).
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpDssb33/sel_SWC083+1.p_1',ax15) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmpDssb33/sel_SWC083+1.p_1',ax17) ).
fof(26,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)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ~ ssList(X8)
| app(app(X6,X7),X8) != X3
| app(X6,X8) != X4 ) ) ) ) ) ) ),
file('/tmp/tmpDssb33/sel_SWC083+1.p_1',co1) ).
fof(27,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)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ~ ssList(X8)
| app(app(X6,X7),X8) != X3
| app(X6,X8) != X4 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(28,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)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ~ ssList(X8)
| app(app(X6,X7),X8) != X3
| app(X6,X8) != X4 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(29,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(30,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[29]) ).
cnf(31,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[30]) ).
fof(39,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(40,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)],[39]) ).
fof(41,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)],[40]) ).
cnf(42,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(51,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(52,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[51]) ).
cnf(53,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
fof(58,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ssList(app(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(59,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ssList(app(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[58]) ).
fof(60,plain,
! [X3,X4] :
( ~ ssList(X4)
| ssList(app(X3,X4))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[59]) ).
cnf(61,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[60]) ).
fof(84,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(85,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)],[84]) ).
fof(86,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)],[85]) ).
fof(87,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)],[86]) ).
fof(88,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)],[87]) ).
cnf(92,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[88]) ).
fof(112,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(113,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[113]) ).
fof(115,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)],[114]) ).
cnf(116,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[115]) ).
cnf(122,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[20]) ).
fof(141,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)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X6,X7),X8) = X3
& app(X6,X8) = X4 ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(142,negated_conjecture,
? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& X10 = X12
& X9 = X11
& neq(X10,nil)
& ! [X13] :
( ~ ssList(X13)
| ~ neq(X13,nil)
| ~ segmentP(X10,X13)
| ~ segmentP(X9,X13) )
& ? [X14] :
( ssList(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& app(app(X14,X15),X16) = X11
& app(X14,X16) = X12 ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[141]) ).
fof(143,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& neq(esk8_0,nil)
& ! [X13] :
( ~ ssList(X13)
| ~ neq(X13,nil)
| ~ segmentP(esk8_0,X13)
| ~ segmentP(esk7_0,X13) )
& ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& app(app(esk11_0,esk12_0),esk13_0) = esk9_0
& app(esk11_0,esk13_0) = esk10_0 ),
inference(skolemize,[status(esa)],[142]) ).
fof(144,negated_conjecture,
! [X13] :
( ( ~ ssList(X13)
| ~ neq(X13,nil)
| ~ segmentP(esk8_0,X13)
| ~ segmentP(esk7_0,X13) )
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& neq(esk8_0,nil)
& ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& app(app(esk11_0,esk12_0),esk13_0) = esk9_0
& app(esk11_0,esk13_0) = esk10_0
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[143]) ).
cnf(145,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(146,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(148,negated_conjecture,
app(esk11_0,esk13_0) = esk10_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(149,negated_conjecture,
app(app(esk11_0,esk12_0),esk13_0) = esk9_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(150,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(151,negated_conjecture,
ssList(esk12_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(152,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(153,negated_conjecture,
neq(esk8_0,nil),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(154,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(155,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(157,negated_conjecture,
( ~ segmentP(esk7_0,X1)
| ~ segmentP(esk8_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(162,negated_conjecture,
app(esk11_0,esk13_0) = esk8_0,
inference(rw,[status(thm)],[148,155,theory(equality)]) ).
cnf(163,negated_conjecture,
app(app(esk11_0,esk12_0),esk13_0) = esk7_0,
inference(rw,[status(thm)],[149,154,theory(equality)]) ).
cnf(261,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(app(app(X1,X2),X3)) ),
inference(er,[status(thm)],[92,theory(equality)]) ).
cnf(266,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(nil)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X3,X2)) ),
inference(spm,[status(thm)],[92,31,theory(equality)]) ).
cnf(267,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[92,53,theory(equality)]) ).
cnf(271,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| $false
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X3,X2)) ),
inference(rw,[status(thm)],[266,122,theory(equality)]) ).
cnf(272,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X3,X2)) ),
inference(cn,[status(thm)],[271,theory(equality)]) ).
cnf(273,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| $false
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[267,122,theory(equality)]) ).
cnf(274,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[273,theory(equality)]) ).
cnf(275,negated_conjecture,
( app(esk8_0,X1) = app(esk11_0,app(esk13_0,X1))
| ~ ssList(X1)
| ~ ssList(esk13_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[42,162,theory(equality)]) ).
cnf(276,negated_conjecture,
( app(esk11_0,app(esk12_0,esk13_0)) = esk7_0
| ~ ssList(esk13_0)
| ~ ssList(esk12_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[163,42,theory(equality)]) ).
cnf(417,negated_conjecture,
( app(esk11_0,app(esk12_0,esk13_0)) = esk7_0
| ~ ssList(esk12_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[276,150,theory(equality)]) ).
cnf(418,negated_conjecture,
( app(esk11_0,app(esk12_0,esk13_0)) = esk7_0
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[417,151,theory(equality)]) ).
cnf(419,negated_conjecture,
app(esk11_0,app(esk12_0,esk13_0)) = esk7_0,
inference(spm,[status(thm)],[418,152,theory(equality)]) ).
cnf(2180,negated_conjecture,
( app(esk11_0,app(esk13_0,X1)) = app(esk8_0,X1)
| ~ ssList(esk11_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[275,150,theory(equality)]) ).
cnf(2181,negated_conjecture,
( app(esk11_0,app(esk13_0,X1)) = app(esk8_0,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[2180,152,theory(equality)]) ).
cnf(2250,negated_conjecture,
( app(esk11_0,esk13_0) = app(esk8_0,nil)
| ~ ssList(nil)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[2181,31,theory(equality)]) ).
cnf(2251,negated_conjecture,
( ssList(app(esk8_0,X1))
| ~ ssList(app(esk13_0,X1))
| ~ ssList(esk11_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[61,2181,theory(equality)]) ).
cnf(2280,negated_conjecture,
( esk8_0 = app(esk8_0,nil)
| ~ ssList(nil)
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[2250,162,theory(equality)]) ).
cnf(2281,negated_conjecture,
( esk8_0 = app(esk8_0,nil)
| $false
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[2280,122,theory(equality)]) ).
cnf(2282,negated_conjecture,
( esk8_0 = app(esk8_0,nil)
| ~ ssList(esk13_0) ),
inference(cn,[status(thm)],[2281,theory(equality)]) ).
cnf(2309,negated_conjecture,
app(esk8_0,nil) = esk8_0,
inference(spm,[status(thm)],[2282,150,theory(equality)]) ).
cnf(2437,negated_conjecture,
( ssList(app(esk8_0,X1))
| ~ ssList(app(esk13_0,X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[2251,152,theory(equality)]) ).
cnf(2439,negated_conjecture,
( ssList(app(esk8_0,X1))
| ~ ssList(X1)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[2437,61,theory(equality)]) ).
cnf(2443,negated_conjecture,
( ssList(app(esk8_0,X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[2439,150,theory(equality)]) ).
cnf(2664,negated_conjecture,
( segmentP(app(esk8_0,X1),esk13_0)
| ~ ssList(app(esk8_0,X1))
| ~ ssList(X1)
| ~ ssList(esk11_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[261,162,theory(equality)]) ).
cnf(2785,negated_conjecture,
( segmentP(app(esk8_0,X1),esk13_0)
| ~ ssList(esk11_0)
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[2664,2443]) ).
cnf(2786,negated_conjecture,
( segmentP(app(esk8_0,X1),esk13_0)
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[2785,152,theory(equality)]) ).
cnf(2815,negated_conjecture,
( segmentP(app(esk8_0,X1),esk13_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[2786,150,theory(equality)]) ).
cnf(2816,negated_conjecture,
( segmentP(esk8_0,esk13_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[2815,2309,theory(equality)]) ).
cnf(2825,negated_conjecture,
( segmentP(esk8_0,esk13_0)
| $false ),
inference(rw,[status(thm)],[2816,122,theory(equality)]) ).
cnf(2826,negated_conjecture,
segmentP(esk8_0,esk13_0),
inference(cn,[status(thm)],[2825,theory(equality)]) ).
cnf(3133,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[272,61]) ).
cnf(3136,negated_conjecture,
( segmentP(X1,esk13_0)
| esk7_0 != X1
| ~ ssList(app(esk11_0,esk12_0))
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[3133,163,theory(equality)]) ).
cnf(3181,negated_conjecture,
( segmentP(X1,esk8_0)
| esk8_0 != X1
| ~ ssList(nil)
| ~ ssList(esk8_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[274,2309,theory(equality)]) ).
cnf(3193,negated_conjecture,
( segmentP(X1,esk8_0)
| esk8_0 != X1
| $false
| ~ ssList(esk8_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[3181,122,theory(equality)]) ).
cnf(3194,negated_conjecture,
( segmentP(X1,esk8_0)
| esk8_0 != X1
| $false
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[3193,146,theory(equality)]) ).
cnf(3195,negated_conjecture,
( segmentP(X1,esk8_0)
| esk8_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[3194,theory(equality)]) ).
cnf(3213,negated_conjecture,
( segmentP(esk8_0,esk8_0)
| ~ ssList(esk8_0) ),
inference(er,[status(thm)],[3195,theory(equality)]) ).
cnf(3214,negated_conjecture,
( segmentP(esk8_0,esk8_0)
| $false ),
inference(rw,[status(thm)],[3213,146,theory(equality)]) ).
cnf(3215,negated_conjecture,
segmentP(esk8_0,esk8_0),
inference(cn,[status(thm)],[3214,theory(equality)]) ).
cnf(3509,negated_conjecture,
( segmentP(X1,esk13_0)
| esk7_0 != X1
| ~ ssList(app(esk11_0,esk12_0))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[3136,150,theory(equality)]) ).
cnf(3510,negated_conjecture,
( segmentP(X1,esk13_0)
| esk7_0 != X1
| ~ ssList(X1)
| ~ ssList(esk12_0)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[3509,61,theory(equality)]) ).
cnf(4567,negated_conjecture,
( segmentP(X1,esk13_0)
| esk7_0 != X1
| ~ ssList(esk11_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[3510,151,theory(equality)]) ).
cnf(4568,negated_conjecture,
( segmentP(X1,esk13_0)
| esk7_0 != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[4567,152,theory(equality)]) ).
cnf(4569,negated_conjecture,
( segmentP(esk7_0,esk13_0)
| ~ ssList(esk7_0) ),
inference(er,[status(thm)],[4568,theory(equality)]) ).
cnf(4570,negated_conjecture,
( segmentP(esk7_0,esk13_0)
| $false ),
inference(rw,[status(thm)],[4569,145,theory(equality)]) ).
cnf(4571,negated_conjecture,
segmentP(esk7_0,esk13_0),
inference(cn,[status(thm)],[4570,theory(equality)]) ).
cnf(4574,negated_conjecture,
( ~ segmentP(esk8_0,esk13_0)
| ~ neq(esk13_0,nil)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[157,4571,theory(equality)]) ).
cnf(4581,negated_conjecture,
( $false
| ~ neq(esk13_0,nil)
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[4574,2826,theory(equality)]) ).
cnf(4582,negated_conjecture,
( ~ neq(esk13_0,nil)
| ~ ssList(esk13_0) ),
inference(cn,[status(thm)],[4581,theory(equality)]) ).
cnf(4596,negated_conjecture,
~ neq(esk13_0,nil),
inference(spm,[status(thm)],[4582,150,theory(equality)]) ).
cnf(4597,negated_conjecture,
( esk13_0 = nil
| ~ ssList(nil)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[4596,116,theory(equality)]) ).
cnf(4599,negated_conjecture,
( esk13_0 = nil
| $false
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[4597,122,theory(equality)]) ).
cnf(4600,negated_conjecture,
( esk13_0 = nil
| ~ ssList(esk13_0) ),
inference(cn,[status(thm)],[4599,theory(equality)]) ).
cnf(4601,negated_conjecture,
esk13_0 = nil,
inference(spm,[status(thm)],[4600,150,theory(equality)]) ).
cnf(4608,negated_conjecture,
app(esk11_0,app(esk12_0,nil)) = esk7_0,
inference(rw,[status(thm)],[419,4601,theory(equality)]) ).
cnf(4610,negated_conjecture,
app(esk11_0,nil) = esk8_0,
inference(rw,[status(thm)],[162,4601,theory(equality)]) ).
cnf(4644,negated_conjecture,
( esk8_0 = esk11_0
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[31,4610,theory(equality)]) ).
cnf(4733,negated_conjecture,
esk11_0 = esk8_0,
inference(spm,[status(thm)],[4644,152,theory(equality)]) ).
cnf(4783,negated_conjecture,
app(esk8_0,app(esk12_0,nil)) = esk7_0,
inference(rw,[status(thm)],[4608,4733,theory(equality)]) ).
cnf(4784,negated_conjecture,
( app(esk8_0,esk12_0) = esk7_0
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[4783,31,theory(equality)]) ).
cnf(4985,negated_conjecture,
app(esk8_0,esk12_0) = esk7_0,
inference(spm,[status(thm)],[4784,151,theory(equality)]) ).
cnf(5013,negated_conjecture,
( segmentP(X1,esk8_0)
| esk7_0 != X1
| ~ ssList(esk12_0)
| ~ ssList(esk8_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[274,4985,theory(equality)]) ).
cnf(5062,negated_conjecture,
( segmentP(X1,esk8_0)
| esk7_0 != X1
| ~ ssList(esk12_0)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[5013,146,theory(equality)]) ).
cnf(5063,negated_conjecture,
( segmentP(X1,esk8_0)
| esk7_0 != X1
| ~ ssList(esk12_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[5062,theory(equality)]) ).
cnf(5229,negated_conjecture,
( segmentP(X1,esk8_0)
| esk7_0 != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[5063,151,theory(equality)]) ).
cnf(5237,negated_conjecture,
( segmentP(esk7_0,esk8_0)
| ~ ssList(esk7_0) ),
inference(er,[status(thm)],[5229,theory(equality)]) ).
cnf(5238,negated_conjecture,
( segmentP(esk7_0,esk8_0)
| $false ),
inference(rw,[status(thm)],[5237,145,theory(equality)]) ).
cnf(5239,negated_conjecture,
segmentP(esk7_0,esk8_0),
inference(cn,[status(thm)],[5238,theory(equality)]) ).
cnf(5240,negated_conjecture,
( ~ segmentP(esk8_0,esk8_0)
| ~ neq(esk8_0,nil)
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[157,5239,theory(equality)]) ).
cnf(5247,negated_conjecture,
( $false
| ~ neq(esk8_0,nil)
| ~ ssList(esk8_0) ),
inference(rw,[status(thm)],[5240,3215,theory(equality)]) ).
cnf(5248,negated_conjecture,
( $false
| $false
| ~ ssList(esk8_0) ),
inference(rw,[status(thm)],[5247,153,theory(equality)]) ).
cnf(5249,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[5248,146,theory(equality)]) ).
cnf(5250,negated_conjecture,
$false,
inference(cn,[status(thm)],[5249,theory(equality)]) ).
cnf(5251,negated_conjecture,
$false,
5250,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC083+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpDssb33/sel_SWC083+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC083+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC083+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC083+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
%
%------------------------------------------------------------------------------