TSTP Solution File: LCL644+1.010 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : LCL644+1.010 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n003.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 : Thu Aug 31 07:02:39 EDT 2023
% Result : Theorem 0.21s 0.56s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL644+1.010 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri Aug 25 00:19:38 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.56 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.SoPGVkzavo/cvc5---1.0.5_24500.p...
% 0.21/0.56 ------- get file name : TPTP file name is LCL644+1.010
% 0.21/0.56 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_24500.smt2...
% 0.21/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.56 % SZS status Theorem for LCL644+1.010
% 0.21/0.56 % SZS output start Proof for LCL644+1.010
% 0.21/0.56 (
% 0.21/0.56 (let ((_let_1 (not (not (exists ((X $$unsorted)) (not (or (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p11 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p11 X))))) (tptp.p10 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p10 Y))) (or (not (tptp.r1 X Y)) (tptp.p11 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p10 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p10 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p11 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p11 Y))))) (tptp.p10 X))) (tptp.p11 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p10 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p11 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p11 X))))) (tptp.p10 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p10 X))) (or (not (tptp.r1 Y X)) (tptp.p11 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p10 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p10 Y))) (let ((_let_2 (tptp.p11 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p11 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p10 X))) _let_1)))))))))) (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p10 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p10 X))))) (tptp.p9 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p9 Y))) (or (not (tptp.r1 X Y)) (tptp.p10 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p9 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p9 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p10 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p10 Y))))) (tptp.p9 X))) (tptp.p10 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p9 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p10 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p10 X))))) (tptp.p9 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p9 X))) (or (not (tptp.r1 Y X)) (tptp.p10 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p9 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p9 Y))) (let ((_let_2 (tptp.p10 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p10 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p9 X))) _let_1)))))))))) (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p9 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p9 X))))) (tptp.p8 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p8 Y))) (or (not (tptp.r1 X Y)) (tptp.p9 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p8 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p8 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p9 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p9 Y))))) (tptp.p8 X))) (tptp.p9 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p8 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p9 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p9 X))))) (tptp.p8 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p8 X))) (or (not (tptp.r1 Y X)) (tptp.p9 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p8 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p8 Y))) (let ((_let_2 (tptp.p9 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p9 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p8 X))) _let_1)))))))))) (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p8 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p8 X))))) (tptp.p7 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p7 Y))) (or (not (tptp.r1 X Y)) (tptp.p8 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p7 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p7 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p8 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p8 Y))))) (tptp.p7 X))) (tptp.p8 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p7 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p8 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p8 X))))) (tptp.p7 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p7 X))) (or (not (tptp.r1 Y X)) (tptp.p8 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p7 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p7 Y))) (let ((_let_2 (tptp.p8 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p8 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p7 X))) _let_1)))))))))) (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p7 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p7 X))))) (tptp.p6 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p6 Y))) (or (not (tptp.r1 X Y)) (tptp.p7 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p6 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p6 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p7 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p7 Y))))) (tptp.p6 X))) (tptp.p7 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p6 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p7 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p7 X))))) (tptp.p6 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p6 X))) (or (not (tptp.r1 Y X)) (tptp.p7 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p6 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p6 Y))) (let ((_let_2 (tptp.p7 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p7 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p6 X))) _let_1)))))))))) (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p6 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p6 X))))) (tptp.p5 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p5 Y))) (or (not (tptp.r1 X Y)) (tptp.p6 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p5 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p5 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p6 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p6 Y))))) (tptp.p5 X))) (tptp.p6 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p5 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p6 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p6 X))))) (tptp.p5 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p5 X))) (or (not (tptp.r1 Y X)) (tptp.p6 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p5 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p5 Y))) (let ((_let_2 (tptp.p6 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p6 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p5 X))) _let_1)))))))))) (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p5 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p5 X))))) (tptp.p4 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p4 Y))) (or (not (tptp.r1 X Y)) (tptp.p5 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p4 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p4 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p5 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p5 Y))))) (tptp.p4 X))) (tptp.p5 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p4 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p5 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p5 X))))) (tptp.p4 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p4 X))) (or (not (tptp.r1 Y X)) (tptp.p5 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p4 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p4 Y))) (let ((_let_2 (tptp.p5 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p5 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p4 X))) _let_1)))))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p10 Y))) (or (not (tptp.r1 X Y)) _let_1 (not (and (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p10 X))) _let_1))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p10 Y))) (or (not (tptp.r1 X Y)) _let_1 (not (and (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p10 X))) _let_1))))) (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p4 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p4 X))))) (tptp.p3 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p3 Y))) (or (not (tptp.r1 X Y)) (tptp.p4 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p3 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p3 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p4 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p4 Y))))) (tptp.p3 X))) (tptp.p4 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p3 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p4 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p4 X))))) (tptp.p3 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p3 X))) (or (not (tptp.r1 Y X)) (tptp.p4 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p3 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p3 Y))) (let ((_let_2 (tptp.p4 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p4 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p3 X))) _let_1)))))))))) (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p3 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p3 X))))) (tptp.p2 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p2 Y))) (or (not (tptp.r1 X Y)) (tptp.p3 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p2 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p2 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p3 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p3 Y))))) (tptp.p2 X))) (tptp.p3 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p2 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p3 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p3 X))))) (tptp.p2 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p2 X))) (or (not (tptp.r1 Y X)) (tptp.p3 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p2 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p2 Y))) (let ((_let_2 (tptp.p3 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p3 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p2 X))) _let_1)))))))))) (not (or (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p2 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p2 X))))) (tptp.p1 Y))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p1 Y))) (or (not (tptp.r1 X Y)) (tptp.p2 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p1 X))) _let_1))))) (not (and (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p1 Y))) (or (not (tptp.r1 X Y)) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (not (and (tptp.p2 X) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p2 Y))))) (tptp.p1 X))) (tptp.p2 Y) (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p1 X))) _let_1))))) (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (not (and (tptp.p2 Y) (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p2 X))))) (tptp.p1 Y) (forall ((X $$unsorted)) (let ((_let_1 (tptp.p1 X))) (or (not (tptp.r1 Y X)) (tptp.p2 X) (not (and _let_1 (forall ((Y $$unsorted)) (or (not (tptp.r1 X Y)) (tptp.p1 Y))) _let_1))))))) (forall ((Y $$unsorted)) (let ((_let_1 (tptp.p1 Y))) (let ((_let_2 (tptp.p2 Y))) (or (not (tptp.r1 X Y)) (not (and _let_2 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p2 X))))) _let_1 _let_2 (not (and _let_1 (forall ((X $$unsorted)) (or (not (tptp.r1 Y X)) (tptp.p1 X))) _let_1))))))))))))))))) (SCOPE (SCOPE (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) :args (_let_1 true))))
% 0.21/0.56 )
% 0.21/0.56 % SZS output end Proof for LCL644+1.010
% 0.21/0.56 % cvc5---1.0.5 exiting
% 0.21/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------