%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : BOO005-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 10.0s
% Output   : Assurance 10.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/BOO/BOO005-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 58 #f 2 9)
% (binary-posweight-order 29 #f 2 9)
% (binary-unit 29 #f 2 9)
% (binary-double 29 #f 2 9)
% (binary 29 #t 2 9)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(24,40,0,48,0,0)
% 
% 
% START OF PROOF
% 26 [] sum(X,Y,add(X,Y)).
% 31 [] sum(X,additive_identity,X).
% 32 [] product(multiplicative_identity,X,X).
% 36 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(W,X,U) | sum(X1,Z,V).
% 38 [] -product(X,Y,Z) | -sum(U,Z,X1) | -sum(U,X,W) | -sum(U,Y,V) | product(W,V,X1).
% 43 [] sum(X,inverse(X),multiplicative_identity).
% 45 [] product(X,inverse(X),additive_identity).
% 48 [] -sum(x,multiplicative_identity,multiplicative_identity).
% 1020 [hyper:38,26,32,43,43] product(add(X,multiplicative_identity),multiplicative_identity,multiplicative_identity).
% 1369 [hyper:38,45,43,26,31] product(add(X,X),multiplicative_identity,X).
% 461226 [hyper:36,1020,32,slowcut:26,slowcut:1369,slowcut:48] 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 9
% clause depth limited to 2
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    93
%  derived clauses:   3650221
%  kept clauses:      320
%  kept size sum:     2402
%  kept mid-nuclei:   460838
%  kept new demods:   10
%  forw unit-subs:    2928601
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     5
%  fast unit cutoff:  14
%  full unit cutoff:  6
%  dbl  unit cutoff:  0
%  real runtime  :  19.15
%  process. runtime:  19.14
% specific non-discr-tree subsumption statistics: 
%  tried:           78920
%  length fails:    0
%  strength fails:  48653
%  predlist fails:  29507
%  aux str. fails:  589
%  by-lit fails:    0
%  full subs tried: 171
%  full subs fail:  171
% 
% ; 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/BOO/BOO005-1+eq_r.in")
% 
%------------------------------------------------------------------------------