%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MSC002-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 : art05.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/MSC/MSC002-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 4 5)
% (binary-unit 10 #f 4 5)
% (binary-double 16 #f 4 5)
% (binary 54 #t 4 5)
% (binary-order 27 #f 4 5)
% (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(14,40,1,28,0,1,207,50,2,221,0,2)
% 
% 
% START OF PROOF
% 208 [] at(something,here,now).
% 211 [] -held(X,let_go(Y)).
% 212 [] -at(X,here,Y) | red(X).
% 213 [] at(X,Y,let_go(Z)) | -at(X,Y,Z).
% 214 [] at(X,Y,pick_up(Z)) | -at(X,Y,Z).
% 215 [] grabbed(X,pick_up(go(Y,let_go(Z)))) | -at(X,Y,Z).
% 216 [] -put(X,there,Y) | -red(X) | answer(Y).
% 217 [] put(X,Y,go(Y,Z)) | -at(X,U,Z) | -grabbed(X,Z).
% 218 [] at(X,Y,go(Z,U)) | -at(X,Y,U) | held(X,U).
% 221 [] -answer(X).
% 222 [hyper:212,208] red(something).
% 223 [hyper:213,208] at(something,here,let_go(now)).
% 225 [hyper:215,208] grabbed(something,pick_up(go(here,let_go(now)))).
% 234 [hyper:218,223,cut:211] at(something,here,go(X,let_go(now))).
% 267 [hyper:214,234] at(something,here,pick_up(go(X,let_go(now)))).
% 333 [hyper:217,267,225] put(something,X,go(X,pick_up(go(here,let_go(now))))).
% 411 [hyper:216,333,cut:222] answer(go(there,pick_up(go(here,let_go(now))))).
% 412 [hyper:221,411] 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 5
% clause depth limited to 5
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    126
%  derived clauses:   1408
%  kept clauses:      117
%  kept size sum:     1142
%  kept mid-nuclei:   207
%  kept new demods:   0
%  forw unit-subs:    256
%  forw double-subs: 33
%  forw overdouble-subs: 9
%  backward subs:     0
%  fast unit cutoff:  14
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.2
% specific non-discr-tree subsumption statistics: 
%  tried:           23
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    12
%  full subs tried: 11
%  full subs fail:  2
% 
% ; 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/MSC/MSC002-1+noeq.in")
% 
%------------------------------------------------------------------------------