%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD030-2 : 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 : art09.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.5s
% Output   : Assurance 39.5s
% 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/FLD030-2+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,0,68,0,0,756171,4,2027,756200,50,2059,756200,40,2059,756234,0,2059,795572,3,2560,802497,4,2810,825381,5,3060,825381,1,3060,825381,50,3064,825381,40,3064,825415,0,3064,891362,3,3865,904854,4,4266,968259,5,4665,968260,5,4666,968260,1,4666,968260,50,4672,968260,40,4672,968294,0,4672)
% 
% 
% START OF PROOF
% 968282 [] -equalish(X,Y) | equalish(Y,X).
% 968283 [] -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z).
% 968285 [] equalish(multiply(X,Y),multiply(Z,Y)) | -equalish(X,Z) | -defined(Y).
% 968289 [] defined(b).
% 968292 [] equalish(multiply(a,b),c).
% 968293 [] equalish(a,d).
% 968294 [] -equalish(multiply(d,b),c).
% 968350 [binary:968285.3,968289] equalish(multiply(X,b),multiply(Y,b)) | -equalish(X,Y).
% 968426 [binary:968283.2,968292] -equalish(X,multiply(a,b)) | equalish(X,c).
% 968481 [binary:968282,968293] equalish(d,a).
% 972304 [binary:968481,968350.2] equalish(multiply(d,b),multiply(a,b)).
% 978898 [binary:968294,968426.2,cut:972304] 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:    5503
%  derived clauses:   2559748
%  kept clauses:      215967
%  kept size sum:     113050
%  kept mid-nuclei:   88002
%  kept new demods:   0
%  forw unit-subs:    79907
%  forw double-subs: 114058
%  forw overdouble-subs: 8835
%  backward subs:     4
%  fast unit cutoff:  11481
%  full unit cutoff:  0
%  dbl  unit cutoff:  64
%  real runtime  :  48.8
%  process. runtime:  47.54
% specific non-discr-tree subsumption statistics: 
%  tried:           126807
%  length fails:    12
%  strength fails:  4054
%  predlist fails:  63850
%  aux str. fails:  0
%  by-lit fails:    8
%  full subs tried: 50514
%  full subs fail:  46441
% 
% ; 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/FLD030-2+noeq.in")
% 
%------------------------------------------------------------------------------