TSTP Solution File: GRP287-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP287-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art04.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 296.3s
% Output : Assurance 296.3s
% 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/GRP287-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(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6) | -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(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6).
% -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(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6) | -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,1,65,0,1,577,50,5,612,0,5,1139,50,8,1174,0,8,1706,50,13,1741,0,13,2279,50,19,2314,0,19,2859,50,25,2894,0,25,3447,50,36,3482,0,36,4043,50,59,4078,0,59,4649,50,109,4684,0,109,5265,50,218,5300,0,219,5893,50,412,5928,0,412,6533,50,776,6533,40,776,6568,0,776,16611,3,1077,17426,4,1227,18162,5,1377,18163,1,1377,18163,50,1377,18163,40,1377,18198,0,1377,18370,3,1685,18380,4,1851,18387,5,1978,18387,1,1978,18387,50,1978,18387,40,1978,18422,0,1978,38574,3,3479,39659,4,4229,40474,1,4979,40474,50,4979,40474,40,4979,40509,0,4979,56357,3,5733,57030,4,6105,57642,1,6480,57642,50,6480,57642,40,6480,57677,0,6480,67784,3,7232,69026,4,7606,70135,5,7981,70136,1,7981,70136,50,7981,70136,40,7981,70171,0,7981,132783,3,11883,134005,4,13832,134649,1,15782,134649,50,15784,134649,40,15784,134684,0,15785,185060,3,18336,185950,4,19611,186602,5,20886,186603,1,20886,186603,50,20888,186603,40,20888,186638,0,20888,216216,3,22390,217371,4,23139,218366,5,23889,218367,1,23889,218367,50,23890,218367,40,23890,218402,0,23890,228902,3,24756,229872,4,25016,230412,5,25391,230412,1,25391,230412,50,25391,230412,40,25391,230447,0,25391,258576,3,26593,259337,4,27192,260062,1,27792,260062,50,27793,260062,40,27793,260097,0,27793,278330,3,28544,279140,4,28919,279767,5,29294,279768,1,29294,279768,50,29295,279768,40,29295,279768,40,29295,279798,0,29295)
%
%
% START OF PROOF
% 279770 [] equal(multiply(identity,X),X).
% 279771 [] equal(multiply(inverse(X),X),identity).
% 279772 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 279773 [] -equal(multiply(X,sk_c5),sk_c6) | -equal(inverse(X),sk_c6).
% 279774 [?] ?
% 279775 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 279779 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 279780 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c4),sk_c6).
% 279784 [?] ?
% 279785 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 279789 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 279790 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 279794 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 279795 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c4),sk_c6).
% 279802 [hyper:279773,279775,binarycut:279774] equal(inverse(sk_c2),sk_c6).
% 279804 [para:279802.1.1,279771.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 279811 [hyper:279773,279785,binarycut:279784] equal(inverse(sk_c1),sk_c7).
% 279812 [para:279811.1.1,279771.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 279815 [hyper:279773,279780,279779] equal(multiply(sk_c2,sk_c6),sk_c5).
% 279821 [hyper:279773,279790,279789] equal(multiply(sk_c1,sk_c7),sk_c6).
% 279827 [hyper:279773,279795,279794] equal(multiply(sk_c7,sk_c6),sk_c5).
% 279828 [para:279771.1.1,279772.1.1.1,demod:279770] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 279829 [para:279804.1.1,279772.1.1.1,demod:279770] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 279831 [para:279815.1.1,279772.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c2,multiply(sk_c6,X))).
% 279834 [para:279815.1.1,279829.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 279839 [para:279821.1.1,279828.1.2.2,demod:279827,279811] equal(sk_c7,sk_c5).
% 279842 [para:279839.1.1,279812.1.1.1] equal(multiply(sk_c5,sk_c1),identity).
% 279843 [para:279839.1.1,279821.1.1.2] equal(multiply(sk_c1,sk_c5),sk_c6).
% 279844 [para:279839.1.1,279827.1.1.1] equal(multiply(sk_c5,sk_c6),sk_c5).
% 279852 [para:279844.1.1,279828.1.2.2,demod:279771] equal(sk_c6,identity).
% 279853 [para:279852.1.1,279804.1.1.1,demod:279770] equal(sk_c2,identity).
% 279854 [para:279852.1.1,279815.1.1.2] equal(multiply(sk_c2,identity),sk_c5).
% 279857 [para:279852.1.1,279834.1.2.1,demod:279770] equal(sk_c6,sk_c5).
% 279859 [para:279804.1.1,279831.1.2.2,demod:279854] equal(multiply(sk_c5,sk_c2),sk_c5).
% 279861 [para:279853.1.1,279802.1.1.1] equal(inverse(identity),sk_c6).
% 279864 [para:279857.1.1,279804.1.1.1,demod:279859] equal(sk_c5,identity).
% 279868 [para:279864.1.1,279842.1.1.1,demod:279770] equal(sk_c1,identity).
% 279877 [para:279868.1.1,279843.1.1.1,demod:279770] equal(sk_c5,sk_c6).
% 279882 [hyper:279773,279861,demod:279770,cut:279877] 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(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),sk_c6).
% Split part used next: -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),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,1,65,0,1,577,50,5,612,0,5,1139,50,8,1174,0,8,1706,50,13,1741,0,13,2279,50,19,2314,0,19,2859,50,25,2894,0,25,3447,50,36,3482,0,36,4043,50,59,4078,0,59,4649,50,109,4684,0,109,5265,50,218,5300,0,219,5893,50,412,5928,0,412,6533,50,776,6533,40,776,6568,0,776,16611,3,1077,17426,4,1227,18162,5,1377,18163,1,1377,18163,50,1377,18163,40,1377,18198,0,1377,18370,3,1685,18380,4,1851,18387,5,1978,18387,1,1978,18387,50,1978,18387,40,1978,18422,0,1978,38574,3,3479,39659,4,4229,40474,1,4979,40474,50,4979,40474,40,4979,40509,0,4979,56357,3,5733,57030,4,6105,57642,1,6480,57642,50,6480,57642,40,6480,57677,0,6480,67784,3,7232,69026,4,7606,70135,5,7981,70136,1,7981,70136,50,7981,70136,40,7981,70171,0,7981,132783,3,11883,134005,4,13832,134649,1,15782,134649,50,15784,134649,40,15784,134684,0,15785,185060,3,18336,185950,4,19611,186602,5,20886,186603,1,20886,186603,50,20888,186603,40,20888,186638,0,20888,216216,3,22390,217371,4,23139,218366,5,23889,218367,1,23889,218367,50,23890,218367,40,23890,218402,0,23890,228902,3,24756,229872,4,25016,230412,5,25391,230412,1,25391,230412,50,25391,230412,40,25391,230447,0,25391,258576,3,26593,259337,4,27192,260062,1,27792,260062,50,27793,260062,40,27793,260097,0,27793,278330,3,28544,279140,4,28919,279767,5,29294,279768,1,29294,279768,50,29295,279768,40,29295,279768,40,29295,279798,0,29295,279881,50,29295,279881,30,29295,279881,40,29295,279911,0,29295)
%
%
% START OF PROOF
% 279883 [] equal(multiply(identity,X),X).
% 279884 [] equal(multiply(inverse(X),X),identity).
% 279885 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 279886 [] -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c6).
% 279889 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c6).
% 279890 [?] ?
% 279894 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c3),sk_c6).
% 279895 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 279899 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c6).
% 279900 [?] ?
% 279904 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c6).
% 279905 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 279909 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(inverse(sk_c3),sk_c6).
% 279910 [] equal(multiply(sk_c7,sk_c6),sk_c5) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 279918 [hyper:279886,279889,binarycut:279890] equal(inverse(sk_c2),sk_c6).
% 279921 [para:279918.1.1,279884.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 279929 [hyper:279886,279899,binarycut:279900] equal(inverse(sk_c1),sk_c7).
% 279930 [para:279929.1.1,279884.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 279951 [hyper:279886,279895,279894] equal(multiply(sk_c2,sk_c6),sk_c5).
% 279955 [hyper:279886,279905,279904] equal(multiply(sk_c1,sk_c7),sk_c6).
% 279959 [hyper:279886,279910,279909] equal(multiply(sk_c7,sk_c6),sk_c5).
% 279960 [para:279884.1.1,279885.1.1.1,demod:279883] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 279961 [para:279921.1.1,279885.1.1.1,demod:279883] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 279963 [para:279951.1.1,279885.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c2,multiply(sk_c6,X))).
% 279966 [para:279951.1.1,279961.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 279971 [para:279955.1.1,279960.1.2.2,demod:279959,279929] equal(sk_c7,sk_c5).
% 279974 [para:279971.1.1,279930.1.1.1] equal(multiply(sk_c5,sk_c1),identity).
% 279976 [para:279971.1.1,279959.1.1.1] equal(multiply(sk_c5,sk_c6),sk_c5).
% 279982 [para:279976.1.1,279960.1.2.2,demod:279884] equal(sk_c6,identity).
% 279983 [para:279982.1.1,279921.1.1.1,demod:279883] equal(sk_c2,identity).
% 279984 [para:279982.1.1,279951.1.1.2] equal(multiply(sk_c2,identity),sk_c5).
% 279987 [para:279982.1.1,279966.1.2.1,demod:279883] equal(sk_c6,sk_c5).
% 279989 [para:279921.1.1,279963.1.2.2,demod:279984] equal(multiply(sk_c5,sk_c2),sk_c5).
% 279991 [para:279983.1.1,279918.1.1.1] equal(inverse(identity),sk_c6).
% 279994 [para:279987.1.1,279921.1.1.1,demod:279989] equal(sk_c5,identity).
% 279998 [para:279994.1.1,279974.1.1.1,demod:279883] equal(sk_c1,identity).
% 280005 [para:279998.1.1,279929.1.1.1,demod:279991] equal(sk_c6,sk_c7).
% 280012 [hyper:279886,279991,demod:279883,cut:280005] 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_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6) | -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,1,65,0,1,577,50,5,612,0,5,1139,50,8,1174,0,8,1706,50,13,1741,0,13,2279,50,19,2314,0,19,2859,50,25,2894,0,25,3447,50,36,3482,0,36,4043,50,59,4078,0,59,4649,50,109,4684,0,109,5265,50,218,5300,0,219,5893,50,412,5928,0,412,6533,50,776,6533,40,776,6568,0,776,16611,3,1077,17426,4,1227,18162,5,1377,18163,1,1377,18163,50,1377,18163,40,1377,18198,0,1377,18370,3,1685,18380,4,1851,18387,5,1978,18387,1,1978,18387,50,1978,18387,40,1978,18422,0,1978,38574,3,3479,39659,4,4229,40474,1,4979,40474,50,4979,40474,40,4979,40509,0,4979,56357,3,5733,57030,4,6105,57642,1,6480,57642,50,6480,57642,40,6480,57677,0,6480,67784,3,7232,69026,4,7606,70135,5,7981,70136,1,7981,70136,50,7981,70136,40,7981,70171,0,7981,132783,3,11883,134005,4,13832,134649,1,15782,134649,50,15784,134649,40,15784,134684,0,15785,185060,3,18336,185950,4,19611,186602,5,20886,186603,1,20886,186603,50,20888,186603,40,20888,186638,0,20888,216216,3,22390,217371,4,23139,218366,5,23889,218367,1,23889,218367,50,23890,218367,40,23890,218402,0,23890,228902,3,24756,229872,4,25016,230412,5,25391,230412,1,25391,230412,50,25391,230412,40,25391,230447,0,25391,258576,3,26593,259337,4,27192,260062,1,27792,260062,50,27793,260062,40,27793,260097,0,27793,278330,3,28544,279140,4,28919,279767,5,29294,279768,1,29294,279768,50,29295,279768,40,29295,279768,40,29295,279798,0,29295,279881,50,29295,279881,30,29295,279881,40,29295,279911,0,29295,280011,50,29296,280011,30,29296,280011,40,29296,280041,0,29300)
%
%
% START OF PROOF
% 280013 [] equal(multiply(identity,X),X).
% 280014 [] equal(multiply(inverse(X),X),identity).
% 280015 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 280016 [] -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c6).
% 280017 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c2),sk_c6).
% 280018 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 280019 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c6).
% 280020 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c6).
% 280021 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c2),sk_c6).
% 280022 [?] ?
% 280023 [?] ?
% 280024 [?] ?
% 280025 [?] ?
% 280026 [?] ?
% 280044 [hyper:280016,280018,binarycut:280023] equal(inverse(sk_c4),sk_c6).
% 280047 [para:280044.1.1,280014.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 280051 [hyper:280016,280019,binarycut:280024] equal(inverse(sk_c3),sk_c6).
% 280059 [hyper:280016,280017,binarycut:280022] equal(multiply(sk_c4,sk_c5),sk_c6).
% 280062 [hyper:280016,280020,binarycut:280025] equal(multiply(sk_c3,sk_c6),sk_c7).
% 280065 [hyper:280016,280021,binarycut:280026] equal(multiply(sk_c6,sk_c7),sk_c5).
% 280066 [para:280014.1.1,280015.1.1.1,demod:280013] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 280067 [para:280047.1.1,280015.1.1.1,demod:280013] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 280072 [para:280059.1.1,280067.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 280077 [para:280062.1.1,280066.1.2.2,demod:280065,280051] equal(sk_c6,sk_c5).
% 280078 [para:280065.1.1,280066.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 280080 [para:280072.1.2,280066.1.2.2,demod:280078] equal(sk_c6,sk_c7).
% 280085 [para:280077.1.1,280065.1.1.1] equal(multiply(sk_c5,sk_c7),sk_c5).
% 280093 [para:280085.1.1,280066.1.2.2,demod:280014] equal(sk_c7,identity).
% 280096 [para:280093.1.1,280080.1.2] equal(sk_c6,identity).
% 280098 [para:280096.1.1,280047.1.1.1,demod:280013] equal(sk_c4,identity).
% 280105 [para:280098.1.1,280044.1.1.1] equal(inverse(identity),sk_c6).
% 280114 [hyper:280016,280105,demod:280013,cut:280077] 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(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6) | -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
%
%
% 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,1,65,0,1,577,50,5,612,0,5,1139,50,8,1174,0,8,1706,50,13,1741,0,13,2279,50,19,2314,0,19,2859,50,25,2894,0,25,3447,50,36,3482,0,36,4043,50,59,4078,0,59,4649,50,109,4684,0,109,5265,50,218,5300,0,219,5893,50,412,5928,0,412,6533,50,776,6533,40,776,6568,0,776,16611,3,1077,17426,4,1227,18162,5,1377,18163,1,1377,18163,50,1377,18163,40,1377,18198,0,1377,18370,3,1685,18380,4,1851,18387,5,1978,18387,1,1978,18387,50,1978,18387,40,1978,18422,0,1978,38574,3,3479,39659,4,4229,40474,1,4979,40474,50,4979,40474,40,4979,40509,0,4979,56357,3,5733,57030,4,6105,57642,1,6480,57642,50,6480,57642,40,6480,57677,0,6480,67784,3,7232,69026,4,7606,70135,5,7981,70136,1,7981,70136,50,7981,70136,40,7981,70171,0,7981,132783,3,11883,134005,4,13832,134649,1,15782,134649,50,15784,134649,40,15784,134684,0,15785,185060,3,18336,185950,4,19611,186602,5,20886,186603,1,20886,186603,50,20888,186603,40,20888,186638,0,20888,216216,3,22390,217371,4,23139,218366,5,23889,218367,1,23889,218367,50,23890,218367,40,23890,218402,0,23890,228902,3,24756,229872,4,25016,230412,5,25391,230412,1,25391,230412,50,25391,230412,40,25391,230447,0,25391,258576,3,26593,259337,4,27192,260062,1,27792,260062,50,27793,260062,40,27793,260097,0,27793,278330,3,28544,279140,4,28919,279767,5,29294,279768,1,29294,279768,50,29295,279768,40,29295,279768,40,29295,279798,0,29295,279881,50,29295,279881,30,29295,279881,40,29295,279911,0,29295,280011,50,29296,280011,30,29296,280011,40,29296,280041,0,29300,280113,50,29300,280113,30,29300,280113,40,29300,280143,0,29300,280232,50,29301,280262,0,29301)
%
%
% START OF PROOF
% 280234 [] equal(multiply(identity,X),X).
% 280235 [] equal(multiply(inverse(X),X),identity).
% 280236 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 280237 [] -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 280248 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 280249 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 280250 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c6).
% 280251 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 280252 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c1),sk_c7).
% 280253 [?] ?
% 280254 [?] ?
% 280255 [?] ?
% 280256 [?] ?
% 280257 [?] ?
% 280268 [hyper:280237,280249,binarycut:280254] equal(inverse(sk_c4),sk_c6).
% 280269 [para:280268.1.1,280235.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 280272 [hyper:280237,280250,binarycut:280255] equal(inverse(sk_c3),sk_c6).
% 280273 [para:280272.1.1,280235.1.1.1] equal(multiply(sk_c6,sk_c3),identity).
% 280279 [hyper:280237,280248,binarycut:280253] equal(multiply(sk_c4,sk_c5),sk_c6).
% 280282 [hyper:280237,280251,binarycut:280256] equal(multiply(sk_c3,sk_c6),sk_c7).
% 280286 [hyper:280237,280252,binarycut:280257] equal(multiply(sk_c6,sk_c7),sk_c5).
% 280287 [para:280235.1.1,280236.1.1.1,demod:280234] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 280288 [para:280269.1.1,280236.1.1.1,demod:280234] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 280289 [para:280273.1.1,280236.1.1.1,demod:280234] equal(X,multiply(sk_c6,multiply(sk_c3,X))).
% 280291 [para:280282.1.1,280236.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c3,multiply(sk_c6,X))).
% 280293 [para:280279.1.1,280288.1.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)).
% 280296 [para:280235.1.1,280287.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 280297 [para:280269.1.1,280287.1.2.2] equal(sk_c4,multiply(inverse(sk_c6),identity)).
% 280299 [para:280282.1.1,280287.1.2.2,demod:280286,280272] equal(sk_c6,sk_c5).
% 280300 [para:280236.1.1,280287.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 280301 [para:280286.1.1,280287.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 280302 [para:280288.1.2,280287.1.2.2] equal(multiply(sk_c4,X),multiply(inverse(sk_c6),X)).
% 280303 [para:280293.1.2,280287.1.2.2,demod:280301] equal(sk_c6,sk_c7).
% 280304 [para:280287.1.2,280287.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 280306 [para:280289.1.2,280287.1.2.2,demod:280302] equal(multiply(sk_c3,X),multiply(sk_c4,X)).
% 280309 [para:280299.1.1,280286.1.1.1] equal(multiply(sk_c5,sk_c7),sk_c5).
% 280317 [para:280309.1.1,280287.1.2.2,demod:280235] equal(sk_c7,identity).
% 280320 [para:280317.1.1,280303.1.2] equal(sk_c6,identity).
% 280326 [para:280320.1.1,280288.1.2.1,demod:280234,280306] equal(X,multiply(sk_c3,X)).
% 280327 [para:280320.1.1,280299.1.1] equal(identity,sk_c5).
% 280336 [para:280288.1.2,280291.1.2.2,demod:280326,280306] equal(multiply(sk_c7,X),X).
% 280377 [para:280327.1.2,280301.1.2.2,demod:280297] equal(sk_c7,sk_c4).
% 280378 [para:280377.1.1,280303.1.2] equal(sk_c6,sk_c4).
% 280380 [para:280378.1.1,280282.1.1.2,demod:280326] equal(sk_c4,sk_c7).
% 280383 [para:280304.1.2,280235.1.1] equal(multiply(X,inverse(X)),identity).
% 280385 [para:280304.1.2,280296.1.2] equal(X,multiply(X,identity)).
% 280386 [para:280385.1.2,280296.1.2] equal(X,inverse(inverse(X))).
% 280387 [para:280385.1.2,280297.1.2] equal(sk_c4,inverse(sk_c6)).
% 280390 [para:280383.1.1,280300.1.2.2.2,demod:280385] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 280399 [para:280336.1.1,280390.1.2.1.1] equal(inverse(X),multiply(inverse(X),sk_c7)).
% 280410 [para:280399.1.2,280304.1.2,demod:280386] equal(multiply(X,sk_c7),X).
% 280411 [hyper:280237,280410,demod:280387,cut:280380] 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 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(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6) | -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,1,65,0,1,577,50,5,612,0,5,1139,50,8,1174,0,8,1706,50,13,1741,0,13,2279,50,19,2314,0,19,2859,50,25,2894,0,25,3447,50,36,3482,0,36,4043,50,59,4078,0,59,4649,50,109,4684,0,109,5265,50,218,5300,0,219,5893,50,412,5928,0,412,6533,50,776,6533,40,776,6568,0,776,16611,3,1077,17426,4,1227,18162,5,1377,18163,1,1377,18163,50,1377,18163,40,1377,18198,0,1377,18370,3,1685,18380,4,1851,18387,5,1978,18387,1,1978,18387,50,1978,18387,40,1978,18422,0,1978,38574,3,3479,39659,4,4229,40474,1,4979,40474,50,4979,40474,40,4979,40509,0,4979,56357,3,5733,57030,4,6105,57642,1,6480,57642,50,6480,57642,40,6480,57677,0,6480,67784,3,7232,69026,4,7606,70135,5,7981,70136,1,7981,70136,50,7981,70136,40,7981,70171,0,7981,132783,3,11883,134005,4,13832,134649,1,15782,134649,50,15784,134649,40,15784,134684,0,15785,185060,3,18336,185950,4,19611,186602,5,20886,186603,1,20886,186603,50,20888,186603,40,20888,186638,0,20888,216216,3,22390,217371,4,23139,218366,5,23889,218367,1,23889,218367,50,23890,218367,40,23890,218402,0,23890,228902,3,24756,229872,4,25016,230412,5,25391,230412,1,25391,230412,50,25391,230412,40,25391,230447,0,25391,258576,3,26593,259337,4,27192,260062,1,27792,260062,50,27793,260062,40,27793,260097,0,27793,278330,3,28544,279140,4,28919,279767,5,29294,279768,1,29294,279768,50,29295,279768,40,29295,279768,40,29295,279798,0,29295,279881,50,29295,279881,30,29295,279881,40,29295,279911,0,29295,280011,50,29296,280011,30,29296,280011,40,29296,280041,0,29300,280113,50,29300,280113,30,29300,280113,40,29300,280143,0,29300,280232,50,29301,280262,0,29301,280410,50,29302,280410,30,29302,280410,40,29302,280440,0,29307,280533,50,29308,280563,0,29308,280713,50,29310,280743,0,29314,280910,50,29317,280940,0,29317,281120,50,29321,281150,0,29321,281336,50,29328,281366,0,29332,281560,50,29344,281590,0,29344,281792,50,29369,281822,0,29374,282034,50,29425,282064,0,29426,282286,50,29531,282286,40,29531,282316,0,29532)
%
%
% START OF PROOF
% 282133 [?] ?
% 282288 [] equal(multiply(identity,X),X).
% 282289 [] equal(multiply(inverse(X),X),identity).
% 282290 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 282291 [] -equal(multiply(sk_c7,sk_c6),sk_c5).
% 282314 [?] ?
% 282315 [?] ?
% 282316 [?] ?
% 282353 [input:282314,cut:282291] equal(inverse(sk_c3),sk_c6).
% 282354 [para:282353.1.1,282289.1.1.1] equal(multiply(sk_c6,sk_c3),identity).
% 282364 [input:282315,cut:282291] equal(multiply(sk_c3,sk_c6),sk_c7).
% 282365 [input:282316,cut:282291] equal(multiply(sk_c6,sk_c7),sk_c5).
% 282384 [para:282354.1.1,282290.1.1.1,demod:282288] equal(X,multiply(sk_c6,multiply(sk_c3,X))).
% 282410 [para:282364.1.1,282384.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c7)).
% 282415 [para:282410.1.2,282365.1.1] equal(sk_c6,sk_c5).
% 282417 [para:282415.1.1,282291.1.1.2,cut:282133] 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(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6) | -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,1,65,0,1,577,50,5,612,0,5,1139,50,8,1174,0,8,1706,50,13,1741,0,13,2279,50,19,2314,0,19,2859,50,25,2894,0,25,3447,50,36,3482,0,36,4043,50,59,4078,0,59,4649,50,109,4684,0,109,5265,50,218,5300,0,219,5893,50,412,5928,0,412,6533,50,776,6533,40,776,6568,0,776,16611,3,1077,17426,4,1227,18162,5,1377,18163,1,1377,18163,50,1377,18163,40,1377,18198,0,1377,18370,3,1685,18380,4,1851,18387,5,1978,18387,1,1978,18387,50,1978,18387,40,1978,18422,0,1978,38574,3,3479,39659,4,4229,40474,1,4979,40474,50,4979,40474,40,4979,40509,0,4979,56357,3,5733,57030,4,6105,57642,1,6480,57642,50,6480,57642,40,6480,57677,0,6480,67784,3,7232,69026,4,7606,70135,5,7981,70136,1,7981,70136,50,7981,70136,40,7981,70171,0,7981,132783,3,11883,134005,4,13832,134649,1,15782,134649,50,15784,134649,40,15784,134684,0,15785,185060,3,18336,185950,4,19611,186602,5,20886,186603,1,20886,186603,50,20888,186603,40,20888,186638,0,20888,216216,3,22390,217371,4,23139,218366,5,23889,218367,1,23889,218367,50,23890,218367,40,23890,218402,0,23890,228902,3,24756,229872,4,25016,230412,5,25391,230412,1,25391,230412,50,25391,230412,40,25391,230447,0,25391,258576,3,26593,259337,4,27192,260062,1,27792,260062,50,27793,260062,40,27793,260097,0,27793,278330,3,28544,279140,4,28919,279767,5,29294,279768,1,29294,279768,50,29295,279768,40,29295,279768,40,29295,279798,0,29295,279881,50,29295,279881,30,29295,279881,40,29295,279911,0,29295,280011,50,29296,280011,30,29296,280011,40,29296,280041,0,29300,280113,50,29300,280113,30,29300,280113,40,29300,280143,0,29300,280232,50,29301,280262,0,29301,280410,50,29302,280410,30,29302,280410,40,29302,280440,0,29307,280533,50,29308,280563,0,29308,280713,50,29310,280743,0,29314,280910,50,29317,280940,0,29317,281120,50,29321,281150,0,29321,281336,50,29328,281366,0,29332,281560,50,29344,281590,0,29344,281792,50,29369,281822,0,29374,282034,50,29425,282064,0,29426,282286,50,29531,282286,40,29531,282316,0,29532,282416,50,29532,282416,30,29532,282416,40,29532,282446,0,29532,282543,50,29532,282573,0,29537,282716,50,29539,282746,0,29539,282897,50,29542,282927,0,29542,283086,50,29548,283116,0,29552,283281,50,29561,283311,0,29561,283484,50,29577,283514,0,29581,283695,50,29610,283725,0,29610,283916,50,29673,283946,0,29673,284147,50,29792,284147,40,29792,284177,0,29792)
%
%
% START OF PROOF
% 284019 [?] ?
% 284149 [] equal(multiply(identity,X),X).
% 284150 [] equal(multiply(inverse(X),X),identity).
% 284151 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 284152 [] -equal(multiply(sk_c6,sk_c7),sk_c5).
% 284157 [?] ?
% 284162 [?] ?
% 284167 [?] ?
% 284172 [?] ?
% 284177 [?] ?
% 284194 [input:284157,cut:284152] equal(inverse(sk_c2),sk_c6).
% 284195 [para:284194.1.1,284150.1.1.1] equal(multiply(sk_c6,sk_c2),identity).
% 284206 [input:284167,cut:284152] equal(inverse(sk_c1),sk_c7).
% 284207 [para:284206.1.1,284150.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 284214 [input:284162,cut:284152] equal(multiply(sk_c2,sk_c6),sk_c5).
% 284223 [input:284172,cut:284152] equal(multiply(sk_c1,sk_c7),sk_c6).
% 284226 [input:284177,cut:284152] equal(multiply(sk_c7,sk_c6),sk_c5).
% 284232 [para:284195.1.1,284151.1.1.1,demod:284149] equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 284239 [para:284207.1.1,284151.1.1.1,demod:284149] equal(X,multiply(sk_c7,multiply(sk_c1,X))).
% 284263 [para:284214.1.1,284232.1.2.2] equal(sk_c6,multiply(sk_c6,sk_c5)).
% 284269 [para:284223.1.1,284239.1.2.2] equal(sk_c7,multiply(sk_c7,sk_c6)).
% 284274 [para:284269.1.2,284226.1.1] equal(sk_c7,sk_c5).
% 284276 [para:284274.1.1,284152.1.1.2,demod:284263,cut:284019] 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: 34776
% derived clauses: 7038088
% kept clauses: 241747
% kept size sum: 934861
% kept mid-nuclei: 3521
% kept new demods: 3882
% forw unit-subs: 2959395
% forw double-subs: 3607799
% forw overdouble-subs: 188816
% backward subs: 12062
% fast unit cutoff: 24852
% full unit cutoff: 0
% dbl unit cutoff: 5432
% real runtime : 301.94
% process. runtime: 297.92
% specific non-discr-tree subsumption statistics:
% tried: 37456145
% length fails: 3760169
% strength fails: 11070458
% predlist fails: 2589776
% aux str. fails: 4960407
% by-lit fails: 9190228
% full subs tried: 1204264
% full subs fail: 1109356
%
% ; 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/GRP287-1+eq_r.in")
%
%------------------------------------------------------------------------------