TSTP Solution File: SWC071+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC071+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 10:16:13 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 6
% Syntax : Number of formulae : 73 ( 17 unt; 0 def)
% Number of atoms : 438 ( 134 equ)
% Maximal formula atoms : 48 ( 6 avg)
% Number of connectives : 586 ( 221 ~; 222 |; 120 &)
% ( 2 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn 72 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/tmp/tmp8fjHVl/sel_SWC071+1.p_1',ax21) ).
fof(15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/tmp/tmp8fjHVl/sel_SWC071+1.p_1',ax7) ).
fof(26,axiom,
ssList(nil),
file('/tmp/tmp8fjHVl/sel_SWC071+1.p_1',ax17) ).
fof(33,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/tmp/tmp8fjHVl/sel_SWC071+1.p_1',ax55) ).
fof(36,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmp8fjHVl/sel_SWC071+1.p_1',ax15) ).
fof(39,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( cons(X6,nil) != X3
| app(app(X7,X3),X8) != X4
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X6,X9) )
| ? [X10] :
( ssItem(X10)
& memberP(X8,X10)
& lt(X10,X6) ) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/tmp/tmp8fjHVl/sel_SWC071+1.p_1',co1) ).
fof(40,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( cons(X6,nil) != X3
| app(app(X7,X3),X8) != X4
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X6,X9) )
| ? [X10] :
( ssItem(X10)
& memberP(X8,X10)
& lt(X10,X6) ) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[39]) ).
fof(81,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| nil != cons(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(82,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3) ) ),
inference(variable_rename,[status(thm)],[81]) ).
fof(83,plain,
! [X3,X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[82]) ).
cnf(84,plain,
( ~ ssList(X1)
| nil != cons(X2,X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[83]) ).
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)],[15]) ).
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(esk7_2(X5,X6))
& ssList(esk8_2(X5,X6))
& app(app(esk7_2(X5,X6),X6),esk8_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(esk7_2(X5,X6))
& ssList(esk8_2(X5,X6))
& app(app(esk7_2(X5,X6),X6),esk8_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(esk7_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk8_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk7_2(X5,X6),X6),esk8_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]) ).
cnf(166,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[26]) ).
fof(196,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_nnf,[status(thm)],[33]) ).
fof(197,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[196]) ).
cnf(198,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[197]) ).
fof(206,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(207,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[206]) ).
fof(208,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[207]) ).
fof(209,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)],[208]) ).
cnf(210,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[209]) ).
fof(219,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X1,X5) )
& ( nil != X2
| nil != X1 )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& cons(X6,nil) = X3
& app(app(X7,X3),X8) = X4
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ~ lt(X6,X9) )
& ! [X10] :
( ~ ssItem(X10)
| ~ memberP(X8,X10)
| ~ lt(X10,X6) ) ) ) )
| ( nil = X4
& nil = X3 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[40]) ).
fof(220,negated_conjecture,
? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& X12 = X14
& X11 = X13
& ! [X15] :
( ~ ssList(X15)
| ~ neq(X15,nil)
| ~ segmentP(X12,X15)
| ~ segmentP(X11,X15) )
& ( nil != X12
| nil != X11 )
& ( ? [X16] :
( ssItem(X16)
& ? [X17] :
( ssList(X17)
& ? [X18] :
( ssList(X18)
& cons(X16,nil) = X13
& app(app(X17,X13),X18) = X14
& ! [X19] :
( ~ ssItem(X19)
| ~ memberP(X17,X19)
| ~ lt(X16,X19) )
& ! [X20] :
( ~ ssItem(X20)
| ~ memberP(X18,X20)
| ~ lt(X20,X16) ) ) ) )
| ( nil = X14
& nil = X13 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[219]) ).
fof(221,negated_conjecture,
( ssList(esk9_0)
& ssList(esk10_0)
& ssList(esk11_0)
& ssList(esk12_0)
& esk10_0 = esk12_0
& esk9_0 = esk11_0
& ! [X15] :
( ~ ssList(X15)
| ~ neq(X15,nil)
| ~ segmentP(esk10_0,X15)
| ~ segmentP(esk9_0,X15) )
& ( nil != esk10_0
| nil != esk9_0 )
& ( ( ssItem(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& cons(esk13_0,nil) = esk11_0
& app(app(esk14_0,esk11_0),esk15_0) = esk12_0
& ! [X19] :
( ~ ssItem(X19)
| ~ memberP(esk14_0,X19)
| ~ lt(esk13_0,X19) )
& ! [X20] :
( ~ ssItem(X20)
| ~ memberP(esk15_0,X20)
| ~ lt(X20,esk13_0) ) )
| ( nil = esk12_0
& nil = esk11_0 ) ) ),
inference(skolemize,[status(esa)],[220]) ).
fof(222,negated_conjecture,
! [X15,X19,X20] :
( ( ( ( ~ ssItem(X20)
| ~ memberP(esk15_0,X20)
| ~ lt(X20,esk13_0) )
& ( ~ ssItem(X19)
| ~ memberP(esk14_0,X19)
| ~ lt(esk13_0,X19) )
& cons(esk13_0,nil) = esk11_0
& app(app(esk14_0,esk11_0),esk15_0) = esk12_0
& ssList(esk15_0)
& ssList(esk14_0)
& ssItem(esk13_0) )
| ( nil = esk12_0
& nil = esk11_0 ) )
& ( ~ ssList(X15)
| ~ neq(X15,nil)
| ~ segmentP(esk10_0,X15)
| ~ segmentP(esk9_0,X15) )
& esk10_0 = esk12_0
& esk9_0 = esk11_0
& ( nil != esk10_0
| nil != esk9_0 )
& ssList(esk12_0)
& ssList(esk11_0)
& ssList(esk10_0)
& ssList(esk9_0) ),
inference(shift_quantors,[status(thm)],[221]) ).
fof(223,negated_conjecture,
! [X15,X19,X20] :
( ( nil = esk12_0
| ~ ssItem(X20)
| ~ memberP(esk15_0,X20)
| ~ lt(X20,esk13_0) )
& ( nil = esk11_0
| ~ ssItem(X20)
| ~ memberP(esk15_0,X20)
| ~ lt(X20,esk13_0) )
& ( nil = esk12_0
| ~ ssItem(X19)
| ~ memberP(esk14_0,X19)
| ~ lt(esk13_0,X19) )
& ( nil = esk11_0
| ~ ssItem(X19)
| ~ memberP(esk14_0,X19)
| ~ lt(esk13_0,X19) )
& ( nil = esk12_0
| cons(esk13_0,nil) = esk11_0 )
& ( nil = esk11_0
| cons(esk13_0,nil) = esk11_0 )
& ( nil = esk12_0
| app(app(esk14_0,esk11_0),esk15_0) = esk12_0 )
& ( nil = esk11_0
| app(app(esk14_0,esk11_0),esk15_0) = esk12_0 )
& ( nil = esk12_0
| ssList(esk15_0) )
& ( nil = esk11_0
| ssList(esk15_0) )
& ( nil = esk12_0
| ssList(esk14_0) )
& ( nil = esk11_0
| ssList(esk14_0) )
& ( nil = esk12_0
| ssItem(esk13_0) )
& ( nil = esk11_0
| ssItem(esk13_0) )
& ( ~ ssList(X15)
| ~ neq(X15,nil)
| ~ segmentP(esk10_0,X15)
| ~ segmentP(esk9_0,X15) )
& esk10_0 = esk12_0
& esk9_0 = esk11_0
& ( nil != esk10_0
| nil != esk9_0 )
& ssList(esk12_0)
& ssList(esk11_0)
& ssList(esk10_0)
& ssList(esk9_0) ),
inference(distribute,[status(thm)],[222]) ).
cnf(224,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[223]) ).
cnf(225,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[223]) ).
cnf(228,negated_conjecture,
( nil != esk9_0
| nil != esk10_0 ),
inference(split_conjunct,[status(thm)],[223]) ).
cnf(229,negated_conjecture,
esk9_0 = esk11_0,
inference(split_conjunct,[status(thm)],[223]) ).
cnf(230,negated_conjecture,
esk10_0 = esk12_0,
inference(split_conjunct,[status(thm)],[223]) ).
cnf(231,negated_conjecture,
( ~ segmentP(esk9_0,X1)
| ~ segmentP(esk10_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[223]) ).
cnf(233,negated_conjecture,
( ssItem(esk13_0)
| nil = esk12_0 ),
inference(split_conjunct,[status(thm)],[223]) ).
cnf(234,negated_conjecture,
( ssList(esk14_0)
| nil = esk11_0 ),
inference(split_conjunct,[status(thm)],[223]) ).
cnf(236,negated_conjecture,
( ssList(esk15_0)
| nil = esk11_0 ),
inference(split_conjunct,[status(thm)],[223]) ).
cnf(238,negated_conjecture,
( app(app(esk14_0,esk11_0),esk15_0) = esk12_0
| nil = esk11_0 ),
inference(split_conjunct,[status(thm)],[223]) ).
cnf(241,negated_conjecture,
( cons(esk13_0,nil) = esk11_0
| nil = esk12_0 ),
inference(split_conjunct,[status(thm)],[223]) ).
cnf(246,negated_conjecture,
ssList(esk11_0),
inference(rw,[status(thm)],[224,229,theory(equality)]) ).
cnf(247,negated_conjecture,
ssList(esk12_0),
inference(rw,[status(thm)],[225,230,theory(equality)]) ).
cnf(248,negated_conjecture,
( esk11_0 != nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[228,229,theory(equality)]) ).
cnf(249,negated_conjecture,
( esk11_0 != nil
| esk12_0 != nil ),
inference(rw,[status(thm)],[248,230,theory(equality)]) ).
cnf(266,negated_conjecture,
( esk12_0 = nil
| esk11_0 != nil
| ~ ssItem(esk13_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[84,241,theory(equality)]) ).
cnf(269,negated_conjecture,
( esk12_0 = nil
| esk11_0 != nil
| ~ ssItem(esk13_0)
| $false ),
inference(rw,[status(thm)],[266,166,theory(equality)]) ).
cnf(270,negated_conjecture,
( esk12_0 = nil
| esk11_0 != nil
| ~ ssItem(esk13_0) ),
inference(cn,[status(thm)],[269,theory(equality)]) ).
cnf(292,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk11_0,X1)
| ~ segmentP(esk10_0,X1) ),
inference(rw,[status(thm)],[231,229,theory(equality)]) ).
cnf(293,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk11_0,X1)
| ~ segmentP(esk12_0,X1) ),
inference(rw,[status(thm)],[292,230,theory(equality)]) ).
cnf(294,negated_conjecture,
( X1 = nil
| ~ segmentP(esk11_0,X1)
| ~ segmentP(esk12_0,X1)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[293,210,theory(equality)]) ).
cnf(296,negated_conjecture,
( X1 = nil
| ~ segmentP(esk11_0,X1)
| ~ segmentP(esk12_0,X1)
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[294,166,theory(equality)]) ).
cnf(297,negated_conjecture,
( X1 = nil
| ~ segmentP(esk11_0,X1)
| ~ segmentP(esk12_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[296,theory(equality)]) ).
cnf(609,negated_conjecture,
( esk12_0 = nil
| esk11_0 != nil ),
inference(csr,[status(thm)],[270,233]) ).
cnf(610,negated_conjecture,
esk11_0 != nil,
inference(csr,[status(thm)],[609,249]) ).
cnf(611,negated_conjecture,
ssList(esk14_0),
inference(sr,[status(thm)],[234,610,theory(equality)]) ).
cnf(612,negated_conjecture,
ssList(esk15_0),
inference(sr,[status(thm)],[236,610,theory(equality)]) ).
cnf(615,negated_conjecture,
app(app(esk14_0,esk11_0),esk15_0) = esk12_0,
inference(sr,[status(thm)],[238,610,theory(equality)]) ).
cnf(683,negated_conjecture,
( segmentP(X1,esk11_0)
| esk12_0 != X1
| ~ ssList(esk15_0)
| ~ ssList(esk14_0)
| ~ ssList(esk11_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[120,615,theory(equality)]) ).
cnf(718,negated_conjecture,
( segmentP(X1,esk11_0)
| esk12_0 != X1
| $false
| ~ ssList(esk14_0)
| ~ ssList(esk11_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[683,612,theory(equality)]) ).
cnf(719,negated_conjecture,
( segmentP(X1,esk11_0)
| esk12_0 != X1
| $false
| $false
| ~ ssList(esk11_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[718,611,theory(equality)]) ).
cnf(720,negated_conjecture,
( segmentP(X1,esk11_0)
| esk12_0 != X1
| $false
| $false
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[719,246,theory(equality)]) ).
cnf(721,negated_conjecture,
( segmentP(X1,esk11_0)
| esk12_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[720,theory(equality)]) ).
cnf(742,negated_conjecture,
( esk11_0 = nil
| ~ segmentP(esk11_0,esk11_0)
| ~ ssList(esk11_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[297,721,theory(equality)]) ).
cnf(751,negated_conjecture,
( esk11_0 = nil
| ~ segmentP(esk11_0,esk11_0)
| $false
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[742,246,theory(equality)]) ).
cnf(752,negated_conjecture,
( esk11_0 = nil
| ~ segmentP(esk11_0,esk11_0)
| $false
| $false ),
inference(rw,[status(thm)],[751,247,theory(equality)]) ).
cnf(753,negated_conjecture,
( esk11_0 = nil
| ~ segmentP(esk11_0,esk11_0) ),
inference(cn,[status(thm)],[752,theory(equality)]) ).
cnf(754,negated_conjecture,
~ segmentP(esk11_0,esk11_0),
inference(sr,[status(thm)],[753,610,theory(equality)]) ).
cnf(820,negated_conjecture,
~ ssList(esk11_0),
inference(spm,[status(thm)],[754,198,theory(equality)]) ).
cnf(822,negated_conjecture,
$false,
inference(rw,[status(thm)],[820,246,theory(equality)]) ).
cnf(823,negated_conjecture,
$false,
inference(cn,[status(thm)],[822,theory(equality)]) ).
cnf(824,negated_conjecture,
$false,
823,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC071+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp8fjHVl/sel_SWC071+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC071+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC071+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC071+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
%
%------------------------------------------------------------------------------