TSTP Solution File: GRP289-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP289-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 : art08.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 288.5s
% Output : Assurance 288.5s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/GRP/GRP289-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 3 19)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 19)
% (binary-posweight-lex-big-order 30 #f 3 19)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(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_c7,sk_c6),sk_c5).
% -equal(multiply(sk_c6,sk_c7),sk_c5).
%
% Starting a split proof attempt with 6 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(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,517,50,3,552,0,3,1019,50,6,1054,0,6,1526,50,10,1561,0,10,2039,50,16,2074,0,16,2559,50,21,2594,0,21,3087,50,33,3122,0,33,3623,50,55,3658,0,55,4169,50,105,4204,0,106,4725,50,216,4760,0,216,5293,50,413,5328,0,413,5873,50,776,5873,40,776,5908,0,776,16798,3,1077,17545,4,1227,18234,5,1377,18235,1,1377,18235,50,1381,18235,40,1381,18270,0,1381,18434,3,1684,18444,4,1850,18452,5,1982,18452,1,1982,18452,50,1982,18452,40,1982,18487,0,1982,42686,3,3485,43961,4,4233,45103,1,4983,45103,50,4983,45103,40,4983,45138,0,4983,60981,3,5738,61845,4,6109,62586,1,6484,62586,50,6484,62586,40,6484,62621,0,6484,73821,3,7235,74569,4,7610,75910,5,7985,75911,1,7985,75911,50,7985,75911,40,7985,75946,0,7985,138434,3,11889,139560,4,13837,140738,1,15786,140738,50,15788,140738,40,15788,140773,0,15788,193076,3,18343,193968,4,19614,194899,1,20889,194899,50,20891,194899,40,20891,194934,0,20891,228147,3,22393,229314,4,23142,230271,5,23892,230272,1,23892,230272,50,23893,230272,40,23893,230307,0,23893,239952,3,24726,240975,4,25020,241340,5,25394,241340,1,25394,241340,50,25394,241340,40,25394,241375,0,25394,269749,3,26595,270748,4,27195,271276,1,27795,271276,50,27796,271276,40,27796,271311,0,27796,291072,3,28548,291896,4,28922,292308,5,29297,292309,1,29297,292309,50,29297,292309,40,29297,292309,40,29297,292339,0,29297)
%
%
% START OF PROOF
% 292311 [] equal(multiply(identity,X),X).
% 292312 [] equal(multiply(inverse(X),X),identity).
% 292313 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 292314 [] -equal(multiply(X,sk_c5),sk_c6) | -equal(inverse(X),sk_c6).
% 292315 [?] ?
% 292316 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 292320 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 292321 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c4),sk_c6).
% 292325 [?] ?
% 292326 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 292330 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 292331 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 292335 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 292336 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c4),sk_c6).
% 292343 [hyper:292314,292316,binarycut:292315] equal(inverse(sk_c2),sk_c6).
% 292345 [para:292343.1.1,292312.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 292352 [hyper:292314,292326,binarycut:292325] equal(inverse(sk_c1),sk_c7).
% 292353 [para:292352.1.1,292312.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 292356 [hyper:292314,292321,292320] equal(multiply(sk_c2,sk_c6),sk_c5).
% 292362 [hyper:292314,292331,292330] equal(multiply(sk_c1,sk_c7),sk_c6).
% 292368 [hyper:292314,292336,292335] equal(multiply(sk_c7,sk_c6),sk_c5).
% 292369 [para:292312.1.1,292313.1.1.1,demod:292311] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 292370 [para:292345.1.1,292313.1.1.1,demod:292311] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 292372 [para:292356.1.1,292313.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c2,multiply(sk_c6,X))).
% 292375 [para:292356.1.1,292370.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 292380 [para:292362.1.1,292369.1.2.2,demod:292368,292352] equal(sk_c7,sk_c5).
% 292383 [para:292380.1.1,292353.1.1.1] equal(multiply(sk_c5,sk_c1),identity).
% 292384 [para:292380.1.1,292362.1.1.2] equal(multiply(sk_c1,sk_c5),sk_c6).
% 292385 [para:292380.1.1,292368.1.1.1] equal(multiply(sk_c5,sk_c6),sk_c5).
% 292393 [para:292385.1.1,292369.1.2.2,demod:292312] equal(sk_c6,identity).
% 292394 [para:292393.1.1,292345.1.1.1,demod:292311] equal(sk_c2,identity).
% 292395 [para:292393.1.1,292356.1.1.2] equal(multiply(sk_c2,identity),sk_c5).
% 292398 [para:292393.1.1,292375.1.2.1,demod:292311] equal(sk_c6,sk_c5).
% 292400 [para:292345.1.1,292372.1.2.2,demod:292395] equal(multiply(sk_c5,sk_c2),sk_c5).
% 292402 [para:292394.1.1,292343.1.1.1] equal(inverse(identity),sk_c6).
% 292405 [para:292398.1.1,292345.1.1.1,demod:292400] equal(sk_c5,identity).
% 292409 [para:292405.1.1,292383.1.1.1,demod:292311] equal(sk_c1,identity).
% 292418 [para:292409.1.1,292384.1.1.1,demod:292311] equal(sk_c5,sk_c6).
% 292423 [hyper:292314,292402,demod:292311,cut:292418] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(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
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 4
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,65,0,0,517,50,3,552,0,3,1019,50,6,1054,0,6,1526,50,10,1561,0,10,2039,50,16,2074,0,16,2559,50,21,2594,0,21,3087,50,33,3122,0,33,3623,50,55,3658,0,55,4169,50,105,4204,0,106,4725,50,216,4760,0,216,5293,50,413,5328,0,413,5873,50,776,5873,40,776,5908,0,776,16798,3,1077,17545,4,1227,18234,5,1377,18235,1,1377,18235,50,1381,18235,40,1381,18270,0,1381,18434,3,1684,18444,4,1850,18452,5,1982,18452,1,1982,18452,50,1982,18452,40,1982,18487,0,1982,42686,3,3485,43961,4,4233,45103,1,4983,45103,50,4983,45103,40,4983,45138,0,4983,60981,3,5738,61845,4,6109,62586,1,6484,62586,50,6484,62586,40,6484,62621,0,6484,73821,3,7235,74569,4,7610,75910,5,7985,75911,1,7985,75911,50,7985,75911,40,7985,75946,0,7985,138434,3,11889,139560,4,13837,140738,1,15786,140738,50,15788,140738,40,15788,140773,0,15788,193076,3,18343,193968,4,19614,194899,1,20889,194899,50,20891,194899,40,20891,194934,0,20891,228147,3,22393,229314,4,23142,230271,5,23892,230272,1,23892,230272,50,23893,230272,40,23893,230307,0,23893,239952,3,24726,240975,4,25020,241340,5,25394,241340,1,25394,241340,50,25394,241340,40,25394,241375,0,25394,269749,3,26595,270748,4,27195,271276,1,27795,271276,50,27796,271276,40,27796,271311,0,27796,291072,3,28548,291896,4,28922,292308,5,29297,292309,1,29297,292309,50,29297,292309,40,29297,292309,40,29297,292339,0,29297,292422,50,29297,292422,30,29297,292422,40,29297,292452,0,29297,292552,50,29298,292582,0,29303)
%
%
% START OF PROOF
% 292554 [] equal(multiply(identity,X),X).
% 292555 [] equal(multiply(inverse(X),X),identity).
% 292556 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 292557 [] -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 292560 [?] ?
% 292561 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 292565 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 292566 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c3),sk_c7).
% 292570 [?] ?
% 292571 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 292575 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 292576 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 292580 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 292581 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c3),sk_c7).
% 292586 [hyper:292557,292561,binarycut:292560] equal(inverse(sk_c2),sk_c6).
% 292588 [para:292586.1.1,292555.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 292596 [hyper:292557,292571,binarycut:292570] equal(inverse(sk_c1),sk_c7).
% 292599 [para:292596.1.1,292555.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 292607 [hyper:292557,292566,292565] equal(multiply(sk_c2,sk_c6),sk_c5).
% 292619 [hyper:292557,292575,292576] equal(multiply(sk_c1,sk_c7),sk_c6).
% 292623 [hyper:292557,292580,292581] equal(multiply(sk_c7,sk_c6),sk_c5).
% 292624 [para:292555.1.1,292556.1.1.1,demod:292554] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 292625 [para:292588.1.1,292556.1.1.1,demod:292554] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 292627 [para:292607.1.1,292556.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c2,multiply(sk_c6,X))).
% 292628 [para:292619.1.1,292556.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c1,multiply(sk_c7,X))).
% 292630 [para:292607.1.1,292625.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 292633 [para:292555.1.1,292624.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 292635 [para:292599.1.1,292624.1.2.2] equal(sk_c1,multiply(inverse(sk_c7),identity)).
% 292636 [para:292619.1.1,292624.1.2.2,demod:292623,292596] equal(sk_c7,sk_c5).
% 292637 [para:292556.1.1,292624.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 292640 [para:292624.1.2,292624.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 292641 [para:292636.1.1,292599.1.1.1] equal(multiply(sk_c5,sk_c1),identity).
% 292642 [para:292636.1.1,292619.1.1.2] equal(multiply(sk_c1,sk_c5),sk_c6).
% 292643 [para:292636.1.1,292623.1.1.1] equal(multiply(sk_c5,sk_c6),sk_c5).
% 292646 [para:292641.1.1,292624.1.2.2] equal(sk_c1,multiply(inverse(sk_c5),identity)).
% 292649 [para:292643.1.1,292624.1.2.2,demod:292555] equal(sk_c6,identity).
% 292650 [para:292649.1.1,292588.1.1.1,demod:292554] equal(sk_c2,identity).
% 292651 [para:292649.1.1,292607.1.1.2] equal(multiply(sk_c2,identity),sk_c5).
% 292653 [para:292649.1.1,292625.1.2.1,demod:292554] equal(X,multiply(sk_c2,X)).
% 292654 [para:292649.1.1,292630.1.2.1,demod:292554] equal(sk_c6,sk_c5).
% 292656 [para:292588.1.1,292627.1.2.2,demod:292651] equal(multiply(sk_c5,sk_c2),sk_c5).
% 292660 [para:292650.1.1,292625.1.2.2.1,demod:292554] equal(X,multiply(sk_c6,X)).
% 292661 [para:292654.1.1,292588.1.1.1,demod:292656] equal(sk_c5,identity).
% 292666 [para:292661.1.1,292642.1.1.2] equal(multiply(sk_c1,identity),sk_c6).
% 292671 [para:292599.1.1,292628.1.2.2,demod:292666,292660] equal(sk_c1,sk_c6).
% 292675 [para:292671.1.2,292607.1.1.2,demod:292653] equal(sk_c1,sk_c5).
% 292678 [para:292675.1.1,292596.1.1.1] equal(inverse(sk_c5),sk_c7).
% 292691 [para:292625.1.2,292637.1.2.2.2,demod:292653] equal(X,multiply(inverse(multiply(Y,sk_c6)),multiply(Y,X))).
% 292700 [para:292640.1.2,292555.1.1] equal(multiply(X,inverse(X)),identity).
% 292702 [para:292640.1.2,292633.1.2] equal(X,multiply(X,identity)).
% 292705 [para:292702.1.2,292633.1.2] equal(X,inverse(inverse(X))).
% 292706 [para:292702.1.2,292635.1.2] equal(sk_c1,inverse(sk_c7)).
% 292707 [para:292702.1.2,292646.1.2,demod:292678] equal(sk_c1,sk_c7).
% 292715 [para:292700.1.1,292691.1.2.2,demod:292702] equal(inverse(X),inverse(multiply(X,sk_c6))).
% 292724 [para:292715.1.2,292633.1.2.1.1,demod:292702,292705] equal(multiply(X,sk_c6),X).
% 292726 [hyper:292557,292724,demod:292706,cut:292707] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 4
% seconds given: 4
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(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,517,50,3,552,0,3,1019,50,6,1054,0,6,1526,50,10,1561,0,10,2039,50,16,2074,0,16,2559,50,21,2594,0,21,3087,50,33,3122,0,33,3623,50,55,3658,0,55,4169,50,105,4204,0,106,4725,50,216,4760,0,216,5293,50,413,5328,0,413,5873,50,776,5873,40,776,5908,0,776,16798,3,1077,17545,4,1227,18234,5,1377,18235,1,1377,18235,50,1381,18235,40,1381,18270,0,1381,18434,3,1684,18444,4,1850,18452,5,1982,18452,1,1982,18452,50,1982,18452,40,1982,18487,0,1982,42686,3,3485,43961,4,4233,45103,1,4983,45103,50,4983,45103,40,4983,45138,0,4983,60981,3,5738,61845,4,6109,62586,1,6484,62586,50,6484,62586,40,6484,62621,0,6484,73821,3,7235,74569,4,7610,75910,5,7985,75911,1,7985,75911,50,7985,75911,40,7985,75946,0,7985,138434,3,11889,139560,4,13837,140738,1,15786,140738,50,15788,140738,40,15788,140773,0,15788,193076,3,18343,193968,4,19614,194899,1,20889,194899,50,20891,194899,40,20891,194934,0,20891,228147,3,22393,229314,4,23142,230271,5,23892,230272,1,23892,230272,50,23893,230272,40,23893,230307,0,23893,239952,3,24726,240975,4,25020,241340,5,25394,241340,1,25394,241340,50,25394,241340,40,25394,241375,0,25394,269749,3,26595,270748,4,27195,271276,1,27795,271276,50,27796,271276,40,27796,271311,0,27796,291072,3,28548,291896,4,28922,292308,5,29297,292309,1,29297,292309,50,29297,292309,40,29297,292309,40,29297,292339,0,29297,292422,50,29297,292422,30,29297,292422,40,29297,292452,0,29297,292552,50,29298,292582,0,29303,292725,50,29304,292725,30,29304,292725,40,29304,292755,0,29304)
%
%
% START OF PROOF
% 292726 [] equal(X,X).
% 292727 [] equal(multiply(identity,X),X).
% 292728 [] equal(multiply(inverse(X),X),identity).
% 292729 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 292730 [] -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c6).
% 292731 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c2),sk_c6).
% 292732 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 292733 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c6).
% 292734 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 292735 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c2),sk_c6).
% 292736 [?] ?
% 292737 [?] ?
% 292738 [?] ?
% 292739 [?] ?
% 292740 [?] ?
% 292758 [hyper:292730,292732,binarycut:292737] equal(inverse(sk_c4),sk_c6).
% 292761 [para:292758.1.1,292728.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 292765 [hyper:292730,292734,binarycut:292739] equal(inverse(sk_c3),sk_c7).
% 292766 [para:292765.1.1,292728.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 292769 [hyper:292730,292731,binarycut:292736] equal(multiply(sk_c4,sk_c5),sk_c6).
% 292772 [hyper:292730,292733,binarycut:292738] equal(multiply(sk_c3,sk_c6),sk_c7).
% 292775 [hyper:292730,292735,binarycut:292740] equal(multiply(sk_c6,sk_c7),sk_c5).
% 292776 [para:292728.1.1,292729.1.1.1,demod:292727] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 292777 [para:292761.1.1,292729.1.1.1,demod:292727] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 292779 [para:292769.1.1,292729.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c4,multiply(sk_c5,X))).
% 292782 [para:292769.1.1,292777.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 292785 [para:292761.1.1,292776.1.2.2] equal(sk_c4,multiply(inverse(sk_c6),identity)).
% 292787 [para:292772.1.1,292776.1.2.2,demod:292765] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 292788 [para:292775.1.1,292776.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 292790 [para:292782.1.2,292776.1.2.2,demod:292788] equal(sk_c6,sk_c7).
% 292791 [para:292790.1.2,292766.1.1.1] equal(multiply(sk_c6,sk_c3),identity).
% 292795 [para:292790.1.2,292787.1.2.1,demod:292775] equal(sk_c6,sk_c5).
% 292798 [para:292795.1.1,292772.1.1.2] equal(multiply(sk_c3,sk_c5),sk_c7).
% 292799 [para:292795.1.1,292775.1.1.1] equal(multiply(sk_c5,sk_c7),sk_c5).
% 292801 [para:292795.1.1,292782.1.2.1] equal(sk_c5,multiply(sk_c5,sk_c6)).
% 292803 [para:292791.1.1,292776.1.2.2,demod:292785] equal(sk_c3,sk_c4).
% 292806 [para:292803.1.2,292779.1.2.1] equal(multiply(sk_c6,X),multiply(sk_c3,multiply(sk_c5,X))).
% 292811 [para:292798.1.1,292729.1.1.1,demod:292806] equal(multiply(sk_c7,X),multiply(sk_c6,X)).
% 292814 [para:292799.1.1,292776.1.2.2,demod:292728] equal(sk_c7,identity).
% 292817 [para:292814.1.1,292766.1.1.1,demod:292727] equal(sk_c3,identity).
% 292818 [para:292814.1.1,292775.1.1.2] equal(multiply(sk_c6,identity),sk_c5).
% 292819 [para:292814.1.1,292790.1.2] equal(sk_c6,identity).
% 292822 [para:292817.1.1,292765.1.1.1] equal(inverse(identity),sk_c7).
% 292836 [para:292819.1.1,292785.1.2.1.1,demod:292818,292811,292822] equal(sk_c4,sk_c5).
% 292837 [para:292836.1.1,292758.1.1.1] equal(inverse(sk_c5),sk_c6).
% 292839 [hyper:292730,292837,demod:292801,cut:292726] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 4 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(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,517,50,3,552,0,3,1019,50,6,1054,0,6,1526,50,10,1561,0,10,2039,50,16,2074,0,16,2559,50,21,2594,0,21,3087,50,33,3122,0,33,3623,50,55,3658,0,55,4169,50,105,4204,0,106,4725,50,216,4760,0,216,5293,50,413,5328,0,413,5873,50,776,5873,40,776,5908,0,776,16798,3,1077,17545,4,1227,18234,5,1377,18235,1,1377,18235,50,1381,18235,40,1381,18270,0,1381,18434,3,1684,18444,4,1850,18452,5,1982,18452,1,1982,18452,50,1982,18452,40,1982,18487,0,1982,42686,3,3485,43961,4,4233,45103,1,4983,45103,50,4983,45103,40,4983,45138,0,4983,60981,3,5738,61845,4,6109,62586,1,6484,62586,50,6484,62586,40,6484,62621,0,6484,73821,3,7235,74569,4,7610,75910,5,7985,75911,1,7985,75911,50,7985,75911,40,7985,75946,0,7985,138434,3,11889,139560,4,13837,140738,1,15786,140738,50,15788,140738,40,15788,140773,0,15788,193076,3,18343,193968,4,19614,194899,1,20889,194899,50,20891,194899,40,20891,194934,0,20891,228147,3,22393,229314,4,23142,230271,5,23892,230272,1,23892,230272,50,23893,230272,40,23893,230307,0,23893,239952,3,24726,240975,4,25020,241340,5,25394,241340,1,25394,241340,50,25394,241340,40,25394,241375,0,25394,269749,3,26595,270748,4,27195,271276,1,27795,271276,50,27796,271276,40,27796,271311,0,27796,291072,3,28548,291896,4,28922,292308,5,29297,292309,1,29297,292309,50,29297,292309,40,29297,292309,40,29297,292339,0,29297,292422,50,29297,292422,30,29297,292422,40,29297,292452,0,29297,292552,50,29298,292582,0,29303,292725,50,29304,292725,30,29304,292725,40,29304,292755,0,29304,292838,50,29304,292838,30,29304,292838,40,29304,292868,0,29304)
%
%
% START OF PROOF
% 292840 [] equal(multiply(identity,X),X).
% 292841 [] equal(multiply(inverse(X),X),identity).
% 292842 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 292843 [] -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 292854 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 292855 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 292856 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 292857 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 292858 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c1),sk_c7).
% 292859 [?] ?
% 292860 [?] ?
% 292861 [?] ?
% 292862 [?] ?
% 292863 [?] ?
% 292875 [hyper:292843,292855,binarycut:292860] equal(inverse(sk_c4),sk_c6).
% 292876 [para:292875.1.1,292841.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 292879 [hyper:292843,292857,binarycut:292862] equal(inverse(sk_c3),sk_c7).
% 292883 [para:292879.1.1,292841.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 292890 [hyper:292843,292854,binarycut:292859] equal(multiply(sk_c4,sk_c5),sk_c6).
% 292893 [hyper:292843,292856,binarycut:292861] equal(multiply(sk_c3,sk_c6),sk_c7).
% 292897 [hyper:292843,292858,binarycut:292863] equal(multiply(sk_c6,sk_c7),sk_c5).
% 292898 [para:292841.1.1,292842.1.1.1,demod:292840] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 292899 [para:292876.1.1,292842.1.1.1,demod:292840] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 292904 [para:292890.1.1,292899.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 292907 [para:292876.1.1,292898.1.2.2] equal(sk_c4,multiply(inverse(sk_c6),identity)).
% 292909 [para:292893.1.1,292898.1.2.2,demod:292879] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 292910 [para:292897.1.1,292898.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 292912 [para:292904.1.2,292898.1.2.2,demod:292910] equal(sk_c6,sk_c7).
% 292913 [para:292912.1.2,292883.1.1.1] equal(multiply(sk_c6,sk_c3),identity).
% 292917 [para:292912.1.2,292909.1.2.1,demod:292897] equal(sk_c6,sk_c5).
% 292921 [para:292917.1.1,292897.1.1.1] equal(multiply(sk_c5,sk_c7),sk_c5).
% 292925 [para:292913.1.1,292898.1.2.2,demod:292907] equal(sk_c3,sk_c4).
% 292927 [para:292925.1.2,292875.1.1.1,demod:292879] equal(sk_c7,sk_c6).
% 292936 [para:292921.1.1,292898.1.2.2,demod:292841] equal(sk_c7,identity).
% 292939 [para:292936.1.1,292883.1.1.1,demod:292840] equal(sk_c3,identity).
% 292944 [para:292939.1.1,292879.1.1.1] equal(inverse(identity),sk_c7).
% 292955 [hyper:292843,292944,demod:292840,cut:292927] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),sk_c6).
% Split part used next: -equal(multiply(sk_c7,sk_c6),sk_c5).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 3
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 4
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 5
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 6
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 7
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 8
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 9
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 10
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 11
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,65,0,0,517,50,3,552,0,3,1019,50,6,1054,0,6,1526,50,10,1561,0,10,2039,50,16,2074,0,16,2559,50,21,2594,0,21,3087,50,33,3122,0,33,3623,50,55,3658,0,55,4169,50,105,4204,0,106,4725,50,216,4760,0,216,5293,50,413,5328,0,413,5873,50,776,5873,40,776,5908,0,776,16798,3,1077,17545,4,1227,18234,5,1377,18235,1,1377,18235,50,1381,18235,40,1381,18270,0,1381,18434,3,1684,18444,4,1850,18452,5,1982,18452,1,1982,18452,50,1982,18452,40,1982,18487,0,1982,42686,3,3485,43961,4,4233,45103,1,4983,45103,50,4983,45103,40,4983,45138,0,4983,60981,3,5738,61845,4,6109,62586,1,6484,62586,50,6484,62586,40,6484,62621,0,6484,73821,3,7235,74569,4,7610,75910,5,7985,75911,1,7985,75911,50,7985,75911,40,7985,75946,0,7985,138434,3,11889,139560,4,13837,140738,1,15786,140738,50,15788,140738,40,15788,140773,0,15788,193076,3,18343,193968,4,19614,194899,1,20889,194899,50,20891,194899,40,20891,194934,0,20891,228147,3,22393,229314,4,23142,230271,5,23892,230272,1,23892,230272,50,23893,230272,40,23893,230307,0,23893,239952,3,24726,240975,4,25020,241340,5,25394,241340,1,25394,241340,50,25394,241340,40,25394,241375,0,25394,269749,3,26595,270748,4,27195,271276,1,27795,271276,50,27796,271276,40,27796,271311,0,27796,291072,3,28548,291896,4,28922,292308,5,29297,292309,1,29297,292309,50,29297,292309,40,29297,292309,40,29297,292339,0,29297,292422,50,29297,292422,30,29297,292422,40,29297,292452,0,29297,292552,50,29298,292582,0,29303,292725,50,29304,292725,30,29304,292725,40,29304,292755,0,29304,292838,50,29304,292838,30,29304,292838,40,29304,292868,0,29304,292954,50,29304,292954,30,29304,292954,40,29304,292984,0,29309,293086,50,29310,293116,0,29310,293260,50,29313,293290,0,29317,293442,50,29321,293472,0,29321,293632,50,29326,293662,0,29326,293828,50,29335,293858,0,29339,294032,50,29354,294062,0,29354,294244,50,29383,294274,0,29387,294466,50,29445,294496,0,29445,294698,50,29562,294698,40,29562,294728,0,29562)
%
%
% START OF PROOF
% 294699 [] equal(X,X).
% 294700 [] equal(multiply(identity,X),X).
% 294701 [] equal(multiply(inverse(X),X),identity).
% 294702 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 294703 [] -equal(multiply(sk_c7,sk_c6),sk_c5).
% 294724 [?] ?
% 294725 [?] ?
% 294728 [?] ?
% 294763 [input:294725,cut:294703] equal(inverse(sk_c4),sk_c6).
% 294764 [para:294763.1.1,294701.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 294775 [input:294724,cut:294703] equal(multiply(sk_c4,sk_c5),sk_c6).
% 294777 [input:294728,cut:294703] equal(multiply(sk_c6,sk_c7),sk_c5).
% 294778 [para:294701.1.1,294702.1.1.1,demod:294700] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 294793 [para:294764.1.1,294702.1.1.1,demod:294700] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 294814 [para:294775.1.1,294793.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 294861 [para:294777.1.1,294778.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 294865 [para:294814.1.2,294778.1.2.2,demod:294861] equal(sk_c6,sk_c7).
% 294869 [para:294865.1.2,294703.1.1.1,demod:294814,cut:294699] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
%
%
% Split component 6 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(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,517,50,3,552,0,3,1019,50,6,1054,0,6,1526,50,10,1561,0,10,2039,50,16,2074,0,16,2559,50,21,2594,0,21,3087,50,33,3122,0,33,3623,50,55,3658,0,55,4169,50,105,4204,0,106,4725,50,216,4760,0,216,5293,50,413,5328,0,413,5873,50,776,5873,40,776,5908,0,776,16798,3,1077,17545,4,1227,18234,5,1377,18235,1,1377,18235,50,1381,18235,40,1381,18270,0,1381,18434,3,1684,18444,4,1850,18452,5,1982,18452,1,1982,18452,50,1982,18452,40,1982,18487,0,1982,42686,3,3485,43961,4,4233,45103,1,4983,45103,50,4983,45103,40,4983,45138,0,4983,60981,3,5738,61845,4,6109,62586,1,6484,62586,50,6484,62586,40,6484,62621,0,6484,73821,3,7235,74569,4,7610,75910,5,7985,75911,1,7985,75911,50,7985,75911,40,7985,75946,0,7985,138434,3,11889,139560,4,13837,140738,1,15786,140738,50,15788,140738,40,15788,140773,0,15788,193076,3,18343,193968,4,19614,194899,1,20889,194899,50,20891,194899,40,20891,194934,0,20891,228147,3,22393,229314,4,23142,230271,5,23892,230272,1,23892,230272,50,23893,230272,40,23893,230307,0,23893,239952,3,24726,240975,4,25020,241340,5,25394,241340,1,25394,241340,50,25394,241340,40,25394,241375,0,25394,269749,3,26595,270748,4,27195,271276,1,27795,271276,50,27796,271276,40,27796,271311,0,27796,291072,3,28548,291896,4,28922,292308,5,29297,292309,1,29297,292309,50,29297,292309,40,29297,292309,40,29297,292339,0,29297,292422,50,29297,292422,30,29297,292422,40,29297,292452,0,29297,292552,50,29298,292582,0,29303,292725,50,29304,292725,30,29304,292725,40,29304,292755,0,29304,292838,50,29304,292838,30,29304,292838,40,29304,292868,0,29304,292954,50,29304,292954,30,29304,292954,40,29304,292984,0,29309,293086,50,29310,293116,0,29310,293260,50,29313,293290,0,29317,293442,50,29321,293472,0,29321,293632,50,29326,293662,0,29326,293828,50,29335,293858,0,29339,294032,50,29354,294062,0,29354,294244,50,29383,294274,0,29387,294466,50,29445,294496,0,29445,294698,50,29562,294698,40,29562,294728,0,29562,294868,50,29562,294868,30,29562,294868,40,29562,294898,0,29562,294995,50,29563,295025,0,29567,295168,50,29570,295198,0,29570,295349,50,29574,295379,0,29574,295538,50,29579,295568,0,29584,295733,50,29593,295763,0,29593,295936,50,29608,295966,0,29613,296147,50,29642,296177,0,29642,296368,50,29705,296398,0,29705,296599,50,29822,296599,40,29822,296629,0,29822)
%
%
% START OF PROOF
% 296471 [?] ?
% 296601 [] equal(multiply(identity,X),X).
% 296602 [] equal(multiply(inverse(X),X),identity).
% 296603 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 296604 [] -equal(multiply(sk_c6,sk_c7),sk_c5).
% 296609 [?] ?
% 296614 [?] ?
% 296619 [?] ?
% 296624 [?] ?
% 296629 [?] ?
% 296646 [input:296609,cut:296604] equal(inverse(sk_c2),sk_c6).
% 296647 [para:296646.1.1,296602.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 296658 [input:296619,cut:296604] equal(inverse(sk_c1),sk_c7).
% 296659 [para:296658.1.1,296602.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 296666 [input:296614,cut:296604] equal(multiply(sk_c2,sk_c6),sk_c5).
% 296675 [input:296624,cut:296604] equal(multiply(sk_c1,sk_c7),sk_c6).
% 296678 [input:296629,cut:296604] equal(multiply(sk_c7,sk_c6),sk_c5).
% 296684 [para:296647.1.1,296603.1.1.1,demod:296601] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 296691 [para:296659.1.1,296603.1.1.1,demod:296601] equal(X,multiply(sk_c7,multiply(sk_c1,X))).
% 296715 [para:296666.1.1,296684.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 296721 [para:296675.1.1,296691.1.2.2] equal(sk_c7,multiply(sk_c7,sk_c6)).
% 296726 [para:296721.1.2,296678.1.1] equal(sk_c7,sk_c5).
% 296728 [para:296726.1.1,296604.1.1.2,demod:296715,cut:296471] 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: 36388
% derived clauses: 6471223
% kept clauses: 253664
% kept size sum: 269250
% kept mid-nuclei: 2958
% kept new demods: 4072
% forw unit-subs: 2324124
% forw double-subs: 3516907
% forw overdouble-subs: 332667
% backward subs: 11330
% fast unit cutoff: 26262
% full unit cutoff: 0
% dbl unit cutoff: 5471
% real runtime : 300.12
% process. runtime: 298.22
% specific non-discr-tree subsumption statistics:
% tried: 37658184
% length fails: 3824163
% strength fails: 8013645
% predlist fails: 4714633
% aux str. fails: 5507166
% by-lit fails: 8581276
% full subs tried: 1665061
% full subs fail: 1563274
%
% ; 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/GRP289-1+eq_r.in")
%
%------------------------------------------------------------------------------