↑ Up

cvc5---1.3.4.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : GEO026-2 : TPTP v9.2.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n021.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 32.10s 32.34s
% Output   : Proof 32.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO026-2 : TPTP v9.2.1. Released v1.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.34  % Computer : n021.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit : 300
% 0.15/0.34  % WCLimit  : 300
% 0.15/0.34  % DateTime : Mon Jun  1 23:10:19 EDT 2026
% 0.15/0.34  % CPUTime  : 
% 0.30/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.30/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 15.41/15.65  --- Run --no-e-matching --full-saturate-quant at 6...
% 21.51/21.70  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 6...
% 27.51/27.73  --- Run --finite-model-find --uf-ss=no-minimal at 6...
% 32.10/32.34  % SZS status Unsatisfiable
% 32.10/32.34  % SZS output start Proof
% 32.10/32.34  (
% 32.10/32.34  (declare-sort $$unsorted 0)
% 32.10/32.34  (declare-const tptp.equidistant (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 32.10/32.34  (declare-const tptp.extension (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted))
% 32.10/32.34  (declare-const tptp.between (-> $$unsorted $$unsorted $$unsorted Bool))
% 32.10/32.34  (declare-const tptp.v $$unsorted)
% 32.10/32.34  (declare-const tptp.inner_pasch (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted))
% 32.10/32.34  (declare-const tptp.x $$unsorted)
% 32.10/32.34  (declare-const tptp.lower_dimension_point_3 $$unsorted)
% 32.10/32.34  (declare-const tptp.continuous (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted))
% 32.10/32.34  (declare-const tptp.lower_dimension_point_2 $$unsorted)
% 32.10/32.34  (declare-const tptp.euclid1 (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted))
% 32.10/32.34  (declare-const tptp.euclid2 (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted))
% 32.10/32.34  (declare-const tptp.lower_dimension_point_1 $$unsorted)
% 32.10/32.34  (declare-const tptp.w $$unsorted)
% 32.10/32.34  (declare-const tptp.u $$unsorted)
% 32.10/32.34  (define @t1 () (@var "X" $$unsorted))
% 32.10/32.34  (define @t2 () (@var "Y" $$unsorted))
% 32.10/32.34  (define @t3 () (@list @t1 @t2))
% 32.10/32.34  (define @t4 () (@var "W" $$unsorted))
% 32.10/32.34  (define @t5 () (@var "V2" $$unsorted))
% 32.10/32.34  (define @t6 () (@var "V" $$unsorted))
% 32.10/32.34  (define @t7 () (@var "Z" $$unsorted))
% 32.10/32.34  (define @t8 () (= @t1 @t2))
% 32.10/32.34  (define @t9 () (forall (@list @t1 @t2 @t7) (or (not (tptp.equidistant @t1 @t2 @t7 @t7)) @t8)))
% 32.10/32.34  (define @t10 () (tptp.extension @t1 @t2 @t4 @t6))
% 32.10/32.34  (define @t11 () (@var "V1" $$unsorted))
% 32.10/32.34  (define @t12 () (@var "Z1" $$unsorted))
% 32.10/32.34  (define @t13 () (@var "Y1" $$unsorted))
% 32.10/32.34  (define @t14 () (@var "X1" $$unsorted))
% 32.10/32.34  (define @t15 () (tptp.between @t1 @t2 @t7))
% 32.10/32.34  (define @t16 () (@var "U" $$unsorted))
% 32.10/32.34  (define @t17 () (tptp.inner_pasch @t16 @t6 @t4 @t1 @t2))
% 32.10/32.34  (define @t18 () (not (tptp.between @t2 @t1 @t4)))
% 32.10/32.34  (define @t19 () (not (tptp.between @t16 @t6 @t4)))
% 32.10/32.34  (define @t20 () (@list @t16 @t6 @t4 @t2 @t1))
% 32.10/32.34  (define @t21 () (tptp.euclid1 @t16 @t6 @t4 @t1 @t2))
% 32.10/32.34  (define @t22 () (= @t16 @t4))
% 32.10/32.34  (define @t23 () (not (tptp.between @t6 @t4 @t1)))
% 32.10/32.34  (define @t24 () (not (tptp.between @t16 @t4 @t2)))
% 32.10/32.35  (define @t25 () (@list @t16 @t4 @t2 @t6 @t1))
% 32.10/32.35  (define @t26 () (tptp.euclid2 @t16 @t6 @t4 @t1 @t2))
% 32.10/32.35  (define @t27 () (tptp.continuous @t16 @t6 @t11 @t4 @t1 @t14))
% 32.10/32.35  (define @t28 () (not (tptp.between @t16 @t6 @t1)))
% 32.10/32.35  (define @t29 () (not (tptp.equidistant @t16 @t1 @t16 @t14)))
% 32.10/32.35  (define @t30 () (not (tptp.equidistant @t16 @t6 @t16 @t11)))
% 32.10/32.35  (define @t31 () (@list @t16 @t6 @t11 @t1 @t14 @t4))
% 32.10/32.35  (define @t32 () (tptp.between tptp.u tptp.v tptp.w))
% 32.10/32.35  (define @t33 () (tptp.between tptp.u tptp.v tptp.x))
% 32.10/32.35  (define @t34 () (tptp.equidistant tptp.v tptp.w tptp.v tptp.x))
% 32.10/32.35  (define @t35 () (= tptp.u tptp.v))
% 32.10/32.35  (define @t36 () (= tptp.w tptp.x))
% 32.10/32.35  (define @t37 () (tptp.equidistant tptp.v tptp.x tptp.v tptp.x))
% 32.10/32.35  (define @t38 () (not @t34))
% 32.10/32.35  (define @t39 () (or @t38 @t38 @t37))
% 32.10/32.35  (define @t40 () (@list false false))
% 32.10/32.35  (define @t41 () (tptp.equidistant tptp.u tptp.x tptp.u tptp.x))
% 32.10/32.35  (define @t42 () (tptp.equidistant tptp.x tptp.u tptp.u tptp.x))
% 32.10/32.35  (define @t43 () (not @t42))
% 32.10/32.35  (define @t44 () (or @t43 @t43 @t41))
% 32.10/32.35  (define @t45 () (tptp.equidistant tptp.u tptp.v tptp.u tptp.v))
% 32.10/32.35  (define @t46 () (tptp.equidistant tptp.v tptp.u tptp.u tptp.v))
% 32.10/32.35  (define @t47 () (not @t46))
% 32.10/32.35  (define @t48 () (or @t47 @t47 @t45))
% 32.10/32.35  (define @t49 () (tptp.equidistant tptp.w tptp.x tptp.x tptp.x))
% 32.10/32.35  (define @t50 () (not @t33))
% 32.10/32.35  (define @t51 () (not @t32))
% 32.10/32.35  (define @t52 () (not @t37))
% 32.10/32.35  (define @t53 () (not @t41))
% 32.10/32.35  (define @t54 () (not @t45))
% 32.10/32.35  (define @t55 () (or @t54 @t38 @t53 @t52 @t51 @t50 @t35 @t49))
% 32.10/32.35  (define @t56 () (not @t49))
% 32.10/32.35  (define @t57 () (or @t56 @t36))
% 32.10/32.35  (define @t58 () (not @t57))
% 32.10/32.35  (define @t59 () (@list true false))
% 32.10/32.35  (assume @p1 (forall @t3 (tptp.equidistant @t1 @t2 @t2 @t1)))
% 32.10/32.35  (assume @p2 (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))))
% 32.10/32.35  (assume @p3 @t9)
% 32.10/32.35  (assume @p4 (forall (@list @t1 @t2 @t4 @t6) (tptp.between @t1 @t2 @t10)))
% 32.10/32.35  (assume @p5 (forall (@list @t2 @t1 @t4 @t6) (tptp.equidistant @t2 @t10 @t4 @t6)))
% 32.10/32.35  (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)) @t8 (tptp.equidistant @t7 @t6 @t12 @t11))))
% 32.10/32.35  (assume @p7 (forall @t3 (or (not (tptp.between @t1 @t2 @t1)) @t8)))
% 32.10/32.35  (assume @p8 (forall @t20 (or @t19 @t18 (tptp.between @t6 @t17 @t2))))
% 32.10/32.35  (assume @p9 (forall @t20 (or @t19 @t18 (tptp.between @t1 @t17 @t16))))
% 32.10/32.35  (assume @p10 (not (tptp.between tptp.lower_dimension_point_1 tptp.lower_dimension_point_2 tptp.lower_dimension_point_3)))
% 32.10/32.35  (assume @p11 (not (tptp.between tptp.lower_dimension_point_2 tptp.lower_dimension_point_3 tptp.lower_dimension_point_1)))
% 32.10/32.35  (assume @p12 (not (tptp.between tptp.lower_dimension_point_3 tptp.lower_dimension_point_1 tptp.lower_dimension_point_2)))
% 32.10/32.35  (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))))
% 32.10/32.35  (assume @p14 (forall @t25 (or @t24 @t23 @t22 (tptp.between @t16 @t6 @t21))))
% 32.10/32.35  (assume @p15 (forall @t25 (or @t24 @t23 @t22 (tptp.between @t16 @t1 @t26))))
% 32.10/32.35  (assume @p16 (forall @t25 (or @t24 @t23 @t22 (tptp.between @t21 @t2 @t26))))
% 32.10/32.35  (assume @p17 (forall @t31 (or @t30 @t29 @t28 @t23 (tptp.between @t11 @t27 @t14))))
% 32.10/32.35  (assume @p18 (forall @t31 (or @t30 @t29 @t28 @t23 (tptp.equidistant @t16 @t4 @t16 @t27))))
% 32.10/32.35  (assume @p19 @t32)
% 32.10/32.35  (assume @p20 @t33)
% 32.10/32.35  (assume @p21 @t34)
% 32.10/32.35  (assume @p22 (not @t35))
% 32.10/32.35  (assume @p23 (not @t36))
% 32.10/32.35  (step @p24 :rule instantiate :premises (@p6) :args ((@list tptp.u tptp.v tptp.u tptp.v tptp.w tptp.x tptp.x tptp.x)))
% 32.10/32.35  (step @p25 :rule instantiate :premises (@p2) :args ((@list tptp.v tptp.w tptp.v tptp.x tptp.v tptp.x)))
% 32.10/32.35  (step @p26 :rule cnf_or_pos :args (@t39))
% 32.10/32.35  (step @p27 :rule factoring :premises (@p26))
% 32.10/32.35  (step @p28 :rule reordering :premises (@p27) :args ((or @t38 @t37 (not @t39))))
% 32.10/32.35  (step @p29 :rule chain_m_resolution :premises (@p28 @p21 @p25) :args (@t37 @t40 (@list @t34 @t39)))
% 32.10/32.35  (step @p30 :rule instantiate :premises (@p2) :args ((@list tptp.x tptp.u tptp.u tptp.x tptp.u tptp.x)))
% 32.10/32.35  (step @p31 :rule instantiate :premises (@p1) :args ((@list tptp.x tptp.u)))
% 32.10/32.35  (step @p32 :rule cnf_or_pos :args (@t44))
% 32.10/32.35  (step @p33 :rule factoring :premises (@p32))
% 32.10/32.35  (step @p34 :rule reordering :premises (@p33) :args ((or @t43 @t41 (not @t44))))
% 32.10/32.35  (step @p35 :rule chain_m_resolution :premises (@p34 @p31 @p30) :args (@t41 @t40 (@list @t42 @t44)))
% 32.10/32.35  (step @p36 :rule instantiate :premises (@p2) :args ((@list tptp.v tptp.u tptp.u tptp.v tptp.u tptp.v)))
% 32.10/32.35  (step @p37 :rule instantiate :premises (@p1) :args ((@list tptp.v tptp.u)))
% 32.10/32.35  (step @p38 :rule cnf_or_pos :args (@t48))
% 32.10/32.35  (step @p39 :rule factoring :premises (@p38))
% 32.10/32.35  (step @p40 :rule reordering :premises (@p39) :args ((or @t47 @t45 (not @t48))))
% 32.10/32.35  (step @p41 :rule chain_m_resolution :premises (@p40 @p37 @p36) :args (@t45 @t40 (@list @t46 @t48)))
% 32.10/32.35  (step @p42 :rule cnf_or_pos :args (@t55))
% 32.10/32.35  (step @p43 :rule reordering :premises (@p42) :args ((or @t35 @t51 @t50 @t38 @t54 @t53 @t52 @t49 (not @t55))))
% 32.10/32.35  (step @p44 :rule chain_m_resolution :premises (@p43 @p22 @p19 @p20 @p21 @p41 @p35 @p29 @p24) :args (@t49 (@list true false false false false false false false) (@list @t35 @t32 @t33 @t34 @t45 @t41 @t37 @t55)))
% 32.10/32.35  (step @p45 :rule cnf_or_pos :args (@t57))
% 32.10/32.35  (step @p46 :rule reordering :premises (@p45) :args ((or @t36 @t56 @t58)))
% 32.10/32.35  (step @p47 :rule chain_m_resolution :premises (@p46 @p23 @p44) :args (@t58 @t59 (@list @t36 @t49)))
% 32.10/32.35  (assume-push @p54 @t9)
% 32.10/32.35  (step @p49 :rule instantiate :premises (@p3) :args ((@list tptp.w tptp.x tptp.x)))
% 32.10/32.35  (step-pop @p55 :rule scope :premises (@p49))
% 32.10/32.35  (step @p50 :rule process_scope :premises (@p55) :args (@t57))
% 32.10/32.35  (step @p52 :rule implies_elim :premises (@p50))
% 32.10/32.35  (step @p53 false :rule chain_m_resolution :premises (@p52 @p47 @p3) :args (false @t59 (@list @t57 @t9)))
% 32.10/32.35  )
% 32.10/32.36  % SZS output end Proof
% 32.10/32.36  % cvc5 exiting
%------------------------------------------------------------------------------