%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU564^2 : TPTP v9.2.1. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n002.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:52:13 AM UTC 2026 % Result : Theorem 0.30s 0.56s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU564^2 : TPTP v9.2.1. Released v3.7.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 : n002.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 17:42:03 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.50 %----Proving TH0 % 0.30/0.56 --- 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.30/0.56 % SZS status Theorem % 0.30/0.56 % SZS output start Proof % 0.30/0.56 ( % 0.30/0.56 (declare-sort $$unsorted 0) % 0.30/0.56 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.30/0.56 (define tptp.subset () (let ((_let_1 (@var "B" $$unsorted))) (let ((_let_2 (@var "Xx" $$unsorted))) (let ((_let_3 (_ tptp.in _let_2))) (let ((_let_4 (@var "A" $$unsorted))) (lambda (@list _let_4 _let_1) (forall (@list _let_2) (=> (_ _let_3 _let_4) (_ _let_3 _let_1))))))))) % 0.30/0.56 (define @t1 () (@var "B" $$unsorted)) % 0.30/0.56 (define @t2 () (@var "Xx" $$unsorted)) % 0.30/0.56 (define @t3 () (_ tptp.in @t2)) % 0.30/0.56 (define @t4 () (_ @t3 @t1)) % 0.30/0.56 (define @t5 () (@var "A" $$unsorted)) % 0.30/0.56 (define @t6 () (_ @t3 @t5)) % 0.30/0.56 (define @t7 () (=> @t6 @t4)) % 0.30/0.56 (define @t8 () (=> (_ (_ tptp.subset @t5) @t1) @t7)) % 0.30/0.56 (define @t9 () (@list @t5 @t1 @t2)) % 0.30/0.56 (define @t10 () (forall @t9 @t8)) % 0.30/0.56 (define @t11 () (not @t10)) % 0.30/0.56 (define @t12 () (@list @t2)) % 0.30/0.56 (define @t13 () (forall @t12 @t7)) % 0.30/0.56 (define @t14 () (@list @t5 @t1)) % 0.30/0.56 (define @t15 () (lambda @t14 @t13)) % 0.30/0.56 (define @t16 () (tptp.in @t2 @t1)) % 0.30/0.56 (define @t17 () (tptp.in @t2 @t5)) % 0.30/0.56 (define @t18 () (not @t6)) % 0.30/0.56 (define @t19 () (@var "BOUND_VARIABLE_7456" $$unsorted)) % 0.30/0.56 (define @t20 () (@list @t19)) % 0.30/0.56 (define @t21 () (forall @t20 (or (not (tptp.in @t19 @t5)) (tptp.in @t19 @t1)))) % 0.30/0.56 (define @t22 () (not @t21)) % 0.30/0.56 (define @t23 () (or @t22 @t18 @t4)) % 0.30/0.56 (define @t24 () (or @t18 @t4)) % 0.30/0.56 (define @t25 () (not @t17)) % 0.30/0.56 (define @t26 () (forall @t12 (or @t25 @t16))) % 0.30/0.56 (define @t27 () (=> @t26 @t7)) % 0.30/0.56 (define @t28 () (lambda (@list @t1) @t26)) % 0.30/0.56 (define @t29 () (_ (lambda @t14 @t26) @t5)) % 0.30/0.56 (define @t30 () (=> (_ @t29 @t1) @t7)) % 0.30/0.56 (define @t31 () (forall @t9 @t30)) % 0.30/0.56 (define @t32 () (forall @t9 (or @t22 @t25 @t16))) % 0.30/0.56 (define @t33 () (@quantifiers_skolemize @t32 1)) % 0.30/0.56 (define @t34 () (@quantifiers_skolemize @t32 0)) % 0.30/0.56 (define @t35 () (forall @t20 (or (not (tptp.in @t19 @t34)) (tptp.in @t19 @t33)))) % 0.30/0.56 (define @t36 () (@quantifiers_skolemize @t32 2)) % 0.30/0.56 (define @t37 () (tptp.in @t36 @t33)) % 0.30/0.56 (define @t38 () (tptp.in @t36 @t34)) % 0.30/0.56 (define @t39 () (not @t38)) % 0.30/0.56 (define @t40 () (not @t35)) % 0.30/0.56 (define @t41 () (or @t40 @t39 @t37)) % 0.30/0.56 (define @t42 () (@list true)) % 0.30/0.56 (define @t43 () (@list @t41)) % 0.30/0.56 (define @t44 () (or @t39 @t37)) % 0.30/0.56 (define @t45 () (not @t44)) % 0.30/0.56 (assume @p1 @t11) % 0.30/0.56 (assume @p2 true) % 0.30/0.56 (step @p3 (= tptp.subset @t15) :rule refl :args (@t15)) % 0.30/0.56 (step @p4 :rule refl :args (@t16)) % 0.30/0.56 (step @p5 :rule refl :args (@t4)) % 0.30/0.56 (step @p6 :rule cong :premises (@p5 @p4) :args ((= @t4 @t16))) % 0.30/0.56 (step @p7 :rule symm :premises (@p6)) % 0.30/0.56 (step @p8 :rule eq_resolve :premises (@p5 @p7)) % 0.30/0.56 (step @p9 :rule refl :args (@t17)) % 0.30/0.56 (step @p10 :rule refl :args (@t6)) % 0.30/0.56 (step @p11 :rule cong :premises (@p10 @p9) :args ((= @t6 @t17))) % 0.30/0.56 (step @p12 :rule symm :premises (@p11)) % 0.30/0.56 (step @p13 :rule eq_resolve :premises (@p10 @p12)) % 0.30/0.56 (step @p14 :rule cong :premises (@p13) :args (@t18)) % 0.30/0.56 (step @p15 :rule refl :args (@t22)) % 0.30/0.56 (step @p16 :rule nary_cong :premises (@p15 @p14 @p8) :args (@t23)) % 0.30/0.56 (step @p17 :rule cong :premises (@p16) :args ((forall @t9 @t23))) % 0.30/0.56 (step @p18 :rule aci_norm :args ((= (or @t22 @t24) @t23))) % 0.30/0.56 (step @p19 :rule bool-impl-elim :args (@t6 @t4)) % 0.30/0.56 (step @p20 :rule nary_cong :premises (@p15 @p19) :args ((or @t22 @t7))) % 0.30/0.56 (step @p21 :rule trans :premises (@p20 @p18)) % 0.30/0.56 (step @p22 :rule bool-impl-elim :args (@t21 @t7)) % 0.30/0.56 (step @p23 :rule trans :premises (@p22 @p21)) % 0.30/0.56 (step @p24 :rule cong :premises (@p23) :args ((forall @t9 (=> @t21 @t7)))) % 0.30/0.56 (step @p25 :rule trans :premises (@p24 @p17)) % 0.30/0.56 (step @p26 :rule refl :args (@t7)) % 0.30/0.56 (step @p27 :rule alpha_equiv :args (@t26 (@list @t2) (@list @t19))) % 0.30/0.56 (step @p28 :rule cong :premises (@p27 @p26) :args (@t27)) % 0.30/0.56 (step @p29 :rule cong :premises (@p28) :args ((forall @t9 @t27))) % 0.30/0.56 (step @p30 :rule trans :premises (@p29 @p25)) % 0.30/0.56 (step @p31 :rule refl :args (@t7)) % 0.30/0.56 (step @p32 :rule beta-reduce :args ((= (_ @t28 @t1) @t26))) % 0.30/0.56 (step @p33 :rule refl :args (@t1)) % 0.30/0.56 (step @p34 :rule beta-reduce :args ((= @t29 @t28))) % 0.30/0.56 (step @p35 :rule ho_cong :premises (@p34 @p33)) % 0.30/0.56 (step @p36 :rule trans :premises (@p35 @p32)) % 0.30/0.56 (step @p37 :rule cong :premises (@p36 @p31) :args (@t30)) % 0.30/0.56 (step @p38 :rule cong :premises (@p37) :args (@t31)) % 0.30/0.56 (step @p39 :rule trans :premises (@p38 @p30)) % 0.30/0.56 (step @p40 :rule cong :premises (@p39) :args ((not @t31))) % 0.30/0.56 (step @p41 :rule refl :args (@t5)) % 0.30/0.56 (step @p42 :rule nary_cong :premises (@p14 @p8) :args (@t24)) % 0.30/0.56 (step @p43 :rule cong :premises (@p42) :args ((forall @t12 @t24))) % 0.30/0.56 (step @p44 :rule cong :premises (@p19) :args (@t13)) % 0.30/0.56 (step @p45 :rule trans :premises (@p44 @p43)) % 0.30/0.56 (step @p46 :rule cong :premises (@p45) :args (@t15)) % 0.30/0.56 (step @p47 :rule trans :premises (@p3 @p46)) % 0.30/0.56 (step @p48 :rule ho_cong :premises (@p47 @p41)) % 0.30/0.56 (step @p49 :rule ho_cong :premises (@p48 @p33)) % 0.30/0.56 (step @p50 :rule cong :premises (@p49 @p31) :args (@t8)) % 0.30/0.56 (step @p51 :rule cong :premises (@p50) :args (@t10)) % 0.30/0.56 (step @p52 :rule cong :premises (@p51) :args (@t11)) % 0.30/0.56 (step @p53 :rule trans :premises (@p52 @p40)) % 0.30/0.56 (step @p54 :rule eq_resolve :premises (@p1 @p53)) % 0.30/0.56 (step @p55 :rule skolemize :premises (@p54)) % 0.30/0.56 (step @p56 :rule bool-double-not-elim :args (@t35)) % 0.30/0.56 (step @p57 :rule refl :args (@t41)) % 0.30/0.56 (step @p58 :rule nary_cong :premises (@p57 @p56) :args ((or @t41 (not @t40)))) % 0.30/0.56 (step @p59 :rule cnf_or_neg :args (@t41 0)) % 0.30/0.56 (step @p60 :rule eq_resolve :premises (@p59 @p58)) % 0.30/0.56 (step @p61 :rule reordering :premises (@p60) :args ((or @t35 @t41))) % 0.30/0.56 (step @p62 :rule chain_m_resolution :premises (@p61 @p55) :args (@t35 @t42 @t43)) % 0.30/0.56 (step @p63 :rule cnf_or_neg :args (@t41 2)) % 0.30/0.56 (step @p64 :rule chain_m_resolution :premises (@p63 @p55) :args ((not @t37) @t42 @t43)) % 0.30/0.56 (step @p65 :rule bool-double-not-elim :args (@t38)) % 0.30/0.56 (step @p66 :rule nary_cong :premises (@p57 @p65) :args ((or @t41 (not @t39)))) % 0.30/0.56 (step @p67 :rule cnf_or_neg :args (@t41 1)) % 0.30/0.56 (step @p68 :rule eq_resolve :premises (@p67 @p66)) % 0.30/0.56 (step @p69 :rule reordering :premises (@p68) :args ((or @t38 @t41))) % 0.30/0.56 (step @p70 :rule chain_m_resolution :premises (@p69 @p55) :args (@t38 @t42 @t43)) % 0.30/0.56 (step @p71 :rule cnf_or_pos :args (@t44)) % 0.30/0.56 (step @p72 :rule reordering :premises (@p71) :args ((or @t39 @t37 @t45))) % 0.30/0.56 (step @p73 :rule chain_m_resolution :premises (@p72 @p70 @p64) :args (@t45 (@list false true) (@list @t38 @t37))) % 0.30/0.56 (assume-push @p80 @t35) % 0.30/0.56 (step @p75 :rule instantiate :premises (@p62) :args ((@list @t36))) % 0.30/0.56 (step-pop @p81 :rule scope :premises (@p75)) % 0.30/0.56 (step @p76 :rule process_scope :premises (@p81) :args (@t44)) % 0.30/0.56 (step @p78 :rule implies_elim :premises (@p76)) % 0.30/0.56 (step @p79 false :rule chain_m_resolution :premises (@p78 @p73 @p62) :args (false (@list true false) (@list @t44 @t35))) % 0.30/0.56 ) % 0.30/0.56 % SZS output end Proof % 0.30/0.56 % cvc5 exiting %------------------------------------------------------------------------------