TSTP Solution File: SEU230+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU230+2 : TPTP v5.0.0. Released v3.3.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 06:03:04 EST 2010
% Result : Theorem 0.87s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 25 unt; 0 def)
% Number of atoms : 49 ( 10 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 36 ( 17 ~; 11 |; 7 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 43 ( 5 sgn 26 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,conjecture,
! [X1] : in(X1,succ(X1)),
file('/tmp/tmpJEjINB/sel_SEU230+2.p_1',t10_ordinal1) ).
fof(24,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/tmp/tmpJEjINB/sel_SEU230+2.p_1',commutativity_k2_xboole_0) ).
fof(31,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/tmp/tmpJEjINB/sel_SEU230+2.p_1',d1_ordinal1) ).
fof(51,axiom,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/tmp/tmpJEjINB/sel_SEU230+2.p_1',t7_xboole_1) ).
fof(72,axiom,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/tmp/tmpJEjINB/sel_SEU230+2.p_1',t69_enumset1) ).
fof(146,axiom,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
file('/tmp/tmpJEjINB/sel_SEU230+2.p_1',t38_zfmisc_1) ).
fof(256,negated_conjecture,
~ ! [X1] : in(X1,succ(X1)),
inference(assume_negation,[status(cth)],[7]) ).
fof(311,negated_conjecture,
? [X1] : ~ in(X1,succ(X1)),
inference(fof_nnf,[status(thm)],[256]) ).
fof(312,negated_conjecture,
? [X2] : ~ in(X2,succ(X2)),
inference(variable_rename,[status(thm)],[311]) ).
fof(313,negated_conjecture,
~ in(esk4_0,succ(esk4_0)),
inference(skolemize,[status(esa)],[312]) ).
cnf(314,negated_conjecture,
~ in(esk4_0,succ(esk4_0)),
inference(split_conjunct,[status(thm)],[313]) ).
fof(407,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[24]) ).
cnf(408,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[407]) ).
fof(437,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[31]) ).
cnf(438,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[437]) ).
fof(500,plain,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[51]) ).
cnf(501,plain,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[500]) ).
fof(576,plain,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[72]) ).
cnf(577,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[576]) ).
fof(883,plain,
! [X1,X2,X3] :
( ( ~ subset(unordered_pair(X1,X2),X3)
| ( in(X1,X3)
& in(X2,X3) ) )
& ( ~ in(X1,X3)
| ~ in(X2,X3)
| subset(unordered_pair(X1,X2),X3) ) ),
inference(fof_nnf,[status(thm)],[146]) ).
fof(884,plain,
! [X4,X5,X6] :
( ( ~ subset(unordered_pair(X4,X5),X6)
| ( in(X4,X6)
& in(X5,X6) ) )
& ( ~ in(X4,X6)
| ~ in(X5,X6)
| subset(unordered_pair(X4,X5),X6) ) ),
inference(variable_rename,[status(thm)],[883]) ).
fof(885,plain,
! [X4,X5,X6] :
( ( in(X4,X6)
| ~ subset(unordered_pair(X4,X5),X6) )
& ( in(X5,X6)
| ~ subset(unordered_pair(X4,X5),X6) )
& ( ~ in(X4,X6)
| ~ in(X5,X6)
| subset(unordered_pair(X4,X5),X6) ) ),
inference(distribute,[status(thm)],[884]) ).
cnf(887,plain,
( in(X2,X3)
| ~ subset(unordered_pair(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[885]) ).
cnf(1388,plain,
set_union2(X1,unordered_pair(X1,X1)) = succ(X1),
inference(rw,[status(thm)],[438,577,theory(equality)]),
[unfolding] ).
cnf(1417,negated_conjecture,
~ in(esk4_0,set_union2(esk4_0,unordered_pair(esk4_0,esk4_0))),
inference(rw,[status(thm)],[314,1388,theory(equality)]),
[unfolding] ).
cnf(1549,plain,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[501,408,theory(equality)]) ).
cnf(8470,plain,
in(X1,set_union2(X2,unordered_pair(X3,X1))),
inference(spm,[status(thm)],[887,1549,theory(equality)]) ).
cnf(8536,negated_conjecture,
$false,
inference(rw,[status(thm)],[1417,8470,theory(equality)]) ).
cnf(8537,negated_conjecture,
$false,
inference(cn,[status(thm)],[8536,theory(equality)]) ).
cnf(8538,negated_conjecture,
$false,
8537,
[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/SEU/SEU230+2.p
% --creating new selector for []
% -running prover on /tmp/tmpJEjINB/sel_SEU230+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU230+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU230+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU230+2.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
%
%------------------------------------------------------------------------------