%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD037-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 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/FLD037-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(32,40,1,64,0,1,665542,4,2029,666067,50,2071,666067,40,2071,666099,0,2071,715083,3,2572,723332,4,2822,737190,5,3072,737190,1,3072,737190,50,3076,737190,40,3076,737222,0,3076,787129,3,3877,803924,4,4277,840723,5,4678,840723,1,4678,840723,50,4683,840723,40,4683,840755,0,4683)
% 
% 
% START OF PROOF
% 840730 [] equalish(multiply(X,multiplicative_inverse(X)),multiplicative_identity) | equalish(X,additive_identity) | -defined(X).
% 840738 [] defined(multiplicative_inverse(X)) | equalish(X,additive_identity) | -defined(X).
% 840745 [] -equalish(X,Y) | equalish(Y,X).
% 840746 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 840748 [] equalish(multiply(X,Y),multiply(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 840751 [] defined(a).
% 840753 [] -equalish(a,additive_identity).
% 840754 [] equalish(a,b).
% 840755 [] -equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))).
% 840767 [binary:840730.3,840751,cut:840753] equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity).
% 840778 [binary:840738.3,840751,cut:840753] defined(multiplicative_inverse(a)).
% 840845 [binary:840748.3,840778] equalish(multiply(X,multiplicative_inverse(a)),multiply(Y,multiplicative_inverse(a))) | -equalish(X,Y).
% 840884 [binary:840746.3,840755] -equalish(X,multiply(b,multiplicative_inverse(a))) | -equalish(multiplicative_identity,X).
% 841453 [binary:840745,840767] equalish(multiplicative_identity,multiply(a,multiplicative_inverse(a))).
% 845674 [binary:840754,840845.2] equalish(multiply(a,multiplicative_inverse(a)),multiply(b,multiplicative_inverse(a))).
% 847650 [binary:841453,840884.2,cut:845674] 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:    5878
%  derived clauses:   2593798
%  kept clauses:      211124
%  kept size sum:     80729
%  kept mid-nuclei:   52083
%  kept new demods:   0
%  forw unit-subs:    63556
%  forw double-subs: 190872
%  forw overdouble-subs: 11668
%  backward subs:     23
%  fast unit cutoff:  8252
%  full unit cutoff:  0
%  dbl  unit cutoff:  3
%  real runtime  :  47.77
%  process. runtime:  47.33
% specific non-discr-tree subsumption statistics: 
%  tried:           100815
%  length fails:    0
%  strength fails:  3643
%  predlist fails:  19919
%  aux str. fails:  0
%  by-lit fails:    8
%  full subs tried: 68058
%  full subs fail:  63665
% 
% ; 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/FLD037-1+noeq.in")
% 
%------------------------------------------------------------------------------