%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD067-3 : 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 : art02.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/FLD067-3+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 9)
% (binary-unit 10 #f 3 9)
% (binary-double 16 #f 3 9)
% (binary 54 #t 3 9)
% (binary-order 27 #f 3 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(30,40,1,60,0,1,565362,4,2047)
%
%
% START OF PROOF
% 34 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 35 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 45 [] defined(additive_inverse(X)) | -defined(X).
% 49 [] sum(X,Y,add(X,Y)) | -defined(X) | -defined(Y).
% 54 [] -sum(X,Y,Z) | -sum(U,Y,V) | -less_or_equal(X,U) | less_or_equal(Z,V).
% 57 [] defined(a).
% 58 [] defined(b).
% 59 [] less_or_equal(a,b).
% 60 [] -less_or_equal(additive_identity,add(b,additive_inverse(a))).
% 62 [hyper:34,57] sum(additive_inverse(a),a,additive_identity).
% 68 [hyper:45,57] defined(additive_inverse(a)).
% 232 [hyper:49,68,58] sum(b,additive_inverse(a),add(b,additive_inverse(a))).
% 8735 [hyper:35,62] sum(a,additive_inverse(a),additive_identity).
% 63916 [hyper:54,232,8735,cut:59] less_or_equal(additive_identity,add(b,additive_inverse(a))).
% 565379 [binary:63916,60] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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 3
% seconds given: 27
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 856
% derived clauses: 820259
% kept clauses: 77276
% kept size sum: 0
% kept mid-nuclei: 59096
% kept new demods: 0
% forw unit-subs: 24564
% forw double-subs: 194253
% forw overdouble-subs: 8773
% backward subs: 5
% fast unit cutoff: 1425
% full unit cutoff: 0
% dbl unit cutoff: 26
% real runtime : 20.75
% process. runtime: 20.72
% specific non-discr-tree subsumption statistics:
% tried: 132332
% length fails: 1321
% strength fails: 645
% predlist fails: 61985
% aux str. fails: 908
% by-lit fails: 35122
% full subs tried: 4687
% full subs fail: 4687
%
% ; 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/FLD067-3+noeq.in")
%
%------------------------------------------------------------------------------