TSTP Solution File: SWC121+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC121+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:20:34 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 134 ( 16 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 157 ( 47 ~; 49 |; 49 &)
% ( 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(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ~ neq(X3,nil)
| ~ segmentP(X4,X3)
| ( neq(X1,nil)
& segmentP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/tmp/tmpcrmixa/sel_SWC121+1.p_1',co1) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ~ neq(X3,nil)
| ~ segmentP(X4,X3)
| ( neq(X1,nil)
& segmentP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ~ neq(X3,nil)
| ~ segmentP(X4,X3)
| ( neq(X1,nil)
& segmentP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(141,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( neq(X2,nil)
& neq(X3,nil)
& segmentP(X4,X3)
& ( ~ neq(X1,nil)
| ~ segmentP(X2,X1) ) )
| ( neq(X2,nil)
& ~ neq(X4,nil) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(142,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& ( ( neq(X6,nil)
& neq(X7,nil)
& segmentP(X8,X7)
& ( ~ neq(X5,nil)
| ~ segmentP(X6,X5) ) )
| ( neq(X6,nil)
& ~ neq(X8,nil) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[141]) ).
fof(143,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( ( neq(esk8_0,nil)
& neq(esk9_0,nil)
& segmentP(esk10_0,esk9_0)
& ( ~ neq(esk7_0,nil)
| ~ segmentP(esk8_0,esk7_0) ) )
| ( neq(esk8_0,nil)
& ~ neq(esk10_0,nil) ) ) ),
inference(skolemize,[status(esa)],[142]) ).
fof(144,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( neq(esk8_0,nil)
| neq(esk8_0,nil) )
& ( ~ neq(esk10_0,nil)
| neq(esk8_0,nil) )
& ( neq(esk8_0,nil)
| neq(esk9_0,nil) )
& ( ~ neq(esk10_0,nil)
| neq(esk9_0,nil) )
& ( neq(esk8_0,nil)
| segmentP(esk10_0,esk9_0) )
& ( ~ neq(esk10_0,nil)
| segmentP(esk10_0,esk9_0) )
& ( neq(esk8_0,nil)
| ~ neq(esk7_0,nil)
| ~ segmentP(esk8_0,esk7_0) )
& ( ~ neq(esk10_0,nil)
| ~ neq(esk7_0,nil)
| ~ segmentP(esk8_0,esk7_0) ) ),
inference(distribute,[status(thm)],[143]) ).
cnf(145,negated_conjecture,
( ~ segmentP(esk8_0,esk7_0)
| ~ neq(esk7_0,nil)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(147,negated_conjecture,
( segmentP(esk10_0,esk9_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(149,negated_conjecture,
( neq(esk9_0,nil)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(152,negated_conjecture,
( neq(esk8_0,nil)
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(153,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(154,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(170,negated_conjecture,
( neq(esk7_0,nil)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[149,153,theory(equality)]) ).
cnf(171,negated_conjecture,
( neq(esk7_0,nil)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[170,154,theory(equality)]),152,theory(equality)]) ).
cnf(172,negated_conjecture,
neq(esk7_0,nil),
inference(cn,[status(thm)],[171,theory(equality)]) ).
cnf(173,negated_conjecture,
( segmentP(esk8_0,esk7_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[147,154,theory(equality)]),153,theory(equality)]) ).
cnf(174,negated_conjecture,
( segmentP(esk8_0,esk7_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[173,154,theory(equality)]),152,theory(equality)]) ).
cnf(175,negated_conjecture,
segmentP(esk8_0,esk7_0),
inference(cn,[status(thm)],[174,theory(equality)]) ).
cnf(196,negated_conjecture,
( $false
| ~ neq(esk10_0,nil)
| ~ segmentP(esk8_0,esk7_0) ),
inference(rw,[status(thm)],[145,172,theory(equality)]) ).
cnf(197,negated_conjecture,
( $false
| $false
| ~ segmentP(esk8_0,esk7_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[196,154,theory(equality)]),152,theory(equality)]) ).
cnf(198,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[197,175,theory(equality)]) ).
cnf(199,negated_conjecture,
$false,
inference(cn,[status(thm)],[198,theory(equality)]) ).
cnf(200,negated_conjecture,
$false,
199,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC121+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpcrmixa/sel_SWC121+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC121+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC121+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC121+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
%
%------------------------------------------------------------------------------