%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ROB009-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 : art09.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 88.9s
% Output   : Assurance 88.9s
% 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/ROB/ROB009-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: ueq
% 
% strategies selected: 
% (binary-posweight-kb-big-order 60 #f 6 1)
% (binary-posweight-lex-big-order 30 #f 6 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(6,40,0,12,0,0,869,3,3012,869,4,4502,869,5,6001,869,1,6001,869,50,6001,869,40,6001,875,0,6001,1732,3,7509,1732,4,8266,1732,5,9002,1732,1,9002,1732,50,9002,1732,40,9002,1738,0,9002)
% 
% 
% START OF PROOF
% 1734 [] equal(add(X,Y),add(Y,X)).
% 1735 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 1736 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 1737 [] equal(negate(add(a,negate(add(b,c)))),negate(add(b,negate(add(a,c))))).
% 1738 [] -equal(a,b).
% 1742 [para:1737.1.2,1736.1.1.1.2] equal(negate(add(negate(add(b,add(a,c))),negate(add(a,negate(add(b,c)))))),b).
% 1760 [para:1734.1.1,1742.1.1.1.1.1,demod:1735] equal(negate(add(negate(add(a,add(c,b))),negate(add(a,negate(add(b,c)))))),b).
% 1780 [para:1734.1.1,1760.1.1.1.1.1.2,demod:1736,cut:1738] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1042
%  derived clauses:   9675419
%  kept clauses:      1755
%  kept size sum:     38613
%  kept mid-nuclei:   0
%  kept new demods:   90
%  forw unit-subs:    2744451
%  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  :  91.21
%  process. runtime:  90.2
% 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/ROB/ROB009-1+eq_r.in")
% 
%------------------------------------------------------------------------------