TSTP Solution File: SEU056+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU056+1 : TPTP v5.0.0. Released v3.2.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 04:19:53 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 92 ( 23 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 94 ( 37 ~; 30 |; 19 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( one_to_one(X3)
=> relation_image(X3,set_intersection2(X1,X2)) = set_intersection2(relation_image(X3,X1),relation_image(X3,X2)) ) ),
file('/tmp/tmpVZzxsq/sel_SEU056+1.p_1',t121_funct_1) ).
fof(10,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( ( disjoint(X1,X2)
& one_to_one(X3) )
=> disjoint(relation_image(X3,X1),relation_image(X3,X2)) ) ),
file('/tmp/tmpVZzxsq/sel_SEU056+1.p_1',t125_funct_1) ).
fof(22,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/tmp/tmpVZzxsq/sel_SEU056+1.p_1',d7_xboole_0) ).
fof(36,axiom,
! [X1] :
( relation(X1)
=> relation_image(X1,empty_set) = empty_set ),
file('/tmp/tmpVZzxsq/sel_SEU056+1.p_1',t149_relat_1) ).
fof(38,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( ( disjoint(X1,X2)
& one_to_one(X3) )
=> disjoint(relation_image(X3,X1),relation_image(X3,X2)) ) ),
inference(assume_negation,[status(cth)],[10]) ).
fof(56,plain,
! [X1,X2,X3] :
( ~ relation(X3)
| ~ function(X3)
| ~ one_to_one(X3)
| relation_image(X3,set_intersection2(X1,X2)) = set_intersection2(relation_image(X3,X1),relation_image(X3,X2)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(57,plain,
! [X4,X5,X6] :
( ~ relation(X6)
| ~ function(X6)
| ~ one_to_one(X6)
| relation_image(X6,set_intersection2(X4,X5)) = set_intersection2(relation_image(X6,X4),relation_image(X6,X5)) ),
inference(variable_rename,[status(thm)],[56]) ).
cnf(58,plain,
( relation_image(X1,set_intersection2(X2,X3)) = set_intersection2(relation_image(X1,X2),relation_image(X1,X3))
| ~ one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(73,negated_conjecture,
? [X1,X2,X3] :
( relation(X3)
& function(X3)
& disjoint(X1,X2)
& one_to_one(X3)
& ~ disjoint(relation_image(X3,X1),relation_image(X3,X2)) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(74,negated_conjecture,
? [X4,X5,X6] :
( relation(X6)
& function(X6)
& disjoint(X4,X5)
& one_to_one(X6)
& ~ disjoint(relation_image(X6,X4),relation_image(X6,X5)) ),
inference(variable_rename,[status(thm)],[73]) ).
fof(75,negated_conjecture,
( relation(esk7_0)
& function(esk7_0)
& disjoint(esk5_0,esk6_0)
& one_to_one(esk7_0)
& ~ disjoint(relation_image(esk7_0,esk5_0),relation_image(esk7_0,esk6_0)) ),
inference(skolemize,[status(esa)],[74]) ).
cnf(76,negated_conjecture,
~ disjoint(relation_image(esk7_0,esk5_0),relation_image(esk7_0,esk6_0)),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(77,negated_conjecture,
one_to_one(esk7_0),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(78,negated_conjecture,
disjoint(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(79,negated_conjecture,
function(esk7_0),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(80,negated_conjecture,
relation(esk7_0),
inference(split_conjunct,[status(thm)],[75]) ).
fof(119,plain,
! [X1,X2] :
( ( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set )
& ( set_intersection2(X1,X2) != empty_set
| disjoint(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(120,plain,
! [X3,X4] :
( ( ~ disjoint(X3,X4)
| set_intersection2(X3,X4) = empty_set )
& ( set_intersection2(X3,X4) != empty_set
| disjoint(X3,X4) ) ),
inference(variable_rename,[status(thm)],[119]) ).
cnf(121,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[120]) ).
cnf(122,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[120]) ).
fof(161,plain,
! [X1] :
( ~ relation(X1)
| relation_image(X1,empty_set) = empty_set ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(162,plain,
! [X2] :
( ~ relation(X2)
| relation_image(X2,empty_set) = empty_set ),
inference(variable_rename,[status(thm)],[161]) ).
cnf(163,plain,
( relation_image(X1,empty_set) = empty_set
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[162]) ).
cnf(189,negated_conjecture,
set_intersection2(esk5_0,esk6_0) = empty_set,
inference(spm,[status(thm)],[122,78,theory(equality)]) ).
cnf(190,negated_conjecture,
set_intersection2(relation_image(esk7_0,esk5_0),relation_image(esk7_0,esk6_0)) != empty_set,
inference(spm,[status(thm)],[76,121,theory(equality)]) ).
cnf(239,negated_conjecture,
( relation_image(esk7_0,set_intersection2(esk5_0,esk6_0)) != empty_set
| ~ one_to_one(esk7_0)
| ~ function(esk7_0)
| ~ relation(esk7_0) ),
inference(spm,[status(thm)],[190,58,theory(equality)]) ).
cnf(240,negated_conjecture,
( relation_image(esk7_0,set_intersection2(esk5_0,esk6_0)) != empty_set
| $false
| ~ function(esk7_0)
| ~ relation(esk7_0) ),
inference(rw,[status(thm)],[239,77,theory(equality)]) ).
cnf(241,negated_conjecture,
( relation_image(esk7_0,set_intersection2(esk5_0,esk6_0)) != empty_set
| $false
| $false
| ~ relation(esk7_0) ),
inference(rw,[status(thm)],[240,79,theory(equality)]) ).
cnf(242,negated_conjecture,
( relation_image(esk7_0,set_intersection2(esk5_0,esk6_0)) != empty_set
| $false
| $false
| $false ),
inference(rw,[status(thm)],[241,80,theory(equality)]) ).
cnf(243,negated_conjecture,
relation_image(esk7_0,set_intersection2(esk5_0,esk6_0)) != empty_set,
inference(cn,[status(thm)],[242,theory(equality)]) ).
cnf(255,negated_conjecture,
relation_image(esk7_0,empty_set) != empty_set,
inference(rw,[status(thm)],[243,189,theory(equality)]) ).
cnf(277,negated_conjecture,
~ relation(esk7_0),
inference(spm,[status(thm)],[255,163,theory(equality)]) ).
cnf(278,negated_conjecture,
$false,
inference(rw,[status(thm)],[277,80,theory(equality)]) ).
cnf(279,negated_conjecture,
$false,
inference(cn,[status(thm)],[278,theory(equality)]) ).
cnf(280,negated_conjecture,
$false,
279,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU056+1.p
% --creating new selector for []
% -running prover on /tmp/tmpVZzxsq/sel_SEU056+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU056+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU056+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU056+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
%
%------------------------------------------------------------------------------