%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD059-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 20.0s
% Output   : Assurance 20.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/FLD059-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(32,40,1,64,0,1,650261,4,2042,650528,50,2073,650528,40,2073,650560,0,2073,692456,3,2574,701160,4,2824)
% 
% 
% START OF PROOF
% 650530 [] equalish(add(additive_identity,X),X) | -defined(X).
% 650545 [] -less_or_equal(Z,X) | -less_or_equal(X,Y) | less_or_equal(Z,Y).
% 650546 [] less_or_equal(X,Y) | less_or_equal(Y,X) | -defined(X) | -defined(Y).
% 650547 [] less_or_equal(add(X,Y),add(Z,Y)) | -less_or_equal(X,Z) | -defined(Y).
% 650550 [] -equalish(X,Y) | equalish(Y,X).
% 650554 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 650556 [] defined(a).
% 650557 [] defined(u).
% 650558 [] less_or_equal(additive_identity,a).
% 650559 [] equalish(add(a,a),u).
% 650560 [] -less_or_equal(additive_identity,u).
% 650578 [input:650546,factor] less_or_equal(X,X) | -defined(X).
% 650612 [binary:650556,650530.2] equalish(add(additive_identity,a),a).
% 650640 [binary:650557,650578.2] less_or_equal(u,u).
% 650712 [binary:650559,650550] equalish(u,add(a,a)).
% 650879 [binary:650558,650545] -less_or_equal(a,X) | less_or_equal(additive_identity,X).
% 650881 [binary:650560,650545.3] -less_or_equal(X,u) | -less_or_equal(additive_identity,X).
% 650935 [binary:650556,650547.3] less_or_equal(add(X,a),add(Y,a)) | -less_or_equal(X,Y).
% 651374 [binary:650640,650554] -equalish(u,X) | less_or_equal(X,u).
% 651381 [binary:650612,650554.2] -less_or_equal(add(additive_identity,a),X) | less_or_equal(a,X).
% 653123 [binary:650712,651374] less_or_equal(add(a,a),u).
% 653137 [binary:650881,653123] -less_or_equal(additive_identity,add(a,a)).
% 653244 [binary:650879.2,653137] -less_or_equal(a,add(a,a)).
% 683733 [binary:650558,650935.2] less_or_equal(add(additive_identity,a),add(a,a)).
% 711401 [binary:683733,651381,cut:653244] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit 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: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2856
%  derived clauses:   1423852
%  kept clauses:      127324
%  kept size sum:     846719
%  kept mid-nuclei:   16188
%  kept new demods:   0
%  forw unit-subs:    28695
%  forw double-subs: 174764
%  forw overdouble-subs: 10718
%  backward subs:     19
%  fast unit cutoff:  129
%  full unit cutoff:  0
%  dbl  unit cutoff:  96
%  real runtime  :  29.18
%  process. runtime:  28.64
% specific non-discr-tree subsumption statistics: 
%  tried:           53529
%  length fails:    0
%  strength fails:  197
%  predlist fails:  32112
%  aux str. fails:  0
%  by-lit fails:    172
%  full subs tried: 6765
%  full subs fail:  5374
% 
% ; 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/FLD059-2+noeq.in")
% 
%------------------------------------------------------------------------------