TSTP Solution File: GEO062-3 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GEO062-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n002.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 Aug 30 22:49:29 EDT 2023
% Result : Unsatisfiable 0.22s 0.62s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO062-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.13/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n002.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 29 20:43:05 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.50 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.KX1D6MHACX/cvc5---1.0.5_32511.p...
% 0.22/0.51 ------- get file name : TPTP file name is GEO062-3
% 0.22/0.52 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_32511.smt2...
% 0.22/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.62 % SZS status Unsatisfiable for GEO062-3
% 0.22/0.62 % SZS output start Proof for GEO062-3
% 0.22/0.62 (
% 0.22/0.62 (let ((_let_1 (tptp.insertion tptp.u tptp.w tptp.u tptp.v))) (let ((_let_2 (= tptp.v _let_1))) (let ((_let_3 (not _let_2))) (let ((_let_4 (tptp.between tptp.u tptp.v tptp.w))) (let ((_let_5 (forall ((V $$unsorted) (U $$unsorted)) (not (= V (tptp.extension U V tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))))) (let ((_let_6 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U W X)) (tptp.between V W X))))) (let ((_let_7 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))))) (let ((_let_8 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (= U V) (= W (tptp.extension U V V W)))))) (let ((_let_9 (forall ((U1 $$unsorted) (W1 $$unsorted) (U $$unsorted) (V $$unsorted)) (= (tptp.insertion U1 W1 U V) (tptp.extension (tptp.extension W1 U1 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2) U1 U V))))) (let ((_let_10 (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (V $$unsorted)) (tptp.between X Y (tptp.extension X Y W V))))) (let ((_let_11 (tptp.between tptp.w tptp.v tptp.u))) (let ((_let_12 (tptp.extension tptp.w tptp.u tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) (let ((_let_13 (tptp.between tptp.w tptp.u _let_12))) (let ((_let_14 (tptp.between tptp.v tptp.u _let_12))) (let ((_let_15 (not _let_13))) (let ((_let_16 (not _let_11))) (let ((_let_17 (or _let_16 _let_15 _let_14))) (let ((_let_18 (not _let_4))) (let ((_let_19 (or _let_18 _let_11))) (let ((_let_20 (_let_7))) (let ((_let_21 (ASSUME :args _let_20))) (let ((_let_22 (_let_10))) (let ((_let_23 (ASSUME :args _let_22))) (let ((_let_24 (_let_6))) (let ((_let_25 (ASSUME :args _let_24))) (let ((_let_26 (tptp.between _let_12 tptp.u tptp.v))) (let ((_let_27 (not _let_14))) (let ((_let_28 (or _let_27 _let_26))) (let ((_let_29 (tptp.extension _let_12 tptp.u tptp.u tptp.v))) (let ((_let_30 (= tptp.v _let_29))) (let ((_let_31 (= tptp.u _let_12))) (let ((_let_32 (not _let_26))) (let ((_let_33 (or _let_32 _let_31 _let_30))) (let ((_let_34 (_let_8))) (let ((_let_35 (ASSUME :args _let_34))) (let ((_let_36 (_let_5))) (let ((_let_37 (ASSUME :args _let_36))) (let ((_let_38 (= _let_1 _let_29))) (let ((_let_39 (not _let_30))) (let ((_let_40 (_let_9))) (let ((_let_41 (ASSUME :args _let_40))) (let ((_let_42 (ASSUME :args (_let_3)))) (let ((_let_43 (and _let_3 _let_38))) (let ((_let_44 (_let_3 _let_38))) (let ((_let_45 (ASSUME :args (_let_38)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_17)) :args ((or _let_16 _let_15 _let_14 (not _let_17)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_28)) :args ((or _let_26 _let_27 (not _let_28)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_33)) :args ((or _let_32 _let_30 _let_31 (not _let_33)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_43)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_42 _let_45) (SCOPE (FALSE_ELIM (TRANS (CONG (REFL :args (tptp.v)) (SYMM _let_45) :args (=)) (FALSE_INTRO _let_42))) :args _let_44)) :args _let_44)) :args (true _let_43)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_3) _let_2))) (REFL :args ((not _let_38))) (REFL :args (_let_39)) :args (or))) _let_42 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_41 :args (tptp.u tptp.w tptp.u tptp.v QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.insertion U1 W1 U V)))) :args _let_40)) _let_41 :args (_let_38 false _let_9)) :args (_let_39 true _let_2 false _let_38)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_37 :args (tptp.u tptp.w QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.extension U V tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))) :args _let_36)) _let_37 :args ((not _let_31) false _let_5)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_35 :args (_let_12 tptp.u tptp.v QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.extension U V V W)))) :args _let_34))) _let_35 :args (_let_33 false _let_8)) :args (_let_32 true _let_30 true _let_31 false _let_33)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (tptp.v tptp.u _let_12 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.between W V U) true))))) :args _let_20)) _let_21 :args (_let_28 false _let_7)) :args (_let_27 true _let_26 false _let_28)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_25 :args (tptp.w tptp.v tptp.u _let_12 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.between U V W) false)) (not (= (tptp.between U W X) false))))) :args _let_24)) _let_25 :args (_let_17 false _let_6)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_23 :args (tptp.w tptp.u tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.extension X Y W V)))) :args _let_22)) _let_23 :args (_let_13 false _let_10)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_18 _let_11 (not _let_19)))) (ASSUME :args (_let_4)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (tptp.u tptp.v tptp.w QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.between U V W) false))))) :args _let_20)) _let_21 :args (_let_19 false _let_7)) :args (_let_11 false _let_4 false _let_19)) :args (false true _let_14 false _let_17 false _let_13 false _let_11)) :args ((forall ((X $$unsorted) (Y $$unsorted)) (tptp.equidistant X Y Y X)) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (V $$unsorted) (V2 $$unsorted) (W $$unsorted)) (or (not (tptp.equidistant X Y Z V)) (not (tptp.equidistant X Y V2 W)) (tptp.equidistant Z V V2 W))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.equidistant X Y Z Z)) (= X Y))) _let_10 (forall ((Y $$unsorted) (X $$unsorted) (W $$unsorted) (V $$unsorted)) (tptp.equidistant Y (tptp.extension X Y W V) W V)) (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z $$unsorted) (Z1 $$unsorted) (V $$unsorted) (V1 $$unsorted)) (or (not (tptp.equidistant X Y X1 Y1)) (not (tptp.equidistant Y Z Y1 Z1)) (not (tptp.equidistant X V X1 V1)) (not (tptp.equidistant Y V Y1 V1)) (not (tptp.between X Y Z)) (not (tptp.between X1 Y1 Z1)) (= X Y) (tptp.equidistant Z V Z1 V1))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.between X Y X)) (= X Y))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between Y X W)) (tptp.between V (tptp.inner_pasch U V W X Y) Y))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (Y $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between Y X W)) (tptp.between X (tptp.inner_pasch U V W X Y) U))) (not (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (not (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1)) (not (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)) (forall ((X $$unsorted) (W $$unsorted) (V $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.equidistant X W X V)) (not (tptp.equidistant Y W Y V)) (not (tptp.equidistant Z W Z V)) (tptp.between X Y Z) (tptp.between Y Z X) (tptp.between Z X Y) (= W V))) (forall ((U $$unsorted) (W $$unsorted) (Y $$unsorted) (V $$unsorted) (X $$unsorted)) (or (not (tptp.between U W Y)) (not (tptp.between V W X)) (= U W) (tptp.between U V (tptp.euclid1 U V W X Y)))) (forall ((U $$unsorted) (W $$unsorted) (Y $$unsorted) (V $$unsorted) (X $$unsorted)) (or (not (tptp.between U W Y)) (not (tptp.between V W X)) (= U W) (tptp.between U X (tptp.euclid2 U V W X Y)))) (forall ((U $$unsorted) (W $$unsorted) (Y $$unsorted) (V $$unsorted) (X $$unsorted)) (or (not (tptp.between U W Y)) (not (tptp.between V W X)) (= U W) (tptp.between (tptp.euclid1 U V W X Y) Y (tptp.euclid2 U V W X Y)))) (forall ((U $$unsorted) (V $$unsorted) (V1 $$unsorted) (X $$unsorted) (X1 $$unsorted) (W $$unsorted)) (or (not (tptp.equidistant U V U V1)) (not (tptp.equidistant U X U X1)) (not (tptp.between U V X)) (not (tptp.between V W X)) (tptp.between V1 (tptp.continuous U V V1 W X X1) X1))) (forall ((U $$unsorted) (V $$unsorted) (V1 $$unsorted) (X $$unsorted) (X1 $$unsorted) (W $$unsorted)) (or (not (tptp.equidistant U V U V1)) (not (tptp.equidistant U X U X1)) (not (tptp.between U V X)) (not (tptp.between V W X)) (tptp.equidistant U W U (tptp.continuous U V V1 W X X1)))) (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.reflection U V) (tptp.extension U V U V))) _let_9 (forall ((U $$unsorted) (V $$unsorted)) (tptp.equidistant U V U V)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant W X U V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant V U W X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant U V X W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant V U X W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant W X V U))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant X W U V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant X W V U))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.equidistant U V W X)) (not (tptp.equidistant W X Y Z)) (tptp.equidistant U V Y Z))) (forall ((V $$unsorted) (U $$unsorted) (W $$unsorted)) (= V (tptp.extension U V W W))) (forall ((Y $$unsorted) (U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= Y (tptp.extension U V W X))) (tptp.between U V Y))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.between U V (tptp.reflection U V))) (forall ((V $$unsorted) (U $$unsorted)) (tptp.equidistant V (tptp.reflection U V) U V)) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (= V (tptp.reflection U V)))) (forall ((U $$unsorted)) (= U (tptp.reflection U U))) (forall ((V $$unsorted) (U $$unsorted)) (or (not (= V (tptp.reflection U V))) (= U V))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.equidistant U U V V)) (forall ((U $$unsorted) (V $$unsorted) (U1 $$unsorted) (V1 $$unsorted) (W $$unsorted) (W1 $$unsorted)) (or (not (tptp.equidistant U V U1 V1)) (not (tptp.equidistant V W V1 W1)) (not (tptp.between U V W)) (not (tptp.between U1 V1 W1)) (tptp.equidistant U W U1 W1))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U V X)) (not (tptp.equidistant V W V X)) (= U V) (= W X))) _let_8 (forall ((W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.equidistant W X Y Z)) (= (tptp.extension U V W X) (tptp.extension U V Y Z)) (= U V))) (forall ((U $$unsorted) (V $$unsorted)) (or (= (tptp.extension U V U V) (tptp.extension U V V U)) (= U V))) (forall ((V $$unsorted) (U $$unsorted)) (tptp.equidistant V U V (tptp.reflection (tptp.reflection U V) V))) (forall ((U $$unsorted) (V $$unsorted)) (= U (tptp.reflection (tptp.reflection U V) V))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.between U V V)) (forall ((U $$unsorted) (W $$unsorted) (X $$unsorted) (V $$unsorted)) (or (not (tptp.between U W X)) (not (= U X)) (tptp.between V W X))) _let_7 (forall ((U $$unsorted) (V $$unsorted)) (tptp.between U U V)) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between V U W)) (= U V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U W V)) (= V W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between V U W)) (= U V) (= V W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U W V)) (= U V) (= V W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.between U V W))) (or (not _let_1) (not (tptp.between V W X)) _let_1))) _let_6 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between V W X)) (tptp.between U W X) (= V W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between V W X)) (tptp.between U V X) (= V W))) (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (W $$unsorted)) (or (not (tptp.between U V X)) (not (tptp.between V W X)) (tptp.between U W X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U W X)) (tptp.between U V X))) (not (= tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)) (not (= tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (not (= tptp.lower_dimension_point_1 tptp.lower_dimension_point_3)) _let_5 (forall ((V $$unsorted) (U $$unsorted) (X $$unsorted) (W $$unsorted)) (tptp.equidistant V (tptp.extension U V tptp.lower_dimension_point_1 tptp.lower_dimension_point_2) X (tptp.extension W X tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.between U V (tptp.extension U V tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (U1 $$unsorted) (V1 $$unsorted) (X $$unsorted)) (let ((_let_1 (tptp.inner_pasch V1 (tptp.inner_pasch U X U1 V1 W) U V W))) (or (not (tptp.between U V W)) (not (tptp.between U1 V1 W)) (not (tptp.between U X U1)) (tptp.between X _let_1 W) (tptp.between V _let_1 V1)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (W1 $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.equidistant U W U W1)) (not (tptp.equidistant V W V W1)) (= U V) (= W W1))) (forall ((U $$unsorted) (V $$unsorted) (U1 $$unsorted) (V1 $$unsorted) (W $$unsorted) (W1 $$unsorted) (X $$unsorted) (X1 $$unsorted)) (or (not (tptp.equidistant U V U1 V1)) (not (tptp.equidistant U W U1 W1)) (not (tptp.equidistant U X U1 X1)) (not (tptp.equidistant W X W1 X1)) (not (tptp.between U V W)) (not (tptp.between U1 V1 W1)) (tptp.equidistant V X V1 X1))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (U1 $$unsorted) (V1 $$unsorted) (W1 $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U1 V1 W1)) (not (tptp.equidistant U V U1 V1)) (not (tptp.equidistant U W U1 W1)) (tptp.equidistant V W V1 W1))) (forall ((U $$unsorted) (V $$unsorted) (U1 $$unsorted) (V1 $$unsorted) (W $$unsorted) (W1 $$unsorted) (X $$unsorted) (X1 $$unsorted)) (or (not (tptp.equidistant U V U1 V1)) (not (tptp.equidistant V W V1 W1)) (not (tptp.equidistant U X U1 X1)) (not (tptp.equidistant W X W1 X1)) (not (tptp.between U V W)) (not (tptp.between U1 V1 W1)) (tptp.equidistant V X V1 X1))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.equidistant U V U X)) (not (tptp.equidistant W V W X)) (= V X))) (forall ((U $$unsorted) (V $$unsorted) (U1 $$unsorted) (W1 $$unsorted)) (tptp.equidistant U V U1 (tptp.insertion U1 W1 U V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (U1 $$unsorted) (W1 $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.equidistant U W U1 W1)) (tptp.between U1 (tptp.insertion U1 W1 U V) W1))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (U1 $$unsorted) (W1 $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.equidistant U W U1 W1)) (tptp.equidistant V W (tptp.insertion U1 W1 U V) W1))) _let_4 _let_3))))))))))))))))))))))))))))))))))))))))))))))))
% 0.22/0.62 )
% 0.22/0.62 % SZS output end Proof for GEO062-3
% 0.22/0.63 % cvc5---1.0.5 exiting
% 0.22/0.63 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------