TSTP Solution File: SWC017+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC017+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:05:52 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 5
% Syntax : Number of formulae : 59 ( 13 unt; 0 def)
% Number of atoms : 281 ( 95 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 343 ( 121 ~; 128 |; 79 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 52 ( 0 sgn 34 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/tmp/tmpJNBNY7/sel_SWC017+1.p_1',ax42) ).
fof(12,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpJNBNY7/sel_SWC017+1.p_1',ax46) ).
fof(21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpJNBNY7/sel_SWC017+1.p_1',ax15) ).
fof(23,axiom,
ssList(nil),
file('/tmp/tmpJNBNY7/sel_SWC017+1.p_1',ax17) ).
fof(27,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ),
file('/tmp/tmpJNBNY7/sel_SWC017+1.p_1',co1) ).
fof(28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[27]) ).
fof(29,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[28,theory(equality)]) ).
fof(59,plain,
! [X1] :
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(60,plain,
! [X2] :
( ~ ssList(X2)
| frontsegP(X2,X2) ),
inference(variable_rename,[status(thm)],[59]) ).
cnf(61,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[60]) ).
fof(74,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(nil,X1)
| nil = X1 )
& ( nil != X1
| frontsegP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(75,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ frontsegP(nil,X2)
| nil = X2 )
& ( nil != X2
| frontsegP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[74]) ).
fof(76,plain,
! [X2] :
( ( ~ frontsegP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| frontsegP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[75]) ).
cnf(78,plain,
( nil = X1
| ~ ssList(X1)
| ~ frontsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[76]) ).
fof(121,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(122,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[121]) ).
fof(123,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[122]) ).
fof(124,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)],[123]) ).
cnf(126,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(131,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[23]) ).
fof(148,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X2,X5)
| ~ frontsegP(X1,X5) ) ) )
& ( ( nil = X4
& nil = X3 )
| ( neq(X3,nil)
& frontsegP(X4,X3) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(149,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& ( ( nil = X7
& nil != X6 )
| ( neq(X7,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ frontsegP(X7,X10)
| ~ frontsegP(X6,X10) ) ) )
& ( ( nil = X9
& nil = X8 )
| ( neq(X8,nil)
& frontsegP(X9,X8) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[148]) ).
fof(150,negated_conjecture,
( ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ( ( nil = esk7_0
& nil != esk6_0 )
| ( neq(esk7_0,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ frontsegP(esk7_0,X10)
| ~ frontsegP(esk6_0,X10) ) ) )
& ( ( nil = esk9_0
& nil = esk8_0 )
| ( neq(esk8_0,nil)
& frontsegP(esk9_0,esk8_0) ) ) ),
inference(skolemize,[status(esa)],[149]) ).
fof(151,negated_conjecture,
! [X10] :
( ( ( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ frontsegP(esk7_0,X10)
| ~ frontsegP(esk6_0,X10) )
& neq(esk7_0,nil) )
| ( nil = esk7_0
& nil != esk6_0 ) )
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ( ( nil = esk9_0
& nil = esk8_0 )
| ( neq(esk8_0,nil)
& frontsegP(esk9_0,esk8_0) ) )
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0) ),
inference(shift_quantors,[status(thm)],[150]) ).
fof(152,negated_conjecture,
! [X10] :
( ( nil = esk7_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ frontsegP(esk7_0,X10)
| ~ frontsegP(esk6_0,X10) )
& ( nil != esk6_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ frontsegP(esk7_0,X10)
| ~ frontsegP(esk6_0,X10) )
& ( nil = esk7_0
| neq(esk7_0,nil) )
& ( nil != esk6_0
| neq(esk7_0,nil) )
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ( neq(esk8_0,nil)
| nil = esk9_0 )
& ( frontsegP(esk9_0,esk8_0)
| nil = esk9_0 )
& ( neq(esk8_0,nil)
| nil = esk8_0 )
& ( frontsegP(esk9_0,esk8_0)
| nil = esk8_0 )
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0) ),
inference(distribute,[status(thm)],[151]) ).
cnf(153,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(156,negated_conjecture,
( nil = esk8_0
| frontsegP(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(158,negated_conjecture,
( nil = esk9_0
| frontsegP(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(159,negated_conjecture,
( nil = esk9_0
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(160,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[152]) ).
cnf(161,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[152]) ).
cnf(163,negated_conjecture,
( neq(esk7_0,nil)
| nil != esk6_0 ),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(166,negated_conjecture,
( nil = esk7_0
| ~ frontsegP(esk6_0,X1)
| ~ frontsegP(esk7_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(167,negated_conjecture,
ssList(esk8_0),
inference(rw,[status(thm)],[153,160,theory(equality)]) ).
cnf(169,negated_conjecture,
( esk8_0 = nil
| frontsegP(esk7_0,esk8_0) ),
inference(rw,[status(thm)],[156,161,theory(equality)]) ).
cnf(170,negated_conjecture,
( esk7_0 = nil
| frontsegP(esk9_0,esk8_0) ),
inference(rw,[status(thm)],[158,161,theory(equality)]) ).
cnf(171,negated_conjecture,
( esk7_0 = nil
| frontsegP(esk7_0,esk8_0) ),
inference(rw,[status(thm)],[170,161,theory(equality)]) ).
cnf(172,negated_conjecture,
( esk7_0 = nil
| neq(esk8_0,nil) ),
inference(rw,[status(thm)],[159,161,theory(equality)]) ).
cnf(173,negated_conjecture,
( neq(esk7_0,nil)
| esk8_0 != nil ),
inference(rw,[status(thm)],[163,160,theory(equality)]) ).
cnf(183,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[126,theory(equality)]) ).
cnf(184,negated_conjecture,
( esk7_0 = nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk8_0,X1)
| ~ frontsegP(esk7_0,X1) ),
inference(rw,[status(thm)],[166,160,theory(equality)]) ).
cnf(187,negated_conjecture,
( esk7_0 = nil
| ~ frontsegP(esk8_0,esk8_0)
| ~ frontsegP(esk7_0,esk8_0)
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[184,172,theory(equality)]) ).
cnf(373,negated_conjecture,
( esk7_0 = nil
| ~ frontsegP(esk8_0,esk8_0)
| ~ frontsegP(esk7_0,esk8_0)
| $false ),
inference(rw,[status(thm)],[187,167,theory(equality)]) ).
cnf(374,negated_conjecture,
( esk7_0 = nil
| ~ frontsegP(esk8_0,esk8_0)
| ~ frontsegP(esk7_0,esk8_0) ),
inference(cn,[status(thm)],[373,theory(equality)]) ).
cnf(375,negated_conjecture,
( esk7_0 = nil
| ~ frontsegP(esk8_0,esk8_0) ),
inference(csr,[status(thm)],[374,171]) ).
cnf(376,negated_conjecture,
( esk7_0 = nil
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[375,61,theory(equality)]) ).
cnf(377,negated_conjecture,
( esk7_0 = nil
| $false ),
inference(rw,[status(thm)],[376,167,theory(equality)]) ).
cnf(378,negated_conjecture,
esk7_0 = nil,
inference(cn,[status(thm)],[377,theory(equality)]) ).
cnf(391,negated_conjecture,
( neq(nil,nil)
| esk8_0 != nil ),
inference(rw,[status(thm)],[173,378,theory(equality)]) ).
cnf(395,negated_conjecture,
( esk8_0 = nil
| frontsegP(nil,esk8_0) ),
inference(rw,[status(thm)],[169,378,theory(equality)]) ).
cnf(407,negated_conjecture,
( nil = esk8_0
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[78,395,theory(equality)]) ).
cnf(413,negated_conjecture,
( nil = esk8_0
| $false ),
inference(rw,[status(thm)],[407,167,theory(equality)]) ).
cnf(414,negated_conjecture,
nil = esk8_0,
inference(cn,[status(thm)],[413,theory(equality)]) ).
cnf(440,negated_conjecture,
( neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[391,414,theory(equality)]) ).
cnf(441,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[440,theory(equality)]) ).
cnf(444,negated_conjecture,
~ ssList(nil),
inference(spm,[status(thm)],[183,441,theory(equality)]) ).
cnf(446,negated_conjecture,
$false,
inference(rw,[status(thm)],[444,131,theory(equality)]) ).
cnf(447,negated_conjecture,
$false,
inference(cn,[status(thm)],[446,theory(equality)]) ).
cnf(448,negated_conjecture,
$false,
447,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC017+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpJNBNY7/sel_SWC017+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC017+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC017+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC017+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
%
%------------------------------------------------------------------------------