%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG039-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 : 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/RNG/RNG039-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(74,40,1,148,0,1)
%
%
% START OF PROOF
% 77 [] -sum(X,Y,Z) | sum(U,Y,Z) | -equalish(X,U).
% 78 [] -sum(X,Y,Z) | sum(X,U,Z) | -equalish(Y,U).
% 79 [] -sum(X,Y,Z) | sum(X,Y,U) | -equalish(Z,U).
% 87 [] sum(additive_identity,X,X).
% 88 [] sum(X,additive_identity,X).
% 89 [] product(X,Y,multiply(X,Y)).
% 94 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 95 [] -product(U,Z,V) | -product(U,X,W) | -product(X,Y,Z) | product(W,Y,V).
% 96 [] -product(X,U,V) | -product(X,W,X1) | -product(X,Y,Z) | -sum(W,Y,U) | sum(X1,Z,V).
% 97 [] -product(X,Y,Z) | -product(X,U,V) | -sum(Z,V,X1) | -sum(Y,U,W) | product(X,W,X1).
% 100 [] product(additive_identity,X,additive_identity).
% 101 [] product(X,additive_identity,additive_identity).
% 103 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 108 [] sum(X,X,additive_identity).
% 111 [] equalish(multiply(X,X),X).
% 120 [] product(a,multiply(b,X),multiply(Y,X)).
% 148 [] -equalish(c,d).
% 1951 [hyper:79,111,88] sum(multiply(X,X),additive_identity,X).
% 2103 [hyper:94,89,100,101] product(X,multiply(additive_identity,Y),additive_identity).
% 2187 [hyper:95,89,101,100] product(multiply(X,additive_identity),Y,additive_identity).
% 3638 [hyper:103,89,100] equalish(additive_identity,multiply(additive_identity,X)).
% 3639 [hyper:103,89,101] equalish(additive_identity,multiply(X,additive_identity)).
% 3679 [hyper:77,3638,87] sum(multiply(additive_identity,X),Y,Y).
% 3698 [hyper:78,3639,88] sum(X,multiply(Y,additive_identity),X).
% 3700 [hyper:79,3639,108] sum(X,X,multiply(Y,additive_identity)).
% 10696 [hyper:78,1951,3638] sum(multiply(X,X),multiply(additive_identity,Y),X).
% 121142 [hyper:97,120,3700,120,slowcut:10696] product(a,multiply(X,additive_identity),Y).
% 121148 [hyper:97,120,3698,3679,cut:121142] product(a,multiply(b,X),Y).
% 121186 [hyper:97,120,108,120,slowcut:10696] product(a,additive_identity,X).
% 121803 [hyper:95,120,2187,cut:121186] product(multiply(X,additive_identity),Y,Z).
% 121810 [hyper:95,120,2103,slowcut:121803] product(X,multiply(b,Y),additive_identity).
% 121819 [hyper:96,120,88,cut:121148,cut:121186] sum(multiply(X,Y),Z,U).
% 121823 [hyper:97,120,cut:121819,cut:121819,slowcut:121810] product(a,X,Y).
% 121837 [hyper:103,121823,cut:121823,slowcut:148] 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: 112
% derived clauses: 667270
% kept clauses: 1860
% kept size sum: 14765
% kept mid-nuclei: 118899
% kept new demods: 0
% forw unit-subs: 394872
% forw double-subs: 29
% forw overdouble-subs: 0
% backward subs: 95
% fast unit cutoff: 130
% full unit cutoff: 904
% dbl unit cutoff: 0
% real runtime : 6.50
% process. runtime: 6.50
% specific non-discr-tree subsumption statistics:
% tried: 19385
% length fails: 0
% strength fails: 2733
% predlist fails: 15675
% aux str. fails: 750
% by-lit fails: 0
% full subs tried: 227
% full subs fail: 227
%
% ; 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/RNG039-2+noeq.in")
%
%------------------------------------------------------------------------------