%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ANA029-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/SystemOnTPTP3334/ANA/ANA029-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 4 7)
% (binary-unit 10 #f 4 7)
% (binary-double 16 #f 4 7)
% (binary 54 #t 4 7)
% (binary-order 27 #f 4 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(14,40,0,28,0,0)
% 
% 
% START OF PROOF
% 15 [] c_lessequals(c_0,c_^h^o^l_^oabs(X,Y),Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 18 [] c_less(X,Y,Z) | c_lessequals(Y,X,Z) | -class_^orderings_^olinorder(Z).
% 19 [] c_lessequals(c_^orderings_^omax(X,Y,Z),U,Z) | -c_lessequals(X,U,Z) | -c_lessequals(Y,U,Z) | -class_^orderings_^olinorder(Z).
% 20 [] -c_lessequals(X,Y,Z) | -c_lessequals(Y,U,Z) | c_lessequals(X,U,Z) | -class_^orderings_^oorder(Z).
% 21 [] -c_less(X,Y,Z) | c_lessequals(X,Y,Z) | -class_^orderings_^oorder(Z).
% 22 [] -class_^ordered^group_^opordered__ab__group__add(X) | class_^orderings_^oorder(X).
% 23 [] -class_^ring__and__^field_^oordered__idom(X) | class_^orderings_^olinorder(X).
% 24 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 25 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^opordered__ab__group__add(X).
% 26 [] -c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b).
% 27 [] -c_lessequals(c_^orderings_^omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_^h^o^l_^oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b).
% 28 [] class_^ring__and__^field_^oordered__idom(t_b).
% 29 [hyper:23,28] class_^orderings_^olinorder(t_b).
% 30 [hyper:24,28] class_^ordered^group_^olordered__ab__group__abs(t_b).
% 31 [hyper:25,28] class_^ordered^group_^opordered__ab__group__add(t_b).
% 32 [hyper:18,29] c_less(X,Y,t_b) | c_lessequals(Y,X,t_b).
% 34 [hyper:15,30] c_lessequals(c_0,c_^h^o^l_^oabs(X,t_b),t_b).
% 37 [hyper:22,31] class_^orderings_^oorder(t_b).
% 68 [hyper:21,32,cut:37] c_lessequals(X,Y,t_b) | c_lessequals(Y,X,t_b).
% 108 [hyper:26,68] c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b).
% 215 [hyper:20,108,34,cut:37] c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_^h^o^l_^oabs(X,t_b),t_b).
% 5008 [hyper:19,215,34,cut:29,slowcut:27] 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 4
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    69
%  derived clauses:   12651
%  kept clauses:      3907
%  kept size sum:     74973
%  kept mid-nuclei:   512
%  kept new demods:   0
%  forw unit-subs:    1955
%  forw double-subs: 3109
%  forw overdouble-subs: 2845
%  backward subs:     0
%  fast unit cutoff:  605
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.37
%  process. runtime:  0.35
% specific non-discr-tree subsumption statistics: 
%  tried:           33088
%  length fails:    577
%  strength fails:  2450
%  predlist fails:  4879
%  aux str. fails:  1101
%  by-lit fails:    132
%  full subs tried: 23885
%  full subs fail:  21005
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP3334/ANA/ANA029-2+noeq.in")
% Killed 1 orphans
% 
%------------------------------------------------------------------------------