%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP608-1 : TPTP v3.4.2. Bugfixed v2.7.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.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/GRP608-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(inverse(double_divide(X,inverse(double_divide(inverse(Y),double_divide(X,Z))))),Z),Y).
% 7 [] equal(multiply(X,Y),inverse(double_divide(Y,X))).
% 8 [] -equal(multiply(a,b),multiply(b,a)).
% 9 [para:6.1.1,7.1.2.1,demod:7] equal(multiply(X,multiply(multiply(double_divide(Y,X),inverse(Z)),Y)),inverse(Z)).
% 10 [para:7.1.2,6.1.1.1,demod:7] equal(double_divide(multiply(multiply(double_divide(X,Y),inverse(Z)),X),Y),Z).
% 12 [para:6.1.1,6.1.1.1.1.2.1,demod:7] equal(double_divide(multiply(inverse(X),Y),Z),double_divide(U,multiply(double_divide(U,double_divide(Y,Z)),inverse(X)))).
% 13 [para:6.1.1,6.1.1.1.1.2.1.2,demod:7] equal(double_divide(multiply(multiply(X,inverse(Y)),multiply(multiply(double_divide(Z,U),inverse(X)),Z)),U),Y).
% 36 [para:9.1.1,13.1.1.1] equal(double_divide(inverse(X),multiply(X,inverse(Y))),Y).
% 42 [para:36.1.1,7.1.2.1] equal(multiply(multiply(X,inverse(Y)),inverse(X)),inverse(Y)).
% 44 [para:7.1.2,36.1.1.2.2] equal(double_divide(inverse(X),multiply(X,multiply(Y,Z))),double_divide(Z,Y)).
% 54 [para:7.1.2,42.1.1.1.2,demod:7] equal(multiply(multiply(X,multiply(Y,Z)),inverse(X)),multiply(Y,Z)).
% 56 [para:42.1.1,36.1.1.2] equal(double_divide(inverse(multiply(X,inverse(Y))),inverse(Y)),X).
% 58 [para:7.1.2,56.1.1.1.1.2,demod:7] equal(double_divide(inverse(multiply(X,multiply(Y,Z))),multiply(Y,Z)),X).
% 66 [para:42.1.1,56.1.1.1.1] equal(double_divide(inverse(inverse(X)),inverse(Y)),multiply(Y,inverse(X))).
% 72 [para:7.1.2,66.1.1.2] equal(double_divide(inverse(inverse(X)),multiply(Y,Z)),multiply(double_divide(Z,Y),inverse(X))).
% 101 [para:9.1.1,44.1.1.2] equal(double_divide(inverse(X),inverse(Y)),double_divide(Z,multiply(double_divide(Z,X),inverse(Y)))).
% 111 [para:9.1.1,54.1.1.1] equal(multiply(inverse(X),inverse(Y)),multiply(multiply(double_divide(Z,Y),inverse(X)),Z)).
% 137 [para:9.1.1,58.1.1.1.1,demod:72,111] equal(multiply(double_divide(inverse(X),inverse(Y)),inverse(Y)),X).
% 166 [para:137.1.1,10.1.1.1.1] equal(double_divide(multiply(X,inverse(X)),inverse(Y)),Y).
% 167 [para:137.1.1,9.1.1.2.1] equal(multiply(inverse(X),multiply(Y,inverse(Y))),inverse(X)).
% 177 [para:137.1.1,54.1.1.1.2,demod:137] equal(multiply(multiply(X,Y),inverse(X)),Y).
% 185 [para:177.1.1,56.1.1.1.1] equal(double_divide(inverse(X),inverse(Y)),multiply(Y,X)).
% 209 [para:166.1.1,12.1.2.2.1.2,demod:101,185,167,slowcut:8] 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: 28
% derived clauses: 497
% kept clauses: 199
% kept size sum: 3590
% kept mid-nuclei: 0
% kept new demods: 187
% forw unit-subs: 282
% 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.2
% process. runtime: 0.1
% 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/GRP608-1+eq_r.in")
%
%------------------------------------------------------------------------------