%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD017-1 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art07.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 39.6s
% Output   : Assurance 39.6s
% 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/FLD/FLD017-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(34,40,1,68,0,1,771598,4,2041,771627,50,2072,771627,40,2072,771661,0,2072,813609,3,2573,821103,4,2823,839930,5,3073,839930,1,3073,839930,50,3077,839930,40,3077,839964,0,3077,888612,3,3878,904235,4,4279,969217,5,4678,969217,1,4678,969217,50,4683,969217,40,4683,969251,0,4683)
% 
% 
% START OF PROOF
% 969239 [] -equalish(X,Y) | equalish(Y,X).
% 969240 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 969241 [] equalish(add(X,Y),add(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 969246 [] defined(b).
% 969249 [] equalish(a,x).
% 969250 [] equalish(add(a,b),c).
% 969251 [] -equalish(add(x,b),c).
% 969306 [binary:969241.3,969246] equalish(add(X,b),add(Y,b)) | -equalish(X,Y).
% 969381 [binary:969239,969249] equalish(x,a).
% 969444 [binary:969240.2,969250] -equalish(X,add(a,b)) | equalish(X,c).
% 973238 [binary:969381,969306.2] equalish(add(x,b),add(a,b)).
% 987158 [binary:969251,969444.2,cut:973238] 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
% clause length limited to 7
% clause depth limited to 3
% seconds given: 54
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    6013
%  derived clauses:   2813258
%  kept clauses:      211531
%  kept size sum:     206213
%  kept mid-nuclei:   86963
%  kept new demods:   0
%  forw unit-subs:    82459
%  forw double-subs: 115070
%  forw overdouble-subs: 9351
%  backward subs:     4
%  fast unit cutoff:  10230
%  full unit cutoff:  0
%  dbl  unit cutoff:  64
%  real runtime  :  49.13
%  process. runtime:  48.69
% specific non-discr-tree subsumption statistics: 
%  tried:           125285
%  length fails:    12
%  strength fails:  3735
%  predlist fails:  63954
%  aux str. fails:  0
%  by-lit fails:    8
%  full subs tried: 49223
%  full subs fail:  44634
% 
% ; 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/FLD/FLD017-1+noeq.in")
% 
%------------------------------------------------------------------------------