%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD055-3 : 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 : art07.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/FLD055-3+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 2 9)
% (binary-unit 10 #f 2 9)
% (binary-double 16 #f 2 9)
% (binary 54 #t 2 9)
% (binary-order 27 #f 2 9)
% (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,0,64,0,0)
% 
% 
% START OF PROOF
% 35 [] sum(additive_identity,X,X) | -defined(X).
% 46 [] defined(additive_identity).
% 54 [] -less_or_equal(X,Y) | -less_or_equal(Y,Z) | less_or_equal(X,Z).
% 55 [] less_or_equal(X,Y) | less_or_equal(Y,X) | -defined(X) | -defined(Y).
% 56 [] -sum(X,Y,Z) | -sum(U,Y,V) | -less_or_equal(X,U) | less_or_equal(Z,V).
% 60 [] defined(b).
% 62 [] less_or_equal(a,b).
% 63 [] sum(additive_identity,b,c).
% 64 [] -less_or_equal(a,c).
% 86 [hyper:35,60] sum(additive_identity,b,b).
% 198 [hyper:55,46,46] less_or_equal(additive_identity,additive_identity).
% 750 [hyper:56,86,63,cut:198] less_or_equal(b,c).
% 764 [hyper:54,750,62,cut:64] 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 9
% clause depth limited to 2
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    45
%  derived clauses:   1385
%  kept clauses:      500
%  kept size sum:     4589
%  kept mid-nuclei:   193
%  kept new demods:   0
%  forw unit-subs:    110
%  forw double-subs: 298
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  4
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           131
%  length fails:    0
%  strength fails:  78
%  predlist fails:  13
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 40
%  full subs fail:  40
% 
% ; 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/FLD055-3+noeq.in")
% 
%------------------------------------------------------------------------------