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

% Computer : art02.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 20.0s
% Output   : Assurance 20.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/GRP198-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 6 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 6 3)
% (binary-posweight-lex-big-order 30 #f 6 3)
% (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)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(6,40,1,12,0,1,14,50,2,20,0,2,24,50,2,30,0,2,63,50,96,69,0,96,214,50,1941,214,40,1941,220,0,1941,13827,3,2674)
% 
% 
% START OF PROOF
% 126 [?] ?
% 216 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 217 [] -equal(multiply(X,Y),multiply(Z,Y)) | equal(X,Z).
% 219 [] equal(multiply(X,multiply(Y,multiply(Y,multiply(Y,multiply(X,Y))))),multiply(Y,multiply(Y,multiply(Y,multiply(Y,multiply(X,X)))))).
% 220 [] -equal(multiply(b,multiply(a,multiply(b,multiply(b,multiply(b,a))))),multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b)))))).
% 239 [para:219.1.1,216.1.1,demod:216] equal(multiply(X,multiply(X,multiply(X,multiply(X,multiply(Y,multiply(Z,multiply(Y,Z))))))),multiply(Y,multiply(Z,multiply(X,multiply(X,multiply(X,multiply(Y,multiply(Z,X)))))))).
% 327 [binary:217.2,220,demod:216] -equal(multiply(b,multiply(a,multiply(b,multiply(b,multiply(b,multiply(a,X)))))),multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,multiply(b,X))))))).
% 14473 [para:239.1.2,327.1.2.2,cut:126] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation 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: 12
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    473
%  derived clauses:   301843
%  kept clauses:      13672
%  kept size sum:     918751
%  kept mid-nuclei:   0
%  kept new demods:   5
%  forw unit-subs:    78130
%  forw double-subs: 16121
%  forw overdouble-subs: 0
%  backward subs:     83
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  28.13
%  process. runtime:  28.12
% 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/GRP198-1+eq_r.in")
% 
%------------------------------------------------------------------------------