%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : PLA002-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 : art10.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/PLA/PLA002-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 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f 2 5)
% (binary 54 #t 2 5)
% (binary-order 27 #f 2 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(17,40,0,34,0,0,52,50,0,69,0,0,96,50,0,113,0,0,153,50,0,170,0,0)
% 
% 
% START OF PROOF
% 145 [?] ?
% 154 [] at(f,s0).
% 155 [] at(d,go(d,X)) | -at(f,X).
% 159 [] at(c,go(c,X)) | -at(d,X).
% 163 [] at(b,skate(b,X)) | -at(c,X) | -cold(X).
% 165 [] at(a,drive(a,X)) | -at(b,X).
% 170 [] -at(a,X).
% 171 [hyper:155,154] at(d,go(d,s0)).
% 178 [hyper:159,171] at(c,go(c,go(d,s0))).
% 185 [hyper:163,178,cut:145] at(b,skate(b,go(c,go(d,s0)))).
% 216 [hyper:165,185,cut:170] 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:    80
%  derived clauses:   221
%  kept clauses:      36
%  kept size sum:     317
%  kept mid-nuclei:   42
%  kept new demods:   0
%  forw unit-subs:    39
%  forw double-subs: 5
%  forw overdouble-subs: 0
%  backward subs:     14
%  fast unit cutoff:  8
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           25
%  length fails:    0
%  strength fails:  0
%  predlist fails:  23
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 2
%  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/PLA/PLA002-1+noeq.in")
% 
%------------------------------------------------------------------------------