%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : FLD070-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 : art06.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/FLD070-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(34,40,2,68,0,2,665152,4,2031,665176,50,2059,665176,40,2059,665210,0,2059,705407,3,2560,712684,4,2810)
% 
% 
% START OF PROOF
% 665178 [] equalish(add(additive_identity,X),X) | -defined(X).
% 665193 [] -less_or_equal(Z,X) | -less_or_equal(X,Y) | less_or_equal(Z,Y).
% 665194 [] less_or_equal(X,Y) | less_or_equal(Y,X) | -defined(X) | -defined(Y).
% 665195 [] less_or_equal(add(X,Y),add(Z,Y)) | -less_or_equal(X,Z) | -defined(Y).
% 665198 [] -equalish(X,Y) | equalish(Y,X).
% 665202 [] -less_or_equal(X,Y) | -equalish(X,Z) | less_or_equal(Z,Y).
% 665205 [] defined(b).
% 665206 [] defined(c).
% 665207 [] equalish(add(a,b),c).
% 665208 [] less_or_equal(additive_identity,a).
% 665209 [] less_or_equal(additive_identity,b).
% 665210 [] -less_or_equal(additive_identity,c).
% 665228 [input:665194,factor] less_or_equal(X,X) | -defined(X).
% 665268 [binary:665205,665178.2] equalish(add(additive_identity,b),b).
% 665323 [binary:665206,665228.2] less_or_equal(c,c).
% 665427 [binary:665207,665198] equalish(c,add(a,b)).
% 665496 [binary:665209,665193] -less_or_equal(b,X) | less_or_equal(additive_identity,X).
% 665498 [binary:665210,665193.3] -less_or_equal(X,c) | -less_or_equal(additive_identity,X).
% 665566 [binary:665205,665195.3] less_or_equal(add(X,b),add(Y,b)) | -less_or_equal(X,Y).
% 665968 [binary:665323,665202] -equalish(c,X) | less_or_equal(X,c).
% 665976 [binary:665268,665202.2] -less_or_equal(add(additive_identity,b),X) | less_or_equal(b,X).
% 670258 [binary:665427,665968] less_or_equal(add(a,b),c).
% 670278 [binary:665498,670258] -less_or_equal(additive_identity,add(a,b)).
% 670308 [binary:665496.2,670278] -less_or_equal(b,add(a,b)).
% 691443 [binary:665208,665566.2] less_or_equal(add(additive_identity,b),add(a,b)).
% 730920 [binary:691443,665976,cut:670308] 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:    2925
%  derived clauses:   1495267
%  kept clauses:      124225
%  kept size sum:     686079
%  kept mid-nuclei:   25276
%  kept new demods:   0
%  forw unit-subs:    43221
%  forw double-subs: 137138
%  forw overdouble-subs: 9125
%  backward subs:     15
%  fast unit cutoff:  787
%  full unit cutoff:  0
%  dbl  unit cutoff:  28
%  real runtime  :  28.90
%  process. runtime:  28.89
% specific non-discr-tree subsumption statistics: 
%  tried:           52971
%  length fails:    0
%  strength fails:  201
%  predlist fails:  35742
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 6575
%  full subs fail:  5206
% 
% ; 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/FLD070-2+noeq.in")
% 
%------------------------------------------------------------------------------