TSTP Solution File: GRP405-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP405-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 : art06.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/GRP405-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 8 1)
% (binary-posweight-lex-big-order 30 #f 8 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,6,50,1,9,0,1)
%
%
% START OF PROOF
% 7 [] equal(X,X).
% 8 [] equal(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),inverse(multiply(Y,multiply(inverse(Y),Y)))))),Z).
% 9 [] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 10 [para:8.1.1,8.1.1.2.1.1.1] equal(multiply(X,inverse(multiply(inverse(Y),inverse(multiply(Z,multiply(inverse(Z),Z)))))),inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),Y)),inverse(multiply(U,multiply(inverse(U),U)))))).
% 11 [para:10.1.1,8.1.1] equal(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(X,Y)),U))),inverse(multiply(Z,multiply(inverse(Z),Z))))),U).
% 12 [para:10.1.2,8.1.1.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(Z),inverse(multiply(Y,multiply(inverse(Y),Y))))))),Z).
% 18 [para:11.1.1,11.1.1.1.1.1.1.1.1,demod:11] equal(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),inverse(multiply(Y,multiply(inverse(Y),Y))))),Z).
% 20 [para:8.1.1,18.1.1.1.1.1.2] equal(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),inverse(multiply(Y,multiply(inverse(Y),Y))))),inverse(multiply(inverse(multiply(inverse(multiply(X,U)),Z)),inverse(multiply(U,multiply(inverse(U),U)))))).
% 21 [para:18.1.1,10.1.1.2] equal(multiply(X,Y),inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),multiply(inverse(multiply(V,Z)),multiply(V,Y)))),inverse(multiply(U,multiply(inverse(U),U)))))).
% 23 [para:18.1.1,12.1.1.2.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,Z)),multiply(inverse(multiply(U,Y)),multiply(U,Z))).
% 25 [para:23.1.1,8.1.1.2.1.2.1.2] equal(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(X,multiply(Y,Z))),U)),inverse(multiply(multiply(Y,Z),multiply(inverse(multiply(V,Z)),multiply(V,Z))))))),U).
% 26 [para:8.1.1,23.1.1.2] equal(multiply(inverse(multiply(X,Y)),Z),multiply(inverse(multiply(U,Y)),multiply(U,inverse(multiply(inverse(multiply(inverse(multiply(X,V)),Z)),inverse(multiply(V,multiply(inverse(V),V)))))))).
% 27 [para:23.1.1,10.1.2.1.1.1.1.1] equal(multiply(X,inverse(multiply(inverse(Y),inverse(multiply(Z,multiply(inverse(Z),Z)))))),inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(U,Z)),multiply(U,V))),Y)),inverse(multiply(multiply(X,V),multiply(inverse(multiply(X,V)),multiply(X,V))))))).
% 36 [para:18.1.1,23.1.1.1] equal(multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)),multiply(inverse(multiply(V,inverse(multiply(Z,multiply(inverse(Z),Z))))),multiply(V,U))).
% 37 [para:18.1.1,23.1.2.1] equal(multiply(inverse(multiply(X,inverse(multiply(Y,multiply(inverse(Y),Y))))),multiply(X,Z)),multiply(U,multiply(inverse(multiply(inverse(multiply(V,Y)),multiply(V,U))),Z))).
% 38 [para:23.1.1,23.1.1.1.1] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(multiply(U,Y)),V)),multiply(inverse(multiply(W,multiply(U,Z))),multiply(W,V))).
% 39 [para:23.1.1,23.1.1.2] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(U,Y)),multiply(U,V))),multiply(inverse(multiply(W,Z)),multiply(W,multiply(X,V)))).
% 43 [para:8.1.1,38.1.1.2,demod:26] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),U),multiply(inverse(multiply(inverse(multiply(V,Y)),multiply(V,Z))),U)).
% 101 [para:39.1.1,38.1.1] equal(multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,multiply(Y,U))),multiply(inverse(multiply(V,multiply(W,Z))),multiply(V,multiply(W,U)))).
% 279 [para:18.1.1,25.1.1.2.1.1] equal(multiply(inverse(multiply(X,Y)),inverse(multiply(Z,inverse(multiply(multiply(X,Z),multiply(inverse(multiply(U,Z)),multiply(U,Z))))))),inverse(multiply(Y,multiply(inverse(Y),Y)))).
% 302 [para:18.1.1,36.1.2.1] equal(multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)),multiply(V,multiply(inverse(multiply(inverse(multiply(W,Z)),multiply(W,V))),U))).
% 389 [para:279.1.1,12.1.1.2] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,inverse(Z)))),inverse(multiply(Y,multiply(inverse(Y),Y)))),Z).
% 435 [para:389.1.1,302.1.1.2] equal(multiply(inverse(X),X),multiply(Y,multiply(inverse(multiply(inverse(multiply(Z,U)),multiply(Z,Y))),inverse(multiply(U,multiply(inverse(U),U)))))).
% 443 [para:435.1.2,10.1.2.1.1.1,demod:8,389] equal(X,inverse(multiply(inverse(multiply(inverse(Y),Y)),inverse(multiply(X,multiply(inverse(X),X)))))).
% 537 [para:389.1.1,435.1.2.2] equal(multiply(inverse(X),X),multiply(inverse(Y),Y)).
% 624 [para:537.1.1,389.1.1.1.1] equal(multiply(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(Y),multiply(inverse(inverse(Y)),inverse(Y))))),Y).
% 671 [para:537.1.1,443.1.2.1.2.1.2] equal(X,inverse(multiply(inverse(multiply(inverse(Y),Y)),inverse(multiply(X,multiply(inverse(Z),Z)))))).
% 722 [para:537.1.1,624.1.1.2.1.2] equal(multiply(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(Y),multiply(inverse(Z),Z)))),Y).
% 763 [para:537.1.1,722.1.1.2.1] equal(multiply(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(Y),Y))),multiply(inverse(Z),Z)).
% 768 [para:763.1.1,8.1.1.2.1.1.1,demod:671] equal(multiply(inverse(X),X),inverse(multiply(inverse(Y),Y))).
% 1118 [para:768.1.1,537.1.1] equal(inverse(multiply(inverse(X),X)),multiply(inverse(Y),Y)).
% 1148 [para:768.1.2,722.1.1.1] equal(multiply(multiply(inverse(X),X),inverse(multiply(inverse(Y),multiply(inverse(Z),Z)))),Y).
% 1169 [para:768.1.2,768.1.2.1.1] equal(multiply(inverse(X),X),inverse(multiply(multiply(inverse(Y),Y),multiply(inverse(Z),Z)))).
% 1185 [para:768.1.2,1118.1.1.1.1] equal(inverse(multiply(multiply(inverse(X),X),multiply(inverse(Y),Y))),multiply(inverse(Z),Z)).
% 4296 [para:1169.1.1,1148.1.1.2.1.2] equal(multiply(multiply(inverse(X),X),inverse(multiply(inverse(Y),inverse(multiply(multiply(inverse(Z),Z),multiply(inverse(U),U)))))),Y).
% 4604 [para:1185.1.1,12.1.1.1,demod:4296] equal(multiply(multiply(inverse(X),X),Y),Y).
% 4609 [para:1185.1.1,23.1.1.1,demod:4604] equal(X,multiply(inverse(multiply(Y,multiply(inverse(Z),Z))),multiply(Y,X))).
% 4611 [para:1185.1.1,38.1.1.2.1,demod:4604,4609] equal(multiply(inverse(X),Y),multiply(inverse(multiply(Z,X)),multiply(Z,Y))).
% 4613 [para:1185.1.1,38.1.2.1,demod:4604,4611] equal(multiply(inverse(multiply(inverse(X),Y)),multiply(inverse(multiply(inverse(Y),X)),Z)),Z).
% 4615 [para:1185.1.2,38.1.2.1.1.2,demod:4604,4613,4611] equal(X,multiply(inverse(inverse(multiply(inverse(Y),Y))),X)).
% 4617 [para:1185.1.2,43.1.1.1.1,demod:4611,4615,4604] equal(X,multiply(inverse(multiply(inverse(Y),Y)),X)).
% 4623 [para:1185.1.2,101.1.1.2,demod:4604,4611] equal(multiply(inverse(multiply(inverse(X),Y)),inverse(multiply(inverse(Z),Z))),multiply(inverse(Y),X)).
% 4641 [para:1185.1.1,36.1.1.2.1.1.1,demod:4615,4611,4617,4604] equal(multiply(X,multiply(inverse(X),Y)),Y).
% 4642 [para:1185.1.2,36.1.1.2.1.1.1.1,demod:4611,4641,4615,4604] equal(multiply(X,multiply(inverse(multiply(inverse(Y),X)),Z)),multiply(inverse(inverse(Y)),Z)).
% 4645 [para:1185.1.2,302.1.1.2,demod:4641,4611,4604] equal(multiply(X,inverse(multiply(inverse(Y),Y))),X).
% 4646 [para:1185.1.2,302.1.1.2.1.1,demod:4642,4611,4615,4604] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 4648 [para:1185.1.1,37.1.1.1.1.2.1.2.1,demod:4641,4609,4645,4604] equal(multiply(inverse(X),multiply(X,Y)),Y).
% 4661 [?] ?
% 4674 [para:1185.1.2,389.1.1.1.1,demod:4648,4646,4661,4604] equal(inverse(inverse(X)),X).
% 4677 [para:1185.1.1,389.1.1.2,demod:4674,4609] equal(multiply(X,multiply(inverse(Y),Y)),X).
% 4680 [para:1185.1.1,20.1.1.1.2,demod:4661,4677] equal(multiply(inverse(X),Y),inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),Y)),inverse(Z)))).
% 4681 [para:1185.1.1,20.1.1.1.2.1.2.1,demod:4680,4623,4677,4604] equal(inverse(multiply(inverse(X),Y)),multiply(inverse(Y),X)).
% 4682 [para:1185.1.2,20.1.2.1.1.1.1.1,demod:4604,4674,4677,4681] equal(multiply(X,multiply(multiply(inverse(X),Y),Z)),multiply(Y,Z)).
% 4687 [para:1185.1.2,21.1.2.1.1.1.2.1.1,demod:4682,4674,4677,4604,4681] equal(multiply(X,Y),multiply(multiply(X,Z),multiply(inverse(Z),Y))).
% 4695 [para:1185.1.2,26.1.2.2.2.1.1.1.1.1,demod:4611,4674,4677,4604,4681] equal(multiply(multiply(inverse(X),Y),Z),multiply(inverse(X),multiply(Y,Z))).
% 4699 [para:1185.1.2,27.1.2.1.1.1.1.1,demod:4661,4687,4611,4648,4695,4674,4681,4677] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 4751 [para:4699.1.2,9.1.1,cut:7] 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: 108
% derived clauses: 50648
% kept clauses: 4741
% kept size sum: 142459
% kept mid-nuclei: 0
% kept new demods: 625
% forw unit-subs: 35355
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 18
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.58
% process. runtime: 1.57
% 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/GRP405-1+eq_r.in")
%
%------------------------------------------------------------------------------