%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD061-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 : art01.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/FLD061-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 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(33,40,0,66,0,0,263251,4,2027)
%
%
% START OF PROOF
% 38 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 52 [] sum(X,Y,add(X,Y)) | -defined(X) | -defined(Y).
% 55 [] -less_or_equal(Z,X) | -less_or_equal(X,Y) | less_or_equal(Z,Y).
% 57 [] -sum(X,Y,Z) | -sum(U,Y,V) | -less_or_equal(X,U) | less_or_equal(Z,V).
% 60 [] defined(a).
% 61 [] defined(b).
% 62 [] defined(c).
% 63 [] defined(d).
% 64 [] less_or_equal(a,b).
% 65 [] less_or_equal(c,d).
% 66 [] -less_or_equal(add(a,c),add(d,b)).
% 142 [hyper:52,62,60] sum(a,c,add(a,c)).
% 181 [hyper:52,63,60] sum(d,a,add(d,a)).
% 182 [hyper:52,63,61] sum(d,b,add(d,b)).
% 19244 [hyper:38,142] sum(c,a,add(a,c)).
% 21665 [hyper:38,181] sum(a,d,add(d,a)).
% 21893 [hyper:38,182] sum(b,d,add(d,b)).
% 75079 [hyper:57,19244,181,cut:65] less_or_equal(add(a,c),add(d,a)).
% 79250 [hyper:57,21893,21665,cut:64] less_or_equal(add(d,a),add(d,b)).
% 265144 [binary:55.3,66] -less_or_equal(X,add(d,b)) | -less_or_equal(add(a,c),X).
% 265145 [binary:79250,265144,cut:75079] 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 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 894
% derived clauses: 502116
% kept clauses: 41189
% kept size sum: 471849
% kept mid-nuclei: 223704
% kept new demods: 0
% forw unit-subs: 128046
% forw double-subs: 75442
% forw overdouble-subs: 13407
% backward subs: 3
% fast unit cutoff: 1752
% full unit cutoff: 0
% dbl unit cutoff: 17
% real runtime : 20.52
% process. runtime: 20.51
% specific non-discr-tree subsumption statistics:
% tried: 94295
% length fails: 4005
% strength fails: 2742
% predlist fails: 56877
% aux str. fails: 8150
% by-lit fails: 246
% full subs tried: 1309
% full subs fail: 1295
%
% ; 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/FLD061-3+noeq.in")
%
%------------------------------------------------------------------------------