%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA019-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 : art02.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 14.8s
% Output : Assurance 14.8s
% 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/SystemOnTPTP18692/ANA/ANA019-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 5 7)
% (binary-unit 9 #f 5 7)
% (binary-double 9 #f 5 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 5 7)
% (binary-order 25 #f 5 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(16,40,0,32,0,0,653439,4,1879,653458,50,1916,653458,40,1916,653474,0,1916)
%
%
% START OF PROOF
% 653460 [] equal(X,c_^suc(c_minus(X,c_1,tc_nat))) | -c_less(c_0,X,tc_nat).
% 653461 [] c_less(c_0,X,tc_nat) | equal(X,c_0).
% 653462 [] equal(c_^h^o^l_^oabs(c_0,X),c_0) | -class_^ordered^group_^olordered__ab__group__abs(X).
% 653463 [] c_lessequals(c_0,c_^h^o^l_^oabs(X,Y),Y) | -class_^ordered^group_^olordered__ab__group__abs(Y).
% 653464 [] -c_less(X,Y,Z) | c_lessequals(X,Y,Z) | -class_^orderings_^oorder(Z).
% 653465 [] c_lessequals(c_0,c_times(X,Y,Z),Z) | -c_lessequals(c_0,X,Z) | -c_lessequals(c_0,Y,Z) | -class_^ring__and__^field_^opordered__cancel__semiring(Z).
% 653466 [] -class_^l^order_^ojoin__semilorder(X) | class_^orderings_^oorder(X).
% 653467 [] -class_^ring__and__^field_^oordered__idom(X) | class_^l^order_^ojoin__semilorder(X).
% 653468 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ring__and__^field_^opordered__cancel__semiring(X).
% 653469 [] -class_^ring__and__^field_^oordered__idom(X) | class_^ordered^group_^olordered__ab__group__abs(X).
% 653470 [] equal(v_f(c_0),c_0).
% 653471 [] c_less(c_0,v_x,t_a).
% 653472 [] c_lessequals(c_^h^o^l_^oabs(v_f(c_^suc(X)),t_a),c_times(v_x,c_^h^o^l_^oabs(v_h(c_^suc(X)),t_a),t_a),t_a).
% 653473 [] -c_lessequals(c_^h^o^l_^oabs(v_f(v_xa(X)),t_a),c_times(X,c_^h^o^l_^oabs(v_h(v_xa(X)),t_a),t_a),t_a) | -c_less(c_0,X,t_a).
% 653474 [] class_^ring__and__^field_^oordered__idom(t_a).
% 653478 [binary:653474,653467] class_^l^order_^ojoin__semilorder(t_a).
% 653479 [binary:653466,653478] class_^orderings_^oorder(t_a).
% 653481 [binary:653474,653468] class_^ring__and__^field_^opordered__cancel__semiring(t_a).
% 653483 [binary:653474,653469] class_^ordered^group_^olordered__ab__group__abs(t_a).
% 653485 [binary:653483,653462.2] equal(c_^h^o^l_^oabs(c_0,t_a),c_0).
% 653487 [para:653461.2.2,653470.1.1.1] equal(v_f(X),c_0) | c_less(c_0,X,tc_nat).
% 653502 [binary:653471,653473.2] -c_lessequals(c_^h^o^l_^oabs(v_f(v_xa(v_x)),t_a),c_times(v_x,c_^h^o^l_^oabs(v_h(v_xa(v_x)),t_a),t_a),t_a).
% 653508 [binary:653471,653464,cut:653479] c_lessequals(c_0,v_x,t_a).
% 653533 [binary:653508,653465.2,cut:653481] c_lessequals(c_0,c_times(v_x,X,t_a),t_a) | -c_lessequals(c_0,X,t_a).
% 653550 [para:653487.1.1,653502.1.1.1,demod:653485,binarydemod:653463,653533,cut:653483] c_less(c_0,v_xa(v_x),tc_nat).
% 653557 [binary:653460.2,653550] equal(v_xa(v_x),c_^suc(c_minus(v_xa(v_x),c_1,tc_nat))).
% 653566 [para:653557.1.2,653472.1.1.1.1,demod:653557,cut:653502] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1080
% derived clauses: 894992
% kept clauses: 77067
% kept size sum: 668
% kept mid-nuclei: 2447
% kept new demods: 6
% forw unit-subs: 78475
% forw double-subs: 10
% forw overdouble-subs: 0
% backward subs: 3
% fast unit cutoff: 2442
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 19.33
% process. runtime: 19.16
% specific non-discr-tree subsumption statistics:
% tried: 6
% length fails: 0
% strength fails: 5
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% full subs fail: 1
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP18692/ANA/ANA019-2+eq_r.in")
% WARNING: TreeLimitedRun lost 14.83s, total lost is 14.83s
%
%------------------------------------------------------------------------------