TSTP Solution File: SEU010+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU010+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:06:32 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 63 ( 25 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 64 ( 28 ~; 20 |; 10 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 27 ( 2 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1,X2] : subset(X1,X1),
file('/tmp/tmpLa-vOK/sel_SEU010+1.p_1',reflexivity_r1_tarski) ).
fof(20,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( relation_composition(identity_relation(relation_dom(X1)),X1) = X1
& relation_composition(X1,identity_relation(relation_rng(X1))) = X1 ) ),
file('/tmp/tmpLa-vOK/sel_SEU010+1.p_1',t42_funct_1) ).
fof(27,axiom,
! [X1,X2] :
( relation(X2)
=> ( subset(relation_dom(X2),X1)
=> relation_composition(identity_relation(X1),X2) = X2 ) ),
file('/tmp/tmpLa-vOK/sel_SEU010+1.p_1',t77_relat_1) ).
fof(33,axiom,
! [X1,X2] :
( relation(X2)
=> ( subset(relation_rng(X2),X1)
=> relation_composition(X2,identity_relation(X1)) = X2 ) ),
file('/tmp/tmpLa-vOK/sel_SEU010+1.p_1',t79_relat_1) ).
fof(39,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( relation_composition(identity_relation(relation_dom(X1)),X1) = X1
& relation_composition(X1,identity_relation(relation_rng(X1))) = X1 ) ),
inference(assume_negation,[status(cth)],[20]) ).
fof(79,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[10]) ).
cnf(80,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[79]) ).
fof(108,negated_conjecture,
? [X1] :
( relation(X1)
& function(X1)
& ( relation_composition(identity_relation(relation_dom(X1)),X1) != X1
| relation_composition(X1,identity_relation(relation_rng(X1))) != X1 ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(109,negated_conjecture,
? [X2] :
( relation(X2)
& function(X2)
& ( relation_composition(identity_relation(relation_dom(X2)),X2) != X2
| relation_composition(X2,identity_relation(relation_rng(X2))) != X2 ) ),
inference(variable_rename,[status(thm)],[108]) ).
fof(110,negated_conjecture,
( relation(esk5_0)
& function(esk5_0)
& ( relation_composition(identity_relation(relation_dom(esk5_0)),esk5_0) != esk5_0
| relation_composition(esk5_0,identity_relation(relation_rng(esk5_0))) != esk5_0 ) ),
inference(skolemize,[status(esa)],[109]) ).
cnf(111,negated_conjecture,
( relation_composition(esk5_0,identity_relation(relation_rng(esk5_0))) != esk5_0
| relation_composition(identity_relation(relation_dom(esk5_0)),esk5_0) != esk5_0 ),
inference(split_conjunct,[status(thm)],[110]) ).
cnf(113,negated_conjecture,
relation(esk5_0),
inference(split_conjunct,[status(thm)],[110]) ).
fof(139,plain,
! [X1,X2] :
( ~ relation(X2)
| ~ subset(relation_dom(X2),X1)
| relation_composition(identity_relation(X1),X2) = X2 ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(140,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ subset(relation_dom(X4),X3)
| relation_composition(identity_relation(X3),X4) = X4 ),
inference(variable_rename,[status(thm)],[139]) ).
cnf(141,plain,
( relation_composition(identity_relation(X1),X2) = X2
| ~ subset(relation_dom(X2),X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[140]) ).
fof(158,plain,
! [X1,X2] :
( ~ relation(X2)
| ~ subset(relation_rng(X2),X1)
| relation_composition(X2,identity_relation(X1)) = X2 ),
inference(fof_nnf,[status(thm)],[33]) ).
fof(159,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ subset(relation_rng(X4),X3)
| relation_composition(X4,identity_relation(X3)) = X4 ),
inference(variable_rename,[status(thm)],[158]) ).
cnf(160,plain,
( relation_composition(X1,identity_relation(X2)) = X1
| ~ subset(relation_rng(X1),X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[159]) ).
cnf(203,plain,
( relation_composition(X1,identity_relation(relation_rng(X1))) = X1
| ~ relation(X1) ),
inference(spm,[status(thm)],[160,80,theory(equality)]) ).
cnf(204,plain,
( relation_composition(identity_relation(relation_dom(X1)),X1) = X1
| ~ relation(X1) ),
inference(spm,[status(thm)],[141,80,theory(equality)]) ).
cnf(295,negated_conjecture,
( relation_composition(esk5_0,identity_relation(relation_rng(esk5_0))) != esk5_0
| ~ relation(esk5_0) ),
inference(spm,[status(thm)],[111,204,theory(equality)]) ).
cnf(306,negated_conjecture,
( relation_composition(esk5_0,identity_relation(relation_rng(esk5_0))) != esk5_0
| $false ),
inference(rw,[status(thm)],[295,113,theory(equality)]) ).
cnf(307,negated_conjecture,
relation_composition(esk5_0,identity_relation(relation_rng(esk5_0))) != esk5_0,
inference(cn,[status(thm)],[306,theory(equality)]) ).
cnf(315,negated_conjecture,
~ relation(esk5_0),
inference(spm,[status(thm)],[307,203,theory(equality)]) ).
cnf(316,negated_conjecture,
$false,
inference(rw,[status(thm)],[315,113,theory(equality)]) ).
cnf(317,negated_conjecture,
$false,
inference(cn,[status(thm)],[316,theory(equality)]) ).
cnf(318,negated_conjecture,
$false,
317,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU010+1.p
% --creating new selector for []
% -running prover on /tmp/tmpLa-vOK/sel_SEU010+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU010+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU010+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU010+1.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
%
%------------------------------------------------------------------------------