%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : HWV009-1 : 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 : art06.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/HWV009-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 3 13)
% (binary-unit 9 #f 3 13)
% (binary-double 9 #f 3 13)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 13)
% (binary-order 25 #f 3 13)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% SOS clause 
% -equal(level(plus(t_139,n1)),n0) | p_^wr_error(plus(t_139,n1)) | p_^rd_error(plus(t_139,n1)).
% was split for some strategies as: 
% -equal(level(plus(t_139,n1)),n0).
% p_^wr_error(plus(t_139,n1)).
% p_^rd_error(plus(t_139,n1)).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(93,40,1,186,0,1)
% 
% 
% START OF PROOF
% 120 [] equal(level(plus(X,n1)),n0) | -p_^reset(X).
% 123 [] -p_^wr_error(plus(X,n1)) | -p_^reset(X).
% 124 [] -p_^rd_error(plus(X,n1)) | -p_^reset(X).
% 185 [] p_^reset(t_139).
% 186 [] -equal(level(plus(t_139,n1)),n0) | p_^rd_error(plus(t_139,n1)) | p_^wr_error(plus(t_139,n1)).
% 187 [hyper:120,185] equal(level(plus(t_139,n1)),n0).
% 198 [input:186,cut:187] p_^rd_error(plus(t_139,n1)) | p_^wr_error(plus(t_139,n1)).
% 199 [hyper:123,198,cut:185] p_^rd_error(plus(t_139,n1)).
% 201 [hyper:124,199,cut:185] 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 13
% clause depth limited to 3
% seconds given: 12
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    6
%  derived clauses:   29
%  kept clauses:      7
%  kept size sum:     48
%  kept mid-nuclei:   6
%  kept new demods:   5
%  forw unit-subs:    14
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     3
%  fast unit cutoff:  4
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.1
% 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/HWV/HWV009-1+eq_r.in")
% 
%------------------------------------------------------------------------------