TSTP Solution File: GEO011-4 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GEO011-4 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n022.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:45 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO011-4 : TPTP v8.2.0. Released v1.0.0.
% 0.14/0.14 % Command : do_cvc5 %s %d
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 27 05:49:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.5nEUSM3IjG/cvc5---1.0.5_20055.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.5nEUSM3IjG/cvc5---1.0.5_20055.smt2
% 0.20/0.53 (assume a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.between X Y Z)) (tptp.colinear X Y Z))))
% 0.20/0.53 (assume a1 (forall ((Y $$unsorted) (Z $$unsorted) (X $$unsorted)) (or (not (tptp.between Y Z X)) (tptp.colinear X Y Z))))
% 0.20/0.53 (assume a2 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.between Z X Y)) (tptp.colinear X Y Z))))
% 0.20/0.53 (assume a3 (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.53 (assume a4 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.equal_distance (tptp.distance X Y) (tptp.distance Y X))))
% 0.20/0.53 (assume a5 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (V $$unsorted) (V2 $$unsorted) (W $$unsorted)) (or (not (tptp.equal_distance (tptp.distance X Y) (tptp.distance Z V))) (not (tptp.equal_distance (tptp.distance X Y) (tptp.distance V2 W))) (tptp.equal_distance (tptp.distance Z V) (tptp.distance V2 W)))))
% 0.20/0.53 (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.equal_distance (tptp.distance X Y) (tptp.distance Z Z))) (= X Y))))
% 0.20/0.53 (assume a7 (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (V $$unsorted)) (tptp.between X Y (tptp.extension X Y W V))))
% 0.20/0.53 (assume a8 (forall ((Y $$unsorted) (X $$unsorted) (W $$unsorted) (V $$unsorted)) (tptp.equal_distance (tptp.distance Y (tptp.extension X Y W V)) (tptp.distance W V))))
% 0.20/0.53 (assume a9 (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted) (Y1 $$unsorted) (Z $$unsorted) (Z1 $$unsorted) (V $$unsorted) (V1 $$unsorted)) (or (not (tptp.equal_distance (tptp.distance X Y) (tptp.distance X1 Y1))) (not (tptp.equal_distance (tptp.distance Y Z) (tptp.distance Y1 Z1))) (not (tptp.equal_distance (tptp.distance X V) (tptp.distance X1 V1))) (not (tptp.equal_distance (tptp.distance Y V) (tptp.distance Y1 V1))) (not (tptp.between X Y Z)) (not (tptp.between X1 Y1 Z1)) (= X Y) (tptp.equal_distance (tptp.distance Z V) (tptp.distance Z1 V1)))))
% 0.20/0.53 (assume a10 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.between X Y X)) (= X Y))))
% 0.20/0.53 (assume a11 (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.53 (assume a12 (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.53 (assume a13 (not (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)))
% 0.20/0.53 (assume a14 (not (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1)))
% 0.20/0.53 (assume a15 (not (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))
% 0.20/0.53 (assume a16 (forall ((X $$unsorted) (W $$unsorted) (V $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.equal_distance (tptp.distance X W) (tptp.distance X V))) (not (tptp.equal_distance (tptp.distance Y W) (tptp.distance Y V))) (not (tptp.equal_distance (tptp.distance Z W) (tptp.distance Z V))) (tptp.between X Y Z) (tptp.between Y Z X) (tptp.between Z X Y) (= W V))))
% 0.20/0.53 (assume a17 (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.53 (assume a18 (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.53 (assume a19 (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.53 (assume a20 (forall ((U $$unsorted) (V $$unsorted) (V1 $$unsorted) (X $$unsorted) (X1 $$unsorted) (W $$unsorted)) (or (not (tptp.equal_distance (tptp.distance U V) (tptp.distance U V1))) (not (tptp.equal_distance (tptp.distance U X) (tptp.distance 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.53 (assume a21 (forall ((U $$unsorted) (V $$unsorted) (V1 $$unsorted) (X $$unsorted) (X1 $$unsorted) (W $$unsorted)) (or (not (tptp.equal_distance (tptp.distance U V) (tptp.distance U V1))) (not (tptp.equal_distance (tptp.distance U X) (tptp.distance U X1))) (not (tptp.between U V X)) (not (tptp.between V W X)) (tptp.equal_distance (tptp.distance U W) (tptp.distance U (tptp.continuous U V V1 W X X1))))))
% 0.20/0.53 (assume a22 (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3))
% 0.20/0.53 (step t1 (cl (=> (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))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_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)))) :rule implies_neg1)
% 0.20/0.53 (anchor :step t2)
% 0.20/0.53 (assume t2.a0 (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.53 (step t2.t1 (cl (or (not (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)))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))) :rule forall_inst :args ((:= X tptp.lower_dimension_point_1) (:= Y tptp.lower_dimension_point_2) (:= Z tptp.lower_dimension_point_3)))
% 0.20/0.53 (step t2.t2 (cl (not (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)))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) :rule or :premises (t2.t1))
% 0.20/0.53 (step t2.t3 (cl (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) :rule resolution :premises (t2.t2 t2.a0))
% 0.20/0.53 (step t2 (cl (not (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)))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) :rule subproof :discharge (t2.a0))
% 0.20/0.53 (step t3 (cl (=> (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))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) :rule resolution :premises (t1 t2))
% 0.20/0.53 (step t4 (cl (=> (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))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) (not (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))) :rule implies_neg2)
% 0.20/0.53 (step t5 (cl (=> (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))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_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))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))) :rule resolution :premises (t3 t4))
% 0.20/0.53 (step t6 (cl (=> (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))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))) :rule contraction :premises (t5))
% 0.20/0.53 (step t7 (cl (not (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)))) (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) :rule implies :premises (t6))
% 0.20/0.53 (step t8 (cl (not (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)) :rule or_pos)
% 0.20/0.53 (step t9 (cl (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2) (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (not (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))) :rule reordering :premises (t8))
% 0.20/0.53 (step t10 (cl (not (or (not (tptp.colinear tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)) (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3) (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1) (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))) :rule resolution :premises (t9 a13 a14 a15 a22))
% 0.20/0.53 (step t11 (cl) :rule resolution :premises (t7 t10 a3))
% 0.20/0.53
% 0.20/0.53 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.5nEUSM3IjG/cvc5---1.0.5_20055.smt2
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------