%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n010.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:04:58 AM UTC 2026 % Result : Theorem 0.21s 0.53s % Output : Proof 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.11/0.37 % Computer : n010.cluster.edu % 0.11/0.37 % Model : x86_64 x86_64 % 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.37 % Memory : 8046.5625MB % 0.11/0.37 % OS : Linux 6.8.0-71-generic % 0.11/0.37 % CPULimit : 300 % 0.11/0.37 % WCLimit : 300 % 0.11/0.37 % DateTime : Mon Sep 7 14:00:56 UTC 2026 % 0.11/0.38 % CPUTime : % 0.11/0.46 %----Proving TF0_NAR, FOF, or CNF % 0.21/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.21/0.53 % SZS status Theorem % 0.21/0.53 % SZS output start Proof % 0.21/0.53 ( % 0.21/0.53 (declare-sort $$unsorted 0) % 0.21/0.53 (declare-const tptp.val (-> $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.v5 $$unsorted) % 0.21/0.53 (declare-const tptp.gteq $$unsorted) % 0.21/0.53 (declare-const tptp.lower_tag (-> $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.eq $$unsorted) % 0.21/0.53 (declare-const tptp.prec (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.box_verdict (-> $$unsorted $$unsorted $$unsorted)) % 0.21/0.53 (declare-const tptp.lt $$unsorted) % 0.21/0.53 (declare-const tptp.less (-> $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.leq (-> $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.in_ropen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.axis_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.gt $$unsorted) % 0.21/0.53 (declare-const tptp.is_ep_type (-> $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.conflict $$unsorted) % 0.21/0.53 (declare-const tptp.in_lopen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.c $$unsorted) % 0.21/0.53 (declare-const tptp.in_open (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.axis_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.upper_tag (-> $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.o $$unsorted) % 0.21/0.53 (declare-const tptp.is_verdict (-> $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.lteq $$unsorted) % 0.21/0.53 (declare-const tptp.axis_subsumes (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.disjoint (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.compatible $$unsorted) % 0.21/0.53 (declare-const tptp.in_closed (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.21/0.53 (declare-const tptp.unknown $$unsorted) % 0.21/0.53 (define @t1 () (@var "X" $$unsorted)) % 0.21/0.53 (define @t2 () (@list @t1)) % 0.21/0.53 (define @t3 () (@var "Z" $$unsorted)) % 0.21/0.53 (define @t4 () (tptp.less @t1 @t3)) % 0.21/0.53 (define @t5 () (@var "Y" $$unsorted)) % 0.21/0.53 (define @t6 () (tptp.less @t5 @t3)) % 0.21/0.53 (define @t7 () (tptp.less @t1 @t5)) % 0.21/0.53 (define @t8 () (@list @t1 @t5 @t3)) % 0.21/0.53 (define @t9 () (= @t1 @t5)) % 0.21/0.53 (define @t10 () (@list @t1 @t5)) % 0.21/0.53 (define @t11 () (tptp.leq @t1 @t5)) % 0.21/0.53 (define @t12 () (forall @t10 (= @t11 (or @t7 @t9)))) % 0.21/0.53 (define @t13 () (tptp.leq @t5 @t3)) % 0.21/0.53 (define @t14 () (@var "B" $$unsorted)) % 0.21/0.53 (define @t15 () (tptp.leq @t1 @t14)) % 0.21/0.53 (define @t16 () (@var "A" $$unsorted)) % 0.21/0.53 (define @t17 () (tptp.leq @t16 @t1)) % 0.21/0.53 (define @t18 () (@list @t1 @t16 @t14)) % 0.21/0.53 (define @t19 () (tptp.less @t16 @t1)) % 0.21/0.53 (define @t20 () (tptp.less @t1 @t14)) % 0.21/0.53 (define @t21 () (@var "I2hi" $$unsorted)) % 0.21/0.53 (define @t22 () (@var "I2lo" $$unsorted)) % 0.21/0.53 (define @t23 () (tptp.in_closed @t1 @t22 @t21)) % 0.21/0.53 (define @t24 () (@var "I1hi" $$unsorted)) % 0.21/0.53 (define @t25 () (@var "I1lo" $$unsorted)) % 0.21/0.53 (define @t26 () (tptp.in_closed @t1 @t25 @t24)) % 0.21/0.53 (define @t27 () (exists @t2 (and @t26 @t23))) % 0.21/0.53 (define @t28 () (@list @t25 @t24 @t22 @t21)) % 0.21/0.53 (define @t29 () (@var "V" $$unsorted)) % 0.21/0.53 (define @t30 () (@var "V2" $$unsorted)) % 0.21/0.53 (define @t31 () (@var "V1" $$unsorted)) % 0.21/0.53 (define @t32 () (tptp.box_verdict @t31 @t30)) % 0.21/0.53 (define @t33 () (= @t32 tptp.conflict)) % 0.21/0.53 (define @t34 () (= @t30 tptp.conflict)) % 0.21/0.53 (define @t35 () (= @t31 tptp.conflict)) % 0.21/0.53 (define @t36 () (tptp.is_verdict @t30)) % 0.21/0.53 (define @t37 () (tptp.is_verdict @t31)) % 0.21/0.53 (define @t38 () (@list @t31 @t30)) % 0.21/0.53 (define @t39 () (= @t32 tptp.compatible)) % 0.21/0.53 (define @t40 () (= @t32 tptp.unknown)) % 0.21/0.53 (define @t41 () (@var "T" $$unsorted)) % 0.21/0.53 (define @t42 () (@var "L" $$unsorted)) % 0.21/0.53 (define @t43 () (@var "U" $$unsorted)) % 0.21/0.53 (define @t44 () (@list @t43 @t42)) % 0.21/0.53 (define @t45 () (tptp.leq @t43 @t42)) % 0.21/0.53 (define @t46 () (tptp.prec @t43 @t42 tptp.o tptp.o)) % 0.21/0.53 (define @t47 () (forall @t44 (= @t46 @t45))) % 0.21/0.53 (define @t48 () (@var "CL1" $$unsorted)) % 0.21/0.53 (define @t49 () (@var "CU2" $$unsorted)) % 0.21/0.53 (define @t50 () (@var "L1" $$unsorted)) % 0.21/0.53 (define @t51 () (@var "U2" $$unsorted)) % 0.21/0.53 (define @t52 () (@var "CL2" $$unsorted)) % 0.21/0.53 (define @t53 () (@var "CU1" $$unsorted)) % 0.21/0.53 (define @t54 () (@var "L2" $$unsorted)) % 0.21/0.53 (define @t55 () (@var "U1" $$unsorted)) % 0.21/0.53 (define @t56 () (tptp.prec tptp.v5 tptp.v5 tptp.o tptp.o)) % 0.21/0.53 (define @t57 () (tptp.leq tptp.v5 tptp.v5)) % 0.21/0.53 (define @t58 () (forall @t44 (= @t45 @t46))) % 0.21/0.53 (define @t59 () (= @t57 @t56)) % 0.21/0.53 (define @t60 () (@list tptp.v5 tptp.v5)) % 0.21/0.53 (define @t61 () (= @t56 @t57)) % 0.21/0.53 (define @t62 () (not @t57)) % 0.21/0.53 (define @t63 () (@list true false)) % 0.21/0.53 (define @t64 () (tptp.less tptp.v5 tptp.v5)) % 0.21/0.53 (define @t65 () (or @t64 (= tptp.v5 tptp.v5))) % 0.21/0.53 (define @t66 () (= @t57 @t65)) % 0.21/0.53 (assume @p1 (forall @t2 (not (tptp.less @t1 @t1)))) % 0.21/0.53 (assume @p2 (forall @t8 (=> (and @t7 @t6) @t4))) % 0.21/0.53 (assume @p3 (forall @t10 (or @t7 @t9 (tptp.less @t5 @t1)))) % 0.21/0.53 (assume @p4 @t12) % 0.21/0.53 (assume @p5 (forall @t10 (=> (and @t11 (tptp.leq @t5 @t1)) @t9))) % 0.21/0.53 (assume @p6 (forall @t10 (=> @t7 @t11))) % 0.21/0.53 (assume @p7 (forall @t8 (=> (and @t11 @t6) @t4))) % 0.21/0.53 (assume @p8 (forall @t8 (=> (and @t7 @t13) @t4))) % 0.21/0.53 (assume @p9 (forall @t8 (=> (and @t11 @t13) (tptp.leq @t1 @t3)))) % 0.21/0.53 (assume @p10 (forall @t18 (= (tptp.in_closed @t1 @t16 @t14) (and @t17 @t15)))) % 0.21/0.53 (assume @p11 (forall @t18 (= (tptp.in_lopen @t1 @t16 @t14) (and @t19 @t15)))) % 0.21/0.53 (assume @p12 (forall @t18 (= (tptp.in_ropen @t1 @t16 @t14) (and @t17 @t20)))) % 0.21/0.53 (assume @p13 (forall @t18 (= (tptp.in_open @t1 @t16 @t14) (and @t19 @t20)))) % 0.21/0.53 (assume @p14 (forall @t28 (= (tptp.axis_conflict @t25 @t24 @t22 @t21) (not @t27)))) % 0.21/0.53 (assume @p15 (forall @t28 (= (tptp.axis_compatible @t25 @t24 @t22 @t21) @t27))) % 0.21/0.53 (assume @p16 (forall @t28 (= (tptp.axis_subsumes @t25 @t24 @t22 @t21) (forall @t2 (=> @t26 @t23))))) % 0.21/0.53 (assume @p17 (tptp.is_verdict tptp.conflict)) % 0.21/0.53 (assume @p18 (tptp.is_verdict tptp.compatible)) % 0.21/0.53 (assume @p19 (tptp.is_verdict tptp.unknown)) % 0.21/0.53 (assume @p20 (not (= tptp.conflict tptp.compatible))) % 0.21/0.53 (assume @p21 (not (= tptp.conflict tptp.unknown))) % 0.21/0.53 (assume @p22 (not (= tptp.compatible tptp.unknown))) % 0.21/0.53 (assume @p23 (forall (@list @t29) (=> (tptp.is_verdict @t29) (or (= @t29 tptp.conflict) (= @t29 tptp.compatible) (= @t29 tptp.unknown))))) % 0.21/0.53 (assume @p24 (forall @t38 (=> (and @t37 @t36 (or @t35 @t34)) @t33))) % 0.21/0.53 (assume @p25 (forall @t38 (=> (and @t37 @t36 (= @t31 tptp.compatible) (= @t30 tptp.compatible)) @t39))) % 0.21/0.53 (assume @p26 (forall @t38 (=> (and @t37 @t36 (or (= @t31 tptp.unknown) (= @t30 tptp.unknown)) (not @t35) (not @t34)) @t40))) % 0.21/0.53 (assume @p27 (forall @t38 (=> (and @t37 @t36) (or @t33 @t39 @t40)))) % 0.21/0.53 (assume @p28 (tptp.is_ep_type tptp.c)) % 0.21/0.53 (assume @p29 (tptp.is_ep_type tptp.o)) % 0.21/0.53 (assume @p30 (not (= tptp.c tptp.o))) % 0.21/0.53 (assume @p31 (forall (@list @t41) (=> (tptp.is_ep_type @t41) (or (= @t41 tptp.c) (= @t41 tptp.o))))) % 0.21/0.53 (assume @p32 (forall @t44 (= (tptp.prec @t43 @t42 tptp.c tptp.c) (tptp.less @t43 @t42)))) % 0.21/0.53 (assume @p33 (forall @t44 (= (tptp.prec @t43 @t42 tptp.o tptp.c) @t45))) % 0.21/0.53 (assume @p34 (forall @t44 (= (tptp.prec @t43 @t42 tptp.c tptp.o) @t45))) % 0.21/0.53 (assume @p35 @t47) % 0.21/0.53 (assume @p36 (forall (@list @t50 @t55 @t48 @t53 @t54 @t51 @t52 @t49) (= (tptp.disjoint @t50 @t55 @t48 @t53 @t54 @t51 @t52 @t49) (or (tptp.prec @t55 @t54 @t53 @t52) (tptp.prec @t51 @t50 @t49 @t48))))) % 0.21/0.53 (assume @p37 (tptp.lower_tag tptp.eq tptp.c)) % 0.21/0.53 (assume @p38 (tptp.lower_tag tptp.lteq tptp.c)) % 0.21/0.53 (assume @p39 (tptp.lower_tag tptp.gteq tptp.c)) % 0.21/0.53 (assume @p40 (tptp.lower_tag tptp.lt tptp.c)) % 0.21/0.53 (assume @p41 (tptp.lower_tag tptp.gt tptp.o)) % 0.21/0.53 (assume @p42 (tptp.upper_tag tptp.eq tptp.c)) % 0.21/0.53 (assume @p43 (tptp.upper_tag tptp.lteq tptp.c)) % 0.21/0.53 (assume @p44 (tptp.upper_tag tptp.gteq tptp.c)) % 0.21/0.53 (assume @p45 (tptp.upper_tag tptp.lt tptp.o)) % 0.21/0.53 (assume @p46 (tptp.upper_tag tptp.gt tptp.c)) % 0.21/0.53 (assume @p47 (tptp.val tptp.v5)) % 0.21/0.53 (assume @p48 (not @t56)) % 0.21/0.53 (assume @p49 true) % 0.21/0.53 (step @p50 :rule eq-symm :args (@t46 @t45)) % 0.21/0.53 (step @p51 :rule cong :premises (@p50) :args (@t47)) % 0.21/0.53 (step @p52 :rule eq_resolve :premises (@p35 @p51)) % 0.21/0.53 (step @p53 :rule eq-symm :args (@t57 @t56)) % 0.21/0.53 (step @p54 :rule refl :args (@t58)) % 0.21/0.53 (step @p55 :rule cong :premises (@p54 @p53) :args ((=> @t58 @t59))) % 0.21/0.53 (assume-push @p84 @t58) % 0.21/0.53 (step @p57 :rule instantiate :premises (@p52) :args (@t60)) % 0.21/0.53 (step-pop @p85 :rule scope :premises (@p57)) % 0.21/0.53 (step @p58 :rule process_scope :premises (@p85) :args (@t59)) % 0.21/0.53 (step @p60 :rule eq_resolve :premises (@p58 @p55)) % 0.21/0.53 (step @p61 :rule implies_elim :premises (@p60)) % 0.21/0.53 (step @p62 :rule chain_m_resolution :premises (@p61 @p52) :args (@t61 (@list false) (@list @t58))) % 0.21/0.53 (step @p63 :rule cnf_equiv_pos2 :args (@t61)) % 0.21/0.54 (step @p64 :rule reordering :premises (@p63) :args ((or @t56 @t62 (not @t61)))) % 0.21/0.54 (step @p65 :rule chain_m_resolution :premises (@p64 @p48 @p62) :args (@t62 @t63 (@list @t56 @t61))) % 0.21/0.54 (step @p66 :rule bool-eq-true :args (@t57)) % 0.21/0.54 (step @p67 :rule absorb :args ((= (or @t64 true) true))) % 0.21/0.54 (step @p68 :rule eq-refl :args (tptp.v5)) % 0.21/0.54 (step @p69 :rule refl :args (@t64)) % 0.21/0.54 (step @p70 :rule nary_cong :premises (@p69 @p68) :args (@t65)) % 0.21/0.54 (step @p71 :rule trans :premises (@p70 @p67)) % 0.21/0.54 (step @p72 :rule refl :args (@t57)) % 0.21/0.54 (step @p73 :rule cong :premises (@p72 @p71) :args (@t66)) % 0.21/0.54 (step @p74 :rule trans :premises (@p73 @p66)) % 0.21/0.54 (step @p75 :rule refl :args (@t12)) % 0.21/0.54 (step @p76 :rule cong :premises (@p75 @p74) :args ((=> @t12 @t66))) % 0.21/0.54 (assume-push @p86 @t12) % 0.21/0.54 (step @p78 :rule instantiate :premises (@p4) :args (@t60)) % 0.21/0.54 (step-pop @p87 :rule scope :premises (@p78)) % 0.21/0.54 (step @p79 :rule process_scope :premises (@p87) :args (@t66)) % 0.21/0.54 (step @p81 :rule eq_resolve :premises (@p79 @p76)) % 0.21/0.54 (step @p82 :rule implies_elim :premises (@p81)) % 0.21/0.54 (step @p83 false :rule chain_m_resolution :premises (@p82 @p65 @p4) :args (false @t63 (@list @t57 @t12))) % 0.21/0.54 ) % 0.21/0.54 % SZS output end Proof % 0.21/0.54 % cvc5 exiting %------------------------------------------------------------------------------