TSTP Solution File: GRP428-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP428-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 : art10.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/GRP428-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 9 1)
% (binary-posweight-lex-big-order 30 #f 9 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(3,40,1,6,0,1)
%
%
% START OF PROOF
% 5 [] equal(multiply(X,inverse(multiply(multiply(inverse(multiply(inverse(Y),multiply(inverse(X),Z))),U),inverse(multiply(Y,U))))),Z).
% 6 [] -equal(multiply(multiply(inverse(b2),b2),a2),a2).
% 7 [para:5.1.1,5.1.1.2.1.1.1.1.2] equal(multiply(X,inverse(multiply(multiply(inverse(multiply(inverse(Y),Z)),U),inverse(multiply(Y,U))))),inverse(multiply(multiply(inverse(multiply(inverse(V),multiply(inverse(inverse(X)),Z))),W),inverse(multiply(V,W))))).
% 8 [para:7.1.1,5.1.1] equal(inverse(multiply(multiply(inverse(multiply(inverse(X),multiply(inverse(inverse(Y)),multiply(inverse(Y),Z)))),U),inverse(multiply(X,U)))),Z).
% 9 [para:7.1.2,5.1.1.2] equal(multiply(inverse(X),multiply(X,inverse(multiply(multiply(inverse(multiply(inverse(Y),Z)),U),inverse(multiply(Y,U)))))),Z).
% 11 [para:7.1.2,7.1.2] equal(multiply(X,inverse(multiply(multiply(inverse(multiply(inverse(Y),Z)),U),inverse(multiply(Y,U))))),multiply(X,inverse(multiply(multiply(inverse(multiply(inverse(V),Z)),W),inverse(multiply(V,W)))))).
% 12 [para:9.1.1,5.1.1.2.1.1.1.1] equal(multiply(X,inverse(multiply(multiply(inverse(Y),Z),inverse(multiply(inverse(X),Z))))),inverse(multiply(multiply(inverse(multiply(inverse(U),Y)),V),inverse(multiply(U,V))))).
% 13 [para:5.1.1,9.1.1.2.2.1.1.1.1] equal(multiply(inverse(X),multiply(X,inverse(multiply(multiply(inverse(Y),Z),inverse(multiply(U,Z)))))),inverse(multiply(multiply(inverse(multiply(inverse(V),multiply(inverse(inverse(U)),Y))),W),inverse(multiply(V,W))))).
% 18 [para:8.1.1,9.1.1.2.2] equal(multiply(inverse(X),multiply(X,Y)),multiply(inverse(inverse(Z)),multiply(inverse(Z),Y))).
% 20 [para:8.1.1,8.1.1.1.1.1.1.2.1.1,demod:8] equal(inverse(multiply(multiply(inverse(multiply(inverse(X),multiply(inverse(Y),multiply(Y,Z)))),U),inverse(multiply(X,U)))),Z).
% 22 [para:18.1.2,5.1.1.2.1.1.1.1] equal(multiply(X,inverse(multiply(multiply(inverse(multiply(inverse(Y),multiply(Y,Z))),U),inverse(multiply(inverse(X),U))))),Z).
% 37 [para:8.1.1,18.1.2.1.1,demod:8] equal(multiply(inverse(X),multiply(X,Y)),multiply(inverse(Z),multiply(Z,Y))).
% 46 [para:37.1.1,37.1.1.2] equal(multiply(inverse(inverse(X)),multiply(inverse(Y),multiply(Y,Z))),multiply(inverse(U),multiply(U,multiply(X,Z)))).
% 286 [para:12.1.2,5.1.1.2] equal(multiply(X,multiply(Y,inverse(multiply(multiply(inverse(multiply(inverse(X),Z)),U),inverse(multiply(inverse(Y),U)))))),Z).
% 290 [para:12.1.2,9.1.1.2.2] equal(multiply(inverse(X),multiply(X,multiply(Y,inverse(multiply(multiply(inverse(Z),U),inverse(multiply(inverse(Y),U))))))),Z).
% 304 [para:12.1.1,46.1.2.2.2,demod:9] equal(multiply(inverse(inverse(X)),multiply(inverse(Y),multiply(Y,inverse(multiply(multiply(inverse(Z),U),inverse(multiply(inverse(X),U))))))),Z).
% 390 [para:8.1.1,304.1.1.1.1,demod:8] equal(multiply(inverse(X),multiply(inverse(Y),multiply(Y,inverse(multiply(multiply(inverse(Z),U),inverse(multiply(X,U))))))),Z).
% 402 [para:390.1.1,7.1.2.1.1.1.1,demod:5] equal(inverse(multiply(multiply(inverse(X),Y),inverse(multiply(Z,Y)))),inverse(multiply(multiply(inverse(X),U),inverse(multiply(Z,U))))).
% 421 [para:8.1.1,402.1.1.1.1.1,demod:8] equal(inverse(multiply(multiply(X,Y),inverse(multiply(Z,Y)))),inverse(multiply(multiply(X,U),inverse(multiply(Z,U))))).
% 566 [para:421.1.1,290.1.1.2.2.2.1.1.1,demod:290] equal(multiply(multiply(X,Y),inverse(multiply(Z,Y))),multiply(multiply(X,U),inverse(multiply(Z,U)))).
% 581 [para:37.1.1,566.1.1.1] equal(multiply(multiply(inverse(X),multiply(X,Y)),inverse(multiply(Z,multiply(U,Y)))),multiply(multiply(inverse(U),V),inverse(multiply(Z,V)))).
% 928 [para:9.1.1,581.1.1.2.1,demod:9] equal(multiply(X,inverse(X)),multiply(multiply(inverse(Y),Z),inverse(multiply(inverse(Y),Z)))).
% 1075 [para:5.1.1,928.1.2.1,demod:5] equal(multiply(X,inverse(X)),multiply(Y,inverse(Y))).
% 1103 [para:928.1.2,22.1.1.2.1] equal(multiply(multiply(inverse(X),multiply(X,Y)),inverse(multiply(Z,inverse(Z)))),Y).
% 1152 [para:928.1.2,286.1.1.2.2.1] equal(multiply(X,multiply(multiply(inverse(X),Y),inverse(multiply(Z,inverse(Z))))),Y).
% 1527 [para:1075.1.1,1152.1.1.2] equal(multiply(X,multiply(Y,inverse(Y))),inverse(inverse(X))).
% 1535 [para:1527.1.1,37.1.1] equal(inverse(inverse(inverse(X))),multiply(inverse(Y),multiply(Y,inverse(X)))).
% 1564 [para:1527.1.1,13.1.1.2.2.1.1,demod:1535,1527] equal(inverse(inverse(inverse(multiply(inverse(inverse(inverse(X))),inverse(inverse(inverse(Y))))))),inverse(multiply(multiply(inverse(multiply(inverse(Z),multiply(inverse(inverse(Y)),X))),U),inverse(multiply(Z,U))))).
% 1586 [para:1527.1.1,1103.1.1.1] equal(multiply(inverse(inverse(inverse(X))),inverse(multiply(Y,inverse(Y)))),inverse(X)).
% 1600 [para:20.1.1,1535.1.2.2.2,demod:20] equal(inverse(inverse(X)),multiply(inverse(Y),multiply(Y,X))).
% 1664 [para:1600.1.2,7.1.1.2.1.2.1,demod:1564] equal(multiply(X,inverse(multiply(multiply(inverse(multiply(inverse(inverse(Y)),Z)),multiply(Y,U)),inverse(inverse(inverse(U)))))),inverse(inverse(inverse(multiply(inverse(inverse(inverse(Z))),inverse(inverse(inverse(X)))))))).
% 1666 [para:1600.1.2,7.1.2.1.1.1.1.2,demod:5] equal(X,inverse(multiply(multiply(inverse(multiply(inverse(Y),inverse(inverse(X)))),Z),inverse(multiply(Y,Z))))).
% 1673 [para:1600.1.2,37.1.1.2,demod:1600] equal(multiply(inverse(inverse(X)),inverse(inverse(Y))),inverse(inverse(multiply(X,Y)))).
% 1683 [para:1600.1.2,11.1.1.2.1.2.1,demod:1673,1664] equal(inverse(inverse(inverse(inverse(inverse(multiply(inverse(X),inverse(Y))))))),multiply(Y,inverse(multiply(multiply(inverse(multiply(inverse(Z),X)),U),inverse(multiply(Z,U)))))).
% 1731 [para:1600.1.2,1103.1.1.1] equal(multiply(inverse(inverse(X)),inverse(multiply(Y,inverse(Y)))),X).
% 1739 [para:1731.1.1,8.1.1.1.2.1,demod:1586,1673,1600] equal(inverse(multiply(inverse(multiply(inverse(X),Y)),inverse(X))),Y).
% 1788 [para:1739.1.1,7.1.2.1.1.1.1.2.1.1,demod:1739,1683] equal(inverse(inverse(inverse(inverse(inverse(multiply(inverse(X),Y)))))),inverse(multiply(multiply(inverse(multiply(inverse(Z),multiply(inverse(Y),X))),U),inverse(multiply(Z,U))))).
% 1792 [para:8.1.1,1739.1.1.1.1.1.1,demod:1666,1600] equal(inverse(multiply(inverse(multiply(X,Y)),X)),Y).
% 1847 [para:1792.1.1,5.1.1.2.1.1.1.1.2.1,demod:1792,1683] equal(inverse(inverse(inverse(inverse(X)))),X).
% 1855 [para:1792.1.1,9.1.1.1,demod:1847,1792,1683] equal(multiply(X,inverse(multiply(inverse(Y),X))),Y).
% 1860 [para:1792.1.1,37.1.1.1,demod:1600] equal(multiply(X,multiply(multiply(inverse(multiply(Y,X)),Y),Z)),inverse(inverse(Z))).
% 1867 [para:1792.1.1,12.1.1.2.1.1.1,demod:1847,1600,1788] equal(multiply(X,inverse(multiply(multiply(Y,Z),inverse(multiply(inverse(X),Z))))),inverse(inverse(inverse(Y)))).
% 1870 [para:1792.1.1,12.1.2.1.1.1,demod:1847,1867] equal(X,inverse(multiply(multiply(Y,Z),inverse(multiply(multiply(X,Y),Z))))).
% 1878 [para:286.1.1,1792.1.1.1.1.1,demod:1847,1867] equal(inverse(multiply(inverse(X),Y)),multiply(inverse(Y),X)).
% 1881 [para:1792.1.1,290.1.1.2.2.2.1.2,demod:1870,1600] equal(inverse(inverse(X)),X).
% 1926 [para:1792.1.1,1103.1.1.1.1,demod:1881,1860] equal(multiply(X,inverse(multiply(Y,inverse(Y)))),X).
% 1932 [para:1792.1.1,1731.1.1.1.1,demod:1926] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 1933 [para:1792.1.1,1731.1.1.2.1.2,demod:1878,1932,1881] equal(multiply(X,multiply(inverse(Y),Y)),X).
% 1976 [para:1933.1.1,1855.1.1.2.1,demod:1881,slowcut:6] 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 9
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 51
% derived clauses: 11810
% kept clauses: 1968
% kept size sum: 60561
% kept mid-nuclei: 0
% kept new demods: 473
% forw unit-subs: 6696
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 9
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.30
% process. runtime: 0.28
% 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/GRP428-1+eq_r.in")
%
%------------------------------------------------------------------------------