TSTP Solution File: SWC065+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC065+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:06 EST 2010
% Result : Theorem 0.40s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 7
% Syntax : Number of formulae : 82 ( 19 unt; 0 def)
% Number of atoms : 447 ( 147 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 585 ( 220 ~; 223 |; 117 &)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 131 ( 0 sgn 77 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpQqjQvp/sel_SWC065+1.p_1',ax28) ).
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/tmpQqjQvp/sel_SWC065+1.p_1',ax7) ).
fof(19,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpQqjQvp/sel_SWC065+1.p_1',ax58) ).
fof(20,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpQqjQvp/sel_SWC065+1.p_1',ax15) ).
fof(22,axiom,
ssList(nil),
file('/tmp/tmpQqjQvp/sel_SWC065+1.p_1',ax17) ).
fof(25,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/tmp/tmpQqjQvp/sel_SWC065+1.p_1',ax55) ).
fof(29,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X9] :
( ssList(X9)
& neq(X9,nil)
& segmentP(X2,X9)
& segmentP(X1,X9) ) ) ) ) ) ) ) ),
file('/tmp/tmpQqjQvp/sel_SWC065+1.p_1',co1) ).
fof(30,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X9] :
( ssList(X9)
& neq(X9,nil)
& segmentP(X2,X9)
& segmentP(X1,X9) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(31,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X9] :
( ssList(X9)
& neq(X9,nil)
& segmentP(X2,X9)
& segmentP(X1,X9) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[30,theory(equality)]) ).
fof(54,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(55,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[54]) ).
cnf(56,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[55]) ).
fof(87,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(88,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)],[87]) ).
fof(89,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)],[88]) ).
fof(90,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)],[89]) ).
fof(91,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)],[90]) ).
cnf(95,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[91]) ).
fof(114,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(nil,X1)
| nil = X1 )
& ( nil != X1
| segmentP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(115,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(nil,X2)
| nil = X2 )
& ( nil != X2
| segmentP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[114]) ).
fof(116,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[115]) ).
cnf(118,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[116]) ).
fof(119,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(120,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[119]) ).
fof(121,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[120]) ).
fof(122,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)],[121]) ).
cnf(123,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(124,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[122]) ).
cnf(129,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[22]) ).
fof(138,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(139,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[138]) ).
cnf(140,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[139]) ).
fof(160,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ? [X5] :
( ssList(X5)
& app(X3,X5) = X4
& equalelemsP(X3)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X3 ) ) ) )
& ( nil = X4
| nil != X3 )
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X9] :
( ~ ssList(X9)
| ~ neq(X9,nil)
| ~ segmentP(X2,X9)
| ~ segmentP(X1,X9) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(161,negated_conjecture,
? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& X11 = X13
& X10 = X12
& ? [X14] :
( ssList(X14)
& app(X12,X14) = X13
& equalelemsP(X12)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != X14
| ! [X17] :
( ~ ssList(X17)
| app(X17,cons(X15,nil)) != X12 ) ) ) )
& ( nil = X13
| nil != X12 )
& ( ( nil = X11
& nil != X10 )
| ( neq(X11,nil)
& ! [X18] :
( ~ ssList(X18)
| ~ neq(X18,nil)
| ~ segmentP(X11,X18)
| ~ segmentP(X10,X18) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[160]) ).
fof(162,negated_conjecture,
( ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& ssList(esk15_0)
& app(esk13_0,esk15_0) = esk14_0
& equalelemsP(esk13_0)
& ! [X15] :
( ~ ssItem(X15)
| ! [X16] :
( ~ ssList(X16)
| app(cons(X15,nil),X16) != esk15_0
| ! [X17] :
( ~ ssList(X17)
| app(X17,cons(X15,nil)) != esk13_0 ) ) )
& ( nil = esk14_0
| nil != esk13_0 )
& ( ( nil = esk12_0
& nil != esk11_0 )
| ( neq(esk12_0,nil)
& ! [X18] :
( ~ ssList(X18)
| ~ neq(X18,nil)
| ~ segmentP(esk12_0,X18)
| ~ segmentP(esk11_0,X18) ) ) ) ),
inference(skolemize,[status(esa)],[161]) ).
fof(163,negated_conjecture,
! [X15,X16,X17,X18] :
( ( ( ( ~ ssList(X18)
| ~ neq(X18,nil)
| ~ segmentP(esk12_0,X18)
| ~ segmentP(esk11_0,X18) )
& neq(esk12_0,nil) )
| ( nil = esk12_0
& nil != esk11_0 ) )
& ( ~ ssList(X17)
| app(X17,cons(X15,nil)) != esk13_0
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk15_0
| ~ ssItem(X15) )
& app(esk13_0,esk15_0) = esk14_0
& equalelemsP(esk13_0)
& ssList(esk15_0)
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& ( nil = esk14_0
| nil != esk13_0 )
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0)
& ssList(esk11_0) ),
inference(shift_quantors,[status(thm)],[162]) ).
fof(164,negated_conjecture,
! [X15,X16,X17,X18] :
( ( nil = esk12_0
| ~ ssList(X18)
| ~ neq(X18,nil)
| ~ segmentP(esk12_0,X18)
| ~ segmentP(esk11_0,X18) )
& ( nil != esk11_0
| ~ ssList(X18)
| ~ neq(X18,nil)
| ~ segmentP(esk12_0,X18)
| ~ segmentP(esk11_0,X18) )
& ( nil = esk12_0
| neq(esk12_0,nil) )
& ( nil != esk11_0
| neq(esk12_0,nil) )
& ( ~ ssList(X17)
| app(X17,cons(X15,nil)) != esk13_0
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk15_0
| ~ ssItem(X15) )
& app(esk13_0,esk15_0) = esk14_0
& equalelemsP(esk13_0)
& ssList(esk15_0)
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& ( nil = esk14_0
| nil != esk13_0 )
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0)
& ssList(esk11_0) ),
inference(distribute,[status(thm)],[163]) ).
cnf(165,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[164]) ).
cnf(166,negated_conjecture,
ssList(esk12_0),
inference(split_conjunct,[status(thm)],[164]) ).
cnf(169,negated_conjecture,
( nil = esk14_0
| nil != esk13_0 ),
inference(split_conjunct,[status(thm)],[164]) ).
cnf(170,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[164]) ).
cnf(171,negated_conjecture,
esk12_0 = esk14_0,
inference(split_conjunct,[status(thm)],[164]) ).
cnf(172,negated_conjecture,
ssList(esk15_0),
inference(split_conjunct,[status(thm)],[164]) ).
cnf(174,negated_conjecture,
app(esk13_0,esk15_0) = esk14_0,
inference(split_conjunct,[status(thm)],[164]) ).
cnf(176,negated_conjecture,
( neq(esk12_0,nil)
| nil != esk11_0 ),
inference(split_conjunct,[status(thm)],[164]) ).
cnf(179,negated_conjecture,
( nil = esk12_0
| ~ segmentP(esk11_0,X1)
| ~ segmentP(esk12_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[164]) ).
cnf(185,negated_conjecture,
( esk12_0 = nil
| esk13_0 != nil ),
inference(rw,[status(thm)],[169,171,theory(equality)]) ).
cnf(186,negated_conjecture,
( esk12_0 = nil
| esk11_0 != nil ),
inference(rw,[status(thm)],[185,170,theory(equality)]) ).
cnf(187,negated_conjecture,
app(esk11_0,esk15_0) = esk14_0,
inference(rw,[status(thm)],[174,170,theory(equality)]) ).
cnf(188,negated_conjecture,
app(esk11_0,esk15_0) = esk12_0,
inference(rw,[status(thm)],[187,171,theory(equality)]) ).
cnf(205,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[124,theory(equality)]) ).
cnf(220,negated_conjecture,
( esk12_0 = nil
| ~ segmentP(esk12_0,esk11_0)
| ~ neq(esk11_0,nil)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[179,140,theory(equality)]) ).
cnf(224,negated_conjecture,
( esk12_0 = nil
| ~ segmentP(esk12_0,esk11_0)
| ~ neq(esk11_0,nil)
| $false ),
inference(rw,[status(thm)],[220,165,theory(equality)]) ).
cnf(225,negated_conjecture,
( esk12_0 = nil
| ~ segmentP(esk12_0,esk11_0)
| ~ neq(esk11_0,nil) ),
inference(cn,[status(thm)],[224,theory(equality)]) ).
cnf(321,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[95,56,theory(equality)]) ).
cnf(331,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| $false
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[321,129,theory(equality)]) ).
cnf(332,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[331,theory(equality)]) ).
cnf(3617,negated_conjecture,
( segmentP(X1,esk11_0)
| esk12_0 != X1
| ~ ssList(esk15_0)
| ~ ssList(esk11_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[332,188,theory(equality)]) ).
cnf(3638,negated_conjecture,
( segmentP(X1,esk11_0)
| esk12_0 != X1
| ~ ssList(esk15_0)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[3617,165,theory(equality)]) ).
cnf(3639,negated_conjecture,
( segmentP(X1,esk11_0)
| esk12_0 != X1
| ~ ssList(esk15_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[3638,theory(equality)]) ).
cnf(4060,negated_conjecture,
( segmentP(X1,esk11_0)
| esk12_0 != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[3639,172,theory(equality)]) ).
cnf(4061,negated_conjecture,
( segmentP(esk12_0,esk11_0)
| ~ ssList(esk12_0) ),
inference(er,[status(thm)],[4060,theory(equality)]) ).
cnf(4062,negated_conjecture,
( segmentP(esk12_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[4061,166,theory(equality)]) ).
cnf(4063,negated_conjecture,
segmentP(esk12_0,esk11_0),
inference(cn,[status(thm)],[4062,theory(equality)]) ).
cnf(4105,negated_conjecture,
( esk12_0 = nil
| $false
| ~ neq(esk11_0,nil) ),
inference(rw,[status(thm)],[225,4063,theory(equality)]) ).
cnf(4106,negated_conjecture,
( esk12_0 = nil
| ~ neq(esk11_0,nil) ),
inference(cn,[status(thm)],[4105,theory(equality)]) ).
cnf(4125,negated_conjecture,
( esk12_0 = nil
| esk11_0 = nil
| ~ ssList(nil)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[4106,123,theory(equality)]) ).
cnf(4127,negated_conjecture,
( esk12_0 = nil
| esk11_0 = nil
| $false
| ~ ssList(esk11_0) ),
inference(rw,[status(thm)],[4125,129,theory(equality)]) ).
cnf(4128,negated_conjecture,
( esk12_0 = nil
| esk11_0 = nil
| $false
| $false ),
inference(rw,[status(thm)],[4127,165,theory(equality)]) ).
cnf(4129,negated_conjecture,
( esk12_0 = nil
| esk11_0 = nil ),
inference(cn,[status(thm)],[4128,theory(equality)]) ).
cnf(4130,negated_conjecture,
esk12_0 = nil,
inference(csr,[status(thm)],[4129,186]) ).
cnf(4131,negated_conjecture,
segmentP(nil,esk11_0),
inference(rw,[status(thm)],[4063,4130,theory(equality)]) ).
cnf(4230,negated_conjecture,
( neq(nil,nil)
| esk11_0 != nil ),
inference(rw,[status(thm)],[176,4130,theory(equality)]) ).
cnf(4234,negated_conjecture,
( nil = esk11_0
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[118,4131,theory(equality)]) ).
cnf(4241,negated_conjecture,
( nil = esk11_0
| $false ),
inference(rw,[status(thm)],[4234,165,theory(equality)]) ).
cnf(4242,negated_conjecture,
nil = esk11_0,
inference(cn,[status(thm)],[4241,theory(equality)]) ).
cnf(4296,negated_conjecture,
( neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[4230,4242,theory(equality)]) ).
cnf(4297,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[4296,theory(equality)]) ).
cnf(4298,negated_conjecture,
~ ssList(nil),
inference(spm,[status(thm)],[205,4297,theory(equality)]) ).
cnf(4300,negated_conjecture,
$false,
inference(rw,[status(thm)],[4298,129,theory(equality)]) ).
cnf(4301,negated_conjecture,
$false,
inference(cn,[status(thm)],[4300,theory(equality)]) ).
cnf(4302,negated_conjecture,
$false,
4301,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC065+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpQqjQvp/sel_SWC065+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC065+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC065+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC065+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
%
%------------------------------------------------------------------------------