%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD068-4 : 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 0.0s
% Output : Assurance 0.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/FLD068-4+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 2 9)
% (binary-unit 10 #f 2 9)
% (binary-double 16 #f 2 9)
% (binary 54 #t 2 9)
% (binary-order 27 #f 2 9)
% (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,0,64,0,1)
%
%
% START OF PROOF
% 34 [] -sum(Y,U,V) | -sum(X,V,W) | -sum(X,Y,Z) | sum(Z,U,W).
% 35 [] sum(additive_identity,X,X) | -defined(X).
% 36 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 37 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 56 [] -sum(X,Y,Z) | -sum(U,Y,V) | -less_or_equal(X,U) | less_or_equal(Z,V).
% 59 [] defined(a).
% 60 [] defined(b).
% 62 [] sum(b,additive_inverse(a),u).
% 63 [] less_or_equal(additive_identity,u).
% 64 [] -less_or_equal(a,b).
% 65 [hyper:35,59] sum(additive_identity,a,a).
% 66 [hyper:36,59] sum(additive_inverse(a),a,additive_identity).
% 86 [hyper:35,60] sum(additive_identity,b,b).
% 774 [hyper:37,86] sum(b,additive_identity,b).
% 3483 [hyper:34,66,62,774] sum(u,a,b).
% 3569 [hyper:56,3483,65,cut:63] less_or_equal(a,b).
% 3617 [hyper:64,3569] 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 9
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 111
% derived clauses: 8722
% kept clauses: 2080
% kept size sum: 24948
% kept mid-nuclei: 1454
% kept new demods: 0
% forw unit-subs: 544
% forw double-subs: 1808
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.13
% process. runtime: 0.12
% specific non-discr-tree subsumption statistics:
% tried: 1143
% length fails: 0
% strength fails: 798
% predlist fails: 206
% aux str. fails: 28
% by-lit fails: 0
% full subs tried: 111
% full subs fail: 111
%
% ; 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/FLD068-4+noeq.in")
%
%------------------------------------------------------------------------------