%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ROB021-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 : art05.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/ROB/ROB021-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: peq
% 
% strategies selected: 
% (hyper 30 #f 6 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 6 3)
% (binary-posweight-lex-big-order 30 #f 6 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(6,40,0,12,0,1)
% 
% 
% START OF PROOF
% 8 [] equal(add(X,Y),add(Y,X)).
% 10 [] equal(negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))),X).
% 11 [] -equal(negate(X),negate(Y)) | equal(X,Y).
% 12 [] -equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b).
% 43 [para:8.1.1,10.1.1.1.1.1] equal(negate(add(negate(add(X,Y)),negate(add(Y,negate(X))))),Y).
% 80 [para:8.1.1,43.1.1.1.2.1] equal(negate(add(negate(add(X,Y)),negate(add(negate(X),Y)))),Y).
% 108 [hyper:11,80,slowcut:12] 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 3
% clause depth limited to 6
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    19
%  derived clauses:   1002
%  kept clauses:      93
%  kept size sum:     1611
%  kept mid-nuclei:   0
%  kept new demods:   19
%  forw unit-subs:    665
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  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/ROB/ROB021-1+eq_r.in")
% 
%------------------------------------------------------------------------------