TSTP Solution File: SEU217+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU217+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:45:28 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 102 ( 46 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 129 ( 53 ~; 49 |; 22 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,conjecture,
! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
file('/tmp/tmpfsx_kK/sel_SEU217+1.p_1',t35_funct_1) ).
fof(14,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( X2 = identity_relation(X1)
<=> ( relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = X3 ) ) ) ),
file('/tmp/tmpfsx_kK/sel_SEU217+1.p_1',t34_funct_1) ).
fof(21,axiom,
! [X1] : relation(identity_relation(X1)),
file('/tmp/tmpfsx_kK/sel_SEU217+1.p_1',dt_k6_relat_1) ).
fof(22,axiom,
! [X1] :
( relation(identity_relation(X1))
& function(identity_relation(X1)) ),
file('/tmp/tmpfsx_kK/sel_SEU217+1.p_1',fc2_funct_1) ).
fof(29,negated_conjecture,
~ ! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
inference(assume_negation,[status(cth)],[7]) ).
fof(56,negated_conjecture,
? [X1,X2] :
( in(X2,X1)
& apply(identity_relation(X1),X2) != X2 ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(57,negated_conjecture,
? [X3,X4] :
( in(X4,X3)
& apply(identity_relation(X3),X4) != X4 ),
inference(variable_rename,[status(thm)],[56]) ).
fof(58,negated_conjecture,
( in(esk5_0,esk4_0)
& apply(identity_relation(esk4_0),esk5_0) != esk5_0 ),
inference(skolemize,[status(esa)],[57]) ).
cnf(59,negated_conjecture,
apply(identity_relation(esk4_0),esk5_0) != esk5_0,
inference(split_conjunct,[status(thm)],[58]) ).
cnf(60,negated_conjecture,
in(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[58]) ).
fof(79,plain,
! [X1,X2] :
( ~ relation(X2)
| ~ function(X2)
| ( ( X2 != identity_relation(X1)
| ( relation_dom(X2) = X1
& ! [X3] :
( ~ in(X3,X1)
| apply(X2,X3) = X3 ) ) )
& ( relation_dom(X2) != X1
| ? [X3] :
( in(X3,X1)
& apply(X2,X3) != X3 )
| X2 = identity_relation(X1) ) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(80,plain,
! [X4,X5] :
( ~ relation(X5)
| ~ function(X5)
| ( ( X5 != identity_relation(X4)
| ( relation_dom(X5) = X4
& ! [X6] :
( ~ in(X6,X4)
| apply(X5,X6) = X6 ) ) )
& ( relation_dom(X5) != X4
| ? [X7] :
( in(X7,X4)
& apply(X5,X7) != X7 )
| X5 = identity_relation(X4) ) ) ),
inference(variable_rename,[status(thm)],[79]) ).
fof(81,plain,
! [X4,X5] :
( ~ relation(X5)
| ~ function(X5)
| ( ( X5 != identity_relation(X4)
| ( relation_dom(X5) = X4
& ! [X6] :
( ~ in(X6,X4)
| apply(X5,X6) = X6 ) ) )
& ( relation_dom(X5) != X4
| ( in(esk7_2(X4,X5),X4)
& apply(X5,esk7_2(X4,X5)) != esk7_2(X4,X5) )
| X5 = identity_relation(X4) ) ) ),
inference(skolemize,[status(esa)],[80]) ).
fof(82,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ in(X6,X4)
| apply(X5,X6) = X6 )
& relation_dom(X5) = X4 )
| X5 != identity_relation(X4) )
& ( relation_dom(X5) != X4
| ( in(esk7_2(X4,X5),X4)
& apply(X5,esk7_2(X4,X5)) != esk7_2(X4,X5) )
| X5 = identity_relation(X4) ) )
| ~ relation(X5)
| ~ function(X5) ),
inference(shift_quantors,[status(thm)],[81]) ).
fof(83,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| apply(X5,X6) = X6
| X5 != identity_relation(X4)
| ~ relation(X5)
| ~ function(X5) )
& ( relation_dom(X5) = X4
| X5 != identity_relation(X4)
| ~ relation(X5)
| ~ function(X5) )
& ( in(esk7_2(X4,X5),X4)
| relation_dom(X5) != X4
| X5 = identity_relation(X4)
| ~ relation(X5)
| ~ function(X5) )
& ( apply(X5,esk7_2(X4,X5)) != esk7_2(X4,X5)
| relation_dom(X5) != X4
| X5 = identity_relation(X4)
| ~ relation(X5)
| ~ function(X5) ) ),
inference(distribute,[status(thm)],[82]) ).
cnf(87,plain,
( apply(X1,X3) = X3
| ~ function(X1)
| ~ relation(X1)
| X1 != identity_relation(X2)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[83]) ).
fof(100,plain,
! [X2] : relation(identity_relation(X2)),
inference(variable_rename,[status(thm)],[21]) ).
cnf(101,plain,
relation(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[100]) ).
fof(102,plain,
! [X2] :
( relation(identity_relation(X2))
& function(identity_relation(X2)) ),
inference(variable_rename,[status(thm)],[22]) ).
cnf(103,plain,
function(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[102]) ).
cnf(140,negated_conjecture,
( apply(X1,esk5_0) = esk5_0
| identity_relation(esk4_0) != X1
| ~ function(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[87,60,theory(equality)]) ).
cnf(258,negated_conjecture,
( ~ function(identity_relation(esk4_0))
| ~ relation(identity_relation(esk4_0)) ),
inference(spm,[status(thm)],[59,140,theory(equality)]) ).
cnf(259,negated_conjecture,
( $false
| ~ relation(identity_relation(esk4_0)) ),
inference(rw,[status(thm)],[258,103,theory(equality)]) ).
cnf(260,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[259,101,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/SEU217+1.p
% --creating new selector for []
% -running prover on /tmp/tmpfsx_kK/sel_SEU217+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU217+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU217+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU217+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
%
%------------------------------------------------------------------------------