%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG019-7 : 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 268.7s
% Output : Assurance 268.7s
% 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/RNG019-7+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 5 1)
% (binary-posweight-lex-big-order 30 #f 5 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(24,40,0,48,0,0,36389,3,3007,43737,4,4506,46613,5,6001,46613,1,6001,46613,50,6004,46613,40,6004,46637,0,6004,49880,3,7505,51106,4,8255,51402,5,9005,51402,1,9005,51402,50,9005,51402,40,9005,51426,0,9005,51429,50,9005,51429,40,9005,51453,0,9018,509699,3,18021,731237,4,22520,1064697,5,27019,1064697,1,27019,1064697,50,27025,1064697,40,27025,1064721,0,27025)
%
%
% START OF PROOF
% 1064706 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 1064708 [] equal(add(X,Y),add(Y,X)).
% 1064709 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 1064715 [] equal(multiply(additive_inverse(X),Y),additive_inverse(multiply(X,Y))).
% 1064721 [] -equal(add(multiply(multiply(x,y),u),add(multiply(multiply(x,y),v),additive_inverse(add(multiply(x,multiply(y,u)),multiply(x,multiply(y,v)))))),add(multiply(multiply(x,y),u),add(multiply(additive_inverse(x),multiply(y,u)),add(multiply(multiply(x,y),v),multiply(additive_inverse(x),multiply(y,v)))))).
% 1064723 [para:1064708.1.1,1064721.1.1,demod:1064709] -equal(add(multiply(multiply(x,y),v),add(additive_inverse(add(multiply(x,multiply(y,u)),multiply(x,multiply(y,v)))),multiply(multiply(x,y),u))),add(multiply(multiply(x,y),u),add(multiply(additive_inverse(x),multiply(y,u)),add(multiply(multiply(x,y),v),multiply(additive_inverse(x),multiply(y,v)))))).
% 1064734 [para:1064706.1.1,1064715.1.2.1,demod:1064706] equal(add(multiply(additive_inverse(X),Y),multiply(additive_inverse(X),Z)),additive_inverse(add(multiply(X,Y),multiply(X,Z)))).
% 1064769 [para:1064708.1.1,1064723.1.2,demod:1064709,1064734] -equal(add(multiply(multiply(x,y),v),add(multiply(additive_inverse(x),multiply(y,u)),add(multiply(additive_inverse(x),multiply(y,v)),multiply(multiply(x,y),u)))),add(multiply(additive_inverse(x),multiply(y,u)),add(multiply(multiply(x,y),v),add(multiply(additive_inverse(x),multiply(y,v)),multiply(multiply(x,y),u))))).
% 1064780 [para:1064708.1.1,1064709.1.2.1,demod:1064709,slowcut:1064769] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 120
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4410
% derived clauses: 6911199
% kept clauses: 127329
% kept size sum: 1400
% kept mid-nuclei: 0
% kept new demods: 69517
% forw unit-subs: 3671055
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 454
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 271.85
% process. runtime: 270.25
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% 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/RNG019-7+eq_r.in")
%
%------------------------------------------------------------------------------