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

% Computer : art03.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 0.0s
% Output   : Assurance 0.0s
% 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/GRP035-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 58 #f 2 7)
% (binary-posweight-order 29 #f 2 7)
% (binary-unit 29 #f 2 7)
% (binary-double 29 #f 2 7)
% (binary 29 #t 2 7)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(14,40,0,28,0,0,1183,50,4,1197,0,4)
% 
% 
% START OF PROOF
% 145 [?] ?
% 1185 [] product(identity,X,X).
% 1186 [] product(X,identity,X).
% 1187 [] product(inverse(X),X,identity).
% 1189 [] product(X,Y,multiply(X,Y)).
% 1190 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 1191 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 1193 [] -product(X,inverse(Y),Z) | -subgroup_member(X) | -subgroup_member(Y) | subgroup_member(Z).
% 1194 [] subgroup_member(a).
% 1195 [] subgroup_member(b).
% 1196 [] product(a,b,c).
% 1197 [] -subgroup_member(c).
% 1214 [hyper:1193,1185,1195,cut:145] subgroup_member(inverse(b)).
% 1272 [hyper:1191,1187,1185,1187] product(inverse(inverse(X)),identity,X).
% 1434 [hyper:1190,1189,1196] equal(c,multiply(a,b)).
% 1571 [hyper:1190,1272,1186] equal(inverse(inverse(X)),X).
% 2321 [hyper:1193,1189,1214,1194,demod:1571,demod:1434,cut:1197] 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 7
% clause depth limited to 3
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    73
%  derived clauses:   6279
%  kept clauses:      80
%  kept size sum:     521
%  kept mid-nuclei:   2190
%  kept new demods:   14
%  forw unit-subs:    2938
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  15
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.6
%  process. runtime:  0.7
% specific non-discr-tree subsumption statistics: 
%  tried:           160
%  length fails:    0
%  strength fails:  62
%  predlist fails:  18
%  aux str. fails:  64
%  by-lit fails:    0
%  full subs tried: 16
%  full subs fail:  16
% 
% ; 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/GRP035-3+eq_r.in")
% 
%------------------------------------------------------------------------------