TSTP Solution File: SEU047+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU047+1 : TPTP v5.0.0. Released v3.2.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 04:16:18 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 66 ( 25 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 69 ( 28 ~; 20 |; 13 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3) ) ),
file('/tmp/tmpJPYnsS/sel_SEU047+1.p_1',t130_relat_1) ).
fof(21,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( subset(X1,X2)
=> ( relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3)
& relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3) ) ) ),
file('/tmp/tmpJPYnsS/sel_SEU047+1.p_1',t97_funct_1) ).
fof(31,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3) ) ),
file('/tmp/tmpJPYnsS/sel_SEU047+1.p_1',t129_relat_1) ).
fof(34,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( subset(X1,X2)
=> ( relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3)
& relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3) ) ) ),
inference(assume_negation,[status(cth)],[21]) ).
fof(94,plain,
! [X1,X2,X3] :
( ~ relation(X3)
| ~ subset(X1,X2)
| relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(95,plain,
! [X4,X5,X6] :
( ~ relation(X6)
| ~ subset(X4,X5)
| relation_rng_restriction(X4,relation_rng_restriction(X5,X6)) = relation_rng_restriction(X4,X6) ),
inference(variable_rename,[status(thm)],[94]) ).
cnf(96,plain,
( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3)
| ~ subset(X1,X2)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[95]) ).
fof(107,negated_conjecture,
? [X1,X2,X3] :
( relation(X3)
& function(X3)
& subset(X1,X2)
& ( relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) != relation_rng_restriction(X1,X3)
| relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) != relation_rng_restriction(X1,X3) ) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(108,negated_conjecture,
? [X4,X5,X6] :
( relation(X6)
& function(X6)
& subset(X4,X5)
& ( relation_rng_restriction(X5,relation_rng_restriction(X4,X6)) != relation_rng_restriction(X4,X6)
| relation_rng_restriction(X4,relation_rng_restriction(X5,X6)) != relation_rng_restriction(X4,X6) ) ),
inference(variable_rename,[status(thm)],[107]) ).
fof(109,negated_conjecture,
( relation(esk8_0)
& function(esk8_0)
& subset(esk6_0,esk7_0)
& ( relation_rng_restriction(esk7_0,relation_rng_restriction(esk6_0,esk8_0)) != relation_rng_restriction(esk6_0,esk8_0)
| relation_rng_restriction(esk6_0,relation_rng_restriction(esk7_0,esk8_0)) != relation_rng_restriction(esk6_0,esk8_0) ) ),
inference(skolemize,[status(esa)],[108]) ).
cnf(110,negated_conjecture,
( relation_rng_restriction(esk6_0,relation_rng_restriction(esk7_0,esk8_0)) != relation_rng_restriction(esk6_0,esk8_0)
| relation_rng_restriction(esk7_0,relation_rng_restriction(esk6_0,esk8_0)) != relation_rng_restriction(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(111,negated_conjecture,
subset(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(113,negated_conjecture,
relation(esk8_0),
inference(split_conjunct,[status(thm)],[109]) ).
fof(145,plain,
! [X1,X2,X3] :
( ~ relation(X3)
| ~ subset(X1,X2)
| relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(146,plain,
! [X4,X5,X6] :
( ~ relation(X6)
| ~ subset(X4,X5)
| relation_rng_restriction(X5,relation_rng_restriction(X4,X6)) = relation_rng_restriction(X4,X6) ),
inference(variable_rename,[status(thm)],[145]) ).
cnf(147,plain,
( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X2,X3)
| ~ subset(X2,X1)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[146]) ).
cnf(178,negated_conjecture,
( relation_rng_restriction(esk7_0,relation_rng_restriction(esk6_0,X1)) = relation_rng_restriction(esk6_0,X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[147,111,theory(equality)]) ).
cnf(180,negated_conjecture,
( relation_rng_restriction(esk6_0,relation_rng_restriction(esk7_0,X1)) = relation_rng_restriction(esk6_0,X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[96,111,theory(equality)]) ).
cnf(238,negated_conjecture,
( relation_rng_restriction(esk6_0,relation_rng_restriction(esk7_0,esk8_0)) != relation_rng_restriction(esk6_0,esk8_0)
| ~ relation(esk8_0) ),
inference(spm,[status(thm)],[110,178,theory(equality)]) ).
cnf(239,negated_conjecture,
( relation_rng_restriction(esk6_0,relation_rng_restriction(esk7_0,esk8_0)) != relation_rng_restriction(esk6_0,esk8_0)
| $false ),
inference(rw,[status(thm)],[238,113,theory(equality)]) ).
cnf(240,negated_conjecture,
relation_rng_restriction(esk6_0,relation_rng_restriction(esk7_0,esk8_0)) != relation_rng_restriction(esk6_0,esk8_0),
inference(cn,[status(thm)],[239,theory(equality)]) ).
cnf(252,negated_conjecture,
~ relation(esk8_0),
inference(spm,[status(thm)],[240,180,theory(equality)]) ).
cnf(253,negated_conjecture,
$false,
inference(rw,[status(thm)],[252,113,theory(equality)]) ).
cnf(254,negated_conjecture,
$false,
inference(cn,[status(thm)],[253,theory(equality)]) ).
cnf(255,negated_conjecture,
$false,
254,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU047+1.p
% --creating new selector for []
% -running prover on /tmp/tmpJPYnsS/sel_SEU047+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU047+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU047+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU047+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
%
%------------------------------------------------------------------------------