TSTP Solution File: SWC208+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC208+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:51:39 EST 2010
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 106 ( 37 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 114 ( 30 ~; 28 |; 44 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 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 : 20 ( 0 sgn 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(27,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ) ),
file('/tmp/tmpJYROl_/sel_SWC208+1.p_1',co1) ).
fof(28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( ( 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
| ~ neq(X2,nil)
| neq(X1,nil)
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[28,theory(equality)]) ).
fof(148,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& neq(X2,nil)
& ~ neq(X1,nil)
& ( ( nil = X4
& nil = X3 )
| ( 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
& neq(X6,nil)
& ~ neq(X5,nil)
& ( ( nil = X8
& nil = X7 )
| ( 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
& neq(esk7_0,nil)
& ~ neq(esk6_0,nil)
& ( ( nil = esk9_0
& nil = esk8_0 )
| ( 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
& neq(esk7_0,nil)
& ~ neq(esk6_0,nil)
& ( 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 ) ),
inference(distribute,[status(thm)],[150]) ).
cnf(153,negated_conjecture,
( nil = esk8_0
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(155,negated_conjecture,
( nil = esk9_0
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(156,negated_conjecture,
~ neq(esk6_0,nil),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(157,negated_conjecture,
neq(esk7_0,nil),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(158,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[151]) ).
cnf(159,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[151]) ).
cnf(166,negated_conjecture,
neq(esk9_0,nil),
inference(rw,[status(thm)],[157,159,theory(equality)]) ).
cnf(167,negated_conjecture,
~ neq(esk8_0,nil),
inference(rw,[status(thm)],[156,158,theory(equality)]) ).
cnf(168,negated_conjecture,
esk8_0 = nil,
inference(sr,[status(thm)],[153,167,theory(equality)]) ).
cnf(173,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[167,168,theory(equality)]) ).
cnf(177,negated_conjecture,
( esk9_0 = nil
| neq(nil,nil) ),
inference(rw,[status(thm)],[155,168,theory(equality)]) ).
cnf(333,negated_conjecture,
esk9_0 = nil,
inference(sr,[status(thm)],[177,173,theory(equality)]) ).
cnf(338,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[166,333,theory(equality)]) ).
cnf(339,negated_conjecture,
$false,
inference(sr,[status(thm)],[338,173,theory(equality)]) ).
cnf(340,negated_conjecture,
$false,
339,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC208+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpJYROl_/sel_SWC208+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC208+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC208+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC208+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
%
%------------------------------------------------------------------------------