%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n003.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:56 AM UTC 2026 % Result : Theorem 0.22s 0.53s % Output : Proof 0.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.12/0.37 % Computer : n003.cluster.edu % 0.12/0.37 % Model : x86_64 x86_64 % 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.37 % Memory : 8046.5625MB % 0.12/0.37 % OS : Linux 6.8.0-71-generic % 0.12/0.37 % CPULimit : 300 % 0.12/0.37 % WCLimit : 300 % 0.12/0.37 % DateTime : Mon Sep 7 14:13:54 UTC 2026 % 0.12/0.37 % CPUTime : % 0.12/0.45 %----Proving TF0_NAR, FOF, or CNF % 0.22/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.22/0.53 % SZS status Theorem % 0.22/0.53 % SZS output start Proof % 0.22/0.53 ( % 0.22/0.53 (declare-sort $$unsorted 0) % 0.22/0.53 (declare-const tptp.box_verdict (-> $$unsorted $$unsorted $$unsorted)) % 0.22/0.53 (declare-const tptp.less (-> $$unsorted $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.leq (-> $$unsorted $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.in_ropen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.axis_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.val (-> $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.conflict $$unsorted) % 0.22/0.53 (declare-const tptp.in_lopen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.v0 $$unsorted) % 0.22/0.53 (declare-const tptp.in_open (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.axis_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.v400 $$unsorted) % 0.22/0.53 (declare-const tptp.is_verdict (-> $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.axis_subsumes (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.v800 $$unsorted) % 0.22/0.53 (declare-const tptp.compatible $$unsorted) % 0.22/0.53 (declare-const tptp.in_closed (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.22/0.53 (declare-const tptp.unknown $$unsorted) % 0.22/0.53 (define @t1 () (@var "X" $$unsorted)) % 0.22/0.53 (define @t2 () (@list @t1)) % 0.22/0.53 (define @t3 () (@var "Z" $$unsorted)) % 0.22/0.53 (define @t4 () (tptp.less @t1 @t3)) % 0.22/0.53 (define @t5 () (@var "Y" $$unsorted)) % 0.22/0.53 (define @t6 () (tptp.less @t5 @t3)) % 0.22/0.53 (define @t7 () (tptp.less @t1 @t5)) % 0.22/0.53 (define @t8 () (and @t7 @t6)) % 0.22/0.53 (define @t9 () (@list @t1 @t5 @t3)) % 0.22/0.53 (define @t10 () (forall @t9 (=> @t8 @t4))) % 0.22/0.53 (define @t11 () (= @t1 @t5)) % 0.22/0.53 (define @t12 () (@list @t1 @t5)) % 0.22/0.53 (define @t13 () (tptp.leq @t1 @t5)) % 0.22/0.53 (define @t14 () (forall @t12 (=> @t7 @t13))) % 0.22/0.53 (define @t15 () (tptp.leq @t5 @t3)) % 0.22/0.53 (define @t16 () (@var "B" $$unsorted)) % 0.22/0.53 (define @t17 () (tptp.leq @t1 @t16)) % 0.22/0.53 (define @t18 () (@var "A" $$unsorted)) % 0.22/0.53 (define @t19 () (tptp.leq @t18 @t1)) % 0.22/0.53 (define @t20 () (@list @t1 @t18 @t16)) % 0.22/0.53 (define @t21 () (tptp.less @t18 @t1)) % 0.22/0.53 (define @t22 () (tptp.less @t1 @t16)) % 0.22/0.53 (define @t23 () (@var "I2hi" $$unsorted)) % 0.22/0.53 (define @t24 () (@var "I2lo" $$unsorted)) % 0.22/0.53 (define @t25 () (tptp.in_closed @t1 @t24 @t23)) % 0.22/0.53 (define @t26 () (@var "I1hi" $$unsorted)) % 0.22/0.53 (define @t27 () (@var "I1lo" $$unsorted)) % 0.22/0.53 (define @t28 () (tptp.in_closed @t1 @t27 @t26)) % 0.22/0.53 (define @t29 () (exists @t2 (and @t28 @t25))) % 0.22/0.53 (define @t30 () (@list @t27 @t26 @t24 @t23)) % 0.22/0.53 (define @t31 () (@var "V" $$unsorted)) % 0.22/0.53 (define @t32 () (@var "V2" $$unsorted)) % 0.22/0.53 (define @t33 () (@var "V1" $$unsorted)) % 0.22/0.53 (define @t34 () (tptp.box_verdict @t33 @t32)) % 0.22/0.53 (define @t35 () (= @t34 tptp.conflict)) % 0.22/0.53 (define @t36 () (= @t32 tptp.conflict)) % 0.22/0.53 (define @t37 () (= @t33 tptp.conflict)) % 0.22/0.53 (define @t38 () (tptp.is_verdict @t32)) % 0.22/0.53 (define @t39 () (tptp.is_verdict @t33)) % 0.22/0.53 (define @t40 () (@list @t33 @t32)) % 0.22/0.53 (define @t41 () (= @t34 tptp.compatible)) % 0.22/0.53 (define @t42 () (= @t34 tptp.unknown)) % 0.22/0.53 (define @t43 () (tptp.less tptp.v400 tptp.v800)) % 0.22/0.53 (define @t44 () (tptp.leq tptp.v400 @t1)) % 0.22/0.53 (define @t45 () (tptp.leq tptp.v800 @t1)) % 0.22/0.53 (define @t46 () (forall @t2 (=> @t45 @t44))) % 0.22/0.53 (define @t47 () (not @t46)) % 0.22/0.53 (define @t48 () (not @t6)) % 0.22/0.53 (define @t49 () (not @t7)) % 0.22/0.53 (define @t50 () (or @t49 @t48 @t4)) % 0.22/0.53 (define @t51 () (@quantifiers_skolemize (forall @t2 (or (not @t45) @t44)) 0)) % 0.22/0.53 (define @t52 () (tptp.leq tptp.v800 @t51)) % 0.22/0.53 (define @t53 () (tptp.leq tptp.v400 @t51)) % 0.22/0.53 (define @t54 () (not @t52)) % 0.22/0.53 (define @t55 () (or @t54 @t53)) % 0.22/0.53 (define @t56 () (@list true)) % 0.22/0.53 (define @t57 () (@list @t55)) % 0.22/0.53 (define @t58 () (= tptp.v800 @t51)) % 0.22/0.53 (define @t59 () (tptp.less tptp.v800 @t51)) % 0.22/0.53 (define @t60 () (or @t59 @t58)) % 0.22/0.53 (define @t61 () (= @t52 @t60)) % 0.22/0.53 (define @t62 () (tptp.less tptp.v400 @t51)) % 0.22/0.53 (define @t63 () (not @t62)) % 0.22/0.53 (define @t64 () (or @t63 @t53)) % 0.22/0.53 (define @t65 () (@list true false)) % 0.22/0.53 (define @t66 () (not @t58)) % 0.22/0.53 (define @t67 () (not @t43)) % 0.22/0.53 (define @t68 () (not @t59)) % 0.22/0.53 (define @t69 () (or @t67 @t68 @t62)) % 0.22/0.53 (define @t70 () (not @t69)) % 0.22/0.53 (define @t71 () (forall @t9 @t50)) % 0.22/0.53 (assume @p1 (forall @t2 (not (tptp.less @t1 @t1)))) % 0.22/0.53 (assume @p2 @t10) % 0.22/0.53 (assume @p3 (forall @t12 (or @t7 @t11 (tptp.less @t5 @t1)))) % 0.22/0.53 (assume @p4 (forall @t12 (= @t13 (or @t7 @t11)))) % 0.22/0.53 (assume @p5 (forall @t12 (=> (and @t13 (tptp.leq @t5 @t1)) @t11))) % 0.22/0.53 (assume @p6 @t14) % 0.22/0.53 (assume @p7 (forall @t9 (=> (and @t13 @t6) @t4))) % 0.22/0.53 (assume @p8 (forall @t9 (=> (and @t7 @t15) @t4))) % 0.22/0.53 (assume @p9 (forall @t9 (=> (and @t13 @t15) (tptp.leq @t1 @t3)))) % 0.22/0.53 (assume @p10 (forall @t20 (= (tptp.in_closed @t1 @t18 @t16) (and @t19 @t17)))) % 0.22/0.53 (assume @p11 (forall @t20 (= (tptp.in_lopen @t1 @t18 @t16) (and @t21 @t17)))) % 0.22/0.53 (assume @p12 (forall @t20 (= (tptp.in_ropen @t1 @t18 @t16) (and @t19 @t22)))) % 0.22/0.53 (assume @p13 (forall @t20 (= (tptp.in_open @t1 @t18 @t16) (and @t21 @t22)))) % 0.22/0.53 (assume @p14 (forall @t30 (= (tptp.axis_conflict @t27 @t26 @t24 @t23) (not @t29)))) % 0.22/0.53 (assume @p15 (forall @t30 (= (tptp.axis_compatible @t27 @t26 @t24 @t23) @t29))) % 0.22/0.53 (assume @p16 (forall @t30 (= (tptp.axis_subsumes @t27 @t26 @t24 @t23) (forall @t2 (=> @t28 @t25))))) % 0.22/0.53 (assume @p17 (tptp.is_verdict tptp.conflict)) % 0.22/0.53 (assume @p18 (tptp.is_verdict tptp.compatible)) % 0.22/0.53 (assume @p19 (tptp.is_verdict tptp.unknown)) % 0.22/0.53 (assume @p20 (not (= tptp.conflict tptp.compatible))) % 0.22/0.53 (assume @p21 (not (= tptp.conflict tptp.unknown))) % 0.22/0.53 (assume @p22 (not (= tptp.compatible tptp.unknown))) % 0.22/0.53 (assume @p23 (forall (@list @t31) (=> (tptp.is_verdict @t31) (or (= @t31 tptp.conflict) (= @t31 tptp.compatible) (= @t31 tptp.unknown))))) % 0.22/0.53 (assume @p24 (forall @t40 (=> (and @t39 @t38 (or @t37 @t36)) @t35))) % 0.22/0.53 (assume @p25 (forall @t40 (=> (and @t39 @t38 (= @t33 tptp.compatible) (= @t32 tptp.compatible)) @t41))) % 0.22/0.53 (assume @p26 (forall @t40 (=> (and @t39 @t38 (or (= @t33 tptp.unknown) (= @t32 tptp.unknown)) (not @t37) (not @t36)) @t42))) % 0.22/0.53 (assume @p27 (forall @t40 (=> (and @t39 @t38) (or @t35 @t41 @t42)))) % 0.22/0.53 (assume @p28 (tptp.val tptp.v0)) % 0.22/0.53 (assume @p29 (tptp.val tptp.v400)) % 0.22/0.53 (assume @p30 (tptp.val tptp.v800)) % 0.22/0.53 (assume @p31 (tptp.less tptp.v0 tptp.v400)) % 0.22/0.53 (assume @p32 (tptp.less tptp.v0 tptp.v800)) % 0.22/0.53 (assume @p33 @t43) % 0.22/0.53 (assume @p34 (and (not (= tptp.v0 tptp.v400)) (not (= tptp.v0 tptp.v800)) (not (= tptp.v400 tptp.v800)))) % 0.22/0.53 (assume @p35 @t47) % 0.22/0.53 (assume @p36 true) % 0.22/0.53 (step @p37 :rule aci_norm :args ((= (or (or @t49 @t48) @t4) @t50))) % 0.22/0.53 (step @p38 :rule refl :args (@t4)) % 0.22/0.53 (step @p39 :rule bool-and-de-morgan :args (@t7 @t6 true)) % 0.22/0.53 (step @p40 :rule nary_cong :premises (@p39 @p38) :args ((or (not @t8) @t4))) % 0.22/0.53 (step @p41 :rule trans :premises (@p40 @p37)) % 0.22/0.53 (step @p42 :rule bool-impl-elim :args (@t8 @t4)) % 0.22/0.53 (step @p43 :rule trans :premises (@p42 @p41)) % 0.22/0.53 (step @p44 :rule cong :premises (@p43) :args (@t10)) % 0.22/0.53 (step @p45 :rule eq_resolve :premises (@p2 @p44)) % 0.22/0.53 (step @p46 :rule instantiate :premises (@p4) :args ((@list tptp.v800 @t51))) % 0.22/0.53 (step @p47 :rule bool-impl-elim :args (@t45 @t44)) % 0.22/0.53 (step @p48 :rule cong :premises (@p47) :args (@t46)) % 0.22/0.53 (step @p49 :rule cong :premises (@p48) :args (@t47)) % 0.22/0.53 (step @p50 :rule eq_resolve :premises (@p35 @p49)) % 0.22/0.53 (step @p51 :rule skolemize :premises (@p50)) % 0.22/0.53 (step @p52 :rule bool-double-not-elim :args (@t52)) % 0.22/0.53 (step @p53 :rule refl :args (@t55)) % 0.22/0.53 (step @p54 :rule nary_cong :premises (@p53 @p52) :args ((or @t55 (not @t54)))) % 0.22/0.53 (step @p55 :rule cnf_or_neg :args (@t55 0)) % 0.22/0.53 (step @p56 :rule eq_resolve :premises (@p55 @p54)) % 0.22/0.53 (step @p57 :rule reordering :premises (@p56) :args ((or @t52 @t55))) % 0.22/0.53 (step @p58 :rule chain_m_resolution :premises (@p57 @p51) :args (@t52 @t56 @t57)) % 0.22/0.53 (step @p59 :rule cnf_equiv_pos1 :args (@t61)) % 0.22/0.53 (step @p60 :rule reordering :premises (@p59) :args ((or @t54 @t60 (not @t61)))) % 0.22/0.53 (step @p61 :rule chain_m_resolution :premises (@p60 @p58 @p46) :args (@t60 (@list false false) (@list @t52 @t61))) % 0.22/0.53 (step @p62 :rule bool-impl-elim :args (@t7 @t13)) % 0.22/0.53 (step @p63 :rule cong :premises (@p62) :args (@t14)) % 0.22/0.53 (step @p64 :rule eq_resolve :premises (@p6 @p63)) % 0.22/0.53 (step @p65 :rule instantiate :premises (@p64) :args ((@list tptp.v400 @t51))) % 0.22/0.53 (step @p66 :rule cnf_or_neg :args (@t55 1)) % 0.22/0.53 (step @p67 :rule chain_m_resolution :premises (@p66 @p51) :args ((not @t53) @t56 @t57)) % 0.22/0.53 (step @p68 :rule cnf_or_pos :args (@t64)) % 0.22/0.53 (step @p69 :rule reordering :premises (@p68) :args ((or @t53 @t63 (not @t64)))) % 0.22/0.53 (step @p70 :rule chain_m_resolution :premises (@p69 @p67 @p65) :args (@t63 @t65 (@list @t53 @t64))) % 0.22/0.53 (step @p71 :rule bool-double-not-elim :args (@t62)) % 0.22/0.53 (step @p72 :rule refl :args (@t66)) % 0.22/0.53 (step @p73 :rule refl :args (@t67)) % 0.22/0.53 (step @p74 :rule nary_cong :premises (@p73 @p72 @p71) :args ((or @t67 @t66 (not @t63)))) % 0.22/0.53 (assume-push @p107 @t43) % 0.22/0.53 (assume-push @p108 @t58) % 0.22/0.53 (assume-push @p109 @t63) % 0.22/0.53 (step @p78 :rule evaluate :args ((= false true))) % 0.22/0.53 (step @p79 :rule true_intro :premises (@p33)) % 0.22/0.53 (step @p80 :rule symm :premises (@p108)) % 0.22/0.53 (step @p81 :rule refl :args (tptp.v400)) % 0.22/0.53 (step @p82 :rule cong :premises (@p81 @p80) :args (@t62)) % 0.22/0.53 (step @p83 :rule false_intro :premises (@p70)) % 0.22/0.53 (step @p84 :rule symm :premises (@p83)) % 0.22/0.53 (step @p85 :rule trans :premises (@p84 @p82 @p79)) % 0.22/0.53 (step @p86 false :rule eq_resolve :premises (@p85 @p78)) % 0.22/0.53 (step-pop @p110 :rule scope :premises (@p86)) % 0.22/0.53 (step-pop @p111 :rule scope :premises (@p110)) % 0.22/0.53 (step-pop @p112 :rule scope :premises (@p111)) % 0.22/0.53 (step @p87 :rule process_scope :premises (@p112) :args (false)) % 0.22/0.53 (step @p91 :rule not_and :premises (@p87)) % 0.22/0.53 (step @p92 :rule eq_resolve :premises (@p91 @p74)) % 0.22/0.53 (step @p93 :rule reordering :premises (@p92) :args ((or @t67 @t62 @t66))) % 0.22/0.53 (step @p94 :rule chain_m_resolution :premises (@p93 @p33 @p70) :args (@t66 (@list false true) (@list @t43 @t62))) % 0.22/0.53 (step @p95 :rule cnf_or_pos :args (@t60)) % 0.22/0.53 (step @p96 :rule reordering :premises (@p95) :args ((or @t59 @t58 (not @t60)))) % 0.22/0.53 (step @p97 :rule chain_m_resolution :premises (@p96 @p94 @p61) :args (@t59 @t65 (@list @t58 @t60))) % 0.22/0.53 (step @p98 :rule cnf_or_pos :args (@t69)) % 0.22/0.53 (step @p99 :rule reordering :premises (@p98) :args ((or @t67 @t62 @t68 @t70))) % 0.22/0.53 (step @p100 :rule chain_m_resolution :premises (@p99 @p33 @p70 @p97) :args (@t70 (@list false true false) (@list @t43 @t62 @t59))) % 0.22/0.53 (assume-push @p113 @t71) % 0.22/0.53 (step @p102 :rule instantiate :premises (@p45) :args ((@list tptp.v400 tptp.v800 @t51))) % 0.22/0.53 (step-pop @p114 :rule scope :premises (@p102)) % 0.22/0.53 (step @p103 :rule process_scope :premises (@p114) :args (@t69)) % 0.22/0.53 (step @p105 :rule implies_elim :premises (@p103)) % 0.22/0.53 (step @p106 false :rule chain_m_resolution :premises (@p105 @p100 @p45) :args (false @t65 (@list @t69 @t71))) % 0.22/0.53 ) % 0.22/0.53 % SZS output end Proof % 0.22/0.53 % cvc5 exiting %------------------------------------------------------------------------------