TSTP Solution File: GRP288-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP288-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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 288.5s
% Output : Assurance 288.5s
% 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/GRP288-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 3 19)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 19)
% (binary-posweight-lex-big-order 30 #f 3 19)
% (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(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(multiply(U,sk_c6),sk_c7) | -equal(inverse(U),sk_c6).
% was split for some strategies as:
% -equal(multiply(U,sk_c6),sk_c7) | -equal(inverse(U),sk_c6).
% -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7).
% -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6).
% -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% -equal(multiply(sk_c7,sk_c6),sk_c5).
% -equal(multiply(sk_c6,sk_c7),sk_c5).
%
% Starting a split proof attempt with 6 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(multiply(U,sk_c6),sk_c7) | -equal(inverse(U),sk_c6).
% Split part used next: -equal(multiply(U,sk_c6),sk_c7) | -equal(inverse(U),sk_c6).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,1,65,0,1,570,50,4,605,0,4,1125,50,8,1160,0,8,1685,50,12,1720,0,13,2251,50,19,2286,0,19,2824,50,25,2859,0,25,3405,50,36,3440,0,36,3994,50,59,4029,0,59,4593,50,110,4628,0,110,5202,50,220,5237,0,220,5823,50,417,5858,0,417,6456,50,785,6456,40,785,6491,0,785,16418,3,1086,17257,4,1236,18004,5,1386,18005,1,1386,18005,50,1386,18005,40,1386,18040,0,1386,18241,3,1700,18249,4,1846,18257,5,1987,18257,1,1987,18257,50,1987,18257,40,1987,18292,0,1987,41270,3,3489,42627,4,4238,43817,1,4988,43817,50,4988,43817,40,4988,43852,0,4988,58833,3,5739,59823,4,6114,60664,5,6489,60665,1,6489,60665,50,6489,60665,40,6489,60700,0,6489,71909,3,7241,72924,4,7615,74160,1,7990,74160,50,7990,74160,40,7990,74195,0,7990,129170,3,11893,130407,4,13841,131386,5,15791,131387,1,15791,131387,50,15793,131387,40,15793,131422,0,15793,180823,3,18344,181782,4,19619,182527,5,20894,182528,1,20894,182528,50,20896,182528,40,20896,182563,0,20896,226448,3,22397,227190,4,23147,228005,5,23897,228006,1,23897,228006,50,23899,228006,40,23899,228041,0,23899,236733,3,24662,238028,4,25026,238713,5,25400,238713,1,25400,238713,50,25400,238713,40,25400,238748,0,25400,274362,3,26602,275034,4,27201,275661,1,27801,275661,50,27802,275661,40,27802,275696,0,27802,303066,3,28553,303580,4,28928,304084,5,29303,304085,1,29303,304085,50,29304,304085,40,29304,304085,40,29304,304115,0,29304)
%
%
% START OF PROOF
% 304087 [] equal(multiply(identity,X),X).
% 304088 [] equal(multiply(inverse(X),X),identity).
% 304089 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 304090 [] -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c6).
% 304091 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 304092 [?] ?
% 304096 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c4),sk_c6).
% 304097 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(multiply(sk_c4,sk_c6),sk_c7).
% 304101 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 304102 [?] ?
% 304106 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 304107 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c4,sk_c6),sk_c7).
% 304111 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c4),sk_c6).
% 304112 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c4,sk_c6),sk_c7).
% 304119 [hyper:304090,304091,binarycut:304092] equal(inverse(sk_c2),sk_c6).
% 304121 [para:304119.1.1,304088.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 304128 [hyper:304090,304101,binarycut:304102] equal(inverse(sk_c1),sk_c7).
% 304129 [para:304128.1.1,304088.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 304136 [hyper:304090,304097,304096] equal(multiply(sk_c2,sk_c6),sk_c5).
% 304144 [hyper:304090,304107,304106] equal(multiply(sk_c1,sk_c7),sk_c6).
% 304147 [hyper:304090,304112,304111] equal(multiply(sk_c7,sk_c6),sk_c5).
% 304148 [para:304088.1.1,304089.1.1.1,demod:304087] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 304149 [para:304121.1.1,304089.1.1.1,demod:304087] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 304151 [para:304136.1.1,304089.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c2,multiply(sk_c6,X))).
% 304154 [para:304136.1.1,304149.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 304159 [para:304144.1.1,304148.1.2.2,demod:304147,304128] equal(sk_c7,sk_c5).
% 304162 [para:304159.1.1,304129.1.1.1] equal(multiply(sk_c5,sk_c1),identity).
% 304164 [para:304159.1.1,304147.1.1.1] equal(multiply(sk_c5,sk_c6),sk_c5).
% 304170 [para:304164.1.1,304148.1.2.2,demod:304088] equal(sk_c6,identity).
% 304171 [para:304170.1.1,304121.1.1.1,demod:304087] equal(sk_c2,identity).
% 304172 [para:304170.1.1,304136.1.1.2] equal(multiply(sk_c2,identity),sk_c5).
% 304175 [para:304170.1.1,304154.1.2.1,demod:304087] equal(sk_c6,sk_c5).
% 304177 [para:304121.1.1,304151.1.2.2,demod:304172] equal(multiply(sk_c5,sk_c2),sk_c5).
% 304179 [para:304171.1.1,304119.1.1.1] equal(inverse(identity),sk_c6).
% 304182 [para:304175.1.1,304121.1.1.1,demod:304177] equal(sk_c5,identity).
% 304186 [para:304182.1.1,304162.1.1.1,demod:304087] equal(sk_c1,identity).
% 304193 [para:304186.1.1,304128.1.1.1,demod:304179] equal(sk_c6,sk_c7).
% 304200 [hyper:304090,304179,demod:304087,cut:304193] 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 19
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(multiply(U,sk_c6),sk_c7) | -equal(inverse(U),sk_c6).
% Split part used next: -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7).
% END OF PROOFPART
% 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 19
% clause depth limited to 3
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 4
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,1,65,0,1,570,50,4,605,0,4,1125,50,8,1160,0,8,1685,50,12,1720,0,13,2251,50,19,2286,0,19,2824,50,25,2859,0,25,3405,50,36,3440,0,36,3994,50,59,4029,0,59,4593,50,110,4628,0,110,5202,50,220,5237,0,220,5823,50,417,5858,0,417,6456,50,785,6456,40,785,6491,0,785,16418,3,1086,17257,4,1236,18004,5,1386,18005,1,1386,18005,50,1386,18005,40,1386,18040,0,1386,18241,3,1700,18249,4,1846,18257,5,1987,18257,1,1987,18257,50,1987,18257,40,1987,18292,0,1987,41270,3,3489,42627,4,4238,43817,1,4988,43817,50,4988,43817,40,4988,43852,0,4988,58833,3,5739,59823,4,6114,60664,5,6489,60665,1,6489,60665,50,6489,60665,40,6489,60700,0,6489,71909,3,7241,72924,4,7615,74160,1,7990,74160,50,7990,74160,40,7990,74195,0,7990,129170,3,11893,130407,4,13841,131386,5,15791,131387,1,15791,131387,50,15793,131387,40,15793,131422,0,15793,180823,3,18344,181782,4,19619,182527,5,20894,182528,1,20894,182528,50,20896,182528,40,20896,182563,0,20896,226448,3,22397,227190,4,23147,228005,5,23897,228006,1,23897,228006,50,23899,228006,40,23899,228041,0,23899,236733,3,24662,238028,4,25026,238713,5,25400,238713,1,25400,238713,50,25400,238713,40,25400,238748,0,25400,274362,3,26602,275034,4,27201,275661,1,27801,275661,50,27802,275661,40,27802,275696,0,27802,303066,3,28553,303580,4,28928,304084,5,29303,304085,1,29303,304085,50,29304,304085,40,29304,304085,40,29304,304115,0,29304,304199,50,29304,304199,30,29304,304199,40,29304,304229,0,29304,304335,50,29304,304365,0,29309)
%
%
% START OF PROOF
% 304337 [] equal(multiply(identity,X),X).
% 304338 [] equal(multiply(inverse(X),X),identity).
% 304339 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 304340 [] -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 304343 [?] ?
% 304344 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 304348 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 304349 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c3),sk_c7).
% 304353 [?] ?
% 304354 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 304358 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 304359 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 304363 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 304364 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c3),sk_c7).
% 304369 [hyper:304340,304344,binarycut:304343] equal(inverse(sk_c2),sk_c6).
% 304371 [para:304369.1.1,304338.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 304379 [hyper:304340,304354,binarycut:304353] equal(inverse(sk_c1),sk_c7).
% 304382 [para:304379.1.1,304338.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 304400 [hyper:304340,304348,304349] equal(multiply(sk_c2,sk_c6),sk_c5).
% 304406 [hyper:304340,304358,304359] equal(multiply(sk_c1,sk_c7),sk_c6).
% 304412 [hyper:304340,304363,304364] equal(multiply(sk_c7,sk_c6),sk_c5).
% 304413 [para:304338.1.1,304339.1.1.1,demod:304337] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 304414 [para:304371.1.1,304339.1.1.1,demod:304337] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 304416 [para:304400.1.1,304339.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c2,multiply(sk_c6,X))).
% 304417 [para:304406.1.1,304339.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c1,multiply(sk_c7,X))).
% 304419 [para:304400.1.1,304414.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 304422 [para:304338.1.1,304413.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 304424 [para:304382.1.1,304413.1.2.2] equal(sk_c1,multiply(inverse(sk_c7),identity)).
% 304425 [para:304406.1.1,304413.1.2.2,demod:304412,304379] equal(sk_c7,sk_c5).
% 304426 [para:304339.1.1,304413.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 304429 [para:304413.1.2,304413.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 304430 [para:304425.1.1,304382.1.1.1] equal(multiply(sk_c5,sk_c1),identity).
% 304431 [para:304425.1.1,304406.1.1.2] equal(multiply(sk_c1,sk_c5),sk_c6).
% 304432 [para:304425.1.1,304412.1.1.1] equal(multiply(sk_c5,sk_c6),sk_c5).
% 304435 [para:304430.1.1,304413.1.2.2] equal(sk_c1,multiply(inverse(sk_c5),identity)).
% 304438 [para:304432.1.1,304413.1.2.2,demod:304338] equal(sk_c6,identity).
% 304439 [para:304438.1.1,304371.1.1.1,demod:304337] equal(sk_c2,identity).
% 304440 [para:304438.1.1,304400.1.1.2] equal(multiply(sk_c2,identity),sk_c5).
% 304442 [para:304438.1.1,304414.1.2.1,demod:304337] equal(X,multiply(sk_c2,X)).
% 304443 [para:304438.1.1,304419.1.2.1,demod:304337] equal(sk_c6,sk_c5).
% 304445 [para:304371.1.1,304416.1.2.2,demod:304440] equal(multiply(sk_c5,sk_c2),sk_c5).
% 304449 [para:304439.1.1,304414.1.2.2.1,demod:304337] equal(X,multiply(sk_c6,X)).
% 304450 [para:304443.1.1,304371.1.1.1,demod:304445] equal(sk_c5,identity).
% 304455 [para:304450.1.1,304431.1.1.2] equal(multiply(sk_c1,identity),sk_c6).
% 304460 [para:304382.1.1,304417.1.2.2,demod:304455,304449] equal(sk_c1,sk_c6).
% 304464 [para:304460.1.2,304400.1.1.2,demod:304442] equal(sk_c1,sk_c5).
% 304467 [para:304464.1.1,304379.1.1.1] equal(inverse(sk_c5),sk_c7).
% 304480 [para:304414.1.2,304426.1.2.2.2,demod:304442] equal(X,multiply(inverse(multiply(Y,sk_c6)),multiply(Y,X))).
% 304489 [para:304429.1.2,304338.1.1] equal(multiply(X,inverse(X)),identity).
% 304491 [para:304429.1.2,304422.1.2] equal(X,multiply(X,identity)).
% 304494 [para:304491.1.2,304422.1.2] equal(X,inverse(inverse(X))).
% 304495 [para:304491.1.2,304424.1.2] equal(sk_c1,inverse(sk_c7)).
% 304496 [para:304491.1.2,304435.1.2,demod:304467] equal(sk_c1,sk_c7).
% 304504 [para:304489.1.1,304480.1.2.2,demod:304491] equal(inverse(X),inverse(multiply(X,sk_c6))).
% 304513 [para:304504.1.2,304422.1.2.1.1,demod:304491,304494] equal(multiply(X,sk_c6),X).
% 304515 [hyper:304340,304513,demod:304495,cut:304496] 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 19
% clause depth limited to 4
% seconds given: 4
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(multiply(U,sk_c6),sk_c7) | -equal(inverse(U),sk_c6).
% Split part used next: -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6).
% END OF PROOFPART
% 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 19
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,1,65,0,1,570,50,4,605,0,4,1125,50,8,1160,0,8,1685,50,12,1720,0,13,2251,50,19,2286,0,19,2824,50,25,2859,0,25,3405,50,36,3440,0,36,3994,50,59,4029,0,59,4593,50,110,4628,0,110,5202,50,220,5237,0,220,5823,50,417,5858,0,417,6456,50,785,6456,40,785,6491,0,785,16418,3,1086,17257,4,1236,18004,5,1386,18005,1,1386,18005,50,1386,18005,40,1386,18040,0,1386,18241,3,1700,18249,4,1846,18257,5,1987,18257,1,1987,18257,50,1987,18257,40,1987,18292,0,1987,41270,3,3489,42627,4,4238,43817,1,4988,43817,50,4988,43817,40,4988,43852,0,4988,58833,3,5739,59823,4,6114,60664,5,6489,60665,1,6489,60665,50,6489,60665,40,6489,60700,0,6489,71909,3,7241,72924,4,7615,74160,1,7990,74160,50,7990,74160,40,7990,74195,0,7990,129170,3,11893,130407,4,13841,131386,5,15791,131387,1,15791,131387,50,15793,131387,40,15793,131422,0,15793,180823,3,18344,181782,4,19619,182527,5,20894,182528,1,20894,182528,50,20896,182528,40,20896,182563,0,20896,226448,3,22397,227190,4,23147,228005,5,23897,228006,1,23897,228006,50,23899,228006,40,23899,228041,0,23899,236733,3,24662,238028,4,25026,238713,5,25400,238713,1,25400,238713,50,25400,238713,40,25400,238748,0,25400,274362,3,26602,275034,4,27201,275661,1,27801,275661,50,27802,275661,40,27802,275696,0,27802,303066,3,28553,303580,4,28928,304084,5,29303,304085,1,29303,304085,50,29304,304085,40,29304,304085,40,29304,304115,0,29304,304199,50,29304,304199,30,29304,304199,40,29304,304229,0,29304,304335,50,29304,304365,0,29309,304514,50,29310,304514,30,29310,304514,40,29310,304544,0,29310)
%
%
% START OF PROOF
% 304515 [] equal(X,X).
% 304516 [] equal(multiply(identity,X),X).
% 304517 [] equal(multiply(inverse(X),X),identity).
% 304518 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 304519 [] -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c6).
% 304520 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 304521 [] equal(multiply(sk_c4,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c6).
% 304522 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c6).
% 304523 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 304524 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c2),sk_c6).
% 304525 [?] ?
% 304526 [?] ?
% 304527 [?] ?
% 304528 [?] ?
% 304529 [?] ?
% 304547 [hyper:304519,304520,binarycut:304525] equal(inverse(sk_c4),sk_c6).
% 304550 [para:304547.1.1,304517.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 304554 [hyper:304519,304523,binarycut:304528] equal(inverse(sk_c3),sk_c7).
% 304555 [para:304554.1.1,304517.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 304558 [hyper:304519,304521,binarycut:304526] equal(multiply(sk_c4,sk_c6),sk_c7).
% 304561 [hyper:304519,304522,binarycut:304527] equal(multiply(sk_c3,sk_c6),sk_c7).
% 304564 [hyper:304519,304524,binarycut:304529] equal(multiply(sk_c6,sk_c7),sk_c5).
% 304565 [para:304517.1.1,304518.1.1.1,demod:304516] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 304566 [para:304550.1.1,304518.1.1.1,demod:304516] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 304568 [para:304558.1.1,304518.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c4,multiply(sk_c6,X))).
% 304570 [para:304564.1.1,304518.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c6,multiply(sk_c7,X))).
% 304571 [para:304558.1.1,304566.1.2.2,demod:304564] equal(sk_c6,sk_c5).
% 304573 [para:304571.1.1,304558.1.1.2] equal(multiply(sk_c4,sk_c5),sk_c7).
% 304574 [para:304571.1.1,304561.1.1.2] equal(multiply(sk_c3,sk_c5),sk_c7).
% 304575 [para:304571.1.1,304564.1.1.1] equal(multiply(sk_c5,sk_c7),sk_c5).
% 304578 [para:304550.1.1,304565.1.2.2] equal(sk_c4,multiply(inverse(sk_c6),identity)).
% 304580 [para:304561.1.1,304565.1.2.2,demod:304554] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 304581 [para:304564.1.1,304565.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 304589 [para:304575.1.1,304565.1.2.2,demod:304517] equal(sk_c7,identity).
% 304590 [para:304589.1.1,304555.1.1.1,demod:304516] equal(sk_c3,identity).
% 304595 [para:304564.1.1,304568.1.2.2,demod:304573,304580] equal(sk_c6,sk_c7).
% 304596 [para:304568.1.2,304566.1.2.2,demod:304570] equal(multiply(sk_c6,X),multiply(sk_c5,X)).
% 304601 [para:304590.1.1,304574.1.1.1,demod:304516] equal(sk_c5,sk_c7).
% 304603 [para:304595.1.2,304564.1.1.2,demod:304596] equal(multiply(sk_c5,sk_c6),sk_c5).
% 304606 [para:304601.1.2,304589.1.1] equal(sk_c5,identity).
% 304620 [para:304606.1.1,304581.1.2.2,demod:304578] equal(sk_c7,sk_c4).
% 304623 [para:304620.1.1,304601.1.2] equal(sk_c5,sk_c4).
% 304628 [para:304623.1.2,304547.1.1.1] equal(inverse(sk_c5),sk_c6).
% 304630 [hyper:304519,304628,demod:304603,cut:304515] 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 19
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 4 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(multiply(U,sk_c6),sk_c7) | -equal(inverse(U),sk_c6).
% Split part used next: -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% END OF PROOFPART
% 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 19
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,1,65,0,1,570,50,4,605,0,4,1125,50,8,1160,0,8,1685,50,12,1720,0,13,2251,50,19,2286,0,19,2824,50,25,2859,0,25,3405,50,36,3440,0,36,3994,50,59,4029,0,59,4593,50,110,4628,0,110,5202,50,220,5237,0,220,5823,50,417,5858,0,417,6456,50,785,6456,40,785,6491,0,785,16418,3,1086,17257,4,1236,18004,5,1386,18005,1,1386,18005,50,1386,18005,40,1386,18040,0,1386,18241,3,1700,18249,4,1846,18257,5,1987,18257,1,1987,18257,50,1987,18257,40,1987,18292,0,1987,41270,3,3489,42627,4,4238,43817,1,4988,43817,50,4988,43817,40,4988,43852,0,4988,58833,3,5739,59823,4,6114,60664,5,6489,60665,1,6489,60665,50,6489,60665,40,6489,60700,0,6489,71909,3,7241,72924,4,7615,74160,1,7990,74160,50,7990,74160,40,7990,74195,0,7990,129170,3,11893,130407,4,13841,131386,5,15791,131387,1,15791,131387,50,15793,131387,40,15793,131422,0,15793,180823,3,18344,181782,4,19619,182527,5,20894,182528,1,20894,182528,50,20896,182528,40,20896,182563,0,20896,226448,3,22397,227190,4,23147,228005,5,23897,228006,1,23897,228006,50,23899,228006,40,23899,228041,0,23899,236733,3,24662,238028,4,25026,238713,5,25400,238713,1,25400,238713,50,25400,238713,40,25400,238748,0,25400,274362,3,26602,275034,4,27201,275661,1,27801,275661,50,27802,275661,40,27802,275696,0,27802,303066,3,28553,303580,4,28928,304084,5,29303,304085,1,29303,304085,50,29304,304085,40,29304,304085,40,29304,304115,0,29304,304199,50,29304,304199,30,29304,304199,40,29304,304229,0,29304,304335,50,29304,304365,0,29309,304514,50,29310,304514,30,29310,304514,40,29310,304544,0,29310,304629,50,29310,304629,30,29310,304629,40,29310,304659,0,29310)
%
%
% START OF PROOF
% 304631 [] equal(multiply(identity,X),X).
% 304632 [] equal(multiply(inverse(X),X),identity).
% 304633 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 304634 [] -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 304645 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 304646 [] equal(multiply(sk_c4,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 304647 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 304648 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 304649 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c1),sk_c7).
% 304650 [?] ?
% 304651 [?] ?
% 304652 [?] ?
% 304653 [?] ?
% 304654 [?] ?
% 304666 [hyper:304634,304645,binarycut:304650] equal(inverse(sk_c4),sk_c6).
% 304667 [para:304666.1.1,304632.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 304670 [hyper:304634,304648,binarycut:304653] equal(inverse(sk_c3),sk_c7).
% 304674 [para:304670.1.1,304632.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 304681 [hyper:304634,304646,binarycut:304651] equal(multiply(sk_c4,sk_c6),sk_c7).
% 304684 [hyper:304634,304647,binarycut:304652] equal(multiply(sk_c3,sk_c6),sk_c7).
% 304688 [hyper:304634,304649,binarycut:304654] equal(multiply(sk_c6,sk_c7),sk_c5).
% 304689 [para:304632.1.1,304633.1.1.1,demod:304631] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 304690 [para:304667.1.1,304633.1.1.1,demod:304631] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 304692 [para:304681.1.1,304633.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c4,multiply(sk_c6,X))).
% 304695 [para:304681.1.1,304690.1.2.2,demod:304688] equal(sk_c6,sk_c5).
% 304697 [para:304695.1.1,304681.1.1.2] equal(multiply(sk_c4,sk_c5),sk_c7).
% 304699 [para:304695.1.1,304688.1.1.1] equal(multiply(sk_c5,sk_c7),sk_c5).
% 304704 [para:304684.1.1,304689.1.2.2,demod:304670] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 304713 [para:304699.1.1,304689.1.2.2,demod:304632] equal(sk_c7,identity).
% 304714 [para:304713.1.1,304674.1.1.1,demod:304631] equal(sk_c3,identity).
% 304719 [para:304688.1.1,304692.1.2.2,demod:304697,304704] equal(sk_c6,sk_c7).
% 304722 [para:304714.1.1,304670.1.1.1] equal(inverse(identity),sk_c7).
% 304729 [para:304719.1.2,304713.1.1] equal(sk_c6,identity).
% 304731 [para:304729.1.1,304667.1.1.1,demod:304631] equal(sk_c4,identity).
% 304737 [para:304731.1.1,304666.1.1.1,demod:304722] equal(sk_c7,sk_c6).
% 304739 [hyper:304634,304722,demod:304631,cut:304737] 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 19
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(multiply(U,sk_c6),sk_c7) | -equal(inverse(U),sk_c6).
% Split part used next: -equal(multiply(sk_c7,sk_c6),sk_c5).
% END OF PROOFPART
% 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 19
% clause depth limited to 3
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 4
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 5
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 6
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 7
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 8
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 9
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 10
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 11
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,1,65,0,1,570,50,4,605,0,4,1125,50,8,1160,0,8,1685,50,12,1720,0,13,2251,50,19,2286,0,19,2824,50,25,2859,0,25,3405,50,36,3440,0,36,3994,50,59,4029,0,59,4593,50,110,4628,0,110,5202,50,220,5237,0,220,5823,50,417,5858,0,417,6456,50,785,6456,40,785,6491,0,785,16418,3,1086,17257,4,1236,18004,5,1386,18005,1,1386,18005,50,1386,18005,40,1386,18040,0,1386,18241,3,1700,18249,4,1846,18257,5,1987,18257,1,1987,18257,50,1987,18257,40,1987,18292,0,1987,41270,3,3489,42627,4,4238,43817,1,4988,43817,50,4988,43817,40,4988,43852,0,4988,58833,3,5739,59823,4,6114,60664,5,6489,60665,1,6489,60665,50,6489,60665,40,6489,60700,0,6489,71909,3,7241,72924,4,7615,74160,1,7990,74160,50,7990,74160,40,7990,74195,0,7990,129170,3,11893,130407,4,13841,131386,5,15791,131387,1,15791,131387,50,15793,131387,40,15793,131422,0,15793,180823,3,18344,181782,4,19619,182527,5,20894,182528,1,20894,182528,50,20896,182528,40,20896,182563,0,20896,226448,3,22397,227190,4,23147,228005,5,23897,228006,1,23897,228006,50,23899,228006,40,23899,228041,0,23899,236733,3,24662,238028,4,25026,238713,5,25400,238713,1,25400,238713,50,25400,238713,40,25400,238748,0,25400,274362,3,26602,275034,4,27201,275661,1,27801,275661,50,27802,275661,40,27802,275696,0,27802,303066,3,28553,303580,4,28928,304084,5,29303,304085,1,29303,304085,50,29304,304085,40,29304,304085,40,29304,304115,0,29304,304199,50,29304,304199,30,29304,304199,40,29304,304229,0,29304,304335,50,29304,304365,0,29309,304514,50,29310,304514,30,29310,304514,40,29310,304544,0,29310,304629,50,29310,304629,30,29310,304629,40,29310,304659,0,29310,304738,50,29310,304738,30,29310,304738,40,29310,304768,0,29315,304866,50,29316,304896,0,29316,305038,50,29319,305068,0,29323,305218,50,29327,305248,0,29327,305406,50,29332,305436,0,29332,305600,50,29340,305630,0,29344,305802,50,29359,305832,0,29359,306012,50,29389,306042,0,29393,306232,50,29451,306262,0,29451,306462,50,29567,306462,40,29567,306492,0,29567)
%
%
% START OF PROOF
% 306464 [] equal(multiply(identity,X),X).
% 306465 [] equal(multiply(inverse(X),X),identity).
% 306466 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 306467 [] -equal(multiply(sk_c7,sk_c6),sk_c5).
% 306488 [?] ?
% 306489 [?] ?
% 306492 [?] ?
% 306526 [input:306488,cut:306467] equal(inverse(sk_c4),sk_c6).
% 306527 [para:306526.1.1,306465.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 306539 [input:306489,cut:306467] equal(multiply(sk_c4,sk_c6),sk_c7).
% 306541 [input:306492,cut:306467] equal(multiply(sk_c6,sk_c7),sk_c5).
% 306542 [para:306465.1.1,306466.1.1.1,demod:306464] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 306555 [para:306527.1.1,306466.1.1.1,demod:306464] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 306578 [para:306539.1.1,306555.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c7)).
% 306585 [para:306578.1.2,306541.1.1] equal(sk_c6,sk_c5).
% 306609 [para:306585.1.1,306541.1.1.1] equal(multiply(sk_c5,sk_c7),sk_c5).
% 306673 [para:306609.1.1,306542.1.2.2,demod:306465] equal(sk_c7,identity).
% 306679 [para:306673.1.1,306467.1.1.1,demod:306464,cut:306585] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% Split component 6 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(multiply(U,sk_c6),sk_c7) | -equal(inverse(U),sk_c6).
% Split part used next: -equal(multiply(sk_c6,sk_c7),sk_c5).
% END OF PROOFPART
% 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 19
% clause depth limited to 3
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 4
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 5
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 6
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 7
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 8
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 9
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 10
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% 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 19
% clause depth limited to 11
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,1,65,0,1,570,50,4,605,0,4,1125,50,8,1160,0,8,1685,50,12,1720,0,13,2251,50,19,2286,0,19,2824,50,25,2859,0,25,3405,50,36,3440,0,36,3994,50,59,4029,0,59,4593,50,110,4628,0,110,5202,50,220,5237,0,220,5823,50,417,5858,0,417,6456,50,785,6456,40,785,6491,0,785,16418,3,1086,17257,4,1236,18004,5,1386,18005,1,1386,18005,50,1386,18005,40,1386,18040,0,1386,18241,3,1700,18249,4,1846,18257,5,1987,18257,1,1987,18257,50,1987,18257,40,1987,18292,0,1987,41270,3,3489,42627,4,4238,43817,1,4988,43817,50,4988,43817,40,4988,43852,0,4988,58833,3,5739,59823,4,6114,60664,5,6489,60665,1,6489,60665,50,6489,60665,40,6489,60700,0,6489,71909,3,7241,72924,4,7615,74160,1,7990,74160,50,7990,74160,40,7990,74195,0,7990,129170,3,11893,130407,4,13841,131386,5,15791,131387,1,15791,131387,50,15793,131387,40,15793,131422,0,15793,180823,3,18344,181782,4,19619,182527,5,20894,182528,1,20894,182528,50,20896,182528,40,20896,182563,0,20896,226448,3,22397,227190,4,23147,228005,5,23897,228006,1,23897,228006,50,23899,228006,40,23899,228041,0,23899,236733,3,24662,238028,4,25026,238713,5,25400,238713,1,25400,238713,50,25400,238713,40,25400,238748,0,25400,274362,3,26602,275034,4,27201,275661,1,27801,275661,50,27802,275661,40,27802,275696,0,27802,303066,3,28553,303580,4,28928,304084,5,29303,304085,1,29303,304085,50,29304,304085,40,29304,304085,40,29304,304115,0,29304,304199,50,29304,304199,30,29304,304199,40,29304,304229,0,29304,304335,50,29304,304365,0,29309,304514,50,29310,304514,30,29310,304514,40,29310,304544,0,29310,304629,50,29310,304629,30,29310,304629,40,29310,304659,0,29310,304738,50,29310,304738,30,29310,304738,40,29310,304768,0,29315,304866,50,29316,304896,0,29316,305038,50,29319,305068,0,29323,305218,50,29327,305248,0,29327,305406,50,29332,305436,0,29332,305600,50,29340,305630,0,29344,305802,50,29359,305832,0,29359,306012,50,29389,306042,0,29393,306232,50,29451,306262,0,29451,306462,50,29567,306462,40,29567,306492,0,29567,306678,50,29568,306678,30,29568,306678,40,29568,306708,0,29568,306805,50,29568,306835,0,29572,306978,50,29575,307008,0,29575,307159,50,29578,307189,0,29578,307348,50,29583,307378,0,29587,307543,50,29596,307573,0,29596,307746,50,29612,307776,0,29616,307957,50,29645,307987,0,29645,308178,50,29707,308208,0,29707,308409,50,29824,308409,40,29824,308439,0,29824)
%
%
% START OF PROOF
% 308281 [?] ?
% 308411 [] equal(multiply(identity,X),X).
% 308412 [] equal(multiply(inverse(X),X),identity).
% 308413 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 308414 [] -equal(multiply(sk_c6,sk_c7),sk_c5).
% 308419 [?] ?
% 308424 [?] ?
% 308429 [?] ?
% 308434 [?] ?
% 308439 [?] ?
% 308456 [input:308419,cut:308414] equal(inverse(sk_c2),sk_c6).
% 308457 [para:308456.1.1,308412.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 308466 [input:308429,cut:308414] equal(inverse(sk_c1),sk_c7).
% 308467 [para:308466.1.1,308412.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 308480 [input:308424,cut:308414] equal(multiply(sk_c2,sk_c6),sk_c5).
% 308485 [input:308434,cut:308414] equal(multiply(sk_c1,sk_c7),sk_c6).
% 308488 [input:308439,cut:308414] equal(multiply(sk_c7,sk_c6),sk_c5).
% 308493 [para:308457.1.1,308413.1.1.1,demod:308411] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 308499 [para:308467.1.1,308413.1.1.1,demod:308411] equal(X,multiply(sk_c7,multiply(sk_c1,X))).
% 308525 [para:308480.1.1,308493.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 308531 [para:308485.1.1,308499.1.2.2] equal(sk_c7,multiply(sk_c7,sk_c6)).
% 308536 [para:308531.1.2,308488.1.1] equal(sk_c7,sk_c5).
% 308538 [para:308536.1.1,308414.1.1.2,demod:308525,cut:308281] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% Split attempt finished with SUCCESS.
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 36139
% derived clauses: 5886980
% kept clauses: 264866
% kept size sum: 344329
% kept mid-nuclei: 3443
% kept new demods: 4027
% forw unit-subs: 1809599
% forw double-subs: 3425228
% forw overdouble-subs: 343839
% backward subs: 12202
% fast unit cutoff: 27047
% full unit cutoff: 0
% dbl unit cutoff: 5853
% real runtime : 300.13
% process. runtime: 298.24
% specific non-discr-tree subsumption statistics:
% tried: 38067265
% length fails: 4451444
% strength fails: 11706677
% predlist fails: 2911757
% aux str. fails: 4350287
% by-lit fails: 8799631
% full subs tried: 1293029
% full subs fail: 1191293
%
% ; 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/GRP288-1+eq_r.in")
%
%------------------------------------------------------------------------------