%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWV019-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 29 18:04:19 EDT 2024

% Result   : Unsatisfiable 0.21s 0.52s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SWV019-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 26 21:50:54 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.MgyXRFbHNO/cvc5---1.0.5_16830.smt2
% 0.21/0.52  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.MgyXRFbHNO/cvc5---1.0.5_16830.smt2
% 0.21/0.52  (assume a0 (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))))
% 0.21/0.52  (assume a1 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y))))
% 0.21/0.52  (assume a2 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))))
% 0.21/0.52  (assume a3 (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))))
% 0.21/0.52  (assume a4 (or (not (tptp.in_array_bounds tptp.array tptp.index_of_maximal)) (= tptp.maximal_value (tptp.array_value_at tptp.array tptp.index_of_maximal))))
% 0.21/0.52  (assume a5 (tptp.less_than tptp.index_of_maximal tptp.an_index))
% 0.21/0.52  (assume a6 (not (tptp.less_than tptp.an_index tptp.lower_bound)))
% 0.21/0.52  (assume a7 (not (tptp.less_than tptp.upper_bound tptp.an_index)))
% 0.21/0.52  (assume a8 (not (tptp.less_than tptp.index_of_maximal tptp.lower_bound)))
% 0.21/0.52  (assume a9 (or (not (tptp.in_array_bounds tptp.array tptp.an_index)) (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound) (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index)) (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (not (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))) (not (tptp.in_array_bounds tptp.array tptp.index_of_maximal)) (not (= tptp.maximal_value (tptp.array_value_at tptp.array tptp.index_of_maximal)))))
% 0.21/0.52  (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y)))) :rule implies_neg1)
% 0.21/0.52  (anchor :step t2)
% 0.21/0.52  (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y))))
% 0.21/0.52  (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y)))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule forall_inst :args ((:= X tptp.upper_bound) (:= Y tptp.an_index)))
% 0.21/0.53  (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y)))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule or :premises (t2.t1))
% 0.21/0.53  (step t2.t3 (cl (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule resolution :premises (t2.t2 t2.a0))
% 0.21/0.53  (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y)))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule subproof :discharge (t2.a0))
% 0.21/0.53  (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule resolution :premises (t1 t2))
% 0.21/0.53  (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) (not (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule implies_neg2)
% 0.21/0.53  (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule resolution :premises (t3 t4))
% 0.21/0.53  (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule contraction :premises (t5))
% 0.21/0.53  (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_than (tptp.successor X) (tptp.successor Y))) (tptp.less_than X Y)))) (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule implies :premises (t6))
% 0.21/0.53  (step t8 (cl (not (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index)) :rule or_pos)
% 0.21/0.53  (step t9 (cl (tptp.less_than tptp.upper_bound tptp.an_index) (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (not (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule reordering :premises (t8))
% 0.21/0.53  (step t10 (cl (not (tptp.in_array_bounds tptp.array tptp.an_index)) (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound) (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index)) (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (not (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))) (not (tptp.in_array_bounds tptp.array tptp.index_of_maximal)) (not (= tptp.maximal_value (tptp.array_value_at tptp.array tptp.index_of_maximal)))) :rule or :premises (a9))
% 0.21/0.53  (step t11 (cl (not (tptp.in_array_bounds tptp.array tptp.index_of_maximal)) (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (not (tptp.in_array_bounds tptp.array tptp.an_index)) (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound) (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index)) (not (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))) (not (= tptp.maximal_value (tptp.array_value_at tptp.array tptp.index_of_maximal)))) :rule reordering :premises (t10))
% 0.21/0.53  (step t12 (cl (not (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal)) :rule or_pos)
% 0.21/0.53  (step t13 (cl (tptp.in_array_bounds tptp.array tptp.index_of_maximal) (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (not (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal)))) :rule reordering :premises (t12))
% 0.21/0.53  (step t14 (cl (not (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index)) :rule or_pos)
% 0.21/0.53  (step t15 (cl (tptp.less_than tptp.upper_bound tptp.an_index) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule reordering :premises (t14))
% 0.21/0.53  (step t16 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t17)
% 0.21/0.53  (assume t17.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))))
% 0.21/0.53  (step t17.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule forall_inst :args ((:= X tptp.upper_bound) (:= Y tptp.index_of_maximal) (:= Z tptp.an_index)))
% 0.21/0.53  (step t17.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule or :premises (t17.t1))
% 0.21/0.53  (step t17.t3 (cl (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule resolution :premises (t17.t2 t17.a0))
% 0.21/0.53  (step t17 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule subproof :discharge (t17.a0))
% 0.21/0.53  (step t18 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule resolution :premises (t16 t17))
% 0.21/0.53  (step t19 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) (not (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule implies_neg2)
% 0.21/0.53  (step t20 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule resolution :premises (t18 t19))
% 0.21/0.53  (step t21 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule contraction :premises (t20))
% 0.21/0.53  (step t22 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule implies :premises (t21))
% 0.21/0.53  (step t23 (cl (or (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (tptp.less_than tptp.upper_bound tptp.an_index))) :rule resolution :premises (t22 a2))
% 0.21/0.53  (step t24 (cl (not (tptp.less_than tptp.upper_bound tptp.index_of_maximal))) :rule resolution :premises (t15 a7 a5 t23))
% 0.21/0.53  (step t25 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t26)
% 0.21/0.53  (assume t26.a0 (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))))
% 0.21/0.53  (step t26.t1 (cl (or (not (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal)))) :rule forall_inst :args ((:= X1 tptp.index_of_maximal)))
% 0.21/0.53  (step t26.t2 (cl (not (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) :rule or :premises (t26.t1))
% 0.21/0.53  (step t26.t3 (cl (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) :rule resolution :premises (t26.t2 t26.a0))
% 0.21/0.53  (step t26 (cl (not (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) :rule subproof :discharge (t26.a0))
% 0.21/0.53  (step t27 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) :rule resolution :premises (t25 t26))
% 0.21/0.53  (step t28 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) (not (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal)))) :rule implies_neg2)
% 0.21/0.53  (step t29 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal)))) :rule resolution :premises (t27 t28))
% 0.21/0.53  (step t30 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal)))) :rule contraction :premises (t29))
% 0.21/0.53  (step t31 (cl (not (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) :rule implies :premises (t30))
% 0.21/0.53  (step t32 (cl (or (tptp.less_than tptp.index_of_maximal tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.index_of_maximal) (tptp.in_array_bounds tptp.array tptp.index_of_maximal))) :rule resolution :premises (t31 a0))
% 0.21/0.53  (step t33 (cl (tptp.in_array_bounds tptp.array tptp.index_of_maximal)) :rule resolution :premises (t13 a8 t24 t32))
% 0.21/0.53  (step t34 (cl (not (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index)) :rule or_pos)
% 0.21/0.53  (step t35 (cl (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index) (not (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index)))) :rule reordering :premises (t34))
% 0.21/0.53  (step t36 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t37)
% 0.21/0.53  (assume t37.a0 (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))))
% 0.21/0.53  (step t37.t1 (cl (or (not (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index)))) :rule forall_inst :args ((:= X1 tptp.an_index)))
% 0.21/0.53  (step t37.t2 (cl (not (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) :rule or :premises (t37.t1))
% 0.21/0.53  (step t37.t3 (cl (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) :rule resolution :premises (t37.t2 t37.a0))
% 0.21/0.53  (step t37 (cl (not (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) :rule subproof :discharge (t37.a0))
% 0.21/0.53  (step t38 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) :rule resolution :premises (t36 t37))
% 0.21/0.53  (step t39 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) (not (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index)))) :rule implies_neg2)
% 0.21/0.53  (step t40 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index)))) :rule resolution :premises (t38 t39))
% 0.21/0.53  (step t41 (cl (=> (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index)))) :rule contraction :premises (t40))
% 0.21/0.53  (step t42 (cl (not (forall ((X1 $$unsorted)) (or (tptp.less_than X1 tptp.lower_bound) (tptp.less_than tptp.upper_bound X1) (tptp.in_array_bounds tptp.array X1)))) (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) :rule implies :premises (t41))
% 0.21/0.53  (step t43 (cl (or (tptp.less_than tptp.an_index tptp.lower_bound) (tptp.less_than tptp.upper_bound tptp.an_index) (tptp.in_array_bounds tptp.array tptp.an_index))) :rule resolution :premises (t42 a0))
% 0.21/0.53  (step t44 (cl (tptp.in_array_bounds tptp.array tptp.an_index)) :rule resolution :premises (t35 a6 a7 t43))
% 0.21/0.53  (step t45 (cl (not (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound)) :rule or_pos)
% 0.21/0.53  (step t46 (cl (tptp.less_than tptp.an_index tptp.lower_bound) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound)))) :rule reordering :premises (t45))
% 0.21/0.53  (step t47 (cl (=> (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X)))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t48)
% 0.21/0.53  (assume t48.a0 (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))))
% 0.21/0.53  (step t48.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X)))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index)))) :rule forall_inst :args ((:= X tptp.an_index)))
% 0.21/0.53  (step t48.t2 (cl (not (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X)))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) :rule or :premises (t48.t1))
% 0.21/0.53  (step t48.t3 (cl (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) :rule resolution :premises (t48.t2 t48.a0))
% 0.21/0.53  (step t48 (cl (not (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X)))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) :rule subproof :discharge (t48.a0))
% 0.21/0.53  (step t49 (cl (=> (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) :rule resolution :premises (t47 t48))
% 0.21/0.53  (step t50 (cl (=> (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index)))) :rule implies_neg2)
% 0.21/0.53  (step t51 (cl (=> (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (=> (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index)))) :rule resolution :premises (t49 t50))
% 0.21/0.53  (step t52 (cl (=> (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index)))) :rule contraction :premises (t51))
% 0.21/0.53  (step t53 (cl (not (forall ((X $$unsorted)) (tptp.less_than X (tptp.successor X)))) (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) :rule implies :premises (t52))
% 0.21/0.53  (step t54 (cl (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) :rule resolution :premises (t53 a3))
% 0.21/0.53  (step t55 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t56)
% 0.21/0.53  (assume t56.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))))
% 0.21/0.53  (step t56.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound)))) :rule forall_inst :args ((:= X tptp.an_index) (:= Y (tptp.successor tptp.an_index)) (:= Z tptp.lower_bound)))
% 0.21/0.53  (step t56.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) :rule or :premises (t56.t1))
% 0.21/0.53  (step t56.t3 (cl (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) :rule resolution :premises (t56.t2 t56.a0))
% 0.21/0.53  (step t56 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) :rule subproof :discharge (t56.a0))
% 0.21/0.53  (step t57 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) :rule resolution :premises (t55 t56))
% 0.21/0.53  (step t58 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) (not (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound)))) :rule implies_neg2)
% 0.21/0.53  (step t59 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound)))) :rule resolution :premises (t57 t58))
% 0.21/0.53  (step t60 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound)))) :rule contraction :premises (t59))
% 0.21/0.53  (step t61 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) :rule implies :premises (t60))
% 0.21/0.53  (step t62 (cl (or (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound)) (tptp.less_than tptp.an_index tptp.lower_bound))) :rule resolution :premises (t61 a2))
% 0.21/0.53  (step t63 (cl (not (tptp.less_than (tptp.successor tptp.an_index) tptp.lower_bound))) :rule resolution :premises (t46 a6 t54 t62))
% 0.21/0.53  (step t64 (cl (not (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))) :rule or_pos)
% 0.21/0.53  (step t65 (cl (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)) (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (not (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))))) :rule reordering :premises (t64))
% 0.21/0.53  (step t66 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t67)
% 0.21/0.53  (assume t67.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))))
% 0.21/0.53  (step t67.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))))) :rule forall_inst :args ((:= X tptp.index_of_maximal) (:= Y tptp.an_index) (:= Z (tptp.successor tptp.an_index))))
% 0.21/0.53  (step t67.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) :rule or :premises (t67.t1))
% 0.21/0.53  (step t67.t3 (cl (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) :rule resolution :premises (t67.t2 t67.a0))
% 0.21/0.53  (step t67 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) :rule subproof :discharge (t67.a0))
% 0.21/0.53  (step t68 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) :rule resolution :premises (t66 t67))
% 0.21/0.53  (step t69 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) (not (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))))) :rule implies_neg2)
% 0.21/0.53  (step t70 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))))) :rule resolution :premises (t68 t69))
% 0.21/0.53  (step t71 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))))) :rule contraction :premises (t70))
% 0.21/0.53  (step t72 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_than X Y)) (not (tptp.less_than Y Z)) (tptp.less_than X Z)))) (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) :rule implies :premises (t71))
% 0.21/0.53  (step t73 (cl (or (not (tptp.less_than tptp.index_of_maximal tptp.an_index)) (not (tptp.less_than tptp.an_index (tptp.successor tptp.an_index))) (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index)))) :rule resolution :premises (t72 a2))
% 0.21/0.53  (step t74 (cl (tptp.less_than tptp.index_of_maximal (tptp.successor tptp.an_index))) :rule resolution :premises (t65 a5 t54 t73))
% 0.21/0.53  (step t75 (cl (not (tptp.in_array_bounds tptp.array tptp.index_of_maximal)) (= tptp.maximal_value (tptp.array_value_at tptp.array tptp.index_of_maximal))) :rule or :premises (a4))
% 0.21/0.53  (step t76 (cl (= tptp.maximal_value (tptp.array_value_at tptp.array tptp.index_of_maximal))) :rule resolution :premises (t75 t33))
% 0.21/0.53  (step t77 (cl (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) :rule resolution :premises (t11 t33 a8 t44 t63 t74 t76))
% 0.21/0.53  (step t78 (cl (not (or (not (tptp.less_than (tptp.successor tptp.upper_bound) (tptp.successor tptp.an_index))) (tptp.less_than tptp.upper_bound tptp.an_index)))) :rule resolution :premises (t9 a7 t77))
% 0.21/0.53  (step t79 (cl) :rule resolution :premises (t7 t78 a1))
% 0.21/0.53  
% 0.21/0.53  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.MgyXRFbHNO/cvc5---1.0.5_16830.smt2
% 0.21/0.53  % cvc5---1.0.5 exiting
% 0.21/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------