%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : MGT088+1 : TPTP v9.3.1. Bugfixed v9.3.1. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n029.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:57 AM UTC 2026 % Result : Theorem 0.18s 0.56s % Output : Proof 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT088+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.05 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.10/0.35 % Computer : n029.cluster.edu % 0.10/0.35 % Model : x86_64 x86_64 % 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.35 % Memory : 8046.5625MB % 0.10/0.35 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 14:24:12 UTC 2026 % 0.10/0.36 % CPUTime : % 0.13/0.43 %----Proving TF0_NAR, FOF, or CNF % 0.18/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.18/0.56 % SZS status Theorem % 0.18/0.56 % SZS output start Proof % 0.18/0.56 ( % 0.18/0.56 (declare-sort $$unsorted 0) % 0.18/0.56 (declare-const tptp.box_verdict (-> $$unsorted $$unsorted $$unsorted)) % 0.18/0.56 (declare-const tptp.less (-> $$unsorted $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.in_lopen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.val (-> $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.conflict $$unsorted) % 0.18/0.56 (declare-const tptp.in_ropen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.axis_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.v0 $$unsorted) % 0.18/0.56 (declare-const tptp.in_open (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.axis_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.v200 $$unsorted) % 0.18/0.56 (declare-const tptp.is_verdict (-> $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.axis_subsumes (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.v400 $$unsorted) % 0.18/0.56 (declare-const tptp.compatible $$unsorted) % 0.18/0.56 (declare-const tptp.v600 $$unsorted) % 0.18/0.56 (declare-const tptp.leq (-> $$unsorted $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.in_closed (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.18/0.56 (declare-const tptp.unknown $$unsorted) % 0.18/0.56 (define @t1 () (@var "X" $$unsorted)) % 0.18/0.56 (define @t2 () (@list @t1)) % 0.18/0.56 (define @t3 () (@var "Z" $$unsorted)) % 0.18/0.56 (define @t4 () (tptp.less @t1 @t3)) % 0.18/0.56 (define @t5 () (@var "Y" $$unsorted)) % 0.18/0.56 (define @t6 () (tptp.less @t5 @t3)) % 0.18/0.56 (define @t7 () (tptp.less @t1 @t5)) % 0.18/0.56 (define @t8 () (@list @t1 @t5 @t3)) % 0.18/0.56 (define @t9 () (= @t1 @t5)) % 0.18/0.56 (define @t10 () (@list @t1 @t5)) % 0.18/0.56 (define @t11 () (tptp.leq @t1 @t5)) % 0.18/0.56 (define @t12 () (forall @t10 (= @t11 (or @t7 @t9)))) % 0.18/0.56 (define @t13 () (tptp.leq @t5 @t3)) % 0.18/0.56 (define @t14 () (@var "B" $$unsorted)) % 0.18/0.56 (define @t15 () (tptp.leq @t1 @t14)) % 0.18/0.56 (define @t16 () (@var "A" $$unsorted)) % 0.18/0.56 (define @t17 () (tptp.leq @t16 @t1)) % 0.18/0.56 (define @t18 () (@list @t1 @t16 @t14)) % 0.18/0.56 (define @t19 () (tptp.less @t16 @t1)) % 0.18/0.56 (define @t20 () (tptp.less @t1 @t14)) % 0.18/0.56 (define @t21 () (@var "I2hi" $$unsorted)) % 0.18/0.56 (define @t22 () (@var "I2lo" $$unsorted)) % 0.18/0.56 (define @t23 () (tptp.in_closed @t1 @t22 @t21)) % 0.18/0.56 (define @t24 () (@var "I1hi" $$unsorted)) % 0.18/0.56 (define @t25 () (@var "I1lo" $$unsorted)) % 0.18/0.56 (define @t26 () (tptp.in_closed @t1 @t25 @t24)) % 0.18/0.56 (define @t27 () (exists @t2 (and @t26 @t23))) % 0.18/0.56 (define @t28 () (@list @t25 @t24 @t22 @t21)) % 0.18/0.56 (define @t29 () (@var "V" $$unsorted)) % 0.18/0.56 (define @t30 () (@var "V2" $$unsorted)) % 0.18/0.56 (define @t31 () (@var "V1" $$unsorted)) % 0.18/0.56 (define @t32 () (tptp.box_verdict @t31 @t30)) % 0.18/0.56 (define @t33 () (= @t32 tptp.conflict)) % 0.18/0.56 (define @t34 () (= @t30 tptp.conflict)) % 0.18/0.56 (define @t35 () (= @t31 tptp.conflict)) % 0.18/0.56 (define @t36 () (tptp.is_verdict @t30)) % 0.18/0.56 (define @t37 () (tptp.is_verdict @t31)) % 0.18/0.56 (define @t38 () (@list @t31 @t30)) % 0.18/0.56 (define @t39 () (= @t32 tptp.compatible)) % 0.18/0.56 (define @t40 () (= @t32 tptp.unknown)) % 0.18/0.56 (define @t41 () (tptp.less tptp.v0 tptp.v400)) % 0.18/0.56 (define @t42 () (tptp.less tptp.v200 tptp.v400)) % 0.18/0.56 (define @t43 () (tptp.in_lopen @t1 tptp.v0 tptp.v400)) % 0.18/0.56 (define @t44 () (tptp.less tptp.v200 @t1)) % 0.18/0.56 (define @t45 () (and @t44 @t43)) % 0.18/0.56 (define @t46 () (exists @t2 @t45)) % 0.18/0.56 (define @t47 () (not @t46)) % 0.18/0.56 (define @t48 () (forall @t2 (not @t45))) % 0.18/0.56 (define @t49 () (not @t48)) % 0.18/0.56 (define @t50 () (tptp.in_lopen tptp.v400 tptp.v0 tptp.v400)) % 0.18/0.56 (define @t51 () (not @t50)) % 0.18/0.56 (define @t52 () (not @t42)) % 0.18/0.56 (define @t53 () (or @t52 @t51)) % 0.18/0.56 (define @t54 () (tptp.leq tptp.v400 tptp.v400)) % 0.18/0.56 (define @t55 () (and @t41 @t54)) % 0.18/0.56 (define @t56 () (= @t50 @t55)) % 0.18/0.56 (define @t57 () (not @t55)) % 0.18/0.56 (define @t58 () (@list true false)) % 0.18/0.56 (define @t59 () (not @t54)) % 0.18/0.56 (define @t60 () (tptp.less tptp.v400 tptp.v400)) % 0.18/0.56 (define @t61 () (or @t60 (= tptp.v400 tptp.v400))) % 0.18/0.56 (define @t62 () (= @t54 @t61)) % 0.18/0.56 (assume @p1 (forall @t2 (not (tptp.less @t1 @t1)))) % 0.18/0.56 (assume @p2 (forall @t8 (=> (and @t7 @t6) @t4))) % 0.18/0.56 (assume @p3 (forall @t10 (or @t7 @t9 (tptp.less @t5 @t1)))) % 0.18/0.56 (assume @p4 @t12) % 0.18/0.56 (assume @p5 (forall @t10 (=> (and @t11 (tptp.leq @t5 @t1)) @t9))) % 0.18/0.56 (assume @p6 (forall @t10 (=> @t7 @t11))) % 0.18/0.56 (assume @p7 (forall @t8 (=> (and @t11 @t6) @t4))) % 0.18/0.56 (assume @p8 (forall @t8 (=> (and @t7 @t13) @t4))) % 0.18/0.56 (assume @p9 (forall @t8 (=> (and @t11 @t13) (tptp.leq @t1 @t3)))) % 0.18/0.56 (assume @p10 (forall @t10 (=> @t7 (exists (@list @t3) (and @t4 (tptp.less @t3 @t5)))))) % 0.18/0.56 (assume @p11 (forall @t18 (= (tptp.in_closed @t1 @t16 @t14) (and @t17 @t15)))) % 0.18/0.56 (assume @p12 (forall @t18 (= (tptp.in_lopen @t1 @t16 @t14) (and @t19 @t15)))) % 0.18/0.56 (assume @p13 (forall @t18 (= (tptp.in_ropen @t1 @t16 @t14) (and @t17 @t20)))) % 0.18/0.56 (assume @p14 (forall @t18 (= (tptp.in_open @t1 @t16 @t14) (and @t19 @t20)))) % 0.18/0.56 (assume @p15 (forall @t28 (= (tptp.axis_conflict @t25 @t24 @t22 @t21) (not @t27)))) % 0.18/0.56 (assume @p16 (forall @t28 (= (tptp.axis_compatible @t25 @t24 @t22 @t21) @t27))) % 0.18/0.56 (assume @p17 (forall @t28 (= (tptp.axis_subsumes @t25 @t24 @t22 @t21) (forall @t2 (=> @t26 @t23))))) % 0.18/0.56 (assume @p18 (tptp.is_verdict tptp.conflict)) % 0.18/0.56 (assume @p19 (tptp.is_verdict tptp.compatible)) % 0.18/0.56 (assume @p20 (tptp.is_verdict tptp.unknown)) % 0.18/0.56 (assume @p21 (not (= tptp.conflict tptp.compatible))) % 0.18/0.56 (assume @p22 (not (= tptp.conflict tptp.unknown))) % 0.18/0.56 (assume @p23 (not (= tptp.compatible tptp.unknown))) % 0.18/0.56 (assume @p24 (forall (@list @t29) (=> (tptp.is_verdict @t29) (or (= @t29 tptp.conflict) (= @t29 tptp.compatible) (= @t29 tptp.unknown))))) % 0.18/0.56 (assume @p25 (forall @t38 (=> (and @t37 @t36 (or @t35 @t34)) @t33))) % 0.18/0.56 (assume @p26 (forall @t38 (=> (and @t37 @t36 (= @t31 tptp.compatible) (= @t30 tptp.compatible)) @t39))) % 0.18/0.56 (assume @p27 (forall @t38 (=> (and @t37 @t36 (or (= @t31 tptp.unknown) (= @t30 tptp.unknown)) (not @t35) (not @t34)) @t40))) % 0.18/0.56 (assume @p28 (forall @t38 (=> (and @t37 @t36) (or @t33 @t39 @t40)))) % 0.18/0.56 (assume @p29 (tptp.val tptp.v0)) % 0.18/0.56 (assume @p30 (tptp.val tptp.v200)) % 0.18/0.56 (assume @p31 (tptp.val tptp.v400)) % 0.18/0.56 (assume @p32 (tptp.val tptp.v600)) % 0.18/0.56 (assume @p33 (tptp.less tptp.v0 tptp.v200)) % 0.18/0.56 (assume @p34 @t41) % 0.18/0.56 (assume @p35 (tptp.less tptp.v0 tptp.v600)) % 0.18/0.56 (assume @p36 @t42) % 0.18/0.56 (assume @p37 (tptp.less tptp.v200 tptp.v600)) % 0.18/0.56 (assume @p38 (tptp.less tptp.v400 tptp.v600)) % 0.18/0.56 (assume @p39 (and (not (= tptp.v0 tptp.v200)) (not (= tptp.v0 tptp.v400)) (not (= tptp.v0 tptp.v600)) (not (= tptp.v200 tptp.v400)) (not (= tptp.v200 tptp.v600)) (not (= tptp.v400 tptp.v600)))) % 0.18/0.56 (assume @p40 @t47) % 0.18/0.56 (assume @p41 true) % 0.18/0.56 (step @p42 :rule instantiate :premises (@p12) :args ((@list tptp.v400 tptp.v0 tptp.v400))) % 0.18/0.56 (step @p43 :rule bool-double-not-elim :args ((forall @t2 (or (not @t44) (not @t43))))) % 0.18/0.56 (step @p44 :rule bool-and-de-morgan :args (@t44 @t43 true)) % 0.18/0.56 (step @p45 :rule cong :premises (@p44) :args (@t48)) % 0.18/0.56 (step @p46 :rule cong :premises (@p45) :args (@t49)) % 0.18/0.56 (step @p47 :rule exists-elim :args ((= @t46 @t49))) % 0.18/0.56 (step @p48 :rule trans :premises (@p47 @p46)) % 0.18/0.56 (step @p49 :rule cong :premises (@p48) :args (@t47)) % 0.18/0.56 (step @p50 :rule trans :premises (@p49 @p43)) % 0.18/0.56 (step @p51 :rule eq_resolve :premises (@p40 @p50)) % 0.18/0.56 (step @p52 :rule instantiate :premises (@p51) :args ((@list tptp.v400))) % 0.18/0.56 (step @p53 :rule cnf_or_pos :args (@t53)) % 0.18/0.56 (step @p54 :rule reordering :premises (@p53) :args ((or @t52 @t51 (not @t53)))) % 0.18/0.56 (step @p55 :rule chain_m_resolution :premises (@p54 @p36 @p52) :args (@t51 (@list false false) (@list @t42 @t53))) % 0.18/0.56 (step @p56 :rule cnf_equiv_pos2 :args (@t56)) % 0.18/0.56 (step @p57 :rule reordering :premises (@p56) :args ((or @t50 @t57 (not @t56)))) % 0.18/0.56 (step @p58 :rule chain_m_resolution :premises (@p57 @p55 @p42) :args (@t57 @t58 (@list @t50 @t56))) % 0.18/0.56 (step @p59 :rule cnf_and_neg :args (@t55)) % 0.18/0.56 (step @p60 :rule reordering :premises (@p59) :args ((or (not @t41) @t55 @t59))) % 0.18/0.56 (step @p61 :rule chain_m_resolution :premises (@p60 @p34 @p58) :args (@t59 (@list false true) (@list @t41 @t55))) % 0.18/0.56 (step @p62 :rule bool-eq-true :args (@t54)) % 0.18/0.56 (step @p63 :rule absorb :args ((= (or @t60 true) true))) % 0.18/0.56 (step @p64 :rule eq-refl :args (tptp.v400)) % 0.18/0.56 (step @p65 :rule refl :args (@t60)) % 0.18/0.56 (step @p66 :rule nary_cong :premises (@p65 @p64) :args (@t61)) % 0.18/0.56 (step @p67 :rule trans :premises (@p66 @p63)) % 0.18/0.56 (step @p68 :rule refl :args (@t54)) % 0.18/0.56 (step @p69 :rule cong :premises (@p68 @p67) :args (@t62)) % 0.18/0.56 (step @p70 :rule trans :premises (@p69 @p62)) % 0.18/0.56 (step @p71 :rule refl :args (@t12)) % 0.18/0.56 (step @p72 :rule cong :premises (@p71 @p70) :args ((=> @t12 @t62))) % 0.18/0.56 (assume-push @p80 @t12) % 0.18/0.56 (step @p74 :rule instantiate :premises (@p4) :args ((@list tptp.v400 tptp.v400))) % 0.18/0.56 (step-pop @p81 :rule scope :premises (@p74)) % 0.18/0.56 (step @p75 :rule process_scope :premises (@p81) :args (@t62)) % 0.18/0.56 (step @p77 :rule eq_resolve :premises (@p75 @p72)) % 0.18/0.56 (step @p78 :rule implies_elim :premises (@p77)) % 0.18/0.56 (step @p79 false :rule chain_m_resolution :premises (@p78 @p61 @p4) :args (false @t58 (@list @t54 @t12))) % 0.18/0.56 ) % 0.18/0.56 % SZS output end Proof % 0.18/0.56 % cvc5 exiting %------------------------------------------------------------------------------