%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : MGT094+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 : 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.20s 0.54s % Output : Proof 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT094+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 : n010.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:25:56 UTC 2026 % 0.12/0.37 % CPUTime : % 0.12/0.45 %----Proving TF0_NAR, FOF, or CNF % 0.20/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.20/0.54 % SZS status Theorem % 0.20/0.54 % SZS output start Proof % 0.20/0.54 ( % 0.20/0.54 (declare-sort $$unsorted 0) % 0.20/0.54 (declare-const tptp.v800 $$unsorted) % 0.20/0.54 (declare-const tptp.v300 $$unsorted) % 0.20/0.54 (declare-const tptp.v150 $$unsorted) % 0.20/0.54 (declare-const tptp.v16 $$unsorted) % 0.20/0.54 (declare-const tptp.v0 $$unsorted) % 0.20/0.54 (declare-const tptp.subs_verdict (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.20/0.54 (declare-const tptp.v600 $$unsorted) % 0.20/0.54 (declare-const tptp.box_verdict (-> $$unsorted $$unsorted $$unsorted)) % 0.20/0.54 (declare-const tptp.less (-> $$unsorted $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.val (-> $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.leq (-> $$unsorted $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.v400 $$unsorted) % 0.20/0.54 (declare-const tptp.in_ropen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.axis_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.is_presence (-> $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.conflict $$unsorted) % 0.20/0.54 (declare-const tptp.v32 $$unsorted) % 0.20/0.54 (declare-const tptp.in_lopen (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.present $$unsorted) % 0.20/0.54 (declare-const tptp.in_open (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.axis_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.absent $$unsorted) % 0.20/0.54 (declare-const tptp.is_verdict (-> $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.box_subs (-> $$unsorted $$unsorted $$unsorted)) % 0.20/0.54 (declare-const tptp.axis_subsumes (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.compatible $$unsorted) % 0.20/0.54 (declare-const tptp.in_closed (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.20/0.54 (declare-const tptp.unknown $$unsorted) % 0.20/0.54 (define @t1 () (@var "X" $$unsorted)) % 0.20/0.54 (define @t2 () (@list @t1)) % 0.20/0.54 (define @t3 () (@var "Z" $$unsorted)) % 0.20/0.54 (define @t4 () (tptp.less @t1 @t3)) % 0.20/0.54 (define @t5 () (@var "Y" $$unsorted)) % 0.20/0.54 (define @t6 () (tptp.less @t5 @t3)) % 0.20/0.54 (define @t7 () (tptp.less @t1 @t5)) % 0.20/0.54 (define @t8 () (@list @t1 @t5 @t3)) % 0.20/0.54 (define @t9 () (= @t1 @t5)) % 0.20/0.54 (define @t10 () (@list @t1 @t5)) % 0.20/0.54 (define @t11 () (tptp.leq @t1 @t5)) % 0.20/0.54 (define @t12 () (tptp.leq @t5 @t3)) % 0.20/0.54 (define @t13 () (@var "B" $$unsorted)) % 0.20/0.54 (define @t14 () (tptp.leq @t1 @t13)) % 0.20/0.54 (define @t15 () (@var "A" $$unsorted)) % 0.20/0.54 (define @t16 () (tptp.leq @t15 @t1)) % 0.20/0.54 (define @t17 () (@list @t1 @t15 @t13)) % 0.20/0.54 (define @t18 () (tptp.less @t15 @t1)) % 0.20/0.54 (define @t19 () (tptp.less @t1 @t13)) % 0.20/0.54 (define @t20 () (@var "I2hi" $$unsorted)) % 0.20/0.54 (define @t21 () (@var "I2lo" $$unsorted)) % 0.20/0.54 (define @t22 () (tptp.in_closed @t1 @t21 @t20)) % 0.20/0.54 (define @t23 () (@var "I1hi" $$unsorted)) % 0.20/0.54 (define @t24 () (@var "I1lo" $$unsorted)) % 0.20/0.54 (define @t25 () (tptp.in_closed @t1 @t24 @t23)) % 0.20/0.54 (define @t26 () (exists @t2 (and @t25 @t22))) % 0.20/0.54 (define @t27 () (@list @t24 @t23 @t21 @t20)) % 0.20/0.54 (define @t28 () (@var "V" $$unsorted)) % 0.20/0.54 (define @t29 () (@var "V2" $$unsorted)) % 0.20/0.54 (define @t30 () (@var "V1" $$unsorted)) % 0.20/0.54 (define @t31 () (tptp.box_verdict @t30 @t29)) % 0.20/0.54 (define @t32 () (= @t31 tptp.conflict)) % 0.20/0.54 (define @t33 () (= @t29 tptp.conflict)) % 0.20/0.54 (define @t34 () (= @t30 tptp.conflict)) % 0.20/0.54 (define @t35 () (tptp.is_verdict @t29)) % 0.20/0.54 (define @t36 () (tptp.is_verdict @t30)) % 0.20/0.54 (define @t37 () (and @t36 @t35 (or @t34 @t33))) % 0.20/0.54 (define @t38 () (@list @t30 @t29)) % 0.20/0.54 (define @t39 () (= @t31 tptp.compatible)) % 0.20/0.54 (define @t40 () (= @t29 tptp.compatible)) % 0.20/0.54 (define @t41 () (= @t30 tptp.compatible)) % 0.20/0.54 (define @t42 () (and @t36 @t35 @t41 @t40)) % 0.20/0.54 (define @t43 () (= @t31 tptp.unknown)) % 0.20/0.54 (define @t44 () (not @t33)) % 0.20/0.54 (define @t45 () (not @t34)) % 0.20/0.54 (define @t46 () (and @t36 @t35)) % 0.20/0.54 (define @t47 () (@var "T" $$unsorted)) % 0.20/0.54 (define @t48 () (@var "H2" $$unsorted)) % 0.20/0.54 (define @t49 () (@var "L2" $$unsorted)) % 0.20/0.54 (define @t50 () (@var "H1" $$unsorted)) % 0.20/0.54 (define @t51 () (@var "L1" $$unsorted)) % 0.20/0.54 (define @t52 () (@list @t51 @t50 @t49 @t48)) % 0.20/0.54 (define @t53 () (tptp.subs_verdict @t51 @t50 tptp.present @t49 @t48 tptp.present)) % 0.20/0.54 (define @t54 () (tptp.axis_subsumes @t51 @t50 @t49 @t48)) % 0.20/0.54 (define @t55 () (not @t54)) % 0.20/0.54 (define @t56 () (=> @t55 (= @t53 tptp.conflict))) % 0.20/0.54 (define @t57 () (forall @t52 @t56)) % 0.20/0.54 (define @t58 () (@var "P2" $$unsorted)) % 0.20/0.54 (define @t59 () (@var "P1" $$unsorted)) % 0.20/0.54 (define @t60 () (tptp.subs_verdict @t51 @t50 @t59 @t49 @t48 @t58)) % 0.20/0.54 (define @t61 () (tptp.box_subs @t30 @t29)) % 0.20/0.54 (define @t62 () (= @t61 tptp.compatible)) % 0.20/0.54 (define @t63 () (= @t61 tptp.conflict)) % 0.20/0.54 (define @t64 () (= @t61 tptp.unknown)) % 0.20/0.54 (define @t65 () (tptp.axis_subsumes tptp.v0 tptp.v800 tptp.v0 tptp.v600)) % 0.20/0.54 (define @t66 () (tptp.subs_verdict tptp.v0 tptp.v800 tptp.present tptp.v0 tptp.v600 tptp.present)) % 0.20/0.54 (define @t67 () (= tptp.conflict @t53)) % 0.20/0.54 (define @t68 () (= tptp.conflict @t66)) % 0.20/0.54 (define @t69 () (or @t65 @t68)) % 0.20/0.54 (define @t70 () (not @t69)) % 0.20/0.54 (define @t71 () (forall @t52 (or @t54 @t67))) % 0.20/0.54 (assume @p1 (forall @t2 (not (tptp.less @t1 @t1)))) % 0.20/0.54 (assume @p2 (forall @t8 (=> (and @t7 @t6) @t4))) % 0.20/0.54 (assume @p3 (forall @t10 (or @t7 @t9 (tptp.less @t5 @t1)))) % 0.20/0.54 (assume @p4 (forall @t10 (= @t11 (or @t7 @t9)))) % 0.20/0.54 (assume @p5 (forall @t10 (=> (and @t11 (tptp.leq @t5 @t1)) @t9))) % 0.20/0.54 (assume @p6 (forall @t10 (=> @t7 @t11))) % 0.20/0.54 (assume @p7 (forall @t8 (=> (and @t11 @t6) @t4))) % 0.20/0.54 (assume @p8 (forall @t8 (=> (and @t7 @t12) @t4))) % 0.20/0.54 (assume @p9 (forall @t8 (=> (and @t11 @t12) (tptp.leq @t1 @t3)))) % 0.20/0.54 (assume @p10 (forall @t17 (= (tptp.in_closed @t1 @t15 @t13) (and @t16 @t14)))) % 0.20/0.54 (assume @p11 (forall @t17 (= (tptp.in_lopen @t1 @t15 @t13) (and @t18 @t14)))) % 0.20/0.54 (assume @p12 (forall @t17 (= (tptp.in_ropen @t1 @t15 @t13) (and @t16 @t19)))) % 0.20/0.54 (assume @p13 (forall @t17 (= (tptp.in_open @t1 @t15 @t13) (and @t18 @t19)))) % 0.20/0.54 (assume @p14 (forall @t27 (= (tptp.axis_conflict @t24 @t23 @t21 @t20) (not @t26)))) % 0.20/0.54 (assume @p15 (forall @t27 (= (tptp.axis_compatible @t24 @t23 @t21 @t20) @t26))) % 0.20/0.54 (assume @p16 (forall @t27 (= (tptp.axis_subsumes @t24 @t23 @t21 @t20) (forall @t2 (=> @t25 @t22))))) % 0.20/0.54 (assume @p17 (tptp.is_verdict tptp.conflict)) % 0.20/0.54 (assume @p18 (tptp.is_verdict tptp.compatible)) % 0.20/0.54 (assume @p19 (tptp.is_verdict tptp.unknown)) % 0.20/0.54 (assume @p20 (not (= tptp.conflict tptp.compatible))) % 0.20/0.54 (assume @p21 (not (= tptp.conflict tptp.unknown))) % 0.20/0.54 (assume @p22 (not (= tptp.compatible tptp.unknown))) % 0.20/0.54 (assume @p23 (forall (@list @t28) (=> (tptp.is_verdict @t28) (or (= @t28 tptp.conflict) (= @t28 tptp.compatible) (= @t28 tptp.unknown))))) % 0.20/0.54 (assume @p24 (forall @t38 (=> @t37 @t32))) % 0.20/0.54 (assume @p25 (forall @t38 (=> @t42 @t39))) % 0.20/0.54 (assume @p26 (forall @t38 (=> (and @t36 @t35 (or (= @t30 tptp.unknown) (= @t29 tptp.unknown)) @t45 @t44) @t43))) % 0.20/0.54 (assume @p27 (forall @t38 (=> @t46 (or @t32 @t39 @t43)))) % 0.20/0.54 (assume @p28 (tptp.is_presence tptp.present)) % 0.20/0.54 (assume @p29 (tptp.is_presence tptp.absent)) % 0.20/0.54 (assume @p30 (not (= tptp.present tptp.absent))) % 0.20/0.54 (assume @p31 (forall (@list @t47) (=> (tptp.is_presence @t47) (or (= @t47 tptp.present) (= @t47 tptp.absent))))) % 0.20/0.54 (assume @p32 (forall @t52 (= (tptp.subs_verdict @t51 @t50 tptp.absent @t49 @t48 tptp.present) tptp.unknown))) % 0.20/0.54 (assume @p33 (forall @t52 (= (tptp.subs_verdict @t51 @t50 tptp.present @t49 @t48 tptp.absent) tptp.unknown))) % 0.20/0.54 (assume @p34 (forall @t52 (= (tptp.subs_verdict @t51 @t50 tptp.absent @t49 @t48 tptp.absent) tptp.unknown))) % 0.20/0.54 (assume @p35 (forall @t52 (=> @t54 (= @t53 tptp.compatible)))) % 0.20/0.54 (assume @p36 @t57) % 0.20/0.54 (assume @p37 (forall (@list @t51 @t50 @t59 @t49 @t48 @t58) (=> (and (tptp.is_presence @t59) (tptp.is_presence @t58)) (or (= @t60 tptp.compatible) (= @t60 tptp.conflict) (= @t60 tptp.unknown))))) % 0.20/0.54 (assume @p38 (forall @t38 (=> @t42 @t62))) % 0.20/0.54 (assume @p39 (forall @t38 (=> @t37 @t63))) % 0.20/0.54 (assume @p40 (forall @t38 (=> (and @t36 @t35 (not (and @t41 @t40)) @t45 @t44) @t64))) % 0.20/0.54 (assume @p41 (forall @t38 (=> @t46 (or @t62 @t63 @t64)))) % 0.20/0.54 (assume @p42 (tptp.val tptp.v0)) % 0.20/0.54 (assume @p43 (tptp.val tptp.v16)) % 0.20/0.54 (assume @p44 (tptp.val tptp.v32)) % 0.20/0.54 (assume @p45 (tptp.val tptp.v150)) % 0.20/0.54 (assume @p46 (tptp.val tptp.v300)) % 0.20/0.54 (assume @p47 (tptp.val tptp.v400)) % 0.20/0.54 (assume @p48 (tptp.val tptp.v600)) % 0.20/0.54 (assume @p49 (tptp.val tptp.v800)) % 0.20/0.54 (assume @p50 (tptp.less tptp.v0 tptp.v16)) % 0.20/0.54 (assume @p51 (tptp.less tptp.v0 tptp.v32)) % 0.20/0.54 (assume @p52 (tptp.less tptp.v0 tptp.v150)) % 0.20/0.54 (assume @p53 (tptp.less tptp.v0 tptp.v300)) % 0.20/0.54 (assume @p54 (tptp.less tptp.v0 tptp.v400)) % 0.20/0.54 (assume @p55 (tptp.less tptp.v0 tptp.v600)) % 0.20/0.54 (assume @p56 (tptp.less tptp.v0 tptp.v800)) % 0.20/0.54 (assume @p57 (tptp.less tptp.v16 tptp.v32)) % 0.20/0.54 (assume @p58 (tptp.less tptp.v16 tptp.v150)) % 0.20/0.54 (assume @p59 (tptp.less tptp.v16 tptp.v300)) % 0.20/0.54 (assume @p60 (tptp.less tptp.v16 tptp.v400)) % 0.20/0.54 (assume @p61 (tptp.less tptp.v16 tptp.v600)) % 0.20/0.54 (assume @p62 (tptp.less tptp.v16 tptp.v800)) % 0.20/0.54 (assume @p63 (tptp.less tptp.v32 tptp.v150)) % 0.20/0.54 (assume @p64 (tptp.less tptp.v32 tptp.v300)) % 0.20/0.54 (assume @p65 (tptp.less tptp.v32 tptp.v400)) % 0.20/0.54 (assume @p66 (tptp.less tptp.v32 tptp.v600)) % 0.20/0.54 (assume @p67 (tptp.less tptp.v32 tptp.v800)) % 0.20/0.54 (assume @p68 (tptp.less tptp.v150 tptp.v300)) % 0.20/0.54 (assume @p69 (tptp.less tptp.v150 tptp.v400)) % 0.20/0.54 (assume @p70 (tptp.less tptp.v150 tptp.v600)) % 0.20/0.54 (assume @p71 (tptp.less tptp.v150 tptp.v800)) % 0.20/0.54 (assume @p72 (tptp.less tptp.v300 tptp.v400)) % 0.20/0.54 (assume @p73 (tptp.less tptp.v300 tptp.v600)) % 0.20/0.54 (assume @p74 (tptp.less tptp.v300 tptp.v800)) % 0.20/0.54 (assume @p75 (tptp.less tptp.v400 tptp.v600)) % 0.20/0.54 (assume @p76 (tptp.less tptp.v400 tptp.v800)) % 0.20/0.54 (assume @p77 (tptp.less tptp.v600 tptp.v800)) % 0.20/0.54 (assume @p78 (and (not (= tptp.v0 tptp.v16)) (not (= tptp.v0 tptp.v32)) (not (= tptp.v0 tptp.v150)) (not (= tptp.v0 tptp.v300)) (not (= tptp.v0 tptp.v400)) (not (= tptp.v0 tptp.v600)) (not (= tptp.v0 tptp.v800)) (not (= tptp.v16 tptp.v32)) (not (= tptp.v16 tptp.v150)) (not (= tptp.v16 tptp.v300)) (not (= tptp.v16 tptp.v400)) (not (= tptp.v16 tptp.v600)) (not (= tptp.v16 tptp.v800)) (not (= tptp.v32 tptp.v150)) (not (= tptp.v32 tptp.v300)) (not (= tptp.v32 tptp.v400)) (not (= tptp.v32 tptp.v600)) (not (= tptp.v32 tptp.v800)) (not (= tptp.v150 tptp.v300)) (not (= tptp.v150 tptp.v400)) (not (= tptp.v150 tptp.v600)) (not (= tptp.v150 tptp.v800)) (not (= tptp.v300 tptp.v400)) (not (= tptp.v300 tptp.v600)) (not (= tptp.v300 tptp.v800)) (not (= tptp.v400 tptp.v600)) (not (= tptp.v400 tptp.v800)) (not (= tptp.v600 tptp.v800)))) % 0.20/0.54 (assume @p79 (not @t65)) % 0.20/0.54 (assume @p80 (not (= @t66 tptp.conflict))) % 0.20/0.54 (assume @p81 true) % 0.20/0.54 (step @p82 :rule refl :args (@t67)) % 0.20/0.54 (step @p83 :rule bool-double-not-elim :args (@t54)) % 0.20/0.54 (step @p84 :rule nary_cong :premises (@p83 @p82) :args ((or (not @t55) @t67))) % 0.20/0.54 (step @p85 :rule bool-impl-elim :args (@t55 @t67)) % 0.20/0.54 (step @p86 :rule trans :premises (@p85 @p84)) % 0.20/0.54 (step @p87 :rule cong :premises (@p86) :args ((forall @t52 (=> @t55 @t67)))) % 0.20/0.54 (step @p88 :rule eq-symm :args (@t53 tptp.conflict)) % 0.20/0.54 (step @p89 :rule refl :args (@t55)) % 0.20/0.54 (step @p90 :rule cong :premises (@p89 @p88) :args (@t56)) % 0.20/0.54 (step @p91 :rule cong :premises (@p90) :args (@t57)) % 0.20/0.54 (step @p92 :rule trans :premises (@p91 @p87)) % 0.20/0.54 (step @p93 :rule eq_resolve :premises (@p36 @p92)) % 0.20/0.54 (step @p94 :rule symm :premises (@p80)) % 0.20/0.54 (step @p95 :rule cnf_or_pos :args (@t69)) % 0.20/0.54 (step @p96 :rule reordering :premises (@p95) :args ((or @t65 @t68 @t70))) % 0.20/0.54 (step @p97 :rule chain_m_resolution :premises (@p96 @p79 @p94) :args (@t70 (@list true true) (@list @t65 @t68))) % 0.20/0.54 (assume-push @p104 @t71) % 0.20/0.54 (step @p99 :rule instantiate :premises (@p93) :args ((@list tptp.v0 tptp.v800 tptp.v0 tptp.v600))) % 0.20/0.54 (step-pop @p105 :rule scope :premises (@p99)) % 0.20/0.54 (step @p100 :rule process_scope :premises (@p105) :args (@t69)) % 0.20/0.54 (step @p102 :rule implies_elim :premises (@p100)) % 0.20/0.54 (step @p103 false :rule chain_m_resolution :premises (@p102 @p97 @p93) :args (false (@list true false) (@list @t69 @t71))) % 0.20/0.54 ) % 0.20/0.54 % SZS output end Proof % 0.20/0.54 % cvc5 exiting %------------------------------------------------------------------------------