%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD071-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 : art01.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 0.0s
% Output   : Assurance 0.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/FLD071-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)
% 
% 
% START OF PROOF
% 51 [] -less_or_equal(Z,X) | -less_or_equal(X,Y) | less_or_equal(Z,Y).
% 52 [] less_or_equal(X,Y) | less_or_equal(Y,X) | -defined(X) | -defined(Y).
% 54 [] less_or_equal(additive_identity,multiply(X,Y)) | -less_or_equal(additive_identity,X) | -less_or_equal(additive_identity,Y).
% 56 [] -equalish(X,Y) | equalish(Y,X).
% 60 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 64 [] defined(u).
% 65 [] less_or_equal(additive_identity,a).
% 66 [] less_or_equal(additive_identity,b).
% 67 [] equalish(multiply(a,b),u).
% 68 [] -less_or_equal(additive_identity,u).
% 381 [hyper:52,64,64] less_or_equal(u,u).
% 1334 [hyper:54,66,65] less_or_equal(additive_identity,multiply(a,b)).
% 1336 [hyper:56,67] equalish(u,multiply(a,b)).
% 23789 [hyper:60,1336,381] less_or_equal(multiply(a,b),u).
% 59113 [hyper:51,23789,1334,cut:68] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 3
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    375
%  derived clauses:   218080
%  kept clauses:      55355
%  kept size sum:     782807
%  kept mid-nuclei:   3656
%  kept new demods:   0
%  forw unit-subs:    24109
%  forw double-subs: 88085
%  forw overdouble-subs: 3428
%  backward subs:     2
%  fast unit cutoff:  5
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  4.2
%  process. runtime:  4.2
% specific non-discr-tree subsumption statistics: 
%  tried:           10194
%  length fails:    0
%  strength fails:  90
%  predlist fails:  4513
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 948
%  full subs fail:  948
% 
% ; 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/FLD071-2+noeq.in")
% 
%------------------------------------------------------------------------------