%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD069-1 : 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 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/FLD069-1+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(33,40,1,66,0,1,655463,4,2030,655737,50,2065,655737,40,2065,655770,0,2065,704707,3,2566,712198,4,2816)
% 
% 
% START OF PROOF
% 655739 [] equalish(add(additive_identity,X),X) | -defined(X).
% 655753 [] -less_or_equal(Y,X) | -less_or_equal(X,Y) | equalish(Y,X).
% 655756 [] less_or_equal(add(X,Y),add(Z,Y)) | -less_or_equal(X,Z) | -defined(Y).
% 655759 [] -equalish(X,Y) | equalish(Y,X).
% 655760 [] -equalish(Z,X) | -equalish(X,Y) | equalish(Z,Y).
% 655763 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 655766 [] defined(b).
% 655767 [] less_or_equal(additive_identity,a).
% 655768 [] less_or_equal(additive_identity,b).
% 655769 [] -equalish(b,additive_identity).
% 655770 [] equalish(add(a,b),additive_identity).
% 655836 [binary:655766,655739.2] equalish(add(additive_identity,b),b).
% 655907 [binary:655770,655759] equalish(additive_identity,add(a,b)).
% 656217 [binary:655766,655756.3] less_or_equal(add(X,b),add(Y,b)) | -less_or_equal(X,Y).
% 656302 [binary:655769,655760.3] -equalish(X,additive_identity) | -equalish(b,X).
% 656610 [binary:655768,655763] -equalish(additive_identity,X) | less_or_equal(X,b).
% 656621 [binary:655836,655763.2] -less_or_equal(add(additive_identity,b),X) | less_or_equal(b,X).
% 658226 [binary:655770,656302] -equalish(b,add(a,b)).
% 658233 [binary:655759.2,658226] -equalish(add(a,b),b).
% 658384 [binary:655907,656610] less_or_equal(add(a,b),b).
% 658387 [binary:655753,658384,cut:658233] -less_or_equal(b,add(a,b)).
% 701339 [binary:655767,656217.2] less_or_equal(add(additive_identity,b),add(a,b)).
% 722483 [binary:701339,656621,cut:658387] 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:    2895
%  derived clauses:   1470242
%  kept clauses:      133161
%  kept size sum:     953142
%  kept mid-nuclei:   16317
%  kept new demods:   0
%  forw unit-subs:    29444
%  forw double-subs: 173526
%  forw overdouble-subs: 12469
%  backward subs:     4
%  fast unit cutoff:  131
%  full unit cutoff:  0
%  dbl  unit cutoff:  96
%  real runtime  :  28.59
%  process. runtime:  28.57
% specific non-discr-tree subsumption statistics: 
%  tried:           60722
%  length fails:    0
%  strength fails:  181
%  predlist fails:  37040
%  aux str. fails:  0
%  by-lit fails:    214
%  full subs tried: 6899
%  full subs fail:  5463
% 
% ; 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/FLD069-1+noeq.in")
% 
%------------------------------------------------------------------------------