TSTP Solution File: SEU219+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU219+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 05:46:55 EST 2010
% Result : Theorem 0.89s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 6 unt; 0 def)
% Number of atoms : 102 ( 33 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 117 ( 47 ~; 45 |; 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 : 16 ( 0 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(90,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> function_inverse(X1) = relation_inverse(X1) ) ),
file('/tmp/tmpXuuYUh/sel_SEU219+2.p_1',d9_funct_1) ).
fof(127,axiom,
! [X1] :
( relation(X1)
=> ( relation_rng(X1) = relation_dom(relation_inverse(X1))
& relation_dom(X1) = relation_rng(relation_inverse(X1)) ) ),
file('/tmp/tmpXuuYUh/sel_SEU219+2.p_1',t37_relat_1) ).
fof(225,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/tmpXuuYUh/sel_SEU219+2.p_1',t55_funct_1) ).
fof(232,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)],[225]) ).
fof(618,plain,
! [X1] :
( ~ relation(X1)
| ~ function(X1)
| ~ one_to_one(X1)
| function_inverse(X1) = relation_inverse(X1) ),
inference(fof_nnf,[status(thm)],[90]) ).
fof(619,plain,
! [X2] :
( ~ relation(X2)
| ~ function(X2)
| ~ one_to_one(X2)
| function_inverse(X2) = relation_inverse(X2) ),
inference(variable_rename,[status(thm)],[618]) ).
cnf(620,plain,
( function_inverse(X1) = relation_inverse(X1)
| ~ one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[619]) ).
fof(761,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)],[127]) ).
fof(762,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)],[761]) ).
fof(763,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)],[762]) ).
cnf(764,plain,
( relation_dom(X1) = relation_rng(relation_inverse(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[763]) ).
cnf(765,plain,
( relation_rng(X1) = relation_dom(relation_inverse(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[763]) ).
fof(1181,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)],[232]) ).
fof(1182,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)],[1181]) ).
fof(1183,negated_conjecture,
( relation(esk71_0)
& function(esk71_0)
& one_to_one(esk71_0)
& ( relation_rng(esk71_0) != relation_dom(function_inverse(esk71_0))
| relation_dom(esk71_0) != relation_rng(function_inverse(esk71_0)) ) ),
inference(skolemize,[status(esa)],[1182]) ).
cnf(1184,negated_conjecture,
( relation_dom(esk71_0) != relation_rng(function_inverse(esk71_0))
| relation_rng(esk71_0) != relation_dom(function_inverse(esk71_0)) ),
inference(split_conjunct,[status(thm)],[1183]) ).
cnf(1185,negated_conjecture,
one_to_one(esk71_0),
inference(split_conjunct,[status(thm)],[1183]) ).
cnf(1186,negated_conjecture,
function(esk71_0),
inference(split_conjunct,[status(thm)],[1183]) ).
cnf(1187,negated_conjecture,
relation(esk71_0),
inference(split_conjunct,[status(thm)],[1183]) ).
cnf(1553,plain,
( relation_rng(function_inverse(X1)) = relation_dom(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[764,620,theory(equality)]) ).
cnf(1554,plain,
( relation_dom(function_inverse(X1)) = relation_rng(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[765,620,theory(equality)]) ).
cnf(8615,plain,
( relation_dom(function_inverse(esk71_0)) != relation_rng(esk71_0)
| ~ one_to_one(esk71_0)
| ~ function(esk71_0)
| ~ relation(esk71_0) ),
inference(spm,[status(thm)],[1184,1553,theory(equality)]) ).
cnf(8640,plain,
( relation_dom(function_inverse(esk71_0)) != relation_rng(esk71_0)
| $false
| ~ function(esk71_0)
| ~ relation(esk71_0) ),
inference(rw,[status(thm)],[8615,1185,theory(equality)]) ).
cnf(8641,plain,
( relation_dom(function_inverse(esk71_0)) != relation_rng(esk71_0)
| $false
| $false
| ~ relation(esk71_0) ),
inference(rw,[status(thm)],[8640,1186,theory(equality)]) ).
cnf(8642,plain,
( relation_dom(function_inverse(esk71_0)) != relation_rng(esk71_0)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[8641,1187,theory(equality)]) ).
cnf(8643,plain,
relation_dom(function_inverse(esk71_0)) != relation_rng(esk71_0),
inference(cn,[status(thm)],[8642,theory(equality)]) ).
cnf(8741,plain,
( ~ one_to_one(esk71_0)
| ~ function(esk71_0)
| ~ relation(esk71_0) ),
inference(spm,[status(thm)],[8643,1554,theory(equality)]) ).
cnf(8742,plain,
( $false
| ~ function(esk71_0)
| ~ relation(esk71_0) ),
inference(rw,[status(thm)],[8741,1185,theory(equality)]) ).
cnf(8743,plain,
( $false
| $false
| ~ relation(esk71_0) ),
inference(rw,[status(thm)],[8742,1186,theory(equality)]) ).
cnf(8744,plain,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[8743,1187,theory(equality)]) ).
cnf(8745,plain,
$false,
inference(cn,[status(thm)],[8744,theory(equality)]) ).
cnf(8746,plain,
$false,
8745,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU219+2.p
% --creating new selector for []
% -running prover on /tmp/tmpXuuYUh/sel_SEU219+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU219+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU219+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU219+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
%
%------------------------------------------------------------------------------