%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD064-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/FLD064-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,0,60,0,0)
% 
% 
% START OF PROOF
% 32 [] equalish(add(additive_identity,X),X) | -defined(X).
% 33 [] equalish(add(X,additive_inverse(X)),additive_identity) | -defined(X).
% 41 [] defined(additive_identity).
% 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).
% 56 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 58 [] defined(a).
% 59 [] less_or_equal(additive_identity,a).
% 60 [] -less_or_equal(additive_inverse(a),additive_identity).
% 72 [hyper:33,58] equalish(add(a,additive_inverse(a)),additive_identity).
% 104 [hyper:42,58] defined(additive_inverse(a)).
% 209 [hyper:48,41,41] less_or_equal(additive_identity,additive_identity).
% 378 [hyper:32,104] equalish(add(additive_identity,additive_inverse(a)),additive_inverse(a)).
% 495 [hyper:49,59,104] less_or_equal(add(additive_identity,additive_inverse(a)),add(a,additive_inverse(a))).
% 4963 [hyper:52,72] equalish(additive_identity,add(a,additive_inverse(a))).
% 6264 [hyper:56,4963,209] less_or_equal(add(a,additive_inverse(a)),additive_identity).
% 469698 [hyper:47,495,6264] less_or_equal(add(additive_identity,additive_inverse(a)),additive_identity).
% 472949 [hyper:56,469698,378,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:    902
%  derived clauses:   835876
%  kept clauses:      77033
%  kept size sum:     0
%  kept mid-nuclei:   5706
%  kept new demods:   0
%  forw unit-subs:    12830
%  forw double-subs: 190467
%  forw overdouble-subs: 12329
%  backward subs:     16
%  fast unit cutoff:  16
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  18.84
%  process. runtime:  18.82
% specific non-discr-tree subsumption statistics: 
%  tried:           50492
%  length fails:    0
%  strength fails:  302
%  predlist fails:  25546
%  aux str. fails:  4
%  by-lit fails:    274
%  full subs tried: 2276
%  full subs fail:  2276
% 
% ; 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/FLD064-1+noeq.in")
% 
%------------------------------------------------------------------------------