TSTP Solution File: GRP364-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP364-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 278.7s
% Output : Assurance 278.7s
% 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/GRP364-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 23)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 23)
% (binary-posweight-lex-big-order 30 #f 3 23)
% (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_c9),sk_c8) | -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c7),sk_c9) | -equal(inverse(Z),sk_c7) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% was split for some strategies as:
% -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9).
% -equal(multiply(Z,sk_c7),sk_c9) | -equal(inverse(Z),sk_c7).
% -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9).
% -equal(multiply(sk_c7,sk_c9),sk_c8).
% -equal(multiply(sk_c9,sk_c8),sk_c7).
%
% 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_c9),sk_c8) | -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c7),sk_c9) | -equal(inverse(Z),sk_c7) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(41,40,0,87,0,0,1293,50,13,1339,0,13,3120,50,41,3166,0,41,5447,50,82,5493,0,82,7920,50,116,7966,0,116,10540,50,159,10586,0,159,13378,50,217,13424,0,217,16434,50,300,16480,0,300,19780,50,430,19826,0,430,23416,50,649,23462,0,649,27414,50,939,27414,40,939,27460,0,939,38805,3,1240,39474,4,1390,40173,5,1540,40174,1,1540,40174,50,1540,40174,40,1540,40220,0,1540,40475,3,1849,40484,4,2002,40491,5,2141,40491,1,2141,40491,50,2141,40491,40,2141,40537,0,2141,53635,3,3642,54624,50,3904,54624,40,3904,54670,0,3904,65173,3,4655,66604,50,4979,66604,40,4979,66650,0,4979,80660,3,5732,81402,4,6105,82398,5,6480,82399,1,6480,82399,50,6480,82399,40,6480,82445,0,6480,147861,3,10382,149081,4,12331,150027,5,14281,150028,1,14281,150028,50,14283,150028,40,14283,150074,0,14284,203647,3,16842,204589,4,18110,205361,1,19385,205361,50,19387,205361,40,19387,205407,0,19387,247243,3,20892,247973,4,21638,248664,5,22388,248665,1,22388,248665,50,22390,248665,40,22390,248711,0,22390,265417,3,23143,265969,4,23516,266692,5,23891,266693,1,23891,266693,50,23891,266693,40,23891,266739,0,23891,297291,3,25093,298058,4,25692,298768,1,26292,298768,50,26293,298768,40,26293,298814,0,26293,318325,3,27044,318990,4,27419,319485,1,27794,319485,50,27794,319485,40,27794,319485,40,27794,319526,0,27794)
%
%
% START OF PROOF
% 319486 [] equal(X,X).
% 319490 [] -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9).
% 319503 [] equal(inverse(sk_c1),sk_c9) | equal(inverse(sk_c5),sk_c9).
% 319504 [] equal(multiply(sk_c5,sk_c9),sk_c6) | equal(inverse(sk_c1),sk_c9).
% 319505 [?] ?
% 319509 [] equal(multiply(sk_c1,sk_c9),sk_c2) | equal(inverse(sk_c5),sk_c9).
% 319510 [] equal(multiply(sk_c1,sk_c9),sk_c2) | equal(multiply(sk_c5,sk_c9),sk_c6).
% 319511 [] equal(multiply(sk_c1,sk_c9),sk_c2) | equal(multiply(sk_c9,sk_c6),sk_c8).
% 319515 [?] ?
% 319516 [?] ?
% 319517 [?] ?
% 319573 [hyper:319490,319504,319503,binarycut:319505] equal(inverse(sk_c1),sk_c9).
% 319588 [hyper:319490,319509,demod:319573,cut:319486,binarycut:319515] equal(inverse(sk_c5),sk_c9).
% 319607 [hyper:319490,319510,demod:319573,cut:319486,binarycut:319516] equal(multiply(sk_c5,sk_c9),sk_c6).
% 319626 [hyper:319490,319511,demod:319573,cut:319486,binarycut:319517] equal(multiply(sk_c9,sk_c6),sk_c8).
% 319630 [hyper:319490,319626,319607,demod:319588,cut:319486] 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 23
% 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_c9),sk_c8) | -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c7),sk_c9) | -equal(inverse(Z),sk_c7) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9).
% 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 23
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(41,40,0,87,0,0,1293,50,13,1339,0,13,3120,50,41,3166,0,41,5447,50,82,5493,0,82,7920,50,116,7966,0,116,10540,50,159,10586,0,159,13378,50,217,13424,0,217,16434,50,300,16480,0,300,19780,50,430,19826,0,430,23416,50,649,23462,0,649,27414,50,939,27414,40,939,27460,0,939,38805,3,1240,39474,4,1390,40173,5,1540,40174,1,1540,40174,50,1540,40174,40,1540,40220,0,1540,40475,3,1849,40484,4,2002,40491,5,2141,40491,1,2141,40491,50,2141,40491,40,2141,40537,0,2141,53635,3,3642,54624,50,3904,54624,40,3904,54670,0,3904,65173,3,4655,66604,50,4979,66604,40,4979,66650,0,4979,80660,3,5732,81402,4,6105,82398,5,6480,82399,1,6480,82399,50,6480,82399,40,6480,82445,0,6480,147861,3,10382,149081,4,12331,150027,5,14281,150028,1,14281,150028,50,14283,150028,40,14283,150074,0,14284,203647,3,16842,204589,4,18110,205361,1,19385,205361,50,19387,205361,40,19387,205407,0,19387,247243,3,20892,247973,4,21638,248664,5,22388,248665,1,22388,248665,50,22390,248665,40,22390,248711,0,22390,265417,3,23143,265969,4,23516,266692,5,23891,266693,1,23891,266693,50,23891,266693,40,23891,266739,0,23891,297291,3,25093,298058,4,25692,298768,1,26292,298768,50,26293,298768,40,26293,298814,0,26293,318325,3,27044,318990,4,27419,319485,1,27794,319485,50,27794,319485,40,27794,319485,40,27794,319526,0,27794,319629,50,27794,319629,30,27794,319629,40,27794,319670,0,27794)
%
%
% START OF PROOF
% 319631 [] equal(multiply(identity,X),X).
% 319632 [] equal(multiply(inverse(X),X),identity).
% 319633 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 319634 [] -equal(multiply(X,sk_c9),sk_c8) | -equal(inverse(X),sk_c9).
% 319638 [] equal(inverse(sk_c3),sk_c7) | equal(inverse(sk_c4),sk_c9).
% 319639 [?] ?
% 319644 [] equal(multiply(sk_c3,sk_c7),sk_c9) | equal(inverse(sk_c4),sk_c9).
% 319645 [] equal(multiply(sk_c3,sk_c7),sk_c9) | equal(multiply(sk_c4,sk_c9),sk_c8).
% 319650 [] equal(inverse(sk_c1),sk_c9) | equal(inverse(sk_c4),sk_c9).
% 319651 [?] ?
% 319656 [] equal(multiply(sk_c1,sk_c9),sk_c2) | equal(inverse(sk_c4),sk_c9).
% 319657 [] equal(multiply(sk_c1,sk_c9),sk_c2) | equal(multiply(sk_c4,sk_c9),sk_c8).
% 319662 [] equal(multiply(sk_c9,sk_c2),sk_c8) | equal(inverse(sk_c4),sk_c9).
% 319663 [] equal(multiply(sk_c9,sk_c2),sk_c8) | equal(multiply(sk_c4,sk_c9),sk_c8).
% 319668 [] equal(multiply(sk_c7,sk_c9),sk_c8) | equal(inverse(sk_c4),sk_c9).
% 319669 [] equal(multiply(sk_c7,sk_c9),sk_c8) | equal(multiply(sk_c4,sk_c9),sk_c8).
% 319675 [hyper:319634,319638,binarycut:319639] equal(inverse(sk_c3),sk_c7).
% 319677 [para:319675.1.1,319632.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 319689 [hyper:319634,319650,binarycut:319651] equal(inverse(sk_c1),sk_c9).
% 319692 [para:319689.1.1,319632.1.1.1] equal(multiply(sk_c9,sk_c1),identity).
% 319723 [hyper:319634,319645,319644] equal(multiply(sk_c3,sk_c7),sk_c9).
% 319728 [hyper:319634,319657,319656] equal(multiply(sk_c1,sk_c9),sk_c2).
% 319733 [hyper:319634,319663,319662] equal(multiply(sk_c9,sk_c2),sk_c8).
% 319743 [hyper:319634,319669,319668] equal(multiply(sk_c7,sk_c9),sk_c8).
% 319745 [para:319632.1.1,319633.1.1.1,demod:319631] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 319746 [para:319677.1.1,319633.1.1.1,demod:319631] equal(X,multiply(sk_c7,multiply(sk_c3,X))).
% 319754 [para:319723.1.1,319746.1.2.2,demod:319743] equal(sk_c7,sk_c8).
% 319757 [para:319754.1.1,319743.1.1.1] equal(multiply(sk_c8,sk_c9),sk_c8).
% 319763 [para:319728.1.1,319745.1.2.2,demod:319733,319689] equal(sk_c9,sk_c8).
% 319771 [para:319757.1.1,319745.1.2.2,demod:319632] equal(sk_c9,identity).
% 319777 [para:319771.1.1,319692.1.1.1,demod:319631] equal(sk_c1,identity).
% 319784 [para:319777.1.1,319689.1.1.1] equal(inverse(identity),sk_c9).
% 319815 [hyper:319634,319784,demod:319631,cut:319763] 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 23
% 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_c9),sk_c8) | -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c7),sk_c9) | -equal(inverse(Z),sk_c7) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(Z,sk_c7),sk_c9) | -equal(inverse(Z),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 23
% 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 23
% clause depth limited to 4
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(41,40,0,87,0,0,1293,50,13,1339,0,13,3120,50,41,3166,0,41,5447,50,82,5493,0,82,7920,50,116,7966,0,116,10540,50,159,10586,0,159,13378,50,217,13424,0,217,16434,50,300,16480,0,300,19780,50,430,19826,0,430,23416,50,649,23462,0,649,27414,50,939,27414,40,939,27460,0,939,38805,3,1240,39474,4,1390,40173,5,1540,40174,1,1540,40174,50,1540,40174,40,1540,40220,0,1540,40475,3,1849,40484,4,2002,40491,5,2141,40491,1,2141,40491,50,2141,40491,40,2141,40537,0,2141,53635,3,3642,54624,50,3904,54624,40,3904,54670,0,3904,65173,3,4655,66604,50,4979,66604,40,4979,66650,0,4979,80660,3,5732,81402,4,6105,82398,5,6480,82399,1,6480,82399,50,6480,82399,40,6480,82445,0,6480,147861,3,10382,149081,4,12331,150027,5,14281,150028,1,14281,150028,50,14283,150028,40,14283,150074,0,14284,203647,3,16842,204589,4,18110,205361,1,19385,205361,50,19387,205361,40,19387,205407,0,19387,247243,3,20892,247973,4,21638,248664,5,22388,248665,1,22388,248665,50,22390,248665,40,22390,248711,0,22390,265417,3,23143,265969,4,23516,266692,5,23891,266693,1,23891,266693,50,23891,266693,40,23891,266739,0,23891,297291,3,25093,298058,4,25692,298768,1,26292,298768,50,26293,298768,40,26293,298814,0,26293,318325,3,27044,318990,4,27419,319485,1,27794,319485,50,27794,319485,40,27794,319485,40,27794,319526,0,27794,319629,50,27794,319629,30,27794,319629,40,27794,319670,0,27794,319814,50,27795,319814,30,27795,319814,40,27795,319855,0,27799,319952,50,27800,319993,0,27800)
%
%
% START OF PROOF
% 319954 [] equal(multiply(identity,X),X).
% 319955 [] equal(multiply(inverse(X),X),identity).
% 319956 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 319957 [] -equal(multiply(X,sk_c7),sk_c9) | -equal(inverse(X),sk_c7).
% 319958 [] equal(inverse(sk_c3),sk_c7) | equal(inverse(sk_c5),sk_c9).
% 319959 [] equal(multiply(sk_c5,sk_c9),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 319960 [] equal(multiply(sk_c9,sk_c6),sk_c8) | equal(inverse(sk_c3),sk_c7).
% 319961 [] equal(inverse(sk_c3),sk_c7) | equal(inverse(sk_c4),sk_c9).
% 319962 [] equal(multiply(sk_c4,sk_c9),sk_c8) | equal(inverse(sk_c3),sk_c7).
% 319963 [] equal(multiply(sk_c9,sk_c8),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 319964 [?] ?
% 319965 [?] ?
% 319966 [?] ?
% 319967 [?] ?
% 319968 [?] ?
% 319969 [?] ?
% 319996 [hyper:319957,319958,binarycut:319964] equal(inverse(sk_c5),sk_c9).
% 319997 [para:319996.1.1,319955.1.1.1] equal(multiply(sk_c9,sk_c5),identity).
% 320001 [hyper:319957,319961,binarycut:319967] equal(inverse(sk_c4),sk_c9).
% 320002 [para:320001.1.1,319955.1.1.1] equal(multiply(sk_c9,sk_c4),identity).
% 320005 [hyper:319957,319959,binarycut:319965] equal(multiply(sk_c5,sk_c9),sk_c6).
% 320008 [hyper:319957,319960,binarycut:319966] equal(multiply(sk_c9,sk_c6),sk_c8).
% 320011 [hyper:319957,319962,binarycut:319968] equal(multiply(sk_c4,sk_c9),sk_c8).
% 320014 [hyper:319957,319963,binarycut:319969] equal(multiply(sk_c9,sk_c8),sk_c7).
% 320015 [para:319955.1.1,319956.1.1.1,demod:319954] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 320016 [para:319997.1.1,319956.1.1.1,demod:319954] equal(X,multiply(sk_c9,multiply(sk_c5,X))).
% 320017 [para:320002.1.1,319956.1.1.1,demod:319954] equal(X,multiply(sk_c9,multiply(sk_c4,X))).
% 320018 [para:320005.1.1,319956.1.1.1] equal(multiply(sk_c6,X),multiply(sk_c5,multiply(sk_c9,X))).
% 320019 [para:320008.1.1,319956.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c9,multiply(sk_c6,X))).
% 320021 [para:320014.1.1,319956.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c9,multiply(sk_c8,X))).
% 320022 [para:320005.1.1,320016.1.2.2,demod:320008] equal(sk_c9,sk_c8).
% 320023 [para:320022.1.1,319997.1.1.1] equal(multiply(sk_c8,sk_c5),identity).
% 320026 [para:320022.1.1,320008.1.1.1] equal(multiply(sk_c8,sk_c6),sk_c8).
% 320032 [para:319955.1.1,320015.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 320033 [para:319997.1.1,320015.1.2.2] equal(sk_c5,multiply(inverse(sk_c9),identity)).
% 320034 [para:320002.1.1,320015.1.2.2,demod:320033] equal(sk_c4,sk_c5).
% 320037 [para:319956.1.1,320015.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 320039 [para:320016.1.2,320015.1.2.2] equal(multiply(sk_c5,X),multiply(inverse(sk_c9),X)).
% 320040 [para:320023.1.1,320015.1.2.2] equal(sk_c5,multiply(inverse(sk_c8),identity)).
% 320041 [para:320015.1.2,320015.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 320042 [para:320034.1.2,320005.1.1.1,demod:320011] equal(sk_c8,sk_c6).
% 320045 [para:320017.1.2,320015.1.2.2,demod:320039] equal(multiply(sk_c4,X),multiply(sk_c5,X)).
% 320047 [para:320026.1.1,320015.1.2.2,demod:319955] equal(sk_c6,identity).
% 320048 [para:320047.1.1,320008.1.1.2] equal(multiply(sk_c9,identity),sk_c8).
% 320049 [para:320047.1.1,320042.1.2] equal(sk_c8,identity).
% 320052 [para:320049.1.1,320023.1.1.1,demod:319954] equal(sk_c5,identity).
% 320059 [para:320052.1.1,320016.1.2.2.1,demod:319954] equal(X,multiply(sk_c9,X)).
% 320065 [para:320018.1.2,320016.1.2.2,demod:320019,320059] equal(X,multiply(sk_c8,X)).
% 320067 [para:320022.1.1,320018.1.2.2.1,demod:320045,320065] equal(multiply(sk_c6,X),multiply(sk_c4,X)).
% 320068 [para:320052.1.1,320018.1.2.1,demod:319954,320059,320067] equal(multiply(sk_c4,X),X).
% 320073 [para:320022.1.1,320021.1.2.1,demod:320065] equal(multiply(sk_c7,X),X).
% 320074 [para:320023.1.1,320021.1.2.2,demod:320048,320073] equal(sk_c5,sk_c8).
% 320077 [para:320074.1.1,319996.1.1.1] equal(inverse(sk_c8),sk_c9).
% 320107 [para:320041.1.2,319955.1.1] equal(multiply(X,inverse(X)),identity).
% 320109 [para:320041.1.2,320032.1.2] equal(X,multiply(X,identity)).
% 320110 [para:320109.1.2,320032.1.2] equal(X,inverse(inverse(X))).
% 320112 [para:320109.1.2,320033.1.2] equal(sk_c5,inverse(sk_c9)).
% 320113 [para:320109.1.2,320040.1.2,demod:320077] equal(sk_c5,sk_c9).
% 320116 [para:320107.1.1,320037.1.2.2.2,demod:320109] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 320118 [para:320016.1.2,320116.1.2.1.1,demod:320068,320045] equal(inverse(X),multiply(inverse(X),sk_c9)).
% 320123 [para:320073.1.1,320116.1.2.1.1] equal(inverse(X),multiply(inverse(X),sk_c7)).
% 320127 [para:320118.1.2,320041.1.2,demod:320110] equal(multiply(X,sk_c9),X).
% 320132 [para:320113.1.2,320127.1.1.2] equal(multiply(X,sk_c5),X).
% 320135 [para:320132.1.1,320021.1.2.2,demod:320014,320073] equal(sk_c5,sk_c7).
% 320139 [para:320123.1.2,320041.1.2,demod:320110] equal(multiply(X,sk_c7),X).
% 320140 [hyper:319957,320139,demod:320112,cut:320135] 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 23
% clause depth limited to 4
% seconds given: 4
%
%
% Split component 4 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c9),sk_c8) | -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c7),sk_c9) | -equal(inverse(Z),sk_c7) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9).
% 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 23
% clause depth limited to 3
% seconds given: 4
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(41,40,0,87,0,0,1293,50,13,1339,0,13,3120,50,41,3166,0,41,5447,50,82,5493,0,82,7920,50,116,7966,0,116,10540,50,159,10586,0,159,13378,50,217,13424,0,217,16434,50,300,16480,0,300,19780,50,430,19826,0,430,23416,50,649,23462,0,649,27414,50,939,27414,40,939,27460,0,939,38805,3,1240,39474,4,1390,40173,5,1540,40174,1,1540,40174,50,1540,40174,40,1540,40220,0,1540,40475,3,1849,40484,4,2002,40491,5,2141,40491,1,2141,40491,50,2141,40491,40,2141,40537,0,2141,53635,3,3642,54624,50,3904,54624,40,3904,54670,0,3904,65173,3,4655,66604,50,4979,66604,40,4979,66650,0,4979,80660,3,5732,81402,4,6105,82398,5,6480,82399,1,6480,82399,50,6480,82399,40,6480,82445,0,6480,147861,3,10382,149081,4,12331,150027,5,14281,150028,1,14281,150028,50,14283,150028,40,14283,150074,0,14284,203647,3,16842,204589,4,18110,205361,1,19385,205361,50,19387,205361,40,19387,205407,0,19387,247243,3,20892,247973,4,21638,248664,5,22388,248665,1,22388,248665,50,22390,248665,40,22390,248711,0,22390,265417,3,23143,265969,4,23516,266692,5,23891,266693,1,23891,266693,50,23891,266693,40,23891,266739,0,23891,297291,3,25093,298058,4,25692,298768,1,26292,298768,50,26293,298768,40,26293,298814,0,26293,318325,3,27044,318990,4,27419,319485,1,27794,319485,50,27794,319485,40,27794,319485,40,27794,319526,0,27794,319629,50,27794,319629,30,27794,319629,40,27794,319670,0,27794,319814,50,27795,319814,30,27795,319814,40,27795,319855,0,27799,319952,50,27800,319993,0,27800,320139,50,27801,320139,30,27801,320139,40,27801,320180,0,27801)
%
%
% START OF PROOF
% 320140 [] equal(X,X).
% 320144 [] -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9).
% 320157 [] equal(inverse(sk_c1),sk_c9) | equal(inverse(sk_c5),sk_c9).
% 320158 [] equal(multiply(sk_c5,sk_c9),sk_c6) | equal(inverse(sk_c1),sk_c9).
% 320159 [?] ?
% 320163 [] equal(multiply(sk_c1,sk_c9),sk_c2) | equal(inverse(sk_c5),sk_c9).
% 320164 [] equal(multiply(sk_c1,sk_c9),sk_c2) | equal(multiply(sk_c5,sk_c9),sk_c6).
% 320165 [] equal(multiply(sk_c1,sk_c9),sk_c2) | equal(multiply(sk_c9,sk_c6),sk_c8).
% 320169 [?] ?
% 320170 [?] ?
% 320171 [?] ?
% 320227 [hyper:320144,320158,320157,binarycut:320159] equal(inverse(sk_c1),sk_c9).
% 320242 [hyper:320144,320163,demod:320227,cut:320140,binarycut:320169] equal(inverse(sk_c5),sk_c9).
% 320261 [hyper:320144,320164,demod:320227,cut:320140,binarycut:320170] equal(multiply(sk_c5,sk_c9),sk_c6).
% 320280 [hyper:320144,320165,demod:320227,cut:320140,binarycut:320171] equal(multiply(sk_c9,sk_c6),sk_c8).
% 320284 [hyper:320144,320280,320261,demod:320242,cut:320140] 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 23
% clause depth limited to 3
% seconds given: 4
%
%
% Split component 5 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -equal(multiply(sk_c7,sk_c9),sk_c8) | -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c7),sk_c9) | -equal(inverse(Z),sk_c7) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(sk_c7,sk_c9),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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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(41,40,0,87,0,0,1293,50,13,1339,0,13,3120,50,41,3166,0,41,5447,50,82,5493,0,82,7920,50,116,7966,0,116,10540,50,159,10586,0,159,13378,50,217,13424,0,217,16434,50,300,16480,0,300,19780,50,430,19826,0,430,23416,50,649,23462,0,649,27414,50,939,27414,40,939,27460,0,939,38805,3,1240,39474,4,1390,40173,5,1540,40174,1,1540,40174,50,1540,40174,40,1540,40220,0,1540,40475,3,1849,40484,4,2002,40491,5,2141,40491,1,2141,40491,50,2141,40491,40,2141,40537,0,2141,53635,3,3642,54624,50,3904,54624,40,3904,54670,0,3904,65173,3,4655,66604,50,4979,66604,40,4979,66650,0,4979,80660,3,5732,81402,4,6105,82398,5,6480,82399,1,6480,82399,50,6480,82399,40,6480,82445,0,6480,147861,3,10382,149081,4,12331,150027,5,14281,150028,1,14281,150028,50,14283,150028,40,14283,150074,0,14284,203647,3,16842,204589,4,18110,205361,1,19385,205361,50,19387,205361,40,19387,205407,0,19387,247243,3,20892,247973,4,21638,248664,5,22388,248665,1,22388,248665,50,22390,248665,40,22390,248711,0,22390,265417,3,23143,265969,4,23516,266692,5,23891,266693,1,23891,266693,50,23891,266693,40,23891,266739,0,23891,297291,3,25093,298058,4,25692,298768,1,26292,298768,50,26293,298768,40,26293,298814,0,26293,318325,3,27044,318990,4,27419,319485,1,27794,319485,50,27794,319485,40,27794,319485,40,27794,319526,0,27794,319629,50,27794,319629,30,27794,319629,40,27794,319670,0,27794,319814,50,27795,319814,30,27795,319814,40,27795,319855,0,27799,319952,50,27800,319993,0,27800,320139,50,27801,320139,30,27801,320139,40,27801,320180,0,27801,320283,50,27802,320283,30,27802,320283,40,27802,320324,0,27807,320449,50,27808,320490,0,27808,320663,50,27811,320704,0,27815,320885,50,27819,320926,0,27819,321115,50,27825,321156,0,27825,321351,50,27834,321392,0,27838,321595,50,27855,321636,0,27855,321847,50,27885,321888,0,27890,322109,50,27950,322150,0,27950,322381,50,28074,322381,40,28074,322422,0,28074)
%
%
% START OF PROOF
% 322253 [?] ?
% 322383 [] equal(multiply(identity,X),X).
% 322384 [] equal(multiply(inverse(X),X),identity).
% 322385 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 322386 [] -equal(multiply(sk_c7,sk_c9),sk_c8).
% 322417 [?] ?
% 322418 [?] ?
% 322419 [?] ?
% 322465 [input:322417,cut:322386] equal(inverse(sk_c5),sk_c9).
% 322466 [para:322465.1.1,322384.1.1.1] equal(multiply(sk_c9,sk_c5),identity).
% 322483 [input:322418,cut:322386] equal(multiply(sk_c5,sk_c9),sk_c6).
% 322484 [input:322419,cut:322386] equal(multiply(sk_c9,sk_c6),sk_c8).
% 322509 [para:322466.1.1,322385.1.1.1,demod:322383] equal(X,multiply(sk_c9,multiply(sk_c5,X))).
% 322547 [para:322483.1.1,322509.1.2.2] equal(sk_c9,multiply(sk_c9,sk_c6)).
% 322553 [para:322547.1.2,322484.1.1] equal(sk_c9,sk_c8).
% 322555 [para:322553.1.1,322386.1.1.2,cut:322253] 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_c9),sk_c8) | -equal(multiply(sk_c9,X),sk_c8) | -equal(multiply(Y,sk_c9),X) | -equal(inverse(Y),sk_c9) | -equal(multiply(Z,sk_c7),sk_c9) | -equal(inverse(Z),sk_c7) | -equal(multiply(sk_c9,sk_c8),sk_c7) | -equal(multiply(U,sk_c9),sk_c8) | -equal(inverse(U),sk_c9) | -equal(multiply(sk_c9,V),sk_c8) | -equal(multiply(W,sk_c9),V) | -equal(inverse(W),sk_c9).
% Split part used next: -equal(multiply(sk_c9,sk_c8),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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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 23
% 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(41,40,0,87,0,0,1293,50,13,1339,0,13,3120,50,41,3166,0,41,5447,50,82,5493,0,82,7920,50,116,7966,0,116,10540,50,159,10586,0,159,13378,50,217,13424,0,217,16434,50,300,16480,0,300,19780,50,430,19826,0,430,23416,50,649,23462,0,649,27414,50,939,27414,40,939,27460,0,939,38805,3,1240,39474,4,1390,40173,5,1540,40174,1,1540,40174,50,1540,40174,40,1540,40220,0,1540,40475,3,1849,40484,4,2002,40491,5,2141,40491,1,2141,40491,50,2141,40491,40,2141,40537,0,2141,53635,3,3642,54624,50,3904,54624,40,3904,54670,0,3904,65173,3,4655,66604,50,4979,66604,40,4979,66650,0,4979,80660,3,5732,81402,4,6105,82398,5,6480,82399,1,6480,82399,50,6480,82399,40,6480,82445,0,6480,147861,3,10382,149081,4,12331,150027,5,14281,150028,1,14281,150028,50,14283,150028,40,14283,150074,0,14284,203647,3,16842,204589,4,18110,205361,1,19385,205361,50,19387,205361,40,19387,205407,0,19387,247243,3,20892,247973,4,21638,248664,5,22388,248665,1,22388,248665,50,22390,248665,40,22390,248711,0,22390,265417,3,23143,265969,4,23516,266692,5,23891,266693,1,23891,266693,50,23891,266693,40,23891,266739,0,23891,297291,3,25093,298058,4,25692,298768,1,26292,298768,50,26293,298768,40,26293,298814,0,26293,318325,3,27044,318990,4,27419,319485,1,27794,319485,50,27794,319485,40,27794,319485,40,27794,319526,0,27794,319629,50,27794,319629,30,27794,319629,40,27794,319670,0,27794,319814,50,27795,319814,30,27795,319814,40,27795,319855,0,27799,319952,50,27800,319993,0,27800,320139,50,27801,320139,30,27801,320139,40,27801,320180,0,27801,320283,50,27802,320283,30,27802,320283,40,27802,320324,0,27807,320449,50,27808,320490,0,27808,320663,50,27811,320704,0,27815,320885,50,27819,320926,0,27819,321115,50,27825,321156,0,27825,321351,50,27834,321392,0,27838,321595,50,27855,321636,0,27855,321847,50,27885,321888,0,27890,322109,50,27950,322150,0,27950,322381,50,28074,322381,40,28074,322422,0,28074,322554,50,28074,322554,30,28074,322554,40,28074,322595,0,28074,322713,50,28075,322754,0,28080,322944,50,28082,322985,0,28082,323197,50,28085,323238,0,28086,323464,50,28090,323505,0,28095,323737,50,28103,323778,0,28103,324018,50,28117,324059,0,28122,324307,50,28149,324348,0,28149,324606,50,28208,324647,0,28208,324915,50,28320,324915,40,28320,324956,0,28320)
%
%
% START OF PROOF
% 324916 [] equal(X,X).
% 324917 [] equal(multiply(identity,X),X).
% 324918 [] equal(multiply(inverse(X),X),identity).
% 324919 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 324920 [] -equal(multiply(sk_c9,sk_c8),sk_c7).
% 324926 [?] ?
% 324932 [?] ?
% 324938 [?] ?
% 324944 [?] ?
% 324950 [?] ?
% 324956 [?] ?
% 324975 [input:324926,cut:324920] equal(inverse(sk_c3),sk_c7).
% 324976 [para:324975.1.1,324918.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 324988 [input:324938,cut:324920] equal(inverse(sk_c1),sk_c9).
% 324989 [para:324988.1.1,324918.1.1.1] equal(multiply(sk_c9,sk_c1),identity).
% 325007 [input:324932,cut:324920] equal(multiply(sk_c3,sk_c7),sk_c9).
% 325012 [input:324944,cut:324920] equal(multiply(sk_c1,sk_c9),sk_c2).
% 325016 [input:324950,cut:324920] equal(multiply(sk_c9,sk_c2),sk_c8).
% 325020 [input:324956,cut:324920] equal(multiply(sk_c7,sk_c9),sk_c8).
% 325025 [para:324976.1.1,324919.1.1.1,demod:324917] equal(X,multiply(sk_c7,multiply(sk_c3,X))).
% 325033 [para:324989.1.1,324919.1.1.1,demod:324917] equal(X,multiply(sk_c9,multiply(sk_c1,X))).
% 325069 [para:325020.1.1,324919.1.1.1] equal(multiply(sk_c8,X),multiply(sk_c7,multiply(sk_c9,X))).
% 325075 [para:325007.1.1,325025.1.2.2] equal(sk_c7,multiply(sk_c7,sk_c9)).
% 325081 [para:325075.1.2,325020.1.1] equal(sk_c7,sk_c8).
% 325082 [para:325075.1.2,324919.1.1.1,demod:325069] equal(multiply(sk_c7,X),multiply(sk_c8,X)).
% 325083 [para:325081.1.1,324920.1.2] -equal(multiply(sk_c9,sk_c8),sk_c8).
% 325109 [para:325012.1.1,325033.1.2.2] equal(sk_c9,multiply(sk_c9,sk_c2)).
% 325115 [para:325109.1.2,325016.1.1] equal(sk_c9,sk_c8).
% 325154 [para:325115.1.1,325020.1.1.2,demod:325082] equal(multiply(sk_c8,sk_c8),sk_c8).
% 325155 [para:325115.1.1,325083.1.1.1,demod:325154,cut:324916] 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: 41821
% derived clauses: 4452380
% kept clauses: 253560
% kept size sum: 916296
% kept mid-nuclei: 22993
% kept new demods: 3996
% forw unit-subs: 1458354
% forw double-subs: 2509476
% forw overdouble-subs: 160340
% backward subs: 30880
% fast unit cutoff: 30277
% full unit cutoff: 0
% dbl unit cutoff: 7674
% real runtime : 284.79
% process. runtime: 283.20
% specific non-discr-tree subsumption statistics:
% tried: 29705319
% length fails: 2513988
% strength fails: 8684530
% predlist fails: 1600062
% aux str. fails: 7531055
% by-lit fails: 5248013
% full subs tried: 1153576
% full subs fail: 1076706
%
% ; 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/GRP364-1+eq_r.in")
%
%------------------------------------------------------------------------------