TSTP Solution File: SWC102+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC102+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:17:21 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 87 ( 23 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 91 ( 30 ~; 21 |; 27 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 24 ( 0 sgn 15 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/tmp/tmp5H2HhF/sel_SWC102+1.p_1',ax42) ).
fof(27,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ~ neq(X2,nil)
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
file('/tmp/tmp5H2HhF/sel_SWC102+1.p_1',co1) ).
fof(28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ~ neq(X2,nil)
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
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
| X4 != X3
| ~ neq(X2,nil)
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
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(148,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& X4 = X3
& neq(X2,nil)
& ( ~ neq(X1,nil)
| ~ frontsegP(X2,X1) ) ) ) ) ),
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
& X8 = X7
& neq(X6,nil)
& ( ~ neq(X5,nil)
| ~ frontsegP(X6,X5) ) ) ) ) ),
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
& esk9_0 = esk8_0
& neq(esk7_0,nil)
& ( ~ neq(esk6_0,nil)
| ~ frontsegP(esk7_0,esk6_0) ) ),
inference(skolemize,[status(esa)],[149]) ).
cnf(151,negated_conjecture,
( ~ frontsegP(esk7_0,esk6_0)
| ~ neq(esk6_0,nil) ),
inference(split_conjunct,[status(thm)],[150]) ).
cnf(152,negated_conjecture,
neq(esk7_0,nil),
inference(split_conjunct,[status(thm)],[150]) ).
cnf(153,negated_conjecture,
esk9_0 = esk8_0,
inference(split_conjunct,[status(thm)],[150]) ).
cnf(154,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[150]) ).
cnf(155,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[150]) ).
cnf(159,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[150]) ).
cnf(164,negated_conjecture,
esk7_0 = esk8_0,
inference(rw,[status(thm)],[153,155,theory(equality)]) ).
cnf(165,negated_conjecture,
esk7_0 = esk6_0,
inference(rw,[status(thm)],[164,154,theory(equality)]) ).
cnf(170,negated_conjecture,
neq(esk6_0,nil),
inference(rw,[status(thm)],[152,165,theory(equality)]) ).
cnf(174,negated_conjecture,
( ~ frontsegP(esk6_0,esk6_0)
| ~ neq(esk6_0,nil) ),
inference(rw,[status(thm)],[151,165,theory(equality)]) ).
cnf(175,negated_conjecture,
( ~ frontsegP(esk6_0,esk6_0)
| $false ),
inference(rw,[status(thm)],[174,170,theory(equality)]) ).
cnf(176,negated_conjecture,
~ frontsegP(esk6_0,esk6_0),
inference(cn,[status(thm)],[175,theory(equality)]) ).
cnf(177,negated_conjecture,
~ ssList(esk6_0),
inference(spm,[status(thm)],[176,61,theory(equality)]) ).
cnf(178,negated_conjecture,
$false,
inference(rw,[status(thm)],[177,159,theory(equality)]) ).
cnf(179,negated_conjecture,
$false,
inference(cn,[status(thm)],[178,theory(equality)]) ).
cnf(180,negated_conjecture,
$false,
179,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC102+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp5H2HhF/sel_SWC102+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC102+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC102+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC102+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
%
%------------------------------------------------------------------------------