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

% Computer : art02.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/HWV/HWV026-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(138,40,1,276,0,1)
% 
% 
% START OF PROOF
% 195 [] p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr__error_(f_^a^d^d_(X,n1))) | -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr__error_(X)) | p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr_(X)) | p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^treset_(X)).
% 273 [] -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr_(t_206)).
% 274 [] -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^treset_(t_206)).
% 275 [] -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr__error_(f_^a^d^d_(t_206,n1))).
% 276 [] p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr__error_(t_206)).
% 353 [hyper:195,276,cut:275,cut:273,cut:274] 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 19
% clause depth limited to 5
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    7
%  derived clauses:   90
%  kept clauses:      18
%  kept size sum:     111
%  kept mid-nuclei:   58
%  kept new demods:   15
%  forw unit-subs:    13
%  forw double-subs: 0
%  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.1
% specific non-discr-tree subsumption statistics: 
%  tried:           71
%  length fails:    0
%  strength fails:  38
%  predlist fails:  10
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 23
%  full subs fail:  23
% 
% ; 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/HWV/HWV026-2+eq_r.in")
% 
%------------------------------------------------------------------------------