%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ANA038-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 : art09.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/SystemOnTPTP3754/ANA/ANA038-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: small
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 3 7)
% (binary-unit 28 #f 3 7)
% (binary-double 28 #f 3 7)
% (binary-posweight-order 28 #f 3 7)
% (binary-unit 62 #f)
% (hyper 159 #f)
% (binary-posweight-order 154 #f)
% (binary-weightorder 28 #f)
% (binary-order 28 #f)
% (binary 28 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(10,40,0,20,0,0)
% 
% 
% START OF PROOF
% 11 [] c_lessequals(X,c_^orderings_^omax(Y,X,Z),Z) | -class_^orderings_^olinorder(Z).
% 12 [] -c_lessequals(X,Y,Z) | -c_lessequals(Y,U,Z) | c_lessequals(X,U,Z) | -class_^orderings_^oorder(Z).
% 13 [] c_lessequals(c_times(X,Y,Z),c_times(U,Y,Z),Z) | -c_lessequals(c_0,Y,Z) | -c_lessequals(X,U,Z) | -class_^ring__and__^field_^opordered__semiring(Z).
% 14 [] -class_^ring__and__^field_^oordered__idom(X) | class_^orderings_^olinorder(X).
% 15 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ring__and__^field_^opordered__semiring(X).
% 16 [] -class_^ring__and__^field_^oordered__idom(X) | class_^orderings_^oorder(X).
% 17 [] c_lessequals(c_0,v_g(v_xa),t_b).
% 18 [] c_lessequals(c_^h^o^l_^oabs(v_b(v_xa),t_b),c_times(v_ca,v_g(v_xa),t_b),t_b).
% 19 [] -c_lessequals(c_^h^o^l_^oabs(v_b(v_xa),t_b),c_times(c_^orderings_^omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b).
% 20 [] class_^ring__and__^field_^oordered__idom(t_b).
% 21 [hyper:14,20] class_^orderings_^olinorder(t_b).
% 22 [hyper:15,20] class_^ring__and__^field_^opordered__semiring(t_b).
% 23 [hyper:16,20] class_^orderings_^oorder(t_b).
% 24 [hyper:11,21] c_lessequals(X,c_^orderings_^omax(Y,X,t_b),t_b).
% 43 [hyper:13,24,17,cut:22] c_lessequals(c_times(X,v_g(v_xa),t_b),c_times(c_^orderings_^omax(Y,X,t_b),v_g(v_xa),t_b),t_b).
% 82 [hyper:12,43,18,cut:23,slowcut:19] 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: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    17
%  derived clauses:   124
%  kept clauses:      10
%  kept size sum:     95
%  kept mid-nuclei:   45
%  kept new demods:   0
%  forw unit-subs:    13
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  30
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           3
%  length fails:    0
%  strength fails:  3
%  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" "/tmp/SystemOnTPTP3754/ANA/ANA038-2+noeq.in")
% 
%------------------------------------------------------------------------------