%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ROB008-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 : 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 119.1s
% Output   : Assurance 119.1s
% 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/ROB008-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,1,12,0,1,870,3,3010,870,4,4511,870,5,6002,870,1,6002,870,50,6002,870,40,6002,876,0,6002,1734,3,7514,1734,4,8266,1734,5,9003,1734,1,9003,1734,50,9003,1734,40,9003,1740,0,9003,42667,3,10511,70376,4,11271,111032,5,12004,111032,1,12004,111032,50,12008,111032,40,12008,111038,0,12008)
% 
% 
% START OF PROOF
% 111035 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 111036 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 111037 [] equal(negate(add(a,negate(add(b,c)))),negate(add(a,add(b,negate(c))))).
% 111038 [] -equal(add(a,b),a).
% 111067 [para:111035.1.1,111036.1.1.1.1.1,demod:111035] equal(negate(add(negate(add(X,add(Y,Z))),negate(add(X,add(Y,negate(Z)))))),add(X,Y)).
% 111069 [para:111037.1.1,111036.1.1.1.2,demod:111067,cut:111038] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not 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: 180
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2051
%  derived clauses:   10710108
%  kept clauses:      52492
%  kept size sum:     422
%  kept mid-nuclei:   0
%  kept new demods:   26399
%  forw unit-subs:    3736647
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     29
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  121.10
%  process. runtime:  120.7
% 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/ROB008-1+eq_r.in")
% 
%------------------------------------------------------------------------------