TSTP Solution File: GRP184-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP184-2 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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 19.4s
% Output : Assurance 19.4s
% 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/GRP184-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 4 1)
% (binary-posweight-lex-big-order 30 #f 4 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(20,40,0,40,0,0)
%
%
% START OF PROOF
% 21 [] equal(X,X).
% 22 [] equal(multiply(identity,X),X).
% 23 [] equal(multiply(inverse(X),X),identity).
% 24 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 25 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 26 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 27 [] equal(greatest_lower_bound(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(greatest_lower_bound(X,Y),Z)).
% 28 [] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(least_upper_bound(X,Y),Z)).
% 31 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 32 [] equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X).
% 33 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 34 [] equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))).
% 35 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 36 [] equal(multiply(greatest_lower_bound(X,Y),Z),greatest_lower_bound(multiply(X,Z),multiply(Y,Z))).
% 37 [] equal(inverse(identity),identity).
% 38 [] equal(inverse(inverse(X)),X).
% 39 [] equal(inverse(multiply(X,Y)),multiply(inverse(Y),inverse(X))).
% 40 [] -equal(multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))),multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity))).
% 41 [para:37.1.1,39.1.2.1,demod:22] equal(inverse(multiply(X,identity)),inverse(X)).
% 42 [?] ?
% 43 [para:38.1.1,39.1.2.1] equal(inverse(multiply(X,inverse(Y))),multiply(Y,inverse(X))).
% 44 [para:38.1.1,39.1.2.2] equal(inverse(multiply(inverse(X),Y)),multiply(inverse(Y),X)).
% 45 [para:38.1.1,23.1.1.1] equal(multiply(X,inverse(X)),identity).
% 46 [para:41.1.1,38.1.1.1,demod:38] equal(X,multiply(X,identity)).
% 51 [para:25.1.1,31.1.1.2] equal(least_upper_bound(X,greatest_lower_bound(Y,X)),X).
% 52 [para:31.1.1,26.1.1] equal(X,least_upper_bound(greatest_lower_bound(X,Y),X)).
% 53 [para:32.1.1,25.1.1] equal(X,greatest_lower_bound(least_upper_bound(X,Y),X)).
% 54 [para:26.1.1,32.1.1.2] equal(greatest_lower_bound(X,least_upper_bound(Y,X)),X).
% 56 [para:32.1.1,51.1.1.2,demod:28] equal(least_upper_bound(X,least_upper_bound(Y,X)),least_upper_bound(X,Y)).
% 58 [para:23.1.1,24.1.1.1,demod:22] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 61 [para:26.1.1,53.1.2.1] equal(X,greatest_lower_bound(least_upper_bound(Y,X),X)).
% 63 [para:52.1.2,53.1.2.1] equal(greatest_lower_bound(X,Y),greatest_lower_bound(X,greatest_lower_bound(X,Y))).
% 64 [para:27.1.2,25.1.1] equal(greatest_lower_bound(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(Z,greatest_lower_bound(X,Y))).
% 69 [para:27.1.2,51.1.1.2] equal(least_upper_bound(X,greatest_lower_bound(Y,greatest_lower_bound(Z,X))),X).
% 72 [para:54.1.1,27.1.2.1] equal(greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(Y,X),Z)),greatest_lower_bound(X,Z)).
% 75 [para:39.1.2,58.1.2.2,demod:38] equal(inverse(X),multiply(Y,inverse(multiply(X,Y)))).
% 81 [para:28.1.2,26.1.1] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(Z,least_upper_bound(X,Y))).
% 83 [para:26.1.1,28.1.2.1,demod:28] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(Y,least_upper_bound(X,Z))).
% 94 [para:75.1.2,75.1.2.2.1,demod:38] equal(inverse(X),multiply(inverse(multiply(Y,X)),Y)).
% 96 [para:32.1.1,69.1.1.2.2,demod:28] equal(least_upper_bound(X,least_upper_bound(Y,greatest_lower_bound(Z,X))),least_upper_bound(X,Y)).
% 104 [para:23.1.1,33.1.2.1] equal(multiply(inverse(X),least_upper_bound(X,Y)),least_upper_bound(identity,multiply(inverse(X),Y))).
% 105 [para:23.1.1,33.1.2.2] equal(multiply(inverse(X),least_upper_bound(Y,X)),least_upper_bound(multiply(inverse(X),Y),identity)).
% 108 [para:46.1.2,33.1.2.1] equal(multiply(X,least_upper_bound(identity,Y)),least_upper_bound(X,multiply(X,Y))).
% 109 [para:46.1.2,33.1.2.2] equal(multiply(X,least_upper_bound(Y,identity)),least_upper_bound(multiply(X,Y),X)).
% 110 [para:33.1.2,26.1.1,demod:33] equal(multiply(X,least_upper_bound(Y,Z)),multiply(X,least_upper_bound(Z,Y))).
% 112 [para:58.1.2,33.1.2.2] equal(multiply(inverse(X),least_upper_bound(Y,multiply(X,Z))),least_upper_bound(multiply(inverse(X),Y),Z)).
% 113 [para:33.1.2,28.1.2.1] equal(least_upper_bound(multiply(X,Y),least_upper_bound(multiply(X,Z),U)),least_upper_bound(multiply(X,least_upper_bound(Y,Z)),U)).
% 131 [para:46.1.2,34.1.2.1] equal(multiply(X,greatest_lower_bound(identity,Y)),greatest_lower_bound(X,multiply(X,Y))).
% 132 [para:46.1.2,34.1.2.2] equal(multiply(X,greatest_lower_bound(Y,identity)),greatest_lower_bound(multiply(X,Y),X)).
% 139 [para:22.1.1,35.1.2.1] equal(multiply(least_upper_bound(identity,X),Y),least_upper_bound(Y,multiply(X,Y))).
% 140 [para:22.1.1,35.1.2.2] equal(multiply(least_upper_bound(X,identity),Y),least_upper_bound(multiply(X,Y),Y)).
% 143 [para:45.1.1,35.1.2.1] equal(multiply(least_upper_bound(X,Y),inverse(X)),least_upper_bound(identity,multiply(Y,inverse(X)))).
% 156 [para:22.1.1,36.1.2.1] equal(multiply(greatest_lower_bound(identity,X),Y),greatest_lower_bound(Y,multiply(X,Y))).
% 157 [para:22.1.1,36.1.2.2] equal(multiply(greatest_lower_bound(X,identity),Y),greatest_lower_bound(multiply(X,Y),Y)).
% 171 [para:53.1.2,64.1.1.2] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,greatest_lower_bound(X,least_upper_bound(Y,Z)))).
% 209 [para:23.1.1,108.1.2.2] equal(multiply(inverse(X),least_upper_bound(identity,X)),least_upper_bound(inverse(X),identity)).
% 213 [para:31.1.1,108.1.1.2,demod:46] equal(X,least_upper_bound(X,multiply(X,greatest_lower_bound(identity,Y)))).
% 214 [para:108.1.2,32.1.1.2] equal(greatest_lower_bound(X,multiply(X,least_upper_bound(identity,Y))),X).
% 215 [para:51.1.1,108.1.1.2,demod:46] equal(X,least_upper_bound(X,multiply(X,greatest_lower_bound(Y,identity)))).
% 219 [para:108.1.2,53.1.2.1] equal(X,greatest_lower_bound(multiply(X,least_upper_bound(identity,Y)),X)).
% 224 [para:94.1.2,108.1.2.2] equal(multiply(inverse(multiply(X,Y)),least_upper_bound(identity,X)),least_upper_bound(inverse(multiply(X,Y)),inverse(Y))).
% 236 [para:213.1.2,61.1.2.1] equal(multiply(X,greatest_lower_bound(identity,Y)),greatest_lower_bound(X,multiply(X,greatest_lower_bound(identity,Y)))).
% 240 [para:26.1.1,214.1.1.2.2] equal(greatest_lower_bound(X,multiply(X,least_upper_bound(Y,identity))),X).
% 247 [para:215.1.2,26.1.1] equal(X,least_upper_bound(multiply(X,greatest_lower_bound(Y,identity)),X)).
% 281 [para:94.1.2,109.1.2.1] equal(multiply(inverse(multiply(X,Y)),least_upper_bound(X,identity)),least_upper_bound(inverse(Y),inverse(multiply(X,Y)))).
% 291 [para:72.1.1,51.1.1.2] equal(least_upper_bound(greatest_lower_bound(least_upper_bound(X,Y),Z),greatest_lower_bound(Y,Z)),greatest_lower_bound(least_upper_bound(X,Y),Z)).
% 313 [para:26.1.1,81.1.2.2] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(Z,least_upper_bound(Y,X))).
% 435 [para:214.1.1,96.1.1.2.2] equal(least_upper_bound(multiply(X,least_upper_bound(identity,Y)),least_upper_bound(Z,X)),least_upper_bound(multiply(X,least_upper_bound(identity,Y)),Z)).
% 459 [para:110.1.1,94.1.2.1.1,demod:94] equal(inverse(least_upper_bound(X,Y)),inverse(least_upper_bound(Y,X))).
% 475 [para:459.1.1,58.1.2.1] equal(X,multiply(inverse(least_upper_bound(Y,Z)),multiply(least_upper_bound(Z,Y),X))).
% 569 [para:23.1.1,132.1.2.1] equal(multiply(inverse(X),greatest_lower_bound(X,identity)),greatest_lower_bound(identity,inverse(X))).
% 660 [para:219.1.2,171.1.2.2,demod:32] equal(greatest_lower_bound(multiply(least_upper_bound(X,Y),least_upper_bound(identity,Z)),X),X).
% 983 [para:45.1.1,139.1.2.2] equal(multiply(least_upper_bound(identity,X),inverse(X)),least_upper_bound(inverse(X),identity)).
% 989 [para:51.1.1,139.1.1.1,demod:22] equal(X,least_upper_bound(X,multiply(greatest_lower_bound(Y,identity),X))).
% 1009 [para:139.1.2,108.1.2] equal(multiply(X,least_upper_bound(identity,X)),multiply(least_upper_bound(identity,X),X)).
% 1081 [para:989.1.2,26.1.1] equal(X,least_upper_bound(multiply(greatest_lower_bound(Y,identity),X),X)).
% 1136 [para:45.1.1,140.1.2.1] equal(multiply(least_upper_bound(X,identity),inverse(X)),least_upper_bound(identity,inverse(X))).
% 1241 [para:156.1.2,131.1.2] equal(multiply(X,greatest_lower_bound(identity,X)),multiply(greatest_lower_bound(identity,X),X)).
% 1274 [para:45.1.1,157.1.2.1] equal(multiply(greatest_lower_bound(X,identity),inverse(X)),greatest_lower_bound(identity,inverse(X))).
% 1561 [para:31.1.1,104.1.1.2,demod:23] equal(identity,least_upper_bound(identity,multiply(inverse(X),greatest_lower_bound(X,Y)))).
% 1562 [para:104.1.2,32.1.1.2] equal(greatest_lower_bound(identity,multiply(inverse(X),least_upper_bound(X,Y))),identity).
% 1593 [para:219.1.2,1561.1.2.2.2,demod:94] equal(identity,least_upper_bound(identity,inverse(least_upper_bound(identity,X)))).
% 1600 [para:1593.1.2,26.1.1] equal(identity,least_upper_bound(inverse(least_upper_bound(identity,X)),identity)).
% 1642 [para:247.1.2,1562.1.1.2.2,demod:94] equal(greatest_lower_bound(identity,inverse(greatest_lower_bound(X,identity))),identity).
% 1661 [para:1642.1.1,96.1.1.2.2] equal(least_upper_bound(inverse(greatest_lower_bound(X,identity)),least_upper_bound(Y,identity)),least_upper_bound(inverse(greatest_lower_bound(X,identity)),Y)).
% 1703 [para:1600.1.2,660.1.1.1.1,demod:22] equal(greatest_lower_bound(least_upper_bound(identity,X),inverse(least_upper_bound(identity,Y))),inverse(least_upper_bound(identity,Y))).
% 1851 [para:1081.1.2,113.1.1.2] equal(least_upper_bound(multiply(greatest_lower_bound(X,identity),Y),Z),least_upper_bound(multiply(greatest_lower_bound(X,identity),least_upper_bound(Y,Z)),Z)).
% 2163 [para:209.1.1,44.1.1.1] equal(inverse(least_upper_bound(inverse(X),identity)),multiply(inverse(least_upper_bound(identity,X)),X)).
% 2174 [para:209.1.1,156.1.2.2] equal(multiply(greatest_lower_bound(identity,inverse(X)),least_upper_bound(identity,X)),greatest_lower_bound(least_upper_bound(identity,X),least_upper_bound(inverse(X),identity))).
% 2276 [para:569.1.1,140.1.2.1] equal(multiply(least_upper_bound(inverse(X),identity),greatest_lower_bound(X,identity)),least_upper_bound(greatest_lower_bound(identity,inverse(X)),greatest_lower_bound(X,identity))).
% 2282 [para:983.1.1,58.1.2.2] equal(inverse(X),multiply(inverse(least_upper_bound(identity,X)),least_upper_bound(inverse(X),identity))).
% 2287 [para:983.1.1,43.1.1.1] equal(inverse(least_upper_bound(inverse(X),identity)),multiply(X,inverse(least_upper_bound(identity,X)))).
% 2295 [para:983.1.1,131.1.2.2,demod:2174] equal(multiply(least_upper_bound(identity,X),greatest_lower_bound(identity,inverse(X))),multiply(greatest_lower_bound(identity,inverse(X)),least_upper_bound(identity,X))).
% 2304 [para:1009.1.2,58.1.2.2] equal(X,multiply(inverse(least_upper_bound(identity,X)),multiply(X,least_upper_bound(identity,X)))).
% 2314 [para:1009.1.2,109.1.1,demod:435,1009,56] equal(multiply(least_upper_bound(X,identity),least_upper_bound(identity,X)),least_upper_bound(multiply(X,least_upper_bound(identity,X)),identity)).
% 2384 [para:1241.1.2,58.1.2.2] equal(X,multiply(inverse(greatest_lower_bound(identity,X)),multiply(X,greatest_lower_bound(identity,X)))).
% 2398 [para:1241.1.2,131.1.1,demod:236,27,1241,63] equal(multiply(greatest_lower_bound(identity,X),greatest_lower_bound(identity,X)),greatest_lower_bound(identity,multiply(X,greatest_lower_bound(identity,X)))).
% 2420 [para:1274.1.1,43.1.1.1] equal(inverse(greatest_lower_bound(identity,inverse(X))),multiply(X,inverse(greatest_lower_bound(X,identity)))).
% 2423 [para:1274.1.1,109.1.2.1,demod:2276] equal(multiply(greatest_lower_bound(X,identity),least_upper_bound(inverse(X),identity)),multiply(least_upper_bound(inverse(X),identity),greatest_lower_bound(X,identity))).
% 2629 [para:2282.1.2,240.1.1.2] equal(greatest_lower_bound(inverse(least_upper_bound(identity,X)),inverse(X)),inverse(least_upper_bound(identity,X))).
% 2672 [para:31.1.1,143.1.1.1,demod:45] equal(identity,least_upper_bound(identity,multiply(greatest_lower_bound(X,Y),inverse(X)))).
% 2708 [para:2672.1.2,112.1.1.2,demod:42] equal(inverse(greatest_lower_bound(X,Y)),least_upper_bound(inverse(greatest_lower_bound(X,Y)),inverse(X))).
% 2759 [para:2708.1.2,54.1.1.2] equal(greatest_lower_bound(inverse(X),inverse(greatest_lower_bound(X,Y))),inverse(X)).
% 2761 [para:61.1.2,2708.1.2.1.1,demod:61] equal(inverse(X),least_upper_bound(inverse(X),inverse(least_upper_bound(Y,X)))).
% 2798 [para:25.1.1,2759.1.1.2.1] equal(greatest_lower_bound(inverse(X),inverse(greatest_lower_bound(Y,X))),inverse(X)).
% 2825 [para:2761.1.2,313.1.1.2] equal(least_upper_bound(X,inverse(Y)),least_upper_bound(inverse(least_upper_bound(Z,Y)),least_upper_bound(inverse(Y),X))).
% 2847 [para:2798.1.1,64.1.1.2] equal(greatest_lower_bound(X,inverse(Y)),greatest_lower_bound(inverse(greatest_lower_bound(Z,Y)),greatest_lower_bound(X,inverse(Y)))).
% 2873 [para:2287.1.1,2163.1.1] equal(multiply(X,inverse(least_upper_bound(identity,X))),multiply(inverse(least_upper_bound(identity,X)),X)).
% 2874 [para:2304.1.2,109.1.2.1,demod:475,2314] equal(least_upper_bound(identity,X),least_upper_bound(X,inverse(least_upper_bound(identity,X)))).
% 2881 [para:2874.1.2,81.1.1.2] equal(least_upper_bound(X,least_upper_bound(identity,Y)),least_upper_bound(inverse(least_upper_bound(identity,Y)),least_upper_bound(X,Y))).
% 2952 [para:2384.1.2,131.1.2.2,demod:58,2398] equal(greatest_lower_bound(identity,X),greatest_lower_bound(inverse(greatest_lower_bound(identity,X)),X)).
% 2955 [para:2952.1.2,27.1.2.1,demod:27] equal(greatest_lower_bound(inverse(greatest_lower_bound(identity,X)),greatest_lower_bound(X,Y)),greatest_lower_bound(identity,greatest_lower_bound(X,Y))).
% 3889 [para:2420.1.2,224.1.1.1.1,demod:2423,2276,1274,43,2295,38] equal(multiply(least_upper_bound(identity,X),greatest_lower_bound(identity,inverse(X))),multiply(greatest_lower_bound(X,identity),least_upper_bound(inverse(X),identity))).
% 4501 [para:2881.1.2,2825.1.2] equal(least_upper_bound(X,inverse(X)),least_upper_bound(inverse(X),least_upper_bound(identity,X))).
% 4504 [para:26.1.1,4501.1.2.2] equal(least_upper_bound(X,inverse(X)),least_upper_bound(inverse(X),least_upper_bound(X,identity))).
% 4512 [para:4501.1.2,83.1.1] equal(least_upper_bound(X,inverse(X)),least_upper_bound(identity,least_upper_bound(inverse(X),X))).
% 5175 [para:2955.1.1,2847.1.2] equal(greatest_lower_bound(X,inverse(X)),greatest_lower_bound(identity,greatest_lower_bound(X,inverse(X)))).
% 5178 [para:5175.1.2,31.1.1.2] equal(least_upper_bound(identity,greatest_lower_bound(X,inverse(X))),identity).
% 5220 [para:38.1.1,5178.1.1.2.2] equal(least_upper_bound(identity,greatest_lower_bound(inverse(X),X)),identity).
% 5235 [para:5220.1.1,291.1.1.1.1,demod:5220,27] equal(least_upper_bound(greatest_lower_bound(identity,X),greatest_lower_bound(inverse(Y),greatest_lower_bound(Y,X))),greatest_lower_bound(identity,X)).
% 5991 [para:2629.1.1,5235.1.1.2.2,demod:1703,38] equal(least_upper_bound(greatest_lower_bound(identity,inverse(X)),inverse(least_upper_bound(identity,X))),greatest_lower_bound(identity,inverse(X))).
% 6356 [para:5991.1.1,105.1.1.2,demod:52,1274,1851,3889,38] equal(multiply(greatest_lower_bound(X,identity),least_upper_bound(inverse(X),identity)),identity).
% 6360 [para:6356.1.1,58.1.2.2,demod:42] equal(least_upper_bound(inverse(X),identity),inverse(greatest_lower_bound(X,identity))).
% 6366 [para:6360.1.1,26.1.1] equal(inverse(greatest_lower_bound(X,identity)),least_upper_bound(identity,inverse(X))).
% 6367 [para:6360.1.1,28.1.2.1] equal(least_upper_bound(inverse(X),least_upper_bound(identity,Y)),least_upper_bound(inverse(greatest_lower_bound(X,identity)),Y)).
% 6368 [para:6360.1.1,109.1.1.2] equal(multiply(X,inverse(greatest_lower_bound(Y,identity))),least_upper_bound(multiply(X,inverse(Y)),X)).
% 6387 [para:6360.1.1,2163.1.1.1,demod:2873,38] equal(greatest_lower_bound(X,identity),multiply(X,inverse(least_upper_bound(identity,X)))).
% 6403 [para:6360.1.1,4504.1.2.2,demod:38] equal(least_upper_bound(inverse(X),X),least_upper_bound(X,inverse(greatest_lower_bound(X,identity)))).
% 6684 [para:6387.1.2,281.1.1.1.1,demod:4512,6403,28,6387,38] equal(multiply(inverse(greatest_lower_bound(X,identity)),least_upper_bound(X,identity)),least_upper_bound(X,inverse(X))).
% 8321 [para:6368.1.1,40.1.1,demod:6684,4501,6367,1661,6366,1136,cut:21] 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 kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1315
% derived clauses: 1028345
% kept clauses: 8280
% kept size sum: 143285
% kept mid-nuclei: 0
% kept new demods: 6144
% forw unit-subs: 437461
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 24
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 21.50
% process. runtime: 20.90
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/GRP184-2+eq_r.in")
%
%------------------------------------------------------------------------------