%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ANA025-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 : art08.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% 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/SystemOnTPTP14352/ANA/ANA025-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(12,40,0,24,0,0)
% 
% 
% START OF PROOF
% 13 [] c_lessequals(c_0,c_^h^o^l_^oabs(X,Y),Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 14 [] c_less(X,Y,Z) | c_lessequals(Y,X,Z) | -class_^orderings_^olinorder(Z).
% 15 [] c_lessequals(c_^orderings_^omax(X,Y,Z),U,Z) | -c_lessequals(X,U,Z) | -c_lessequals(Y,U,Z) | -class_^orderings_^olinorder(Z).
% 16 [] -c_lessequals(X,Y,Z) | -c_lessequals(Y,U,Z) | c_lessequals(X,U,Z) | -class_^orderings_^oorder(Z).
% 17 [] -c_less(X,Y,Z) | c_lessequals(X,Y,Z) | -class_^orderings_^oorder(Z).
% 18 [] -class_^l^order_^ojoin__semilorder(X) | class_^orderings_^oorder(X).
% 19 [] -class_^ordered^group_^olordered__ab__group__abs(X) | class_^l^order_^ojoin__semilorder(X).
% 20 [] -class_^ring__and__^field_^oordered__idom(X) | class_^orderings_^olinorder(X).
% 21 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 22 [] -c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b).
% 23 [] -c_lessequals(c_^orderings_^omax(c_minus(v_k(v_x),v_g(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).
% 24 [] class_^ring__and__^field_^oordered__idom(t_b).
% 25 [hyper:20,24] class_^orderings_^olinorder(t_b).
% 26 [hyper:21,24] class_^ordered^group_^olordered__ab__group__abs(t_b).
% 27 [hyper:14,25] c_less(X,Y,t_b) | c_lessequals(Y,X,t_b).
% 29 [hyper:13,26] c_lessequals(c_0,c_^h^o^l_^oabs(X,t_b),t_b).
% 30 [hyper:19,26] class_^l^order_^ojoin__semilorder(t_b).
% 31 [hyper:18,30] class_^orderings_^oorder(t_b).
% 59 [hyper:17,27,cut:31] c_lessequals(X,Y,t_b) | c_lessequals(Y,X,t_b).
% 81 [hyper:22,59] c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b).
% 135 [hyper:16,81,29,cut:31] c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_^h^o^l_^oabs(X,t_b),t_b).
% 1671 [hyper:15,135,29,cut:25,slowcut:23] 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:    45
%  derived clauses:   4404
%  kept clauses:      1193
%  kept size sum:     23588
%  kept mid-nuclei:   276
%  kept new demods:   0
%  forw unit-subs:    615
%  forw double-subs: 1015
%  forw overdouble-subs: 1144
%  backward subs:     0
%  fast unit cutoff:  251
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.12
%  process. runtime:  0.11
% specific non-discr-tree subsumption statistics: 
%  tried:           11266
%  length fails:    142
%  strength fails:  680
%  predlist fails:  1918
%  aux str. fails:  42
%  by-lit fails:    15
%  full subs tried: 8461
%  full subs fail:  7293
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP14352/ANA/ANA025-2+noeq.in")
% Killed 1 orphans
% 
%------------------------------------------------------------------------------