TSTP Solution File: GRP275-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP275-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 : art10.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 298.1s
% Output : Assurance 298.1s
% 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/GRP275-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 21)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 21)
% (binary-posweight-lex-big-order 30 #f 3 21)
% (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(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c8,sk_c6),sk_c7) | -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8) | -equal(multiply(U,V),sk_c7) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c7).
% was split for some strategies as:
% -equal(multiply(U,V),sk_c7) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c7).
% -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8).
% -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8).
% -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% -equal(multiply(sk_c8,sk_c6),sk_c7).
% -equal(multiply(sk_c7,sk_c8),sk_c6).
%
% 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(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c8,sk_c6),sk_c7) | -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8) | -equal(multiply(U,V),sk_c7) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c7).
% Split part used next: -equal(multiply(U,V),sk_c7) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c7).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,1,75,0,1,1105,50,9,1145,0,9,2652,50,28,2692,0,28,4378,50,51,4418,0,51,6237,50,72,6277,0,72,8229,50,98,8269,0,98,10397,50,136,10437,0,136,12742,50,195,12782,0,195,15307,50,295,15347,0,296,18093,50,481,18133,0,481,21143,50,757,21143,40,757,21183,0,757,31885,3,1058,32615,4,1208,33273,5,1358,33274,1,1358,33274,50,1358,33274,40,1358,33314,0,1358,33579,3,1668,33587,4,1810,33597,5,1960,33597,1,1960,33597,50,1960,33597,40,1960,33637,0,1960,55725,3,3463,56833,4,4211,57612,1,4961,57612,50,4961,57612,40,4961,57652,0,4961,75904,3,5713,76600,4,6087,77141,1,6462,77141,50,6462,77141,40,6462,77181,0,6462,87420,3,7215,88703,4,7588,90094,5,7963,90095,5,7963,90095,1,7963,90095,50,7963,90095,40,7963,90135,0,7963,190951,3,11875,192012,4,13815,192928,5,15765,192929,1,15765,192929,50,15768,192929,40,15768,192969,0,15768,262563,3,18321,263355,4,19595,263955,5,20869,263956,1,20869,263956,50,20872,263956,40,20872,263996,0,20872,304895,3,22374,305518,4,23123,306688,5,23873,306689,1,23873,306689,50,23874,306689,40,23874,306729,0,23874,321472,3,24625,322065,4,25000,322532,1,25375,322532,50,25375,322532,40,25375,322572,0,25375,363437,3,26578,364002,4,27177,364370,1,27776,364370,50,27777,364370,40,27777,364410,0,27777,394938,3,28528,395395,4,28903,395793,1,29278,395793,50,29279,395793,40,29279,395793,40,29279,395828,0,29279)
%
%
% START OF PROOF
% 395794 [] equal(X,X).
% 395795 [] equal(multiply(identity,X),X).
% 395796 [] equal(multiply(inverse(X),X),identity).
% 395797 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 395798 [] -equal(multiply(X,sk_c8),sk_c7) | -equal(multiply(Y,X),sk_c7) | -equal(inverse(Y),X).
% 395799 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(multiply(sk_c5,sk_c8),sk_c7).
% 395800 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(inverse(sk_c4),sk_c5).
% 395801 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(multiply(sk_c4,sk_c5),sk_c7).
% 395805 [?] ?
% 395806 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c4),sk_c5).
% 395807 [?] ?
% 395811 [] equal(multiply(sk_c8,sk_c6),sk_c7) | equal(multiply(sk_c5,sk_c8),sk_c7).
% 395812 [] equal(multiply(sk_c8,sk_c6),sk_c7) | equal(inverse(sk_c4),sk_c5).
% 395813 [] equal(multiply(sk_c8,sk_c6),sk_c7) | equal(multiply(sk_c4,sk_c5),sk_c7).
% 395817 [?] ?
% 395818 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c4),sk_c5).
% 395819 [?] ?
% 395823 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(multiply(sk_c5,sk_c8),sk_c7).
% 395824 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(inverse(sk_c4),sk_c5).
% 395825 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(multiply(sk_c4,sk_c5),sk_c7).
% 395834 [hyper:395798,395806,binarycut:395807,binarycut:395805] equal(inverse(sk_c2),sk_c8).
% 395836 [para:395834.1.1,395796.1.1.1] equal(multiply(sk_c8,sk_c2),identity).
% 395842 [hyper:395798,395818,binarycut:395819,binarycut:395817] equal(inverse(sk_c1),sk_c8).
% 395846 [para:395842.1.1,395796.1.1.1] equal(multiply(sk_c8,sk_c1),identity).
% 395887 [hyper:395798,395801,395799,395800] equal(multiply(sk_c2,sk_c7),sk_c8).
% 395900 [hyper:395798,395813,395811,395812] equal(multiply(sk_c8,sk_c6),sk_c7).
% 395919 [hyper:395798,395825,395823,395824] equal(multiply(sk_c1,sk_c8),sk_c7).
% 395926 [para:395796.1.1,395797.1.1.1,demod:395795] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 395927 [para:395836.1.1,395797.1.1.1,demod:395795] equal(X,multiply(sk_c8,multiply(sk_c2,X))).
% 395928 [para:395846.1.1,395797.1.1.1,demod:395795] equal(X,multiply(sk_c8,multiply(sk_c1,X))).
% 395934 [para:395887.1.1,395927.1.2.2] equal(sk_c7,multiply(sk_c8,sk_c8)).
% 395945 [para:395900.1.1,395926.1.2.2] equal(sk_c6,multiply(inverse(sk_c8),sk_c7)).
% 395946 [para:395927.1.2,395926.1.2.2] equal(multiply(sk_c2,X),multiply(inverse(sk_c8),X)).
% 395947 [para:395934.1.2,395926.1.2.2,demod:395945] equal(sk_c8,sk_c6).
% 395948 [para:395928.1.2,395926.1.2.2,demod:395946] equal(multiply(sk_c1,X),multiply(sk_c2,X)).
% 395953 [para:395947.1.1,395919.1.1.2,demod:395948] equal(multiply(sk_c2,sk_c6),sk_c7).
% 395955 [para:395947.1.1,395934.1.2.1] equal(sk_c7,multiply(sk_c6,sk_c8)).
% 395967 [hyper:395798,395953,demod:395834,395955,cut:395794,cut:395947] 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 21
% 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(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c8,sk_c6),sk_c7) | -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8) | -equal(multiply(U,V),sk_c7) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c7).
% Split part used next: -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 21
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,1,75,0,1,1105,50,9,1145,0,9,2652,50,28,2692,0,28,4378,50,51,4418,0,51,6237,50,72,6277,0,72,8229,50,98,8269,0,98,10397,50,136,10437,0,136,12742,50,195,12782,0,195,15307,50,295,15347,0,296,18093,50,481,18133,0,481,21143,50,757,21143,40,757,21183,0,757,31885,3,1058,32615,4,1208,33273,5,1358,33274,1,1358,33274,50,1358,33274,40,1358,33314,0,1358,33579,3,1668,33587,4,1810,33597,5,1960,33597,1,1960,33597,50,1960,33597,40,1960,33637,0,1960,55725,3,3463,56833,4,4211,57612,1,4961,57612,50,4961,57612,40,4961,57652,0,4961,75904,3,5713,76600,4,6087,77141,1,6462,77141,50,6462,77141,40,6462,77181,0,6462,87420,3,7215,88703,4,7588,90094,5,7963,90095,5,7963,90095,1,7963,90095,50,7963,90095,40,7963,90135,0,7963,190951,3,11875,192012,4,13815,192928,5,15765,192929,1,15765,192929,50,15768,192929,40,15768,192969,0,15768,262563,3,18321,263355,4,19595,263955,5,20869,263956,1,20869,263956,50,20872,263956,40,20872,263996,0,20872,304895,3,22374,305518,4,23123,306688,5,23873,306689,1,23873,306689,50,23874,306689,40,23874,306729,0,23874,321472,3,24625,322065,4,25000,322532,1,25375,322532,50,25375,322532,40,25375,322572,0,25375,363437,3,26578,364002,4,27177,364370,1,27776,364370,50,27777,364370,40,27777,364410,0,27777,394938,3,28528,395395,4,28903,395793,1,29278,395793,50,29279,395793,40,29279,395793,40,29279,395828,0,29279,395966,50,29279,395966,30,29279,395966,40,29279,396001,0,29279)
%
%
% START OF PROOF
% 395967 [] equal(X,X).
% 395971 [] -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 395975 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(multiply(sk_c3,sk_c7),sk_c8).
% 395976 [?] ?
% 395981 [?] ?
% 395982 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c3),sk_c8).
% 396009 [hyper:395971,395982,binarycut:395976] equal(inverse(sk_c3),sk_c8).
% 396011 [hyper:395971,395982,binarycut:395981] equal(inverse(sk_c2),sk_c8).
% 396033 [hyper:395971,395975,demod:396011,cut:395967] equal(multiply(sk_c3,sk_c7),sk_c8).
% 396035 [hyper:395971,396033,demod:396009,cut:395967] 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 21
% 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(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c8,sk_c6),sk_c7) | -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8) | -equal(multiply(U,V),sk_c7) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c7).
% Split part used next: -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 21
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,1,75,0,1,1105,50,9,1145,0,9,2652,50,28,2692,0,28,4378,50,51,4418,0,51,6237,50,72,6277,0,72,8229,50,98,8269,0,98,10397,50,136,10437,0,136,12742,50,195,12782,0,195,15307,50,295,15347,0,296,18093,50,481,18133,0,481,21143,50,757,21143,40,757,21183,0,757,31885,3,1058,32615,4,1208,33273,5,1358,33274,1,1358,33274,50,1358,33274,40,1358,33314,0,1358,33579,3,1668,33587,4,1810,33597,5,1960,33597,1,1960,33597,50,1960,33597,40,1960,33637,0,1960,55725,3,3463,56833,4,4211,57612,1,4961,57612,50,4961,57612,40,4961,57652,0,4961,75904,3,5713,76600,4,6087,77141,1,6462,77141,50,6462,77141,40,6462,77181,0,6462,87420,3,7215,88703,4,7588,90094,5,7963,90095,5,7963,90095,1,7963,90095,50,7963,90095,40,7963,90135,0,7963,190951,3,11875,192012,4,13815,192928,5,15765,192929,1,15765,192929,50,15768,192929,40,15768,192969,0,15768,262563,3,18321,263355,4,19595,263955,5,20869,263956,1,20869,263956,50,20872,263956,40,20872,263996,0,20872,304895,3,22374,305518,4,23123,306688,5,23873,306689,1,23873,306689,50,23874,306689,40,23874,306729,0,23874,321472,3,24625,322065,4,25000,322532,1,25375,322532,50,25375,322532,40,25375,322572,0,25375,363437,3,26578,364002,4,27177,364370,1,27776,364370,50,27777,364370,40,27777,364410,0,27777,394938,3,28528,395395,4,28903,395793,1,29278,395793,50,29279,395793,40,29279,395793,40,29279,395828,0,29279,395966,50,29279,395966,30,29279,395966,40,29279,396001,0,29279,396034,50,29279,396034,30,29279,396034,40,29279,396069,0,29285)
%
%
% START OF PROOF
% 396035 [] equal(X,X).
% 396039 [] -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 396043 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(multiply(sk_c3,sk_c7),sk_c8).
% 396044 [?] ?
% 396049 [?] ?
% 396050 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c3),sk_c8).
% 396077 [hyper:396039,396050,binarycut:396044] equal(inverse(sk_c3),sk_c8).
% 396079 [hyper:396039,396050,binarycut:396049] equal(inverse(sk_c2),sk_c8).
% 396101 [hyper:396039,396043,demod:396079,cut:396035] equal(multiply(sk_c3,sk_c7),sk_c8).
% 396103 [hyper:396039,396101,demod:396077,cut:396035] 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 21
% 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(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c8,sk_c6),sk_c7) | -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8) | -equal(multiply(U,V),sk_c7) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c7).
% Split part used next: -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% clause depth limited to 10
% 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(35,40,1,75,0,1,1105,50,9,1145,0,9,2652,50,28,2692,0,28,4378,50,51,4418,0,51,6237,50,72,6277,0,72,8229,50,98,8269,0,98,10397,50,136,10437,0,136,12742,50,195,12782,0,195,15307,50,295,15347,0,296,18093,50,481,18133,0,481,21143,50,757,21143,40,757,21183,0,757,31885,3,1058,32615,4,1208,33273,5,1358,33274,1,1358,33274,50,1358,33274,40,1358,33314,0,1358,33579,3,1668,33587,4,1810,33597,5,1960,33597,1,1960,33597,50,1960,33597,40,1960,33637,0,1960,55725,3,3463,56833,4,4211,57612,1,4961,57612,50,4961,57612,40,4961,57652,0,4961,75904,3,5713,76600,4,6087,77141,1,6462,77141,50,6462,77141,40,6462,77181,0,6462,87420,3,7215,88703,4,7588,90094,5,7963,90095,5,7963,90095,1,7963,90095,50,7963,90095,40,7963,90135,0,7963,190951,3,11875,192012,4,13815,192928,5,15765,192929,1,15765,192929,50,15768,192929,40,15768,192969,0,15768,262563,3,18321,263355,4,19595,263955,5,20869,263956,1,20869,263956,50,20872,263956,40,20872,263996,0,20872,304895,3,22374,305518,4,23123,306688,5,23873,306689,1,23873,306689,50,23874,306689,40,23874,306729,0,23874,321472,3,24625,322065,4,25000,322532,1,25375,322532,50,25375,322532,40,25375,322572,0,25375,363437,3,26578,364002,4,27177,364370,1,27776,364370,50,27777,364370,40,27777,364410,0,27777,394938,3,28528,395395,4,28903,395793,1,29278,395793,50,29279,395793,40,29279,395793,40,29279,395828,0,29279,395966,50,29279,395966,30,29279,395966,40,29279,396001,0,29279,396034,50,29279,396034,30,29279,396034,40,29279,396069,0,29285,396102,50,29285,396102,30,29285,396102,40,29285,396137,0,29285,396281,50,29286,396316,0,29286,396514,50,29291,396549,0,29300,396757,50,29313,396792,0,29313,397012,50,29324,397047,0,29329,397279,50,29345,397314,0,29345,397559,50,29373,397594,0,29373,397855,50,29428,397890,0,29428,398170,50,29528,398170,40,29528,398205,0,29528)
%
%
% START OF PROOF
% 398005 [?] ?
% 398171 [] equal(X,X).
% 398172 [] equal(multiply(identity,X),X).
% 398173 [] equal(multiply(inverse(X),X),identity).
% 398174 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 398175 [] -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% 398214 [para:398173.1.1,398175.1.1,cut:398005] -equal(inverse(inverse(sk_c8)),sk_c8).
% 398277 [para:398173.1.1,398174.1.1.1,demod:398172] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 398332 [para:398173.1.1,398277.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 398405 [para:398277.1.2,398277.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 398460 [para:398405.1.2,398332.1.2] equal(X,multiply(X,identity)).
% 398474 [para:398460.1.2,398332.1.2] equal(X,inverse(inverse(X))).
% 398481 [para:398474.1.2,398214.1.1,cut:398171] 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 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c8,sk_c6),sk_c7) | -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8) | -equal(multiply(U,V),sk_c7) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c7).
% Split part used next: -equal(multiply(sk_c8,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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% clause depth limited to 10
% 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(35,40,1,75,0,1,1105,50,9,1145,0,9,2652,50,28,2692,0,28,4378,50,51,4418,0,51,6237,50,72,6277,0,72,8229,50,98,8269,0,98,10397,50,136,10437,0,136,12742,50,195,12782,0,195,15307,50,295,15347,0,296,18093,50,481,18133,0,481,21143,50,757,21143,40,757,21183,0,757,31885,3,1058,32615,4,1208,33273,5,1358,33274,1,1358,33274,50,1358,33274,40,1358,33314,0,1358,33579,3,1668,33587,4,1810,33597,5,1960,33597,1,1960,33597,50,1960,33597,40,1960,33637,0,1960,55725,3,3463,56833,4,4211,57612,1,4961,57612,50,4961,57612,40,4961,57652,0,4961,75904,3,5713,76600,4,6087,77141,1,6462,77141,50,6462,77141,40,6462,77181,0,6462,87420,3,7215,88703,4,7588,90094,5,7963,90095,5,7963,90095,1,7963,90095,50,7963,90095,40,7963,90135,0,7963,190951,3,11875,192012,4,13815,192928,5,15765,192929,1,15765,192929,50,15768,192929,40,15768,192969,0,15768,262563,3,18321,263355,4,19595,263955,5,20869,263956,1,20869,263956,50,20872,263956,40,20872,263996,0,20872,304895,3,22374,305518,4,23123,306688,5,23873,306689,1,23873,306689,50,23874,306689,40,23874,306729,0,23874,321472,3,24625,322065,4,25000,322532,1,25375,322532,50,25375,322532,40,25375,322572,0,25375,363437,3,26578,364002,4,27177,364370,1,27776,364370,50,27777,364370,40,27777,364410,0,27777,394938,3,28528,395395,4,28903,395793,1,29278,395793,50,29279,395793,40,29279,395793,40,29279,395828,0,29279,395966,50,29279,395966,30,29279,395966,40,29279,396001,0,29279,396034,50,29279,396034,30,29279,396034,40,29279,396069,0,29285,396102,50,29285,396102,30,29285,396102,40,29285,396137,0,29285,396281,50,29286,396316,0,29286,396514,50,29291,396549,0,29300,396757,50,29313,396792,0,29313,397012,50,29324,397047,0,29329,397279,50,29345,397314,0,29345,397559,50,29373,397594,0,29373,397855,50,29428,397890,0,29428,398170,50,29528,398170,40,29528,398205,0,29528,398480,50,29529,398480,30,29529,398480,40,29529,398515,0,29529,398642,50,29530,398677,0,29535,398861,50,29540,398896,0,29540,399090,50,29547,399125,0,29547,399331,50,29559,399366,0,29564,399584,50,29581,399619,0,29581,399854,50,29614,399889,0,29618,400141,50,29678,400176,0,29678,400449,50,29803,400449,40,29803,400484,0,29803)
%
%
% START OF PROOF
% 400278 [?] ?
% 400451 [] equal(multiply(identity,X),X).
% 400452 [] equal(multiply(inverse(X),X),identity).
% 400453 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 400454 [] -equal(multiply(sk_c8,sk_c6),sk_c7).
% 400468 [?] ?
% 400469 [?] ?
% 400472 [?] ?
% 400511 [input:400468,cut:400454] equal(inverse(sk_c4),sk_c5).
% 400512 [para:400511.1.1,400452.1.1.1] equal(multiply(sk_c5,sk_c4),identity).
% 400531 [input:400469,cut:400454] equal(multiply(sk_c4,sk_c5),sk_c7).
% 400534 [input:400472,cut:400454] equal(multiply(sk_c7,sk_c8),sk_c6).
% 400540 [para:400452.1.1,400453.1.1.1,demod:400451] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 400553 [para:400512.1.1,400453.1.1.1,demod:400451] equal(X,multiply(sk_c5,multiply(sk_c4,X))).
% 400579 [para:400531.1.1,400553.1.2.2] equal(sk_c5,multiply(sk_c5,sk_c7)).
% 400631 [para:400553.1.2,400540.1.2.2] equal(multiply(sk_c4,X),multiply(inverse(sk_c5),X)).
% 400632 [para:400579.1.2,400540.1.2.2,demod:400631] equal(sk_c7,multiply(sk_c4,sk_c5)).
% 400650 [para:400631.1.2,400452.1.1,demod:400632] equal(sk_c7,identity).
% 400664 [para:400650.1.1,400534.1.1.1,demod:400451] equal(sk_c8,sk_c6).
% 400669 [para:400664.1.1,400454.1.1.1,cut:400278] 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(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(sk_c8,sk_c6),sk_c7) | -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(sk_c7,sk_c8),sk_c6) | -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8) | -equal(multiply(U,V),sk_c7) | -equal(inverse(U),V) | -equal(multiply(V,sk_c8),sk_c7).
% Split part used next: -equal(multiply(sk_c7,sk_c8),sk_c6).
% END OF PROOFPART
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% 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 21
% clause depth limited to 10
% 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(35,40,1,75,0,1,1105,50,9,1145,0,9,2652,50,28,2692,0,28,4378,50,51,4418,0,51,6237,50,72,6277,0,72,8229,50,98,8269,0,98,10397,50,136,10437,0,136,12742,50,195,12782,0,195,15307,50,295,15347,0,296,18093,50,481,18133,0,481,21143,50,757,21143,40,757,21183,0,757,31885,3,1058,32615,4,1208,33273,5,1358,33274,1,1358,33274,50,1358,33274,40,1358,33314,0,1358,33579,3,1668,33587,4,1810,33597,5,1960,33597,1,1960,33597,50,1960,33597,40,1960,33637,0,1960,55725,3,3463,56833,4,4211,57612,1,4961,57612,50,4961,57612,40,4961,57652,0,4961,75904,3,5713,76600,4,6087,77141,1,6462,77141,50,6462,77141,40,6462,77181,0,6462,87420,3,7215,88703,4,7588,90094,5,7963,90095,5,7963,90095,1,7963,90095,50,7963,90095,40,7963,90135,0,7963,190951,3,11875,192012,4,13815,192928,5,15765,192929,1,15765,192929,50,15768,192929,40,15768,192969,0,15768,262563,3,18321,263355,4,19595,263955,5,20869,263956,1,20869,263956,50,20872,263956,40,20872,263996,0,20872,304895,3,22374,305518,4,23123,306688,5,23873,306689,1,23873,306689,50,23874,306689,40,23874,306729,0,23874,321472,3,24625,322065,4,25000,322532,1,25375,322532,50,25375,322532,40,25375,322572,0,25375,363437,3,26578,364002,4,27177,364370,1,27776,364370,50,27777,364370,40,27777,364410,0,27777,394938,3,28528,395395,4,28903,395793,1,29278,395793,50,29279,395793,40,29279,395793,40,29279,395828,0,29279,395966,50,29279,395966,30,29279,395966,40,29279,396001,0,29279,396034,50,29279,396034,30,29279,396034,40,29279,396069,0,29285,396102,50,29285,396102,30,29285,396102,40,29285,396137,0,29285,396281,50,29286,396316,0,29286,396514,50,29291,396549,0,29300,396757,50,29313,396792,0,29313,397012,50,29324,397047,0,29329,397279,50,29345,397314,0,29345,397559,50,29373,397594,0,29373,397855,50,29428,397890,0,29428,398170,50,29528,398170,40,29528,398205,0,29528,398480,50,29529,398480,30,29529,398480,40,29529,398515,0,29529,398642,50,29530,398677,0,29535,398861,50,29540,398896,0,29540,399090,50,29547,399125,0,29547,399331,50,29559,399366,0,29564,399584,50,29581,399619,0,29581,399854,50,29614,399889,0,29618,400141,50,29678,400176,0,29678,400449,50,29803,400449,40,29803,400484,0,29803,400668,50,29803,400668,30,29803,400668,40,29803,400703,0,29803,400803,50,29804,400838,0,29809,400988,50,29812,401023,0,29812,401183,50,29818,401218,0,29818,401388,50,29827,401423,0,29831,401605,50,29846,401640,0,29846,401835,50,29870,401870,0,29875,402081,50,29920,402116,0,29920,402346,50,30011,402346,40,30011,402381,0,30011)
%
%
% START OF PROOF
% 402348 [] equal(multiply(identity,X),X).
% 402349 [] equal(multiply(inverse(X),X),identity).
% 402350 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 402351 [] -equal(multiply(sk_c7,sk_c8),sk_c6).
% 402357 [?] ?
% 402363 [?] ?
% 402369 [?] ?
% 402375 [?] ?
% 402381 [?] ?
% 402406 [input:402363,cut:402351] equal(inverse(sk_c2),sk_c8).
% 402407 [para:402406.1.1,402349.1.1.1] equal(multiply(sk_c8,sk_c2),identity).
% 402419 [input:402357,cut:402351] equal(multiply(sk_c2,sk_c7),sk_c8).
% 402420 [input:402375,cut:402351] equal(inverse(sk_c1),sk_c8).
% 402421 [para:402420.1.1,402349.1.1.1] equal(multiply(sk_c8,sk_c1),identity).
% 402433 [input:402369,cut:402351] equal(multiply(sk_c8,sk_c6),sk_c7).
% 402437 [input:402381,cut:402351] equal(multiply(sk_c1,sk_c8),sk_c7).
% 402440 [para:402349.1.1,402350.1.1.1,demod:402348] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 402450 [para:402407.1.1,402350.1.1.1,demod:402348] equal(X,multiply(sk_c8,multiply(sk_c2,X))).
% 402458 [para:402419.1.1,402350.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c2,multiply(sk_c7,X))).
% 402459 [para:402421.1.1,402350.1.1.1,demod:402348] equal(X,multiply(sk_c8,multiply(sk_c1,X))).
% 402487 [para:402419.1.1,402450.1.2.2] equal(sk_c7,multiply(sk_c8,sk_c8)).
% 402533 [para:402433.1.1,402440.1.2.2] equal(sk_c6,multiply(inverse(sk_c8),sk_c7)).
% 402544 [para:402450.1.2,402440.1.2.2] equal(multiply(sk_c2,X),multiply(inverse(sk_c8),X)).
% 402545 [para:402487.1.2,402440.1.2.2,demod:402533] equal(sk_c8,sk_c6).
% 402546 [para:402459.1.2,402440.1.2.2,demod:402544] equal(multiply(sk_c1,X),multiply(sk_c2,X)).
% 402568 [para:402545.1.1,402437.1.1.2,demod:402546] equal(multiply(sk_c2,sk_c6),sk_c7).
% 402578 [para:402568.1.1,402350.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c2,multiply(sk_c6,X))).
% 402585 [para:402533.1.2,402350.1.1.1,demod:402458,402544] equal(multiply(sk_c6,X),multiply(sk_c8,X)).
% 402589 [para:402585.1.2,402440.1.2.2,demod:402578,402544] equal(X,multiply(sk_c7,X)).
% 402590 [para:402589.1.2,402351.1.1,cut:402545] 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: 33113
% derived clauses: 6093117
% kept clauses: 325289
% kept size sum: 44395
% kept mid-nuclei: 17066
% kept new demods: 5361
% forw unit-subs: 2146587
% forw double-subs: 3217085
% forw overdouble-subs: 325162
% backward subs: 13445
% fast unit cutoff: 33651
% full unit cutoff: 0
% dbl unit cutoff: 6962
% real runtime : 302.29
% process. runtime: 300.11
% specific non-discr-tree subsumption statistics:
% tried: 30395087
% length fails: 2727090
% strength fails: 8445175
% predlist fails: 2661942
% aux str. fails: 4140005
% by-lit fails: 6245815
% full subs tried: 1036820
% full subs fail: 921514
%
% ; 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/GRP275-1+eq_r.in")
%
%------------------------------------------------------------------------------