TSTP Solution File: PUZ130+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : PUZ130+1 : TPTP v5.0.0. Released v4.1.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 00:57:16 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 54 ( 23 unt; 0 def)
% Number of atoms : 123 ( 18 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 122 ( 53 ~; 58 |; 5 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 29 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( ( cat(X1)
& dog(X2) )
=> ( chased(X2,X1)
=> hates(owner_of(X1),owner_of(X2)) ) ),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',cat_chase_axiom) ).
fof(2,axiom,
owner(jon,garfield),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',jon_g_owner_axiom) ).
fof(5,axiom,
! [X1,X2] :
( ( human(X1)
& pet(X2) )
=> ( owner(X1,X2)
<=> X1 = owner_of(X2) ) ),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',owner_def) ).
fof(7,axiom,
dog(odie),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',odie_type) ).
fof(8,conjecture,
hates(jon,jon),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',jon_conjecture) ).
fof(10,axiom,
chased(odie,garfield),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',odie_chase_axiom) ).
fof(11,axiom,
cat(garfield),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',garfield_type) ).
fof(14,axiom,
owner(jon,odie),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',jon_o_owner_axiom) ).
fof(15,axiom,
human(jon),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',jon_type) ).
fof(16,axiom,
! [X3] :
( cat(X3)
=> pet(X3) ),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',cat_pet_type) ).
fof(19,axiom,
! [X3] :
( dog(X3)
=> pet(X3) ),
file('/tmp/tmpOPHEBW/sel_PUZ130+1.p_1',dog_pet_type) ).
fof(20,negated_conjecture,
~ hates(jon,jon),
inference(assume_negation,[status(cth)],[8]) ).
fof(21,negated_conjecture,
~ hates(jon,jon),
inference(fof_simplification,[status(thm)],[20,theory(equality)]) ).
fof(22,plain,
! [X1,X2] :
( ~ cat(X1)
| ~ dog(X2)
| ~ chased(X2,X1)
| hates(owner_of(X1),owner_of(X2)) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(23,plain,
! [X3,X4] :
( ~ cat(X3)
| ~ dog(X4)
| ~ chased(X4,X3)
| hates(owner_of(X3),owner_of(X4)) ),
inference(variable_rename,[status(thm)],[22]) ).
cnf(24,plain,
( hates(owner_of(X1),owner_of(X2))
| ~ chased(X2,X1)
| ~ dog(X2)
| ~ cat(X1) ),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(25,plain,
owner(jon,garfield),
inference(split_conjunct,[status(thm)],[2]) ).
fof(35,plain,
! [X1,X2] :
( ~ human(X1)
| ~ pet(X2)
| ( ( ~ owner(X1,X2)
| X1 = owner_of(X2) )
& ( X1 != owner_of(X2)
| owner(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(36,plain,
! [X3,X4] :
( ~ human(X3)
| ~ pet(X4)
| ( ( ~ owner(X3,X4)
| X3 = owner_of(X4) )
& ( X3 != owner_of(X4)
| owner(X3,X4) ) ) ),
inference(variable_rename,[status(thm)],[35]) ).
fof(37,plain,
! [X3,X4] :
( ( ~ owner(X3,X4)
| X3 = owner_of(X4)
| ~ human(X3)
| ~ pet(X4) )
& ( X3 != owner_of(X4)
| owner(X3,X4)
| ~ human(X3)
| ~ pet(X4) ) ),
inference(distribute,[status(thm)],[36]) ).
cnf(39,plain,
( X2 = owner_of(X1)
| ~ pet(X1)
| ~ human(X2)
| ~ owner(X2,X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(43,plain,
dog(odie),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(44,negated_conjecture,
~ hates(jon,jon),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(51,plain,
chased(odie,garfield),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(52,plain,
cat(garfield),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(62,plain,
owner(jon,odie),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(63,plain,
human(jon),
inference(split_conjunct,[status(thm)],[15]) ).
fof(64,plain,
! [X3] :
( ~ cat(X3)
| pet(X3) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(65,plain,
! [X4] :
( ~ cat(X4)
| pet(X4) ),
inference(variable_rename,[status(thm)],[64]) ).
cnf(66,plain,
( pet(X1)
| ~ cat(X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
fof(73,plain,
! [X3] :
( ~ dog(X3)
| pet(X3) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(74,plain,
! [X4] :
( ~ dog(X4)
| pet(X4) ),
inference(variable_rename,[status(thm)],[73]) ).
cnf(75,plain,
( pet(X1)
| ~ dog(X1) ),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(76,plain,
pet(garfield),
inference(spm,[status(thm)],[66,52,theory(equality)]) ).
cnf(78,plain,
pet(odie),
inference(spm,[status(thm)],[75,43,theory(equality)]) ).
cnf(83,plain,
( owner_of(garfield) = jon
| ~ pet(garfield)
| ~ human(jon) ),
inference(spm,[status(thm)],[39,25,theory(equality)]) ).
cnf(84,plain,
( owner_of(odie) = jon
| ~ pet(odie)
| ~ human(jon) ),
inference(spm,[status(thm)],[39,62,theory(equality)]) ).
cnf(86,plain,
( owner_of(garfield) = jon
| ~ pet(garfield)
| $false ),
inference(rw,[status(thm)],[83,63,theory(equality)]) ).
cnf(87,plain,
( owner_of(garfield) = jon
| ~ pet(garfield) ),
inference(cn,[status(thm)],[86,theory(equality)]) ).
cnf(88,plain,
( owner_of(odie) = jon
| ~ pet(odie)
| $false ),
inference(rw,[status(thm)],[84,63,theory(equality)]) ).
cnf(89,plain,
( owner_of(odie) = jon
| ~ pet(odie) ),
inference(cn,[status(thm)],[88,theory(equality)]) ).
cnf(90,plain,
( owner_of(garfield) = jon
| $false ),
inference(rw,[status(thm)],[87,76,theory(equality)]) ).
cnf(91,plain,
owner_of(garfield) = jon,
inference(cn,[status(thm)],[90,theory(equality)]) ).
cnf(94,plain,
( hates(jon,owner_of(X1))
| ~ chased(X1,garfield)
| ~ dog(X1)
| ~ cat(garfield) ),
inference(spm,[status(thm)],[24,91,theory(equality)]) ).
cnf(101,plain,
( hates(jon,owner_of(X1))
| ~ chased(X1,garfield)
| ~ dog(X1)
| $false ),
inference(rw,[status(thm)],[94,52,theory(equality)]) ).
cnf(102,plain,
( hates(jon,owner_of(X1))
| ~ chased(X1,garfield)
| ~ dog(X1) ),
inference(cn,[status(thm)],[101,theory(equality)]) ).
cnf(103,plain,
( owner_of(odie) = jon
| $false ),
inference(rw,[status(thm)],[89,78,theory(equality)]) ).
cnf(104,plain,
owner_of(odie) = jon,
inference(cn,[status(thm)],[103,theory(equality)]) ).
cnf(146,plain,
( hates(jon,jon)
| ~ chased(odie,garfield)
| ~ dog(odie) ),
inference(spm,[status(thm)],[102,104,theory(equality)]) ).
cnf(148,plain,
( hates(jon,jon)
| $false
| ~ dog(odie) ),
inference(rw,[status(thm)],[146,51,theory(equality)]) ).
cnf(149,plain,
( hates(jon,jon)
| $false
| $false ),
inference(rw,[status(thm)],[148,43,theory(equality)]) ).
cnf(150,plain,
hates(jon,jon),
inference(cn,[status(thm)],[149,theory(equality)]) ).
cnf(151,plain,
$false,
inference(sr,[status(thm)],[150,44,theory(equality)]) ).
cnf(152,plain,
$false,
151,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/PUZ/PUZ130+1.p
% --creating new selector for []
% -running prover on /tmp/tmpOPHEBW/sel_PUZ130+1.p_1 with time limit 29
% -prover status Theorem
% Problem PUZ130+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/PUZ/PUZ130+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/PUZ/PUZ130+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
%
%------------------------------------------------------------------------------