TSTP Solution File: SET643+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET643+3 : TPTP v5.0.0. Released v2.2.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 03:11:13 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 79 ( 31 ~; 33 |; 6 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 1 sgn 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( subset(X1,cross_product(X2,X3))
=> ilf_type(X1,relation_type(X2,X3)) ) ) ) ),
file('/tmp/tmpu1E_F8/sel_SET643+3.p_1',p1) ).
fof(10,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ilf_type(cross_product(X1,X2),relation_type(X1,X2)) ) ),
file('/tmp/tmpu1E_F8/sel_SET643+3.p_1',prove_relset_1_5) ).
fof(11,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> subset(X1,X1) ),
file('/tmp/tmpu1E_F8/sel_SET643+3.p_1',p10) ).
fof(20,axiom,
! [X1] : ilf_type(X1,set_type),
file('/tmp/tmpu1E_F8/sel_SET643+3.p_1',p19) ).
fof(21,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ilf_type(cross_product(X1,X2),relation_type(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[10]) ).
fof(41,plain,
! [X1] :
( ~ ilf_type(X1,set_type)
| ! [X2] :
( ~ ilf_type(X2,set_type)
| ! [X3] :
( ~ ilf_type(X3,set_type)
| ~ subset(X1,cross_product(X2,X3))
| ilf_type(X1,relation_type(X2,X3)) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(42,plain,
! [X4] :
( ~ ilf_type(X4,set_type)
| ! [X5] :
( ~ ilf_type(X5,set_type)
| ! [X6] :
( ~ ilf_type(X6,set_type)
| ~ subset(X4,cross_product(X5,X6))
| ilf_type(X4,relation_type(X5,X6)) ) ) ),
inference(variable_rename,[status(thm)],[41]) ).
fof(43,plain,
! [X4,X5,X6] :
( ~ ilf_type(X6,set_type)
| ~ subset(X4,cross_product(X5,X6))
| ilf_type(X4,relation_type(X5,X6))
| ~ ilf_type(X5,set_type)
| ~ ilf_type(X4,set_type) ),
inference(shift_quantors,[status(thm)],[42]) ).
cnf(44,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ subset(X1,cross_product(X2,X3))
| ~ ilf_type(X3,set_type) ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(79,negated_conjecture,
? [X1] :
( ilf_type(X1,set_type)
& ? [X2] :
( ilf_type(X2,set_type)
& ~ ilf_type(cross_product(X1,X2),relation_type(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(80,negated_conjecture,
? [X3] :
( ilf_type(X3,set_type)
& ? [X4] :
( ilf_type(X4,set_type)
& ~ ilf_type(cross_product(X3,X4),relation_type(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[79]) ).
fof(81,negated_conjecture,
( ilf_type(esk6_0,set_type)
& ilf_type(esk7_0,set_type)
& ~ ilf_type(cross_product(esk6_0,esk7_0),relation_type(esk6_0,esk7_0)) ),
inference(skolemize,[status(esa)],[80]) ).
cnf(82,negated_conjecture,
~ ilf_type(cross_product(esk6_0,esk7_0),relation_type(esk6_0,esk7_0)),
inference(split_conjunct,[status(thm)],[81]) ).
fof(85,plain,
! [X1] :
( ~ ilf_type(X1,set_type)
| subset(X1,X1) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(86,plain,
! [X2] :
( ~ ilf_type(X2,set_type)
| subset(X2,X2) ),
inference(variable_rename,[status(thm)],[85]) ).
cnf(87,plain,
( subset(X1,X1)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[86]) ).
fof(138,plain,
! [X2] : ilf_type(X2,set_type),
inference(variable_rename,[status(thm)],[20]) ).
cnf(139,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[138]) ).
cnf(145,plain,
( subset(X1,X1)
| $false ),
inference(rw,[status(thm)],[87,139,theory(equality)]) ).
cnf(146,plain,
subset(X1,X1),
inference(cn,[status(thm)],[145,theory(equality)]) ).
cnf(240,plain,
( ilf_type(X1,relation_type(X2,X3))
| $false
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ subset(X1,cross_product(X2,X3)) ),
inference(rw,[status(thm)],[44,139,theory(equality)]) ).
cnf(241,plain,
( ilf_type(X1,relation_type(X2,X3))
| $false
| $false
| ~ ilf_type(X1,set_type)
| ~ subset(X1,cross_product(X2,X3)) ),
inference(rw,[status(thm)],[240,139,theory(equality)]) ).
cnf(242,plain,
( ilf_type(X1,relation_type(X2,X3))
| $false
| $false
| $false
| ~ subset(X1,cross_product(X2,X3)) ),
inference(rw,[status(thm)],[241,139,theory(equality)]) ).
cnf(243,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ subset(X1,cross_product(X2,X3)) ),
inference(cn,[status(thm)],[242,theory(equality)]) ).
cnf(244,plain,
ilf_type(cross_product(X1,X2),relation_type(X1,X2)),
inference(spm,[status(thm)],[243,146,theory(equality)]) ).
cnf(318,negated_conjecture,
$false,
inference(rw,[status(thm)],[82,244,theory(equality)]) ).
cnf(319,negated_conjecture,
$false,
inference(cn,[status(thm)],[318,theory(equality)]) ).
cnf(320,negated_conjecture,
$false,
319,
[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/SET/SET643+3.p
% --creating new selector for []
% -running prover on /tmp/tmpu1E_F8/sel_SET643+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET643+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET643+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET643+3.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
%
%------------------------------------------------------------------------------