%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD005-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 : 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 59.9s
% Output   : Assurance 59.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/FLD/FLD005-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(30,40,2,60,0,2,647188,4,2046,647462,50,2081,647462,40,2081,647492,0,2081,694922,3,2582,701326,4,2832,714344,5,3083,714344,1,3083,714344,50,3088,714344,40,3088,714374,0,3088,776572,3,3889,787293,4,4289,818315,5,4689,818315,1,4689,818315,50,4693,818315,40,4693,818345,0,4693)
% 
% 
% START OF PROOF
% 818316 [] equalish(add(X,add(Y,Z)),add(add(X,Y),Z)) | -defined(Y) | -defined(Z) | -defined(X).
% 818317 [] equalish(add(additive_identity,X),X) | -defined(X).
% 818318 [] equalish(add(X,additive_inverse(X)),additive_identity) | -defined(X).
% 818327 [] defined(additive_inverse(X)) | -defined(X).
% 818337 [] -equalish(X,Y) | equalish(Y,X).
% 818338 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 818339 [] equalish(add(X,Y),add(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 818343 [] defined(a).
% 818344 [] defined(b).
% 818345 [] -equalish(add(a,X),b).
% 818350 [binary:818318.2,818343] equalish(add(a,additive_inverse(a)),additive_identity).
% 818365 [binary:818327.2,818343] defined(additive_inverse(a)).
% 818375 [binary:818316.3,818344] equalish(add(X,add(Y,b)),add(add(X,Y),b)) | -defined(X) | -defined(Y).
% 818377 [binary:818317.2,818344] equalish(add(additive_identity,b),b).
% 818440 [binary:818338.3,818345] -equalish(add(a,X),Y) | -equalish(Y,b).
% 818477 [binary:818337,818377] equalish(b,add(additive_identity,b)).
% 818511 [binary:818338,818477] -equalish(add(additive_identity,b),X) | equalish(b,X).
% 818643 [binary:818337,818350] equalish(additive_identity,add(a,additive_inverse(a))).
% 823411 [binary:818337.2,818440.2] -equalish(add(a,X),Y) | -equalish(b,Y).
% 828493 [binary:818339,818511,cut:818344] equalish(b,add(X,b)) | -equalish(additive_identity,X).
% 872141 [binary:818375,823411,cut:818343,binarydemod:828493] -equalish(additive_identity,add(a,X)) | -defined(X).
% 872179 [binary:818365,872141.2,cut:818643] 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:    7094
%  derived clauses:   3055797
%  kept clauses:      248913
%  kept size sum:     865813
%  kept mid-nuclei:   42411
%  kept new demods:   0
%  forw unit-subs:    55533
%  forw double-subs: 189055
%  forw overdouble-subs: 16293
%  backward subs:     45
%  fast unit cutoff:  4964
%  full unit cutoff:  5
%  dbl  unit cutoff:  224
%  real runtime  :  60.42
%  process. runtime:  60.8
% specific non-discr-tree subsumption statistics: 
%  tried:           275259
%  length fails:    65
%  strength fails:  21340
%  predlist fails:  87638
%  aux str. fails:  815
%  by-lit fails:    230
%  full subs tried: 149795
%  full subs fail:  143341
% 
% ; 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/FLD005-1+noeq.in")
% 
%------------------------------------------------------------------------------