%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC352+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 11:37:30 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 43 ( 16 unt; 0 def)
% Number of atoms : 177 ( 57 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 208 ( 74 ~; 68 |; 49 &)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 37 ( 0 sgn 26 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(12,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpZrNYV_/sel_SWC352+1.p_1',ax46) ).
fof(21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpZrNYV_/sel_SWC352+1.p_1',ax15) ).
fof(23,axiom,
ssList(nil),
file('/tmp/tmpZrNYV_/sel_SWC352+1.p_1',ax17) ).
fof(27,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| frontsegP(X2,X1)
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ) ),
file('/tmp/tmpZrNYV_/sel_SWC352+1.p_1',co1) ).
fof(28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| frontsegP(X2,X1)
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ 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
| frontsegP(X2,X1)
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[28,theory(equality)]) ).
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(77,plain,
( frontsegP(nil,X1)
| ~ ssList(X1)
| 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(125,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(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
& ~ frontsegP(X2,X1)
& ( nil = X3
| nil != X4 )
& ( ~ neq(X4,nil)
| ( neq(X3,nil)
& frontsegP(X4,X3) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(149,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& ~ frontsegP(X6,X5)
& ( nil = X7
| nil != X8 )
& ( ~ neq(X8,nil)
| ( neq(X7,nil)
& frontsegP(X8,X7) ) ) ) ) ) ),
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
& ~ frontsegP(esk7_0,esk6_0)
& ( nil = esk8_0
| nil != esk9_0 )
& ( ~ neq(esk9_0,nil)
| ( neq(esk8_0,nil)
& frontsegP(esk9_0,esk8_0) ) ) ),
inference(skolemize,[status(esa)],[149]) ).
fof(151,negated_conjecture,
( ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ~ frontsegP(esk7_0,esk6_0)
& ( nil = esk8_0
| nil != esk9_0 )
& ( neq(esk8_0,nil)
| ~ neq(esk9_0,nil) )
& ( frontsegP(esk9_0,esk8_0)
| ~ neq(esk9_0,nil) ) ),
inference(distribute,[status(thm)],[150]) ).
cnf(152,negated_conjecture,
( frontsegP(esk9_0,esk8_0)
| ~ neq(esk9_0,nil) ),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(154,negated_conjecture,
( nil = esk8_0
| nil != esk9_0 ),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(155,negated_conjecture,
~ frontsegP(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(156,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[151]) ).
cnf(157,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[151]) ).
cnf(160,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(163,negated_conjecture,
ssList(esk9_0),
inference(rw,[status(thm)],[160,157,theory(equality)]) ).
cnf(164,negated_conjecture,
~ frontsegP(esk9_0,esk8_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[155,157,theory(equality)]),156,theory(equality)]) ).
cnf(165,negated_conjecture,
~ neq(esk9_0,nil),
inference(sr,[status(thm)],[152,164,theory(equality)]) ).
cnf(166,plain,
( frontsegP(nil,nil)
| ~ ssList(nil) ),
inference(er,[status(thm)],[77,theory(equality)]) ).
cnf(167,plain,
( frontsegP(nil,nil)
| $false ),
inference(rw,[status(thm)],[166,131,theory(equality)]) ).
cnf(168,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[167,theory(equality)]) ).
cnf(169,negated_conjecture,
( esk9_0 = nil
| ~ ssList(nil)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[165,125,theory(equality)]) ).
cnf(170,negated_conjecture,
( esk9_0 = nil
| $false
| ~ ssList(esk9_0) ),
inference(rw,[status(thm)],[169,131,theory(equality)]) ).
cnf(171,negated_conjecture,
( esk9_0 = nil
| ~ ssList(esk9_0) ),
inference(cn,[status(thm)],[170,theory(equality)]) ).
cnf(320,negated_conjecture,
( esk9_0 = nil
| $false ),
inference(rw,[status(thm)],[171,163,theory(equality)]) ).
cnf(321,negated_conjecture,
esk9_0 = nil,
inference(cn,[status(thm)],[320,theory(equality)]) ).
cnf(327,negated_conjecture,
~ frontsegP(nil,esk8_0),
inference(rw,[status(thm)],[164,321,theory(equality)]) ).
cnf(328,negated_conjecture,
( esk8_0 = nil
| $false ),
inference(rw,[status(thm)],[154,321,theory(equality)]) ).
cnf(329,negated_conjecture,
esk8_0 = nil,
inference(cn,[status(thm)],[328,theory(equality)]) ).
cnf(338,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[327,329,theory(equality)]),168,theory(equality)]) ).
cnf(339,negated_conjecture,
$false,
inference(cn,[status(thm)],[338,theory(equality)]) ).
cnf(340,negated_conjecture,
$false,
339,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC352+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpZrNYV_/sel_SWC352+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC352+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC352+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC352+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
%
%------------------------------------------------------------------------------