%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GEO029-3 : TPTP v9.2.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n020.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 Jun 3 08:16:08 AM UTC 2026 % Result : Unsatisfiable 0.48s 0.64s % Output : Proof 0.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GEO029-3 : TPTP v9.2.1. Released v1.0.0. % 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n020.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Mon Jun 1 23:10:10 EDT 2026 % 0.17/0.35 % CPUTime : % 0.35/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.35/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.48/0.64 % SZS status Unsatisfiable % 0.48/0.64 % SZS output start Proof % 0.48/0.64 ( % 0.48/0.64 (declare-sort $$unsorted 0) % 0.48/0.64 (declare-const tptp.euclid2 (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.euclid1 (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.u $$unsorted) % 0.48/0.64 (declare-const tptp.lower_dimension_point_1 $$unsorted) % 0.48/0.64 (declare-const tptp.lower_dimension_point_2 $$unsorted) % 0.48/0.64 (declare-const tptp.continuous (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.lower_dimension_point_3 $$unsorted) % 0.48/0.64 (declare-const tptp.v $$unsorted) % 0.48/0.64 (declare-const tptp.inner_pasch (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.reflection (-> $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.between (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.48/0.64 (declare-const tptp.extension (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.48/0.64 (declare-const tptp.equidistant (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.48/0.64 (define @t1 () (@var "X" $$unsorted)) % 0.48/0.64 (define @t2 () (@var "Y" $$unsorted)) % 0.48/0.64 (define @t3 () (@list @t1 @t2)) % 0.48/0.64 (define @t4 () (@var "W" $$unsorted)) % 0.48/0.64 (define @t5 () (@var "V2" $$unsorted)) % 0.48/0.64 (define @t6 () (@var "V" $$unsorted)) % 0.48/0.64 (define @t7 () (@var "Z" $$unsorted)) % 0.48/0.64 (define @t8 () (forall (@list @t1 @t2 @t7 @t6 @t5 @t4) (or (not (tptp.equidistant @t1 @t2 @t7 @t6)) (not (tptp.equidistant @t1 @t2 @t5 @t4)) (tptp.equidistant @t7 @t6 @t5 @t4)))) % 0.48/0.64 (define @t9 () (= @t1 @t2)) % 0.48/0.64 (define @t10 () (tptp.extension @t1 @t2 @t4 @t6)) % 0.48/0.64 (define @t11 () (@var "V1" $$unsorted)) % 0.48/0.64 (define @t12 () (@var "Z1" $$unsorted)) % 0.48/0.64 (define @t13 () (@var "Y1" $$unsorted)) % 0.48/0.64 (define @t14 () (@var "X1" $$unsorted)) % 0.48/0.64 (define @t15 () (tptp.between @t1 @t2 @t7)) % 0.48/0.64 (define @t16 () (@var "U" $$unsorted)) % 0.48/0.64 (define @t17 () (tptp.inner_pasch @t16 @t6 @t4 @t1 @t2)) % 0.48/0.64 (define @t18 () (not (tptp.between @t2 @t1 @t4))) % 0.48/0.64 (define @t19 () (not (tptp.between @t16 @t6 @t4))) % 0.48/0.64 (define @t20 () (@list @t16 @t6 @t4 @t2 @t1)) % 0.48/0.64 (define @t21 () (tptp.euclid1 @t16 @t6 @t4 @t1 @t2)) % 0.48/0.64 (define @t22 () (= @t16 @t4)) % 0.48/0.64 (define @t23 () (not (tptp.between @t6 @t4 @t1))) % 0.48/0.64 (define @t24 () (not (tptp.between @t16 @t4 @t2))) % 0.48/0.64 (define @t25 () (@list @t16 @t4 @t2 @t6 @t1)) % 0.48/0.64 (define @t26 () (tptp.euclid2 @t16 @t6 @t4 @t1 @t2)) % 0.48/0.64 (define @t27 () (tptp.continuous @t16 @t6 @t11 @t4 @t1 @t14)) % 0.48/0.64 (define @t28 () (not (tptp.between @t16 @t6 @t1))) % 0.48/0.64 (define @t29 () (not (tptp.equidistant @t16 @t1 @t16 @t14))) % 0.48/0.64 (define @t30 () (not (tptp.equidistant @t16 @t6 @t16 @t11))) % 0.48/0.64 (define @t31 () (@list @t16 @t6 @t11 @t1 @t14 @t4)) % 0.48/0.64 (define @t32 () (tptp.reflection @t16 @t6)) % 0.48/0.64 (define @t33 () (@list @t16 @t6)) % 0.48/0.64 (define @t34 () (not (tptp.equidistant @t16 @t6 @t4 @t1))) % 0.48/0.64 (define @t35 () (@list @t16 @t6 @t4 @t1)) % 0.48/0.64 (define @t36 () (@list @t6 @t16)) % 0.48/0.64 (define @t37 () (= @t6 @t32)) % 0.48/0.64 (define @t38 () (= @t16 @t6)) % 0.48/0.64 (define @t39 () (@var "W1" $$unsorted)) % 0.48/0.64 (define @t40 () (@var "U1" $$unsorted)) % 0.48/0.64 (define @t41 () (not (tptp.equidistant @t6 @t4 @t6 @t1))) % 0.48/0.64 (define @t42 () (or @t19 @t28 @t41 @t38 (= @t4 @t1))) % 0.48/0.64 (define @t43 () (forall @t35 @t42)) % 0.48/0.64 (define @t44 () (tptp.extension tptp.u tptp.v tptp.v tptp.u)) % 0.48/0.64 (define @t45 () (tptp.extension tptp.u tptp.v tptp.u tptp.v)) % 0.48/0.64 (define @t46 () (= @t45 @t44)) % 0.48/0.64 (define @t47 () (tptp.equidistant tptp.v tptp.u tptp.v @t45)) % 0.48/0.64 (define @t48 () (tptp.equidistant tptp.v @t45 tptp.u tptp.v)) % 0.48/0.64 (define @t49 () (not @t48)) % 0.48/0.64 (define @t50 () (or @t49 @t47)) % 0.48/0.64 (define @t51 () (@list false false)) % 0.48/0.64 (define @t52 () (tptp.equidistant tptp.v tptp.u tptp.v @t44)) % 0.48/0.64 (define @t53 () (tptp.equidistant tptp.v @t44 tptp.v tptp.u)) % 0.48/0.64 (define @t54 () (not @t53)) % 0.48/0.64 (define @t55 () (or @t54 @t52)) % 0.48/0.64 (define @t56 () (= tptp.v tptp.u)) % 0.48/0.64 (define @t57 () (tptp.equidistant tptp.v @t44 tptp.v @t45)) % 0.48/0.64 (define @t58 () (not @t57)) % 0.48/0.64 (define @t59 () (tptp.between tptp.u tptp.v @t45)) % 0.48/0.64 (define @t60 () (not @t59)) % 0.48/0.64 (define @t61 () (tptp.between tptp.u tptp.v @t44)) % 0.48/0.64 (define @t62 () (not @t61)) % 0.48/0.64 (define @t63 () (or @t62 @t60 @t58 @t56 @t46)) % 0.48/0.64 (define @t64 () (not @t47)) % 0.48/0.64 (define @t65 () (not @t52)) % 0.48/0.64 (define @t66 () (or @t65 @t64 @t57)) % 0.48/0.64 (define @t67 () (not @t66)) % 0.48/0.64 (assume @p1 (forall @t3 (tptp.equidistant @t1 @t2 @t2 @t1))) % 0.48/0.64 (assume @p2 @t8) % 0.48/0.64 (assume @p3 (forall (@list @t1 @t2 @t7) (or (not (tptp.equidistant @t1 @t2 @t7 @t7)) @t9))) % 0.48/0.64 (assume @p4 (forall (@list @t1 @t2 @t4 @t6) (tptp.between @t1 @t2 @t10))) % 0.48/0.64 (assume @p5 (forall (@list @t2 @t1 @t4 @t6) (tptp.equidistant @t2 @t10 @t4 @t6))) % 0.48/0.64 (assume @p6 (forall (@list @t1 @t2 @t14 @t13 @t7 @t12 @t6 @t11) (or (not (tptp.equidistant @t1 @t2 @t14 @t13)) (not (tptp.equidistant @t2 @t7 @t13 @t12)) (not (tptp.equidistant @t1 @t6 @t14 @t11)) (not (tptp.equidistant @t2 @t6 @t13 @t11)) (not @t15) (not (tptp.between @t14 @t13 @t12)) @t9 (tptp.equidistant @t7 @t6 @t12 @t11)))) % 0.48/0.64 (assume @p7 (forall @t3 (or (not (tptp.between @t1 @t2 @t1)) @t9))) % 0.48/0.64 (assume @p8 (forall @t20 (or @t19 @t18 (tptp.between @t6 @t17 @t2)))) % 0.48/0.64 (assume @p9 (forall @t20 (or @t19 @t18 (tptp.between @t1 @t17 @t16)))) % 0.48/0.64 (assume @p10 (not (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3))) % 0.48/0.64 (assume @p11 (not (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1))) % 0.48/0.64 (assume @p12 (not (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2))) % 0.48/0.64 (assume @p13 (forall (@list @t1 @t4 @t6 @t2 @t7) (or (not (tptp.equidistant @t1 @t4 @t1 @t6)) (not (tptp.equidistant @t2 @t4 @t2 @t6)) (not (tptp.equidistant @t7 @t4 @t7 @t6)) @t15 (tptp.between @t2 @t7 @t1) (tptp.between @t7 @t1 @t2) (= @t4 @t6)))) % 0.48/0.64 (assume @p14 (forall @t25 (or @t24 @t23 @t22 (tptp.between @t16 @t6 @t21)))) % 0.48/0.64 (assume @p15 (forall @t25 (or @t24 @t23 @t22 (tptp.between @t16 @t1 @t26)))) % 0.48/0.64 (assume @p16 (forall @t25 (or @t24 @t23 @t22 (tptp.between @t21 @t2 @t26)))) % 0.48/0.64 (assume @p17 (forall @t31 (or @t30 @t29 @t28 @t23 (tptp.between @t11 @t27 @t14)))) % 0.48/0.64 (assume @p18 (forall @t31 (or @t30 @t29 @t28 @t23 (tptp.equidistant @t16 @t4 @t16 @t27)))) % 0.48/0.64 (assume @p19 (forall @t33 (= @t32 (tptp.extension @t16 @t6 @t16 @t6)))) % 0.48/0.64 (assume @p20 (forall @t33 (tptp.equidistant @t16 @t6 @t16 @t6))) % 0.48/0.64 (assume @p21 (forall @t35 (or @t34 (tptp.equidistant @t4 @t1 @t16 @t6)))) % 0.48/0.64 (assume @p22 (forall @t35 (or @t34 (tptp.equidistant @t6 @t16 @t4 @t1)))) % 0.48/0.64 (assume @p23 (forall @t35 (or @t34 (tptp.equidistant @t16 @t6 @t1 @t4)))) % 0.48/0.64 (assume @p24 (forall @t35 (or @t34 (tptp.equidistant @t6 @t16 @t1 @t4)))) % 0.48/0.64 (assume @p25 (forall @t35 (or @t34 (tptp.equidistant @t4 @t1 @t6 @t16)))) % 0.48/0.64 (assume @p26 (forall @t35 (or @t34 (tptp.equidistant @t1 @t4 @t16 @t6)))) % 0.48/0.64 (assume @p27 (forall @t35 (or @t34 (tptp.equidistant @t1 @t4 @t6 @t16)))) % 0.48/0.64 (assume @p28 (forall (@list @t16 @t6 @t4 @t1 @t2 @t7) (or @t34 (not (tptp.equidistant @t4 @t1 @t2 @t7)) (tptp.equidistant @t16 @t6 @t2 @t7)))) % 0.48/0.64 (assume @p29 (forall (@list @t6 @t16 @t4) (= @t6 (tptp.extension @t16 @t6 @t4 @t4)))) % 0.48/0.64 (assume @p30 (forall (@list @t2 @t16 @t6 @t4 @t1) (or (not (= @t2 (tptp.extension @t16 @t6 @t4 @t1))) (tptp.between @t16 @t6 @t2)))) % 0.48/0.64 (assume @p31 (forall @t33 (tptp.between @t16 @t6 @t32))) % 0.48/0.64 (assume @p32 (forall @t36 (tptp.equidistant @t6 @t32 @t16 @t6))) % 0.48/0.64 (assume @p33 (forall @t33 (or (not @t38) @t37))) % 0.48/0.64 (assume @p34 (forall (@list @t16) (= @t16 (tptp.reflection @t16 @t16)))) % 0.48/0.64 (assume @p35 (forall @t36 (or (not @t37) @t38))) % 0.48/0.64 (assume @p36 (forall @t33 (tptp.equidistant @t16 @t16 @t6 @t6))) % 0.48/0.64 (assume @p37 (forall (@list @t16 @t6 @t40 @t11 @t4 @t39) (or (not (tptp.equidistant @t16 @t6 @t40 @t11)) (not (tptp.equidistant @t6 @t4 @t11 @t39)) @t19 (not (tptp.between @t40 @t11 @t39)) (tptp.equidistant @t16 @t4 @t40 @t39)))) % 0.48/0.64 (assume @p38 @t43) % 0.48/0.64 (assume @p39 (not (= tptp.u tptp.v))) % 0.48/0.64 (assume @p40 (not @t46)) % 0.48/0.64 (step @p41 :rule instantiate :premises (@p26) :args ((@list tptp.v @t45 tptp.u tptp.v))) % 0.48/0.64 (step @p42 :rule instantiate :premises (@p5) :args ((@list tptp.v tptp.u tptp.u tptp.v))) % 0.48/0.64 (step @p43 :rule cnf_or_pos :args (@t50)) % 0.48/0.64 (step @p44 :rule reordering :premises (@p43) :args ((or @t49 @t47 (not @t50)))) % 0.48/0.64 (step @p45 :rule chain_m_resolution :premises (@p44 @p42 @p41) :args (@t47 @t51 (@list @t48 @t50))) % 0.48/0.64 (step @p46 :rule instantiate :premises (@p21) :args ((@list tptp.v @t44 tptp.v tptp.u))) % 0.48/0.64 (step @p47 :rule instantiate :premises (@p5) :args ((@list tptp.v tptp.u tptp.v tptp.u))) % 0.48/0.64 (step @p48 :rule cnf_or_pos :args (@t55)) % 0.48/0.64 (step @p49 :rule reordering :premises (@p48) :args ((or @t54 @t52 (not @t55)))) % 0.48/0.64 (step @p50 :rule chain_m_resolution :premises (@p49 @p47 @p46) :args (@t52 @t51 (@list @t53 @t55))) % 0.48/0.64 (step @p51 :rule eq-symm :args (@t4 @t1)) % 0.48/0.64 (step @p52 :rule eq-symm :args (@t16 @t6)) % 0.48/0.64 (step @p53 :rule refl :args (@t41)) % 0.48/0.64 (step @p54 :rule refl :args (@t28)) % 0.48/0.64 (step @p55 :rule refl :args (@t19)) % 0.48/0.64 (step @p56 :rule nary_cong :premises (@p55 @p54 @p53 @p52 @p51) :args (@t42)) % 0.48/0.64 (step @p57 :rule cong :premises (@p56) :args (@t43)) % 0.48/0.64 (step @p58 :rule eq_resolve :premises (@p38 @p57)) % 0.48/0.64 (step @p59 :rule instantiate :premises (@p58) :args ((@list tptp.u tptp.v @t44 @t45))) % 0.48/0.64 (step @p60 :rule instantiate :premises (@p4) :args ((@list tptp.u tptp.v tptp.u tptp.v))) % 0.48/0.64 (step @p61 :rule instantiate :premises (@p4) :args ((@list tptp.u tptp.v tptp.v tptp.u))) % 0.48/0.64 (step @p62 :rule symm :premises (@p39)) % 0.48/0.64 (step @p63 :rule cnf_or_pos :args (@t63)) % 0.48/0.64 (step @p64 :rule reordering :premises (@p63) :args ((or @t46 @t56 @t62 @t60 @t58 (not @t63)))) % 0.48/0.64 (step @p65 :rule chain_m_resolution :premises (@p64 @p40 @p62 @p61 @p60 @p59) :args (@t58 (@list true true false false false) (@list @t46 @t56 @t61 @t59 @t63))) % 0.48/0.64 (step @p66 :rule cnf_or_pos :args (@t66)) % 0.48/0.64 (step @p67 :rule reordering :premises (@p66) :args ((or @t57 @t65 @t64 @t67))) % 0.48/0.64 (step @p68 :rule chain_m_resolution :premises (@p67 @p65 @p50 @p45) :args (@t67 (@list true false false) (@list @t57 @t52 @t47))) % 0.48/0.64 (assume-push @p75 @t8) % 0.48/0.64 (step @p70 :rule instantiate :premises (@p2) :args ((@list tptp.v tptp.u tptp.v @t44 tptp.v @t45))) % 0.48/0.64 (step-pop @p76 :rule scope :premises (@p70)) % 0.48/0.64 (step @p71 :rule process_scope :premises (@p76) :args (@t66)) % 0.48/0.64 (step @p73 :rule implies_elim :premises (@p71)) % 0.48/0.64 (step @p74 false :rule chain_m_resolution :premises (@p73 @p68 @p2) :args (false (@list true false) (@list @t66 @t8))) % 0.48/0.64 ) % 0.48/0.65 % SZS output end Proof % 0.48/0.65 % cvc5 exiting %------------------------------------------------------------------------------