TSTP Solution File: NUM843+2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NUM843+2 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n010.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:35:07 EDT 2024
% Result : Theorem 0.20s 0.55s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM843+2 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n010.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 : Tue May 28 02:56:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.55 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.P7PVQYhDrT/cvc5---1.0.5_32578.smt2
% 0.20/0.55 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.P7PVQYhDrT/cvc5---1.0.5_32578.smt2
% 0.20/0.55 (assume a0 (not (tptp.greater tptp.vd390 tptp.vd391)))
% 0.20/0.55 (assume a1 (not (tptp.leq tptp.vd390 tptp.vd391)))
% 0.20/0.55 (assume a2 (tptp.less tptp.vd390 (tptp.vplus tptp.vd391 tptp.v1)))
% 0.20/0.55 (assume a3 (forall ((Vd375 $$unsorted) (Vd376 $$unsorted)) (=> (tptp.greater Vd375 Vd376) (tptp.geq Vd375 (tptp.vplus Vd376 tptp.v1)))))
% 0.20/0.55 (assume a4 (forall ((Vd369 $$unsorted)) (tptp.geq Vd369 tptp.v1)))
% 0.20/0.55 (assume a5 (forall ((Vd362 $$unsorted) (Vd363 $$unsorted) (Vd365 $$unsorted) (Vd366 $$unsorted)) (=> (and (tptp.geq Vd365 Vd366) (tptp.geq Vd362 Vd363)) (tptp.geq (tptp.vplus Vd362 Vd365) (tptp.vplus Vd363 Vd366)))))
% 0.20/0.55 (assume a6 (forall ((Vd353 $$unsorted) (Vd354 $$unsorted) (Vd355 $$unsorted) (Vd356 $$unsorted)) (=> (or (and (tptp.greater Vd355 Vd356) (tptp.geq Vd353 Vd354)) (and (tptp.geq Vd355 Vd356) (tptp.greater Vd353 Vd354))) (tptp.greater (tptp.vplus Vd353 Vd355) (tptp.vplus Vd354 Vd356)))))
% 0.20/0.55 (assume a7 (forall ((Vd337 $$unsorted) (Vd338 $$unsorted) (Vd340 $$unsorted) (Vd341 $$unsorted)) (=> (and (tptp.greater Vd340 Vd341) (tptp.greater Vd337 Vd338)) (tptp.greater (tptp.vplus Vd337 Vd340) (tptp.vplus Vd338 Vd341)))))
% 0.20/0.55 (assume a8 (forall ((Vd328 $$unsorted) (Vd329 $$unsorted) (Vd330 $$unsorted)) (=> (tptp.less (tptp.vplus Vd328 Vd330) (tptp.vplus Vd329 Vd330)) (tptp.less Vd328 Vd329))))
% 0.20/0.55 (assume a9 (forall ((Vd328 $$unsorted) (Vd329 $$unsorted) (Vd330 $$unsorted)) (=> (= (tptp.vplus Vd328 Vd330) (tptp.vplus Vd329 Vd330)) (= Vd328 Vd329))))
% 0.20/0.55 (assume a10 (forall ((Vd328 $$unsorted) (Vd329 $$unsorted) (Vd330 $$unsorted)) (=> (tptp.greater (tptp.vplus Vd328 Vd330) (tptp.vplus Vd329 Vd330)) (tptp.greater Vd328 Vd329))))
% 0.20/0.55 (assume a11 (forall ((Vd301 $$unsorted) (Vd302 $$unsorted) (Vd303 $$unsorted)) (=> (tptp.less Vd301 Vd302) (tptp.less (tptp.vplus Vd301 Vd303) (tptp.vplus Vd302 Vd303)))))
% 0.20/0.55 (assume a12 (forall ((Vd301 $$unsorted) (Vd302 $$unsorted) (Vd303 $$unsorted)) (=> (= Vd301 Vd302) (= (tptp.vplus Vd301 Vd303) (tptp.vplus Vd302 Vd303)))))
% 0.20/0.55 (assume a13 (forall ((Vd301 $$unsorted) (Vd302 $$unsorted) (Vd303 $$unsorted)) (=> (tptp.greater Vd301 Vd302) (tptp.greater (tptp.vplus Vd301 Vd303) (tptp.vplus Vd302 Vd303)))))
% 0.20/0.55 (assume a14 (forall ((Vd295 $$unsorted) (Vd296 $$unsorted)) (tptp.greater (tptp.vplus Vd295 Vd296) Vd295)))
% 0.20/0.55 (assume a15 (forall ((Vd289 $$unsorted) (Vd290 $$unsorted) (Vd292 $$unsorted)) (=> (and (tptp.leq Vd290 Vd292) (tptp.leq Vd289 Vd290)) (tptp.leq Vd289 Vd292))))
% 0.20/0.55 (assume a16 (forall ((Vd281 $$unsorted) (Vd282 $$unsorted) (Vd283 $$unsorted)) (=> (or (and (tptp.less Vd282 Vd283) (tptp.leq Vd281 Vd282)) (and (tptp.leq Vd282 Vd283) (tptp.less Vd281 Vd282))) (tptp.less Vd281 Vd283))))
% 0.20/0.55 (assume a17 (forall ((Vd262 $$unsorted) (Vd263 $$unsorted) (Vd265 $$unsorted)) (=> (and (tptp.less Vd263 Vd265) (tptp.less Vd262 Vd263)) (tptp.less Vd262 Vd265))))
% 0.20/0.55 (assume a18 (forall ((Vd258 $$unsorted) (Vd259 $$unsorted)) (=> (tptp.leq Vd258 Vd259) (tptp.geq Vd259 Vd258))))
% 0.20/0.55 (assume a19 (forall ((Vd254 $$unsorted) (Vd255 $$unsorted)) (=> (tptp.geq Vd254 Vd255) (tptp.leq Vd255 Vd254))))
% 0.20/0.55 (assume a20 (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd250 Vd249)))))
% 0.20/0.55 (assume a21 (forall ((Vd244 $$unsorted) (Vd245 $$unsorted)) (= (tptp.geq Vd245 Vd244) (or (tptp.greater Vd245 Vd244) (= Vd245 Vd244)))))
% 0.20/0.55 (assume a22 (forall ((Vd226 $$unsorted) (Vd227 $$unsorted)) (=> (tptp.less Vd226 Vd227) (tptp.greater Vd227 Vd226))))
% 0.20/0.55 (assume a23 (forall ((Vd208 $$unsorted) (Vd209 $$unsorted)) (=> (tptp.greater Vd208 Vd209) (tptp.less Vd209 Vd208))))
% 0.20/0.55 (assume a24 (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204))))
% 0.20/0.55 (assume a25 (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (not (= Vd203 Vd204)) (not (tptp.less Vd203 Vd204)))))
% 0.20/0.55 (assume a26 (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (not (tptp.greater Vd203 Vd204)) (not (tptp.less Vd203 Vd204)))))
% 0.20/0.55 (assume a27 (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (not (= Vd203 Vd204)) (not (tptp.greater Vd203 Vd204)))))
% 0.20/0.55 (assume a28 (forall ((Vd198 $$unsorted) (Vd199 $$unsorted)) (= (tptp.less Vd199 Vd198) (exists ((Vd201 $$unsorted)) (= Vd198 (tptp.vplus Vd199 Vd201))))))
% 0.20/0.55 (assume a29 (forall ((Vd193 $$unsorted) (Vd194 $$unsorted)) (= (tptp.greater Vd194 Vd193) (exists ((Vd196 $$unsorted)) (= Vd194 (tptp.vplus Vd193 Vd196))))))
% 0.20/0.55 (assume a30 (forall ((Vd120 $$unsorted) (Vd121 $$unsorted)) (or (= Vd120 Vd121) (exists ((Vd123 $$unsorted)) (= Vd120 (tptp.vplus Vd121 Vd123))) (exists ((Vd125 $$unsorted)) (= Vd121 (tptp.vplus Vd120 Vd125))))))
% 0.20/0.55 (assume a31 (forall ((Vd120 $$unsorted) (Vd121 $$unsorted)) (or (not (= Vd120 Vd121)) (not (exists ((Vd125 $$unsorted)) (= Vd121 (tptp.vplus Vd120 Vd125)))))))
% 0.20/0.55 (assume a32 (forall ((Vd120 $$unsorted) (Vd121 $$unsorted)) (or (not (exists ((Vd123 $$unsorted)) (= Vd120 (tptp.vplus Vd121 Vd123)))) (not (exists ((Vd125 $$unsorted)) (= Vd121 (tptp.vplus Vd120 Vd125)))))))
% 0.20/0.55 (assume a33 (forall ((Vd120 $$unsorted) (Vd121 $$unsorted)) (or (not (= Vd120 Vd121)) (not (exists ((Vd123 $$unsorted)) (= Vd120 (tptp.vplus Vd121 Vd123)))))))
% 0.20/0.55 (assume a34 (forall ((Vd104 $$unsorted) (Vd105 $$unsorted)) (=> (not (= Vd104 Vd105)) (forall ((Vd107 $$unsorted)) (not (= (tptp.vplus Vd107 Vd104) (tptp.vplus Vd107 Vd105)))))))
% 0.20/0.55 (assume a35 (forall ((Vd92 $$unsorted) (Vd93 $$unsorted)) (not (= Vd93 (tptp.vplus Vd92 Vd93)))))
% 0.20/0.55 (assume a36 (forall ((Vd78 $$unsorted) (Vd79 $$unsorted)) (= (tptp.vplus Vd79 Vd78) (tptp.vplus Vd78 Vd79))))
% 0.20/0.55 (assume a37 (forall ((Vd68 $$unsorted) (Vd69 $$unsorted)) (= (tptp.vplus (tptp.vsucc Vd68) Vd69) (tptp.vsucc (tptp.vplus Vd68 Vd69)))))
% 0.20/0.55 (assume a38 (forall ((Vd59 $$unsorted)) (= (tptp.vplus tptp.v1 Vd59) (tptp.vsucc Vd59))))
% 0.20/0.55 (assume a39 (forall ((Vd46 $$unsorted) (Vd47 $$unsorted) (Vd48 $$unsorted)) (= (tptp.vplus (tptp.vplus Vd46 Vd47) Vd48) (tptp.vplus Vd46 (tptp.vplus Vd47 Vd48)))))
% 0.20/0.55 (assume a40 (forall ((Vd42 $$unsorted) (Vd43 $$unsorted)) (and (= (tptp.vplus Vd42 (tptp.vsucc Vd43)) (tptp.vsucc (tptp.vplus Vd42 Vd43))) (= (tptp.vplus Vd42 tptp.v1) (tptp.vsucc Vd42)))))
% 0.20/0.55 (assume a41 (forall ((Vd24 $$unsorted)) (=> (not (= Vd24 tptp.v1)) (= Vd24 (tptp.vsucc (tptp.vskolem2 Vd24))))))
% 0.20/0.55 (assume a42 (forall ((Vd16 $$unsorted)) (not (= (tptp.vsucc Vd16) Vd16))))
% 0.20/0.55 (assume a43 (forall ((Vd7 $$unsorted) (Vd8 $$unsorted)) (=> (not (= Vd7 Vd8)) (not (= (tptp.vsucc Vd7) (tptp.vsucc Vd8))))))
% 0.20/0.55 (assume a44 (forall ((Vd3 $$unsorted) (Vd4 $$unsorted)) (=> (= (tptp.vsucc Vd3) (tptp.vsucc Vd4)) (= Vd3 Vd4))))
% 0.20/0.55 (assume a45 (forall ((Vd1 $$unsorted)) (not (= (tptp.vsucc Vd1) tptp.v1))))
% 0.20/0.55 (assume a46 true)
% 0.20/0.55 (step t1 (cl (not (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391)) :rule or_pos)
% 0.20/0.55 (step t2 (cl (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391) (not (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391)))) :rule reordering :premises (t1))
% 0.20/0.55 (step t3 (cl (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)) (not (= tptp.vd390 tptp.vd391))) :rule or_neg)
% 0.20/0.55 (step t4 (cl (not (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)))) (tptp.leq tptp.vd390 tptp.vd391) (not (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)))) :rule equiv_pos1)
% 0.20/0.55 (step t5 (cl (tptp.leq tptp.vd390 tptp.vd391) (not (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391))) (not (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391))))) :rule reordering :premises (t4))
% 0.20/0.55 (step t6 (cl (not (= (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)))))) (not (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390))))) (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391))))) :rule equiv_pos2)
% 0.20/0.55 (step t7 (cl (= (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))))) :rule refl)
% 0.20/0.55 (step t8 (cl (= (tptp.leq tptp.vd390 tptp.vd391) (tptp.leq tptp.vd390 tptp.vd391))) :rule refl)
% 0.20/0.55 (step t9 (cl (= (tptp.less tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) :rule refl)
% 0.20/0.55 (step t10 (cl (= (= tptp.vd391 tptp.vd390) (= tptp.vd390 tptp.vd391))) :rule all_simplify)
% 0.20/0.55 (step t11 (cl (= (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)))) :rule cong :premises (t9 t10))
% 0.20/0.55 (step t12 (cl (= (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391))))) :rule cong :premises (t8 t11))
% 0.20/0.55 (step t13 (cl (= (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)))))) :rule cong :premises (t7 t12))
% 0.20/0.55 (step t14 (cl (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250))))) :rule implies_neg1)
% 0.20/0.55 (anchor :step t15)
% 0.20/0.55 (assume t15.a0 (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))))
% 0.20/0.55 (step t15.t1 (cl (or (not (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250))))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390))))) :rule forall_inst :args ((:= Vd249 tptp.vd391) (:= Vd250 tptp.vd390)))
% 0.20/0.55 (step t15.t2 (cl (not (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250))))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) :rule or :premises (t15.t1))
% 0.20/0.55 (step t15.t3 (cl (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) :rule resolution :premises (t15.t2 t15.a0))
% 0.20/0.55 (step t15 (cl (not (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250))))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) :rule subproof :discharge (t15.a0))
% 0.20/0.55 (step t16 (cl (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) :rule resolution :premises (t14 t15))
% 0.20/0.55 (step t17 (cl (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) (not (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390))))) :rule implies_neg2)
% 0.20/0.55 (step t18 (cl (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390)))) (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390))))) :rule resolution :premises (t16 t17))
% 0.20/0.55 (step t19 (cl (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd391 tptp.vd390))))) :rule contraction :premises (t18))
% 0.20/0.55 (step t20 (cl (=> (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391))))) :rule resolution :premises (t6 t13 t19))
% 0.20/0.55 (step t21 (cl (not (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250))))) (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)))) :rule implies :premises (t20))
% 0.20/0.55 (step t22 (cl (not (= (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd250 Vd249)))) (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))))) (not (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd250 Vd249))))) (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250))))) :rule equiv_pos2)
% 0.20/0.55 (anchor :step t23 :args ((Vd249 $$unsorted) (:= Vd249 Vd249) (Vd250 $$unsorted) (:= Vd250 Vd250)))
% 0.20/0.55 (step t23.t1 (cl (= Vd249 Vd249)) :rule refl)
% 0.20/0.55 (step t23.t2 (cl (= Vd250 Vd250)) :rule refl)
% 0.20/0.55 (step t23.t3 (cl (= (tptp.leq Vd250 Vd249) (tptp.leq Vd250 Vd249))) :rule refl)
% 0.20/0.55 (step t23.t4 (cl (= (tptp.less Vd250 Vd249) (tptp.less Vd250 Vd249))) :rule refl)
% 0.20/0.55 (step t23.t5 (cl (= (= Vd250 Vd249) (= Vd249 Vd250))) :rule all_simplify)
% 0.20/0.55 (step t23.t6 (cl (= (or (tptp.less Vd250 Vd249) (= Vd250 Vd249)) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))) :rule cong :premises (t23.t4 t23.t5))
% 0.20/0.55 (step t23.t7 (cl (= (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd250 Vd249))) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250))))) :rule cong :premises (t23.t3 t23.t6))
% 0.20/0.55 (step t23 (cl (= (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd250 Vd249)))) (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250)))))) :rule bind)
% 0.20/0.55 (step t24 (cl (forall ((Vd249 $$unsorted) (Vd250 $$unsorted)) (= (tptp.leq Vd250 Vd249) (or (tptp.less Vd250 Vd249) (= Vd249 Vd250))))) :rule resolution :premises (t22 t23 a20))
% 0.20/0.55 (step t25 (cl (= (tptp.leq tptp.vd390 tptp.vd391) (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)))) :rule resolution :premises (t21 t24))
% 0.20/0.55 (step t26 (cl (not (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)))) :rule resolution :premises (t5 a1 t25))
% 0.20/0.55 (step t27 (cl (not (= tptp.vd390 tptp.vd391))) :rule resolution :premises (t3 t26))
% 0.20/0.55 (step t28 (cl (or (tptp.less tptp.vd390 tptp.vd391) (= tptp.vd390 tptp.vd391)) (not (tptp.less tptp.vd390 tptp.vd391))) :rule or_neg)
% 0.20/0.55 (step t29 (cl (not (tptp.less tptp.vd390 tptp.vd391))) :rule resolution :premises (t28 t26))
% 0.20/0.55 (step t30 (cl (=> (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204)))) :rule implies_neg1)
% 0.20/0.55 (anchor :step t31)
% 0.20/0.55 (assume t31.a0 (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204))))
% 0.20/0.55 (step t31.t1 (cl (or (not (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204)))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391)))) :rule forall_inst :args ((:= Vd203 tptp.vd390) (:= Vd204 tptp.vd391)))
% 0.20/0.55 (step t31.t2 (cl (not (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204)))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) :rule or :premises (t31.t1))
% 0.20/0.55 (step t31.t3 (cl (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) :rule resolution :premises (t31.t2 t31.a0))
% 0.20/0.55 (step t31 (cl (not (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204)))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) :rule subproof :discharge (t31.a0))
% 0.20/0.55 (step t32 (cl (=> (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) :rule resolution :premises (t30 t31))
% 0.20/0.55 (step t33 (cl (=> (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) (not (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391)))) :rule implies_neg2)
% 0.20/0.55 (step t34 (cl (=> (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) (=> (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391)))) :rule resolution :premises (t32 t33))
% 0.20/0.55 (step t35 (cl (=> (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391)))) :rule contraction :premises (t34))
% 0.20/0.55 (step t36 (cl (not (forall ((Vd203 $$unsorted) (Vd204 $$unsorted)) (or (= Vd203 Vd204) (tptp.greater Vd203 Vd204) (tptp.less Vd203 Vd204)))) (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) :rule implies :premises (t35))
% 0.20/0.55 (step t37 (cl (or (= tptp.vd390 tptp.vd391) (tptp.greater tptp.vd390 tptp.vd391) (tptp.less tptp.vd390 tptp.vd391))) :rule resolution :premises (t36 a24))
% 0.20/0.55 (step t38 (cl) :rule resolution :premises (t2 t27 t29 t37 a0))
% 0.20/0.55
% 0.20/0.55 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.P7PVQYhDrT/cvc5---1.0.5_32578.smt2
% 0.20/0.55 % cvc5---1.0.5 exiting
% 0.20/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------