%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ANA018-2 : TPTP v3.4.2. Released v3.2.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 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% 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: /tmp/SystemOnTPTP4297/ANA/ANA018-2+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 4 7)
% (binary-posweight-order 29 #f 4 7)
% (binary-unit 29 #f 4 7)
% (binary-double 29 #f 4 7)
% (binary 29 #t 4 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,88,50,0,102,0,0,186,50,0,200,0,0,310,50,1,324,0,1,462,50,1,476,0,1,642,50,2,656,0,2,850,50,2,864,0,2,1086,50,3,1100,0,3,1350,50,4,1364,0,4,1642,50,5,1656,0,5,1962,50,7,1976,0,7,2310,50,9,2324,0,9,2686,50,10,2700,0,10,3090,50,12,3104,0,12,3522,50,15,3536,0,15,3982,50,17,3996,0,17,4470,50,21,4484,0,21,4986,50,25,5000,0,25,5530,50,30,5530,40,30,5544,0,30,5577,50,31,5591,0,31)
% 
% 
% START OF PROOF
% 5059 [?] ?
% 5579 [] equal(c_times(c_times(X,Y,Z),U,Z),c_times(X,c_times(Y,U,Z),Z)) | -class_^ordered^group_^osemigroup__mult(Z).
% 5584 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^osemigroup__mult(X).
% 5590 [] -c_lessequals(c_^h^o^l_^oabs(v_x(v_xa),t_b),c_times(c_times(v_ca,v_c,t_b),c_^h^o^l_^oabs(v_g(v_xa),t_b),t_b),t_b).
% 5591 [] class_^ring__and__^field_^oordered__idom(t_b).
% 5595 [binary:5591,5584] class_^ordered^group_^osemigroup__mult(t_b).
% 5614 [binary:5595,5579.2] equal(c_times(c_times(X,Y,t_b),Z,t_b),c_times(X,c_times(Y,Z,t_b),t_b)).
% 5621 [para:5614.1.1,5590.1.2,cut:5059] 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 7
% clause depth limited to 5
% seconds given: 29
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1083
%  derived clauses:   6621
%  kept clauses:      807
%  kept size sum:     34406
%  kept mid-nuclei:   4346
%  kept new demods:   20
%  forw unit-subs:    1142
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  4147
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.33
%  process. runtime:  0.31
% specific non-discr-tree subsumption statistics: 
%  tried:           78
%  length fails:    0
%  strength fails:  76
%  predlist fails:  0
%  aux str. fails:  2
%  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" "/tmp/SystemOnTPTP4297/ANA/ANA018-2+eq_r.in")
% 
%------------------------------------------------------------------------------