TSTP Solution File: LAT381+3 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : LAT381+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n018.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 17:23:05 EDT 2024
% Result : Theorem 0.20s 0.54s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LAT381+3 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 27 13:25:54 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.54 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.gogwpz8PcT/cvc5---1.0.5_21507.smt2
% 0.20/0.54 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.gogwpz8PcT/cvc5---1.0.5_21507.smt2
% 0.20/0.54 (assume a0 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) true)))
% 0.20/0.54 (assume a1 (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) true)))
% 0.20/0.54 (assume a2 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1))))))
% 0.20/0.54 (assume a3 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (= (tptp.isEmpty0 W0) (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0)))))))
% 0.20/0.54 (assume a4 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (= (tptp.aSubsetOf0 W1 W0) (and (tptp.aSet0 W1) (forall ((W2 $$unsorted)) (=> (tptp.aElementOf0 W2 W1) (tptp.aElementOf0 W2 W0)))))))))
% 0.20/0.54 (assume a5 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (=> (tptp.sdtlseqdt0 W0 W1) true))))
% 0.20/0.54 (assume a6 (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) (tptp.sdtlseqdt0 W0 W0))))
% 0.20/0.54 (assume a7 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (=> (and (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))))
% 0.20/0.54 (assume a8 (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1) (tptp.aElement0 W2)) (=> (and (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 W1 W2)) (tptp.sdtlseqdt0 W0 W2)))))
% 0.20/0.54 (assume a9 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted)) (= (tptp.aLowerBoundOfIn0 W2 W1 W0) (and (tptp.aElementOf0 W2 W0) (forall ((W3 $$unsorted)) (=> (tptp.aElementOf0 W3 W1) (tptp.sdtlseqdt0 W2 W3)))))))))))
% 0.20/0.54 (assume a10 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted)) (= (tptp.aUpperBoundOfIn0 W2 W1 W0) (and (tptp.aElementOf0 W2 W0) (forall ((W3 $$unsorted)) (=> (tptp.aElementOf0 W3 W1) (tptp.sdtlseqdt0 W3 W2)))))))))))
% 0.20/0.54 (assume a11 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted)) (= (tptp.aInfimumOfIn0 W2 W1 W0) (and (tptp.aElementOf0 W2 W0) (tptp.aLowerBoundOfIn0 W2 W1 W0) (forall ((W3 $$unsorted)) (=> (tptp.aLowerBoundOfIn0 W3 W1 W0) (tptp.sdtlseqdt0 W3 W2)))))))))))
% 0.20/0.54 (assume a12 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aSubsetOf0 W1 W0) (forall ((W2 $$unsorted)) (= (tptp.aSupremumOfIn0 W2 W1 W0) (and (tptp.aElementOf0 W2 W0) (tptp.aUpperBoundOfIn0 W2 W1 W0) (forall ((W3 $$unsorted)) (=> (tptp.aUpperBoundOfIn0 W3 W1 W0) (tptp.sdtlseqdt0 W2 W3)))))))))))
% 0.20/0.54 (assume a13 (tptp.aSet0 tptp.xT))
% 0.20/0.54 (assume a14 (and (tptp.aSet0 tptp.xS) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.aElementOf0 W0 tptp.xT))) (tptp.aSubsetOf0 tptp.xS tptp.xT)))
% 0.20/0.54 (assume a15 (and (tptp.aElementOf0 tptp.xu tptp.xT) (tptp.aElementOf0 tptp.xu tptp.xT) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xu))) (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0))) (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xv))) (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0))) (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT)))
% 0.20/0.54 (assume a16 (not (= tptp.xu tptp.xv)))
% 0.20/0.54 (assume a17 true)
% 0.20/0.54 (step t1 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t2)
% 0.20/0.54 (assume t2.a0 (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))))
% 0.20/0.54 (step t2.t1 (cl (or (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv)))) :rule forall_inst :args ((:= W0 tptp.xu) (:= W1 tptp.xv)))
% 0.20/0.54 (step t2.t2 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) :rule or :premises (t2.t1))
% 0.20/0.54 (step t2.t3 (cl (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) :rule resolution :premises (t2.t2 t2.a0))
% 0.20/0.54 (step t2 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) :rule subproof :discharge (t2.a0))
% 0.20/0.54 (step t3 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) :rule resolution :premises (t1 t2))
% 0.20/0.54 (step t4 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) (not (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv)))) :rule implies_neg2)
% 0.20/0.54 (step t5 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv)))) :rule resolution :premises (t3 t4))
% 0.20/0.54 (step t6 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv)))) :rule contraction :premises (t5))
% 0.20/0.54 (step t7 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) :rule implies :premises (t6))
% 0.20/0.54 (step t8 (cl (not (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv))) (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv)) :rule or_pos)
% 0.20/0.54 (step t9 (cl (= tptp.xu tptp.xv) (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (not (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv)))) :rule reordering :premises (t8))
% 0.20/0.54 (step t10 (cl (not (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu)) :rule or_pos)
% 0.20/0.54 (step t11 (cl (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu) (not (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu)))) :rule reordering :premises (t10))
% 0.20/0.54 (step t12 (cl (not (= (and (tptp.aElementOf0 tptp.xu tptp.xT) (tptp.aElementOf0 tptp.xu tptp.xT) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xu))) (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0))) (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xv))) (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0))) (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT)) (and (tptp.aElementOf0 tptp.xu tptp.xT) (tptp.aElementOf0 tptp.xu tptp.xT) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xu))) (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xv))) (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT)))) (not (and (tptp.aElementOf0 tptp.xu tptp.xT) (tptp.aElementOf0 tptp.xu tptp.xT) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xu))) (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0))) (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xv))) (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0))) (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT))) (and (tptp.aElementOf0 tptp.xu tptp.xT) (tptp.aElementOf0 tptp.xu tptp.xT) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xu))) (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xv))) (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT))) :rule equiv_pos2)
% 0.20/0.54 (step t13 (cl (= (tptp.aElementOf0 tptp.xu tptp.xT) (tptp.aElementOf0 tptp.xu tptp.xT))) :rule refl)
% 0.20/0.54 (step t14 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xu))) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xu))))) :rule all_simplify)
% 0.20/0.54 (step t15 (cl (= (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) :rule refl)
% 0.20/0.54 (anchor :step t16 :args ((W0 $$unsorted) (:= W0 W0)))
% 0.20/0.54 (step t16.t1 (cl (= W0 W0)) :rule refl)
% 0.20/0.54 (step t16.t2 (cl (= (tptp.aElementOf0 W0 tptp.xT) (tptp.aElementOf0 W0 tptp.xT))) :rule refl)
% 0.20/0.54 (step t16.t3 (cl (= (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0))) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) :rule all_simplify)
% 0.20/0.54 (step t16.t4 (cl (= (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))))) :rule cong :premises (t16.t2 t16.t3))
% 0.20/0.54 (step t16.t5 (cl (= (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) :rule refl)
% 0.20/0.54 (step t16.t6 (cl (= (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)))) :rule cong :premises (t16.t4 t16.t5))
% 0.20/0.54 (step t16.t7 (cl (= (tptp.sdtlseqdt0 tptp.xu W0) (tptp.sdtlseqdt0 tptp.xu W0))) :rule refl)
% 0.20/0.54 (step t16.t8 (cl (= (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0)))) :rule cong :premises (t16.t6 t16.t7))
% 0.20/0.54 (step t16 (cl (= (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0))) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0))))) :rule bind)
% 0.20/0.54 (step t17 (cl (= (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0))) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))))) :rule all_simplify)
% 0.20/0.54 (step t18 (cl (= (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0))) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))))) :rule trans :premises (t16 t17))
% 0.20/0.54 (step t19 (cl (= (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT))) :rule refl)
% 0.20/0.54 (step t20 (cl (= (tptp.aElementOf0 tptp.xv tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT))) :rule refl)
% 0.20/0.54 (step t21 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xv))) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xv))))) :rule all_simplify)
% 0.20/0.54 (step t22 (cl (= (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT) (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) :rule refl)
% 0.20/0.54 (anchor :step t23 :args ((W0 $$unsorted) (:= W0 W0)))
% 0.20/0.54 (step t23.t1 (cl (= W0 W0)) :rule refl)
% 0.20/0.54 (step t23.t2 (cl (= (tptp.aElementOf0 W0 tptp.xT) (tptp.aElementOf0 W0 tptp.xT))) :rule refl)
% 0.20/0.54 (step t23.t3 (cl (= (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0))) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) :rule all_simplify)
% 0.20/0.54 (step t23.t4 (cl (= (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))))) :rule cong :premises (t23.t2 t23.t3))
% 0.20/0.54 (step t23.t5 (cl (= (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) :rule refl)
% 0.20/0.54 (step t23.t6 (cl (= (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)))) :rule cong :premises (t23.t4 t23.t5))
% 0.20/0.54 (step t23.t7 (cl (= (tptp.sdtlseqdt0 tptp.xv W0) (tptp.sdtlseqdt0 tptp.xv W0))) :rule refl)
% 0.20/0.54 (step t23.t8 (cl (= (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0)))) :rule cong :premises (t23.t6 t23.t7))
% 0.20/0.54 (step t23 (cl (= (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0))) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0))))) :rule bind)
% 0.20/0.54 (step t24 (cl (= (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0))) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))))) :rule all_simplify)
% 0.20/0.54 (step t25 (cl (= (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0))) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))))) :rule trans :premises (t23 t24))
% 0.20/0.54 (step t26 (cl (= (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT) (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT))) :rule refl)
% 0.20/0.54 (step t27 (cl (= (and (tptp.aElementOf0 tptp.xu tptp.xT) (tptp.aElementOf0 tptp.xu tptp.xT) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xu))) (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xu W0))) (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (forall ((W0 $$unsorted)) (=> (tptp.aElementOf0 W0 tptp.xS) (tptp.sdtlseqdt0 W0 tptp.xv))) (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (=> (or (and (tptp.aElementOf0 W0 tptp.xT) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 tptp.xS) (tptp.sdtlseqdt0 W1 W0)))) (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT)) (tptp.sdtlseqdt0 tptp.xv W0))) (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT)) (and (tptp.aElementOf0 tptp.xu tptp.xT) (tptp.aElementOf0 tptp.xu tptp.xT) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xu))) (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xv))) (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT)))) :rule cong :premises (t13 t13 t14 t15 t18 t19 t20 t20 t21 t22 t25 t26))
% 0.20/0.54 (step t28 (cl (and (tptp.aElementOf0 tptp.xu tptp.xT) (tptp.aElementOf0 tptp.xu tptp.xT) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xu))) (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (tptp.aSupremumOfIn0 tptp.xu tptp.xS tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (tptp.aElementOf0 tptp.xv tptp.xT) (forall ((W0 $$unsorted)) (or (not (tptp.aElementOf0 W0 tptp.xS)) (tptp.sdtlseqdt0 W0 tptp.xv))) (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (tptp.aSupremumOfIn0 tptp.xv tptp.xS tptp.xT))) :rule resolution :premises (t12 t27 a15))
% 0.20/0.54 (step t29 (cl (tptp.aElementOf0 tptp.xu tptp.xT)) :rule and :premises (t28))
% 0.20/0.54 (step t30 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t31)
% 0.20/0.54 (assume t31.a0 (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))))
% 0.20/0.54 (step t31.t1 (cl (or (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu)))) :rule forall_inst :args ((:= W0 tptp.xT) (:= BOUND_VARIABLE_852 tptp.xu)))
% 0.20/0.54 (step t31.t2 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) :rule or :premises (t31.t1))
% 0.20/0.54 (step t31.t3 (cl (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) :rule resolution :premises (t31.t2 t31.a0))
% 0.20/0.54 (step t31 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) :rule subproof :discharge (t31.a0))
% 0.20/0.54 (step t32 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) :rule resolution :premises (t30 t31))
% 0.20/0.54 (step t33 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) (not (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu)))) :rule implies_neg2)
% 0.20/0.54 (step t34 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu)))) :rule resolution :premises (t32 t33))
% 0.20/0.54 (step t35 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu)))) :rule contraction :premises (t34))
% 0.20/0.54 (step t36 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) :rule implies :premises (t35))
% 0.20/0.54 (step t37 (cl (not (= (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))))) (not (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1)))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) :rule equiv_pos2)
% 0.20/0.54 (anchor :step t38 :args ((W0 $$unsorted) (:= W0 W0)))
% 0.20/0.54 (step t38.t1 (cl (= W0 W0)) :rule refl)
% 0.20/0.54 (step t38.t2 (cl (= (tptp.aSet0 W0) (tptp.aSet0 W0))) :rule refl)
% 0.20/0.54 (step t38.t3 (cl (= (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1))) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 W0)) (tptp.aElement0 W1))))) :rule all_simplify)
% 0.20/0.54 (step t38.t4 (cl (= (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1)))) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 W0)) (tptp.aElement0 W1)))))) :rule cong :premises (t38.t2 t38.t3))
% 0.20/0.54 (step t38 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1))))) (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 W0)) (tptp.aElement0 W1))))))) :rule bind)
% 0.20/0.54 (step t39 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 W0)) (tptp.aElement0 W1))))) (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 W0)) (tptp.aElement0 W1))))))) :rule all_simplify)
% 0.20/0.54 (step t40 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 W0)) (tptp.aElement0 W1))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (or (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))))) :rule all_simplify)
% 0.20/0.54 (anchor :step t41 :args ((W0 $$unsorted) (:= W0 W0) (BOUND_VARIABLE_852 $$unsorted) (:= BOUND_VARIABLE_852 BOUND_VARIABLE_852)))
% 0.20/0.54 (step t41.t1 (cl (= W0 W0)) :rule refl)
% 0.20/0.54 (step t41.t2 (cl (= BOUND_VARIABLE_852 BOUND_VARIABLE_852)) :rule refl)
% 0.20/0.54 (step t41.t3 (cl (= (or (not (tptp.aSet0 W0)) (or (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) :rule all_simplify)
% 0.20/0.54 (step t41 (cl (= (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (or (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))))) :rule bind)
% 0.20/0.54 (step t42 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 W0)) (tptp.aElement0 W1))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))))) :rule trans :premises (t40 t41))
% 0.20/0.54 (step t43 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 W0)) (tptp.aElement0 W1))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))))) :rule trans :premises (t39 t42))
% 0.20/0.54 (step t44 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))))) :rule trans :premises (t38 t43))
% 0.20/0.54 (step t45 (cl (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) :rule resolution :premises (t37 t44 a2))
% 0.20/0.54 (step t46 (cl (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xu tptp.xT)) (tptp.aElement0 tptp.xu))) :rule resolution :premises (t36 t45))
% 0.20/0.54 (step t47 (cl (tptp.aElement0 tptp.xu)) :rule resolution :premises (t11 a13 t29 t46))
% 0.20/0.54 (step t48 (cl (not (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv)) :rule or_pos)
% 0.20/0.54 (step t49 (cl (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv) (not (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv)))) :rule reordering :premises (t48))
% 0.20/0.54 (step t50 (cl (tptp.aElementOf0 tptp.xv tptp.xT)) :rule and :premises (t28))
% 0.20/0.54 (step t51 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t52)
% 0.20/0.54 (assume t52.a0 (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))))
% 0.20/0.54 (step t52.t1 (cl (or (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv)))) :rule forall_inst :args ((:= W0 tptp.xT) (:= BOUND_VARIABLE_852 tptp.xv)))
% 0.20/0.54 (step t52.t2 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) :rule or :premises (t52.t1))
% 0.20/0.54 (step t52.t3 (cl (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) :rule resolution :premises (t52.t2 t52.a0))
% 0.20/0.54 (step t52 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) :rule subproof :discharge (t52.a0))
% 0.20/0.54 (step t53 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) :rule resolution :premises (t51 t52))
% 0.20/0.54 (step t54 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) (not (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv)))) :rule implies_neg2)
% 0.20/0.54 (step t55 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv)))) :rule resolution :premises (t53 t54))
% 0.20/0.54 (step t56 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv)))) :rule contraction :premises (t55))
% 0.20/0.54 (step t57 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_852 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.aElementOf0 BOUND_VARIABLE_852 W0)) (tptp.aElement0 BOUND_VARIABLE_852)))) (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) :rule implies :premises (t56))
% 0.20/0.54 (step t58 (cl (or (not (tptp.aSet0 tptp.xT)) (not (tptp.aElementOf0 tptp.xv tptp.xT)) (tptp.aElement0 tptp.xv))) :rule resolution :premises (t57 t45))
% 0.20/0.54 (step t59 (cl (tptp.aElement0 tptp.xv)) :rule resolution :premises (t49 a13 t50 t58))
% 0.20/0.54 (step t60 (cl (not (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv)) :rule or_pos)
% 0.20/0.54 (step t61 (cl (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv) (not (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv)))) :rule reordering :premises (t60))
% 0.20/0.54 (step t62 (cl (not (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT)))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) :rule and_pos)
% 0.20/0.54 (step t63 (cl (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT)) (not (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))))) :rule reordering :premises (t62))
% 0.20/0.54 (step t64 (cl (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT)) :rule and :premises (t28))
% 0.20/0.54 (step t65 (cl (not (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))))) :rule resolution :premises (t63 t64))
% 0.20/0.54 (step t66 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0)))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t67)
% 0.20/0.54 (assume t67.a0 (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))))
% 0.20/0.54 (step t67.t1 (cl (or (not (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0)))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv)))) :rule forall_inst :args ((:= W0 tptp.xv)))
% 0.20/0.54 (step t67.t2 (cl (not (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0)))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) :rule or :premises (t67.t1))
% 0.20/0.54 (step t67.t3 (cl (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) :rule resolution :premises (t67.t2 t67.a0))
% 0.20/0.54 (step t67 (cl (not (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0)))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) :rule subproof :discharge (t67.a0))
% 0.20/0.54 (step t68 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) :rule resolution :premises (t66 t67))
% 0.20/0.54 (step t69 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) (not (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv)))) :rule implies_neg2)
% 0.20/0.54 (step t70 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv)))) :rule resolution :premises (t68 t69))
% 0.20/0.54 (step t71 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv)))) :rule contraction :premises (t70))
% 0.20/0.54 (step t72 (cl (not (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0)))) (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) :rule implies :premises (t71))
% 0.20/0.54 (step t73 (cl (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu W0)))) :rule and :premises (t28))
% 0.20/0.54 (step t74 (cl (or (and (or (not (tptp.aElementOf0 tptp.xv tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xv))))) (not (tptp.aUpperBoundOfIn0 tptp.xv tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xu tptp.xv))) :rule resolution :premises (t72 t73))
% 0.20/0.54 (step t75 (cl (tptp.sdtlseqdt0 tptp.xu tptp.xv)) :rule resolution :premises (t61 t65 t74))
% 0.20/0.54 (step t76 (cl (not (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu)) :rule or_pos)
% 0.20/0.54 (step t77 (cl (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu) (not (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu)))) :rule reordering :premises (t76))
% 0.20/0.54 (step t78 (cl (not (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT)))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) :rule and_pos)
% 0.20/0.54 (step t79 (cl (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT)) (not (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))))) :rule reordering :premises (t78))
% 0.20/0.54 (step t80 (cl (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT)) :rule and :premises (t28))
% 0.20/0.54 (step t81 (cl (not (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))))) :rule resolution :premises (t79 t80))
% 0.20/0.54 (step t82 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0)))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t83)
% 0.20/0.54 (assume t83.a0 (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))))
% 0.20/0.54 (step t83.t1 (cl (or (not (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0)))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu)))) :rule forall_inst :args ((:= W0 tptp.xu)))
% 0.20/0.54 (step t83.t2 (cl (not (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0)))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) :rule or :premises (t83.t1))
% 0.20/0.54 (step t83.t3 (cl (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) :rule resolution :premises (t83.t2 t83.a0))
% 0.20/0.54 (step t83 (cl (not (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0)))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) :rule subproof :discharge (t83.a0))
% 0.20/0.54 (step t84 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) :rule resolution :premises (t82 t83))
% 0.20/0.54 (step t85 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) (not (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu)))) :rule implies_neg2)
% 0.20/0.54 (step t86 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu)))) :rule resolution :premises (t84 t85))
% 0.20/0.54 (step t87 (cl (=> (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu)))) :rule contraction :premises (t86))
% 0.20/0.54 (step t88 (cl (not (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0)))) (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) :rule implies :premises (t87))
% 0.20/0.54 (step t89 (cl (forall ((W0 $$unsorted)) (or (and (or (not (tptp.aElementOf0 W0 tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 W0))))) (not (tptp.aUpperBoundOfIn0 W0 tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv W0)))) :rule and :premises (t28))
% 0.20/0.55 (step t90 (cl (or (and (or (not (tptp.aElementOf0 tptp.xu tptp.xT)) (not (forall ((W1 $$unsorted)) (or (not (tptp.aElementOf0 W1 tptp.xS)) (tptp.sdtlseqdt0 W1 tptp.xu))))) (not (tptp.aUpperBoundOfIn0 tptp.xu tptp.xS tptp.xT))) (tptp.sdtlseqdt0 tptp.xv tptp.xu))) :rule resolution :premises (t88 t89))
% 0.20/0.55 (step t91 (cl (tptp.sdtlseqdt0 tptp.xv tptp.xu)) :rule resolution :premises (t77 t81 t90))
% 0.20/0.55 (step t92 (cl (not (or (not (tptp.aElement0 tptp.xu)) (not (tptp.aElement0 tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xu tptp.xv)) (not (tptp.sdtlseqdt0 tptp.xv tptp.xu)) (= tptp.xu tptp.xv)))) :rule resolution :premises (t9 a16 t47 t59 t75 t91))
% 0.20/0.55 (step t93 (cl (not (= (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (=> (and (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))))) (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (=> (and (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) :rule equiv_pos2)
% 0.20/0.55 (step t94 (cl (= (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aElement0 W0) (tptp.aElement0 W1)) (=> (and (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1))))) :rule all_simplify)
% 0.20/0.55 (step t95 (cl (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aElement0 W0)) (not (tptp.aElement0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (not (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) :rule resolution :premises (t93 t94 a7))
% 0.20/0.55 (step t96 (cl) :rule resolution :premises (t7 t92 t95))
% 0.20/0.55
% 0.20/0.55 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.gogwpz8PcT/cvc5---1.0.5_21507.smt2
% 0.20/0.55 % cvc5---1.0.5 exiting
% 0.20/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------