%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD065-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 : art05.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 10.0s
% Output   : Assurance 10.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/FLD065-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(30,40,2,60,0,2)
% 
% 
% START OF PROOF
% 32 [] equalish(add(additive_identity,X),X) | -defined(X).
% 33 [] equalish(add(X,additive_inverse(X)),additive_identity) | -defined(X).
% 34 [] equalish(add(X,Y),add(Y,X)) | -defined(X) | -defined(Y).
% 42 [] defined(additive_inverse(X)) | -defined(X).
% 47 [] -less_or_equal(Z,X) | -less_or_equal(X,Y) | less_or_equal(Z,Y).
% 48 [] less_or_equal(X,Y) | less_or_equal(Y,X) | -defined(X) | -defined(Y).
% 49 [] less_or_equal(add(X,Y),add(Z,Y)) | -less_or_equal(X,Z) | -defined(Y).
% 52 [] -equalish(X,Y) | equalish(Y,X).
% 53 [] -equalish(Z,X) | -equalish(X,Y) | equalish(Z,Y).
% 56 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 58 [] defined(a).
% 59 [] less_or_equal(additive_inverse(a),additive_identity).
% 60 [] -less_or_equal(additive_identity,a).
% 71 [hyper:32,58] equalish(add(additive_identity,a),a).
% 72 [hyper:33,58] equalish(add(a,additive_inverse(a)),additive_identity).
% 104 [hyper:42,58] defined(additive_inverse(a)).
% 110 [hyper:48,58,58] less_or_equal(a,a).
% 381 [hyper:34,104,58] equalish(add(additive_inverse(a),a),add(a,additive_inverse(a))).
% 492 [hyper:49,59,58] less_or_equal(add(additive_inverse(a),a),add(additive_identity,a)).
% 1720 [hyper:52,71] equalish(a,add(additive_identity,a)).
% 4137 [hyper:56,1720,110] less_or_equal(add(additive_identity,a),a).
% 171987 [hyper:53,381,72] equalish(add(additive_inverse(a),a),additive_identity).
% 481419 [hyper:56,492,171987] less_or_equal(additive_identity,add(additive_identity,a)).
% 481429 [hyper:47,481419,4137,cut:60] 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 7
% clause depth limited to 3
% seconds given: 27
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    864
%  derived clauses:   791675
%  kept clauses:      77052
%  kept size sum:     0
%  kept mid-nuclei:   4891
%  kept new demods:   0
%  forw unit-subs:    9683
%  forw double-subs: 208744
%  forw overdouble-subs: 2784
%  backward subs:     18
%  fast unit cutoff:  17
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  17.98
%  process. runtime:  17.97
% specific non-discr-tree subsumption statistics: 
%  tried:           11739
%  length fails:    0
%  strength fails:  64
%  predlist fails:  5398
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 2318
%  full subs fail:  2318
% 
% ; 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/FLD065-1+noeq.in")
% 
%------------------------------------------------------------------------------