TSTP Solution File: SEU130+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU130+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:44:55 EST 2010
% Result : Theorem 0.30s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 69 ( 19 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 68 ( 29 ~; 24 |; 11 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 3 sgn 29 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
! [X1,X2] : subset(X1,X1),
file('/tmp/tmpJj0v9e/sel_SEU130+2.p_1',reflexivity_r1_tarski) ).
fof(18,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/tmp/tmpJj0v9e/sel_SEU130+2.p_1',t28_xboole_1) ).
fof(27,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/tmp/tmpJj0v9e/sel_SEU130+2.p_1',d10_xboole_0) ).
fof(32,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/tmp/tmpJj0v9e/sel_SEU130+2.p_1',t19_xboole_1) ).
fof(33,axiom,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/tmp/tmpJj0v9e/sel_SEU130+2.p_1',t17_xboole_1) ).
fof(39,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[18]) ).
fof(74,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[8]) ).
cnf(75,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[74]) ).
fof(102,negated_conjecture,
? [X1,X2] :
( subset(X1,X2)
& set_intersection2(X1,X2) != X1 ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(103,negated_conjecture,
? [X3,X4] :
( subset(X3,X4)
& set_intersection2(X3,X4) != X3 ),
inference(variable_rename,[status(thm)],[102]) ).
fof(104,negated_conjecture,
( subset(esk4_0,esk5_0)
& set_intersection2(esk4_0,esk5_0) != esk4_0 ),
inference(skolemize,[status(esa)],[103]) ).
cnf(105,negated_conjecture,
set_intersection2(esk4_0,esk5_0) != esk4_0,
inference(split_conjunct,[status(thm)],[104]) ).
cnf(106,negated_conjecture,
subset(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[104]) ).
fof(140,plain,
! [X1,X2] :
( ( X1 != X2
| ( subset(X1,X2)
& subset(X2,X1) ) )
& ( ~ subset(X1,X2)
| ~ subset(X2,X1)
| X1 = X2 ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(141,plain,
! [X3,X4] :
( ( X3 != X4
| ( subset(X3,X4)
& subset(X4,X3) ) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(variable_rename,[status(thm)],[140]) ).
fof(142,plain,
! [X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[141]) ).
cnf(143,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[142]) ).
fof(154,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X1,X3)
| subset(X1,set_intersection2(X2,X3)) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(155,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X4,X6)
| subset(X4,set_intersection2(X5,X6)) ),
inference(variable_rename,[status(thm)],[154]) ).
cnf(156,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[155]) ).
fof(157,plain,
! [X3,X4] : subset(set_intersection2(X3,X4),X3),
inference(variable_rename,[status(thm)],[33]) ).
cnf(158,plain,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(207,plain,
( X1 = set_intersection2(X1,X2)
| ~ subset(X1,set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[143,158,theory(equality)]) ).
cnf(531,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2)
| ~ subset(X1,X1) ),
inference(spm,[status(thm)],[207,156,theory(equality)]) ).
cnf(537,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2)
| $false ),
inference(rw,[status(thm)],[531,75,theory(equality)]) ).
cnf(538,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(cn,[status(thm)],[537,theory(equality)]) ).
cnf(1034,plain,
~ subset(esk4_0,esk5_0),
inference(spm,[status(thm)],[105,538,theory(equality)]) ).
cnf(1064,plain,
$false,
inference(rw,[status(thm)],[1034,106,theory(equality)]) ).
cnf(1065,plain,
$false,
inference(cn,[status(thm)],[1064,theory(equality)]) ).
cnf(1066,plain,
$false,
1065,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU130+2.p
% --creating new selector for []
% -running prover on /tmp/tmpJj0v9e/sel_SEU130+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU130+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU130+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU130+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
%
%------------------------------------------------------------------------------