TSTP Solution File: SWC406+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC406+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 11:48:55 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 205 ( 34 equ)
% Maximal formula atoms : 34 ( 9 avg)
% Number of connectives : 264 ( 80 ~; 75 |; 91 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 47 ( 0 sgn 28 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(24,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X4,X6)
| ~ leq(X6,X5)
| X5 = X6 ) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) ) ) )
| ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X1,X7)
| memberP(X2,X7) ) ) ) ) ) ) ),
file('/tmp/tmpV7cszB/sel_SWC406+1.p_1',co1) ).
fof(25,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X4,X6)
| ~ leq(X6,X5)
| X5 = X6 ) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) ) ) )
| ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X1,X7)
| memberP(X2,X7) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[24]) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X4,X6)
| ~ leq(X6,X5)
| X5 = X6 ) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) ) ) )
| ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X1,X7)
| memberP(X2,X7) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).
fof(133,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssItem(X5)
| ( ( memberP(X3,X5)
| ? [X6] :
( ssItem(X6)
& memberP(X4,X6)
& leq(X6,X5)
& X5 != X6 )
| ~ memberP(X4,X5) )
& ( ~ memberP(X3,X5)
| ( memberP(X4,X5)
& ! [X6] :
( ~ ssItem(X6)
| X5 = X6
| ~ memberP(X4,X6)
| ~ leq(X6,X5) ) ) ) ) )
& ? [X7] :
( ssItem(X7)
& memberP(X1,X7)
& ~ memberP(X2,X7) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(134,negated_conjecture,
? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& X9 = X11
& X8 = X10
& ! [X12] :
( ~ ssItem(X12)
| ( ( memberP(X10,X12)
| ? [X13] :
( ssItem(X13)
& memberP(X11,X13)
& leq(X13,X12)
& X12 != X13 )
| ~ memberP(X11,X12) )
& ( ~ memberP(X10,X12)
| ( memberP(X11,X12)
& ! [X14] :
( ~ ssItem(X14)
| X12 = X14
| ~ memberP(X11,X14)
| ~ leq(X14,X12) ) ) ) ) )
& ? [X15] :
( ssItem(X15)
& memberP(X8,X15)
& ~ memberP(X9,X15) ) ) ) ) ),
inference(variable_rename,[status(thm)],[133]) ).
fof(135,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ! [X12] :
( ~ ssItem(X12)
| ( ( memberP(esk9_0,X12)
| ( ssItem(esk11_1(X12))
& memberP(esk10_0,esk11_1(X12))
& leq(esk11_1(X12),X12)
& X12 != esk11_1(X12) )
| ~ memberP(esk10_0,X12) )
& ( ~ memberP(esk9_0,X12)
| ( memberP(esk10_0,X12)
& ! [X14] :
( ~ ssItem(X14)
| X12 = X14
| ~ memberP(esk10_0,X14)
| ~ leq(X14,X12) ) ) ) ) )
& ssItem(esk12_0)
& memberP(esk7_0,esk12_0)
& ~ memberP(esk8_0,esk12_0) ),
inference(skolemize,[status(esa)],[134]) ).
fof(136,negated_conjecture,
! [X12,X14] :
( ( ( ( ( ( ~ ssItem(X14)
| X12 = X14
| ~ memberP(esk10_0,X14)
| ~ leq(X14,X12) )
& memberP(esk10_0,X12) )
| ~ memberP(esk9_0,X12) )
& ( memberP(esk9_0,X12)
| ( ssItem(esk11_1(X12))
& memberP(esk10_0,esk11_1(X12))
& leq(esk11_1(X12),X12)
& X12 != esk11_1(X12) )
| ~ memberP(esk10_0,X12) ) )
| ~ ssItem(X12) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk12_0)
& memberP(esk7_0,esk12_0)
& ~ memberP(esk8_0,esk12_0)
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[135]) ).
fof(137,negated_conjecture,
! [X12,X14] :
( ( ~ ssItem(X14)
| X12 = X14
| ~ memberP(esk10_0,X14)
| ~ leq(X14,X12)
| ~ memberP(esk9_0,X12)
| ~ ssItem(X12) )
& ( memberP(esk10_0,X12)
| ~ memberP(esk9_0,X12)
| ~ ssItem(X12) )
& ( ssItem(esk11_1(X12))
| memberP(esk9_0,X12)
| ~ memberP(esk10_0,X12)
| ~ ssItem(X12) )
& ( memberP(esk10_0,esk11_1(X12))
| memberP(esk9_0,X12)
| ~ memberP(esk10_0,X12)
| ~ ssItem(X12) )
& ( leq(esk11_1(X12),X12)
| memberP(esk9_0,X12)
| ~ memberP(esk10_0,X12)
| ~ ssItem(X12) )
& ( X12 != esk11_1(X12)
| memberP(esk9_0,X12)
| ~ memberP(esk10_0,X12)
| ~ ssItem(X12) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk12_0)
& memberP(esk7_0,esk12_0)
& ~ memberP(esk8_0,esk12_0)
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[136]) ).
cnf(142,negated_conjecture,
~ memberP(esk8_0,esk12_0),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(143,negated_conjecture,
memberP(esk7_0,esk12_0),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(144,negated_conjecture,
ssItem(esk12_0),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(145,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(146,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(151,negated_conjecture,
( memberP(esk10_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk9_0,X1) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(155,negated_conjecture,
memberP(esk9_0,esk12_0),
inference(rw,[status(thm)],[143,145,theory(equality)]) ).
cnf(156,negated_conjecture,
~ memberP(esk10_0,esk12_0),
inference(rw,[status(thm)],[142,146,theory(equality)]) ).
cnf(157,negated_conjecture,
( memberP(esk10_0,esk12_0)
| ~ ssItem(esk12_0) ),
inference(spm,[status(thm)],[151,155,theory(equality)]) ).
cnf(158,negated_conjecture,
( memberP(esk10_0,esk12_0)
| $false ),
inference(rw,[status(thm)],[157,144,theory(equality)]) ).
cnf(159,negated_conjecture,
memberP(esk10_0,esk12_0),
inference(cn,[status(thm)],[158,theory(equality)]) ).
cnf(160,negated_conjecture,
$false,
inference(sr,[status(thm)],[159,156,theory(equality)]) ).
cnf(161,negated_conjecture,
$false,
160,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC406+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpV7cszB/sel_SWC406+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC406+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC406+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC406+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
%
%------------------------------------------------------------------------------