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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : PUZ002-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 : art08.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/PUZ002-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 1 3)
% (binary-unit 10 #f 1 3)
% (binary-double 16 #f 1 3)
% (binary 54 #t 1 3)
% (binary-order 27 #f 1 3)
% (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(12,40,0,24,0,0)
% 
% 
% START OF PROOF
% 13 [] -in_house(X) | cat(X).
% 14 [] -gazer(X) | suitable_pet(X).
% 15 [] -detested(X) | avoided(X).
% 16 [] -carnivore(X) | prowler(X).
% 17 [] -cat(X) | mouse_killer(X).
% 18 [] -takes_to_me(X) | in_house(X).
% 19 [] -kangaroo(X) | -suitable_pet(X).
% 20 [] -mouse_killer(X) | carnivore(X).
% 21 [] takes_to_me(X) | detested(X).
% 22 [] -prowler(X) | gazer(X).
% 23 [] kangaroo(the_kangaroo).
% 24 [] -avoided(the_kangaroo).
% 36 [hyper:15,21] takes_to_me(X) | avoided(X).
% 40 [hyper:24,36] takes_to_me(the_kangaroo).
% 42 [hyper:18,40] in_house(the_kangaroo).
% 43 [hyper:13,42] cat(the_kangaroo).
% 44 [hyper:17,43] mouse_killer(the_kangaroo).
% 45 [hyper:20,44] carnivore(the_kangaroo).
% 48 [hyper:16,45] prowler(the_kangaroo).
% 49 [hyper:22,48] gazer(the_kangaroo).
% 50 [hyper:14,49] suitable_pet(the_kangaroo).
% 51 [hyper:19,50,cut:23] 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 3
% clause depth limited to 1
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    22
%  derived clauses:   41
%  kept clauses:      12
%  kept size sum:     32
%  kept mid-nuclei:   2
%  kept new demods:   0
%  forw unit-subs:    8
%  forw double-subs: 6
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  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/PUZ002-1+noeq.in")
% 
%------------------------------------------------------------------------------