%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : MSC011+1 : TPTP v9.2.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n011.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Jun 3 08:36:05 AM UTC 2026 % Result : Theorem 0.30s 0.54s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : MSC011+1 : TPTP v9.2.1. Released v3.2.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n011.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 09:44:35 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.54 % SZS status Theorem % 0.30/0.54 % SZS output start Proof % 0.30/0.54 ( % 0.30/0.54 (declare-sort $$unsorted 0) % 0.30/0.54 (declare-const tptp.neg_psi Bool) % 0.30/0.54 (declare-const tptp.drunk (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.not_drunk (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.goal Bool) % 0.30/0.54 (define @t1 () (@var "A" $$unsorted)) % 0.30/0.54 (define @t2 () (tptp.not_drunk @t1)) % 0.30/0.54 (define @t3 () (tptp.drunk @t1)) % 0.30/0.54 (define @t4 () (and @t3 @t2)) % 0.30/0.54 (define @t5 () (@list @t1)) % 0.30/0.54 (define @t6 () (forall @t5 (=> @t4 tptp.goal))) % 0.30/0.54 (define @t7 () (forall @t5 (and @t3 tptp.neg_psi))) % 0.30/0.54 (define @t8 () (exists @t5 @t2)) % 0.30/0.54 (define @t9 () (=> tptp.neg_psi @t8)) % 0.30/0.54 (define @t10 () (forall @t5 tptp.neg_psi)) % 0.30/0.54 (define @t11 () (forall @t5 @t3)) % 0.30/0.54 (define @t12 () (@var "BOUND_VARIABLE_7433" $$unsorted)) % 0.30/0.54 (define @t13 () (and @t11 @t10)) % 0.30/0.54 (define @t14 () (not @t2)) % 0.30/0.54 (define @t15 () (not @t3)) % 0.30/0.54 (define @t16 () (or @t15 @t14)) % 0.30/0.54 (define @t17 () (forall @t5 @t16)) % 0.30/0.54 (define @t18 () (or tptp.goal @t16)) % 0.30/0.54 (define @t19 () (or @t15 @t14 tptp.goal)) % 0.30/0.54 (define @t20 () (@list true)) % 0.30/0.54 (define @t21 () (forall @t5 @t14)) % 0.30/0.54 (define @t22 () (@quantifiers_skolemize @t21 0)) % 0.30/0.54 (define @t23 () (@list @t22)) % 0.30/0.54 (define @t24 () (not @t21)) % 0.30/0.54 (define @t25 () (tptp.not_drunk @t22)) % 0.30/0.54 (define @t26 () (not @t25)) % 0.30/0.54 (define @t27 () (not @t26)) % 0.30/0.54 (define @t28 () (tptp.drunk @t22)) % 0.30/0.54 (define @t29 () (not @t28)) % 0.30/0.54 (define @t30 () (or @t29 @t26)) % 0.30/0.54 (define @t31 () (forall (@list @t12) (tptp.drunk @t12))) % 0.30/0.54 (assume @p1 @t6) % 0.30/0.54 (assume @p2 @t7) % 0.30/0.54 (assume @p3 @t9) % 0.30/0.54 (assume @p4 (not tptp.goal)) % 0.30/0.54 (assume @p5 true) % 0.30/0.54 (step @p6 :rule quant-unused-vars :args ((= @t10 tptp.neg_psi))) % 0.30/0.54 (step @p7 :rule alpha_equiv :args (@t11 (@list @t1) (@list @t12))) % 0.30/0.54 (step @p8 :rule nary_cong :premises (@p7 @p6) :args (@t13)) % 0.30/0.54 (step @p9 :rule quant-miniscope-and :args ((= @t7 @t13))) % 0.30/0.54 (step @p10 :rule trans :premises (@p9 @p8)) % 0.30/0.54 (step @p11 :rule eq_resolve :premises (@p2 @p10)) % 0.30/0.54 (step @p12 :rule and_elim :premises (@p11) :args (0)) % 0.30/0.54 (step @p13 :rule quant-miniscope-or :args ((= (forall @t5 @t18) (or tptp.goal @t17)))) % 0.30/0.54 (step @p14 :rule aci_norm :args ((= @t19 @t18))) % 0.30/0.54 (step @p15 :rule cong :premises (@p14) :args ((forall @t5 @t19))) % 0.30/0.54 (step @p16 :rule trans :premises (@p15 @p13)) % 0.30/0.54 (step @p17 :rule aci_norm :args ((= (or @t16 tptp.goal) @t19))) % 0.30/0.54 (step @p18 :rule refl :args (tptp.goal)) % 0.30/0.54 (step @p19 :rule bool-and-de-morgan :args (@t3 @t2 true)) % 0.30/0.54 (step @p20 :rule nary_cong :premises (@p19 @p18) :args ((or (not @t4) tptp.goal))) % 0.30/0.54 (step @p21 :rule trans :premises (@p20 @p17)) % 0.30/0.54 (step @p22 :rule bool-impl-elim :args (@t4 tptp.goal)) % 0.30/0.54 (step @p23 :rule trans :premises (@p22 @p21)) % 0.30/0.54 (step @p24 :rule cong :premises (@p23) :args (@t6)) % 0.30/0.54 (step @p25 :rule trans :premises (@p24 @p16)) % 0.30/0.54 (step @p26 :rule eq_resolve :premises (@p1 @p25)) % 0.30/0.54 (step @p27 :rule chain_m_resolution :premises (@p26 @p4) :args (@t17 @t20 (@list tptp.goal))) % 0.30/0.54 (step @p28 :rule instantiate :premises (@p27) :args (@t23)) % 0.30/0.54 (step @p29 :rule and_elim :premises (@p11) :args (1)) % 0.30/0.54 (step @p30 :rule exists-elim :args ((= @t8 @t24))) % 0.30/0.54 (step @p31 :rule refl :args (tptp.neg_psi)) % 0.30/0.54 (step @p32 :rule cong :premises (@p31 @p30) :args (@t9)) % 0.30/0.54 (step @p33 :rule eq_resolve :premises (@p3 @p32)) % 0.30/0.54 (step @p34 :rule implies_elim :premises (@p33)) % 0.30/0.54 (step @p35 :rule reordering :premises (@p34) :args ((or @t24 (not tptp.neg_psi)))) % 0.30/0.54 (step @p36 :rule chain_m_resolution :premises (@p35 @p29) :args (@t24 (@list false) (@list tptp.neg_psi))) % 0.30/0.54 (step @p37 :rule refl :args (@t25)) % 0.30/0.54 (step @p38 :rule bool-double-not-elim :args (@t21)) % 0.30/0.54 (step @p39 :rule nary_cong :premises (@p38 @p37) :args ((or (not @t24) @t25))) % 0.30/0.54 (step @p40 :rule bool-double-not-elim :args (@t25)) % 0.30/0.54 (step @p41 :rule refl :args (@t24)) % 0.30/0.54 (step @p42 :rule cong :premises (@p41 @p40) :args ((=> @t24 @t27))) % 0.30/0.54 (assume-push @p60 @t24) % 0.30/0.54 (step @p44 :rule skolemize :premises (@p36)) % 0.30/0.54 (step-pop @p61 :rule scope :premises (@p44)) % 0.30/0.54 (step @p45 :rule process_scope :premises (@p61) :args (@t27)) % 0.30/0.54 (step @p47 :rule eq_resolve :premises (@p45 @p42)) % 0.30/0.54 (step @p48 :rule implies_elim :premises (@p47)) % 0.30/0.54 (step @p49 :rule eq_resolve :premises (@p48 @p39)) % 0.30/0.54 (step @p50 :rule chain_m_resolution :premises (@p49 @p36) :args (@t25 @t20 (@list @t21))) % 0.30/0.54 (step @p51 :rule cnf_or_pos :args (@t30)) % 0.30/0.54 (step @p52 :rule reordering :premises (@p51) :args ((or @t26 @t29 (not @t30)))) % 0.30/0.54 (step @p53 :rule chain_m_resolution :premises (@p52 @p50 @p28) :args (@t29 (@list false false) (@list @t25 @t30))) % 0.30/0.54 (assume-push @p62 @t31) % 0.30/0.54 (step @p55 :rule instantiate :premises (@p12) :args (@t23)) % 0.30/0.54 (step-pop @p63 :rule scope :premises (@p55)) % 0.30/0.54 (step @p56 :rule process_scope :premises (@p63) :args (@t28)) % 0.30/0.54 (step @p58 :rule implies_elim :premises (@p56)) % 0.30/0.54 (step @p59 false :rule chain_m_resolution :premises (@p58 @p53 @p12) :args (false (@list true false) (@list @t28 @t31))) % 0.30/0.54 ) % 0.30/0.54 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------