TSTP Solution File: GEO065-3 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GEO065-3 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n026.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 16:44:58 EDT 2024
% 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.10/0.13 % Problem : GEO065-3 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.10/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n026.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 : Mon May 27 06:45:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.51 %----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.57 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.DvGGS1Xc3Z/cvc5---1.0.5_16266.smt2
% 0.20/0.57 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.DvGGS1Xc3Z/cvc5---1.0.5_16266.smt2
% 0.20/0.58 (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.equidistant X Y Y X)))
% 0.20/0.58 (assume a1 (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))))
% 0.20/0.58 (assume a2 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.equidistant X Y Z Z)) (= X Y))))
% 0.20/0.58 (assume a3 (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (V $$unsorted)) (tptp.between X Y (tptp.extension X Y W V))))
% 0.20/0.58 (assume a4 (forall ((Y $$unsorted) (X $$unsorted) (W $$unsorted) (V $$unsorted)) (tptp.equidistant Y (tptp.extension X Y W V) W V)))
% 0.20/0.58 (assume a5 (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))))
% 0.20/0.58 (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.between X Y X)) (= X Y))))
% 0.20/0.58 (assume a7 (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))))
% 0.20/0.58 (assume a8 (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))))
% 0.20/0.58 (assume a9 (not (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)))
% 0.20/0.58 (assume a10 (not (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1)))
% 0.20/0.58 (assume a11 (not (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))
% 0.20/0.58 (assume a12 (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))))
% 0.20/0.58 (assume a13 (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)))))
% 0.20/0.58 (assume a14 (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)))))
% 0.20/0.58 (assume a15 (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)))))
% 0.20/0.58 (assume a16 (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))))
% 0.20/0.58 (assume a17 (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)))))
% 0.20/0.58 (assume a18 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.between X Y Z)) (tptp.colinear X Y Z))))
% 0.20/0.58 (assume a19 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))))
% 0.20/0.58 (assume a20 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.between Z X Y)) (tptp.colinear X Y Z))))
% 0.20/0.58 (assume a21 (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))))
% 0.20/0.58 (assume a22 (forall ((U $$unsorted) (V $$unsorted)) (= (tptp.reflection U V) (tptp.extension U V U V))))
% 0.20/0.58 (assume a23 (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))))
% 0.20/0.58 (assume a24 (forall ((U $$unsorted) (V $$unsorted)) (tptp.equidistant U V U V)))
% 0.20/0.58 (assume a25 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant W X U V))))
% 0.20/0.58 (assume a26 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant V U W X))))
% 0.20/0.58 (assume a27 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant U V X W))))
% 0.20/0.58 (assume a28 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant V U X W))))
% 0.20/0.58 (assume a29 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant W X V U))))
% 0.20/0.58 (assume a30 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant X W U V))))
% 0.20/0.58 (assume a31 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.equidistant U V W X)) (tptp.equidistant X W V U))))
% 0.20/0.58 (assume a32 (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))))
% 0.20/0.58 (assume a33 (forall ((V $$unsorted) (U $$unsorted) (W $$unsorted)) (= V (tptp.extension U V W W))))
% 0.20/0.58 (assume a34 (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))))
% 0.20/0.58 (assume a35 (forall ((U $$unsorted) (V $$unsorted)) (tptp.between U V (tptp.reflection U V))))
% 0.20/0.58 (assume a36 (forall ((V $$unsorted) (U $$unsorted)) (tptp.equidistant V (tptp.reflection U V) U V)))
% 0.20/0.58 (assume a37 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (= V (tptp.reflection U V)))))
% 0.20/0.58 (assume a38 (forall ((U $$unsorted)) (= U (tptp.reflection U U))))
% 0.20/0.58 (assume a39 (forall ((V $$unsorted) (U $$unsorted)) (or (not (= V (tptp.reflection U V))) (= U V))))
% 0.20/0.58 (assume a40 (forall ((U $$unsorted) (V $$unsorted)) (tptp.equidistant U U V V)))
% 0.20/0.58 (assume a41 (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))))
% 0.20/0.58 (assume a42 (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))))
% 0.20/0.58 (assume a43 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (= U V) (= W (tptp.extension U V V W)))))
% 0.20/0.58 (assume a44 (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))))
% 0.20/0.58 (assume a45 (forall ((U $$unsorted) (V $$unsorted)) (or (= (tptp.extension U V U V) (tptp.extension U V V U)) (= U V))))
% 0.20/0.58 (assume a46 (forall ((V $$unsorted) (U $$unsorted)) (tptp.equidistant V U V (tptp.reflection (tptp.reflection U V) V))))
% 0.20/0.58 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (= U (tptp.reflection (tptp.reflection U V) V))))
% 0.20/0.58 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.between U V V)))
% 0.20/0.58 (assume a49 (forall ((U $$unsorted) (W $$unsorted) (X $$unsorted) (V $$unsorted)) (or (not (tptp.between U W X)) (not (= U X)) (tptp.between V W X))))
% 0.20/0.58 (assume a50 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))))
% 0.20/0.58 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.between U U V)))
% 0.20/0.58 (assume a52 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between V U W)) (= U V))))
% 0.20/0.58 (assume a53 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U W V)) (= V W))))
% 0.20/0.58 (assume a54 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between V U W)) (= U V) (= V W))))
% 0.20/0.58 (assume a55 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U W V)) (= U V) (= V W))))
% 0.20/0.58 (assume a56 (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 W))))
% 0.20/0.58 (assume a57 (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))))
% 0.20/0.58 (assume a58 (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))))
% 0.20/0.58 (assume a59 (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))))
% 0.20/0.58 (assume a60 (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))))
% 0.20/0.58 (assume a61 (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))))
% 0.20/0.58 (assume a62 (not (= tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))
% 0.20/0.58 (assume a63 (not (= tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)))
% 0.20/0.58 (assume a64 (not (= tptp.lower_dimension_point_1 tptp.lower_dimension_point_3)))
% 0.20/0.58 (assume a65 (forall ((V $$unsorted) (U $$unsorted)) (not (= V (tptp.extension U V tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))))
% 0.20/0.58 (assume a66 (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))))
% 0.20/0.58 (assume a67 (forall ((U $$unsorted) (V $$unsorted)) (tptp.between U V (tptp.extension U V tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))))
% 0.20/0.58 (assume a68 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (U1 $$unsorted) (V1 $$unsorted) (X $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.between U1 V1 W)) (not (tptp.between U X U1)) (tptp.between X (tptp.inner_pasch V1 (tptp.inner_pasch U X U1 V1 W) U V W) W) (tptp.between V (tptp.inner_pasch V1 (tptp.inner_pasch U X U1 V1 W) U V W) V1))))
% 0.20/0.58 (assume a69 (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))))
% 0.20/0.58 (assume a70 (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))))
% 0.20/0.58 (assume a71 (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))))
% 0.20/0.58 (assume a72 (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))))
% 0.20/0.58 (assume a73 (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))))
% 0.20/0.58 (assume a74 (forall ((U $$unsorted) (V $$unsorted) (U1 $$unsorted) (W1 $$unsorted)) (tptp.equidistant U V U1 (tptp.insertion U1 W1 U V))))
% 0.20/0.58 (assume a75 (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))))
% 0.20/0.58 (assume a76 (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))))
% 0.20/0.58 (assume a77 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (= V (tptp.insertion U W U V)))))
% 0.20/0.58 (assume a78 (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)))))
% 0.20/0.58 (assume a79 (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))))
% 0.20/0.58 (assume a80 (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))))
% 0.20/0.58 (assume a81 (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))))
% 0.20/0.58 (assume a82 (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))))
% 0.20/0.58 (assume a83 (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))))
% 0.20/0.58 (assume a84 (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))))
% 0.20/0.58 (assume a85 (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))))
% 0.20/0.58 (assume a86 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (not (tptp.equidistant U V U W)) (= V W))))
% 0.20/0.58 (assume a87 (tptp.between tptp.u tptp.w tptp.v))
% 0.20/0.58 (assume a88 (not (tptp.colinear tptp.u tptp.v tptp.w)))
% 0.20/0.58 (step t1 (cl (not (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u)) :rule or_pos)
% 0.20/0.58 (step t2 (cl (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u) (not (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u)))) :rule reordering :premises (t1))
% 0.20/0.58 (step t3 (cl (not (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w)) :rule or_pos)
% 0.20/0.58 (step t4 (cl (tptp.colinear tptp.u tptp.v tptp.w) (not (tptp.between tptp.v tptp.w tptp.u)) (not (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w)))) :rule reordering :premises (t3))
% 0.20/0.58 (step t5 (cl (=> (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z)))) :rule implies_neg1)
% 0.20/0.58 (anchor :step t6)
% 0.20/0.58 (assume t6.a0 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))))
% 0.20/0.58 (step t6.t1 (cl (or (not (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z)))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w)))) :rule forall_inst :args ((:= Y tptp.v) (:= Z tptp.w) (:= X tptp.u)))
% 0.20/0.58 (step t6.t2 (cl (not (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z)))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) :rule or :premises (t6.t1))
% 0.20/0.58 (step t6.t3 (cl (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) :rule resolution :premises (t6.t2 t6.a0))
% 0.20/0.58 (step t6 (cl (not (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z)))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) :rule subproof :discharge (t6.a0))
% 0.20/0.58 (step t7 (cl (=> (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) :rule resolution :premises (t5 t6))
% 0.20/0.58 (step t8 (cl (=> (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) (not (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w)))) :rule implies_neg2)
% 0.20/0.58 (step t9 (cl (=> (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) (=> (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w)))) :rule resolution :premises (t7 t8))
% 0.20/0.58 (step t10 (cl (=> (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w)))) :rule contraction :premises (t9))
% 0.20/0.58 (step t11 (cl (not (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z)))) (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) :rule implies :premises (t10))
% 0.20/0.58 (step t12 (cl (or (not (tptp.between tptp.v tptp.w tptp.u)) (tptp.colinear tptp.u tptp.v tptp.w))) :rule resolution :premises (t11 a19))
% 0.20/0.58 (step t13 (cl (not (tptp.between tptp.v tptp.w tptp.u))) :rule resolution :premises (t4 a88 t12))
% 0.20/0.58 (step t14 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U)))) :rule implies_neg1)
% 0.20/0.58 (anchor :step t15)
% 0.20/0.58 (assume t15.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))))
% 0.20/0.58 (step t15.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U)))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u)))) :rule forall_inst :args ((:= U tptp.u) (:= V tptp.w) (:= W tptp.v)))
% 0.20/0.58 (step t15.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U)))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) :rule or :premises (t15.t1))
% 0.20/0.58 (step t15.t3 (cl (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) :rule resolution :premises (t15.t2 t15.a0))
% 0.20/0.58 (step t15 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U)))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) :rule subproof :discharge (t15.a0))
% 0.20/0.58 (step t16 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) :rule resolution :premises (t14 t15))
% 0.20/0.58 (step t17 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) (not (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u)))) :rule implies_neg2)
% 0.20/0.58 (step t18 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u)))) :rule resolution :premises (t16 t17))
% 0.20/0.58 (step t19 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u)))) :rule contraction :premises (t18))
% 0.20/0.58 (step t20 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.between U V W)) (tptp.between W V U)))) (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) :rule implies :premises (t19))
% 0.20/0.58 (step t21 (cl (or (not (tptp.between tptp.u tptp.w tptp.v)) (tptp.between tptp.v tptp.w tptp.u))) :rule resolution :premises (t20 a50))
% 0.20/0.58 (step t22 (cl) :rule resolution :premises (t2 t13 t21 a87))
% 0.20/0.58
% 0.20/0.58 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.DvGGS1Xc3Z/cvc5---1.0.5_16266.smt2
% 0.20/0.58 % cvc5---1.0.5 exiting
% 0.20/0.58 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------