TSTP Solution File: PUZ060+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : PUZ060+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:53:31 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 120 ( 34 ~; 28 |; 48 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 67 ( 1 sgn 46 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ( ! [X7] :
( food(X7)
=> likes(X2,X7) )
& food(X5)
& food(X6)
& ! [X7] :
( ? [X8] :
( eats(X8,X7)
& not_killed_by(X8,X7) )
=> food(X7) )
& eats(X3,X1)
& alive(X3)
& ! [X7] :
( eats(X3,X7)
=> eats(X4,X7) )
& ! [X8] :
( alive(X8)
=> ! [X7] : not_killed_by(X8,X7) ) )
=> likes(X2,X1) ),
file('/tmp/tmpMZruH9/sel_PUZ060+1.p_1',prove_this) ).
fof(2,negated_conjecture,
~ ! [X1,X2,X3,X4,X5,X6] :
( ( ! [X7] :
( food(X7)
=> likes(X2,X7) )
& food(X5)
& food(X6)
& ! [X7] :
( ? [X8] :
( eats(X8,X7)
& not_killed_by(X8,X7) )
=> food(X7) )
& eats(X3,X1)
& alive(X3)
& ! [X7] :
( eats(X3,X7)
=> eats(X4,X7) )
& ! [X8] :
( alive(X8)
=> ! [X7] : not_killed_by(X8,X7) ) )
=> likes(X2,X1) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
? [X1,X2,X3,X4,X5,X6] :
( ! [X7] :
( ~ food(X7)
| likes(X2,X7) )
& food(X5)
& food(X6)
& ! [X7] :
( ! [X8] :
( ~ eats(X8,X7)
| ~ not_killed_by(X8,X7) )
| food(X7) )
& eats(X3,X1)
& alive(X3)
& ! [X7] :
( ~ eats(X3,X7)
| eats(X4,X7) )
& ! [X8] :
( ~ alive(X8)
| ! [X7] : not_killed_by(X8,X7) )
& ~ likes(X2,X1) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
? [X9,X10,X11,X12,X13,X14] :
( ! [X15] :
( ~ food(X15)
| likes(X10,X15) )
& food(X13)
& food(X14)
& ! [X16] :
( ! [X17] :
( ~ eats(X17,X16)
| ~ not_killed_by(X17,X16) )
| food(X16) )
& eats(X11,X9)
& alive(X11)
& ! [X18] :
( ~ eats(X11,X18)
| eats(X12,X18) )
& ! [X19] :
( ~ alive(X19)
| ! [X20] : not_killed_by(X19,X20) )
& ~ likes(X10,X9) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X15] :
( ~ food(X15)
| likes(esk2_0,X15) )
& food(esk5_0)
& food(esk6_0)
& ! [X16] :
( ! [X17] :
( ~ eats(X17,X16)
| ~ not_killed_by(X17,X16) )
| food(X16) )
& eats(esk3_0,esk1_0)
& alive(esk3_0)
& ! [X18] :
( ~ eats(esk3_0,X18)
| eats(esk4_0,X18) )
& ! [X19] :
( ~ alive(X19)
| ! [X20] : not_killed_by(X19,X20) )
& ~ likes(esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X15,X16,X17,X18,X19,X20] :
( ( not_killed_by(X19,X20)
| ~ alive(X19) )
& ( ~ eats(esk3_0,X18)
| eats(esk4_0,X18) )
& ( ~ eats(X17,X16)
| ~ not_killed_by(X17,X16)
| food(X16) )
& ( ~ food(X15)
| likes(esk2_0,X15) )
& food(esk5_0)
& food(esk6_0)
& eats(esk3_0,esk1_0)
& alive(esk3_0)
& ~ likes(esk2_0,esk1_0) ),
inference(shift_quantors,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
~ likes(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
alive(esk3_0),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
eats(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(12,negated_conjecture,
( likes(esk2_0,X1)
| ~ food(X1) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(13,negated_conjecture,
( food(X1)
| ~ not_killed_by(X2,X1)
| ~ eats(X2,X1) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(15,negated_conjecture,
( not_killed_by(X1,X2)
| ~ alive(X1) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(16,negated_conjecture,
~ food(esk1_0),
inference(spm,[status(thm)],[7,12,theory(equality)]) ).
cnf(17,negated_conjecture,
( food(X1)
| ~ eats(X2,X1)
| ~ alive(X2) ),
inference(spm,[status(thm)],[13,15,theory(equality)]) ).
cnf(18,negated_conjecture,
( food(esk1_0)
| ~ alive(esk3_0) ),
inference(spm,[status(thm)],[17,9,theory(equality)]) ).
cnf(20,negated_conjecture,
( food(esk1_0)
| $false ),
inference(rw,[status(thm)],[18,8,theory(equality)]) ).
cnf(21,negated_conjecture,
food(esk1_0),
inference(cn,[status(thm)],[20,theory(equality)]) ).
cnf(22,negated_conjecture,
$false,
inference(sr,[status(thm)],[21,16,theory(equality)]) ).
cnf(23,negated_conjecture,
$false,
22,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/PUZ/PUZ060+1.p
% --creating new selector for []
% -running prover on /tmp/tmpMZruH9/sel_PUZ060+1.p_1 with time limit 29
% -prover status Theorem
% Problem PUZ060+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/PUZ/PUZ060+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/PUZ/PUZ060+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
%
%------------------------------------------------------------------------------