%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : MGT036-1 : TPTP v9.3.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n004.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:48 AM UTC 2026 % Result : Unsatisfiable 0.20s 0.50s % Output : Proof 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT036-1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.10/0.36 % Computer : n004.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % 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 12:40:30 UTC 2026 % 0.10/0.36 % CPUTime : % 0.14/0.43 %----Proving TF0_NAR, FOF, or CNF % 0.14/0.45 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.20/0.50 % SZS status Unsatisfiable % 0.20/0.50 % SZS output start Proof % 0.20/0.50 ( % 0.20/0.50 (declare-sort $$unsorted 0) % 0.20/0.50 (declare-const tptp.sk2 $$unsorted) % 0.20/0.50 (declare-const tptp.outcompetes (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.20/0.50 (declare-const tptp.greater_or_equal (-> $$unsorted $$unsorted Bool)) % 0.20/0.50 (declare-const tptp.sk1 $$unsorted) % 0.20/0.50 (declare-const tptp.greater (-> $$unsorted $$unsorted Bool)) % 0.20/0.50 (declare-const tptp.in_environment (-> $$unsorted $$unsorted Bool)) % 0.20/0.50 (declare-const tptp.environment (-> $$unsorted Bool)) % 0.20/0.50 (declare-const tptp.growth_rate (-> $$unsorted $$unsorted $$unsorted)) % 0.20/0.50 (declare-const tptp.subpopulations (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.20/0.50 (declare-const tptp.resilience (-> $$unsorted $$unsorted)) % 0.20/0.50 (declare-const tptp.zero $$unsorted) % 0.20/0.50 (declare-const tptp.efficient_producers $$unsorted) % 0.20/0.50 (declare-const tptp.first_movers $$unsorted) % 0.20/0.50 (define @t1 () (@var "B" $$unsorted)) % 0.20/0.50 (define @t2 () (@var "A" $$unsorted)) % 0.20/0.50 (define @t3 () (not (tptp.subpopulations tptp.first_movers tptp.efficient_producers @t2 @t1))) % 0.20/0.50 (define @t4 () (tptp.environment @t2)) % 0.20/0.50 (define @t5 () (not @t4)) % 0.20/0.50 (define @t6 () (@list @t2 @t1)) % 0.20/0.50 (define @t7 () (tptp.in_environment @t2 @t1)) % 0.20/0.50 (define @t8 () (@var "C" $$unsorted)) % 0.20/0.50 (define @t9 () (@var "D" $$unsorted)) % 0.20/0.50 (define @t10 () (@list @t2 @t1 @t8 @t9)) % 0.20/0.50 (define @t11 () (tptp.growth_rate @t2 @t1)) % 0.20/0.50 (define @t12 () (tptp.greater tptp.zero @t11)) % 0.20/0.50 (define @t13 () (tptp.greater_or_equal @t11 tptp.zero)) % 0.20/0.50 (define @t14 () (tptp.outcompetes @t8 @t1 @t9)) % 0.20/0.50 (define @t15 () (tptp.greater tptp.zero (tptp.growth_rate @t1 @t9))) % 0.20/0.50 (define @t16 () (tptp.greater_or_equal (tptp.growth_rate @t8 @t9) tptp.zero)) % 0.20/0.50 (define @t17 () (not (tptp.subpopulations @t1 @t8 @t2 @t9))) % 0.20/0.50 (define @t18 () (not @t14)) % 0.20/0.50 (define @t19 () (forall @t10 (or @t5 (not @t7) (tptp.greater tptp.zero (tptp.growth_rate @t8 @t1)) (not (tptp.greater (tptp.resilience @t9) (tptp.resilience @t8))) (not (tptp.greater tptp.zero (tptp.growth_rate @t9 @t1)))))) % 0.20/0.50 (define @t20 () (tptp.greater (tptp.resilience tptp.efficient_producers) (tptp.resilience tptp.first_movers))) % 0.20/0.50 (define @t21 () (tptp.environment tptp.sk1)) % 0.20/0.50 (define @t22 () (tptp.subpopulations tptp.first_movers tptp.efficient_producers tptp.sk1 tptp.sk2)) % 0.20/0.50 (define @t23 () (tptp.outcompetes tptp.first_movers tptp.efficient_producers tptp.sk2)) % 0.20/0.50 (define @t24 () (@list tptp.sk1 tptp.efficient_producers tptp.first_movers tptp.sk2)) % 0.20/0.50 (define @t25 () (@list tptp.sk1 tptp.sk2)) % 0.20/0.50 (define @t26 () (tptp.subpopulations tptp.efficient_producers tptp.first_movers tptp.sk1 tptp.sk2)) % 0.20/0.50 (define @t27 () (not @t22)) % 0.20/0.50 (define @t28 () (not @t21)) % 0.20/0.50 (define @t29 () (or @t28 @t27 @t26)) % 0.20/0.50 (define @t30 () (@list false false false)) % 0.20/0.50 (define @t31 () (tptp.greater tptp.zero (tptp.growth_rate tptp.efficient_producers tptp.sk2))) % 0.20/0.50 (define @t32 () (not @t23)) % 0.20/0.50 (define @t33 () (not @t26)) % 0.20/0.50 (define @t34 () (or @t28 @t33 @t32 @t31)) % 0.20/0.50 (define @t35 () (@list false false false false)) % 0.20/0.50 (define @t36 () (tptp.in_environment tptp.sk1 tptp.sk2)) % 0.20/0.50 (define @t37 () (or @t28 @t27 @t36)) % 0.20/0.50 (define @t38 () (tptp.growth_rate tptp.first_movers tptp.sk2)) % 0.20/0.50 (define @t39 () (tptp.greater_or_equal @t38 tptp.zero)) % 0.20/0.50 (define @t40 () (or @t28 @t33 @t32 @t39)) % 0.20/0.50 (define @t41 () (tptp.greater tptp.zero @t38)) % 0.20/0.50 (define @t42 () (not @t41)) % 0.20/0.50 (define @t43 () (not @t39)) % 0.20/0.50 (define @t44 () (or @t43 @t42)) % 0.20/0.50 (define @t45 () (not @t31)) % 0.20/0.50 (define @t46 () (not @t20)) % 0.20/0.50 (define @t47 () (not @t36)) % 0.20/0.50 (define @t48 () (or @t28 @t47 @t41 @t46 @t45)) % 0.20/0.50 (define @t49 () (not @t48)) % 0.20/0.50 (assume @p1 (forall @t6 (or @t5 @t3 (tptp.subpopulations tptp.efficient_producers tptp.first_movers @t2 @t1)))) % 0.20/0.50 (assume @p2 (forall @t6 (or @t5 @t3 @t7))) % 0.20/0.50 (assume @p3 (forall (@list @t2 @t1 @t8) (or @t4 (not (tptp.greater tptp.zero (tptp.growth_rate @t1 @t8)))))) % 0.20/0.50 (assume @p4 (forall @t10 (or (tptp.subpopulations @t2 @t1 @t8 @t9) (not (tptp.greater tptp.zero (tptp.growth_rate @t2 @t9)))))) % 0.20/0.50 (assume @p5 (forall @t6 (or (not @t13) (not @t12)))) % 0.20/0.50 (assume @p6 (forall @t10 (or @t12 (not (tptp.environment @t8)) (not (tptp.subpopulations @t2 @t9 @t8 @t1)) @t13))) % 0.20/0.50 (assume @p7 (forall @t10 (or @t5 @t17 (not @t16) (not @t15) @t14))) % 0.20/0.50 (assume @p8 (forall @t10 (or @t5 @t17 @t18 @t16))) % 0.20/0.50 (assume @p9 (forall @t10 (or @t5 @t17 @t18 @t15))) % 0.20/0.50 (assume @p10 @t19) % 0.20/0.50 (assume @p11 @t20) % 0.20/0.50 (assume @p12 @t21) % 0.20/0.50 (assume @p13 @t22) % 0.20/0.50 (assume @p14 @t23) % 0.20/0.50 (step @p15 :rule instantiate :premises (@p9) :args (@t24)) % 0.20/0.50 (step @p16 :rule instantiate :premises (@p1) :args (@t25)) % 0.20/0.50 (step @p17 :rule cnf_or_pos :args (@t29)) % 0.20/0.50 (step @p18 :rule reordering :premises (@p17) :args ((or @t28 @t27 @t26 (not @t29)))) % 0.20/0.50 (step @p19 :rule chain_m_resolution :premises (@p18 @p12 @p13 @p16) :args (@t26 @t30 (@list @t21 @t22 @t29))) % 0.20/0.50 (step @p20 :rule cnf_or_pos :args (@t34)) % 0.20/0.50 (step @p21 :rule reordering :premises (@p20) :args ((or @t28 @t32 @t33 @t31 (not @t34)))) % 0.20/0.50 (step @p22 :rule chain_m_resolution :premises (@p21 @p12 @p14 @p19 @p15) :args (@t31 @t35 (@list @t21 @t23 @t26 @t34))) % 0.20/0.50 (step @p23 :rule instantiate :premises (@p2) :args (@t25)) % 0.20/0.50 (step @p24 :rule cnf_or_pos :args (@t37)) % 0.20/0.50 (step @p25 :rule reordering :premises (@p24) :args ((or @t28 @t27 @t36 (not @t37)))) % 0.20/0.50 (step @p26 :rule chain_m_resolution :premises (@p25 @p12 @p13 @p23) :args (@t36 @t30 (@list @t21 @t22 @t37))) % 0.20/0.50 (step @p27 :rule instantiate :premises (@p5) :args ((@list tptp.first_movers tptp.sk2))) % 0.20/0.50 (step @p28 :rule instantiate :premises (@p8) :args (@t24)) % 0.20/0.50 (step @p29 :rule cnf_or_pos :args (@t40)) % 0.20/0.50 (step @p30 :rule reordering :premises (@p29) :args ((or @t28 @t32 @t39 @t33 (not @t40)))) % 0.20/0.50 (step @p31 :rule chain_m_resolution :premises (@p30 @p12 @p14 @p19 @p28) :args (@t39 @t35 (@list @t21 @t23 @t26 @t40))) % 0.20/0.50 (step @p32 :rule cnf_or_pos :args (@t44)) % 0.20/0.50 (step @p33 :rule reordering :premises (@p32) :args ((or @t42 @t43 (not @t44)))) % 0.20/0.50 (step @p34 :rule chain_m_resolution :premises (@p33 @p31 @p27) :args (@t42 (@list false false) (@list @t39 @t44))) % 0.20/0.50 (step @p35 :rule cnf_or_pos :args (@t48)) % 0.20/0.50 (step @p36 :rule reordering :premises (@p35) :args ((or @t46 @t28 @t41 @t47 @t45 @t49))) % 0.20/0.50 (step @p37 :rule chain_m_resolution :premises (@p36 @p11 @p12 @p34 @p26 @p22) :args (@t49 (@list false false true false false) (@list @t20 @t21 @t41 @t36 @t31))) % 0.20/0.50 (assume-push @p44 @t19) % 0.20/0.50 (step @p39 :rule instantiate :premises (@p10) :args ((@list tptp.sk1 tptp.sk2 tptp.first_movers tptp.efficient_producers))) % 0.20/0.50 (step-pop @p45 :rule scope :premises (@p39)) % 0.20/0.50 (step @p40 :rule process_scope :premises (@p45) :args (@t48)) % 0.20/0.50 (step @p42 :rule implies_elim :premises (@p40)) % 0.20/0.50 (step @p43 false :rule chain_m_resolution :premises (@p42 @p37 @p10) :args (false (@list true false) (@list @t48 @t19))) % 0.20/0.50 ) % 0.20/0.50 % SZS output end Proof % 0.20/0.50 % cvc5 exiting %------------------------------------------------------------------------------