TSTP Solution File: GRP269-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP269-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 298.2s
% Output : Assurance 298.2s
% 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/GRP269-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 29)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 29)
% (binary-posweight-lex-big-order 30 #f 3 29)
% (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_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c11),sk_c9) | -equal(inverse(Y),sk_c11) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% was split for some strategies as:
% -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X2),W) | -equal(inverse(X1),X2) | -equal(multiply(X1,W),X2).
% -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10).
% -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11).
% -equal(multiply(Y,sk_c11),sk_c9) | -equal(inverse(Y),sk_c11).
% -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% -equal(multiply(sk_c11,sk_c9),sk_c10).
%
% 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_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c11),sk_c9) | -equal(inverse(Y),sk_c11) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X2),W) | -equal(inverse(X1),X2) | -equal(multiply(X1,W),X2).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(55,40,1,119,0,1,72549,4,1327,77661,5,1502,77662,1,1502,77662,50,1502,77662,40,1502,77726,0,1502,85339,3,1803,86438,4,1953,87277,5,2103,87277,1,2103,87277,50,2103,87277,40,2103,87341,0,2103,89137,3,2412,89229,4,2567,89259,5,2704,89259,1,2704,89259,50,2704,89259,40,2704,89323,0,2704,116197,3,4205,117200,4,4955,118165,5,5705,118166,1,5705,118166,50,5706,118166,40,5706,118230,0,5706,136775,3,6457,137498,4,6832,137992,1,7207,137992,50,7207,137992,40,7207,138056,0,7207,153103,3,8006,154309,4,8333,155910,5,8708,155911,1,8708,155911,50,8708,155911,40,8708,155975,0,8708,198802,3,12609,200310,4,14559,201469,5,16509,201470,1,16509,201470,50,16510,201470,40,16510,201534,0,16510,238804,3,19061,240041,4,20336,241033,5,21611,241034,1,21611,241034,50,21612,241034,40,21612,241098,0,21612,275438,3,23113,276576,4,23863,277480,1,24613,277480,50,24614,277480,40,24614,277544,0,24614,292752,3,25372,294559,4,25740,296296,5,26115,296296,1,26115,296296,50,26115,296296,40,26115,296360,0,26115,324728,3,27325,325329,4,27916,325783,5,28516,325784,1,28516,325784,50,28517,325784,40,28517,325848,0,28517,345244,3,29268,345818,4,29643,346351,1,30018,346351,50,30018,346351,40,30018,346351,40,30018,346460,0,30018)
%
%
% START OF PROOF
% 346352 [] equal(X,X).
% 346353 [] equal(multiply(identity,X),X).
% 346354 [] equal(multiply(inverse(X),X),identity).
% 346355 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 346406 [] -equal(multiply(X,sk_c10),sk_c11) | -equal(multiply(Y,X),sk_c11) | -equal(multiply(Z,X),U) | -equal(inverse(Z),U) | -equal(inverse(U),X) | -equal(inverse(Y),X).
% 346407 [] -equal(multiply(X,Y),Z) | -equal(inverse(X),Z) | -equal(inverse(Z),Y) | $spltprd1($spltcnst97,Y).
% 346408 [] -equal(multiply(X,Y),sk_c11) | -equal(inverse(X),Y) | $spltprd1($spltcnst98,Y).
% 346409 [] -equal(multiply(X,sk_c10),sk_c11) | $spltprd1($spltcnst99,X).
% 346410 [] -$spltprd1($spltcnst98,X) | -$spltprd1($spltcnst97,X) | -$spltprd1($spltcnst99,X).
% 346411 [] equal(multiply(sk_c7,sk_c8),sk_c6) | equal(inverse(sk_c2),sk_c11).
% 346412 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c6),sk_c8).
% 346413 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c7),sk_c6).
% 346414 [] equal(multiply(sk_c8,sk_c10),sk_c11) | equal(inverse(sk_c2),sk_c11).
% 346415 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c5),sk_c8).
% 346416 [?] ?
% 346421 [] equal(multiply(sk_c2,sk_c11),sk_c9) | equal(multiply(sk_c7,sk_c8),sk_c6).
% 346422 [] equal(multiply(sk_c2,sk_c11),sk_c9) | equal(inverse(sk_c6),sk_c8).
% 346423 [] equal(multiply(sk_c2,sk_c11),sk_c9) | equal(inverse(sk_c7),sk_c6).
% 346424 [] equal(multiply(sk_c2,sk_c11),sk_c9) | equal(multiply(sk_c8,sk_c10),sk_c11).
% 346425 [] equal(multiply(sk_c2,sk_c11),sk_c9) | equal(inverse(sk_c5),sk_c8).
% 346426 [] equal(multiply(sk_c2,sk_c11),sk_c9) | equal(multiply(sk_c5,sk_c8),sk_c11).
% 346431 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(multiply(sk_c7,sk_c8),sk_c6).
% 346432 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(inverse(sk_c6),sk_c8).
% 346433 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(inverse(sk_c7),sk_c6).
% 346434 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(multiply(sk_c8,sk_c10),sk_c11).
% 346435 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(inverse(sk_c5),sk_c8).
% 346436 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(multiply(sk_c5,sk_c8),sk_c11).
% 346441 [] equal(multiply(sk_c7,sk_c8),sk_c6) | equal(inverse(sk_c1),sk_c11).
% 346442 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c6),sk_c8).
% 346443 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c7),sk_c6).
% 346444 [] equal(multiply(sk_c8,sk_c10),sk_c11) | equal(inverse(sk_c1),sk_c11).
% 346445 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c5),sk_c8).
% 346446 [?] ?
% 346451 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c7,sk_c8),sk_c6).
% 346452 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c6),sk_c8).
% 346453 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c7),sk_c6).
% 346454 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c8,sk_c10),sk_c11).
% 346455 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c5),sk_c8).
% 346456 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c5,sk_c8),sk_c11).
% 346527 [hyper:346408,346415,binarycut:346416] equal(inverse(sk_c2),sk_c11) | $spltprd1($spltcnst98,sk_c8).
% 346615 [hyper:346408,346445,binarycut:346446] equal(inverse(sk_c1),sk_c11) | $spltprd1($spltcnst98,sk_c8).
% 346677 [hyper:346407,346411,346412,346413] equal(inverse(sk_c2),sk_c11) | $spltprd1($spltcnst97,sk_c8).
% 346706 [hyper:346409,346414] equal(inverse(sk_c2),sk_c11) | $spltprd1($spltcnst99,sk_c8).
% 346717 [hyper:346410,346706,346677,346527] equal(inverse(sk_c2),sk_c11).
% 346724 [para:346717.1.1,346354.1.1.1] equal(multiply(sk_c11,sk_c2),identity).
% 346856 [hyper:346407,346441,346442,346443] equal(inverse(sk_c1),sk_c11) | $spltprd1($spltcnst97,sk_c8).
% 346883 [hyper:346409,346444] equal(inverse(sk_c1),sk_c11) | $spltprd1($spltcnst99,sk_c8).
% 346894 [hyper:346410,346883,346856,346615] equal(inverse(sk_c1),sk_c11).
% 346901 [para:346894.1.1,346354.1.1.1] equal(multiply(sk_c11,sk_c1),identity).
% 347060 [hyper:346406,346426,346424,346425,346422,346421,346423] equal(multiply(sk_c2,sk_c11),sk_c9).
% 347225 [hyper:346406,346436,346434,346435,346432,346431,346433] equal(multiply(sk_c11,sk_c9),sk_c10).
% 347302 [hyper:346406,346456,346454,346455,346452,346451,346453] equal(multiply(sk_c1,sk_c11),sk_c10).
% 347310 [para:346354.1.1,346355.1.1.1,demod:346353] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 347311 [para:346724.1.1,346355.1.1.1,demod:346353] equal(X,multiply(sk_c11,multiply(sk_c2,X))).
% 347312 [para:346901.1.1,346355.1.1.1,demod:346353] equal(X,multiply(sk_c11,multiply(sk_c1,X))).
% 347328 [para:347060.1.1,347311.1.2.2,demod:347225] equal(sk_c11,sk_c10).
% 347333 [para:347328.1.1,346724.1.1.1] equal(multiply(sk_c10,sk_c2),identity).
% 347336 [para:347328.1.1,347225.1.1.1] equal(multiply(sk_c10,sk_c9),sk_c10).
% 347379 [para:347302.1.1,347312.1.2.2] equal(sk_c11,multiply(sk_c11,sk_c10)).
% 347425 [para:346724.1.1,347310.1.2.2] equal(sk_c2,multiply(inverse(sk_c11),identity)).
% 347435 [para:347225.1.1,347310.1.2.2] equal(sk_c9,multiply(inverse(sk_c11),sk_c10)).
% 347436 [para:347311.1.2,347310.1.2.2] equal(multiply(sk_c2,X),multiply(inverse(sk_c11),X)).
% 347438 [para:347336.1.1,347310.1.2.2,demod:346354] equal(sk_c9,identity).
% 347440 [para:347379.1.2,347310.1.2.2,demod:347060,347436] equal(sk_c10,sk_c9).
% 347446 [para:347440.1.2,347438.1.1] equal(sk_c10,identity).
% 347448 [para:347446.1.1,347333.1.1.1,demod:346353] equal(sk_c2,identity).
% 347452 [para:347448.1.1,346717.1.1.1] equal(inverse(identity),sk_c11).
% 347453 [para:347448.1.1,347060.1.1.1,demod:346353] equal(sk_c11,sk_c9).
% 347887 [para:347446.1.1,347435.1.2.2,demod:347425] equal(sk_c9,sk_c2).
% 347916 [para:347887.1.2,346717.1.1.1] equal(inverse(sk_c9),sk_c11).
% 347929 [hyper:346406,347916,346353,347060,demod:347379,cut:346352,demod:347452,cut:346352,demod:346717,cut:347453] 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 29
% 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_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c11),sk_c9) | -equal(inverse(Y),sk_c11) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10).
% 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 29
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(55,40,1,119,0,1,72549,4,1327,77661,5,1502,77662,1,1502,77662,50,1502,77662,40,1502,77726,0,1502,85339,3,1803,86438,4,1953,87277,5,2103,87277,1,2103,87277,50,2103,87277,40,2103,87341,0,2103,89137,3,2412,89229,4,2567,89259,5,2704,89259,1,2704,89259,50,2704,89259,40,2704,89323,0,2704,116197,3,4205,117200,4,4955,118165,5,5705,118166,1,5705,118166,50,5706,118166,40,5706,118230,0,5706,136775,3,6457,137498,4,6832,137992,1,7207,137992,50,7207,137992,40,7207,138056,0,7207,153103,3,8006,154309,4,8333,155910,5,8708,155911,1,8708,155911,50,8708,155911,40,8708,155975,0,8708,198802,3,12609,200310,4,14559,201469,5,16509,201470,1,16509,201470,50,16510,201470,40,16510,201534,0,16510,238804,3,19061,240041,4,20336,241033,5,21611,241034,1,21611,241034,50,21612,241034,40,21612,241098,0,21612,275438,3,23113,276576,4,23863,277480,1,24613,277480,50,24614,277480,40,24614,277544,0,24614,292752,3,25372,294559,4,25740,296296,5,26115,296296,1,26115,296296,50,26115,296296,40,26115,296360,0,26115,324728,3,27325,325329,4,27916,325783,5,28516,325784,1,28516,325784,50,28517,325784,40,28517,325848,0,28517,345244,3,29268,345818,4,29643,346351,1,30018,346351,50,30018,346351,40,30018,346351,40,30018,346460,0,30018,347928,50,30024,347928,30,30024,347928,40,30024,347983,0,30024)
%
%
% START OF PROOF
% 347930 [] equal(multiply(identity,X),X).
% 347931 [] equal(multiply(inverse(X),X),identity).
% 347932 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 347933 [] -equal(multiply(X,sk_c10),sk_c9) | -equal(inverse(X),sk_c10).
% 347940 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c4),sk_c10).
% 347941 [?] ?
% 347950 [] equal(multiply(sk_c2,sk_c11),sk_c9) | equal(inverse(sk_c4),sk_c10).
% 347951 [] equal(multiply(sk_c2,sk_c11),sk_c9) | equal(multiply(sk_c4,sk_c10),sk_c9).
% 347960 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(inverse(sk_c4),sk_c10).
% 347961 [] equal(multiply(sk_c11,sk_c9),sk_c10) | equal(multiply(sk_c4,sk_c10),sk_c9).
% 347990 [hyper:347933,347940,binarycut:347941] equal(inverse(sk_c2),sk_c11).
% 347991 [para:347990.1.1,347931.1.1.1] equal(multiply(sk_c11,sk_c2),identity).
% 348024 [hyper:347933,347951,347950] equal(multiply(sk_c2,sk_c11),sk_c9).
% 348031 [hyper:347933,347961,347960] equal(multiply(sk_c11,sk_c9),sk_c10).
% 348039 [para:347991.1.1,347932.1.1.1,demod:347930] equal(X,multiply(sk_c11,multiply(sk_c2,X))).
% 348044 [para:348024.1.1,348039.1.2.2,demod:348031] equal(sk_c11,sk_c10).
% 348047 [para:348044.1.1,348024.1.1.2] equal(multiply(sk_c2,sk_c10),sk_c9).
% 348060 [hyper:347933,348047,demod:347990,cut:348044] 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 29
% 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_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c11),sk_c9) | -equal(inverse(Y),sk_c11) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11).
% 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 29
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(55,40,1,119,0,1,72549,4,1327,77661,5,1502,77662,1,1502,77662,50,1502,77662,40,1502,77726,0,1502,85339,3,1803,86438,4,1953,87277,5,2103,87277,1,2103,87277,50,2103,87277,40,2103,87341,0,2103,89137,3,2412,89229,4,2567,89259,5,2704,89259,1,2704,89259,50,2704,89259,40,2704,89323,0,2704,116197,3,4205,117200,4,4955,118165,5,5705,118166,1,5705,118166,50,5706,118166,40,5706,118230,0,5706,136775,3,6457,137498,4,6832,137992,1,7207,137992,50,7207,137992,40,7207,138056,0,7207,153103,3,8006,154309,4,8333,155910,5,8708,155911,1,8708,155911,50,8708,155911,40,8708,155975,0,8708,198802,3,12609,200310,4,14559,201469,5,16509,201470,1,16509,201470,50,16510,201470,40,16510,201534,0,16510,238804,3,19061,240041,4,20336,241033,5,21611,241034,1,21611,241034,50,21612,241034,40,21612,241098,0,21612,275438,3,23113,276576,4,23863,277480,1,24613,277480,50,24614,277480,40,24614,277544,0,24614,292752,3,25372,294559,4,25740,296296,5,26115,296296,1,26115,296296,50,26115,296296,40,26115,296360,0,26115,324728,3,27325,325329,4,27916,325783,5,28516,325784,1,28516,325784,50,28517,325784,40,28517,325848,0,28517,345244,3,29268,345818,4,29643,346351,1,30018,346351,50,30018,346351,40,30018,346351,40,30018,346460,0,30018,347928,50,30024,347928,30,30024,347928,40,30024,347983,0,30024,348059,50,30024,348059,30,30024,348059,40,30024,348114,0,30028)
%
%
% START OF PROOF
% 348060 [] equal(X,X).
% 348064 [] -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% 348103 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c3),sk_c11).
% 348104 [?] ?
% 348113 [?] ?
% 348114 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c3,sk_c11),sk_c10).
% 348156 [hyper:348064,348103,binarycut:348113] equal(inverse(sk_c3),sk_c11).
% 348158 [hyper:348064,348103,binarycut:348104] equal(inverse(sk_c1),sk_c11).
% 348182 [hyper:348064,348114,demod:348158,cut:348060] equal(multiply(sk_c3,sk_c11),sk_c10).
% 348184 [hyper:348064,348182,demod:348156,cut:348060] 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 29
% 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_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c11),sk_c9) | -equal(inverse(Y),sk_c11) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(Y,sk_c11),sk_c9) | -equal(inverse(Y),sk_c11).
% 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 29
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(55,40,1,119,0,1,72549,4,1327,77661,5,1502,77662,1,1502,77662,50,1502,77662,40,1502,77726,0,1502,85339,3,1803,86438,4,1953,87277,5,2103,87277,1,2103,87277,50,2103,87277,40,2103,87341,0,2103,89137,3,2412,89229,4,2567,89259,5,2704,89259,1,2704,89259,50,2704,89259,40,2704,89323,0,2704,116197,3,4205,117200,4,4955,118165,5,5705,118166,1,5705,118166,50,5706,118166,40,5706,118230,0,5706,136775,3,6457,137498,4,6832,137992,1,7207,137992,50,7207,137992,40,7207,138056,0,7207,153103,3,8006,154309,4,8333,155910,5,8708,155911,1,8708,155911,50,8708,155911,40,8708,155975,0,8708,198802,3,12609,200310,4,14559,201469,5,16509,201470,1,16509,201470,50,16510,201470,40,16510,201534,0,16510,238804,3,19061,240041,4,20336,241033,5,21611,241034,1,21611,241034,50,21612,241034,40,21612,241098,0,21612,275438,3,23113,276576,4,23863,277480,1,24613,277480,50,24614,277480,40,24614,277544,0,24614,292752,3,25372,294559,4,25740,296296,5,26115,296296,1,26115,296296,50,26115,296296,40,26115,296360,0,26115,324728,3,27325,325329,4,27916,325783,5,28516,325784,1,28516,325784,50,28517,325784,40,28517,325848,0,28517,345244,3,29268,345818,4,29643,346351,1,30018,346351,50,30018,346351,40,30018,346351,40,30018,346460,0,30018,347928,50,30024,347928,30,30024,347928,40,30024,347983,0,30024,348059,50,30024,348059,30,30024,348059,40,30024,348114,0,30028,348183,50,30028,348183,30,30028,348183,40,30028,348238,0,30028)
%
%
% START OF PROOF
% 348185 [] equal(multiply(identity,X),X).
% 348186 [] equal(multiply(inverse(X),X),identity).
% 348187 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 348188 [] -equal(multiply(X,sk_c11),sk_c9) | -equal(inverse(X),sk_c11).
% 348189 [] equal(multiply(sk_c7,sk_c8),sk_c6) | equal(inverse(sk_c2),sk_c11).
% 348190 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c6),sk_c8).
% 348191 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c7),sk_c6).
% 348192 [] equal(multiply(sk_c8,sk_c10),sk_c11) | equal(inverse(sk_c2),sk_c11).
% 348193 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c5),sk_c8).
% 348194 [] equal(multiply(sk_c5,sk_c8),sk_c11) | equal(inverse(sk_c2),sk_c11).
% 348195 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c4),sk_c10).
% 348196 [] equal(multiply(sk_c4,sk_c10),sk_c9) | equal(inverse(sk_c2),sk_c11).
% 348197 [] equal(inverse(sk_c2),sk_c11) | equal(inverse(sk_c3),sk_c11).
% 348198 [] equal(multiply(sk_c3,sk_c11),sk_c10) | equal(inverse(sk_c2),sk_c11).
% 348199 [?] ?
% 348200 [?] ?
% 348201 [?] ?
% 348202 [?] ?
% 348203 [?] ?
% 348204 [?] ?
% 348205 [?] ?
% 348206 [?] ?
% 348207 [?] ?
% 348208 [?] ?
% 348241 [hyper:348188,348190,binarycut:348200] equal(inverse(sk_c6),sk_c8).
% 348242 [para:348241.1.1,348186.1.1.1] equal(multiply(sk_c8,sk_c6),identity).
% 348246 [hyper:348188,348191,binarycut:348201] equal(inverse(sk_c7),sk_c6).
% 348247 [para:348246.1.1,348186.1.1.1] equal(multiply(sk_c6,sk_c7),identity).
% 348250 [hyper:348188,348193,binarycut:348203] equal(inverse(sk_c5),sk_c8).
% 348253 [hyper:348188,348189,binarycut:348199] equal(multiply(sk_c7,sk_c8),sk_c6).
% 348254 [para:348250.1.1,348186.1.1.1] equal(multiply(sk_c8,sk_c5),identity).
% 348257 [hyper:348188,348195,binarycut:348205] equal(inverse(sk_c4),sk_c10).
% 348258 [para:348257.1.1,348186.1.1.1] equal(multiply(sk_c10,sk_c4),identity).
% 348261 [hyper:348188,348192,binarycut:348202] equal(multiply(sk_c8,sk_c10),sk_c11).
% 348264 [hyper:348188,348197,binarycut:348207] equal(inverse(sk_c3),sk_c11).
% 348268 [para:348264.1.1,348186.1.1.1] equal(multiply(sk_c11,sk_c3),identity).
% 348272 [hyper:348188,348194,binarycut:348204] equal(multiply(sk_c5,sk_c8),sk_c11).
% 348275 [hyper:348188,348196,binarycut:348206] equal(multiply(sk_c4,sk_c10),sk_c9).
% 348278 [hyper:348188,348198,binarycut:348208] equal(multiply(sk_c3,sk_c11),sk_c10).
% 348279 [para:348186.1.1,348187.1.1.1,demod:348185] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 348280 [para:348242.1.1,348187.1.1.1,demod:348185] equal(X,multiply(sk_c8,multiply(sk_c6,X))).
% 348281 [para:348247.1.1,348187.1.1.1,demod:348185] equal(X,multiply(sk_c6,multiply(sk_c7,X))).
% 348282 [para:348253.1.1,348187.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c7,multiply(sk_c8,X))).
% 348285 [para:348261.1.1,348187.1.1.1] equal(multiply(sk_c11,X),multiply(sk_c8,multiply(sk_c10,X))).
% 348287 [para:348272.1.1,348187.1.1.1] equal(multiply(sk_c11,X),multiply(sk_c5,multiply(sk_c8,X))).
% 348290 [para:348247.1.1,348280.1.2.2] equal(sk_c7,multiply(sk_c8,identity)).
% 348292 [para:348242.1.1,348279.1.2.2] equal(sk_c6,multiply(inverse(sk_c8),identity)).
% 348293 [para:348253.1.1,348279.1.2.2,demod:348246] equal(sk_c8,multiply(sk_c6,sk_c6)).
% 348294 [para:348254.1.1,348279.1.2.2,demod:348292] equal(sk_c5,sk_c6).
% 348298 [para:348272.1.1,348279.1.2.2,demod:348250] equal(sk_c8,multiply(sk_c8,sk_c11)).
% 348299 [para:348275.1.1,348279.1.2.2,demod:348257] equal(sk_c10,multiply(sk_c10,sk_c9)).
% 348301 [para:348280.1.2,348279.1.2.2] equal(multiply(sk_c6,X),multiply(inverse(sk_c8),X)).
% 348303 [para:348290.1.2,348187.1.1.1,demod:348185] equal(multiply(sk_c7,X),multiply(sk_c8,X)).
% 348309 [para:348298.1.2,348279.1.2.2,demod:348301] equal(sk_c11,multiply(sk_c6,sk_c8)).
% 348311 [para:348299.1.2,348279.1.2.2,demod:348186] equal(sk_c9,identity).
% 348312 [para:348294.1.2,348281.1.2.1,demod:348287,348303] equal(X,multiply(sk_c11,X)).
% 348313 [para:348311.1.1,348299.1.2.2] equal(sk_c10,multiply(sk_c10,identity)).
% 348314 [para:348242.1.1,348282.1.2.2,demod:348290,348303,348293] equal(sk_c8,sk_c7).
% 348319 [para:348314.1.2,348247.1.1.2,demod:348309] equal(sk_c11,identity).
% 348322 [para:348319.1.1,348268.1.1.1,demod:348185] equal(sk_c3,identity).
% 348324 [para:348322.1.1,348264.1.1.1] equal(inverse(identity),sk_c11).
% 348325 [para:348322.1.1,348278.1.1.1,demod:348185] equal(sk_c11,sk_c10).
% 348330 [para:348325.1.1,348298.1.2.2,demod:348261] equal(sk_c8,sk_c11).
% 348337 [para:348330.1.2,348325.1.1] equal(sk_c8,sk_c10).
% 348359 [para:348337.1.1,348261.1.1.1] equal(multiply(sk_c10,sk_c10),sk_c11).
% 348361 [para:348337.1.1,348290.1.2.1,demod:348313] equal(sk_c7,sk_c10).
% 348364 [para:348258.1.1,348285.1.2.2,demod:348290,348312] equal(sk_c4,sk_c7).
% 348385 [para:348364.1.2,348361.1.1] equal(sk_c4,sk_c10).
% 348405 [para:348385.1.1,348275.1.1.1,demod:348359] equal(sk_c11,sk_c9).
% 348430 [hyper:348188,348324,demod:348185,cut:348405] 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 29
% 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(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c11),sk_c9) | -equal(inverse(Y),sk_c11) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% 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 29
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(55,40,1,119,0,1,72549,4,1327,77661,5,1502,77662,1,1502,77662,50,1502,77662,40,1502,77726,0,1502,85339,3,1803,86438,4,1953,87277,5,2103,87277,1,2103,87277,50,2103,87277,40,2103,87341,0,2103,89137,3,2412,89229,4,2567,89259,5,2704,89259,1,2704,89259,50,2704,89259,40,2704,89323,0,2704,116197,3,4205,117200,4,4955,118165,5,5705,118166,1,5705,118166,50,5706,118166,40,5706,118230,0,5706,136775,3,6457,137498,4,6832,137992,1,7207,137992,50,7207,137992,40,7207,138056,0,7207,153103,3,8006,154309,4,8333,155910,5,8708,155911,1,8708,155911,50,8708,155911,40,8708,155975,0,8708,198802,3,12609,200310,4,14559,201469,5,16509,201470,1,16509,201470,50,16510,201470,40,16510,201534,0,16510,238804,3,19061,240041,4,20336,241033,5,21611,241034,1,21611,241034,50,21612,241034,40,21612,241098,0,21612,275438,3,23113,276576,4,23863,277480,1,24613,277480,50,24614,277480,40,24614,277544,0,24614,292752,3,25372,294559,4,25740,296296,5,26115,296296,1,26115,296296,50,26115,296296,40,26115,296360,0,26115,324728,3,27325,325329,4,27916,325783,5,28516,325784,1,28516,325784,50,28517,325784,40,28517,325848,0,28517,345244,3,29268,345818,4,29643,346351,1,30018,346351,50,30018,346351,40,30018,346351,40,30018,346460,0,30018,347928,50,30024,347928,30,30024,347928,40,30024,347983,0,30024,348059,50,30024,348059,30,30024,348059,40,30024,348114,0,30028,348183,50,30028,348183,30,30028,348183,40,30028,348238,0,30028,348429,50,30029,348429,30,30029,348429,40,30029,348484,0,30033)
%
%
% START OF PROOF
% 348430 [] equal(X,X).
% 348434 [] -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% 348473 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c3),sk_c11).
% 348474 [?] ?
% 348483 [?] ?
% 348484 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c3,sk_c11),sk_c10).
% 348526 [hyper:348434,348473,binarycut:348483] equal(inverse(sk_c3),sk_c11).
% 348528 [hyper:348434,348473,binarycut:348474] equal(inverse(sk_c1),sk_c11).
% 348552 [hyper:348434,348484,demod:348528,cut:348430] equal(multiply(sk_c3,sk_c11),sk_c10).
% 348554 [hyper:348434,348552,demod:348526,cut:348430] 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 29
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 6 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(sk_c11,sk_c9),sk_c10) | -equal(multiply(Y,sk_c11),sk_c9) | -equal(inverse(Y),sk_c11) | -equal(multiply(Z,sk_c11),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(U,sk_c10),sk_c9) | -equal(inverse(U),sk_c10) | -equal(multiply(V,W),sk_c11) | -equal(inverse(V),W) | -equal(multiply(W,sk_c10),sk_c11) | -equal(inverse(X1),X2) | -equal(inverse(X2),W) | -equal(multiply(X1,W),X2).
% Split part used next: -equal(multiply(sk_c11,sk_c9),sk_c10).
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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 29
% 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(55,40,1,119,0,1,72549,4,1327,77661,5,1502,77662,1,1502,77662,50,1502,77662,40,1502,77726,0,1502,85339,3,1803,86438,4,1953,87277,5,2103,87277,1,2103,87277,50,2103,87277,40,2103,87341,0,2103,89137,3,2412,89229,4,2567,89259,5,2704,89259,1,2704,89259,50,2704,89259,40,2704,89323,0,2704,116197,3,4205,117200,4,4955,118165,5,5705,118166,1,5705,118166,50,5706,118166,40,5706,118230,0,5706,136775,3,6457,137498,4,6832,137992,1,7207,137992,50,7207,137992,40,7207,138056,0,7207,153103,3,8006,154309,4,8333,155910,5,8708,155911,1,8708,155911,50,8708,155911,40,8708,155975,0,8708,198802,3,12609,200310,4,14559,201469,5,16509,201470,1,16509,201470,50,16510,201470,40,16510,201534,0,16510,238804,3,19061,240041,4,20336,241033,5,21611,241034,1,21611,241034,50,21612,241034,40,21612,241098,0,21612,275438,3,23113,276576,4,23863,277480,1,24613,277480,50,24614,277480,40,24614,277544,0,24614,292752,3,25372,294559,4,25740,296296,5,26115,296296,1,26115,296296,50,26115,296296,40,26115,296360,0,26115,324728,3,27325,325329,4,27916,325783,5,28516,325784,1,28516,325784,50,28517,325784,40,28517,325848,0,28517,345244,3,29268,345818,4,29643,346351,1,30018,346351,50,30018,346351,40,30018,346351,40,30018,346460,0,30018,347928,50,30024,347928,30,30024,347928,40,30024,347983,0,30024,348059,50,30024,348059,30,30024,348059,40,30024,348114,0,30028,348183,50,30028,348183,30,30028,348183,40,30028,348238,0,30028,348429,50,30029,348429,30,30029,348429,40,30029,348484,0,30033,348553,50,30033,348553,30,30033,348553,40,30033,348608,0,30033,348798,50,30034,348853,0,30039,349118,50,30044,349173,0,30044,349448,50,30052,349503,0,30056,349798,50,30068,349853,0,30068,350154,50,30083,350209,0,30088,350518,50,30113,350573,0,30113,350891,50,30159,350946,0,30159,351274,50,30237,351274,40,30237,351329,0,30237)
%
%
% START OF PROOF
% 351055 [?] ?
% 351276 [] equal(multiply(identity,X),X).
% 351277 [] equal(multiply(inverse(X),X),identity).
% 351278 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 351279 [] -equal(multiply(sk_c11,sk_c9),sk_c10).
% 351301 [?] ?
% 351302 [?] ?
% 351304 [?] ?
% 351305 [?] ?
% 351381 [input:351301,cut:351279] equal(inverse(sk_c6),sk_c8).
% 351382 [para:351381.1.1,351277.1.1.1] equal(multiply(sk_c8,sk_c6),identity).
% 351383 [input:351302,cut:351279] equal(inverse(sk_c7),sk_c6).
% 351384 [para:351383.1.1,351277.1.1.1] equal(multiply(sk_c6,sk_c7),identity).
% 351386 [input:351304,cut:351279] equal(inverse(sk_c5),sk_c8).
% 351387 [para:351386.1.1,351277.1.1.1] equal(multiply(sk_c8,sk_c5),identity).
% 351416 [input:351305,cut:351279] equal(multiply(sk_c5,sk_c8),sk_c11).
% 351443 [para:351382.1.1,351278.1.1.1,demod:351276] equal(X,multiply(sk_c8,multiply(sk_c6,X))).
% 351444 [para:351384.1.1,351278.1.1.1,demod:351276] equal(X,multiply(sk_c6,multiply(sk_c7,X))).
% 351472 [para:351416.1.1,351278.1.1.1] equal(multiply(sk_c11,X),multiply(sk_c5,multiply(sk_c8,X))).
% 351486 [para:351384.1.1,351443.1.2.2] equal(sk_c7,multiply(sk_c8,identity)).
% 351487 [para:351486.1.2,351278.1.1.1,demod:351276] equal(multiply(sk_c7,X),multiply(sk_c8,X)).
% 351515 [para:351487.1.1,351444.1.2.2] equal(X,multiply(sk_c6,multiply(sk_c8,X))).
% 351517 [para:351382.1.1,351515.1.2.2] equal(sk_c6,multiply(sk_c6,identity)).
% 351519 [para:351387.1.1,351515.1.2.2,demod:351517] equal(sk_c5,sk_c6).
% 351527 [para:351519.1.2,351444.1.2.1,demod:351472,351487] equal(X,multiply(sk_c11,X)).
% 351530 [para:351527.1.2,351279.1.1,cut:351055] 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: 35864
% derived clauses: 5433417
% kept clauses: 226621
% kept size sum: 15364
% kept mid-nuclei: 62546
% kept new demods: 2738
% forw unit-subs: 2537243
% forw double-subs: 2349749
% forw overdouble-subs: 200080
% backward subs: 16538
% fast unit cutoff: 30373
% full unit cutoff: 0
% dbl unit cutoff: 22634
% real runtime : 304.60
% process. runtime: 302.37
% specific non-discr-tree subsumption statistics:
% tried: 26661731
% length fails: 4038321
% strength fails: 6818636
% predlist fails: 1603710
% aux str. fails: 2849676
% by-lit fails: 3109086
% full subs tried: 3260594
% full subs fail: 3137401
%
% ; 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/GRP269-1+eq_r.in")
%
%------------------------------------------------------------------------------