%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG038-1 : 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 : art03.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/RNG038-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 2 9)
% (binary-posweight-order 29 #f 2 9)
% (binary-unit 29 #f 2 9)
% (binary-double 29 #f 2 9)
% (binary 29 #t 2 9)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(22,40,0,44,0,0)
%
%
% START OF PROOF
% 23 [] equal(X,X).
% 24 [] sum(additive_identity,X,X).
% 25 [] sum(X,additive_identity,X).
% 29 [] sum(X,additive_inverse(X),additive_identity).
% 30 [] -sum(X,Y,Z) | -sum(U,V,X) | -sum(V,Y,W) | sum(U,W,Z).
% 37 [] -product(X,Y,Z) | -product(U,Y,V) | -product(W,Y,X1) | -sum(U,W,X) | sum(V,X1,Z).
% 39 [] -sum(X,Y,Z) | -sum(X,Y,U) | equal(U,Z).
% 41 [] product(X,h(X,Y),Y) | -equal(X,additive_identity).
% 44 [] -equal(b,additive_identity).
% 45 [hyper:41,23] product(additive_identity,h(additive_identity,X),X).
% 254 [hyper:37,45,45,45,cut:24] sum(X,X,X).
% 481 [hyper:30,254,29,29] sum(X,additive_identity,additive_identity).
% 630 [hyper:30,481,24,24] sum(X,Y,Y).
% 633 [hyper:30,481,slowcut:630,slowcut:25] sum(X,additive_identity,Y).
% 675 [hyper:39,481,cut:633,slowcut:44] 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: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 14
% derived clauses: 1235
% kept clauses: 47
% kept size sum: 296
% kept mid-nuclei: 570
% kept new demods: 2
% forw unit-subs: 376
% forw double-subs: 5
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 4
% full unit cutoff: 11
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 484
% length fails: 0
% strength fails: 151
% predlist fails: 299
% aux str. fails: 31
% by-lit fails: 0
% full subs tried: 3
% full subs fail: 3
%
% ; 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/RNG038-1+eq_r.in")
%
%------------------------------------------------------------------------------