TSTP Solution File: NUM531+2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NUM531+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n020.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:33:54 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM531+2 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue May 28 02:43:39 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.52 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.1Bk4i5hgsm/cvc5---1.0.5_21627.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.1Bk4i5hgsm/cvc5---1.0.5_21627.smt2
% 0.20/0.52 (assume a0 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) true)))
% 0.20/0.52 (assume a1 (forall ((W0 $$unsorted)) (=> (tptp.aElement0 W0) true)))
% 0.20/0.52 (assume a2 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (forall ((W1 $$unsorted)) (=> (tptp.aElementOf0 W1 W0) (tptp.aElement0 W1))))))
% 0.20/0.52 (assume a3 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (=> (tptp.isFinite0 W0) true))))
% 0.20/0.52 (assume a4 (forall ((W0 $$unsorted)) (= (= W0 tptp.slcrc0) (and (tptp.aSet0 W0) (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0)))))))
% 0.20/0.52 (assume a5 (tptp.isFinite0 tptp.slcrc0))
% 0.20/0.52 (assume a6 (forall ((W0 $$unsorted)) (=> (tptp.aSet0 W0) (=> (tptp.isCountable0 W0) true))))
% 0.20/0.52 (assume a7 (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))))
% 0.20/0.52 (assume a8 (not (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (= W0 tptp.slcrc0)))))))
% 0.20/0.52 (assume a9 true)
% 0.20/0.52 (step t1 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0))))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t2)
% 0.20/0.52 (assume t2.a0 (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))))
% 0.20/0.52 (step t2.t1 (cl (or (not (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0))))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0))))) :rule forall_inst :args ((:= W0 tptp.slcrc0)))
% 0.20/0.52 (step t2.t2 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0))))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) :rule or :premises (t2.t1))
% 0.20/0.52 (step t2.t3 (cl (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.20/0.52 (step t2 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0))))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) :rule subproof :discharge (t2.a0))
% 0.20/0.52 (step t3 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) :rule resolution :premises (t1 t2))
% 0.20/0.52 (step t4 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) (not (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0))))) :rule implies_neg2)
% 0.20/0.52 (step t5 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) (=> (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0))))) :rule resolution :premises (t3 t4))
% 0.20/0.52 (step t6 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0))))) :rule contraction :premises (t5))
% 0.20/0.52 (step t7 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0))))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) :rule implies :premises (t6))
% 0.20/0.52 (step t8 (cl (not (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)))) (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0))) :rule or_pos)
% 0.20/0.52 (step t9 (cl (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0)) (not (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0))))) :rule reordering :premises (t8))
% 0.20/0.52 (step t10 (cl (not (not (not (tptp.aSet0 tptp.slcrc0)))) (tptp.aSet0 tptp.slcrc0)) :rule not_not)
% 0.20/0.52 (step t11 (cl (not (= (not (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (= W0 tptp.slcrc0)))))) (not (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0)))))))) (not (not (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (= W0 tptp.slcrc0))))))) (not (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0))))))) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t12 :args ((W0 $$unsorted) (:= W0 W0)))
% 0.20/0.52 (step t12.t1 (cl (= W0 W0)) :rule refl)
% 0.20/0.52 (step t12.t2 (cl (= (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (and (tptp.aSet0 W0) (tptp.isCountable0 W0)))) :rule refl)
% 0.20/0.52 (step t12.t3 (cl (= (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0)))))) :rule all_simplify)
% 0.20/0.52 (step t12.t4 (cl (= (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (not (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))))))) :rule cong :premises (t12.t3))
% 0.20/0.52 (step t12.t5 (cl (= (not (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))))) (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))))) :rule all_simplify)
% 0.20/0.52 (step t12.t6 (cl (= (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))))) :rule trans :premises (t12.t4 t12.t5))
% 0.20/0.52 (step t12.t7 (cl (= (= W0 tptp.slcrc0) (= tptp.slcrc0 W0))) :rule all_simplify)
% 0.20/0.52 (step t12.t8 (cl (= (and (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (= W0 tptp.slcrc0)) (and (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))) (= tptp.slcrc0 W0)))) :rule cong :premises (t12.t6 t12.t7))
% 0.20/0.52 (step t12.t9 (cl (= (not (and (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (= W0 tptp.slcrc0))) (not (and (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))) (= tptp.slcrc0 W0))))) :rule cong :premises (t12.t8))
% 0.20/0.52 (step t12.t10 (cl (= (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (= W0 tptp.slcrc0)))) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))) (= tptp.slcrc0 W0)))))) :rule cong :premises (t12.t2 t12.t9))
% 0.20/0.52 (step t12 (cl (= (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (= W0 tptp.slcrc0))))) (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))) (= tptp.slcrc0 W0))))))) :rule bind)
% 0.20/0.52 (step t13 (cl (= (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))) (= tptp.slcrc0 W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0)))) (not (= tptp.slcrc0 W0)))))) :rule all_simplify)
% 0.20/0.52 (step t14 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0)))) (not (= tptp.slcrc0 W0)))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0)))) (not (= tptp.slcrc0 tptp.slcrc0))))) :rule all_simplify)
% 0.20/0.52 (step t15 (cl (= (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.aSet0 tptp.slcrc0)))) :rule refl)
% 0.20/0.52 (step t16 (cl (= (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)))) :rule refl)
% 0.20/0.52 (step t17 (cl (= (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0)))) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0)))))) :rule refl)
% 0.20/0.52 (step t18 (cl (= (= tptp.slcrc0 tptp.slcrc0) true)) :rule all_simplify)
% 0.20/0.52 (step t19 (cl (= (not (= tptp.slcrc0 tptp.slcrc0)) (not true))) :rule cong :premises (t18))
% 0.20/0.52 (step t20 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.52 (step t21 (cl (= (not (= tptp.slcrc0 tptp.slcrc0)) false)) :rule trans :premises (t19 t20))
% 0.20/0.52 (step t22 (cl (= (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0)))) (not (= tptp.slcrc0 tptp.slcrc0))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0)))) false))) :rule cong :premises (t15 t16 t17 t21))
% 0.20/0.52 (step t23 (cl (= (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0)))) false) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0))))))) :rule all_simplify)
% 0.20/0.52 (step t24 (cl (= (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0)))) (not (= tptp.slcrc0 tptp.slcrc0))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0))))))) :rule trans :premises (t22 t23))
% 0.20/0.52 (step t25 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0)))) (not (= tptp.slcrc0 W0)))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0))))))) :rule trans :premises (t14 t24))
% 0.20/0.52 (step t26 (cl (= (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 W0))) (= tptp.slcrc0 W0))))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0))))))) :rule trans :premises (t13 t25))
% 0.20/0.52 (step t27 (cl (= (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (= W0 tptp.slcrc0))))) (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0))))))) :rule trans :premises (t12 t26))
% 0.20/0.52 (step t28 (cl (= (not (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (and (not (exists ((W1 $$unsorted)) (tptp.aElementOf0 W1 W0))) (= W0 tptp.slcrc0)))))) (not (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0)))))))) :rule cong :premises (t27))
% 0.20/0.52 (step t29 (cl (not (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (forall ((W1 $$unsorted)) (not (tptp.aElementOf0 W1 tptp.slcrc0))))))) :rule resolution :premises (t11 t28 a8))
% 0.20/0.52 (step t30 (cl (not (not (tptp.aSet0 tptp.slcrc0)))) :rule not_or :premises (t29))
% 0.20/0.53 (step t31 (cl (tptp.aSet0 tptp.slcrc0)) :rule resolution :premises (t10 t30))
% 0.20/0.53 (step t32 (cl (not (not (not (tptp.isCountable0 tptp.slcrc0)))) (tptp.isCountable0 tptp.slcrc0)) :rule not_not)
% 0.20/0.53 (step t33 (cl (not (not (tptp.isCountable0 tptp.slcrc0)))) :rule not_or :premises (t29))
% 0.20/0.53 (step t34 (cl (tptp.isCountable0 tptp.slcrc0)) :rule resolution :premises (t32 t33))
% 0.20/0.53 (step t35 (cl (not (or (not (tptp.aSet0 tptp.slcrc0)) (not (tptp.isCountable0 tptp.slcrc0)) (not (tptp.isFinite0 tptp.slcrc0))))) :rule resolution :premises (t9 t31 t34 a5))
% 0.20/0.53 (step t36 (cl (not (= (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))) (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))))) (not (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0))))) :rule equiv_pos2)
% 0.20/0.53 (step t37 (cl (= (forall ((W0 $$unsorted)) (=> (and (tptp.aSet0 W0) (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))) (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0)))))) :rule all_simplify)
% 0.20/0.53 (step t38 (cl (forall ((W0 $$unsorted)) (or (not (tptp.aSet0 W0)) (not (tptp.isCountable0 W0)) (not (tptp.isFinite0 W0))))) :rule resolution :premises (t36 t37 a7))
% 0.20/0.53 (step t39 (cl) :rule resolution :premises (t7 t35 t38))
% 0.20/0.53
% 0.20/0.53 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.1Bk4i5hgsm/cvc5---1.0.5_21627.smt2
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------