TSTP Solution File: GEO011-3 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GEO011-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n011.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:10 EDT 2023
% Result : Unsatisfiable 0.20s 0.57s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO011-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n011.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 Aug 29 22:45:27 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.50 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.P3vRAyf7Of/cvc5---1.0.5_7441.p...
% 0.20/0.51 ------- get file name : TPTP file name is GEO011-3
% 0.20/0.52 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_7441.smt2...
% 0.20/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.57 % SZS status Unsatisfiable for GEO011-3
% 0.20/0.57 % SZS output start Proof for GEO011-3
% 0.20/0.57 (
% 0.20/0.57 (let ((_let_1 (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3))) (let ((_let_2 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.colinear X Y Z)) (tptp.between X Y Z) (tptp.between Y Z X) (tptp.between Z X Y))))) (let ((_let_3 (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) (let ((_let_4 (not _let_3))) (let ((_let_5 (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1))) (let ((_let_6 (not _let_5))) (let ((_let_7 (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3))) (let ((_let_8 (not _let_7))) (let ((_let_9 (not _let_1))) (let ((_let_10 (or _let_9 _let_7 _let_5 _let_3))) (let ((_let_11 (_let_2))) (let ((_let_12 (ASSUME :args _let_11))) (let ((_let_13 (not _let_10))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_12 :args (tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.between X Y Z) true))))) :args _let_11)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_10)) :args ((or _let_7 _let_5 _let_3 _let_9 _let_13))) (ASSUME :args (_let_8)) (ASSUME :args (_let_6)) (ASSUME :args (_let_4)) (ASSUME :args (_let_1)) :args (_let_13 true _let_7 true _let_5 true _let_3 false _let_1)) _let_12 :args (false true _let_10 false _let_2)) :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))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (V $$unsorted)) (tptp.between X Y (tptp.extension X Y W V))) (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))) _let_8 _let_6 _let_4 (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 ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.between X Y Z)) (tptp.colinear X Y Z))) (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.between Z X Y)) (tptp.colinear X Y Z))) _let_2 (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.reflection U V) (tptp.extension U V U V))) (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))) (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (= U V) (= W (tptp.extension U V V W)))) (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))) (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))) (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))) (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)) (forall ((V $$unsorted) (U $$unsorted)) (not (= V (tptp.extension U V tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))) (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (= V (tptp.insertion U W U V)))) (forall ((W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.equidistant W X Y Z)) (= (tptp.insertion U V W X) (tptp.insertion U V Y Z)))) (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.equidistant U W U1 W1)) (not (tptp.between U V W)) (tptp.between U1 V1 W1))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U V X)) (= U V) (tptp.between U W X) (tptp.between U X W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U V X)) (= U V) (tptp.between V W X) (tptp.between V X W))) (forall ((U $$unsorted) (W $$unsorted) (X $$unsorted) (V $$unsorted)) (or (not (tptp.between U W X)) (not (tptp.between V W X)) (= W X) (tptp.between U V W) (tptp.between V U W))) (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (W $$unsorted)) (or (not (tptp.between U V X)) (not (tptp.between U W X)) (tptp.between U V W) (tptp.between U W V))) (forall ((U $$unsorted) (V $$unsorted) (X $$unsorted) (W $$unsorted)) (or (not (tptp.between U V X)) (not (tptp.between U W X)) (tptp.between V W X) (tptp.between W V X))) (forall ((U $$unsorted) (V $$unsorted) (Y $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.between U V Y)) (not (tptp.between V W X)) (not (tptp.between U X Y)) (tptp.between U W Y))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.equidistant U V U W)) (= V W))) (forall ((W $$unsorted) (V $$unsorted) (U $$unsorted)) (or (not (tptp.between W V U)) (tptp.colinear U V W))) (forall ((U $$unsorted) (W $$unsorted) (V $$unsorted)) (or (not (tptp.between U W V)) (tptp.colinear U V W))) (forall ((V $$unsorted) (U $$unsorted) (W $$unsorted)) (or (not (tptp.between V U W)) (tptp.colinear U V W))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.colinear U V W)) (tptp.colinear W V U))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.colinear U V W)) (tptp.colinear V W U))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.colinear U V W)) (tptp.colinear U W V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.colinear U V W)) (tptp.colinear W U V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.colinear U V W)) (tptp.colinear V U W))) _let_1))))))))))))))))
% 0.20/0.57 )
% 0.20/0.58 % SZS output end Proof for GEO011-3
% 0.20/0.58 % cvc5---1.0.5 exiting
% 0.20/0.58 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------