TSTP Solution File: GRP322-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP322-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 278.7s
% Output : Assurance 278.7s
% 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/GRP322-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 23)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 23)
% (binary-posweight-lex-big-order 30 #f 3 23)
% (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_c8,sk_c9),sk_c7) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% was split for some strategies as:
% -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9).
% -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9).
% -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8).
% -equal(multiply(sk_c8,sk_c9),sk_c7).
% -equal(multiply(sk_c9,sk_c8),sk_c7).
%
% 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_c8,sk_c9),sk_c7) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(41,40,1,87,0,1,1204,50,12,1250,0,12,2929,50,39,2975,0,39,5155,50,78,5201,0,78,7471,50,111,7517,0,111,9992,50,153,10038,0,153,12661,50,208,12707,0,208,15550,50,287,15596,0,287,18659,50,412,18705,0,413,22059,50,618,22105,0,618,25751,50,894,25751,40,894,25797,0,894,37069,3,1195,37713,4,1345,38408,1,1495,38408,50,1495,38408,40,1495,38454,0,1495,38690,3,1807,38698,4,1950,38706,5,2096,38706,1,2096,38706,50,2096,38706,40,2096,38752,0,2096,52254,3,3597,53257,50,3942,53257,40,3942,53303,0,3942,64068,3,4693,65381,50,5064,65381,40,5064,65427,0,5064,80591,3,5868,81355,4,6190,82260,5,6565,82261,1,6565,82261,50,6565,82261,40,6565,82307,0,6565,141541,3,10466,142790,4,12416,143871,5,14366,143872,1,14366,143872,50,14368,143872,40,14368,143918,0,14368,193770,3,16919,194736,4,18194,195529,1,19469,195529,50,19471,195529,40,19471,195575,0,19471,235208,3,20972,235809,4,21722,236568,5,22472,236569,1,22472,236569,50,22474,236569,40,22474,236615,0,22474,256169,3,23228,256697,4,23600,257042,5,23975,257043,1,23975,257043,50,23975,257043,40,23975,257089,0,23976,282540,3,25177,283366,4,25777,284084,1,26377,284084,50,26377,284084,40,26377,284130,0,26378,299615,3,27129,300284,4,27504,301020,5,27879,301021,1,27879,301021,50,27879,301021,40,27879,301021,40,27879,301062,0,27879)
%
%
% START OF PROOF
% 301022 [] equal(X,X).
% 301026 [] -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9).
% 301027 [] equal(inverse(sk_c2),sk_c9) | equal(inverse(sk_c5),sk_c9).
% 301028 [] equal(multiply(sk_c5,sk_c9),sk_c6) | equal(inverse(sk_c2),sk_c9).
% 301029 [?] ?
% 301033 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(inverse(sk_c5),sk_c9).
% 301034 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c5,sk_c9),sk_c6).
% 301035 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c9,sk_c6),sk_c8).
% 301039 [?] ?
% 301040 [?] ?
% 301041 [?] ?
% 301090 [hyper:301026,301028,301027,binarycut:301029] equal(inverse(sk_c2),sk_c9).
% 301102 [hyper:301026,301033,demod:301090,cut:301022,binarycut:301039] equal(inverse(sk_c5),sk_c9).
% 301114 [hyper:301026,301034,demod:301090,cut:301022,binarycut:301040] equal(multiply(sk_c5,sk_c9),sk_c6).
% 301136 [hyper:301026,301035,demod:301090,cut:301022,binarycut:301041] equal(multiply(sk_c9,sk_c6),sk_c8).
% 301141 [hyper:301026,301136,301114,demod:301102,cut:301022] 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 23
% 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_c8,sk_c9),sk_c7) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),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 23
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(41,40,1,87,0,1,1204,50,12,1250,0,12,2929,50,39,2975,0,39,5155,50,78,5201,0,78,7471,50,111,7517,0,111,9992,50,153,10038,0,153,12661,50,208,12707,0,208,15550,50,287,15596,0,287,18659,50,412,18705,0,413,22059,50,618,22105,0,618,25751,50,894,25751,40,894,25797,0,894,37069,3,1195,37713,4,1345,38408,1,1495,38408,50,1495,38408,40,1495,38454,0,1495,38690,3,1807,38698,4,1950,38706,5,2096,38706,1,2096,38706,50,2096,38706,40,2096,38752,0,2096,52254,3,3597,53257,50,3942,53257,40,3942,53303,0,3942,64068,3,4693,65381,50,5064,65381,40,5064,65427,0,5064,80591,3,5868,81355,4,6190,82260,5,6565,82261,1,6565,82261,50,6565,82261,40,6565,82307,0,6565,141541,3,10466,142790,4,12416,143871,5,14366,143872,1,14366,143872,50,14368,143872,40,14368,143918,0,14368,193770,3,16919,194736,4,18194,195529,1,19469,195529,50,19471,195529,40,19471,195575,0,19471,235208,3,20972,235809,4,21722,236568,5,22472,236569,1,22472,236569,50,22474,236569,40,22474,236615,0,22474,256169,3,23228,256697,4,23600,257042,5,23975,257043,1,23975,257043,50,23975,257043,40,23975,257089,0,23976,282540,3,25177,283366,4,25777,284084,1,26377,284084,50,26377,284084,40,26377,284130,0,26378,299615,3,27129,300284,4,27504,301020,5,27879,301021,1,27879,301021,50,27879,301021,40,27879,301021,40,27879,301062,0,27879,301140,50,27880,301140,30,27880,301140,40,27880,301181,0,27880)
%
%
% START OF PROOF
% 301142 [] equal(multiply(identity,X),X).
% 301143 [] equal(multiply(inverse(X),X),identity).
% 301144 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 301145 [] -equal(multiply(X,sk_c9),sk_c8) | -equal(inverse(X),sk_c9).
% 301149 [] equal(inverse(sk_c2),sk_c9) | equal(inverse(sk_c4),sk_c9).
% 301150 [?] ?
% 301155 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(inverse(sk_c4),sk_c9).
% 301156 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c4,sk_c9),sk_c8).
% 301161 [] equal(multiply(sk_c9,sk_c3),sk_c8) | equal(inverse(sk_c4),sk_c9).
% 301162 [] equal(multiply(sk_c9,sk_c3),sk_c8) | equal(multiply(sk_c4,sk_c9),sk_c8).
% 301167 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c4),sk_c9).
% 301168 [?] ?
% 301173 [] equal(multiply(sk_c1,sk_c8),sk_c9) | equal(inverse(sk_c4),sk_c9).
% 301174 [] equal(multiply(sk_c1,sk_c8),sk_c9) | equal(multiply(sk_c4,sk_c9),sk_c8).
% 301179 [] equal(multiply(sk_c8,sk_c9),sk_c7) | equal(inverse(sk_c4),sk_c9).
% 301180 [] equal(multiply(sk_c8,sk_c9),sk_c7) | equal(multiply(sk_c4,sk_c9),sk_c8).
% 301188 [hyper:301145,301149,binarycut:301150] equal(inverse(sk_c2),sk_c9).
% 301191 [para:301188.1.1,301143.1.1.1] equal(multiply(sk_c9,sk_c2),identity).
% 301201 [hyper:301145,301167,binarycut:301168] equal(inverse(sk_c1),sk_c8).
% 301202 [para:301201.1.1,301143.1.1.1] equal(multiply(sk_c8,sk_c1),identity).
% 301228 [hyper:301145,301156,301155] equal(multiply(sk_c2,sk_c9),sk_c3).
% 301233 [hyper:301145,301162,301161] equal(multiply(sk_c9,sk_c3),sk_c8).
% 301238 [hyper:301145,301174,301173] equal(multiply(sk_c1,sk_c8),sk_c9).
% 301243 [hyper:301145,301180,301179] equal(multiply(sk_c8,sk_c9),sk_c7).
% 301244 [para:301143.1.1,301144.1.1.1,demod:301142] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 301245 [para:301191.1.1,301144.1.1.1,demod:301142] equal(X,multiply(sk_c9,multiply(sk_c2,X))).
% 301247 [para:301228.1.1,301144.1.1.1] equal(multiply(sk_c3,X),multiply(sk_c2,multiply(sk_c9,X))).
% 301251 [para:301228.1.1,301245.1.2.2,demod:301233] equal(sk_c9,sk_c8).
% 301252 [para:301251.1.2,301202.1.1.1] equal(multiply(sk_c9,sk_c1),identity).
% 301253 [para:301251.1.2,301238.1.1.2] equal(multiply(sk_c1,sk_c9),sk_c9).
% 301254 [para:301251.1.2,301243.1.1.1] equal(multiply(sk_c9,sk_c9),sk_c7).
% 301256 [?] ?
% 301258 [para:301191.1.1,301244.1.2.2] equal(sk_c2,multiply(inverse(sk_c9),identity)).
% 301260 [para:301233.1.1,301244.1.2.2] equal(sk_c3,multiply(inverse(sk_c9),sk_c8)).
% 301264 [para:301252.1.1,301244.1.2.2,demod:301258] equal(sk_c1,sk_c2).
% 301265 [para:301253.1.1,301244.1.2.2,demod:301243,301201] equal(sk_c9,sk_c7).
% 301267 [para:301264.1.2,301228.1.1.1,demod:301253] equal(sk_c9,sk_c3).
% 301272 [para:301265.1.1,301228.1.1.2] equal(multiply(sk_c2,sk_c7),sk_c3).
% 301281 [para:301267.1.1,301245.1.2.1] equal(X,multiply(sk_c3,multiply(sk_c2,X))).
% 301284 [para:301267.1.1,301265.1.1] equal(sk_c3,sk_c7).
% 301288 [para:301284.1.1,301233.1.1.2] equal(multiply(sk_c9,sk_c7),sk_c8).
% 301290 [para:301267.1.1,301254.1.1.1] equal(multiply(sk_c3,sk_c9),sk_c7).
% 301295 [para:301245.1.2,301247.1.2.2,demod:301281] equal(X,multiply(sk_c2,X)).
% 301296 [para:301264.1.2,301247.1.2.1,demod:301256] equal(multiply(sk_c3,X),multiply(sk_c9,X)).
% 301297 [para:301265.1.1,301247.1.2.2.1,demod:301295] equal(multiply(sk_c3,X),multiply(sk_c7,X)).
% 301298 [para:301295.1.2,301245.1.2.2,demod:301297,301296] equal(X,multiply(sk_c7,X)).
% 301300 [para:301298.1.2,301244.1.2.2] equal(X,multiply(inverse(sk_c7),X)).
% 301306 [para:301272.1.1,301245.1.2.2,demod:301233] equal(sk_c7,sk_c8).
% 301312 [para:301300.1.2,301143.1.1] equal(sk_c7,identity).
% 301316 [para:301312.1.1,301288.1.1.2,demod:301298,301297,301296] equal(identity,sk_c8).
% 301319 [para:301316.1.2,301260.1.2.2,demod:301258] equal(sk_c3,sk_c2).
% 301320 [para:301319.1.2,301188.1.1.1] equal(inverse(sk_c3),sk_c9).
% 301331 [hyper:301145,301320,demod:301290,cut:301306] 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 23
% 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(sk_c8,sk_c9),sk_c7) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),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 23
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(41,40,1,87,0,1,1204,50,12,1250,0,12,2929,50,39,2975,0,39,5155,50,78,5201,0,78,7471,50,111,7517,0,111,9992,50,153,10038,0,153,12661,50,208,12707,0,208,15550,50,287,15596,0,287,18659,50,412,18705,0,413,22059,50,618,22105,0,618,25751,50,894,25751,40,894,25797,0,894,37069,3,1195,37713,4,1345,38408,1,1495,38408,50,1495,38408,40,1495,38454,0,1495,38690,3,1807,38698,4,1950,38706,5,2096,38706,1,2096,38706,50,2096,38706,40,2096,38752,0,2096,52254,3,3597,53257,50,3942,53257,40,3942,53303,0,3942,64068,3,4693,65381,50,5064,65381,40,5064,65427,0,5064,80591,3,5868,81355,4,6190,82260,5,6565,82261,1,6565,82261,50,6565,82261,40,6565,82307,0,6565,141541,3,10466,142790,4,12416,143871,5,14366,143872,1,14366,143872,50,14368,143872,40,14368,143918,0,14368,193770,3,16919,194736,4,18194,195529,1,19469,195529,50,19471,195529,40,19471,195575,0,19471,235208,3,20972,235809,4,21722,236568,5,22472,236569,1,22472,236569,50,22474,236569,40,22474,236615,0,22474,256169,3,23228,256697,4,23600,257042,5,23975,257043,1,23975,257043,50,23975,257043,40,23975,257089,0,23976,282540,3,25177,283366,4,25777,284084,1,26377,284084,50,26377,284084,40,26377,284130,0,26378,299615,3,27129,300284,4,27504,301020,5,27879,301021,1,27879,301021,50,27879,301021,40,27879,301021,40,27879,301062,0,27879,301140,50,27880,301140,30,27880,301140,40,27880,301181,0,27880,301330,50,27880,301330,30,27880,301330,40,27880,301371,0,27885)
%
%
% START OF PROOF
% 301331 [] equal(X,X).
% 301335 [] -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9).
% 301336 [] equal(inverse(sk_c2),sk_c9) | equal(inverse(sk_c5),sk_c9).
% 301337 [] equal(multiply(sk_c5,sk_c9),sk_c6) | equal(inverse(sk_c2),sk_c9).
% 301338 [?] ?
% 301342 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(inverse(sk_c5),sk_c9).
% 301343 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c5,sk_c9),sk_c6).
% 301344 [] equal(multiply(sk_c2,sk_c9),sk_c3) | equal(multiply(sk_c9,sk_c6),sk_c8).
% 301348 [?] ?
% 301349 [?] ?
% 301350 [?] ?
% 301399 [hyper:301335,301337,301336,binarycut:301338] equal(inverse(sk_c2),sk_c9).
% 301411 [hyper:301335,301342,demod:301399,cut:301331,binarycut:301348] equal(inverse(sk_c5),sk_c9).
% 301423 [hyper:301335,301343,demod:301399,cut:301331,binarycut:301349] equal(multiply(sk_c5,sk_c9),sk_c6).
% 301445 [hyper:301335,301344,demod:301399,cut:301331,binarycut:301350] equal(multiply(sk_c9,sk_c6),sk_c8).
% 301450 [hyper:301335,301445,301423,demod:301411,cut:301331] 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 23
% 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_c8,sk_c9),sk_c7) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8).
% 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 23
% 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 23
% clause depth limited to 4
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(41,40,1,87,0,1,1204,50,12,1250,0,12,2929,50,39,2975,0,39,5155,50,78,5201,0,78,7471,50,111,7517,0,111,9992,50,153,10038,0,153,12661,50,208,12707,0,208,15550,50,287,15596,0,287,18659,50,412,18705,0,413,22059,50,618,22105,0,618,25751,50,894,25751,40,894,25797,0,894,37069,3,1195,37713,4,1345,38408,1,1495,38408,50,1495,38408,40,1495,38454,0,1495,38690,3,1807,38698,4,1950,38706,5,2096,38706,1,2096,38706,50,2096,38706,40,2096,38752,0,2096,52254,3,3597,53257,50,3942,53257,40,3942,53303,0,3942,64068,3,4693,65381,50,5064,65381,40,5064,65427,0,5064,80591,3,5868,81355,4,6190,82260,5,6565,82261,1,6565,82261,50,6565,82261,40,6565,82307,0,6565,141541,3,10466,142790,4,12416,143871,5,14366,143872,1,14366,143872,50,14368,143872,40,14368,143918,0,14368,193770,3,16919,194736,4,18194,195529,1,19469,195529,50,19471,195529,40,19471,195575,0,19471,235208,3,20972,235809,4,21722,236568,5,22472,236569,1,22472,236569,50,22474,236569,40,22474,236615,0,22474,256169,3,23228,256697,4,23600,257042,5,23975,257043,1,23975,257043,50,23975,257043,40,23975,257089,0,23976,282540,3,25177,283366,4,25777,284084,1,26377,284084,50,26377,284084,40,26377,284130,0,26378,299615,3,27129,300284,4,27504,301020,5,27879,301021,1,27879,301021,50,27879,301021,40,27879,301021,40,27879,301062,0,27879,301140,50,27880,301140,30,27880,301140,40,27880,301181,0,27880,301330,50,27880,301330,30,27880,301330,40,27880,301371,0,27885,301449,50,27885,301449,30,27885,301449,40,27885,301490,0,27885,301599,50,27885,301640,0,27885)
%
%
% START OF PROOF
% 301601 [] equal(multiply(identity,X),X).
% 301602 [] equal(multiply(inverse(X),X),identity).
% 301603 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 301604 [] -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8).
% 301623 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c5),sk_c9).
% 301624 [] equal(multiply(sk_c5,sk_c9),sk_c6) | equal(inverse(sk_c1),sk_c8).
% 301625 [] equal(multiply(sk_c9,sk_c6),sk_c8) | equal(inverse(sk_c1),sk_c8).
% 301626 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c4),sk_c9).
% 301627 [] equal(multiply(sk_c4,sk_c9),sk_c8) | equal(inverse(sk_c1),sk_c8).
% 301628 [] equal(multiply(sk_c9,sk_c8),sk_c7) | equal(inverse(sk_c1),sk_c8).
% 301629 [?] ?
% 301630 [?] ?
% 301631 [?] ?
% 301632 [?] ?
% 301633 [?] ?
% 301634 [?] ?
% 301646 [hyper:301604,301623,binarycut:301629] equal(inverse(sk_c5),sk_c9).
% 301647 [para:301646.1.1,301602.1.1.1] equal(multiply(sk_c9,sk_c5),identity).
% 301650 [hyper:301604,301626,binarycut:301632] equal(inverse(sk_c4),sk_c9).
% 301651 [para:301650.1.1,301602.1.1.1] equal(multiply(sk_c9,sk_c4),identity).
% 301659 [hyper:301604,301624,binarycut:301630] equal(multiply(sk_c5,sk_c9),sk_c6).
% 301662 [hyper:301604,301625,binarycut:301631] equal(multiply(sk_c9,sk_c6),sk_c8).
% 301666 [hyper:301604,301627,binarycut:301633] equal(multiply(sk_c4,sk_c9),sk_c8).
% 301669 [hyper:301604,301628,binarycut:301634] equal(multiply(sk_c9,sk_c8),sk_c7).
% 301670 [para:301602.1.1,301603.1.1.1,demod:301601] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 301671 [para:301647.1.1,301603.1.1.1,demod:301601] equal(X,multiply(sk_c9,multiply(sk_c5,X))).
% 301672 [para:301651.1.1,301603.1.1.1,demod:301601] equal(X,multiply(sk_c9,multiply(sk_c4,X))).
% 301673 [para:301659.1.1,301603.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c5,multiply(sk_c9,X))).
% 301674 [para:301662.1.1,301603.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c9,multiply(sk_c6,X))).
% 301675 [para:301666.1.1,301603.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c4,multiply(sk_c9,X))).
% 301677 [para:301659.1.1,301671.1.2.2,demod:301662] equal(sk_c9,sk_c8).
% 301680 [para:301666.1.1,301672.1.2.2,demod:301669] equal(sk_c9,sk_c7).
% 301682 [para:301602.1.1,301670.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 301683 [para:301647.1.1,301670.1.2.2] equal(sk_c5,multiply(inverse(sk_c9),identity)).
% 301684 [para:301651.1.1,301670.1.2.2,demod:301683] equal(sk_c4,sk_c5).
% 301686 [para:301603.1.1,301670.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 301687 [para:301669.1.1,301670.1.2.2] equal(sk_c8,multiply(inverse(sk_c9),sk_c7)).
% 301688 [para:301671.1.2,301670.1.2.2] equal(multiply(sk_c5,X),multiply(inverse(sk_c9),X)).
% 301689 [para:301672.1.2,301670.1.2.2,demod:301688] equal(multiply(sk_c4,X),multiply(sk_c5,X)).
% 301690 [para:301670.1.2,301670.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 301693 [para:301680.1.1,301659.1.1.2,demod:301689] equal(multiply(sk_c4,sk_c7),sk_c6).
% 301695 [para:301680.1.1,301666.1.1.2,demod:301693] equal(sk_c6,sk_c8).
% 301701 [para:301695.1.2,301669.1.1.2,demod:301662] equal(sk_c8,sk_c7).
% 301702 [para:301695.1.2,301677.1.2] equal(sk_c9,sk_c6).
% 301704 [para:301701.1.1,301695.1.2] equal(sk_c6,sk_c7).
% 301708 [para:301662.1.1,301673.1.2.2,demod:301689] equal(multiply(sk_c6,sk_c6),multiply(sk_c4,sk_c8)).
% 301710 [para:301673.1.2,301671.1.2.2,demod:301674] equal(multiply(sk_c9,X),multiply(sk_c8,X)).
% 301711 [para:301671.1.2,301673.1.2.2,demod:301689] equal(multiply(sk_c6,multiply(sk_c4,X)),multiply(sk_c4,X)).
% 301714 [para:301684.1.2,301673.1.2.1,demod:301710,301675] equal(multiply(sk_c6,X),multiply(sk_c9,X)).
% 301717 [para:301702.1.1,301662.1.1.1,demod:301708] equal(multiply(sk_c4,sk_c8),sk_c8).
% 301718 [para:301702.1.1,301671.1.2.1,demod:301711,301689] equal(X,multiply(sk_c4,X)).
% 301719 [para:301702.1.1,301672.1.2.1,demod:301718] equal(X,multiply(sk_c6,X)).
% 301723 [para:301719.1.2,301670.1.2.2] equal(X,multiply(inverse(sk_c6),X)).
% 301730 [para:301723.1.2,301602.1.1] equal(sk_c6,identity).
% 301732 [para:301730.1.1,301704.1.1] equal(identity,sk_c7).
% 301776 [para:301732.1.2,301687.1.2.2,demod:301683] equal(sk_c8,sk_c5).
% 301780 [para:301776.1.1,301717.1.1.2,demod:301718] equal(sk_c5,sk_c8).
% 301785 [para:301690.1.2,301602.1.1] equal(multiply(X,inverse(X)),identity).
% 301787 [para:301690.1.2,301682.1.2] equal(X,multiply(X,identity)).
% 301788 [para:301787.1.2,301682.1.2] equal(X,inverse(inverse(X))).
% 301789 [para:301787.1.2,301683.1.2] equal(sk_c5,inverse(sk_c9)).
% 301793 [para:301785.1.1,301686.1.2.2.2,demod:301787] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 301803 [para:301710.1.2,301793.1.2.1.1,demod:301719,301714] equal(inverse(X),multiply(inverse(X),sk_c8)).
% 301816 [para:301803.1.2,301690.1.2,demod:301788] equal(multiply(X,sk_c8),X).
% 301817 [hyper:301604,301816,demod:301789,cut:301780] 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 23
% clause depth limited to 4
% seconds given: 4
%
%
% Split component 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c8,sk_c9),sk_c7) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(sk_c8,sk_c9),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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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(41,40,1,87,0,1,1204,50,12,1250,0,12,2929,50,39,2975,0,39,5155,50,78,5201,0,78,7471,50,111,7517,0,111,9992,50,153,10038,0,153,12661,50,208,12707,0,208,15550,50,287,15596,0,287,18659,50,412,18705,0,413,22059,50,618,22105,0,618,25751,50,894,25751,40,894,25797,0,894,37069,3,1195,37713,4,1345,38408,1,1495,38408,50,1495,38408,40,1495,38454,0,1495,38690,3,1807,38698,4,1950,38706,5,2096,38706,1,2096,38706,50,2096,38706,40,2096,38752,0,2096,52254,3,3597,53257,50,3942,53257,40,3942,53303,0,3942,64068,3,4693,65381,50,5064,65381,40,5064,65427,0,5064,80591,3,5868,81355,4,6190,82260,5,6565,82261,1,6565,82261,50,6565,82261,40,6565,82307,0,6565,141541,3,10466,142790,4,12416,143871,5,14366,143872,1,14366,143872,50,14368,143872,40,14368,143918,0,14368,193770,3,16919,194736,4,18194,195529,1,19469,195529,50,19471,195529,40,19471,195575,0,19471,235208,3,20972,235809,4,21722,236568,5,22472,236569,1,22472,236569,50,22474,236569,40,22474,236615,0,22474,256169,3,23228,256697,4,23600,257042,5,23975,257043,1,23975,257043,50,23975,257043,40,23975,257089,0,23976,282540,3,25177,283366,4,25777,284084,1,26377,284084,50,26377,284084,40,26377,284130,0,26378,299615,3,27129,300284,4,27504,301020,5,27879,301021,1,27879,301021,50,27879,301021,40,27879,301021,40,27879,301062,0,27879,301140,50,27880,301140,30,27880,301140,40,27880,301181,0,27880,301330,50,27880,301330,30,27880,301330,40,27880,301371,0,27885,301449,50,27885,301449,30,27885,301449,40,27885,301490,0,27885,301599,50,27885,301640,0,27885,301816,50,27886,301816,30,27886,301816,40,27886,301857,0,27891,301987,50,27892,302028,0,27892,302238,50,27895,302279,0,27900,302512,50,27904,302553,0,27904,302799,50,27910,302840,0,27910,303092,50,27919,303133,0,27924,303393,50,27940,303434,0,27940,303702,50,27970,303743,0,27975,304021,50,28036,304062,0,28036,304350,50,28157,304350,40,28157,304391,0,28157)
%
%
% START OF PROOF
% 304111 [?] ?
% 304352 [] equal(multiply(identity,X),X).
% 304353 [] equal(multiply(inverse(X),X),identity).
% 304354 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 304355 [] -equal(multiply(sk_c8,sk_c9),sk_c7).
% 304386 [?] ?
% 304387 [?] ?
% 304388 [?] ?
% 304434 [input:304386,cut:304355] equal(inverse(sk_c5),sk_c9).
% 304435 [para:304434.1.1,304353.1.1.1] equal(multiply(sk_c9,sk_c5),identity).
% 304452 [input:304387,cut:304355] equal(multiply(sk_c5,sk_c9),sk_c6).
% 304453 [input:304388,cut:304355] equal(multiply(sk_c9,sk_c6),sk_c8).
% 304478 [para:304435.1.1,304354.1.1.1,demod:304352] equal(X,multiply(sk_c9,multiply(sk_c5,X))).
% 304516 [para:304452.1.1,304478.1.2.2] equal(sk_c9,multiply(sk_c9,sk_c6)).
% 304522 [para:304516.1.2,304453.1.1] equal(sk_c9,sk_c8).
% 304524 [para:304522.1.2,304355.1.1.1,cut:304111] 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_c8,sk_c9),sk_c7) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c9,Y),sk_c8) | -equal(multiply(Z,sk_c9),Y) | -equal(inverse(Z),sk_c9) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(sk_c9,sk_c8),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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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(41,40,1,87,0,1,1204,50,12,1250,0,12,2929,50,39,2975,0,39,5155,50,78,5201,0,78,7471,50,111,7517,0,111,9992,50,153,10038,0,153,12661,50,208,12707,0,208,15550,50,287,15596,0,287,18659,50,412,18705,0,413,22059,50,618,22105,0,618,25751,50,894,25751,40,894,25797,0,894,37069,3,1195,37713,4,1345,38408,1,1495,38408,50,1495,38408,40,1495,38454,0,1495,38690,3,1807,38698,4,1950,38706,5,2096,38706,1,2096,38706,50,2096,38706,40,2096,38752,0,2096,52254,3,3597,53257,50,3942,53257,40,3942,53303,0,3942,64068,3,4693,65381,50,5064,65381,40,5064,65427,0,5064,80591,3,5868,81355,4,6190,82260,5,6565,82261,1,6565,82261,50,6565,82261,40,6565,82307,0,6565,141541,3,10466,142790,4,12416,143871,5,14366,143872,1,14366,143872,50,14368,143872,40,14368,143918,0,14368,193770,3,16919,194736,4,18194,195529,1,19469,195529,50,19471,195529,40,19471,195575,0,19471,235208,3,20972,235809,4,21722,236568,5,22472,236569,1,22472,236569,50,22474,236569,40,22474,236615,0,22474,256169,3,23228,256697,4,23600,257042,5,23975,257043,1,23975,257043,50,23975,257043,40,23975,257089,0,23976,282540,3,25177,283366,4,25777,284084,1,26377,284084,50,26377,284084,40,26377,284130,0,26378,299615,3,27129,300284,4,27504,301020,5,27879,301021,1,27879,301021,50,27879,301021,40,27879,301021,40,27879,301062,0,27879,301140,50,27880,301140,30,27880,301140,40,27880,301181,0,27880,301330,50,27880,301330,30,27880,301330,40,27880,301371,0,27885,301449,50,27885,301449,30,27885,301449,40,27885,301490,0,27885,301599,50,27885,301640,0,27885,301816,50,27886,301816,30,27886,301816,40,27886,301857,0,27891,301987,50,27892,302028,0,27892,302238,50,27895,302279,0,27900,302512,50,27904,302553,0,27904,302799,50,27910,302840,0,27910,303092,50,27919,303133,0,27924,303393,50,27940,303434,0,27940,303702,50,27970,303743,0,27975,304021,50,28036,304062,0,28036,304350,50,28157,304350,40,28157,304391,0,28157,304523,50,28158,304523,30,28158,304523,40,28158,304564,0,28158,304689,50,28163,304730,0,28163,304908,50,28166,304949,0,28166,305138,50,28170,305179,0,28175,305389,50,28182,305430,0,28182,305647,50,28195,305688,0,28195,305913,50,28214,305954,0,28219,306188,50,28254,306229,0,28254,306473,50,28327,306514,0,28327,306769,50,28462,306769,40,28462,306810,0,28462)
%
%
% START OF PROOF
% 306565 [?] ?
% 306771 [] equal(multiply(identity,X),X).
% 306772 [] equal(multiply(inverse(X),X),identity).
% 306773 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 306774 [] -equal(multiply(sk_c9,sk_c8),sk_c7).
% 306780 [?] ?
% 306786 [?] ?
% 306792 [?] ?
% 306829 [input:306780,cut:306774] equal(inverse(sk_c2),sk_c9).
% 306830 [para:306829.1.1,306772.1.1.1] equal(multiply(sk_c9,sk_c2),identity).
% 306861 [input:306786,cut:306774] equal(multiply(sk_c2,sk_c9),sk_c3).
% 306866 [input:306792,cut:306774] equal(multiply(sk_c9,sk_c3),sk_c8).
% 306879 [para:306830.1.1,306773.1.1.1,demod:306771] equal(X,multiply(sk_c9,multiply(sk_c2,X))).
% 306929 [para:306861.1.1,306879.1.2.2] equal(sk_c9,multiply(sk_c9,sk_c3)).
% 306935 [para:306929.1.2,306866.1.1] equal(sk_c9,sk_c8).
% 306937 [para:306935.1.2,306774.1.1.2,cut:306565] 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: 41842
% derived clauses: 3997620
% kept clauses: 237060
% kept size sum: 839474
% kept mid-nuclei: 21565
% kept new demods: 4343
% forw unit-subs: 1248904
% forw double-subs: 2299605
% forw overdouble-subs: 143031
% backward subs: 35049
% fast unit cutoff: 18712
% full unit cutoff: 0
% dbl unit cutoff: 7746
% real runtime : 286.29
% process. runtime: 284.62
% specific non-discr-tree subsumption statistics:
% tried: 27864334
% length fails: 2312730
% strength fails: 8568150
% predlist fails: 1152578
% aux str. fails: 6787874
% by-lit fails: 5351514
% full subs tried: 988817
% full subs fail: 921657
%
% ; 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/GRP322-1+eq_r.in")
%
%------------------------------------------------------------------------------