TSTP Solution File: PUZ031-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : PUZ031-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art03.cs.miami.edu
% Model    : i686 unknown
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1000MB
% OS       : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s

% Result   : Unsatisfiable 0.0s
% Output   : Assurance 0.0s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/PUZ/PUZ031-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 2 15)
% (binary-unit 10 #f 2 15)
% (binary-double 16 #f 2 15)
% (binary 54 #t 2 15)
% (binary-order 27 #f 2 15)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(26,40,0,56,0,0)
% 
% 
% START OF PROOF
% 27 [] -wolf(X) | animal(X).
% 28 [] -fox(X) | animal(X).
% 29 [] -bird(X) | animal(X).
% 31 [] -snail(X) | animal(X).
% 32 [] wolf(a_wolf).
% 33 [] fox(a_fox).
% 34 [] bird(a_bird).
% 36 [] snail(a_snail).
% 37 [] grain(a_grain).
% 38 [] -grain(X) | plant(X).
% 39 [] -much_smaller(X,Y) | -eats(X,Z) | eats(Y,U) | eats(Y,X) | -plant(Z) | -plant(U) | -animal(X) | -animal(Y).
% 41 [] much_smaller(X,Y) | -snail(X) | -bird(Y).
% 42 [] much_smaller(X,Y) | -bird(X) | -fox(Y).
% 43 [] much_smaller(X,Y) | -fox(X) | -wolf(Y).
% 45 [] -eats(X,Y) | -grain(Y) | -wolf(X).
% 47 [] -eats(X,Y) | -snail(Y) | -bird(X).
% 50 [] plant(snail_food_of(X)) | -snail(X).
% 51 [] eats(X,snail_food_of(X)) | -snail(X).
% 52 [] -eats(X,Y) | -eats(Y,Z) | -grain(Z) | -animal(X) | -animal(Y).
% 57 [hyper:27,32] animal(a_wolf).
% 61 [hyper:28,33] animal(a_fox).
% 64 [hyper:43,33,32] much_smaller(a_fox,a_wolf).
% 66 [hyper:29,34] animal(a_bird).
% 70 [hyper:42,34,33] much_smaller(a_bird,a_fox).
% 80 [hyper:31,36] animal(a_snail).
% 82 [hyper:41,36,34] much_smaller(a_snail,a_bird).
% 84 [hyper:50,36] plant(snail_food_of(a_snail)).
% 85 [hyper:51,36] eats(a_snail,snail_food_of(a_snail)).
% 89 [hyper:38,37] plant(a_grain).
% 188 [hyper:39,85,82,89,cut:84,cut:80,cut:66] eats(a_bird,a_grain) | eats(a_bird,a_snail).
% 256 [hyper:47,188,cut:36,cut:34] eats(a_bird,a_grain).
% 274 [hyper:39,256,70,89,cut:89,cut:66,cut:61] eats(a_fox,a_grain) | eats(a_fox,a_bird).
% 298 [hyper:52,274,256,cut:61,cut:66,cut:37] eats(a_fox,a_grain).
% 323 [hyper:39,298,64,89,cut:89,cut:61,cut:57] eats(a_wolf,a_grain) | eats(a_wolf,a_fox).
% 344 [hyper:52,323,298,cut:57,cut:61,cut:37] eats(a_wolf,a_grain).
% 354 [hyper:45,344,cut:37,cut:32] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 15
% clause depth limited to 2
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    58
%  derived clauses:   389
%  kept clauses:      51
%  kept size sum:     239
%  kept mid-nuclei:   223
%  kept new demods:   0
%  forw unit-subs:    70
%  forw double-subs: 15
%  forw overdouble-subs: 6
%  backward subs:     7
%  fast unit cutoff:  109
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           106
%  length fails:    0
%  strength fails:  42
%  predlist fails:  39
%  aux str. fails:  11
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/PUZ/PUZ031-1+noeq.in")
% 
%------------------------------------------------------------------------------