TSTP Solution File: GRP223-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP223-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 : art02.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 299.8s
% Output : Assurance 299.8s
% 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/GRP223-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 21)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 21)
% (binary-posweight-lex-big-order 30 #f 3 21)
% (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(inverse(X),sk_c9) | -equal(multiply(X,sk_c8),sk_c9) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(U,V),sk_c9) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c9) | -equal(multiply(sk_c9,W),sk_c8) | -equal(multiply(X1,sk_c9),W) | -equal(inverse(X1),sk_c9).
% was split for some strategies as:
% -equal(multiply(sk_c9,W),sk_c8) | -equal(multiply(X1,sk_c9),W) | -equal(inverse(X1),sk_c9).
% -equal(multiply(U,V),sk_c9) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c9).
% -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9).
% -equal(inverse(X),sk_c9) | -equal(multiply(X,sk_c8),sk_c9).
%
% Starting a split proof attempt with 4 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(X),sk_c9) | -equal(multiply(X,sk_c8),sk_c9) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(U,V),sk_c9) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c9) | -equal(multiply(sk_c9,W),sk_c8) | -equal(multiply(X1,sk_c9),W) | -equal(inverse(X1),sk_c9).
% Split part used next: -equal(multiply(sk_c9,W),sk_c8) | -equal(multiply(X1,sk_c9),W) | -equal(inverse(X1),sk_c9).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,1,75,0,1,350285,5,1502,350286,1,1502,350286,50,1502,350286,40,1502,350326,0,1502,362311,3,1803,362968,4,1953,365388,5,2103,365389,1,2103,365389,50,2103,365389,40,2103,365429,0,2103,366199,3,2409,366220,4,2563,366266,5,2704,366266,1,2704,366266,50,2704,366266,40,2704,366306,0,2704,388482,3,4209,389093,4,4955,389366,1,5705,389366,50,5705,389366,40,5705,389406,0,5705,400744,3,6459,401773,4,6831,402865,5,7206,402866,1,7206,402866,50,7206,402866,40,7206,402906,0,7206,416496,3,7958,417448,4,8332,418625,5,8708,418626,5,8708,418627,1,8708,418627,50,8708,418627,40,8708,418667,0,8708,471631,3,12628,472444,4,14559,473342,1,16509,473342,50,16510,473342,40,16510,473382,0,16510,515996,3,19075,516757,4,20336,517504,1,21611,517504,50,21612,517504,40,21612,517544,0,21612,550773,3,23115,551198,4,23863,551712,1,24613,551712,50,24614,551712,40,24614,551752,0,24614,572021,3,25365,572525,4,25740,572836,5,26115,572837,1,26115,572837,50,26116,572837,40,26116,572877,0,26116,596320,3,27317,597021,4,27917,597648,1,28517,597648,50,28518,597648,40,28518,597688,0,28518,610768,3,29269,611734,4,29644,612078,1,30019,612078,50,30019,612078,40,30019,612078,40,30019,612113,0,30019)
%
%
% START OF PROOF
% 612079 [] equal(X,X).
% 612083 [] -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9).
% 612084 [] equal(inverse(sk_c2),sk_c9) | equal(inverse(sk_c6),sk_c9).
% 612085 [] equal(multiply(sk_c6,sk_c9),sk_c7) | equal(inverse(sk_c2),sk_c9).
% 612086 [?] ?
% 612090 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(inverse(sk_c6),sk_c9).
% 612091 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c6,sk_c9),sk_c7).
% 612092 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c9,sk_c7),sk_c8).
% 612096 [?] ?
% 612097 [?] ?
% 612098 [?] ?
% 612143 [hyper:612083,612085,612084,binarycut:612086] equal(inverse(sk_c2),sk_c9).
% 612155 [hyper:612083,612090,demod:612143,cut:612079,binarycut:612096] equal(inverse(sk_c6),sk_c9).
% 612167 [hyper:612083,612091,demod:612143,cut:612079,binarycut:612097] equal(multiply(sk_c6,sk_c9),sk_c7).
% 612185 [hyper:612083,612092,demod:612143,cut:612079,binarycut:612098] equal(multiply(sk_c9,sk_c7),sk_c8).
% 612199 [hyper:612083,612185,612167,demod:612155,cut:612079] 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 21
% clause depth limited to 3
% seconds given: 6
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(X),sk_c9) | -equal(multiply(X,sk_c8),sk_c9) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(U,V),sk_c9) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c9) | -equal(multiply(sk_c9,W),sk_c8) | -equal(multiply(X1,sk_c9),W) | -equal(inverse(X1),sk_c9).
% Split part used next: -equal(multiply(U,V),sk_c9) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c9).
% 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 21
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,1,75,0,1,350285,5,1502,350286,1,1502,350286,50,1502,350286,40,1502,350326,0,1502,362311,3,1803,362968,4,1953,365388,5,2103,365389,1,2103,365389,50,2103,365389,40,2103,365429,0,2103,366199,3,2409,366220,4,2563,366266,5,2704,366266,1,2704,366266,50,2704,366266,40,2704,366306,0,2704,388482,3,4209,389093,4,4955,389366,1,5705,389366,50,5705,389366,40,5705,389406,0,5705,400744,3,6459,401773,4,6831,402865,5,7206,402866,1,7206,402866,50,7206,402866,40,7206,402906,0,7206,416496,3,7958,417448,4,8332,418625,5,8708,418626,5,8708,418627,1,8708,418627,50,8708,418627,40,8708,418667,0,8708,471631,3,12628,472444,4,14559,473342,1,16509,473342,50,16510,473342,40,16510,473382,0,16510,515996,3,19075,516757,4,20336,517504,1,21611,517504,50,21612,517504,40,21612,517544,0,21612,550773,3,23115,551198,4,23863,551712,1,24613,551712,50,24614,551712,40,24614,551752,0,24614,572021,3,25365,572525,4,25740,572836,5,26115,572837,1,26115,572837,50,26116,572837,40,26116,572877,0,26116,596320,3,27317,597021,4,27917,597648,1,28517,597648,50,28518,597648,40,28518,597688,0,28518,610768,3,29269,611734,4,29644,612078,1,30019,612078,50,30019,612078,40,30019,612078,40,30019,612113,0,30019,612198,50,30019,612198,30,30019,612198,40,30019,612233,0,30019)
%
%
% START OF PROOF
% 612199 [] equal(X,X).
% 612200 [] equal(multiply(identity,X),X).
% 612201 [] equal(multiply(inverse(X),X),identity).
% 612202 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 612203 [] -equal(multiply(X,sk_c8),sk_c9) | -equal(multiply(Y,X),sk_c9) | -equal(inverse(Y),X).
% 612207 [?] ?
% 612208 [] equal(inverse(sk_c2),sk_c9) | equal(inverse(sk_c4),sk_c5).
% 612209 [?] ?
% 612213 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c5,sk_c8),sk_c9).
% 612214 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(inverse(sk_c4),sk_c5).
% 612215 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c4,sk_c5),sk_c9).
% 612219 [] equal(multiply(sk_c9,sk_c3),sk_c8) | equal(multiply(sk_c5,sk_c8),sk_c9).
% 612220 [] equal(multiply(sk_c9,sk_c3),sk_c8) | equal(inverse(sk_c4),sk_c5).
% 612221 [] equal(multiply(sk_c9,sk_c3),sk_c8) | equal(multiply(sk_c4,sk_c5),sk_c9).
% 612225 [] equal(multiply(sk_c1,sk_c8),sk_c9) | equal(multiply(sk_c5,sk_c8),sk_c9).
% 612226 [] equal(multiply(sk_c1,sk_c8),sk_c9) | equal(inverse(sk_c4),sk_c5).
% 612227 [] equal(multiply(sk_c1,sk_c8),sk_c9) | equal(multiply(sk_c4,sk_c5),sk_c9).
% 612231 [?] ?
% 612232 [] equal(inverse(sk_c1),sk_c9) | equal(inverse(sk_c4),sk_c5).
% 612233 [?] ?
% 612242 [hyper:612203,612208,binarycut:612209,binarycut:612207] equal(inverse(sk_c2),sk_c9).
% 612245 [para:612242.1.1,612201.1.1.1] equal(multiply(sk_c9,sk_c2),identity).
% 612258 [hyper:612203,612232,binarycut:612233,binarycut:612231] equal(inverse(sk_c1),sk_c9).
% 612261 [para:612258.1.1,612201.1.1.1] equal(multiply(sk_c9,sk_c1),identity).
% 612297 [hyper:612203,612215,612213,612214] equal(multiply(sk_c2,sk_c9),sk_c3).
% 612309 [hyper:612203,612221,612219,612220] equal(multiply(sk_c9,sk_c3),sk_c8).
% 612335 [hyper:612203,612227,612225,612226] equal(multiply(sk_c1,sk_c8),sk_c9).
% 612342 [para:612201.1.1,612202.1.1.1,demod:612200] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 612343 [para:612245.1.1,612202.1.1.1,demod:612200] equal(X,multiply(sk_c9,multiply(sk_c2,X))).
% 612350 [para:612297.1.1,612343.1.2.2,demod:612309] equal(sk_c9,sk_c8).
% 612351 [para:612350.1.1,612245.1.1.1] equal(multiply(sk_c8,sk_c2),identity).
% 612352 [para:612350.1.1,612261.1.1.1] equal(multiply(sk_c8,sk_c1),identity).
% 612353 [para:612350.1.1,612297.1.1.2] equal(multiply(sk_c2,sk_c8),sk_c3).
% 612354 [para:612350.1.1,612309.1.1.1] equal(multiply(sk_c8,sk_c3),sk_c8).
% 612361 [para:612245.1.1,612342.1.2.2] equal(sk_c2,multiply(inverse(sk_c9),identity)).
% 612362 [para:612261.1.1,612342.1.2.2,demod:612361] equal(sk_c1,sk_c2).
% 612367 [para:612362.1.1,612335.1.1.1,demod:612353] equal(sk_c3,sk_c9).
% 612373 [para:612367.1.2,612350.1.1] equal(sk_c3,sk_c8).
% 612374 [para:612373.1.1,612309.1.1.2] equal(multiply(sk_c9,sk_c8),sk_c8).
% 612376 [para:612354.1.1,612342.1.2.2,demod:612201] equal(sk_c3,identity).
% 612379 [para:612376.1.1,612373.1.1] equal(identity,sk_c8).
% 612386 [para:612379.1.2,612351.1.1.1,demod:612200] equal(sk_c2,identity).
% 612387 [para:612379.1.2,612352.1.1.1,demod:612200] equal(sk_c1,identity).
% 612389 [para:612386.1.1,612242.1.1.1] equal(inverse(identity),sk_c9).
% 612392 [para:612387.1.1,612335.1.1.1,demod:612200] equal(sk_c8,sk_c9).
% 612400 [hyper:612203,612389,demod:612374,612200,cut:612199,cut:612392] 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 21
% clause depth limited to 3
% seconds given: 6
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(X),sk_c9) | -equal(multiply(X,sk_c8),sk_c9) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(U,V),sk_c9) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c9) | -equal(multiply(sk_c9,W),sk_c8) | -equal(multiply(X1,sk_c9),W) | -equal(inverse(X1),sk_c9).
% Split part used next: -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9).
% 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 21
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,1,75,0,1,350285,5,1502,350286,1,1502,350286,50,1502,350286,40,1502,350326,0,1502,362311,3,1803,362968,4,1953,365388,5,2103,365389,1,2103,365389,50,2103,365389,40,2103,365429,0,2103,366199,3,2409,366220,4,2563,366266,5,2704,366266,1,2704,366266,50,2704,366266,40,2704,366306,0,2704,388482,3,4209,389093,4,4955,389366,1,5705,389366,50,5705,389366,40,5705,389406,0,5705,400744,3,6459,401773,4,6831,402865,5,7206,402866,1,7206,402866,50,7206,402866,40,7206,402906,0,7206,416496,3,7958,417448,4,8332,418625,5,8708,418626,5,8708,418627,1,8708,418627,50,8708,418627,40,8708,418667,0,8708,471631,3,12628,472444,4,14559,473342,1,16509,473342,50,16510,473342,40,16510,473382,0,16510,515996,3,19075,516757,4,20336,517504,1,21611,517504,50,21612,517504,40,21612,517544,0,21612,550773,3,23115,551198,4,23863,551712,1,24613,551712,50,24614,551712,40,24614,551752,0,24614,572021,3,25365,572525,4,25740,572836,5,26115,572837,1,26115,572837,50,26116,572837,40,26116,572877,0,26116,596320,3,27317,597021,4,27917,597648,1,28517,597648,50,28518,597648,40,28518,597688,0,28518,610768,3,29269,611734,4,29644,612078,1,30019,612078,50,30019,612078,40,30019,612078,40,30019,612113,0,30019,612198,50,30019,612198,30,30019,612198,40,30019,612233,0,30019,612399,50,30020,612399,30,30020,612399,40,30020,612434,0,30024)
%
%
% START OF PROOF
% 612400 [] equal(X,X).
% 612404 [] -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9).
% 612405 [] equal(inverse(sk_c2),sk_c9) | equal(inverse(sk_c6),sk_c9).
% 612406 [] equal(multiply(sk_c6,sk_c9),sk_c7) | equal(inverse(sk_c2),sk_c9).
% 612407 [?] ?
% 612411 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(inverse(sk_c6),sk_c9).
% 612412 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c6,sk_c9),sk_c7).
% 612413 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c9,sk_c7),sk_c8).
% 612417 [?] ?
% 612418 [?] ?
% 612419 [?] ?
% 612464 [hyper:612404,612406,612405,binarycut:612407] equal(inverse(sk_c2),sk_c9).
% 612476 [hyper:612404,612411,demod:612464,cut:612400,binarycut:612417] equal(inverse(sk_c6),sk_c9).
% 612488 [hyper:612404,612412,demod:612464,cut:612400,binarycut:612418] equal(multiply(sk_c6,sk_c9),sk_c7).
% 612506 [hyper:612404,612413,demod:612464,cut:612400,binarycut:612419] equal(multiply(sk_c9,sk_c7),sk_c8).
% 612520 [hyper:612404,612506,612488,demod:612476,cut:612400] 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 21
% clause depth limited to 3
% seconds given: 6
%
%
% Split component 4 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(inverse(X),sk_c9) | -equal(multiply(X,sk_c8),sk_c9) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(U,V),sk_c9) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c9) | -equal(multiply(sk_c9,W),sk_c8) | -equal(multiply(X1,sk_c9),W) | -equal(inverse(X1),sk_c9).
% Split part used next: -equal(inverse(X),sk_c9) | -equal(multiply(X,sk_c8),sk_c9).
% 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 21
% clause depth limited to 3
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,1,75,0,1,350285,5,1502,350286,1,1502,350286,50,1502,350286,40,1502,350326,0,1502,362311,3,1803,362968,4,1953,365388,5,2103,365389,1,2103,365389,50,2103,365389,40,2103,365429,0,2103,366199,3,2409,366220,4,2563,366266,5,2704,366266,1,2704,366266,50,2704,366266,40,2704,366306,0,2704,388482,3,4209,389093,4,4955,389366,1,5705,389366,50,5705,389366,40,5705,389406,0,5705,400744,3,6459,401773,4,6831,402865,5,7206,402866,1,7206,402866,50,7206,402866,40,7206,402906,0,7206,416496,3,7958,417448,4,8332,418625,5,8708,418626,5,8708,418627,1,8708,418627,50,8708,418627,40,8708,418667,0,8708,471631,3,12628,472444,4,14559,473342,1,16509,473342,50,16510,473342,40,16510,473382,0,16510,515996,3,19075,516757,4,20336,517504,1,21611,517504,50,21612,517504,40,21612,517544,0,21612,550773,3,23115,551198,4,23863,551712,1,24613,551712,50,24614,551712,40,24614,551752,0,24614,572021,3,25365,572525,4,25740,572836,5,26115,572837,1,26115,572837,50,26116,572837,40,26116,572877,0,26116,596320,3,27317,597021,4,27917,597648,1,28517,597648,50,28518,597648,40,28518,597688,0,28518,610768,3,29269,611734,4,29644,612078,1,30019,612078,50,30019,612078,40,30019,612078,40,30019,612113,0,30019,612198,50,30019,612198,30,30019,612198,40,30019,612233,0,30019,612399,50,30020,612399,30,30020,612399,40,30020,612434,0,30024,612519,50,30024,612519,30,30024,612519,40,30024,612554,0,30024)
%
%
% START OF PROOF
% 612521 [] equal(multiply(identity,X),X).
% 612522 [] equal(multiply(inverse(X),X),identity).
% 612523 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 612524 [] -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c9).
% 612543 [?] ?
% 612544 [?] ?
% 612545 [?] ?
% 612546 [?] ?
% 612547 [?] ?
% 612548 [?] ?
% 612549 [] equal(inverse(sk_c1),sk_c9) | equal(inverse(sk_c6),sk_c9).
% 612550 [] equal(multiply(sk_c6,sk_c9),sk_c7) | equal(inverse(sk_c1),sk_c9).
% 612551 [] equal(multiply(sk_c9,sk_c7),sk_c8) | equal(inverse(sk_c1),sk_c9).
% 612552 [] equal(multiply(sk_c5,sk_c8),sk_c9) | equal(inverse(sk_c1),sk_c9).
% 612553 [] equal(inverse(sk_c1),sk_c9) | equal(inverse(sk_c4),sk_c5).
% 612554 [] equal(multiply(sk_c4,sk_c5),sk_c9) | equal(inverse(sk_c1),sk_c9).
% 612563 [hyper:612524,612549,binarycut:612543] equal(inverse(sk_c6),sk_c9).
% 612567 [para:612563.1.1,612522.1.1.1] equal(multiply(sk_c9,sk_c6),identity).
% 612571 [hyper:612524,612553,binarycut:612547] equal(inverse(sk_c4),sk_c5).
% 612590 [hyper:612524,612550,binarycut:612544] equal(multiply(sk_c6,sk_c9),sk_c7).
% 612593 [hyper:612524,612551,binarycut:612545] equal(multiply(sk_c9,sk_c7),sk_c8).
% 612600 [hyper:612524,612552,binarycut:612546] equal(multiply(sk_c5,sk_c8),sk_c9).
% 612606 [hyper:612524,612554,binarycut:612548] equal(multiply(sk_c4,sk_c5),sk_c9).
% 612607 [para:612522.1.1,612523.1.1.1,demod:612521] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 612608 [para:612567.1.1,612523.1.1.1,demod:612521] equal(X,multiply(sk_c9,multiply(sk_c6,X))).
% 612614 [para:612590.1.1,612608.1.2.2,demod:612593] equal(sk_c9,sk_c8).
% 612625 [para:612606.1.1,612607.1.2.2,demod:612571] equal(sk_c5,multiply(sk_c5,sk_c9)).
% 612633 [para:612614.1.1,612625.1.2.2,demod:612600] equal(sk_c5,sk_c9).
% 612634 [para:612625.1.2,612607.1.2.2,demod:612522] equal(sk_c9,identity).
% 612641 [para:612634.1.1,612567.1.1.1,demod:612521] equal(sk_c6,identity).
% 612648 [para:612634.1.1,612633.1.2] equal(sk_c5,identity).
% 612650 [para:612641.1.1,612563.1.1.1] equal(inverse(identity),sk_c9).
% 612663 [para:612648.1.1,612600.1.1.1,demod:612521] equal(sk_c8,sk_c9).
% 612671 [hyper:612524,612650,demod:612521,cut:612663] 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 21
% clause depth limited to 3
% seconds given: 6
%
%
% Split attempt finished with SUCCESS.
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 32386
% derived clauses: 4250277
% kept clauses: 221205
% kept size sum: 179995
% kept mid-nuclei: 341942
% kept new demods: 750
% forw unit-subs: 1089939
% forw double-subs: 2270929
% forw overdouble-subs: 219311
% backward subs: 38193
% fast unit cutoff: 55400
% full unit cutoff: 0
% dbl unit cutoff: 15199
% real runtime : 300.83
% process. runtime: 300.23
% specific non-discr-tree subsumption statistics:
% tried: 9324964
% length fails: 978261
% strength fails: 2390250
% predlist fails: 626337
% aux str. fails: 1679314
% by-lit fails: 815773
% full subs tried: 1898197
% full subs fail: 1746395
%
% ; 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/GRP223-1+eq_r.in")
%
%------------------------------------------------------------------------------