%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP612-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 : art08.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/GRP612-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(inverse(double_divide(inverse(double_divide(inverse(double_divide(X,Y)),Z)),double_divide(X,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,demod:7] equal(multiply(double_divide(X,Y),multiply(Y,multiply(Z,X))),Z).
% 10 [para:6.1.1,6.1.1.1.1,demod:7] equal(multiply(double_divide(multiply(X,Y),double_divide(Y,Z)),X),Z).
% 11 [para:6.1.1,6.1.1.1.1.1.1,demod:7] equal(multiply(double_divide(multiply(X,multiply(Y,Z)),U),multiply(U,Y)),double_divide(Z,X)).
% 18 [para:11.1.1,10.1.1] equal(double_divide(X,multiply(double_divide(multiply(Y,X),Z),Y)),Z).
% 24 [para:18.1.1,7.1.2.1] equal(multiply(multiply(double_divide(multiply(X,Y),Z),X),Y),inverse(Z)).
% 31 [para:11.1.1,18.1.1.2] equal(double_divide(multiply(X,Y),double_divide(Y,multiply(Z,X))),Z).
% 33 [para:18.1.1,18.1.1.2.1] equal(double_divide(X,multiply(Y,Z)),multiply(double_divide(multiply(U,multiply(Z,X)),Y),U)).
% 44 [para:24.1.1,9.1.1.2,demod:33] equal(multiply(double_divide(X,double_divide(X,multiply(Y,Z))),inverse(Y)),Z).
% 93 [para:44.1.1,18.1.1.2] equal(double_divide(X,Y),double_divide(multiply(inverse(Z),X),multiply(Z,Y))).
% 108 [para:93.1.2,10.1.1.1.2,demod:33] equal(double_divide(X,multiply(double_divide(X,Y),inverse(Z))),multiply(Z,Y)).
% 143 [para:10.1.1,108.1.1.2] equal(double_divide(multiply(inverse(X),Y),Z),multiply(X,double_divide(Y,Z))).
% 147 [para:108.1.1,31.1.1.2,demod:143] equal(multiply(X,double_divide(Y,multiply(X,Z))),double_divide(Y,Z)).
% 151 [para:93.1.2,108.1.1.2.1,demod:108,143] equal(multiply(X,multiply(Y,Z)),multiply(Y,multiply(X,Z))).
% 158 [para:18.1.1,147.1.1.2] equal(multiply(double_divide(multiply(X,Y),Z),Z),double_divide(Y,X)).
% 172 [para:108.1.1,147.1.1.2] equal(multiply(double_divide(X,Y),multiply(Z,Y)),double_divide(X,inverse(Z))).
% 271 [para:158.1.1,24.1.1.1] equal(multiply(double_divide(X,Y),X),inverse(Y)).
% 273 [para:24.1.1,158.1.1.1.1,demod:18] equal(multiply(double_divide(inverse(X),Y),Y),X).
% 314 [para:271.1.1,108.1.1.2] equal(double_divide(inverse(X),inverse(Y)),multiply(X,Y)).
% 375 [para:273.1.1,151.1.1.2,demod:314,172,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: 25
% derived clauses: 704
% kept clauses: 365
% kept size sum: 5753
% kept mid-nuclei: 0
% kept new demods: 305
% forw unit-subs: 323
% 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.4
% process. runtime: 0.2
% 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/GRP612-1+eq_r.in")
%
%------------------------------------------------------------------------------