TSTP Solution File: GRP306-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP306-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 : art05.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 298.7s
% Output : Assurance 298.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/GRP306-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 3 19)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 19)
% (binary-posweight-lex-big-order 30 #f 3 19)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(multiply(sk_c8,sk_c7),sk_c6) | -equal(inverse(sk_c8),sk_c6) | -equal(multiply(X,Y),sk_c8) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),sk_c8) | -equal(multiply(sk_c8,U),sk_c7) | -equal(multiply(V,sk_c8),U) | -equal(inverse(V),sk_c8).
% was split for some strategies as:
% -equal(multiply(sk_c8,U),sk_c7) | -equal(multiply(V,sk_c8),U) | -equal(inverse(V),sk_c8).
% -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),sk_c8).
% -equal(multiply(X,Y),sk_c8) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c7),sk_c8).
% -equal(multiply(sk_c8,sk_c7),sk_c6).
% -equal(inverse(sk_c8),sk_c6).
%
% Starting a split proof attempt with 5 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c8,sk_c7),sk_c6) | -equal(inverse(sk_c8),sk_c6) | -equal(multiply(X,Y),sk_c8) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),sk_c8) | -equal(multiply(sk_c8,U),sk_c7) | -equal(multiply(V,sk_c8),U) | -equal(inverse(V),sk_c8).
% Split part used next: -equal(multiply(sk_c8,U),sk_c7) | -equal(multiply(V,sk_c8),U) | -equal(inverse(V),sk_c8).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(26,40,0,56,0,0,995,50,9,1025,0,9,2399,50,23,2429,0,23,3997,50,39,4027,0,39,5765,50,56,5795,0,56,7664,50,80,7694,0,80,9749,50,123,9779,0,123,12007,50,207,12037,0,207,14493,50,348,14523,0,348,17193,50,598,17223,0,598,20163,50,1120,20163,40,1120,20193,0,1120,30952,3,1421,31661,4,1571,32346,5,1721,32347,1,1721,32347,50,1721,32347,40,1721,32377,0,1721,32969,3,2022,33017,4,2196,33024,5,2322,33024,1,2322,33024,50,2322,33024,40,2322,33054,0,2322,60071,3,3825,60872,4,4573,61383,1,5323,61383,50,5323,61383,40,5323,61413,0,5324,81230,3,6075,81720,4,6450,82168,1,6825,82168,50,6826,82168,40,6826,82198,0,6826,104135,3,7586,104580,4,7952,105496,5,8327,105497,1,8327,105497,50,8327,105497,40,8327,105527,0,8327,140483,3,12228,142431,4,14178,143708,1,16128,143708,50,16129,143708,40,16129,143738,0,16129,173183,3,18684,174681,4,19955,175839,1,21230,175839,50,21231,175839,40,21231,175869,0,21231,203604,3,22739,204665,4,23482,206221,5,24232,206222,1,24232,206222,50,24233,206222,40,24233,206252,0,24233,224382,3,24984,225214,4,25359,226419,5,25734,226420,1,25734,226420,50,25734,226420,40,25734,226450,0,25734,251976,3,26936,252878,4,27535,253774,5,28135,253775,1,28135,253775,50,28136,253775,40,28136,253805,0,28136,271996,3,28887,272742,4,29262,273573,1,29637,273573,50,29637,273573,40,29637,273573,40,29637,273599,0,29637)
%
%
% START OF PROOF
% 273575 [] equal(multiply(identity,X),X).
% 273576 [] equal(multiply(inverse(X),X),identity).
% 273577 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 273578 [] -equal(multiply(sk_c8,X),sk_c7) | -equal(multiply(Y,sk_c8),X) | -equal(inverse(Y),sk_c8).
% 273579 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 273580 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(multiply(sk_c4,sk_c8),sk_c5).
% 273581 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(multiply(sk_c8,sk_c5),sk_c7).
% 273584 [] equal(inverse(sk_c1),sk_c2) | equal(inverse(sk_c4),sk_c8).
% 273585 [] equal(multiply(sk_c4,sk_c8),sk_c5) | equal(inverse(sk_c1),sk_c2).
% 273586 [?] ?
% 273589 [] equal(multiply(sk_c1,sk_c2),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 273590 [] equal(multiply(sk_c1,sk_c2),sk_c8) | equal(multiply(sk_c4,sk_c8),sk_c5).
% 273591 [] equal(multiply(sk_c1,sk_c2),sk_c8) | equal(multiply(sk_c8,sk_c5),sk_c7).
% 273594 [] equal(inverse(sk_c8),sk_c6) | equal(inverse(sk_c4),sk_c8).
% 273595 [] equal(multiply(sk_c4,sk_c8),sk_c5) | equal(inverse(sk_c8),sk_c6).
% 273596 [?] ?
% 273599 [] equal(multiply(sk_c8,sk_c7),sk_c6).
% 273638 [hyper:273578,273585,273584,binarycut:273586] equal(inverse(sk_c1),sk_c2).
% 273639 [para:273638.1.1,273576.1.1.1] equal(multiply(sk_c2,sk_c1),identity).
% 273658 [hyper:273578,273581,273580,273579] equal(multiply(sk_c2,sk_c7),sk_c8).
% 273662 [hyper:273578,273595,273594,binarycut:273596] equal(inverse(sk_c8),sk_c6).
% 273663 [para:273662.1.1,273576.1.1.1] equal(multiply(sk_c6,sk_c8),identity).
% 273673 [hyper:273578,273591,273590,273589] equal(multiply(sk_c1,sk_c2),sk_c8).
% 273674 [para:273599.1.1,273577.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c8,multiply(sk_c7,X))).
% 273675 [para:273576.1.1,273577.1.1.1,demod:273575] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 273676 [para:273639.1.1,273577.1.1.1,demod:273575] equal(X,multiply(sk_c2,multiply(sk_c1,X))).
% 273677 [para:273658.1.1,273577.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c2,multiply(sk_c7,X))).
% 273678 [para:273663.1.1,273577.1.1.1,demod:273575] equal(X,multiply(sk_c6,multiply(sk_c8,X))).
% 273679 [para:273673.1.1,273577.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c1,multiply(sk_c2,X))).
% 273682 [para:273673.1.1,273676.1.2.2] equal(sk_c2,multiply(sk_c2,sk_c8)).
% 273687 [para:273599.1.1,273678.1.2.2] equal(sk_c7,multiply(sk_c6,sk_c6)).
% 273689 [para:273674.1.2,273678.1.2.2] equal(multiply(sk_c7,X),multiply(sk_c6,multiply(sk_c6,X))).
% 273696 [para:273676.1.2,273675.1.2.2] equal(multiply(sk_c1,X),multiply(inverse(sk_c2),X)).
% 273697 [para:273678.1.2,273675.1.2.2] equal(multiply(sk_c8,X),multiply(inverse(sk_c6),X)).
% 273700 [para:273677.1.2,273675.1.2.2,demod:273696] equal(multiply(sk_c7,X),multiply(sk_c1,multiply(sk_c8,X))).
% 273706 [para:273658.1.1,273679.1.2.2,demod:273599] equal(sk_c6,multiply(sk_c1,sk_c8)).
% 273708 [para:273682.1.2,273679.1.2.2,demod:273673] equal(multiply(sk_c8,sk_c8),sk_c8).
% 273709 [para:273677.1.2,273679.1.2.2,demod:273700,273674] equal(multiply(sk_c6,X),multiply(sk_c7,X)).
% 273714 [para:273678.1.2,273689.1.2.2,demod:273678,273709] equal(X,multiply(sk_c6,X)).
% 273715 [para:273689.1.2,273675.1.2.2,demod:273697,273709,273714] equal(X,multiply(sk_c8,X)).
% 273719 [para:273714.1.2,273687.1.2] equal(sk_c7,sk_c6).
% 273720 [para:273687.1.2,273714.1.2] equal(sk_c6,sk_c7).
% 273724 [para:273719.1.1,273677.1.2.2.1,demod:273714,273715] equal(X,multiply(sk_c2,X)).
% 273732 [para:273724.1.2,273639.1.1] equal(sk_c1,identity).
% 273733 [para:273724.1.2,273658.1.1] equal(sk_c7,sk_c8).
% 273738 [para:273732.1.1,273706.1.2.1,demod:273575] equal(sk_c6,sk_c8).
% 273739 [para:273733.1.2,273662.1.1.1] equal(inverse(sk_c7),sk_c6).
% 273763 [hyper:273578,273700,demod:273739,273715,273706,273708,cut:273720,cut:273738] 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: 6
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c8,sk_c7),sk_c6) | -equal(inverse(sk_c8),sk_c6) | -equal(multiply(X,Y),sk_c8) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),sk_c8) | -equal(multiply(sk_c8,U),sk_c7) | -equal(multiply(V,sk_c8),U) | -equal(inverse(V),sk_c8).
% Split part used next: -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),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 19
% clause depth limited to 3
% seconds given: 6
%
%
% 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: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(26,40,0,56,0,0,995,50,9,1025,0,9,2399,50,23,2429,0,23,3997,50,39,4027,0,39,5765,50,56,5795,0,56,7664,50,80,7694,0,80,9749,50,123,9779,0,123,12007,50,207,12037,0,207,14493,50,348,14523,0,348,17193,50,598,17223,0,598,20163,50,1120,20163,40,1120,20193,0,1120,30952,3,1421,31661,4,1571,32346,5,1721,32347,1,1721,32347,50,1721,32347,40,1721,32377,0,1721,32969,3,2022,33017,4,2196,33024,5,2322,33024,1,2322,33024,50,2322,33024,40,2322,33054,0,2322,60071,3,3825,60872,4,4573,61383,1,5323,61383,50,5323,61383,40,5323,61413,0,5324,81230,3,6075,81720,4,6450,82168,1,6825,82168,50,6826,82168,40,6826,82198,0,6826,104135,3,7586,104580,4,7952,105496,5,8327,105497,1,8327,105497,50,8327,105497,40,8327,105527,0,8327,140483,3,12228,142431,4,14178,143708,1,16128,143708,50,16129,143708,40,16129,143738,0,16129,173183,3,18684,174681,4,19955,175839,1,21230,175839,50,21231,175839,40,21231,175869,0,21231,203604,3,22739,204665,4,23482,206221,5,24232,206222,1,24232,206222,50,24233,206222,40,24233,206252,0,24233,224382,3,24984,225214,4,25359,226419,5,25734,226420,1,25734,226420,50,25734,226420,40,25734,226450,0,25734,251976,3,26936,252878,4,27535,253774,5,28135,253775,1,28135,253775,50,28136,253775,40,28136,253805,0,28136,271996,3,28887,272742,4,29262,273573,1,29637,273573,50,29637,273573,40,29637,273573,40,29637,273599,0,29637,273762,50,29638,273762,30,29638,273762,40,29638,273788,0,29638,273890,50,29639,273916,0,29641)
%
%
% START OF PROOF
% 273892 [] equal(multiply(identity,X),X).
% 273893 [] equal(multiply(inverse(X),X),identity).
% 273894 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 273895 [] -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% 273899 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(inverse(sk_c3),sk_c8).
% 273900 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(multiply(sk_c3,sk_c8),sk_c7).
% 273904 [] equal(inverse(sk_c1),sk_c2) | equal(inverse(sk_c3),sk_c8).
% 273905 [?] ?
% 273909 [] equal(multiply(sk_c1,sk_c2),sk_c8) | equal(inverse(sk_c3),sk_c8).
% 273910 [] equal(multiply(sk_c1,sk_c2),sk_c8) | equal(multiply(sk_c3,sk_c8),sk_c7).
% 273914 [] equal(inverse(sk_c8),sk_c6) | equal(inverse(sk_c3),sk_c8).
% 273915 [?] ?
% 273916 [] equal(multiply(sk_c8,sk_c7),sk_c6).
% 273922 [hyper:273895,273904,binarycut:273905] equal(inverse(sk_c1),sk_c2).
% 273923 [para:273922.1.1,273893.1.1.1] equal(multiply(sk_c2,sk_c1),identity).
% 273929 [hyper:273895,273914,binarycut:273915] equal(inverse(sk_c8),sk_c6).
% 273933 [para:273929.1.1,273893.1.1.1] equal(multiply(sk_c6,sk_c8),identity).
% 273947 [hyper:273895,273900,273899] equal(multiply(sk_c2,sk_c7),sk_c8).
% 273952 [hyper:273895,273910,273909] equal(multiply(sk_c1,sk_c2),sk_c8).
% 273953 [para:273916.1.1,273894.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c8,multiply(sk_c7,X))).
% 273954 [para:273893.1.1,273894.1.1.1,demod:273892] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 273955 [para:273923.1.1,273894.1.1.1,demod:273892] equal(X,multiply(sk_c2,multiply(sk_c1,X))).
% 273956 [para:273933.1.1,273894.1.1.1,demod:273892] equal(X,multiply(sk_c6,multiply(sk_c8,X))).
% 273957 [para:273947.1.1,273894.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c2,multiply(sk_c7,X))).
% 273958 [para:273952.1.1,273894.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c1,multiply(sk_c2,X))).
% 273959 [para:273952.1.1,273955.1.2.2] equal(sk_c2,multiply(sk_c2,sk_c8)).
% 273964 [para:273893.1.1,273954.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 273968 [para:273894.1.1,273954.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 273969 [para:273955.1.2,273954.1.2.2] equal(multiply(sk_c1,X),multiply(inverse(sk_c2),X)).
% 273971 [para:273954.1.2,273954.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 273972 [para:273957.1.2,273954.1.2.2,demod:273969] equal(multiply(sk_c7,X),multiply(sk_c1,multiply(sk_c8,X))).
% 273974 [para:273947.1.1,273958.1.2.2,demod:273916] equal(sk_c6,multiply(sk_c1,sk_c8)).
% 273976 [para:273959.1.2,273958.1.2.2,demod:273952] equal(multiply(sk_c8,sk_c8),sk_c8).
% 273977 [para:273957.1.2,273958.1.2.2,demod:273972,273953] equal(multiply(sk_c6,X),multiply(sk_c7,X)).
% 273980 [para:273976.1.1,273956.1.2.2,demod:273933] equal(sk_c8,identity).
% 273981 [para:273980.1.1,273916.1.1.1,demod:273892] equal(sk_c7,sk_c6).
% 273985 [para:273980.1.1,273956.1.2.2.1,demod:273892] equal(X,multiply(sk_c6,X)).
% 273989 [para:273981.1.1,273953.1.2.2.1,demod:273985] equal(X,multiply(sk_c8,X)).
% 273990 [para:273981.1.1,273957.1.2.2.1,demod:273985,273989] equal(X,multiply(sk_c2,X)).
% 273993 [para:273990.1.2,273923.1.1] equal(sk_c1,identity).
% 273994 [para:273990.1.2,273947.1.1] equal(sk_c7,sk_c8).
% 273999 [para:273993.1.1,273974.1.2.1,demod:273892] equal(sk_c6,sk_c8).
% 274000 [para:273994.1.2,273929.1.1.1] equal(inverse(sk_c7),sk_c6).
% 274032 [para:273971.1.2,273893.1.1] equal(multiply(X,inverse(X)),identity).
% 274034 [para:273971.1.2,273964.1.2] equal(X,multiply(X,identity)).
% 274035 [para:274034.1.2,273964.1.2] equal(X,inverse(inverse(X))).
% 274037 [para:274032.1.1,273968.1.2.2.2,demod:274034] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 274042 [para:273953.1.2,274037.1.2.1.1,demod:273985,273977] equal(inverse(X),multiply(inverse(X),sk_c8)).
% 274051 [para:274042.1.2,273971.1.2,demod:274035] equal(multiply(X,sk_c8),X).
% 274052 [hyper:273895,274051,demod:274000,cut:273999] 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: 6
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c8,sk_c7),sk_c6) | -equal(inverse(sk_c8),sk_c6) | -equal(multiply(X,Y),sk_c8) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),sk_c8) | -equal(multiply(sk_c8,U),sk_c7) | -equal(multiply(V,sk_c8),U) | -equal(inverse(V),sk_c8).
% Split part used next: -equal(multiply(X,Y),sk_c8) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c7),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 19
% clause depth limited to 3
% seconds given: 6
%
%
% 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: 6
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(26,40,0,56,0,0,995,50,9,1025,0,9,2399,50,23,2429,0,23,3997,50,39,4027,0,39,5765,50,56,5795,0,56,7664,50,80,7694,0,80,9749,50,123,9779,0,123,12007,50,207,12037,0,207,14493,50,348,14523,0,348,17193,50,598,17223,0,598,20163,50,1120,20163,40,1120,20193,0,1120,30952,3,1421,31661,4,1571,32346,5,1721,32347,1,1721,32347,50,1721,32347,40,1721,32377,0,1721,32969,3,2022,33017,4,2196,33024,5,2322,33024,1,2322,33024,50,2322,33024,40,2322,33054,0,2322,60071,3,3825,60872,4,4573,61383,1,5323,61383,50,5323,61383,40,5323,61413,0,5324,81230,3,6075,81720,4,6450,82168,1,6825,82168,50,6826,82168,40,6826,82198,0,6826,104135,3,7586,104580,4,7952,105496,5,8327,105497,1,8327,105497,50,8327,105497,40,8327,105527,0,8327,140483,3,12228,142431,4,14178,143708,1,16128,143708,50,16129,143708,40,16129,143738,0,16129,173183,3,18684,174681,4,19955,175839,1,21230,175839,50,21231,175839,40,21231,175869,0,21231,203604,3,22739,204665,4,23482,206221,5,24232,206222,1,24232,206222,50,24233,206222,40,24233,206252,0,24233,224382,3,24984,225214,4,25359,226419,5,25734,226420,1,25734,226420,50,25734,226420,40,25734,226450,0,25734,251976,3,26936,252878,4,27535,253774,5,28135,253775,1,28135,253775,50,28136,253775,40,28136,253805,0,28136,271996,3,28887,272742,4,29262,273573,1,29637,273573,50,29637,273573,40,29637,273573,40,29637,273599,0,29637,273762,50,29638,273762,30,29638,273762,40,29638,273788,0,29638,273890,50,29639,273916,0,29641,274051,50,29642,274051,30,29642,274051,40,29642,274077,0,29642,274229,50,29643,274255,0,29643)
%
%
% START OF PROOF
% 274231 [] equal(multiply(identity,X),X).
% 274232 [] equal(multiply(inverse(X),X),identity).
% 274233 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 274234 [] -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,X),sk_c8) | -equal(inverse(Y),X).
% 274235 [?] ?
% 274236 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(multiply(sk_c4,sk_c8),sk_c5).
% 274237 [?] ?
% 274238 [?] ?
% 274239 [?] ?
% 274240 [] equal(inverse(sk_c1),sk_c2) | equal(inverse(sk_c4),sk_c8).
% 274241 [] equal(multiply(sk_c4,sk_c8),sk_c5) | equal(inverse(sk_c1),sk_c2).
% 274242 [] equal(multiply(sk_c8,sk_c5),sk_c7) | equal(inverse(sk_c1),sk_c2).
% 274243 [] equal(inverse(sk_c1),sk_c2) | equal(inverse(sk_c3),sk_c8).
% 274244 [] equal(multiply(sk_c3,sk_c8),sk_c7) | equal(inverse(sk_c1),sk_c2).
% 274245 [?] ?
% 274246 [?] ?
% 274247 [?] ?
% 274248 [?] ?
% 274249 [?] ?
% 274255 [] equal(multiply(sk_c8,sk_c7),sk_c6).
% 274260 [hyper:274234,274240,binarycut:274245,binarycut:274235] equal(inverse(sk_c4),sk_c8).
% 274264 [para:274260.1.1,274232.1.1.1] equal(multiply(sk_c8,sk_c4),identity).
% 274268 [hyper:274234,274243,binarycut:274248,binarycut:274238] equal(inverse(sk_c3),sk_c8).
% 274272 [para:274268.1.1,274232.1.1.1] equal(multiply(sk_c8,sk_c3),identity).
% 274281 [hyper:274234,274241,binarycut:274246,binarycut:274236] equal(multiply(sk_c4,sk_c8),sk_c5).
% 274284 [hyper:274234,274242,binarycut:274247,binarycut:274237] equal(multiply(sk_c8,sk_c5),sk_c7).
% 274287 [hyper:274234,274244,binarycut:274249,binarycut:274239] equal(multiply(sk_c3,sk_c8),sk_c7).
% 274288 [para:274255.1.1,274233.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c8,multiply(sk_c7,X))).
% 274289 [para:274232.1.1,274233.1.1.1,demod:274231] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 274290 [para:274264.1.1,274233.1.1.1,demod:274231] equal(X,multiply(sk_c8,multiply(sk_c4,X))).
% 274291 [para:274272.1.1,274233.1.1.1,demod:274231] equal(X,multiply(sk_c8,multiply(sk_c3,X))).
% 274294 [para:274287.1.1,274233.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c3,multiply(sk_c8,X))).
% 274297 [para:274281.1.1,274290.1.2.2,demod:274284] equal(sk_c8,sk_c7).
% 274299 [para:274297.1.1,274264.1.1.1] equal(multiply(sk_c7,sk_c4),identity).
% 274300 [para:274297.1.1,274272.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 274302 [para:274297.1.1,274284.1.1.1] equal(multiply(sk_c7,sk_c5),sk_c7).
% 274304 [para:274297.1.1,274290.1.2.1] equal(X,multiply(sk_c7,multiply(sk_c4,X))).
% 274307 [para:274299.1.1,274288.1.2.2] equal(multiply(sk_c6,sk_c4),multiply(sk_c8,identity)).
% 274308 [para:274300.1.1,274233.1.1.1,demod:274231] equal(X,multiply(sk_c7,multiply(sk_c3,X))).
% 274309 [para:274300.1.1,274288.1.2.2,demod:274307] equal(multiply(sk_c6,sk_c3),multiply(sk_c6,sk_c4)).
% 274311 [para:274231.1.1,274289.1.2.2] equal(X,multiply(inverse(identity),X)).
% 274312 [para:274255.1.1,274289.1.2.2] equal(sk_c7,multiply(inverse(sk_c8),sk_c6)).
% 274313 [para:274232.1.1,274289.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 274315 [para:274264.1.1,274289.1.2.2] equal(sk_c4,multiply(inverse(sk_c8),identity)).
% 274316 [para:274272.1.1,274289.1.2.2,demod:274315] equal(sk_c3,sk_c4).
% 274318 [para:274287.1.1,274289.1.2.2,demod:274255,274268] equal(sk_c8,sk_c6).
% 274319 [para:274233.1.1,274289.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 274320 [para:274290.1.2,274289.1.2.2] equal(multiply(sk_c4,X),multiply(inverse(sk_c8),X)).
% 274324 [para:274289.1.2,274289.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 274325 [para:274316.1.2,274281.1.1.1,demod:274287] equal(sk_c7,sk_c5).
% 274328 [para:274291.1.2,274289.1.2.2,demod:274320] equal(multiply(sk_c3,X),multiply(sk_c4,X)).
% 274330 [para:274318.1.1,274264.1.1.1,demod:274309] equal(multiply(sk_c6,sk_c3),identity).
% 274335 [para:274318.1.1,274297.1.1] equal(sk_c6,sk_c7).
% 274344 [para:274335.1.2,274325.1.1] equal(sk_c6,sk_c5).
% 274354 [para:274302.1.1,274289.1.2.2,demod:274232] equal(sk_c5,identity).
% 274355 [para:274354.1.1,274284.1.1.2,demod:274330,274309,274307] equal(identity,sk_c7).
% 274356 [para:274354.1.1,274344.1.2] equal(sk_c6,identity).
% 274359 [para:274355.1.2,274299.1.1.1,demod:274231] equal(sk_c4,identity).
% 274362 [para:274359.1.1,274260.1.1.1] equal(inverse(identity),sk_c8).
% 274367 [para:274290.1.2,274294.1.2.2,demod:274308,274328] equal(X,multiply(sk_c3,X)).
% 274393 [para:274356.1.1,274312.1.2.2,demod:274315] equal(sk_c7,sk_c4).
% 274396 [para:274393.1.1,274335.1.2] equal(sk_c6,sk_c4).
% 274402 [para:274396.1.2,274260.1.1.1] equal(inverse(sk_c6),sk_c8).
% 274432 [para:274324.1.2,274232.1.1] equal(multiply(X,inverse(X)),identity).
% 274434 [para:274324.1.2,274313.1.2] equal(X,multiply(X,identity)).
% 274438 [para:274434.1.2,274311.1.2,demod:274362] equal(identity,sk_c8).
% 274446 [para:274432.1.1,274319.1.2.2.2,demod:274434] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 274453 [para:274290.1.2,274446.1.2.1.1,demod:274367,274328] equal(inverse(X),multiply(inverse(X),sk_c8)).
% 274458 [para:274304.1.2,274446.1.2.1.1,demod:274367,274328] equal(inverse(X),multiply(inverse(X),sk_c7)).
% 274463 [hyper:274234,274453,demod:274458,274432,274453,cut:274438,slowcut:274402] 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: 6
%
%
% Split component 4 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c8,sk_c7),sk_c6) | -equal(inverse(sk_c8),sk_c6) | -equal(multiply(X,Y),sk_c8) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),sk_c8) | -equal(multiply(sk_c8,U),sk_c7) | -equal(multiply(V,sk_c8),U) | -equal(inverse(V),sk_c8).
% Split part used next: -equal(multiply(sk_c8,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: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(26,40,0,56,0,0,995,50,9,1025,0,9,2399,50,23,2429,0,23,3997,50,39,4027,0,39,5765,50,56,5795,0,56,7664,50,80,7694,0,80,9749,50,123,9779,0,123,12007,50,207,12037,0,207,14493,50,348,14523,0,348,17193,50,598,17223,0,598,20163,50,1120,20163,40,1120,20193,0,1120,30952,3,1421,31661,4,1571,32346,5,1721,32347,1,1721,32347,50,1721,32347,40,1721,32377,0,1721,32969,3,2022,33017,4,2196,33024,5,2322,33024,1,2322,33024,50,2322,33024,40,2322,33054,0,2322,60071,3,3825,60872,4,4573,61383,1,5323,61383,50,5323,61383,40,5323,61413,0,5324,81230,3,6075,81720,4,6450,82168,1,6825,82168,50,6826,82168,40,6826,82198,0,6826,104135,3,7586,104580,4,7952,105496,5,8327,105497,1,8327,105497,50,8327,105497,40,8327,105527,0,8327,140483,3,12228,142431,4,14178,143708,1,16128,143708,50,16129,143708,40,16129,143738,0,16129,173183,3,18684,174681,4,19955,175839,1,21230,175839,50,21231,175839,40,21231,175869,0,21231,203604,3,22739,204665,4,23482,206221,5,24232,206222,1,24232,206222,50,24233,206222,40,24233,206252,0,24233,224382,3,24984,225214,4,25359,226419,5,25734,226420,1,25734,226420,50,25734,226420,40,25734,226450,0,25734,251976,3,26936,252878,4,27535,253774,5,28135,253775,1,28135,253775,50,28136,253775,40,28136,253805,0,28136,271996,3,28887,272742,4,29262,273573,1,29637,273573,50,29637,273573,40,29637,273573,40,29637,273599,0,29637,273762,50,29638,273762,30,29638,273762,40,29638,273788,0,29638,273890,50,29639,273916,0,29641,274051,50,29642,274051,30,29642,274051,40,29642,274077,0,29642,274229,50,29643,274255,0,29643,274462,50,29645,274462,30,29645,274462,40,29645,274488,0,29646)
%
%
% START OF PROOF
% 274467 [] -equal(multiply(sk_c8,sk_c7),sk_c6).
% 274488 [] equal(multiply(sk_c8,sk_c7),sk_c6).
% 274489 [hyper:274467,274488] 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: 6
%
%
% Split component 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c8,sk_c7),sk_c6) | -equal(inverse(sk_c8),sk_c6) | -equal(multiply(X,Y),sk_c8) | -equal(inverse(X),Y) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),sk_c8) | -equal(multiply(sk_c8,U),sk_c7) | -equal(multiply(V,sk_c8),U) | -equal(inverse(V),sk_c8).
% Split part used next: -equal(inverse(sk_c8),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: 6
%
%
% 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: 6
%
%
% 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: 6
%
%
% 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: 6
%
%
% 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: 6
%
%
% 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: 6
%
%
% 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: 6
%
%
% 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: 6
%
%
% 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: 6
%
%
% 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 12
% seconds given: 6
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(26,40,0,56,0,0,995,50,9,1025,0,9,2399,50,23,2429,0,23,3997,50,39,4027,0,39,5765,50,56,5795,0,56,7664,50,80,7694,0,80,9749,50,123,9779,0,123,12007,50,207,12037,0,207,14493,50,348,14523,0,348,17193,50,598,17223,0,598,20163,50,1120,20163,40,1120,20193,0,1120,30952,3,1421,31661,4,1571,32346,5,1721,32347,1,1721,32347,50,1721,32347,40,1721,32377,0,1721,32969,3,2022,33017,4,2196,33024,5,2322,33024,1,2322,33024,50,2322,33024,40,2322,33054,0,2322,60071,3,3825,60872,4,4573,61383,1,5323,61383,50,5323,61383,40,5323,61413,0,5324,81230,3,6075,81720,4,6450,82168,1,6825,82168,50,6826,82168,40,6826,82198,0,6826,104135,3,7586,104580,4,7952,105496,5,8327,105497,1,8327,105497,50,8327,105497,40,8327,105527,0,8327,140483,3,12228,142431,4,14178,143708,1,16128,143708,50,16129,143708,40,16129,143738,0,16129,173183,3,18684,174681,4,19955,175839,1,21230,175839,50,21231,175839,40,21231,175869,0,21231,203604,3,22739,204665,4,23482,206221,5,24232,206222,1,24232,206222,50,24233,206222,40,24233,206252,0,24233,224382,3,24984,225214,4,25359,226419,5,25734,226420,1,25734,226420,50,25734,226420,40,25734,226450,0,25734,251976,3,26936,252878,4,27535,253774,5,28135,253775,1,28135,253775,50,28136,253775,40,28136,253805,0,28136,271996,3,28887,272742,4,29262,273573,1,29637,273573,50,29637,273573,40,29637,273573,40,29637,273599,0,29637,273762,50,29638,273762,30,29638,273762,40,29638,273788,0,29638,273890,50,29639,273916,0,29641,274051,50,29642,274051,30,29642,274051,40,29642,274077,0,29642,274229,50,29643,274255,0,29643,274462,50,29645,274462,30,29645,274462,40,29645,274488,0,29646,274488,50,29646,274488,30,29646,274488,40,29646,274514,0,29646,274636,50,29647,274662,0,29650,274833,50,29653,274859,0,29654,275038,50,29658,275064,0,29659,275251,50,29666,275277,0,29667,275470,50,29677,275496,0,29677,275697,50,29697,275723,0,29697,275932,50,29733,275958,0,29733,276177,50,29801,276203,0,29801,276432,50,29930,276458,0,29930,276699,4,30164)
%
%
% START OF PROOF
% 276434 [] equal(multiply(identity,X),X).
% 276435 [] equal(multiply(inverse(X),X),identity).
% 276436 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 276437 [] -equal(inverse(sk_c8),sk_c6).
% 276453 [?] ?
% 276454 [?] ?
% 276455 [?] ?
% 276456 [?] ?
% 276457 [?] ?
% 276458 [] equal(multiply(sk_c8,sk_c7),sk_c6).
% 276462 [input:276453,cut:276437] equal(inverse(sk_c4),sk_c8).
% 276463 [para:276462.1.1,276435.1.1.1] equal(multiply(sk_c8,sk_c4),identity).
% 276464 [input:276456,cut:276437] equal(inverse(sk_c3),sk_c8).
% 276465 [para:276464.1.1,276435.1.1.1] equal(multiply(sk_c8,sk_c3),identity).
% 276474 [input:276454,cut:276437] equal(multiply(sk_c4,sk_c8),sk_c5).
% 276475 [input:276455,cut:276437] equal(multiply(sk_c8,sk_c5),sk_c7).
% 276476 [input:276457,cut:276437] equal(multiply(sk_c3,sk_c8),sk_c7).
% 276481 [para:276458.1.1,276436.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c8,multiply(sk_c7,X))).
% 276482 [para:276435.1.1,276436.1.1.1,demod:276434] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 276483 [para:276463.1.1,276436.1.1.1,demod:276434] equal(X,multiply(sk_c8,multiply(sk_c4,X))).
% 276484 [para:276465.1.1,276436.1.1.1,demod:276434] equal(X,multiply(sk_c8,multiply(sk_c3,X))).
% 276486 [para:276475.1.1,276436.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c8,multiply(sk_c5,X))).
% 276487 [para:276476.1.1,276436.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c3,multiply(sk_c8,X))).
% 276488 [para:276474.1.1,276483.1.2.2] equal(sk_c8,multiply(sk_c8,sk_c5)).
% 276489 [para:276488.1.2,276475.1.1] equal(sk_c8,sk_c7).
% 276490 [para:276488.1.2,276436.1.1.1,demod:276486] equal(multiply(sk_c8,X),multiply(sk_c7,X)).
% 276491 [para:276489.1.1,276458.1.1.1] equal(multiply(sk_c7,sk_c7),sk_c6).
% 276493 [para:276489.1.1,276465.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 276494 [para:276489.1.1,276474.1.1.2] equal(multiply(sk_c4,sk_c7),sk_c5).
% 276495 [para:276489.1.1,276475.1.1.1] equal(multiply(sk_c7,sk_c5),sk_c7).
% 276496 [para:276489.1.1,276476.1.1.2] equal(multiply(sk_c3,sk_c7),sk_c7).
% 276501 [para:276493.1.1,276436.1.1.1,demod:276434] equal(X,multiply(sk_c7,multiply(sk_c3,X))).
% 276505 [para:276435.1.1,276482.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 276506 [para:276463.1.1,276482.1.2.2] equal(sk_c4,multiply(inverse(sk_c8),identity)).
% 276507 [para:276465.1.1,276482.1.2.2,demod:276506] equal(sk_c3,sk_c4).
% 276511 [para:276436.1.1,276482.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 276512 [para:276483.1.2,276482.1.2.2] equal(multiply(sk_c4,X),multiply(inverse(sk_c8),X)).
% 276517 [para:276482.1.2,276482.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 276522 [para:276507.1.2,276494.1.1.1,demod:276496] equal(sk_c7,sk_c5).
% 276524 [para:276484.1.2,276482.1.2.2,demod:276512] equal(multiply(sk_c3,X),multiply(sk_c4,X)).
% 276533 [para:276522.1.1,276481.1.2.2.1,demod:276486] equal(multiply(sk_c6,X),multiply(sk_c7,X)).
% 276535 [para:276522.1.1,276491.1.1.2,demod:276495] equal(sk_c7,sk_c6).
% 276546 [para:276522.1.1,276535.1.1] equal(sk_c5,sk_c6).
% 276547 [para:276495.1.1,276482.1.2.2,demod:276435] equal(sk_c5,identity).
% 276552 [para:276547.1.1,276546.1.1] equal(identity,sk_c6).
% 276557 [para:276483.1.2,276487.1.2.2,demod:276501,276524] equal(X,multiply(sk_c3,X)).
% 276558 [para:276484.1.2,276487.1.2.2,demod:276533,276557] equal(multiply(sk_c6,X),X).
% 276604 [para:276517.1.2,276435.1.1] equal(multiply(X,inverse(X)),identity).
% 276606 [para:276517.1.2,276505.1.2] equal(X,multiply(X,identity)).
% 276609 [para:276606.1.2,276505.1.2] equal(X,inverse(inverse(X))).
% 276614 [para:276604.1.1,276511.1.2.2.2,demod:276606] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 276626 [para:276614.1.2,276614.1.2.1.1,demod:276609] equal(inverse(X),multiply(Y,inverse(multiply(X,Y)))).
% 276635 [para:276626.1.2,276436.1.1] equal(inverse(X),multiply(Y,multiply(Z,inverse(multiply(X,multiply(Y,Z)))))).
% 276637 [para:276436.1.1,276626.1.2.2.1] equal(inverse(multiply(X,Y)),multiply(Z,inverse(multiply(X,multiply(Y,Z))))).
% 276643 [para:276635.1.2,276436.1.1,demod:276436] equal(inverse(X),multiply(Y,multiply(Z,multiply(U,inverse(multiply(X,multiply(Y,multiply(Z,U)))))))).
% 276647 [para:276436.1.1,276637.1.2.2.1,demod:276436] equal(inverse(multiply(X,multiply(Y,Z))),multiply(U,inverse(multiply(X,multiply(Y,multiply(Z,U)))))).
% 276652 [para:276643.1.2,276436.1.1,demod:276436] equal(inverse(X),multiply(Y,multiply(Z,multiply(U,multiply(V,inverse(multiply(X,multiply(Y,multiply(Z,multiply(U,V)))))))))).
% 276657 [para:276436.1.1,276647.1.2.2.1,demod:276436] equal(inverse(multiply(X,multiply(Y,multiply(Z,U)))),multiply(V,inverse(multiply(X,multiply(Y,multiply(Z,multiply(U,V))))))).
% 276663 [para:276652.1.2,276436.1.1,demod:276436] equal(inverse(X),multiply(Y,multiply(Z,multiply(U,multiply(V,multiply(W,inverse(multiply(X,multiply(Y,multiply(Z,multiply(U,multiply(V,W)))))))))))).
% 276700 [para:276663.1.1,276437.1.1,demod:276604,276626,276637,276647,276657,276558,276533,276490,cut:276552] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 12
% seconds given: 6
%
%
% Split attempt finished with SUCCESS.
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 33349
% derived clauses: 6159507
% kept clauses: 217229
% kept size sum: 17409
% kept mid-nuclei: 17639
% kept new demods: 4111
% forw unit-subs: 2431539
% forw double-subs: 3266159
% forw overdouble-subs: 180426
% backward subs: 12508
% fast unit cutoff: 33643
% full unit cutoff: 0
% dbl unit cutoff: 6808
% real runtime : 303.23
% process. runtime: 301.65
% specific non-discr-tree subsumption statistics:
% tried: 15234542
% length fails: 1914774
% strength fails: 5047354
% predlist fails: 901079
% aux str. fails: 1421844
% by-lit fails: 2402944
% full subs tried: 1947006
% full subs fail: 1818363
%
% ; 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/GRP306-1+eq_r.in")
%
%------------------------------------------------------------------------------