TSTP Solution File: GRP291-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP291-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 : art01.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.8s
% Output : Assurance 288.8s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/GRP/GRP291-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_c5),sk_c7) | -equal(inverse(Y),sk_c5) | -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_c5),sk_c7) | -equal(inverse(Y),sk_c5).
% -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_c5),sk_c7) | -equal(inverse(Y),sk_c5) | -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,449,50,2,484,0,2,883,50,5,918,0,5,1322,50,9,1357,0,9,1767,50,14,1802,0,14,2219,50,19,2254,0,19,2679,50,30,2714,0,30,3147,50,52,3182,0,52,3625,50,102,3660,0,102,4113,50,210,4148,0,210,4613,50,406,4648,0,406,5125,50,766,5125,40,766,5160,0,766,16166,3,1067,16835,4,1217,17477,5,1367,17477,1,1367,17477,50,1367,17477,40,1367,17512,0,1367,17658,3,1676,17666,4,1818,17674,5,1968,17674,1,1968,17674,50,1968,17674,40,1968,17709,0,1968,40120,3,3472,41444,4,4219,42740,1,4969,42740,50,4969,42740,40,4969,42775,0,4969,56676,3,5721,57744,4,6095,58772,1,6470,58772,50,6470,58772,40,6470,58807,0,6470,69657,3,7221,70452,4,7596,71653,5,7971,71654,1,7971,71654,50,7971,71654,40,7971,71689,0,7971,133649,3,11872,134860,4,13822,136038,5,15773,136039,1,15773,136039,50,15775,136039,40,15775,136074,0,15775,187033,3,18327,187991,4,19601,188987,5,20876,188988,1,20876,188988,50,20878,188988,40,20878,189023,0,20878,226336,3,22380,227312,4,23129,228172,1,23879,228172,50,23881,228172,40,23881,228207,0,23881,238616,3,24632,239433,4,25010,239571,5,25382,239571,1,25382,239571,50,25382,239571,40,25382,239606,0,25382,269254,3,26583,270113,4,27183,270753,5,27783,270754,1,27783,270754,50,27784,270754,40,27784,270789,0,27784,293162,3,28536,293790,4,28910,294410,5,29285,294411,1,29285,294411,50,29286,294411,40,29286,294411,40,29286,294441,0,29286,294534,50,29286,294564,0,29286)
%
%
% START OF PROOF
% 294513 [?] ?
% 294536 [] equal(multiply(identity,X),X).
% 294537 [] equal(multiply(inverse(X),X),identity).
% 294538 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 294539 [] -equal(multiply(X,sk_c5),sk_c6) | -equal(inverse(X),sk_c6).
% 294550 [?] ?
% 294551 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 294555 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 294556 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 294560 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 294561 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c4),sk_c6).
% 294575 [hyper:294539,294551,binarycut:294550] equal(inverse(sk_c1),sk_c7).
% 294585 [hyper:294539,294556,294555] equal(multiply(sk_c1,sk_c7),sk_c6).
% 294591 [hyper:294539,294561,294560] equal(multiply(sk_c7,sk_c6),sk_c5).
% 294592 [para:294537.1.1,294538.1.1.1,demod:294536] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 294604 [para:294585.1.1,294592.1.2.2,demod:294591,294575] equal(sk_c7,sk_c5).
% 294610 [para:294604.1.1,294585.1.1.2] equal(multiply(sk_c1,sk_c5),sk_c6).
% 294623 [hyper:294539,294610,demod:294575,cut:294513] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 4
% seconds given: 4
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c5),sk_c7) | -equal(inverse(Y),sk_c5) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),sk_c6).
% Split part used next: -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,65,0,0,449,50,2,484,0,2,883,50,5,918,0,5,1322,50,9,1357,0,9,1767,50,14,1802,0,14,2219,50,19,2254,0,19,2679,50,30,2714,0,30,3147,50,52,3182,0,52,3625,50,102,3660,0,102,4113,50,210,4148,0,210,4613,50,406,4648,0,406,5125,50,766,5125,40,766,5160,0,766,16166,3,1067,16835,4,1217,17477,5,1367,17477,1,1367,17477,50,1367,17477,40,1367,17512,0,1367,17658,3,1676,17666,4,1818,17674,5,1968,17674,1,1968,17674,50,1968,17674,40,1968,17709,0,1968,40120,3,3472,41444,4,4219,42740,1,4969,42740,50,4969,42740,40,4969,42775,0,4969,56676,3,5721,57744,4,6095,58772,1,6470,58772,50,6470,58772,40,6470,58807,0,6470,69657,3,7221,70452,4,7596,71653,5,7971,71654,1,7971,71654,50,7971,71654,40,7971,71689,0,7971,133649,3,11872,134860,4,13822,136038,5,15773,136039,1,15773,136039,50,15775,136039,40,15775,136074,0,15775,187033,3,18327,187991,4,19601,188987,5,20876,188988,1,20876,188988,50,20878,188988,40,20878,189023,0,20878,226336,3,22380,227312,4,23129,228172,1,23879,228172,50,23881,228172,40,23881,228207,0,23881,238616,3,24632,239433,4,25010,239571,5,25382,239571,1,25382,239571,50,25382,239571,40,25382,239606,0,25382,269254,3,26583,270113,4,27183,270753,5,27783,270754,1,27783,270754,50,27784,270754,40,27784,270789,0,27784,293162,3,28536,293790,4,28910,294410,5,29285,294411,1,29285,294411,50,29286,294411,40,29286,294411,40,29286,294441,0,29286,294534,50,29286,294564,0,29286,294622,50,29286,294622,30,29286,294622,40,29286,294652,0,29291)
%
%
% START OF PROOF
% 294624 [] equal(multiply(identity,X),X).
% 294625 [] equal(multiply(inverse(X),X),identity).
% 294626 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 294627 [] -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 294630 [?] ?
% 294631 [] equal(inverse(sk_c2),sk_c5) | equal(inverse(sk_c3),sk_c7).
% 294635 [] equal(multiply(sk_c2,sk_c5),sk_c7) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 294636 [] equal(multiply(sk_c2,sk_c5),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 294640 [?] ?
% 294641 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 294645 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 294646 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 294650 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 294651 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c3),sk_c7).
% 294656 [hyper:294627,294631,binarycut:294630] equal(inverse(sk_c2),sk_c5).
% 294658 [para:294656.1.1,294625.1.1.1] equal(multiply(sk_c5,sk_c2),identity).
% 294666 [hyper:294627,294641,binarycut:294640] equal(inverse(sk_c1),sk_c7).
% 294669 [para:294666.1.1,294625.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 294677 [hyper:294627,294636,294635] equal(multiply(sk_c2,sk_c5),sk_c7).
% 294689 [hyper:294627,294645,294646] equal(multiply(sk_c1,sk_c7),sk_c6).
% 294693 [hyper:294627,294650,294651] equal(multiply(sk_c7,sk_c6),sk_c5).
% 294694 [para:294625.1.1,294626.1.1.1,demod:294624] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 294696 [para:294669.1.1,294626.1.1.1,demod:294624] equal(X,multiply(sk_c7,multiply(sk_c1,X))).
% 294697 [para:294677.1.1,294626.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c2,multiply(sk_c5,X))).
% 294698 [para:294689.1.1,294626.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c1,multiply(sk_c7,X))).
% 294699 [para:294693.1.1,294626.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c7,multiply(sk_c6,X))).
% 294703 [para:294658.1.1,294694.1.2.2] equal(sk_c2,multiply(inverse(sk_c5),identity)).
% 294704 [para:294669.1.1,294694.1.2.2] equal(sk_c1,multiply(inverse(sk_c7),identity)).
% 294705 [para:294689.1.1,294694.1.2.2,demod:294693,294666] equal(sk_c7,sk_c5).
% 294706 [para:294693.1.1,294694.1.2.2] equal(sk_c6,multiply(inverse(sk_c7),sk_c5)).
% 294708 [para:294705.1.1,294669.1.1.1] equal(multiply(sk_c5,sk_c1),identity).
% 294709 [para:294705.1.1,294689.1.1.2] equal(multiply(sk_c1,sk_c5),sk_c6).
% 294710 [para:294705.1.1,294693.1.1.1] equal(multiply(sk_c5,sk_c6),sk_c5).
% 294714 [para:294708.1.1,294694.1.2.2,demod:294703] equal(sk_c1,sk_c2).
% 294715 [para:294714.1.2,294677.1.1.1,demod:294709] equal(sk_c6,sk_c7).
% 294716 [para:294715.1.2,294669.1.1.1] equal(multiply(sk_c6,sk_c1),identity).
% 294719 [para:294715.1.2,294705.1.1] equal(sk_c6,sk_c5).
% 294720 [para:294715.1.2,294696.1.2.1] equal(X,multiply(sk_c6,multiply(sk_c1,X))).
% 294722 [para:294709.1.1,294626.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c1,multiply(sk_c5,X))).
% 294727 [para:294714.1.2,294697.1.2.1,demod:294722] equal(multiply(sk_c7,X),multiply(sk_c6,X)).
% 294729 [para:294710.1.1,294697.1.2.2,demod:294677,294693] equal(sk_c5,sk_c7).
% 294732 [para:294716.1.1,294694.1.2.2] equal(sk_c1,multiply(inverse(sk_c6),identity)).
% 294734 [para:294698.1.2,294694.1.2.2,demod:294699,294666,294727] equal(multiply(sk_c6,X),multiply(sk_c5,X)).
% 294735 [para:294696.1.2,294698.1.2.2,demod:294720] equal(X,multiply(sk_c1,X)).
% 294737 [para:294735.1.2,294694.1.2.2,demod:294734,294727,294666] equal(X,multiply(sk_c5,X)).
% 294743 [para:294732.1.2,294626.1.1.1,demod:294624,294735] equal(X,multiply(inverse(sk_c6),X)).
% 294744 [para:294743.1.2,294625.1.1] equal(sk_c6,identity).
% 294746 [para:294744.1.1,294693.1.1.2,demod:294737,294734,294727] equal(identity,sk_c5).
% 294752 [para:294746.1.2,294706.1.2.2,demod:294704] equal(sk_c6,sk_c1).
% 294753 [para:294752.1.1,294719.1.1] equal(sk_c1,sk_c5).
% 294756 [para:294753.1.1,294666.1.1.1] equal(inverse(sk_c5),sk_c7).
% 294757 [hyper:294627,294756,demod:294710,cut:294729] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c6),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c5),sk_c7) | -equal(inverse(Y),sk_c5) | -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_c5),sk_c7) | -equal(inverse(Y),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
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,65,0,0,449,50,2,484,0,2,883,50,5,918,0,5,1322,50,9,1357,0,9,1767,50,14,1802,0,14,2219,50,19,2254,0,19,2679,50,30,2714,0,30,3147,50,52,3182,0,52,3625,50,102,3660,0,102,4113,50,210,4148,0,210,4613,50,406,4648,0,406,5125,50,766,5125,40,766,5160,0,766,16166,3,1067,16835,4,1217,17477,5,1367,17477,1,1367,17477,50,1367,17477,40,1367,17512,0,1367,17658,3,1676,17666,4,1818,17674,5,1968,17674,1,1968,17674,50,1968,17674,40,1968,17709,0,1968,40120,3,3472,41444,4,4219,42740,1,4969,42740,50,4969,42740,40,4969,42775,0,4969,56676,3,5721,57744,4,6095,58772,1,6470,58772,50,6470,58772,40,6470,58807,0,6470,69657,3,7221,70452,4,7596,71653,5,7971,71654,1,7971,71654,50,7971,71654,40,7971,71689,0,7971,133649,3,11872,134860,4,13822,136038,5,15773,136039,1,15773,136039,50,15775,136039,40,15775,136074,0,15775,187033,3,18327,187991,4,19601,188987,5,20876,188988,1,20876,188988,50,20878,188988,40,20878,189023,0,20878,226336,3,22380,227312,4,23129,228172,1,23879,228172,50,23881,228172,40,23881,228207,0,23881,238616,3,24632,239433,4,25010,239571,5,25382,239571,1,25382,239571,50,25382,239571,40,25382,239606,0,25382,269254,3,26583,270113,4,27183,270753,5,27783,270754,1,27783,270754,50,27784,270754,40,27784,270789,0,27784,293162,3,28536,293790,4,28910,294410,5,29285,294411,1,29285,294411,50,29286,294411,40,29286,294411,40,29286,294441,0,29286,294534,50,29286,294564,0,29286,294622,50,29286,294622,30,29286,294622,40,29286,294652,0,29291,294756,50,29292,294756,30,29292,294756,40,29292,294786,0,29292,294875,50,29292,294905,0,29292)
%
%
% START OF PROOF
% 294859 [?] ?
% 294877 [] equal(multiply(identity,X),X).
% 294878 [] equal(multiply(inverse(X),X),identity).
% 294879 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 294880 [] -equal(multiply(X,sk_c5),sk_c7) | -equal(inverse(X),sk_c5).
% 294881 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c2),sk_c5).
% 294882 [] equal(inverse(sk_c2),sk_c5) | equal(inverse(sk_c4),sk_c6).
% 294883 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c5).
% 294884 [] equal(inverse(sk_c2),sk_c5) | equal(inverse(sk_c3),sk_c7).
% 294885 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c2),sk_c5).
% 294886 [?] ?
% 294887 [?] ?
% 294888 [?] ?
% 294889 [?] ?
% 294890 [?] ?
% 294908 [hyper:294880,294882,binarycut:294887] equal(inverse(sk_c4),sk_c6).
% 294909 [para:294908.1.1,294878.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 294913 [hyper:294880,294884,binarycut:294889] equal(inverse(sk_c3),sk_c7).
% 294917 [hyper:294880,294881,binarycut:294886] equal(multiply(sk_c4,sk_c5),sk_c6).
% 294920 [hyper:294880,294883,binarycut:294888] equal(multiply(sk_c3,sk_c6),sk_c7).
% 294923 [hyper:294880,294885,binarycut:294890] equal(multiply(sk_c6,sk_c7),sk_c5).
% 294924 [para:294878.1.1,294879.1.1.1,demod:294877] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 294925 [para:294909.1.1,294879.1.1.1,demod:294877] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 294930 [para:294917.1.1,294925.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 294936 [para:294920.1.1,294924.1.2.2,demod:294913] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 294938 [para:294923.1.1,294924.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 294940 [para:294930.1.2,294924.1.2.2,demod:294938] equal(sk_c6,sk_c7).
% 294946 [para:294940.1.2,294936.1.2.1,demod:294923] equal(sk_c6,sk_c5).
% 294949 [para:294946.1.1,294920.1.1.2] equal(multiply(sk_c3,sk_c5),sk_c7).
% 294962 [hyper:294880,294949,demod:294913,cut:294859] 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 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_c5),sk_c7) | -equal(inverse(Y),sk_c5) | -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,449,50,2,484,0,2,883,50,5,918,0,5,1322,50,9,1357,0,9,1767,50,14,1802,0,14,2219,50,19,2254,0,19,2679,50,30,2714,0,30,3147,50,52,3182,0,52,3625,50,102,3660,0,102,4113,50,210,4148,0,210,4613,50,406,4648,0,406,5125,50,766,5125,40,766,5160,0,766,16166,3,1067,16835,4,1217,17477,5,1367,17477,1,1367,17477,50,1367,17477,40,1367,17512,0,1367,17658,3,1676,17666,4,1818,17674,5,1968,17674,1,1968,17674,50,1968,17674,40,1968,17709,0,1968,40120,3,3472,41444,4,4219,42740,1,4969,42740,50,4969,42740,40,4969,42775,0,4969,56676,3,5721,57744,4,6095,58772,1,6470,58772,50,6470,58772,40,6470,58807,0,6470,69657,3,7221,70452,4,7596,71653,5,7971,71654,1,7971,71654,50,7971,71654,40,7971,71689,0,7971,133649,3,11872,134860,4,13822,136038,5,15773,136039,1,15773,136039,50,15775,136039,40,15775,136074,0,15775,187033,3,18327,187991,4,19601,188987,5,20876,188988,1,20876,188988,50,20878,188988,40,20878,189023,0,20878,226336,3,22380,227312,4,23129,228172,1,23879,228172,50,23881,228172,40,23881,228207,0,23881,238616,3,24632,239433,4,25010,239571,5,25382,239571,1,25382,239571,50,25382,239571,40,25382,239606,0,25382,269254,3,26583,270113,4,27183,270753,5,27783,270754,1,27783,270754,50,27784,270754,40,27784,270789,0,27784,293162,3,28536,293790,4,28910,294410,5,29285,294411,1,29285,294411,50,29286,294411,40,29286,294411,40,29286,294441,0,29286,294534,50,29286,294564,0,29286,294622,50,29286,294622,30,29286,294622,40,29286,294652,0,29291,294756,50,29292,294756,30,29292,294756,40,29292,294786,0,29292,294875,50,29292,294905,0,29292,294961,50,29293,294961,30,29293,294961,40,29293,294991,0,29298)
%
%
% START OF PROOF
% 294963 [] equal(multiply(identity,X),X).
% 294964 [] equal(multiply(inverse(X),X),identity).
% 294965 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 294966 [] -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 294977 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 294978 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 294979 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 294980 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 294981 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c1),sk_c7).
% 294982 [?] ?
% 294983 [?] ?
% 294984 [?] ?
% 294985 [?] ?
% 294986 [?] ?
% 294998 [hyper:294966,294978,binarycut:294983] equal(inverse(sk_c4),sk_c6).
% 294999 [para:294998.1.1,294964.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 295002 [hyper:294966,294980,binarycut:294985] equal(inverse(sk_c3),sk_c7).
% 295006 [para:295002.1.1,294964.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 295013 [hyper:294966,294977,binarycut:294982] equal(multiply(sk_c4,sk_c5),sk_c6).
% 295016 [hyper:294966,294979,binarycut:294984] equal(multiply(sk_c3,sk_c6),sk_c7).
% 295020 [hyper:294966,294981,binarycut:294986] equal(multiply(sk_c6,sk_c7),sk_c5).
% 295021 [para:294964.1.1,294965.1.1.1,demod:294963] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 295022 [para:294999.1.1,294965.1.1.1,demod:294963] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 295027 [para:295013.1.1,295022.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 295030 [para:294999.1.1,295021.1.2.2] equal(sk_c4,multiply(inverse(sk_c6),identity)).
% 295032 [para:295016.1.1,295021.1.2.2,demod:295002] equal(sk_c6,multiply(sk_c7,sk_c7)).
% 295033 [para:295020.1.1,295021.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 295035 [para:295027.1.2,295021.1.2.2,demod:295033] equal(sk_c6,sk_c7).
% 295036 [para:295035.1.2,295006.1.1.1] equal(multiply(sk_c6,sk_c3),identity).
% 295040 [para:295035.1.2,295032.1.2.1,demod:295020] equal(sk_c6,sk_c5).
% 295044 [para:295040.1.1,295020.1.1.1] equal(multiply(sk_c5,sk_c7),sk_c5).
% 295048 [para:295036.1.1,295021.1.2.2,demod:295030] equal(sk_c3,sk_c4).
% 295050 [para:295048.1.2,294998.1.1.1,demod:295002] equal(sk_c7,sk_c6).
% 295059 [para:295044.1.1,295021.1.2.2,demod:294964] equal(sk_c7,identity).
% 295062 [para:295059.1.1,295006.1.1.1,demod:294963] equal(sk_c3,identity).
% 295067 [para:295062.1.1,295002.1.1.1] equal(inverse(identity),sk_c7).
% 295078 [hyper:294966,295067,demod:294963,cut:295050] 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_c5),sk_c7) | -equal(inverse(Y),sk_c5) | -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,449,50,2,484,0,2,883,50,5,918,0,5,1322,50,9,1357,0,9,1767,50,14,1802,0,14,2219,50,19,2254,0,19,2679,50,30,2714,0,30,3147,50,52,3182,0,52,3625,50,102,3660,0,102,4113,50,210,4148,0,210,4613,50,406,4648,0,406,5125,50,766,5125,40,766,5160,0,766,16166,3,1067,16835,4,1217,17477,5,1367,17477,1,1367,17477,50,1367,17477,40,1367,17512,0,1367,17658,3,1676,17666,4,1818,17674,5,1968,17674,1,1968,17674,50,1968,17674,40,1968,17709,0,1968,40120,3,3472,41444,4,4219,42740,1,4969,42740,50,4969,42740,40,4969,42775,0,4969,56676,3,5721,57744,4,6095,58772,1,6470,58772,50,6470,58772,40,6470,58807,0,6470,69657,3,7221,70452,4,7596,71653,5,7971,71654,1,7971,71654,50,7971,71654,40,7971,71689,0,7971,133649,3,11872,134860,4,13822,136038,5,15773,136039,1,15773,136039,50,15775,136039,40,15775,136074,0,15775,187033,3,18327,187991,4,19601,188987,5,20876,188988,1,20876,188988,50,20878,188988,40,20878,189023,0,20878,226336,3,22380,227312,4,23129,228172,1,23879,228172,50,23881,228172,40,23881,228207,0,23881,238616,3,24632,239433,4,25010,239571,5,25382,239571,1,25382,239571,50,25382,239571,40,25382,239606,0,25382,269254,3,26583,270113,4,27183,270753,5,27783,270754,1,27783,270754,50,27784,270754,40,27784,270789,0,27784,293162,3,28536,293790,4,28910,294410,5,29285,294411,1,29285,294411,50,29286,294411,40,29286,294411,40,29286,294441,0,29286,294534,50,29286,294564,0,29286,294622,50,29286,294622,30,29286,294622,40,29286,294652,0,29291,294756,50,29292,294756,30,29292,294756,40,29292,294786,0,29292,294875,50,29292,294905,0,29292,294961,50,29293,294961,30,29293,294961,40,29293,294991,0,29298,295077,50,29298,295077,30,29298,295077,40,29298,295107,0,29298,295209,50,29298,295239,0,29303,295383,50,29305,295413,0,29305,295565,50,29309,295595,0,29309,295755,50,29315,295785,0,29319,295951,50,29328,295981,0,29328,296155,50,29343,296185,0,29348,296367,50,29377,296397,0,29377,296589,50,29439,296619,0,29439,296821,50,29556,296821,40,29556,296851,0,29556)
%
%
% START OF PROOF
% 296822 [] equal(X,X).
% 296823 [] equal(multiply(identity,X),X).
% 296824 [] equal(multiply(inverse(X),X),identity).
% 296825 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 296826 [] -equal(multiply(sk_c7,sk_c6),sk_c5).
% 296847 [?] ?
% 296848 [?] ?
% 296851 [?] ?
% 296886 [input:296848,cut:296826] equal(inverse(sk_c4),sk_c6).
% 296887 [para:296886.1.1,296824.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 296898 [input:296847,cut:296826] equal(multiply(sk_c4,sk_c5),sk_c6).
% 296900 [input:296851,cut:296826] equal(multiply(sk_c6,sk_c7),sk_c5).
% 296901 [para:296824.1.1,296825.1.1.1,demod:296823] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 296916 [para:296887.1.1,296825.1.1.1,demod:296823] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 296937 [para:296898.1.1,296916.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 296984 [para:296900.1.1,296901.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 296988 [para:296937.1.2,296901.1.2.2,demod:296984] equal(sk_c6,sk_c7).
% 296992 [para:296988.1.2,296826.1.1.1,demod:296937,cut:296822] 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_c5),sk_c7) | -equal(inverse(Y),sk_c5) | -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,449,50,2,484,0,2,883,50,5,918,0,5,1322,50,9,1357,0,9,1767,50,14,1802,0,14,2219,50,19,2254,0,19,2679,50,30,2714,0,30,3147,50,52,3182,0,52,3625,50,102,3660,0,102,4113,50,210,4148,0,210,4613,50,406,4648,0,406,5125,50,766,5125,40,766,5160,0,766,16166,3,1067,16835,4,1217,17477,5,1367,17477,1,1367,17477,50,1367,17477,40,1367,17512,0,1367,17658,3,1676,17666,4,1818,17674,5,1968,17674,1,1968,17674,50,1968,17674,40,1968,17709,0,1968,40120,3,3472,41444,4,4219,42740,1,4969,42740,50,4969,42740,40,4969,42775,0,4969,56676,3,5721,57744,4,6095,58772,1,6470,58772,50,6470,58772,40,6470,58807,0,6470,69657,3,7221,70452,4,7596,71653,5,7971,71654,1,7971,71654,50,7971,71654,40,7971,71689,0,7971,133649,3,11872,134860,4,13822,136038,5,15773,136039,1,15773,136039,50,15775,136039,40,15775,136074,0,15775,187033,3,18327,187991,4,19601,188987,5,20876,188988,1,20876,188988,50,20878,188988,40,20878,189023,0,20878,226336,3,22380,227312,4,23129,228172,1,23879,228172,50,23881,228172,40,23881,228207,0,23881,238616,3,24632,239433,4,25010,239571,5,25382,239571,1,25382,239571,50,25382,239571,40,25382,239606,0,25382,269254,3,26583,270113,4,27183,270753,5,27783,270754,1,27783,270754,50,27784,270754,40,27784,270789,0,27784,293162,3,28536,293790,4,28910,294410,5,29285,294411,1,29285,294411,50,29286,294411,40,29286,294411,40,29286,294441,0,29286,294534,50,29286,294564,0,29286,294622,50,29286,294622,30,29286,294622,40,29286,294652,0,29291,294756,50,29292,294756,30,29292,294756,40,29292,294786,0,29292,294875,50,29292,294905,0,29292,294961,50,29293,294961,30,29293,294961,40,29293,294991,0,29298,295077,50,29298,295077,30,29298,295077,40,29298,295107,0,29298,295209,50,29298,295239,0,29303,295383,50,29305,295413,0,29305,295565,50,29309,295595,0,29309,295755,50,29315,295785,0,29319,295951,50,29328,295981,0,29328,296155,50,29343,296185,0,29348,296367,50,29377,296397,0,29377,296589,50,29439,296619,0,29439,296821,50,29556,296821,40,29556,296851,0,29556,296991,50,29556,296991,30,29556,296991,40,29556,297021,0,29556,297112,50,29557,297142,0,29562,297282,50,29564,297312,0,29564,297460,50,29568,297490,0,29568,297646,50,29573,297676,0,29577,297838,50,29586,297868,0,29586,298038,50,29601,298068,0,29605,298246,50,29634,298276,0,29634,298464,50,29694,298494,0,29695,298692,50,29808,298692,40,29808,298722,0,29809)
%
%
% START OF PROOF
% 298573 [?] ?
% 298694 [] equal(multiply(identity,X),X).
% 298695 [] equal(multiply(inverse(X),X),identity).
% 298696 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 298697 [] -equal(multiply(sk_c6,sk_c7),sk_c5).
% 298702 [?] ?
% 298707 [?] ?
% 298712 [?] ?
% 298717 [?] ?
% 298722 [?] ?
% 298739 [input:298702,cut:298697] equal(inverse(sk_c2),sk_c5).
% 298740 [para:298739.1.1,298695.1.1.1] equal(multiply(sk_c5,sk_c2),identity).
% 298751 [input:298712,cut:298697] equal(inverse(sk_c1),sk_c7).
% 298752 [para:298751.1.1,298695.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 298759 [input:298707,cut:298697] equal(multiply(sk_c2,sk_c5),sk_c7).
% 298768 [input:298717,cut:298697] equal(multiply(sk_c1,sk_c7),sk_c6).
% 298771 [input:298722,cut:298697] equal(multiply(sk_c7,sk_c6),sk_c5).
% 298772 [para:298695.1.1,298696.1.1.1,demod:298694] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 298777 [para:298740.1.1,298696.1.1.1,demod:298694] equal(X,multiply(sk_c5,multiply(sk_c2,X))).
% 298784 [para:298752.1.1,298696.1.1.1,demod:298694] equal(X,multiply(sk_c7,multiply(sk_c1,X))).
% 298803 [para:298771.1.1,298696.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c7,multiply(sk_c6,X))).
% 298808 [para:298759.1.1,298777.1.2.2] equal(sk_c5,multiply(sk_c5,sk_c7)).
% 298814 [para:298768.1.1,298784.1.2.2] equal(sk_c7,multiply(sk_c7,sk_c6)).
% 298819 [para:298814.1.2,298771.1.1] equal(sk_c7,sk_c5).
% 298820 [para:298814.1.2,298696.1.1.1,demod:298803] equal(multiply(sk_c7,X),multiply(sk_c5,X)).
% 298831 [para:298819.1.1,298768.1.1.2] equal(multiply(sk_c1,sk_c5),sk_c6).
% 298834 [para:298819.1.1,298771.1.1.1] equal(multiply(sk_c5,sk_c6),sk_c5).
% 298837 [para:298831.1.1,298696.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c1,multiply(sk_c5,X))).
% 298882 [para:298777.1.2,298772.1.2.2] equal(multiply(sk_c2,X),multiply(inverse(sk_c5),X)).
% 298883 [para:298808.1.2,298772.1.2.2,demod:298882] equal(sk_c7,multiply(sk_c2,sk_c5)).
% 298884 [para:298784.1.2,298772.1.2.2] equal(multiply(sk_c1,X),multiply(inverse(sk_c7),X)).
% 298887 [para:298834.1.1,298772.1.2.2,demod:298883,298882] equal(sk_c6,sk_c7).
% 298888 [para:298820.1.1,298772.1.2.2,demod:298837,298884] equal(X,multiply(sk_c6,X)).
% 298897 [para:298887.1.2,298697.1.1.2,demod:298888,cut:298573] 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: 36385
% derived clauses: 6418790
% kept clauses: 256585
% kept size sum: 305020
% kept mid-nuclei: 2451
% kept new demods: 4075
% forw unit-subs: 2418828
% forw double-subs: 3435541
% forw overdouble-subs: 262738
% backward subs: 8777
% fast unit cutoff: 20473
% full unit cutoff: 0
% dbl unit cutoff: 5382
% real runtime : 299.83
% process. runtime: 298.9
% specific non-discr-tree subsumption statistics:
% tried: 34664849
% length fails: 3778206
% strength fails: 6453161
% predlist fails: 4729751
% aux str. fails: 5925553
% by-lit fails: 6720315
% full subs tried: 1567065
% full subs fail: 1481235
%
% ; 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/GRP291-1+eq_r.in")
%
%------------------------------------------------------------------------------