TSTP Solution File: GRP353-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP353-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art04.cs.miami.edu
% Model    : i686 unknown
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1000MB
% OS       : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s

% Result   : Unsatisfiable 179.2s
% Output   : Assurance 179.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/GRP353-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: peq
% 
% strategies selected: 
% (hyper 30 #f 3 19)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 19)
% (binary-posweight-lex-big-order 30 #f 3 19)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
% 
% 
% SOS clause 
% -equal(multiply(sk_c6,sk_c5),sk_c7) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(sk_c7,sk_c5),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(Y),sk_c7) | -equal(multiply(Y,sk_c6),sk_c7) | -equal(multiply(Z,U),sk_c6) | -equal(inverse(Z),U) | -equal(multiply(U,sk_c7),sk_c6).
% was split for some strategies as: 
% -equal(multiply(Z,U),sk_c6) | -equal(inverse(Z),U) | -equal(multiply(U,sk_c7),sk_c6).
% -equal(inverse(Y),sk_c7) | -equal(multiply(Y,sk_c6),sk_c7).
% -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% -equal(multiply(sk_c6,sk_c5),sk_c7).
% -equal(multiply(sk_c7,sk_c5),sk_c6).
% -equal(multiply(sk_c6,sk_c7),sk_c5).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(29,40,0,62,0,0,689,50,5,722,0,5,1958,50,16,1991,0,16,3508,50,35,3541,0,35,5227,50,54,5260,0,54,7115,50,74,7148,0,74,9227,50,104,9260,0,104,11564,50,153,11597,0,153,14181,50,241,14214,0,241,17079,50,412,17112,0,412,20313,50,668,20346,0,668,23884,50,1139,23884,40,1139,23917,0,1139,33408,3,1442,34250,4,1590,35043,5,1740,35044,1,1740,35044,50,1740,35044,40,1740,35077,0,1740,35329,3,2051,35338,4,2193,35348,5,2341,35348,1,2341,35348,50,2341,35348,40,2341,35381,0,2341,55806,3,3847,56569,4,4592,57185,1,5342,57185,50,5342,57185,40,5342,57218,0,5342,71575,3,6093,72483,4,6468,73222,1,6843,73222,50,6843,73222,40,6843,73255,0,6843,84342,3,7595,84937,4,7969,86564,1,8344,86564,50,8344,86564,40,8344,86597,0,8344,114317,3,12245,116235,4,14195,118224,1,16145,118224,50,16145,118224,40,16145,118257,0,16145)
% 
% 
% START OF PROOF
% 118225 [] equal(X,X).
% 118226 [] equal(multiply(identity,X),X).
% 118227 [] equal(multiply(inverse(X),X),identity).
% 118228 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 118232 [] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(multiply(sk_c3,sk_c4),sk_c6).
% 118233 [] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 118234 [] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(inverse(sk_c2),sk_c7).
% 118235 [] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(multiply(sk_c6,sk_c7),sk_c5).
% 118237 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c4).
% 118238 [] equal(multiply(sk_c3,sk_c4),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 118239 [] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 118240 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c2),sk_c7).
% 118241 [] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(inverse(sk_c1),sk_c7).
% 118243 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c4).
% 118244 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c4),sk_c6).
% 118245 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 118246 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c2),sk_c7).
% 118250 [] equal(multiply(sk_c6,sk_c5),sk_c7) | equal(multiply(sk_c3,sk_c4),sk_c6).
% 118251 [] equal(multiply(sk_c6,sk_c5),sk_c7) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 118252 [] equal(multiply(sk_c6,sk_c5),sk_c7) | equal(inverse(sk_c2),sk_c7).
% 118253 [] equal(multiply(sk_c6,sk_c5),sk_c7) | equal(multiply(sk_c6,sk_c7),sk_c5).
% 118254 [] -equal(multiply(sk_c7,sk_c5),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(multiply(sk_c6,sk_c5),sk_c7) | $spltprd0($spltcnst22) | -equal(multiply(X,sk_c7),sk_c6) | -equal(multiply(Y,X),sk_c6) | -equal(inverse(Y),X).
% 118255 [] $spltprd0($spltcnst23) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 118256 [] $spltprd0($spltcnst24) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 118257 [] -$spltprd0($spltcnst23) | -$spltprd0($spltcnst22) | -$spltprd0($spltcnst24).
% 118259 [input:118254,factor] -equal(multiply(sk_c5,sk_c7),sk_c6) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(multiply(sk_c6,sk_c5),sk_c7) | -equal(multiply(sk_c7,sk_c5),sk_c6) | -equal(inverse(sk_c7),sk_c5) | $spltprd0($spltcnst22).
% 118339 [para:118239.1.1,118255.2.1,cut:118225] -equal(inverse(sk_c2),sk_c7) | equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst23).
% 118340 [para:118233.2.1,118255.2.1,cut:118225] equal(multiply(sk_c7,sk_c5),sk_c6) | -equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst23).
% 118341 [para:118245.2.1,118255.2.1,cut:118225] equal(multiply(sk_c1,sk_c7),sk_c6) | -equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst23).
% 118342 [para:118251.2.1,118255.2.1,cut:118225] equal(multiply(sk_c6,sk_c5),sk_c7) | -equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst23).
% 118352 [para:118243.1.1,118256.2.1,cut:118225,binarycut:118237] equal(inverse(sk_c3),sk_c4) | $spltprd0($spltcnst24).
% 118354 [para:118246.1.1,118256.2.1,cut:118225,binarycut:118240] equal(inverse(sk_c2),sk_c7) | $spltprd0($spltcnst24).
% 118372 [para:118227.1.1,118228.1.1.1,demod:118226] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 118426 [para:118227.1.1,118372.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 118428 [para:118234.1.1,118372.1.2.2] equal(sk_c5,multiply(inverse(sk_c7),sk_c6)) | equal(inverse(sk_c2),sk_c7).
% 118457 [para:118235.2.1,118372.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)) | equal(multiply(sk_c7,sk_c5),sk_c6).
% 118462 [para:118245.1.1,118372.1.2.2] equal(sk_c7,multiply(inverse(sk_c1),sk_c6)) | equal(multiply(sk_c2,sk_c6),sk_c7).
% 118486 [para:118228.1.1,118372.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 118487 [para:118372.1.2,118372.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 118508 [para:118487.1.2,118227.1.1] equal(multiply(X,inverse(X)),identity).
% 118529 [para:118487.1.2,118372.1.2] equal(X,multiply(Y,multiply(inverse(Y),X))).
% 118530 [para:118487.1.2,118426.1.2] equal(X,multiply(X,identity)).
% 118532 [para:118530.1.2,118426.1.2] equal(X,inverse(inverse(X))).
% 118542 [para:118240.1.1,118532.1.2.1] equal(sk_c1,inverse(sk_c7)) | equal(inverse(sk_c2),sk_c7).
% 118545 [para:118234.2.1,118532.1.2.1] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(sk_c2,inverse(sk_c7)).
% 118547 [para:118238.2.1,118532.1.2.1] equal(multiply(sk_c3,sk_c4),sk_c6) | equal(sk_c1,inverse(sk_c7)).
% 118548 [para:118239.2.1,118532.1.2.1] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(sk_c1,inverse(sk_c7)).
% 118549 [para:118241.2.1,118532.1.2.1] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(sk_c1,inverse(sk_c7)).
% 118551 [para:118246.2.1,118532.1.2.1] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(sk_c2,inverse(sk_c7)).
% 118553 [para:118252.2.1,118532.1.2.1] equal(multiply(sk_c6,sk_c5),sk_c7) | equal(sk_c2,inverse(sk_c7)).
% 118558 [para:118237.1.1,118508.1.1.2] equal(multiply(sk_c1,sk_c7),identity) | equal(inverse(sk_c3),sk_c4).
% 118576 [para:118352.1.1,118508.1.1.2] equal(multiply(sk_c3,sk_c4),identity) | $spltprd0($spltcnst24).
% 118577 [para:118354.1.1,118508.1.1.2] equal(multiply(sk_c2,sk_c7),identity) | $spltprd0($spltcnst24).
% 118605 [para:118577.1.1,118256.2.1,binarycut:118354] -equal(identity,sk_c6) | $spltprd0($spltcnst24).
% 118772 [para:118545.2.2,118426.1.2.1.1,demod:118530] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(sk_c7,inverse(sk_c2)).
% 118794 [para:118576.1.1,118547.1.1,binarycut:118605] equal(sk_c1,inverse(sk_c7)) | $spltprd0($spltcnst24).
% 118796 [para:118794.1.2,118227.1.1.1] equal(multiply(sk_c1,sk_c7),identity) | $spltprd0($spltcnst24).
% 118817 [para:118796.1.1,118244.1.1,binarycut:118605] equal(multiply(sk_c3,sk_c4),sk_c6) | $spltprd0($spltcnst24).
% 118837 [para:118576.1.1,118817.1.1,binarycut:118605] $spltprd0($spltcnst24).
% 118846 [para:118548.2.2,118487.1.2.1.1] equal(multiply(sk_c2,sk_c6),sk_c7) | equal(multiply(sk_c7,X),multiply(inverse(sk_c1),X)).
% 118860 [para:118551.2.2,118426.1.2.1.1,demod:118530] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(sk_c7,inverse(sk_c2)).
% 118872 [para:118553.2.2,118426.1.2.1.1,demod:118530] equal(multiply(sk_c6,sk_c5),sk_c7) | equal(sk_c7,inverse(sk_c2)).
% 118884 [para:118558.1.1,118243.1.1] equal(inverse(sk_c3),sk_c4) | equal(identity,sk_c6).
% 118899 [para:118884.1.1,118508.1.1.2] equal(multiply(sk_c3,sk_c4),identity) | equal(identity,sk_c6).
% 119042 [para:118899.1.1,118238.1.1] equal(inverse(sk_c1),sk_c7) | equal(identity,sk_c6).
% 119043 [para:118232.1.1,118899.2.1] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(identity,sk_c6).
% 119044 [para:118244.1.1,118899.2.1] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(identity,sk_c6).
% 119045 [para:118250.1.1,118899.2.1] equal(multiply(sk_c6,sk_c5),sk_c7) | equal(identity,sk_c6).
% 119055 [para:118899.1.1,118547.1.1] equal(sk_c1,inverse(sk_c7)) | equal(identity,sk_c6).
% 119070 [para:119042.2.2,118239.1.1.2,demod:118530] equal(inverse(sk_c1),sk_c7) | equal(sk_c2,sk_c7).
% 119081 [para:119042.1.1,118508.1.1.2] equal(multiply(sk_c1,sk_c7),identity) | equal(identity,sk_c6).
% 119105 [para:119055.2.2,118548.1.1.2,demod:118530] equal(sk_c1,inverse(sk_c7)) | equal(sk_c2,sk_c7).
% 119106 [para:119055.2.2,118549.1.1.1,demod:118226] equal(sk_c1,inverse(sk_c7)) | equal(sk_c7,sk_c5).
% 119117 [para:118240.2.1,119070.2.1.1] equal(inverse(sk_c7),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 119200 [para:119106.1.2,118426.1.2.1.1,demod:118530] equal(sk_c7,inverse(sk_c1)) | equal(sk_c7,sk_c5).
% 119317 [para:118240.2.1,118339.1.1,cut:118225] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst23).
% 119324 [para:119317.1.1,118508.1.1.2] equal(multiply(sk_c1,sk_c7),identity) | $spltprd0($spltcnst23).
% 119341 [para:118234.2.1,118340.2.1,cut:118225] equal(multiply(sk_c7,sk_c5),sk_c6) | $spltprd0($spltcnst23).
% 119366 [para:119341.1.1,118372.1.2.2] equal(sk_c5,multiply(inverse(sk_c7),sk_c6)) | $spltprd0($spltcnst23).
% 119369 [para:118246.2.1,118341.2.1,cut:118225] equal(multiply(sk_c1,sk_c7),sk_c6) | $spltprd0($spltcnst23).
% 119371 [para:118252.2.1,118342.2.1,cut:118225] equal(multiply(sk_c6,sk_c5),sk_c7) | $spltprd0($spltcnst23).
% 119379 [para:119369.1.1,119324.1.1] equal(sk_c6,identity) | $spltprd0($spltcnst23).
% 119408 [para:119379.1.1,119371.1.1.1,demod:118226] equal(sk_c5,sk_c7) | $spltprd0($spltcnst23).
% 119451 [para:119366.1.2,118255.2.1,demod:118532,cut:118225,binarycut:119408] $spltprd0($spltcnst23).
% 119452 [binary:118257,119451,cut:118837] -$spltprd0($spltcnst22).
% 119523 [para:118233.2.2,119043.2.1.2,demod:118530] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(sk_c2,sk_c7).
% 119524 [para:118235.2.2,119043.2.1.1,demod:118226] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(sk_c7,sk_c5).
% 119541 [para:118253.2.2,119045.2.1.1,demod:118226] equal(multiply(sk_c6,sk_c5),sk_c7) | equal(sk_c7,sk_c5).
% 119562 [para:119081.1.1,119044.1.1] equal(identity,sk_c6).
% 119568 [para:119562.1.2,118253.1.1.1,demod:118226] equal(multiply(sk_c6,sk_c7),sk_c5) | equal(sk_c5,sk_c7).
% 119571 [para:119562.1.2,118259.1.2,cut:119452] -equal(multiply(sk_c7,sk_c5),sk_c6) | -equal(multiply(sk_c6,sk_c5),sk_c7) | -equal(multiply(sk_c5,sk_c7),identity) | -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(sk_c7),sk_c5).
% 119810 [para:119523.1.1,118372.1.2.2] equal(sk_c5,multiply(inverse(sk_c7),sk_c6)) | equal(sk_c2,sk_c7).
% 119831 [para:119524.1.1,118372.1.2.2] equal(sk_c5,multiply(inverse(sk_c7),sk_c6)) | equal(sk_c7,sk_c5).
% 119996 [para:119562.1.2,119541.1.1.1,demod:118226] equal(sk_c5,sk_c7) | equal(sk_c7,sk_c5).
% 120099 [para:119568.1.1,118372.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)) | equal(sk_c5,sk_c7).
% 120641 [para:119562.1.2,119810.1.2.2,demod:118530] equal(sk_c5,inverse(sk_c7)) | equal(sk_c2,sk_c7).
% 120674 [para:120641.1.2,119105.1.2] equal(sk_c1,sk_c5) | equal(sk_c2,sk_c7).
% 120988 [para:119562.1.2,119831.1.2.2,demod:118530] equal(sk_c5,inverse(sk_c7)) | equal(sk_c7,sk_c5).
% 121032 [para:120988.1.2,119106.1.2] equal(sk_c1,sk_c5) | equal(sk_c7,sk_c5).
% 121083 [para:121032.1.2,119996.1.1] equal(sk_c1,sk_c7) | equal(sk_c7,sk_c5).
% 121153 [para:121083.1.1,119200.1.2.1] equal(sk_c7,inverse(sk_c7)) | equal(sk_c7,sk_c5).
% 121202 [para:120988.1.2,121153.1.2] equal(sk_c7,sk_c5).
% 122048 [para:120099.1.2,118372.1.2.2,demod:118532] equal(sk_c5,multiply(sk_c6,sk_c7)) | equal(sk_c5,sk_c7).
% 122056 [para:119562.1.2,122048.1.2.1,demod:118226] equal(sk_c5,sk_c7).
% 122253 [para:119562.1.2,118428.1.2.2,demod:118530] equal(sk_c5,inverse(sk_c7)) | equal(inverse(sk_c2),sk_c7).
% 122403 [para:122253.1.2,118542.1.2] equal(inverse(sk_c2),sk_c7) | equal(sk_c1,sk_c5).
% 122404 [para:118542.1.2,122253.1.2] equal(inverse(sk_c2),sk_c7) | equal(sk_c5,sk_c1).
% 122417 [para:120674.2.1,122403.1.1.1] equal(inverse(sk_c7),sk_c7) | equal(sk_c1,sk_c5).
% 122424 [para:122404.1.1,118426.1.2.1.1,demod:118530] equal(sk_c2,inverse(sk_c7)) | equal(sk_c5,sk_c1).
% 122513 [para:122417.2.2,121202.1.2] equal(inverse(sk_c7),sk_c7) | equal(sk_c7,sk_c1).
% 122538 [para:122424.1.2,118426.1.2.1.1,demod:118530] equal(sk_c7,inverse(sk_c2)) | equal(sk_c5,sk_c1).
% 122783 [para:119117.2.2,122513.2.1.1] equal(inverse(sk_c7),sk_c7).
% 122786 [para:122783.1.1,118227.1.1.1] equal(multiply(sk_c7,sk_c7),identity).
% 122841 [para:122538.2.1,118259.1.1.1,demod:122783,cut:121202,cut:119452,binarycut:118872,binarycut:118772,binarycut:118860] -equal(multiply(sk_c6,sk_c7),sk_c5) | equal(sk_c7,inverse(sk_c2)).
% 124394 [para:118227.1.1,118486.1.2.2,demod:118530] equal(X,inverse(multiply(inverse(multiply(Y,X)),Y))).
% 124395 [para:118227.1.1,118486.1.2.2.2,demod:118530] equal(X,multiply(inverse(multiply(Y,inverse(X))),Y)).
% 124461 [para:118508.1.1,118486.1.2.2.2,demod:118530] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 124935 [para:118529.1.2,124394.1.2.1.1.1] equal(multiply(inverse(X),Y),inverse(multiply(inverse(Y),X))).
% 131276 [para:119562.1.2,122841.1.1.1,demod:118226,cut:121202] equal(sk_c7,inverse(sk_c2)).
% 131291 [para:131276.1.2,118487.1.2.1.1,demod:122783] equal(multiply(sk_c2,X),multiply(sk_c7,X)).
% 135416 [para:118462.1.2,118846.2.2,demod:131291] equal(multiply(sk_c7,sk_c6),sk_c7).
% 135426 [para:135416.1.1,124461.1.2.1.1,demod:122786,122783] equal(inverse(sk_c6),identity).
% 135428 [para:135426.1.1,118372.1.2.1,demod:118226] equal(X,multiply(sk_c6,X)).
% 135432 [para:135428.1.2,124395.1.2.1.1,demod:118532] equal(X,multiply(X,sk_c6)).
% 136199 [para:118457.1.2,124935.1.2.1,demod:122783,135432] equal(multiply(sk_c7,sk_c5),sk_c6) | equal(inverse(sk_c5),sk_c7).
% 136206 [para:136199.1.1,124461.1.2.1.1,demod:118226,135426] equal(inverse(sk_c5),sk_c7).
% 136208 [para:136206.1.1,118227.1.1.1] equal(multiply(sk_c7,sk_c5),identity).
% 136210 [para:136206.1.1,118487.1.2.1.1,demod:122783] equal(multiply(sk_c5,X),multiply(sk_c7,X)).
% 136503 [para:119562.1.2,119571.1.2,demod:122783,122786,136210,135428,136208,cut:122056,cut:118225,cut:121202] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 51
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    20973
%  derived clauses:   4158282
%  kept clauses:      89057
%  kept size sum:     222254
%  kept mid-nuclei:   14058
%  kept new demods:   982
%  forw unit-subs:    2757029
%  forw double-subs: 1083205
%  forw overdouble-subs: 184043
%  backward subs:     17557
%  fast unit cutoff:  15900
%  full unit cutoff:  0
%  dbl  unit cutoff:  11424
%  real runtime  :  184.57
%  process. runtime:  183.57
% specific non-discr-tree subsumption statistics: 
%  tried:           16736587
%  length fails:    1103226
%  strength fails:  4999660
%  predlist fails:  2082736
%  aux str. fails:  2511256
%  by-lit fails:    3957273
%  full subs tried: 538745
%  full subs fail:  493872
% 
% ; 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/GRP353-1+eq_r.in")
% 
%------------------------------------------------------------------------------