%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEV409^5 : TPTP v9.2.1. Released v4.0.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:55:55 AM UTC 2026 % Result : Theorem 0.47s 0.68s % Output : Proof 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEV409^5 : TPTP v9.2.1. Released v4.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.18/0.34 % Computer : n011.cluster.edu % 0.18/0.34 % Model : x86_64 x86_64 % 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.34 % Memory : 8042.1875MB % 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 300 % 0.18/0.34 % DateTime : Tue Jun 2 18:31:35 EDT 2026 % 0.18/0.34 % CPUTime : % 0.32/0.50 %----Proving TH0 % 0.47/0.68 --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s... % 0.47/0.68 % SZS status Theorem % 0.47/0.68 % SZS output start Proof % 0.47/0.68 ( % 0.47/0.68 (declare-sort $$unsorted 0) % 0.47/0.68 (define @t1 () (@var "Xx" $$unsorted)) % 0.47/0.68 (define @t2 () (@var "Y" (-> $$unsorted Bool))) % 0.47/0.68 (define @t3 () (_ @t2 @t1)) % 0.47/0.68 (define @t4 () (@var "X" (-> $$unsorted Bool))) % 0.47/0.68 (define @t5 () (_ @t4 @t1)) % 0.47/0.68 (define @t6 () (= @t5 @t3)) % 0.47/0.68 (define @t7 () (@list @t1)) % 0.47/0.68 (define @t8 () (forall @t7 @t6)) % 0.47/0.68 (define @t9 () (@var "R" (-> (-> $$unsorted Bool) (-> $$unsorted Bool) Bool))) % 0.47/0.68 (define @t10 () (_ (_ @t9 @t2) @t4)) % 0.47/0.68 (define @t11 () (_ (_ @t9 @t4) @t2)) % 0.47/0.68 (define @t12 () (and @t11 @t10)) % 0.47/0.68 (define @t13 () (=> @t12 @t8)) % 0.47/0.68 (define @t14 () (@list @t4 @t2)) % 0.47/0.68 (define @t15 () (forall @t14 @t13)) % 0.47/0.68 (define @t16 () (@list @t9)) % 0.47/0.68 (define @t17 () (exists @t16 @t15)) % 0.47/0.68 (define @t18 () (not @t17)) % 0.47/0.68 (define @t19 () (@var "BOUND_VARIABLE_7447" $$unsorted)) % 0.47/0.68 (define @t20 () (= (_ @t4 @t19) (_ @t2 @t19))) % 0.47/0.68 (define @t21 () (_ @t9 @t2 @t4)) % 0.47/0.68 (define @t22 () (not @t21)) % 0.47/0.68 (define @t23 () (_ @t9 @t4 @t2)) % 0.47/0.68 (define @t24 () (not @t23)) % 0.47/0.68 (define @t25 () (or @t24 @t22 @t20)) % 0.47/0.68 (define @t26 () (@list @t4 @t2 @t19)) % 0.47/0.68 (define @t27 () (forall @t26 @t25)) % 0.47/0.68 (define @t28 () (forall @t16 (not @t27))) % 0.47/0.68 (define @t29 () (@list @t19)) % 0.47/0.68 (define @t30 () (forall @t29 @t25)) % 0.47/0.68 (define @t31 () (forall @t29 @t20)) % 0.47/0.68 (define @t32 () (or @t24 @t22 @t31)) % 0.47/0.68 (define @t33 () (_ @t2 @t1)) % 0.47/0.68 (define @t34 () (_ @t4 @t1)) % 0.47/0.68 (define @t35 () (forall @t7 (= @t34 @t33))) % 0.47/0.68 (define @t36 () (not @t10)) % 0.47/0.68 (define @t37 () (not @t11)) % 0.47/0.68 (define @t38 () (or @t37 @t36 @t35)) % 0.47/0.68 (define @t39 () (lambda (@list (@var "BOUND_VARIABLE_14549" (-> $$unsorted Bool)) (@var "BOUND_VARIABLE_14550" (-> $$unsorted Bool))) false)) % 0.47/0.68 (define @t40 () (_ @t39 @t2 @t4)) % 0.47/0.68 (define @t41 () (not @t40)) % 0.47/0.68 (define @t42 () (_ @t39 @t4 @t2)) % 0.47/0.68 (define @t43 () (not @t42)) % 0.47/0.68 (define @t44 () (or @t43 @t41 @t20)) % 0.47/0.68 (define @t45 () (forall @t26 @t44)) % 0.47/0.68 (define @t46 () (not @t45)) % 0.47/0.68 (assume @p1 @t18) % 0.47/0.68 (assume @p2 true) % 0.47/0.68 (step @p3 :rule bool-double-not-elim :args (@t28)) % 0.47/0.68 (step @p4 :rule exists-elim :args ((= (exists @t16 @t27) (not @t28)))) % 0.47/0.68 (step @p5 :rule quant-merge-prenex :args ((= (forall @t14 @t30) @t27))) % 0.47/0.68 (step @p6 :rule alpha_equiv :args (@t31 (@list @t19) (@list @t1))) % 0.47/0.68 (step @p7 :rule refl :args (@t22)) % 0.47/0.68 (step @p8 :rule refl :args (@t24)) % 0.47/0.68 (step @p9 :rule nary_cong :premises (@p8 @p7 @p6) :args (@t32)) % 0.47/0.68 (step @p10 :rule quant-miniscope-or :args ((= @t30 @t32))) % 0.47/0.68 (step @p11 :rule trans :premises (@p10 @p9)) % 0.47/0.68 (step @p12 :rule symm :premises (@p11)) % 0.47/0.68 (step @p13 :rule cong :premises (@p12) :args ((forall @t14 (or @t24 @t22 @t35)))) % 0.47/0.68 (step @p14 :rule trans :premises (@p13 @p5)) % 0.47/0.68 (step @p15 :rule refl :args (@t35)) % 0.47/0.68 (step @p16 :rule refl :args (@t21)) % 0.47/0.68 (step @p17 :rule refl :args (@t10)) % 0.47/0.68 (step @p18 :rule cong :premises (@p17 @p16) :args ((= @t10 @t21))) % 0.47/0.68 (step @p19 :rule symm :premises (@p18)) % 0.47/0.68 (step @p20 :rule eq_resolve :premises (@p17 @p19)) % 0.47/0.68 (step @p21 :rule cong :premises (@p20) :args (@t36)) % 0.47/0.68 (step @p22 :rule refl :args (@t23)) % 0.47/0.68 (step @p23 :rule refl :args (@t11)) % 0.47/0.68 (step @p24 :rule cong :premises (@p23 @p22) :args ((= @t11 @t23))) % 0.47/0.68 (step @p25 :rule symm :premises (@p24)) % 0.47/0.68 (step @p26 :rule eq_resolve :premises (@p23 @p25)) % 0.47/0.68 (step @p27 :rule cong :premises (@p26) :args (@t37)) % 0.47/0.68 (step @p28 :rule nary_cong :premises (@p27 @p21 @p15) :args (@t38)) % 0.47/0.68 (step @p29 :rule cong :premises (@p28) :args ((forall @t14 @t38))) % 0.47/0.68 (step @p30 :rule trans :premises (@p29 @p14)) % 0.47/0.68 (step @p31 :rule aci_norm :args ((= (or (or @t37 @t36) @t35) @t38))) % 0.47/0.68 (step @p32 :rule bool-and-de-morgan :args (@t11 @t10 true)) % 0.47/0.68 (step @p33 :rule nary_cong :premises (@p32 @p15) :args ((or (not @t12) @t35))) % 0.47/0.68 (step @p34 :rule trans :premises (@p33 @p31)) % 0.47/0.68 (step @p35 :rule bool-impl-elim :args (@t12 @t35)) % 0.47/0.68 (step @p36 :rule trans :premises (@p35 @p34)) % 0.47/0.68 (step @p37 :rule cong :premises (@p36) :args ((forall @t14 (=> @t12 @t35)))) % 0.47/0.68 (step @p38 :rule trans :premises (@p37 @p30)) % 0.47/0.68 (step @p39 :rule refl :args (@t33)) % 0.47/0.68 (step @p40 :rule refl :args (@t3)) % 0.47/0.68 (step @p41 :rule cong :premises (@p40 @p39) :args ((= @t3 @t33))) % 0.47/0.68 (step @p42 :rule symm :premises (@p41)) % 0.47/0.68 (step @p43 :rule eq_resolve :premises (@p40 @p42)) % 0.47/0.68 (step @p44 :rule refl :args (@t34)) % 0.47/0.68 (step @p45 :rule refl :args (@t5)) % 0.47/0.68 (step @p46 :rule cong :premises (@p45 @p44) :args ((= @t5 @t34))) % 0.47/0.68 (step @p47 :rule symm :premises (@p46)) % 0.47/0.68 (step @p48 :rule eq_resolve :premises (@p45 @p47)) % 0.47/0.68 (step @p49 :rule cong :premises (@p48 @p43) :args (@t6)) % 0.47/0.68 (step @p50 :rule cong :premises (@p49) :args (@t8)) % 0.47/0.68 (step @p51 :rule refl :args (@t12)) % 0.47/0.68 (step @p52 :rule cong :premises (@p51 @p50) :args (@t13)) % 0.47/0.68 (step @p53 :rule cong :premises (@p52) :args (@t15)) % 0.47/0.68 (step @p54 :rule trans :premises (@p53 @p38)) % 0.47/0.68 (step @p55 :rule cong :premises (@p54) :args (@t17)) % 0.47/0.68 (step @p56 :rule trans :premises (@p55 @p4)) % 0.47/0.68 (step @p57 :rule cong :premises (@p56) :args (@t18)) % 0.47/0.68 (step @p58 :rule trans :premises (@p57 @p3)) % 0.47/0.68 (step @p59 :rule eq_resolve :premises (@p1 @p58)) % 0.47/0.68 (step @p60 :rule bool-impl-false1 :args (@t28)) % 0.47/0.68 (step @p61 :rule evaluate :args ((not true))) % 0.47/0.68 (step @p62 :rule quant-unused-vars :args ((= (forall @t26 true) true))) % 0.47/0.68 (step @p63 :rule absorb :args ((= (or true true @t20) true))) % 0.47/0.68 (step @p64 :rule refl :args (@t20)) % 0.47/0.68 (step @p65 :rule evaluate :args ((not false))) % 0.47/0.68 (step @p66 :rule beta-reduce :args ((= @t40 false))) % 0.47/0.68 (step @p67 :rule cong :premises (@p66) :args (@t41)) % 0.47/0.68 (step @p68 :rule trans :premises (@p67 @p65)) % 0.47/0.68 (step @p69 :rule beta-reduce :args ((= @t42 false))) % 0.47/0.68 (step @p70 :rule cong :premises (@p69) :args (@t43)) % 0.47/0.68 (step @p71 :rule trans :premises (@p70 @p65)) % 0.47/0.68 (step @p72 :rule nary_cong :premises (@p71 @p68 @p64) :args (@t44)) % 0.47/0.68 (step @p73 :rule trans :premises (@p72 @p63)) % 0.47/0.68 (step @p74 :rule cong :premises (@p73) :args (@t45)) % 0.47/0.68 (step @p75 :rule trans :premises (@p74 @p62)) % 0.47/0.68 (step @p76 :rule cong :premises (@p75) :args (@t46)) % 0.47/0.68 (step @p77 :rule trans :premises (@p76 @p61)) % 0.47/0.68 (step @p78 :rule refl :args (@t28)) % 0.47/0.68 (step @p79 :rule cong :premises (@p78 @p77) :args ((=> @t28 @t46))) % 0.47/0.68 (step @p80 :rule trans :premises (@p79 @p60)) % 0.47/0.68 (assume-push @p87 @t28) % 0.47/0.68 (step @p82 :rule instantiate :premises (@p59) :args ((@list @t39))) % 0.47/0.68 (step-pop @p88 :rule scope :premises (@p82)) % 0.47/0.68 (step @p83 :rule process_scope :premises (@p88) :args (@t46)) % 0.47/0.68 (step @p85 :rule eq_resolve :premises (@p83 @p80)) % 0.47/0.68 (step @p86 false :rule chain_m_resolution :premises (@p85 @p59) :args (false (@list false) (@list @t28))) % 0.47/0.68 ) % 0.47/0.68 % SZS output end Proof % 0.47/0.68 % cvc5 exiting %------------------------------------------------------------------------------