TSTP Solution File: SEU200+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU200+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:25:26 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 7 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 87 ( 41 ~; 31 |; 8 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 2 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( relation(X2)
=> relation(relation_rng_restriction(X1,X2)) ),
file('/tmp/tmp6pkKXt/sel_SEU200+1.p_1',dt_k8_relat_1) ).
fof(4,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)) ),
file('/tmp/tmp6pkKXt/sel_SEU200+1.p_1',t118_relat_1) ).
fof(9,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
=> ( subset(relation_dom(X1),relation_dom(X2))
& subset(relation_rng(X1),relation_rng(X2)) ) ) ) ),
file('/tmp/tmp6pkKXt/sel_SEU200+1.p_1',t25_relat_1) ).
fof(18,axiom,
! [X1,X2] :
( relation(X2)
=> subset(relation_rng_restriction(X1,X2),X2) ),
file('/tmp/tmp6pkKXt/sel_SEU200+1.p_1',t117_relat_1) ).
fof(35,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(43,plain,
! [X1,X2] :
( ~ relation(X2)
| relation(relation_rng_restriction(X1,X2)) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(44,plain,
! [X3,X4] :
( ~ relation(X4)
| relation(relation_rng_restriction(X3,X4)) ),
inference(variable_rename,[status(thm)],[43]) ).
cnf(45,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[44]) ).
fof(52,negated_conjecture,
? [X1,X2] :
( relation(X2)
& ~ subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(53,negated_conjecture,
? [X3,X4] :
( relation(X4)
& ~ subset(relation_rng(relation_rng_restriction(X3,X4)),relation_rng(X4)) ),
inference(variable_rename,[status(thm)],[52]) ).
fof(54,negated_conjecture,
( relation(esk3_0)
& ~ subset(relation_rng(relation_rng_restriction(esk2_0,esk3_0)),relation_rng(esk3_0)) ),
inference(skolemize,[status(esa)],[53]) ).
cnf(55,negated_conjecture,
~ subset(relation_rng(relation_rng_restriction(esk2_0,esk3_0)),relation_rng(esk3_0)),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(56,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[54]) ).
fof(75,plain,
! [X1] :
( ~ relation(X1)
| ! [X2] :
( ~ relation(X2)
| ~ subset(X1,X2)
| ( subset(relation_dom(X1),relation_dom(X2))
& subset(relation_rng(X1),relation_rng(X2)) ) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(76,plain,
! [X3] :
( ~ relation(X3)
| ! [X4] :
( ~ relation(X4)
| ~ subset(X3,X4)
| ( subset(relation_dom(X3),relation_dom(X4))
& subset(relation_rng(X3),relation_rng(X4)) ) ) ),
inference(variable_rename,[status(thm)],[75]) ).
fof(77,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ subset(X3,X4)
| ( subset(relation_dom(X3),relation_dom(X4))
& subset(relation_rng(X3),relation_rng(X4)) )
| ~ relation(X3) ),
inference(shift_quantors,[status(thm)],[76]) ).
fof(78,plain,
! [X3,X4] :
( ( subset(relation_dom(X3),relation_dom(X4))
| ~ subset(X3,X4)
| ~ relation(X4)
| ~ relation(X3) )
& ( subset(relation_rng(X3),relation_rng(X4))
| ~ subset(X3,X4)
| ~ relation(X4)
| ~ relation(X3) ) ),
inference(distribute,[status(thm)],[77]) ).
cnf(79,plain,
( subset(relation_rng(X1),relation_rng(X2))
| ~ relation(X1)
| ~ relation(X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[78]) ).
fof(103,plain,
! [X1,X2] :
( ~ relation(X2)
| subset(relation_rng_restriction(X1,X2),X2) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(104,plain,
! [X3,X4] :
( ~ relation(X4)
| subset(relation_rng_restriction(X3,X4),X4) ),
inference(variable_rename,[status(thm)],[103]) ).
cnf(105,plain,
( subset(relation_rng_restriction(X1,X2),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[104]) ).
cnf(156,negated_conjecture,
( ~ subset(relation_rng_restriction(esk2_0,esk3_0),esk3_0)
| ~ relation(esk3_0)
| ~ relation(relation_rng_restriction(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[55,79,theory(equality)]) ).
cnf(157,negated_conjecture,
( ~ subset(relation_rng_restriction(esk2_0,esk3_0),esk3_0)
| $false
| ~ relation(relation_rng_restriction(esk2_0,esk3_0)) ),
inference(rw,[status(thm)],[156,56,theory(equality)]) ).
cnf(158,negated_conjecture,
( ~ subset(relation_rng_restriction(esk2_0,esk3_0),esk3_0)
| ~ relation(relation_rng_restriction(esk2_0,esk3_0)) ),
inference(cn,[status(thm)],[157,theory(equality)]) ).
cnf(178,negated_conjecture,
( ~ relation(relation_rng_restriction(esk2_0,esk3_0))
| ~ relation(esk3_0) ),
inference(spm,[status(thm)],[158,105,theory(equality)]) ).
cnf(179,negated_conjecture,
( ~ relation(relation_rng_restriction(esk2_0,esk3_0))
| $false ),
inference(rw,[status(thm)],[178,56,theory(equality)]) ).
cnf(180,negated_conjecture,
~ relation(relation_rng_restriction(esk2_0,esk3_0)),
inference(cn,[status(thm)],[179,theory(equality)]) ).
cnf(194,negated_conjecture,
~ relation(esk3_0),
inference(spm,[status(thm)],[180,45,theory(equality)]) ).
cnf(195,negated_conjecture,
$false,
inference(rw,[status(thm)],[194,56,theory(equality)]) ).
cnf(196,negated_conjecture,
$false,
inference(cn,[status(thm)],[195,theory(equality)]) ).
cnf(197,negated_conjecture,
$false,
196,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU200+1.p
% --creating new selector for []
% -running prover on /tmp/tmp6pkKXt/sel_SEU200+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU200+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU200+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU200+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
%
%------------------------------------------------------------------------------