TSTP Solution File: SEU120+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU120+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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 04:42:38 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 6 unt; 0 def)
% Number of atoms : 88 ( 22 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 104 ( 47 ~; 28 |; 26 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 2 sgn 32 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/tmp/tmpUVJMGO/sel_SEU120+2.p_1',d7_xboole_0) ).
fof(12,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/tmp/tmpUVJMGO/sel_SEU120+2.p_1',d1_xboole_0) ).
fof(13,conjecture,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/tmp/tmpUVJMGO/sel_SEU120+2.p_1',t4_xboole_0) ).
fof(15,negated_conjecture,
~ ! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(assume_negation,[status(cth)],[13]) ).
fof(19,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).
fof(20,negated_conjecture,
~ ! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).
fof(41,plain,
! [X1,X2] :
( ( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set )
& ( set_intersection2(X1,X2) != empty_set
| disjoint(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(42,plain,
! [X3,X4] :
( ( ~ disjoint(X3,X4)
| set_intersection2(X3,X4) = empty_set )
& ( set_intersection2(X3,X4) != empty_set
| disjoint(X3,X4) ) ),
inference(variable_rename,[status(thm)],[41]) ).
cnf(43,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(44,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(62,plain,
! [X1] :
( ( X1 != empty_set
| ! [X2] : ~ in(X2,X1) )
& ( ? [X2] : in(X2,X1)
| X1 = empty_set ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(63,plain,
! [X3] :
( ( X3 != empty_set
| ! [X4] : ~ in(X4,X3) )
& ( ? [X5] : in(X5,X3)
| X3 = empty_set ) ),
inference(variable_rename,[status(thm)],[62]) ).
fof(64,plain,
! [X3] :
( ( X3 != empty_set
| ! [X4] : ~ in(X4,X3) )
& ( in(esk5_1(X3),X3)
| X3 = empty_set ) ),
inference(skolemize,[status(esa)],[63]) ).
fof(65,plain,
! [X3,X4] :
( ( ~ in(X4,X3)
| X3 != empty_set )
& ( in(esk5_1(X3),X3)
| X3 = empty_set ) ),
inference(shift_quantors,[status(thm)],[64]) ).
cnf(66,plain,
( X1 = empty_set
| in(esk5_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(67,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
fof(68,negated_conjecture,
? [X1,X2] :
( ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
| ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(69,negated_conjecture,
? [X4,X5] :
( ( ~ disjoint(X4,X5)
& ! [X6] : ~ in(X6,set_intersection2(X4,X5)) )
| ( ? [X7] : in(X7,set_intersection2(X4,X5))
& disjoint(X4,X5) ) ),
inference(variable_rename,[status(thm)],[68]) ).
fof(70,negated_conjecture,
( ( ~ disjoint(esk6_0,esk7_0)
& ! [X6] : ~ in(X6,set_intersection2(esk6_0,esk7_0)) )
| ( in(esk8_0,set_intersection2(esk6_0,esk7_0))
& disjoint(esk6_0,esk7_0) ) ),
inference(skolemize,[status(esa)],[69]) ).
fof(71,negated_conjecture,
! [X6] :
( ( ~ in(X6,set_intersection2(esk6_0,esk7_0))
& ~ disjoint(esk6_0,esk7_0) )
| ( in(esk8_0,set_intersection2(esk6_0,esk7_0))
& disjoint(esk6_0,esk7_0) ) ),
inference(shift_quantors,[status(thm)],[70]) ).
fof(72,negated_conjecture,
! [X6] :
( ( in(esk8_0,set_intersection2(esk6_0,esk7_0))
| ~ in(X6,set_intersection2(esk6_0,esk7_0)) )
& ( disjoint(esk6_0,esk7_0)
| ~ in(X6,set_intersection2(esk6_0,esk7_0)) )
& ( in(esk8_0,set_intersection2(esk6_0,esk7_0))
| ~ disjoint(esk6_0,esk7_0) )
& ( disjoint(esk6_0,esk7_0)
| ~ disjoint(esk6_0,esk7_0) ) ),
inference(distribute,[status(thm)],[71]) ).
cnf(74,negated_conjecture,
( in(esk8_0,set_intersection2(esk6_0,esk7_0))
| ~ disjoint(esk6_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(75,negated_conjecture,
( disjoint(esk6_0,esk7_0)
| ~ in(X1,set_intersection2(esk6_0,esk7_0)) ),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(80,negated_conjecture,
( disjoint(esk6_0,esk7_0)
| empty_set = set_intersection2(esk6_0,esk7_0) ),
inference(spm,[status(thm)],[75,66,theory(equality)]) ).
cnf(147,negated_conjecture,
disjoint(esk6_0,esk7_0),
inference(csr,[status(thm)],[80,43]) ).
cnf(149,negated_conjecture,
set_intersection2(esk6_0,esk7_0) = empty_set,
inference(spm,[status(thm)],[44,147,theory(equality)]) ).
cnf(151,negated_conjecture,
( in(esk8_0,set_intersection2(esk6_0,esk7_0))
| $false ),
inference(rw,[status(thm)],[74,147,theory(equality)]) ).
cnf(152,negated_conjecture,
in(esk8_0,set_intersection2(esk6_0,esk7_0)),
inference(cn,[status(thm)],[151,theory(equality)]) ).
cnf(157,negated_conjecture,
empty_set != set_intersection2(esk6_0,esk7_0),
inference(spm,[status(thm)],[67,152,theory(equality)]) ).
cnf(165,negated_conjecture,
$false,
inference(sr,[status(thm)],[149,157,theory(equality)]) ).
cnf(166,negated_conjecture,
$false,
165,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU120+2.p
% --creating new selector for []
% -running prover on /tmp/tmpUVJMGO/sel_SEU120+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU120+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU120+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU120+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
%
%------------------------------------------------------------------------------