TSTP Solution File: GEO029-3 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : GEO029-3 : TPTP v8.1.2. Released v1.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 : Wed Aug 30 22:49:17 EDT 2023

% Result   : Unsatisfiable 0.39s 0.61s
% Output   : Proof 0.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : GEO029-3 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n003.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 Aug 29 22:46:26 EDT 2023
% 0.20/0.35  % CPUTime    : 
% 0.20/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.50  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.NrSJ5yX9v8/cvc5---1.0.5_30219.p...
% 0.20/0.51  ------- get file name : TPTP file name is GEO029-3
% 0.20/0.51  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_30219.smt2...
% 0.20/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.39/0.61  % SZS status Unsatisfiable for GEO029-3
% 0.39/0.61  % SZS output start Proof for GEO029-3
% 0.39/0.61  (
% 0.39/0.61  (let ((_let_1 (tptp.extension tptp.u tptp.v tptp.v tptp.u))) (let ((_let_2 (tptp.extension tptp.u tptp.v tptp.u tptp.v))) (let ((_let_3 (= _let_2 _let_1))) (let ((_let_4 (not _let_3))) (let ((_let_5 (not (= tptp.u tptp.v)))) (let ((_let_6 (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 ((_let_7 (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))))) (let ((_let_8 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant X W U V))))) (let ((_let_9 (forall ((Y $$unsorted) (X $$unsorted) (W $$unsorted) (V $$unsorted)) (tptp.equidistant Y (tptp.extension X Y W V) W 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.equidistant tptp.v _let_1 tptp.v _let_2))) (let ((_let_12 (tptp.equidistant tptp.v tptp.u tptp.v _let_2))) (let ((_let_13 (not _let_12))) (let ((_let_14 (tptp.equidistant tptp.v _let_1 tptp.v tptp.u))) (let ((_let_15 (not _let_14))) (let ((_let_16 (or _let_15 _let_13 _let_11))) (let ((_let_17 (_let_7))) (let ((_let_18 (ASSUME :args _let_17))) (let ((_let_19 (not _let_16))) (let ((_let_20 (tptp.equidistant tptp.v _let_2 tptp.u tptp.v))) (let ((_let_21 (not _let_20))) (let ((_let_22 (or _let_21 _let_12))) (let ((_let_23 (_let_8))) (let ((_let_24 (ASSUME :args _let_23))) (let ((_let_25 (_let_9))) (let ((_let_26 (ASSUME :args _let_25))) (let ((_let_27 ((tptp.extension X Y W V)))) (let ((_let_28 (= tptp.v tptp.u))) (let ((_let_29 (not _let_11))) (let ((_let_30 (tptp.between tptp.u tptp.v _let_2))) (let ((_let_31 (not _let_30))) (let ((_let_32 (tptp.between tptp.u tptp.v _let_1))) (let ((_let_33 (not _let_32))) (let ((_let_34 (or _let_33 _let_31 _let_29 _let_28 _let_3))) (let ((_let_35 (_let_6))) (let ((_let_36 (ASSUME :args _let_35))) (let ((_let_37 (_let_10))) (let ((_let_38 (ASSUME :args _let_37))) (let ((_let_39 ((tptp.extension X Y W V)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_18 :args (tptp.v _let_1 tptp.v tptp.u tptp.v _let_2 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.equidistant U V Y Z) true)) (not (= (tptp.equidistant U V W X) false))))) :args _let_17)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_16)) :args ((or _let_15 _let_11 _let_13 _let_19))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_26 :args (tptp.v tptp.u tptp.v tptp.u QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_27)) :args _let_25)) _let_26 :args (_let_14 false _let_9)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_34)) :args ((or _let_3 _let_28 _let_33 _let_31 _let_29 (not _let_34)))) (ASSUME :args (_let_4)) (SYMM (ASSUME :args (_let_5))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_38 :args (tptp.u tptp.v tptp.v tptp.u QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_39)) :args _let_37)) _let_38 :args (_let_32 false _let_10)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_38 :args (tptp.u tptp.v tptp.u tptp.v QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_39)) :args _let_37)) _let_38 :args (_let_30 false _let_10)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_36 :args (tptp.u tptp.v _let_1 _let_2 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.between U V W) false)) (not (= (tptp.between U V X) false))))) :args _let_35))) _let_36 :args (_let_34 false _let_6)) :args (_let_29 true _let_3 true _let_28 false _let_32 false _let_30 false _let_34)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_22)) :args ((or _let_21 _let_12 (not _let_22)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_26 :args (tptp.v tptp.u tptp.u tptp.v QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_27)) :args _let_25)) _let_26 :args (_let_20 false _let_9)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_24 :args (tptp.v _let_2 tptp.u tptp.v QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.equidistant U V W X) false))))) :args _let_23)) _let_24 :args (_let_22 false _let_8)) :args (_let_12 false _let_20 false _let_22)) :args (_let_19 false _let_14 true _let_11 false _let_12)) _let_18 :args (false true _let_16 false _let_7)) :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 _let_9 (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))) (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))) _let_8 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant X W V U))) _let_7 (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))) _let_6 _let_5 _let_4))))))))))))))))))))))))))))))))))))))))))
% 0.39/0.61  )
% 0.39/0.61  % SZS output end Proof for GEO029-3
% 0.39/0.62  % cvc5---1.0.5 exiting
% 0.39/0.62  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------