%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG005-2 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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/RNG/RNG005-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 2 9)
% (binary-unit 28 #f 2 9)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 2 9)
% (binary 28 #t 2 9)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(31,40,1,62,0,1)
%
%
% START OF PROOF
% 45 [] sum(additive_inverse(X),X,additive_identity).
% 54 [] -product(X,Y,Z) | -product(U,Y,V) | -product(W,Y,X1) | -sum(U,W,X) | sum(V,X1,Z).
% 58 [] product(additive_identity,X,additive_identity).
% 60 [] product(a,b,d).
% 61 [] product(additive_inverse(a),b,c).
% 62 [] -sum(c,d,additive_identity).
% 638 [hyper:54,61,45,60,58,cut:62] 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: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11
% derived clauses: 889
% kept clauses: 12
% kept size sum: 58
% kept mid-nuclei: 533
% kept new demods: 0
% forw unit-subs: 279
% forw double-subs: 1
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 30
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 392
% length fails: 0
% strength fails: 213
% predlist fails: 165
% aux str. fails: 14
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/RNG/RNG005-2+noeq.in")
%
%------------------------------------------------------------------------------