TSTP Solution File: GRP262-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP262-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 : 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 289.2s
% Output : Assurance 289.2s
% 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/GRP262-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(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_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),sk_c6).
% was split for some strategies as:
% -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),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_c5,sk_c7),sk_c6).
% -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(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_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),sk_c6).
% Split part used next: -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),sk_c6).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,65,0,0,609,50,5,644,0,5,1203,50,10,1238,0,10,1803,50,16,1838,0,16,2409,50,24,2444,0,24,3022,50,31,3057,0,32,3643,50,45,3678,0,45,4273,50,71,4308,0,71,4913,50,125,4948,0,126,5563,50,243,5598,0,243,6225,50,445,6260,0,445,6899,50,824,6899,40,824,6934,0,824,17819,3,1125,18534,4,1275,19178,5,1425,19179,1,1425,19179,50,1425,19179,40,1425,19214,0,1425,19380,3,1733,19388,4,1876,19396,5,2026,19396,1,2026,19396,50,2026,19396,40,2026,19431,0,2026,43782,3,3528,44934,4,4277,46035,5,5027,46036,1,5027,46036,50,5027,46036,40,5027,46071,0,5027,62266,3,5779,63140,4,6153,63924,1,6528,63924,50,6528,63924,40,6528,63959,0,6528,76589,3,7281,77434,4,7654,78679,5,8029,78680,5,8029,78682,1,8029,78682,50,8029,78682,40,8029,78717,0,8029,139975,3,11932,141104,4,13881,142299,1,15830,142299,50,15832,142299,40,15832,142334,0,15832,189009,3,18384,190033,4,19658,190938,1,20933,190938,50,20935,190938,40,20935,190973,0,20935,227087,3,22437,227963,4,23186,228806,5,23936,228807,1,23936,228807,50,23938,228807,40,23938,228842,0,23938,238049,3,24752,239078,4,25064,239411,5,25439,239411,1,25439,239411,50,25439,239411,40,25439,239446,0,25439,268144,3,26640,269021,4,27240,269524,1,27840,269524,50,27841,269524,40,27841,269559,0,27841,290477,3,28592,291198,4,28967,291590,1,29342,291590,50,29342,291590,40,29342,291590,40,29342,291620,0,29342,291713,50,29343,291743,0,29343)
%
%
% START OF PROOF
% 291700 [?] ?
% 291715 [] equal(multiply(identity,X),X).
% 291716 [] equal(multiply(inverse(X),X),identity).
% 291717 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 291718 [] -equal(multiply(X,sk_c5),sk_c6) | -equal(inverse(X),sk_c6).
% 291724 [?] ?
% 291725 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 291734 [?] ?
% 291735 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 291739 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 291740 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 291747 [hyper:291718,291725,binarycut:291724] equal(inverse(sk_c2),sk_c6).
% 291749 [para:291747.1.1,291716.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 291753 [hyper:291718,291735,binarycut:291734] equal(inverse(sk_c1),sk_c7).
% 291774 [hyper:291718,291739,291740] equal(multiply(sk_c1,sk_c7),sk_c6).
% 291775 [para:291716.1.1,291717.1.1.1,demod:291715] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 291789 [para:291774.1.1,291775.1.2.2,demod:291753] equal(sk_c7,multiply(sk_c7,sk_c6)).
% 291793 [para:291789.1.2,291775.1.2.2,demod:291716] equal(sk_c6,identity).
% 291795 [para:291793.1.1,291749.1.1.1,demod:291715] equal(sk_c2,identity).
% 291800 [para:291795.1.1,291747.1.1.1] equal(inverse(identity),sk_c6).
% 291818 [hyper:291718,291800,demod:291715,cut:291700] 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 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -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_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),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
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,65,0,0,609,50,5,644,0,5,1203,50,10,1238,0,10,1803,50,16,1838,0,16,2409,50,24,2444,0,24,3022,50,31,3057,0,32,3643,50,45,3678,0,45,4273,50,71,4308,0,71,4913,50,125,4948,0,126,5563,50,243,5598,0,243,6225,50,445,6260,0,445,6899,50,824,6899,40,824,6934,0,824,17819,3,1125,18534,4,1275,19178,5,1425,19179,1,1425,19179,50,1425,19179,40,1425,19214,0,1425,19380,3,1733,19388,4,1876,19396,5,2026,19396,1,2026,19396,50,2026,19396,40,2026,19431,0,2026,43782,3,3528,44934,4,4277,46035,5,5027,46036,1,5027,46036,50,5027,46036,40,5027,46071,0,5027,62266,3,5779,63140,4,6153,63924,1,6528,63924,50,6528,63924,40,6528,63959,0,6528,76589,3,7281,77434,4,7654,78679,5,8029,78680,5,8029,78682,1,8029,78682,50,8029,78682,40,8029,78717,0,8029,139975,3,11932,141104,4,13881,142299,1,15830,142299,50,15832,142299,40,15832,142334,0,15832,189009,3,18384,190033,4,19658,190938,1,20933,190938,50,20935,190938,40,20935,190973,0,20935,227087,3,22437,227963,4,23186,228806,5,23936,228807,1,23936,228807,50,23938,228807,40,23938,228842,0,23938,238049,3,24752,239078,4,25064,239411,5,25439,239411,1,25439,239411,50,25439,239411,40,25439,239446,0,25439,268144,3,26640,269021,4,27240,269524,1,27840,269524,50,27841,269524,40,27841,269559,0,27841,290477,3,28592,291198,4,28967,291590,1,29342,291590,50,29342,291590,40,29342,291590,40,29342,291620,0,29342,291713,50,29343,291743,0,29343,291817,50,29343,291817,30,29343,291817,40,29343,291847,0,29349)
%
%
% START OF PROOF
% 291819 [] equal(multiply(identity,X),X).
% 291820 [] equal(multiply(inverse(X),X),identity).
% 291821 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 291822 [] -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 291825 [] equal(multiply(sk_c5,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 291826 [] equal(multiply(sk_c5,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 291830 [?] ?
% 291831 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 291835 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 291836 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c3),sk_c7).
% 291840 [?] ?
% 291841 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 291845 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 291846 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 291851 [hyper:291822,291831,binarycut:291830] equal(inverse(sk_c2),sk_c6).
% 291853 [para:291851.1.1,291820.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 291860 [hyper:291822,291841,binarycut:291840] equal(inverse(sk_c1),sk_c7).
% 291863 [para:291860.1.1,291820.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 291876 [hyper:291822,291825,291826] equal(multiply(sk_c5,sk_c7),sk_c6).
% 291884 [hyper:291822,291835,291836] equal(multiply(sk_c2,sk_c6),sk_c5).
% 291888 [hyper:291822,291845,291846] equal(multiply(sk_c1,sk_c7),sk_c6).
% 291889 [para:291820.1.1,291821.1.1.1,demod:291819] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 291890 [para:291853.1.1,291821.1.1.1,demod:291819] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 291892 [para:291876.1.1,291821.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c5,multiply(sk_c7,X))).
% 291895 [para:291884.1.1,291890.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 291901 [para:291888.1.1,291889.1.2.2,demod:291860] equal(sk_c7,multiply(sk_c7,sk_c6)).
% 291904 [para:291901.1.2,291889.1.2.2,demod:291820] equal(sk_c6,identity).
% 291906 [para:291904.1.1,291853.1.1.1,demod:291819] equal(sk_c2,identity).
% 291909 [para:291904.1.1,291895.1.2.1,demod:291819] equal(sk_c6,sk_c5).
% 291910 [para:291904.1.1,291901.1.2.2] equal(sk_c7,multiply(sk_c7,identity)).
% 291911 [para:291906.1.1,291851.1.1.1] equal(inverse(identity),sk_c6).
% 291913 [para:291906.1.1,291890.1.2.2.1,demod:291819] equal(X,multiply(sk_c6,X)).
% 291914 [para:291909.1.2,291876.1.1.1,demod:291913] equal(sk_c7,sk_c6).
% 291915 [para:291914.1.1,291863.1.1.1,demod:291913] equal(sk_c1,identity).
% 291919 [para:291915.1.1,291860.1.1.1,demod:291911] equal(sk_c6,sk_c7).
% 291920 [para:291915.1.1,291863.1.1.2,demod:291910] equal(sk_c7,identity).
% 291922 [para:291863.1.1,291892.1.2.2,demod:291913] equal(sk_c1,multiply(sk_c5,identity)).
% 291926 [para:291920.1.1,291876.1.1.2,demod:291922] equal(sk_c1,sk_c6).
% 291928 [para:291926.1.1,291860.1.1.1] equal(inverse(sk_c6),sk_c7).
% 291933 [hyper:291822,291928,demod:291913,cut:291919] 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 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -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_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),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,0,65,0,0,609,50,5,644,0,5,1203,50,10,1238,0,10,1803,50,16,1838,0,16,2409,50,24,2444,0,24,3022,50,31,3057,0,32,3643,50,45,3678,0,45,4273,50,71,4308,0,71,4913,50,125,4948,0,126,5563,50,243,5598,0,243,6225,50,445,6260,0,445,6899,50,824,6899,40,824,6934,0,824,17819,3,1125,18534,4,1275,19178,5,1425,19179,1,1425,19179,50,1425,19179,40,1425,19214,0,1425,19380,3,1733,19388,4,1876,19396,5,2026,19396,1,2026,19396,50,2026,19396,40,2026,19431,0,2026,43782,3,3528,44934,4,4277,46035,5,5027,46036,1,5027,46036,50,5027,46036,40,5027,46071,0,5027,62266,3,5779,63140,4,6153,63924,1,6528,63924,50,6528,63924,40,6528,63959,0,6528,76589,3,7281,77434,4,7654,78679,5,8029,78680,5,8029,78682,1,8029,78682,50,8029,78682,40,8029,78717,0,8029,139975,3,11932,141104,4,13881,142299,1,15830,142299,50,15832,142299,40,15832,142334,0,15832,189009,3,18384,190033,4,19658,190938,1,20933,190938,50,20935,190938,40,20935,190973,0,20935,227087,3,22437,227963,4,23186,228806,5,23936,228807,1,23936,228807,50,23938,228807,40,23938,228842,0,23938,238049,3,24752,239078,4,25064,239411,5,25439,239411,1,25439,239411,50,25439,239411,40,25439,239446,0,25439,268144,3,26640,269021,4,27240,269524,1,27840,269524,50,27841,269524,40,27841,269559,0,27841,290477,3,28592,291198,4,28967,291590,1,29342,291590,50,29342,291590,40,29342,291590,40,29342,291620,0,29342,291713,50,29343,291743,0,29343,291817,50,29343,291817,30,29343,291817,40,29343,291847,0,29349,291932,50,29349,291932,30,29349,291932,40,29349,291962,0,29349)
%
%
% START OF PROOF
% 291933 [] equal(X,X).
% 291934 [] equal(multiply(identity,X),X).
% 291935 [] equal(multiply(inverse(X),X),identity).
% 291936 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 291937 [] -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c6).
% 291943 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c2),sk_c6).
% 291944 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 291945 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c6).
% 291946 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 291947 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c2),sk_c6).
% 291948 [?] ?
% 291949 [?] ?
% 291950 [?] ?
% 291951 [?] ?
% 291952 [?] ?
% 291965 [hyper:291937,291944,binarycut:291949] equal(inverse(sk_c4),sk_c6).
% 291968 [para:291965.1.1,291935.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 291972 [hyper:291937,291946,binarycut:291951] equal(inverse(sk_c3),sk_c7).
% 291973 [para:291972.1.1,291935.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 291976 [hyper:291937,291943,binarycut:291948] equal(multiply(sk_c4,sk_c5),sk_c6).
% 291979 [hyper:291937,291945,binarycut:291950] equal(multiply(sk_c3,sk_c6),sk_c7).
% 291983 [hyper:291937,291947,binarycut:291952] equal(multiply(sk_c6,sk_c7),sk_c5).
% 291984 [para:291935.1.1,291936.1.1.1,demod:291934] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 291985 [para:291968.1.1,291936.1.1.1,demod:291934] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 291988 [para:291979.1.1,291936.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c3,multiply(sk_c6,X))).
% 291989 [para:291983.1.1,291936.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c6,multiply(sk_c7,X))).
% 291990 [para:291976.1.1,291985.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 291993 [para:291968.1.1,291984.1.2.2] equal(sk_c4,multiply(inverse(sk_c6),identity)).
% 291996 [para:291983.1.1,291984.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 291998 [para:291990.1.2,291984.1.2.2,demod:291996] equal(sk_c6,sk_c7).
% 291999 [para:291998.1.2,291973.1.1.1] equal(multiply(sk_c6,sk_c3),identity).
% 292015 [para:291999.1.1,291988.1.2.2,demod:291973] equal(identity,multiply(sk_c3,identity)).
% 292016 [para:292015.1.2,291936.1.1.1,demod:291934] equal(X,multiply(sk_c3,X)).
% 292018 [para:292016.1.2,291984.1.2.2,demod:291972] equal(X,multiply(sk_c7,X)).
% 292019 [para:292016.1.2,291988.1.2,demod:292018] equal(X,multiply(sk_c6,X)).
% 292024 [para:291998.1.2,291989.1.2.2.1,demod:292019] equal(multiply(sk_c5,X),X).
% 292028 [para:292024.1.1,291984.1.2.2] equal(X,multiply(inverse(sk_c5),X)).
% 292030 [para:292028.1.2,291935.1.1] equal(sk_c5,identity).
% 292035 [para:292030.1.1,291996.1.2.2,demod:291993] equal(sk_c7,sk_c4).
% 292036 [para:292035.1.1,291998.1.2] equal(sk_c6,sk_c4).
% 292041 [para:292036.1.2,291965.1.1.1] equal(inverse(sk_c6),sk_c6).
% 292049 [hyper:291937,292041,demod:291990,cut:291933] 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(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_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),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,0,65,0,0,609,50,5,644,0,5,1203,50,10,1238,0,10,1803,50,16,1838,0,16,2409,50,24,2444,0,24,3022,50,31,3057,0,32,3643,50,45,3678,0,45,4273,50,71,4308,0,71,4913,50,125,4948,0,126,5563,50,243,5598,0,243,6225,50,445,6260,0,445,6899,50,824,6899,40,824,6934,0,824,17819,3,1125,18534,4,1275,19178,5,1425,19179,1,1425,19179,50,1425,19179,40,1425,19214,0,1425,19380,3,1733,19388,4,1876,19396,5,2026,19396,1,2026,19396,50,2026,19396,40,2026,19431,0,2026,43782,3,3528,44934,4,4277,46035,5,5027,46036,1,5027,46036,50,5027,46036,40,5027,46071,0,5027,62266,3,5779,63140,4,6153,63924,1,6528,63924,50,6528,63924,40,6528,63959,0,6528,76589,3,7281,77434,4,7654,78679,5,8029,78680,5,8029,78682,1,8029,78682,50,8029,78682,40,8029,78717,0,8029,139975,3,11932,141104,4,13881,142299,1,15830,142299,50,15832,142299,40,15832,142334,0,15832,189009,3,18384,190033,4,19658,190938,1,20933,190938,50,20935,190938,40,20935,190973,0,20935,227087,3,22437,227963,4,23186,228806,5,23936,228807,1,23936,228807,50,23938,228807,40,23938,228842,0,23938,238049,3,24752,239078,4,25064,239411,5,25439,239411,1,25439,239411,50,25439,239411,40,25439,239446,0,25439,268144,3,26640,269021,4,27240,269524,1,27840,269524,50,27841,269524,40,27841,269559,0,27841,290477,3,28592,291198,4,28967,291590,1,29342,291590,50,29342,291590,40,29342,291590,40,29342,291620,0,29342,291713,50,29343,291743,0,29343,291817,50,29343,291817,30,29343,291817,40,29343,291847,0,29349,291932,50,29349,291932,30,29349,291932,40,29349,291962,0,29349,292048,50,29350,292048,30,29350,292048,40,29350,292078,0,29350)
%
%
% START OF PROOF
% 292050 [] equal(multiply(identity,X),X).
% 292051 [] equal(multiply(inverse(X),X),identity).
% 292052 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 292053 [] -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 292069 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 292070 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 292071 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 292072 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 292073 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c1),sk_c7).
% 292074 [?] ?
% 292075 [?] ?
% 292076 [?] ?
% 292077 [?] ?
% 292078 [?] ?
% 292085 [hyper:292053,292070,binarycut:292075] equal(inverse(sk_c4),sk_c6).
% 292086 [para:292085.1.1,292051.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 292089 [hyper:292053,292072,binarycut:292077] equal(inverse(sk_c3),sk_c7).
% 292093 [para:292089.1.1,292051.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 292106 [hyper:292053,292069,binarycut:292074] equal(multiply(sk_c4,sk_c5),sk_c6).
% 292109 [hyper:292053,292071,binarycut:292076] equal(multiply(sk_c3,sk_c6),sk_c7).
% 292115 [hyper:292053,292073,binarycut:292078] equal(multiply(sk_c6,sk_c7),sk_c5).
% 292116 [para:292051.1.1,292052.1.1.1,demod:292050] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 292117 [para:292086.1.1,292052.1.1.1,demod:292050] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 292120 [para:292109.1.1,292052.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c3,multiply(sk_c6,X))).
% 292122 [para:292106.1.1,292117.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 292125 [para:292086.1.1,292116.1.2.2] equal(sk_c4,multiply(inverse(sk_c6),identity)).
% 292128 [para:292115.1.1,292116.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 292130 [para:292122.1.2,292116.1.2.2,demod:292128] equal(sk_c6,sk_c7).
% 292131 [para:292130.1.2,292093.1.1.1] equal(multiply(sk_c6,sk_c3),identity).
% 292138 [para:292131.1.1,292116.1.2.2,demod:292125] equal(sk_c3,sk_c4).
% 292139 [para:292138.1.2,292085.1.1.1,demod:292089] equal(sk_c7,sk_c6).
% 292147 [para:292131.1.1,292120.1.2.2,demod:292093] equal(identity,multiply(sk_c3,identity)).
% 292148 [para:292147.1.2,292052.1.1.1,demod:292050] equal(X,multiply(sk_c3,X)).
% 292150 [para:292148.1.2,292116.1.2.2,demod:292089] equal(X,multiply(sk_c7,X)).
% 292152 [para:292150.1.2,292093.1.1] equal(sk_c3,identity).
% 292153 [para:292152.1.1,292089.1.1.1] equal(inverse(identity),sk_c7).
% 292154 [hyper:292053,292153,demod:292050,cut:292139] 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(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_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),sk_c6).
% Split part used next: -equal(multiply(sk_c5,sk_c7),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
%
%
% 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,0,65,0,0,609,50,5,644,0,5,1203,50,10,1238,0,10,1803,50,16,1838,0,16,2409,50,24,2444,0,24,3022,50,31,3057,0,32,3643,50,45,3678,0,45,4273,50,71,4308,0,71,4913,50,125,4948,0,126,5563,50,243,5598,0,243,6225,50,445,6260,0,445,6899,50,824,6899,40,824,6934,0,824,17819,3,1125,18534,4,1275,19178,5,1425,19179,1,1425,19179,50,1425,19179,40,1425,19214,0,1425,19380,3,1733,19388,4,1876,19396,5,2026,19396,1,2026,19396,50,2026,19396,40,2026,19431,0,2026,43782,3,3528,44934,4,4277,46035,5,5027,46036,1,5027,46036,50,5027,46036,40,5027,46071,0,5027,62266,3,5779,63140,4,6153,63924,1,6528,63924,50,6528,63924,40,6528,63959,0,6528,76589,3,7281,77434,4,7654,78679,5,8029,78680,5,8029,78682,1,8029,78682,50,8029,78682,40,8029,78717,0,8029,139975,3,11932,141104,4,13881,142299,1,15830,142299,50,15832,142299,40,15832,142334,0,15832,189009,3,18384,190033,4,19658,190938,1,20933,190938,50,20935,190938,40,20935,190973,0,20935,227087,3,22437,227963,4,23186,228806,5,23936,228807,1,23936,228807,50,23938,228807,40,23938,228842,0,23938,238049,3,24752,239078,4,25064,239411,5,25439,239411,1,25439,239411,50,25439,239411,40,25439,239446,0,25439,268144,3,26640,269021,4,27240,269524,1,27840,269524,50,27841,269524,40,27841,269559,0,27841,290477,3,28592,291198,4,28967,291590,1,29342,291590,50,29342,291590,40,29342,291590,40,29342,291620,0,29342,291713,50,29343,291743,0,29343,291817,50,29343,291817,30,29343,291817,40,29343,291847,0,29349,291932,50,29349,291932,30,29349,291932,40,29349,291962,0,29349,292048,50,29350,292048,30,29350,292048,40,29350,292078,0,29350,292153,50,29350,292153,30,29350,292153,40,29350,292183,0,29355,292281,50,29355,292311,0,29356,292449,50,29358,292479,0,29362,292625,50,29366,292655,0,29366,292809,50,29371,292839,0,29371,292999,50,29379,293029,0,29383,293197,50,29398,293227,0,29398,293403,50,29426,293433,0,29431,293619,50,29488,293649,0,29488,293845,50,29603,293845,40,29603,293875,0,29603)
%
%
% START OF PROOF
% 293846 [] equal(X,X).
% 293847 [] equal(multiply(identity,X),X).
% 293848 [] equal(multiply(inverse(X),X),identity).
% 293849 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 293850 [] -equal(multiply(sk_c5,sk_c7),sk_c6).
% 293851 [?] ?
% 293852 [?] ?
% 293853 [?] ?
% 293854 [?] ?
% 293855 [?] ?
% 293879 [input:293851,cut:293850] equal(multiply(sk_c4,sk_c5),sk_c6).
% 293889 [input:293852,cut:293850] equal(inverse(sk_c4),sk_c6).
% 293890 [para:293889.1.1,293848.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 293891 [input:293853,cut:293850] equal(multiply(sk_c3,sk_c6),sk_c7).
% 293892 [input:293854,cut:293850] equal(inverse(sk_c3),sk_c7).
% 293893 [para:293892.1.1,293848.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 293900 [input:293855,cut:293850] equal(multiply(sk_c6,sk_c7),sk_c5).
% 293921 [para:293848.1.1,293849.1.1.1,demod:293847] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 293923 [para:293890.1.1,293849.1.1.1,demod:293847] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 293925 [para:293893.1.1,293849.1.1.1,demod:293847] equal(X,multiply(sk_c7,multiply(sk_c3,X))).
% 293942 [para:293879.1.1,293923.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 293946 [para:293891.1.1,293925.1.2.2] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 293957 [para:293900.1.1,293921.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 293978 [para:293942.1.2,293921.1.2.2,demod:293957] equal(sk_c6,sk_c7).
% 293991 [para:293978.1.2,293946.1.2.1] equal(sk_c6,multiply(sk_c6,sk_c7)).
% 294007 [para:293991.1.2,293900.1.1] equal(sk_c6,sk_c5).
% 294010 [para:294007.1.2,293850.1.1.1,demod:293991,cut:293846] 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(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_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),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,0,65,0,0,609,50,5,644,0,5,1203,50,10,1238,0,10,1803,50,16,1838,0,16,2409,50,24,2444,0,24,3022,50,31,3057,0,32,3643,50,45,3678,0,45,4273,50,71,4308,0,71,4913,50,125,4948,0,126,5563,50,243,5598,0,243,6225,50,445,6260,0,445,6899,50,824,6899,40,824,6934,0,824,17819,3,1125,18534,4,1275,19178,5,1425,19179,1,1425,19179,50,1425,19179,40,1425,19214,0,1425,19380,3,1733,19388,4,1876,19396,5,2026,19396,1,2026,19396,50,2026,19396,40,2026,19431,0,2026,43782,3,3528,44934,4,4277,46035,5,5027,46036,1,5027,46036,50,5027,46036,40,5027,46071,0,5027,62266,3,5779,63140,4,6153,63924,1,6528,63924,50,6528,63924,40,6528,63959,0,6528,76589,3,7281,77434,4,7654,78679,5,8029,78680,5,8029,78682,1,8029,78682,50,8029,78682,40,8029,78717,0,8029,139975,3,11932,141104,4,13881,142299,1,15830,142299,50,15832,142299,40,15832,142334,0,15832,189009,3,18384,190033,4,19658,190938,1,20933,190938,50,20935,190938,40,20935,190973,0,20935,227087,3,22437,227963,4,23186,228806,5,23936,228807,1,23936,228807,50,23938,228807,40,23938,228842,0,23938,238049,3,24752,239078,4,25064,239411,5,25439,239411,1,25439,239411,50,25439,239411,40,25439,239446,0,25439,268144,3,26640,269021,4,27240,269524,1,27840,269524,50,27841,269524,40,27841,269559,0,27841,290477,3,28592,291198,4,28967,291590,1,29342,291590,50,29342,291590,40,29342,291590,40,29342,291620,0,29342,291713,50,29343,291743,0,29343,291817,50,29343,291817,30,29343,291817,40,29343,291847,0,29349,291932,50,29349,291932,30,29349,291932,40,29349,291962,0,29349,292048,50,29350,292048,30,29350,292048,40,29350,292078,0,29350,292153,50,29350,292153,30,29350,292153,40,29350,292183,0,29355,292281,50,29355,292311,0,29356,292449,50,29358,292479,0,29362,292625,50,29366,292655,0,29366,292809,50,29371,292839,0,29371,292999,50,29379,293029,0,29383,293197,50,29398,293227,0,29398,293403,50,29426,293433,0,29431,293619,50,29488,293649,0,29488,293845,50,29603,293845,40,29603,293875,0,29603,294009,50,29604,294009,30,29604,294009,40,29604,294039,0,29604,294133,50,29604,294163,0,29608,294306,50,29611,294336,0,29611,294487,50,29614,294517,0,29614,294676,50,29620,294706,0,29624,294871,50,29633,294901,0,29633,295074,50,29648,295104,0,29653,295285,50,29681,295315,0,29681,295506,50,29742,295536,0,29742,295737,50,29859,295737,40,29859,295767,0,29859)
%
%
% START OF PROOF
% 295629 [?] ?
% 295739 [] equal(multiply(identity,X),X).
% 295740 [] equal(multiply(inverse(X),X),identity).
% 295741 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 295742 [] -equal(multiply(sk_c6,sk_c7),sk_c5).
% 295747 [?] ?
% 295752 [?] ?
% 295757 [?] ?
% 295762 [?] ?
% 295767 [?] ?
% 295790 [input:295752,cut:295742] equal(inverse(sk_c2),sk_c6).
% 295791 [para:295790.1.1,295740.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 295794 [input:295747,cut:295742] equal(multiply(sk_c5,sk_c7),sk_c6).
% 295801 [input:295762,cut:295742] equal(inverse(sk_c1),sk_c7).
% 295802 [para:295801.1.1,295740.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 295813 [input:295757,cut:295742] equal(multiply(sk_c2,sk_c6),sk_c5).
% 295816 [input:295767,cut:295742] equal(multiply(sk_c1,sk_c7),sk_c6).
% 295817 [para:295740.1.1,295741.1.1.1,demod:295739] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 295826 [para:295791.1.1,295741.1.1.1,demod:295739] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 295832 [para:295802.1.1,295741.1.1.1,demod:295739] equal(X,multiply(sk_c7,multiply(sk_c1,X))).
% 295853 [para:295813.1.1,295826.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 295861 [para:295816.1.1,295832.1.2.2] equal(sk_c7,multiply(sk_c7,sk_c6)).
% 295877 [para:295794.1.1,295817.1.2.2] equal(sk_c7,multiply(inverse(sk_c5),sk_c6)).
% 295902 [para:295826.1.2,295817.1.2.2] equal(multiply(sk_c2,X),multiply(inverse(sk_c6),X)).
% 295904 [para:295853.1.2,295817.1.2.2,demod:295902] equal(sk_c5,multiply(sk_c2,sk_c6)).
% 295907 [para:295817.1.2,295817.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 295911 [para:295877.1.2,295817.1.2.2,demod:295907] equal(sk_c6,multiply(sk_c5,sk_c7)).
% 295930 [para:295902.1.2,295740.1.1,demod:295904] equal(sk_c5,identity).
% 295939 [para:295930.1.1,295794.1.1.1,demod:295739] equal(sk_c7,sk_c6).
% 295942 [para:295930.1.1,295911.1.2.1,demod:295739] equal(sk_c6,sk_c7).
% 295955 [para:295939.1.1,295861.1.2.1] equal(sk_c7,multiply(sk_c6,sk_c6)).
% 295957 [para:295942.1.2,295742.1.1.2,demod:295955,cut:295629] 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: 35606
% derived clauses: 6404686
% kept clauses: 252802
% kept size sum: 279554
% kept mid-nuclei: 3608
% kept new demods: 3957
% forw unit-subs: 2359677
% forw double-subs: 3366575
% forw overdouble-subs: 381003
% backward subs: 12038
% fast unit cutoff: 26018
% full unit cutoff: 0
% dbl unit cutoff: 5696
% real runtime : 299.84
% process. runtime: 298.59
% specific non-discr-tree subsumption statistics:
% tried: 32051708
% length fails: 2561433
% strength fails: 6557771
% predlist fails: 3327264
% aux str. fails: 5566126
% by-lit fails: 7340751
% full subs tried: 1595998
% full subs fail: 1496613
%
% ; 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/GRP262-1+eq_r.in")
%
%------------------------------------------------------------------------------