%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD060-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 : 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 19.4s
% Output   : Assurance 19.4s
% 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/FLD060-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(30,40,0,60,0,0,275745,4,2100)
% 
% 
% START OF PROOF
% 35 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 49 [] sum(X,Y,add(X,Y)) | -defined(X) | -defined(Y).
% 52 [] -less_or_equal(Z,X) | -less_or_equal(X,Y) | less_or_equal(Z,Y).
% 54 [] -sum(X,Y,Z) | -sum(U,Y,V) | -less_or_equal(X,U) | less_or_equal(Z,V).
% 57 [] defined(a).
% 58 [] defined(b).
% 59 [] less_or_equal(a,b).
% 60 [] -less_or_equal(add(a,a),add(b,b)).
% 74 [hyper:49,57,57] sum(a,a,add(a,a)).
% 99 [hyper:49,58,57] sum(b,a,add(b,a)).
% 100 [hyper:49,58,58] sum(b,b,add(b,b)).
% 8861 [hyper:35,99] sum(a,b,add(b,a)).
% 8902 [hyper:54,99,74,cut:59] less_or_equal(add(a,a),add(b,a)).
% 35271 [hyper:54,8861,100,cut:59] less_or_equal(add(b,a),add(b,b)).
% 276781 [binary:52.3,60] -less_or_equal(X,add(b,b)) | -less_or_equal(add(a,a),X).
% 276782 [binary:35271,276781,cut:8902] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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:    815
%  derived clauses:   580515
%  kept clauses:      23438
%  kept size sum:     276804
%  kept mid-nuclei:   252986
%  kept new demods:   0
%  forw unit-subs:    161182
%  forw double-subs: 104064
%  forw overdouble-subs: 22268
%  backward subs:     8
%  fast unit cutoff:  4788
%  full unit cutoff:  0
%  dbl  unit cutoff:  117
%  real runtime  :  21.71
%  process. runtime:  21.11
% specific non-discr-tree subsumption statistics: 
%  tried:           358464
%  length fails:    31552
%  strength fails:  2658
%  predlist fails:  168794
%  aux str. fails:  6664
%  by-lit fails:    27532
%  full subs tried: 1462
%  full subs fail:  1453
% 
% ; 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/FLD060-3+noeq.in")
% 
%------------------------------------------------------------------------------