%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD013-4 : 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 : art10.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/FLD013-4+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(35,40,0,70,0,1)
% 
% 
% START OF PROOF
% 37 [] -sum(Y,U,V) | -sum(X,V,W) | -sum(X,Y,Z) | sum(Z,U,W).
% 38 [] sum(additive_identity,X,X) | -defined(X).
% 40 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 49 [] defined(additive_identity).
% 56 [] sum(additive_identity,X,Y) | -less_or_equal(X,Y) | -less_or_equal(Y,X).
% 58 [] less_or_equal(X,Y) | less_or_equal(Y,X) | -defined(X) | -defined(Y).
% 59 [] -sum(X,Y,Z) | -sum(U,Y,V) | -less_or_equal(X,U) | less_or_equal(Z,V).
% 62 [] defined(a).
% 67 [] sum(additive_identity,a,b).
% 68 [] sum(additive_identity,c,d).
% 69 [] sum(a,c,u).
% 70 [] -sum(d,b,u).
% 71 [hyper:38,62] sum(additive_identity,a,a).
% 341 [hyper:58,49,49] less_or_equal(additive_identity,additive_identity).
% 465 [hyper:40,68] sum(c,additive_identity,d).
% 548 [hyper:40,69] sum(c,a,u).
% 716 [hyper:59,71,67,cut:341] less_or_equal(a,b).
% 718 [hyper:59,71,67,cut:341] less_or_equal(b,a).
% 732 [hyper:56,716,cut:718] sum(additive_identity,b,a).
% 9208 [hyper:37,732,465,548,cut:70] 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:    175
%  derived clauses:   33451
%  kept clauses:      6970
%  kept size sum:     88273
%  kept mid-nuclei:   2142
%  kept new demods:   0
%  forw unit-subs:    1014
%  forw double-subs: 18780
%  forw overdouble-subs: 336
%  backward subs:     0
%  fast unit cutoff:  23
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.48
%  process. runtime:  0.47
% specific non-discr-tree subsumption statistics: 
%  tried:           2062
%  length fails:    1
%  strength fails:  505
%  predlist fails:  743
%  aux str. fails:  36
%  by-lit fails:    0
%  full subs tried: 441
%  full subs fail:  441
% 
% ; 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/FLD013-4+noeq.in")
% 
%------------------------------------------------------------------------------