%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP597-1 : TPTP v3.4.2. Released v2.6.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/GRP/GRP597-1+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 7 1)
% (binary-posweight-lex-big-order 30 #f 7 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(4,40,0,8,0,0)
%
%
% START OF PROOF
% 6 [] equal(double_divide(double_divide(X,Y),inverse(double_divide(X,inverse(double_divide(inverse(Z),Y))))),Z).
% 7 [] equal(multiply(X,Y),inverse(double_divide(Y,X))).
% 8 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 9 [para:6.1.1,7.1.2.1,demod:7] equal(multiply(multiply(multiply(X,inverse(Y)),Z),double_divide(Z,X)),inverse(Y)).
% 10 [para:7.1.2,6.1.1.2,demod:7] equal(double_divide(double_divide(X,Y),multiply(multiply(Y,inverse(Z)),X)),Z).
% 12 [para:6.1.1,6.1.1.1,demod:7] equal(double_divide(X,multiply(multiply(multiply(multiply(Y,inverse(X)),Z),inverse(U)),double_divide(Z,Y))),U).
% 13 [para:6.1.1,6.1.1.2.1,demod:7] equal(double_divide(double_divide(double_divide(inverse(X),Y),multiply(Y,inverse(Z))),inverse(Z)),X).
% 15 [para:6.1.1,9.1.1.2,demod:7] equal(multiply(multiply(multiply(multiply(multiply(X,inverse(Y)),Z),inverse(U)),double_divide(Z,X)),Y),inverse(U)).
% 16 [para:9.1.1,9.1.1.1] equal(multiply(inverse(X),double_divide(double_divide(inverse(Y),Z),multiply(Z,inverse(X)))),inverse(Y)).
% 46 [para:15.1.1,12.1.1.2.1,demod:10] equal(double_divide(X,multiply(inverse(X),inverse(Y))),Y).
% 47 [para:15.1.1,15.1.1.1.1,demod:10] equal(multiply(multiply(inverse(X),inverse(Y)),X),inverse(Y)).
% 48 [para:7.1.2,46.1.1.2.1] equal(double_divide(double_divide(X,Y),multiply(multiply(Y,X),inverse(Z))),Z).
% 63 [para:47.1.1,10.1.1.2] equal(double_divide(double_divide(X,inverse(X)),inverse(Y)),Y).
% 79 [para:7.1.2,63.1.1.2] equal(double_divide(double_divide(X,inverse(X)),multiply(Y,Z)),double_divide(Z,Y)).
% 92 [para:47.1.1,48.1.1.2] equal(double_divide(double_divide(inverse(X),inverse(inverse(Y))),inverse(X)),Y).
% 137 [para:79.1.1,46.1.1,demod:7] equal(double_divide(inverse(X),multiply(inverse(Y),Y)),X).
% 142 [para:137.1.1,6.1.1.1,demod:7,137] equal(double_divide(X,multiply(inverse(Y),inverse(X))),Y).
% 169 [para:142.1.1,137.1.1] equal(inverse(inverse(X)),X).
% 192 [para:169.1.1,47.1.1.1.2,demod:169] equal(multiply(multiply(inverse(X),Y),X),Y).
% 198 [para:169.1.1,92.1.1.1.1,demod:169] equal(double_divide(double_divide(X,Y),X),Y).
% 215 [para:6.1.1,198.1.1.1,demod:7] equal(double_divide(X,double_divide(Y,Z)),multiply(multiply(Z,inverse(X)),Y)).
% 216 [para:198.1.1,10.1.1.1,demod:198,215] equal(double_divide(X,double_divide(Y,X)),Y).
% 225 [para:46.1.1,198.1.1.1] equal(double_divide(X,Y),multiply(inverse(Y),inverse(X))).
% 234 [para:142.1.1,198.1.1.1,demod:225] equal(double_divide(X,Y),double_divide(Y,X)).
% 237 [para:13.1.1,216.1.1.2] equal(double_divide(inverse(X),Y),double_divide(double_divide(inverse(Y),Z),multiply(Z,inverse(X)))).
% 254 [para:142.1.1,216.1.1.2,demod:225] equal(double_divide(double_divide(X,Y),Y),X).
% 255 [para:234.1.1,7.1.2.1,demod:7] equal(multiply(X,Y),multiply(Y,X)).
% 295 [para:254.1.1,7.1.2.1] equal(multiply(X,double_divide(Y,X)),inverse(Y)).
% 302 [para:255.1.1,8.1.1] -equal(multiply(a1,inverse(a1)),multiply(inverse(b1),b1)).
% 387 [para:16.1.1,192.1.1.1,demod:237] equal(multiply(inverse(X),Y),double_divide(inverse(Y),X)).
% 402 [para:255.1.1,302.1.1,demod:387] -equal(double_divide(inverse(a1),a1),double_divide(inverse(b1),b1)).
% 471 [para:63.1.1,295.1.1.2,demod:7,387,slowcut:402] 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 kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 7
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 49
% derived clauses: 1975
% kept clauses: 461
% kept size sum: 7154
% kept mid-nuclei: 0
% kept new demods: 443
% forw unit-subs: 1372
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.6
% process. runtime: 0.4
% 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/GRP/GRP597-1+eq_r.in")
%
%------------------------------------------------------------------------------