TSTP Solution File: GRP058-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP058-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art04.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/GRP058-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 8 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 8 5)
% (binary-posweight-lex-big-order 30 #f 8 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)) | -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% was split for some strategies as:
% -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% -equal(multiply(multiply(inverse(b2),b2),a2),a2).
% -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(3,40,1,6,0,1)
%
%
% START OF PROOF
% 4 [] equal(X,X).
% 5 [] equal(multiply(X,inverse(multiply(Y,multiply(multiply(multiply(Z,inverse(Z)),inverse(multiply(U,Y))),X)))),U).
% 6 [] -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 8 [para:5.1.1,5.1.1.2.1.2.1] equal(multiply(X,inverse(multiply(multiply(multiply(multiply(Y,inverse(Y)),inverse(multiply(Z,U))),multiply(V,inverse(V))),multiply(Z,X)))),U).
% 9 [para:8.1.1,5.1.1.2.1.2] equal(multiply(inverse(multiply(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(Y,Z))),multiply(U,inverse(U))),multiply(Y,multiply(multiply(V,inverse(V)),inverse(multiply(W,X1)))))),inverse(multiply(X1,Z))),W).
% 10 [para:8.1.1,5.1.1.2.1.2.1] equal(multiply(X,inverse(multiply(multiply(Y,multiply(Z,inverse(Z))),multiply(U,X)))),multiply(multiply(multiply(V,inverse(V)),inverse(multiply(Y,U))),multiply(W,inverse(W)))).
% 11 [para:5.1.1,8.1.1.2.1.1.1.2.1] equal(multiply(X,inverse(multiply(multiply(multiply(multiply(Y,inverse(Y)),inverse(Z)),multiply(U,inverse(U))),multiply(V,X)))),inverse(multiply(W,multiply(multiply(multiply(X1,inverse(X1)),inverse(multiply(Z,W))),V)))).
% 12 [para:5.1.1,8.1.1.2.1.2] equal(multiply(inverse(multiply(X,multiply(multiply(multiply(Y,inverse(Y)),inverse(multiply(Z,X))),U))),inverse(multiply(multiply(multiply(multiply(V,inverse(V)),inverse(multiply(U,W))),multiply(X1,inverse(X1))),Z))),W).
% 13 [para:8.1.1,8.1.1.2.1.1.1.2.1] equal(multiply(X,inverse(multiply(multiply(multiply(multiply(Y,inverse(Y)),inverse(Z)),multiply(U,inverse(U))),multiply(V,X)))),inverse(multiply(multiply(multiply(multiply(W,inverse(W)),inverse(multiply(X1,Z))),multiply(X2,inverse(X2))),multiply(X1,V)))).
% 17 [para:10.1.1,8.1.1] equal(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(multiply(multiply(Y,inverse(Y)),inverse(multiply(Z,U))),Z))),multiply(V,inverse(V))),U).
% 24 [para:17.1.1,5.1.1.2.1.2] equal(multiply(multiply(X,inverse(X)),inverse(multiply(Y,Z))),multiply(multiply(U,inverse(U)),inverse(multiply(Y,Z)))).
% 29 [para:17.1.1,17.1.1.1.2.1] equal(multiply(multiply(multiply(X,inverse(X)),inverse(inverse(Y))),multiply(Z,inverse(Z))),Y).
% 38 [para:24.1.1,5.1.1.2.1.2.1.2.1,demod:5] equal(multiply(X,inverse(X)),multiply(Y,inverse(Y))).
% 39 [para:5.1.1,24.1.1.2.1,demod:5] equal(multiply(multiply(X,inverse(X)),inverse(Y)),multiply(multiply(Z,inverse(Z)),inverse(Y))).
% 48 [para:24.1.1,17.1.1.1.2.1] equal(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(multiply(Y,inverse(Y)),inverse(multiply(Z,U))))),multiply(V,inverse(V))),inverse(inverse(multiply(Z,U)))).
% 53 [para:38.1.1,5.1.1.2.1.2.1] equal(multiply(X,inverse(multiply(inverse(Y),multiply(multiply(Z,inverse(Z)),X)))),Y).
% 54 [para:38.1.1,8.1.1.2.1.1.1] equal(multiply(X,inverse(multiply(multiply(multiply(Y,inverse(Y)),multiply(Z,inverse(Z))),multiply(U,X)))),inverse(U)).
% 70 [para:38.1.1,53.1.1.2.1.2] equal(multiply(inverse(multiply(X,inverse(X))),inverse(multiply(inverse(Y),multiply(Z,inverse(Z))))),Y).
% 73 [para:39.1.1,38.1.1] equal(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),multiply(Z,inverse(Z))).
% 86 [para:73.1.2,8.1.1.2.1.1.1.2.1,demod:48] equal(multiply(X,inverse(multiply(inverse(inverse(multiply(Y,inverse(Y)))),multiply(Z,X)))),inverse(Z)).
% 117 [para:86.1.1,53.1.1] equal(inverse(multiply(X,inverse(X))),inverse(multiply(Y,inverse(Y)))).
% 127 [para:39.1.1,117.1.1.1] equal(inverse(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y))))),inverse(multiply(Z,inverse(Z)))).
% 215 [para:11.1.1,8.1.1] equal(inverse(multiply(X,multiply(multiply(multiply(Y,inverse(Y)),inverse(multiply(multiply(Z,U),X))),Z))),U).
% 253 [para:38.1.1,215.1.1.1.2.1] equal(inverse(multiply(inverse(multiply(X,Y)),multiply(multiply(Z,inverse(Z)),X))),Y).
% 260 [para:73.1.1,215.1.1.1.2] equal(inverse(multiply(inverse(multiply(inverse(multiply(X,inverse(X))),Y)),multiply(Z,inverse(Z)))),Y).
% 312 [para:253.1.1,70.1.1.2] equal(multiply(inverse(multiply(X,inverse(X))),Y),multiply(inverse(multiply(Z,inverse(Z))),Y)).
% 425 [para:253.1.1,260.1.1.1.1] equal(inverse(multiply(inverse(X),multiply(Y,inverse(Y)))),multiply(multiply(Z,inverse(Z)),X)).
% 439 [para:425.1.2,10.1.2.1.2.1,demod:29,54] equal(inverse(X),multiply(inverse(X),multiply(Y,inverse(Y)))).
% 449 [para:425.1.2,29.1.1.1,demod:439] equal(inverse(inverse(inverse(inverse(X)))),X).
% 458 [para:38.1.1,425.1.1.1.2,demod:439] equal(inverse(inverse(X)),multiply(multiply(Y,inverse(Y)),X)).
% 474 [para:425.1.1,9.1.1.1.1.2.2.2,demod:449,439,458] equal(multiply(inverse(multiply(inverse(inverse(inverse(multiply(X,Y)))),multiply(X,Z))),inverse(inverse(inverse(Y)))),inverse(Z)).
% 476 [para:425.1.2,9.1.1.2.1,demod:449,474,439,458] equal(multiply(X,multiply(Y,inverse(Y))),X).
% 481 [para:127.1.2,425.1.2.1.2,demod:449,458,439] equal(inverse(inverse(X)),multiply(inverse(inverse(multiply(Y,inverse(Y)))),X)).
% 483 [para:425.1.2,54.1.1.2.1.1,demod:481,439] equal(multiply(X,inverse(inverse(inverse(multiply(Y,X))))),inverse(Y)).
% 486 [para:425.1.2,11.1.1.2.1.1,demod:449,458,483,481,439] equal(inverse(X),inverse(multiply(Y,multiply(inverse(Y),X)))).
% 490 [para:425.1.2,11.1.2.1.2,demod:439,458] equal(multiply(X,inverse(multiply(inverse(inverse(inverse(Y))),multiply(Z,X)))),inverse(multiply(inverse(Y),inverse(inverse(Z))))).
% 498 [para:425.1.2,312.1.1.1.1,demod:458,449,481] equal(inverse(inverse(X)),multiply(inverse(multiply(Y,inverse(Y))),X)).
% 502 [para:425.1.2,12.1.1.1.1.2.1.2.1,demod:486,449,458,439] equal(multiply(inverse(X),multiply(X,Y)),Y).
% 527 [para:476.1.1,10.1.1.2.1,demod:439,458,476] equal(multiply(inverse(X),inverse(Y)),inverse(inverse(inverse(multiply(Y,X))))).
% 528 [para:476.1.1,10.1.1.2.1.1,demod:476,527,458] equal(multiply(X,inverse(multiply(Y,multiply(Z,X)))),multiply(inverse(Z),inverse(Y))).
% 539 [para:476.1.1,54.1.1.2.1.1,demod:527,458] equal(multiply(X,multiply(inverse(X),inverse(Y))),inverse(Y)).
% 540 [para:476.1.1,11.1.1.2.1,demod:527,449,439,458] equal(multiply(inverse(X),Y),inverse(multiply(Z,multiply(multiply(inverse(Z),inverse(Y)),X)))).
% 541 [para:476.1.1,11.1.1.2.1.1,demod:540,527,490,458] equal(inverse(multiply(inverse(X),inverse(inverse(Y)))),multiply(inverse(Y),X)).
% 542 [?] ?
% 543 [para:476.1.1,11.1.2.1.2,demod:539,527,541,439,542,458] equal(multiply(X,multiply(inverse(X),Y)),inverse(inverse(Y))).
% 545 [para:476.1.1,215.1.1.1.2,demod:539,542,527,458] equal(inverse(inverse(X)),X).
% 546 [para:476.1.1,215.1.1.1.2.1.2.1,demod:545,458] equal(inverse(multiply(inverse(multiply(X,Y)),X)),Y).
% 557 [para:260.1.1,476.1.1.2.2,demod:439,545,498] equal(multiply(X,multiply(inverse(Y),Y)),X).
% 560 [para:545.1.1,10.1.1.2.1.1.2.2,demod:439,545,458,528,557] equal(multiply(inverse(X),inverse(Y)),inverse(multiply(Y,X))).
% 562 [para:545.1.1,17.1.1.1.1.2,demod:476,546,545,458] equal(multiply(multiply(inverse(X),X),Y),Y).
% 575 [para:11.1.2,545.1.1.1,demod:528,439,545,458] equal(inverse(multiply(inverse(X),Y)),multiply(Z,multiply(inverse(multiply(Y,Z)),X))).
% 586 [para:5.1.1,13.1.2.1.1.1,demod:560,528,476,439,545,458] equal(inverse(multiply(multiply(X,Y),Z)),inverse(multiply(X,multiply(Y,Z)))).
% 587 [para:5.1.1,13.1.2.1.1.1.2.1,demod:528,439,575,545,458] equal(multiply(inverse(X),multiply(inverse(Y),Z)),inverse(multiply(inverse(Z),multiply(Y,X)))).
% 588 [para:5.1.1,13.1.2.1.2,demod:543,587,575,439,545,458] equal(multiply(inverse(multiply(inverse(X),Y)),Z),inverse(multiply(inverse(multiply(X,Z)),Y))).
% 593 [para:13.1.1,10.1.1,demod:502,588,439,545,458] equal(multiply(inverse(X),Y),inverse(multiply(inverse(Y),X))).
% 599 [para:10.1.2,13.1.1.2.1.2,demod:502,588,586,560,528,476,439,545,458] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 607 [para:557.1.1,253.1.1.1.1.1,demod:593,545,458] equal(multiply(inverse(X),X),multiply(inverse(Y),Y)).
% 609 [hyper:6,562,demod:599,cut:4,cut:607] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 8
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 42
% derived clauses: 5293
% kept clauses: 601
% kept size sum: 14991
% kept mid-nuclei: 0
% kept new demods: 245
% forw unit-subs: 3305
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.13
% process. runtime: 0.12
% 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/GRP058-1+eq_r.in")
%
%------------------------------------------------------------------------------