%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD018-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 : art08.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 50.0s
% Output   : Assurance 50.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/FLD/FLD018-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,0,60,0,0,523689,4,2026,523815,50,2057,523815,40,2057,523845,0,2057,558125,3,2558,561532,4,2808,584911,5,3058,584911,5,3058,584911,1,3058,584911,50,3062,584911,40,3062,584941,0,3062,627140,3,3863,637020,4,4263,659971,62,4663,659972,5,4663,659972,1,4663,659972,50,4667,659972,40,4667,660002,0,4667)
% 
% 
% START OF PROOF
% 659974 [] equalish(add(additive_identity,X),X) | -defined(X).
% 659975 [] equalish(add(X,additive_inverse(X)),additive_identity) | -defined(X).
% 659984 [] defined(additive_inverse(X)) | -defined(X).
% 659994 [] -equalish(X,Y) | equalish(Y,X).
% 659995 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 659996 [] equalish(add(X,Y),add(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 660000 [] defined(a).
% 660001 [] equalish(a,additive_identity).
% 660002 [] -equalish(additive_inverse(a),additive_identity).
% 660007 [binary:659975.2,660000] equalish(add(a,additive_inverse(a)),additive_identity).
% 660021 [binary:659984.2,660000] defined(additive_inverse(a)).
% 660046 [binary:659994,660001] equalish(additive_identity,a).
% 660056 [binary:659996.2,660046] equalish(add(additive_identity,X),add(a,X)) | -defined(X).
% 660060 [binary:659994.2,660002] -equalish(additive_identity,additive_inverse(a)).
% 660066 [binary:659995.3,660060] -equalish(X,additive_inverse(a)) | -equalish(additive_identity,X).
% 660300 [binary:659995.2,660007] -equalish(X,add(a,additive_inverse(a))) | equalish(X,additive_identity).
% 662469 [binary:659974,660066,cut:660021] -equalish(additive_identity,add(additive_identity,additive_inverse(a))).
% 662489 [binary:659994.2,662469] -equalish(add(additive_identity,additive_inverse(a)),additive_identity).
% 684204 [binary:660056,660300,cut:662489,cut:660021] 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:    6458
%  derived clauses:   2330949
%  kept clauses:      188946
%  kept size sum:     366063
%  kept mid-nuclei:   52333
%  kept new demods:   0
%  forw unit-subs:    105382
%  forw double-subs: 224319
%  forw overdouble-subs: 4801
%  backward subs:     26
%  fast unit cutoff:  13058
%  full unit cutoff:  2
%  dbl  unit cutoff:  121
%  real runtime  :  50.50
%  process. runtime:  50.49
% specific non-discr-tree subsumption statistics: 
%  tried:           182588
%  length fails:    126
%  strength fails:  17022
%  predlist fails:  26714
%  aux str. fails:  223
%  by-lit fails:    28
%  full subs tried: 138169
%  full subs fail:  133578
% 
% ; 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/FLD018-1+noeq.in")
% 
%------------------------------------------------------------------------------