%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG025-6 : 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 : 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 268.8s
% Output : Assurance 268.8s
% 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/RNG025-6+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(17,40,1,34,0,1,36034,3,3012,42130,4,4504,46092,5,6002,46092,1,6002,46092,50,6005,46092,40,6005,46109,0,6005,49070,3,7507,50110,4,8263,50278,5,9006,50278,1,9006,50278,50,9006,50278,40,9006,50295,0,9006,50295,50,9006,50295,40,9006,50312,0,9019,387184,3,19730,541861,4,22526,660078,5,27020,660078,1,27020,660078,50,27025,660078,40,27025,660095,0,27025)
%
%
% START OF PROOF
% 660079 [] equal(X,X).
% 660080 [] equal(add(additive_identity,X),X).
% 660081 [] equal(add(X,additive_identity),X).
% 660082 [] equal(multiply(additive_identity,X),additive_identity).
% 660083 [] equal(multiply(X,additive_identity),additive_identity).
% 660084 [] equal(add(additive_inverse(X),X),additive_identity).
% 660085 [] equal(add(X,additive_inverse(X)),additive_identity).
% 660087 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 660088 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 660089 [] equal(add(X,Y),add(Y,X)).
% 660090 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 660091 [] equal(multiply(multiply(X,Y),Y),multiply(X,multiply(Y,Y))).
% 660092 [] equal(multiply(multiply(X,X),Y),multiply(X,multiply(X,Y))).
% 660095 [] -equal(add(multiply(multiply(x,y),x),additive_inverse(multiply(x,multiply(y,x)))),additive_identity).
% 660097 [para:660089.1.1,660095.1.1] -equal(add(additive_inverse(multiply(x,multiply(y,x))),multiply(multiply(x,y),x)),additive_identity).
% 660098 [para:660084.1.1,660087.1.1.2,demod:660083] equal(additive_identity,add(multiply(X,additive_inverse(Y)),multiply(X,Y))).
% 660099 [para:660085.1.1,660087.1.1.2,demod:660083] equal(additive_identity,add(multiply(X,Y),multiply(X,additive_inverse(Y)))).
% 660101 [para:660087.1.1,660098.1.2.2] equal(additive_identity,add(multiply(X,additive_inverse(add(Y,Z))),add(multiply(X,Y),multiply(X,Z)))).
% 660104 [para:660084.1.1,660090.1.2.1,demod:660080] equal(add(additive_inverse(X),add(X,Y)),Y).
% 660109 [para:660089.1.1,660090.1.2.1,demod:660090] equal(add(X,add(Y,Z)),add(Y,add(X,Z))).
% 660113 [para:660089.1.1,660104.1.1.2] equal(add(additive_inverse(X),add(Y,X)),Y).
% 660114 [para:660098.1.2,660104.1.1.2,demod:660081] equal(additive_inverse(multiply(X,additive_inverse(Y))),multiply(X,Y)).
% 660115 [para:660099.1.2,660104.1.1.2,demod:660081] equal(additive_inverse(multiply(X,Y)),multiply(X,additive_inverse(Y))).
% 660118 [para:660084.1.1,660088.1.1.1,demod:660082] equal(additive_identity,add(multiply(additive_inverse(X),Y),multiply(X,Y))).
% 660136 [para:660104.1.1,660113.1.1.2] equal(add(additive_inverse(add(X,Y)),Y),additive_inverse(X)).
% 660146 [para:660115.1.1,660097.1.1.1,demod:660115] -equal(add(multiply(x,multiply(y,additive_inverse(x))),multiply(multiply(x,y),x)),additive_identity).
% 660154 [para:660091.1.1,660114.1.1.1,demod:660114,660115] equal(multiply(X,multiply(additive_inverse(Y),Y)),multiply(multiply(X,additive_inverse(Y)),Y)).
% 660163 [para:660136.1.1,660113.1.1.2] equal(add(additive_inverse(X),additive_inverse(Y)),additive_inverse(add(Y,X))).
% 660170 [para:660118.1.2,660090.1.2.1,demod:660080] equal(add(multiply(additive_inverse(X),Y),add(multiply(X,Y),Z)),Z).
% 660171 [para:660118.1.2,660104.1.1.2,demod:660081,660115] equal(multiply(additive_inverse(X),additive_inverse(Y)),multiply(X,Y)).
% 660177 [para:660114.1.1,660171.1.1.2] equal(multiply(additive_inverse(X),multiply(Y,Z)),multiply(X,multiply(Y,additive_inverse(Z)))).
% 660243 [para:660091.1.1,660101.1.2.1,demod:660154,660090,660171,660087,660088,660163] equal(additive_identity,add(multiply(X,multiply(Y,Y)),add(multiply(X,multiply(Y,Z)),add(multiply(X,multiply(Z,Y)),add(multiply(X,multiply(Z,Z)),add(multiply(multiply(X,additive_inverse(Y)),Z),add(multiply(X,multiply(additive_inverse(Z),Z)),add(multiply(X,multiply(additive_inverse(Y),Y)),multiply(multiply(X,additive_inverse(Z)),Y))))))))).
% 660305 [para:660170.1.1,660109.1.1.2] equal(add(X,Y),add(multiply(additive_inverse(Z),U),add(X,add(multiply(Z,U),Y)))).
% 660377 [para:660171.1.1,660177.1.2.2] equal(multiply(additive_inverse(X),multiply(additive_inverse(Y),Z)),multiply(X,multiply(Y,Z))).
% 660378 [para:660177.1.2,660146.1.1.1] -equal(add(multiply(additive_inverse(x),multiply(y,x)),multiply(multiply(x,y),x)),additive_identity).
% 666795 [para:660092.1.1,660243.1.2.2.2.2.2.1,demod:660305,660171,660377] equal(additive_identity,add(multiply(additive_inverse(X),multiply(Y,X)),multiply(multiply(X,Y),X))).
% 667064 [para:666795.1.2,660378.1.1,cut:660079] 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: 4235
% derived clauses: 5994297
% kept clauses: 134209
% kept size sum: 273898
% kept mid-nuclei: 0
% kept new demods: 69165
% forw unit-subs: 3230277
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 256
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 275.50
% process. runtime: 274.3
% 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/RNG025-6+eq_r.in")
%
%------------------------------------------------------------------------------