TSTP Solution File: SEU219+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU219+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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 05:47:07 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 94 ( 39 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 108 ( 45 ~; 38 |; 18 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,axiom,
! [X1] :
( relation(X1)
=> ( relation_rng(X1) = relation_dom(relation_inverse(X1))
& relation_dom(X1) = relation_rng(relation_inverse(X1)) ) ),
file('/tmp/tmpOIvmxu/sel_SEU219+3.p_1',t37_relat_1) ).
fof(24,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> function_inverse(X1) = relation_inverse(X1) ) ),
file('/tmp/tmpOIvmxu/sel_SEU219+3.p_1',d9_funct_1) ).
fof(38,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_rng(X1) = relation_dom(function_inverse(X1))
& relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
file('/tmp/tmpOIvmxu/sel_SEU219+3.p_1',t55_funct_1) ).
fof(41,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_rng(X1) = relation_dom(function_inverse(X1))
& relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
inference(assume_negation,[status(cth)],[38]) ).
fof(97,plain,
! [X1] :
( ~ relation(X1)
| ( relation_rng(X1) = relation_dom(relation_inverse(X1))
& relation_dom(X1) = relation_rng(relation_inverse(X1)) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(98,plain,
! [X2] :
( ~ relation(X2)
| ( relation_rng(X2) = relation_dom(relation_inverse(X2))
& relation_dom(X2) = relation_rng(relation_inverse(X2)) ) ),
inference(variable_rename,[status(thm)],[97]) ).
fof(99,plain,
! [X2] :
( ( relation_rng(X2) = relation_dom(relation_inverse(X2))
| ~ relation(X2) )
& ( relation_dom(X2) = relation_rng(relation_inverse(X2))
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[98]) ).
cnf(100,plain,
( relation_dom(X1) = relation_rng(relation_inverse(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[99]) ).
cnf(101,plain,
( relation_rng(X1) = relation_dom(relation_inverse(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[99]) ).
fof(131,plain,
! [X1] :
( ~ relation(X1)
| ~ function(X1)
| ~ one_to_one(X1)
| function_inverse(X1) = relation_inverse(X1) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(132,plain,
! [X2] :
( ~ relation(X2)
| ~ function(X2)
| ~ one_to_one(X2)
| function_inverse(X2) = relation_inverse(X2) ),
inference(variable_rename,[status(thm)],[131]) ).
cnf(133,plain,
( function_inverse(X1) = relation_inverse(X1)
| ~ one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[132]) ).
fof(181,negated_conjecture,
? [X1] :
( relation(X1)
& function(X1)
& one_to_one(X1)
& ( relation_rng(X1) != relation_dom(function_inverse(X1))
| relation_dom(X1) != relation_rng(function_inverse(X1)) ) ),
inference(fof_nnf,[status(thm)],[41]) ).
fof(182,negated_conjecture,
? [X2] :
( relation(X2)
& function(X2)
& one_to_one(X2)
& ( relation_rng(X2) != relation_dom(function_inverse(X2))
| relation_dom(X2) != relation_rng(function_inverse(X2)) ) ),
inference(variable_rename,[status(thm)],[181]) ).
fof(183,negated_conjecture,
( relation(esk10_0)
& function(esk10_0)
& one_to_one(esk10_0)
& ( relation_rng(esk10_0) != relation_dom(function_inverse(esk10_0))
| relation_dom(esk10_0) != relation_rng(function_inverse(esk10_0)) ) ),
inference(skolemize,[status(esa)],[182]) ).
cnf(184,negated_conjecture,
( relation_dom(esk10_0) != relation_rng(function_inverse(esk10_0))
| relation_rng(esk10_0) != relation_dom(function_inverse(esk10_0)) ),
inference(split_conjunct,[status(thm)],[183]) ).
cnf(185,negated_conjecture,
one_to_one(esk10_0),
inference(split_conjunct,[status(thm)],[183]) ).
cnf(186,negated_conjecture,
function(esk10_0),
inference(split_conjunct,[status(thm)],[183]) ).
cnf(187,negated_conjecture,
relation(esk10_0),
inference(split_conjunct,[status(thm)],[183]) ).
cnf(234,negated_conjecture,
( relation_dom(relation_inverse(esk10_0)) != relation_rng(esk10_0)
| relation_rng(relation_inverse(esk10_0)) != relation_dom(esk10_0)
| ~ one_to_one(esk10_0)
| ~ function(esk10_0)
| ~ relation(esk10_0) ),
inference(spm,[status(thm)],[184,133,theory(equality)]) ).
cnf(235,negated_conjecture,
( relation_dom(relation_inverse(esk10_0)) != relation_rng(esk10_0)
| relation_rng(relation_inverse(esk10_0)) != relation_dom(esk10_0)
| $false
| ~ function(esk10_0)
| ~ relation(esk10_0) ),
inference(rw,[status(thm)],[234,185,theory(equality)]) ).
cnf(236,negated_conjecture,
( relation_dom(relation_inverse(esk10_0)) != relation_rng(esk10_0)
| relation_rng(relation_inverse(esk10_0)) != relation_dom(esk10_0)
| $false
| $false
| ~ relation(esk10_0) ),
inference(rw,[status(thm)],[235,186,theory(equality)]) ).
cnf(237,negated_conjecture,
( relation_dom(relation_inverse(esk10_0)) != relation_rng(esk10_0)
| relation_rng(relation_inverse(esk10_0)) != relation_dom(esk10_0)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[236,187,theory(equality)]) ).
cnf(238,negated_conjecture,
( relation_dom(relation_inverse(esk10_0)) != relation_rng(esk10_0)
| relation_rng(relation_inverse(esk10_0)) != relation_dom(esk10_0) ),
inference(cn,[status(thm)],[237,theory(equality)]) ).
cnf(256,negated_conjecture,
( relation_dom(relation_inverse(esk10_0)) != relation_rng(esk10_0)
| ~ relation(esk10_0) ),
inference(spm,[status(thm)],[238,100,theory(equality)]) ).
cnf(257,negated_conjecture,
( relation_dom(relation_inverse(esk10_0)) != relation_rng(esk10_0)
| $false ),
inference(rw,[status(thm)],[256,187,theory(equality)]) ).
cnf(258,negated_conjecture,
relation_dom(relation_inverse(esk10_0)) != relation_rng(esk10_0),
inference(cn,[status(thm)],[257,theory(equality)]) ).
cnf(259,negated_conjecture,
~ relation(esk10_0),
inference(spm,[status(thm)],[258,101,theory(equality)]) ).
cnf(260,negated_conjecture,
$false,
inference(rw,[status(thm)],[259,187,theory(equality)]) ).
cnf(261,negated_conjecture,
$false,
inference(cn,[status(thm)],[260,theory(equality)]) ).
cnf(262,negated_conjecture,
$false,
261,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU219+3.p
% --creating new selector for []
% -running prover on /tmp/tmpOIvmxu/sel_SEU219+3.p_1 with time limit 29
% -prover status Theorem
% Problem SEU219+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU219+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU219+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
%
%------------------------------------------------------------------------------