TSTP Solution File: SWC269+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC269+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:10:16 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 6 unt; 0 def)
% Number of atoms : 104 ( 15 equ)
% Maximal formula atoms : 14 ( 8 avg)
% Number of connectives : 130 ( 39 ~; 31 |; 48 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 10 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 16 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(45,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| totalorderedP(X1) ) ) ) ) ),
file('/tmp/tmpSgPl05/sel_SWC269+1.p_1',co1) ).
fof(46,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| totalorderedP(X1) ) ) ) ) ),
inference(assume_negation,[status(cth)],[45]) ).
fof(47,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| totalorderedP(X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[46,theory(equality)]) ).
fof(252,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& frontsegP(X4,X3)
& totalorderedP(X3)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X3,X5)
| ~ frontsegP(X4,X5)
| ~ segmentP(X5,X3)
| ~ totalorderedP(X5) )
& ~ totalorderedP(X1) ) ) ) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(253,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& frontsegP(X9,X8)
& totalorderedP(X8)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X8,X10)
| ~ frontsegP(X9,X10)
| ~ segmentP(X10,X8)
| ~ totalorderedP(X10) )
& ~ totalorderedP(X6) ) ) ) ),
inference(variable_rename,[status(thm)],[252]) ).
fof(254,negated_conjecture,
( ssList(esk14_0)
& ssList(esk15_0)
& ssList(esk16_0)
& ssList(esk17_0)
& esk15_0 = esk17_0
& esk14_0 = esk16_0
& frontsegP(esk17_0,esk16_0)
& totalorderedP(esk16_0)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(esk16_0,X10)
| ~ frontsegP(esk17_0,X10)
| ~ segmentP(X10,esk16_0)
| ~ totalorderedP(X10) )
& ~ totalorderedP(esk14_0) ),
inference(skolemize,[status(esa)],[253]) ).
fof(255,negated_conjecture,
! [X10] :
( ( ~ ssList(X10)
| ~ neq(esk16_0,X10)
| ~ frontsegP(esk17_0,X10)
| ~ segmentP(X10,esk16_0)
| ~ totalorderedP(X10) )
& esk15_0 = esk17_0
& esk14_0 = esk16_0
& frontsegP(esk17_0,esk16_0)
& totalorderedP(esk16_0)
& ~ totalorderedP(esk14_0)
& ssList(esk17_0)
& ssList(esk16_0)
& ssList(esk15_0)
& ssList(esk14_0) ),
inference(shift_quantors,[status(thm)],[254]) ).
cnf(260,negated_conjecture,
~ totalorderedP(esk14_0),
inference(split_conjunct,[status(thm)],[255]) ).
cnf(261,negated_conjecture,
totalorderedP(esk16_0),
inference(split_conjunct,[status(thm)],[255]) ).
cnf(263,negated_conjecture,
esk14_0 = esk16_0,
inference(split_conjunct,[status(thm)],[255]) ).
cnf(268,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[260,263,theory(equality)]),261,theory(equality)]) ).
cnf(269,negated_conjecture,
$false,
inference(cn,[status(thm)],[268,theory(equality)]) ).
cnf(270,negated_conjecture,
$false,
269,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC269+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpSgPl05/sel_SWC269+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC269+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC269+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC269+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
%
%------------------------------------------------------------------------------