TSTP Solution File: GRP059-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP059-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 : art03.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/GRP059-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 *********
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(3,40,1,6,0,1,7,50,1,10,0,1,4150,4,753)
%
%
% START OF PROOF
% 8 [] equal(X,X).
% 9 [] equal(inverse(multiply(multiply(multiply(inverse(multiply(multiply(X,Y),Z)),X),Y),multiply(U,inverse(U)))),Z).
% 10 [] -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)).
% 11 [para:9.1.1,9.1.1.1.1.1.1] equal(inverse(multiply(multiply(multiply(X,multiply(inverse(multiply(multiply(Y,Z),X)),Y)),Z),multiply(U,inverse(U)))),multiply(V,inverse(V))).
% 13 [para:11.1.1,11.1.1] equal(multiply(X,inverse(X)),multiply(Y,inverse(Y))).
% 16 [para:13.1.1,9.1.1.1.1.1.1.1] equal(inverse(multiply(multiply(multiply(inverse(multiply(X,inverse(X))),Y),Z),multiply(U,inverse(U)))),inverse(multiply(Y,Z))).
% 17 [para:13.1.1,9.1.1.1.1.1.1.1.1] equal(inverse(multiply(multiply(multiply(inverse(multiply(multiply(X,inverse(X)),Y)),Z),inverse(Z)),multiply(U,inverse(U)))),Y).
% 18 [para:9.1.1,13.1.1.2] equal(multiply(multiply(multiply(multiply(inverse(multiply(multiply(X,Y),Z)),X),Y),multiply(U,inverse(U))),Z),multiply(V,inverse(V))).
% 28 [para:16.1.1,13.1.2.2] equal(multiply(X,inverse(X)),multiply(multiply(multiply(multiply(inverse(multiply(Y,inverse(Y))),Z),U),multiply(V,inverse(V))),inverse(multiply(Z,U)))).
% 35 [para:13.1.1,17.1.1.1.1.1.1.1,demod:16] equal(inverse(multiply(X,inverse(X))),inverse(multiply(Y,inverse(Y)))).
% 41 [para:35.1.1,13.1.1.2] equal(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),multiply(Z,inverse(Z))).
% 52 [para:41.1.1,11.1.1.1.1.1.2.1.1,demod:16] equal(inverse(multiply(multiply(inverse(multiply(X,inverse(X))),Y),inverse(Y))),multiply(Z,inverse(Z))).
% 61 [para:35.1.1,41.1.1.1.2] equal(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),inverse(multiply(Z,inverse(Z)))),multiply(U,inverse(U))).
% 72 [para:52.1.1,9.1.1.1.1.1.1] equal(inverse(multiply(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),Z),multiply(U,inverse(U)))),inverse(Z)).
% 478 [para:61.1.2,16.1.1.1.1,demod:72] equal(inverse(inverse(multiply(X,inverse(X)))),inverse(multiply(Y,inverse(multiply(inverse(multiply(Z,inverse(Z))),Y))))).
% 561 [para:478.1.2,478.1.2] equal(inverse(inverse(multiply(X,inverse(X)))),inverse(inverse(multiply(Y,inverse(Y))))).
% 591 [para:561.1.1,13.1.1.2] equal(multiply(inverse(multiply(X,inverse(X))),inverse(inverse(multiply(Y,inverse(Y))))),multiply(Z,inverse(Z))).
% 663 [para:591.1.2,16.1.1.1.1.1,demod:16] equal(inverse(multiply(inverse(inverse(multiply(X,inverse(X)))),Y)),inverse(multiply(inverse(inverse(multiply(Z,inverse(Z)))),Y))).
% 665 [para:591.1.2,17.1.1.1.1.1,demod:16] equal(inverse(multiply(inverse(inverse(multiply(X,inverse(X)))),inverse(inverse(inverse(multiply(multiply(Y,inverse(Y)),Z)))))),Z).
% 2799 [para:591.1.2,72.1.1.1.1.1,demod:16] equal(inverse(multiply(inverse(inverse(multiply(X,inverse(X)))),Y)),inverse(Y)).
% 3034 [para:2799.1.1,665.1.1] equal(inverse(inverse(inverse(inverse(multiply(multiply(X,inverse(X)),Y))))),Y).
% 3132 [para:72.1.1,3034.1.1.1.1.1,demod:3034] equal(inverse(inverse(multiply(X,inverse(X)))),multiply(Y,inverse(Y))).
% 3134 [para:3132.1.2,9.1.1.1.1.1.1.1.1,demod:2799] equal(inverse(multiply(multiply(multiply(inverse(X),Y),inverse(Y)),multiply(Z,inverse(Z)))),X).
% 3154 [para:3132.1.1,17.1.1.1.1.1.1.1.1.2,demod:3134] equal(multiply(multiply(inverse(multiply(X,inverse(X))),multiply(Y,inverse(Y))),Z),Z).
% 3166 [para:3132.1.1,41.1.1.1.2,demod:3154] equal(inverse(multiply(X,inverse(X))),multiply(Y,inverse(Y))).
% 3402 [para:3132.1.1,663.1.1.1.1,demod:2799] equal(inverse(multiply(multiply(X,inverse(X)),Y)),inverse(Y)).
% 3408 [para:3132.1.1,665.1.1.1.1,demod:3402] equal(inverse(inverse(inverse(inverse(X)))),X).
% 3494 [para:9.1.1,3408.1.1.1.1.1] equal(inverse(inverse(inverse(X))),multiply(multiply(multiply(inverse(multiply(multiply(Y,Z),X)),Y),Z),multiply(U,inverse(U)))).
% 3501 [para:16.1.1,3408.1.1.1.1.1,demod:3408] equal(multiply(X,Y),multiply(multiply(multiply(inverse(multiply(Z,inverse(Z))),X),Y),multiply(U,inverse(U)))).
% 3505 [para:17.1.1,3408.1.1.1.1.1,demod:3402] equal(inverse(inverse(inverse(X))),multiply(multiply(multiply(inverse(X),Y),inverse(Y)),multiply(Z,inverse(Z)))).
% 3595 [para:663.1.1,3408.1.1.1.1.1,demod:3408,2799] equal(X,multiply(inverse(inverse(multiply(Y,inverse(Y)))),X)).
% 3624 [para:3408.1.1,3034.1.1] equal(multiply(multiply(X,inverse(X)),Y),Y).
% 3630 [para:3624.1.1,16.1.1.1.1,demod:3595] equal(inverse(multiply(X,multiply(Y,inverse(Y)))),inverse(X)).
% 3632 [para:3624.1.1,17.1.1.1.1.1.1.1.1,demod:3408,3505] equal(multiply(inverse(multiply(X,inverse(X))),Y),Y).
% 3720 [para:28.1.1,16.1.1.1.2,demod:3632] equal(inverse(multiply(multiply(X,Y),multiply(multiply(multiply(Z,U),multiply(V,inverse(V))),inverse(multiply(Z,U))))),inverse(multiply(X,Y))).
% 3724 [para:28.1.1,17.1.1.1.2,demod:3720,3632,3624] equal(inverse(multiply(multiply(inverse(X),Y),inverse(Y))),X).
% 3855 [para:3166.1.1,17.1.1.1.1.2,demod:3630,3624] equal(inverse(inverse(X)),X).
% 3879 [?] ?
% 3880 [para:3855.1.1,17.1.1.1.1.1.1.1.1.2,demod:3855,3505] equal(multiply(multiply(inverse(X),X),Y),Y).
% 3897 [para:3855.1.1,18.1.2.2,demod:3855,3494] equal(multiply(inverse(X),X),multiply(inverse(Y),Y)).
% 3914 [para:72.1.1,3855.1.1.1,demod:3632,3624,3855] equal(X,multiply(X,multiply(Y,inverse(Y)))).
% 3965 [para:3914.1.2,9.1.1.1.1,demod:3879,3914] equal(inverse(multiply(inverse(multiply(X,Y)),X)),Y).
% 4015 [para:3965.1.1,3408.1.1.1.1.1,demod:3855] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 4016 [para:3965.1.1,3965.1.1.1.1] equal(inverse(multiply(X,inverse(multiply(Y,X)))),Y).
% 4031 [para:3965.1.1,4015.1.2.1] equal(inverse(X),multiply(Y,inverse(multiply(X,Y)))).
% 4033 [para:4016.1.1,9.1.1.1.1.1.1,demod:3879] equal(inverse(multiply(multiply(X,Y),Z)),inverse(multiply(X,multiply(Y,Z)))).
% 4070 [para:3724.1.1,4015.1.2.1,demod:3855] equal(X,multiply(Y,multiply(inverse(Y),X))).
% 4071 [para:4015.1.2,3724.1.1.1.1] equal(inverse(multiply(inverse(X),inverse(Y))),multiply(Y,X)).
% 4073 [para:9.1.1,4070.1.2.2.1,demod:3914,4015,4033] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 4094 [para:4031.1.2,4070.1.2.2] equal(inverse(multiply(X,inverse(Y))),multiply(Y,inverse(X))).
% 4102 [para:4073.1.2,4015.1.2.1.1] equal(inverse(multiply(X,Y)),multiply(inverse(Y),inverse(X))).
% 4125 [para:16.1.1,4071.1.1.1.2,demod:3879,3624,4094,3855,4033,4102] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 4151 [input:10,cut:3880,cut:3897] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 4152 [para:3501.1.1,4151.1.2,demod:3879,3624,4094,4125,cut:8] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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 9
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 266
% derived clauses: 265669
% kept clauses: 4135
% kept size sum: 122979
% kept mid-nuclei: 4
% kept new demods: 202
% forw unit-subs: 247397
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 7
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 7.59
% process. runtime: 7.56
% 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/GRP059-1+eq_r.in")
%
%------------------------------------------------------------------------------