%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU563^2 : TPTP v9.2.1. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n015.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:12 AM UTC 2026 % Result : Theorem 0.32s 0.56s % Output : Proof 0.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU563^2 : TPTP v9.2.1. Released v3.7.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n015.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Jun 2 17:42:04 EDT 2026 % 0.16/0.34 % CPUTime : % 0.32/0.49 %----Proving TH0 % 0.32/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.32/0.56 % SZS status Theorem % 0.32/0.56 % SZS output start Proof % 0.32/0.56 ( % 0.32/0.56 (declare-sort $$unsorted 0) % 0.32/0.56 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.32/0.56 (declare-const tptp.subsetI2 Bool) % 0.32/0.56 (declare-const tptp.emptysetimpfalse Bool) % 0.32/0.56 (declare-const tptp.emptyset $$unsorted) % 0.32/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.32/0.56 (define @t1 () (@var "Xx" $$unsorted)) % 0.32/0.56 (define @t2 () (_ tptp.in @t1)) % 0.32/0.56 (define @t3 () (_ @t2 tptp.emptyset)) % 0.32/0.56 (define @t4 () (@list @t1)) % 0.32/0.56 (define @t5 () (forall @t4 (=> @t3 false))) % 0.32/0.56 (define @t6 () (= tptp.emptysetimpfalse @t5)) % 0.32/0.56 (define @t7 () (@var "B" $$unsorted)) % 0.32/0.56 (define @t8 () (@var "A" $$unsorted)) % 0.32/0.56 (define @t9 () (_ @t2 @t7)) % 0.32/0.56 (define @t10 () (_ @t2 @t8)) % 0.32/0.56 (define @t11 () (forall @t4 (=> @t10 @t9))) % 0.32/0.56 (define @t12 () (=> @t11 (_ (_ tptp.subset @t8) @t7))) % 0.32/0.56 (define @t13 () (@list @t8 @t7)) % 0.32/0.56 (define @t14 () (forall @t13 @t12)) % 0.32/0.56 (define @t15 () (= tptp.subsetI2 @t14)) % 0.32/0.56 (define @t16 () (@list @t8)) % 0.32/0.56 (define @t17 () (forall @t16 (_ (_ tptp.subset tptp.emptyset) @t8))) % 0.32/0.56 (define @t18 () (=> tptp.subsetI2 @t17)) % 0.32/0.56 (define @t19 () (=> tptp.emptysetimpfalse @t18)) % 0.32/0.56 (define @t20 () (not @t19)) % 0.32/0.56 (define @t21 () (lambda @t13 @t11)) % 0.32/0.56 (define @t22 () (tptp.in @t1 @t8)) % 0.32/0.56 (define @t23 () (tptp.in @t1 tptp.emptyset)) % 0.32/0.56 (define @t24 () (not @t23)) % 0.32/0.56 (define @t25 () (or @t24 @t22)) % 0.32/0.56 (define @t26 () (forall (@list @t8 @t1) @t25)) % 0.32/0.56 (define @t27 () (forall @t4 @t24)) % 0.32/0.56 (define @t28 () (=> @t27 (=> true @t26))) % 0.32/0.56 (define @t29 () (tptp.in @t1 @t7)) % 0.32/0.56 (define @t30 () (forall @t4 (or (not @t22) @t29))) % 0.32/0.56 (define @t31 () (@list @t7)) % 0.32/0.56 (define @t32 () (lambda @t31 @t30)) % 0.32/0.56 (define @t33 () (lambda @t13 @t30)) % 0.32/0.56 (define @t34 () (_ @t33 @t8)) % 0.32/0.56 (define @t35 () (not @t10)) % 0.32/0.56 (define @t36 () (or @t35 @t9)) % 0.32/0.56 (define @t37 () (=> @t11 (_ @t34 @t7))) % 0.32/0.56 (define @t38 () (forall @t13 @t37)) % 0.32/0.56 (define @t39 () (=> tptp.subsetI2 @t26)) % 0.32/0.56 (define @t40 () (not @t3)) % 0.32/0.56 (define @t41 () (=> tptp.emptysetimpfalse @t39)) % 0.32/0.56 (define @t42 () (forall @t4 @t25)) % 0.32/0.56 (define @t43 () (lambda @t31 (forall @t4 (or @t24 @t29)))) % 0.32/0.56 (define @t44 () (_ @t33 tptp.emptyset)) % 0.32/0.56 (define @t45 () (forall @t16 (_ @t44 @t8))) % 0.32/0.56 (define @t46 () (=> tptp.subsetI2 @t45)) % 0.32/0.56 (define @t47 () (=> tptp.emptysetimpfalse @t46)) % 0.32/0.56 (define @t48 () (@quantifiers_skolemize @t26 1)) % 0.32/0.56 (define @t49 () (tptp.in @t48 tptp.emptyset)) % 0.32/0.56 (define @t50 () (not @t49)) % 0.32/0.56 (define @t51 () (or @t50 (tptp.in @t48 (@quantifiers_skolemize @t26 0)))) % 0.32/0.56 (assume @p1 @t6) % 0.32/0.56 (assume @p2 @t15) % 0.32/0.56 (assume @p3 @t20) % 0.32/0.56 (assume @p4 true) % 0.32/0.56 (step @p5 (= tptp.subset @t21) :rule refl :args (@t21)) % 0.32/0.56 (step @p6 :rule bool-impl-true2 :args (@t26)) % 0.32/0.56 (step @p7 :rule refl :args (@t27)) % 0.32/0.56 (step @p8 :rule cong :premises (@p7 @p6) :args (@t28)) % 0.32/0.56 (step @p9 :rule cong :premises (@p8) :args ((not @t28))) % 0.32/0.56 (step @p10 :rule refl :args (@t26)) % 0.32/0.56 (step @p11 :rule bool-eq-true :args (tptp.subsetI2)) % 0.32/0.56 (step @p12 :rule symm :premises (@p11)) % 0.32/0.56 (step @p13 :rule quant-unused-vars :args ((= (forall @t13 true) true))) % 0.32/0.56 (step @p14 :rule bool-or-taut2 :args (false @t30 false false)) % 0.32/0.56 (step @p15 :rule bool-impl-elim :args (@t30 @t30)) % 0.32/0.56 (step @p16 :rule trans :premises (@p15 @p14)) % 0.32/0.56 (step @p17 :rule cong :premises (@p16) :args ((forall @t13 (=> @t30 @t30)))) % 0.32/0.56 (step @p18 :rule trans :premises (@p17 @p13)) % 0.32/0.56 (step @p19 :rule beta-reduce :args ((= (_ @t32 @t7) @t30))) % 0.32/0.56 (step @p20 :rule refl :args (@t7)) % 0.32/0.56 (step @p21 :rule beta-reduce :args ((= @t34 @t32))) % 0.32/0.56 (step @p22 :rule ho_cong :premises (@p21 @p20)) % 0.32/0.56 (step @p23 :rule trans :premises (@p22 @p19)) % 0.32/0.56 (step @p24 :rule refl :args (@t29)) % 0.32/0.56 (step @p25 :rule refl :args (@t9)) % 0.32/0.56 (step @p26 :rule cong :premises (@p25 @p24) :args ((= @t9 @t29))) % 0.32/0.56 (step @p27 :rule symm :premises (@p26)) % 0.32/0.56 (step @p28 :rule eq_resolve :premises (@p25 @p27)) % 0.32/0.56 (step @p29 :rule refl :args (@t22)) % 0.32/0.56 (step @p30 :rule refl :args (@t10)) % 0.32/0.56 (step @p31 :rule cong :premises (@p30 @p29) :args ((= @t10 @t22))) % 0.32/0.56 (step @p32 :rule symm :premises (@p31)) % 0.32/0.56 (step @p33 :rule eq_resolve :premises (@p30 @p32)) % 0.32/0.56 (step @p34 :rule cong :premises (@p33) :args (@t35)) % 0.32/0.56 (step @p35 :rule nary_cong :premises (@p34 @p28) :args (@t36)) % 0.32/0.56 (step @p36 :rule cong :premises (@p35) :args ((forall @t4 @t36))) % 0.32/0.56 (step @p37 :rule bool-impl-elim :args (@t10 @t9)) % 0.32/0.56 (step @p38 :rule cong :premises (@p37) :args (@t11)) % 0.32/0.56 (step @p39 :rule trans :premises (@p38 @p36)) % 0.32/0.56 (step @p40 :rule cong :premises (@p39 @p23) :args (@t37)) % 0.32/0.56 (step @p41 :rule cong :premises (@p40) :args (@t38)) % 0.32/0.56 (step @p42 :rule trans :premises (@p41 @p18)) % 0.32/0.56 (step @p43 :rule refl :args (tptp.subsetI2)) % 0.32/0.56 (step @p44 :rule cong :premises (@p43 @p42) :args ((= tptp.subsetI2 @t38))) % 0.32/0.56 (step @p45 :rule trans :premises (@p44 @p11)) % 0.32/0.56 (step @p46 :rule refl :args (@t8)) % 0.32/0.56 (step @p47 :rule cong :premises (@p39) :args (@t21)) % 0.32/0.56 (step @p48 :rule trans :premises (@p5 @p47)) % 0.32/0.56 (step @p49 :rule ho_cong :premises (@p48 @p46)) % 0.32/0.56 (step @p50 :rule ho_cong :premises (@p49 @p20)) % 0.32/0.56 (step @p51 :rule refl :args (@t11)) % 0.32/0.56 (step @p52 :rule cong :premises (@p51 @p50) :args (@t12)) % 0.32/0.56 (step @p53 :rule cong :premises (@p52) :args (@t14)) % 0.32/0.56 (step @p54 :rule cong :premises (@p43 @p53) :args (@t15)) % 0.32/0.56 (step @p55 :rule trans :premises (@p54 @p45)) % 0.32/0.56 (step @p56 :rule eq_resolve :premises (@p2 @p55)) % 0.32/0.56 (step @p57 :rule eq_resolve :premises (@p56 @p12)) % 0.32/0.56 (step @p58 :rule cong :premises (@p57 @p10) :args (@t39)) % 0.32/0.56 (step @p59 :rule refl :args (@t23)) % 0.32/0.56 (step @p60 :rule refl :args (@t3)) % 0.32/0.56 (step @p61 :rule cong :premises (@p60 @p59) :args ((= @t3 @t23))) % 0.32/0.56 (step @p62 :rule symm :premises (@p61)) % 0.32/0.56 (step @p63 :rule eq_resolve :premises (@p60 @p62)) % 0.32/0.56 (step @p64 :rule cong :premises (@p63) :args (@t40)) % 0.32/0.56 (step @p65 :rule cong :premises (@p64) :args ((forall @t4 @t40))) % 0.32/0.56 (step @p66 :rule bool-impl-false1 :args (@t3)) % 0.32/0.56 (step @p67 :rule cong :premises (@p66) :args (@t5)) % 0.32/0.56 (step @p68 :rule trans :premises (@p67 @p65)) % 0.32/0.56 (step @p69 :rule refl :args (tptp.emptysetimpfalse)) % 0.32/0.56 (step @p70 :rule cong :premises (@p69 @p68) :args (@t6)) % 0.32/0.56 (step @p71 :rule eq_resolve :premises (@p1 @p70)) % 0.32/0.56 (step @p72 :rule cong :premises (@p71 @p58) :args (@t41)) % 0.32/0.56 (step @p73 :rule cong :premises (@p72) :args ((not @t41))) % 0.32/0.56 (step @p74 :rule trans :premises (@p73 @p9)) % 0.32/0.56 (step @p75 :rule quant-merge-prenex :args ((= (forall @t16 @t42) @t26))) % 0.32/0.56 (step @p76 :rule beta-reduce :args ((= (_ @t43 @t8) @t42))) % 0.32/0.56 (step @p77 :rule beta-reduce :args ((= @t44 @t43))) % 0.32/0.56 (step @p78 :rule ho_cong :premises (@p77 @p46)) % 0.32/0.56 (step @p79 :rule trans :premises (@p78 @p76)) % 0.32/0.56 (step @p80 :rule cong :premises (@p79) :args (@t45)) % 0.32/0.56 (step @p81 :rule trans :premises (@p80 @p75)) % 0.32/0.56 (step @p82 :rule cong :premises (@p43 @p81) :args (@t46)) % 0.32/0.56 (step @p83 :rule cong :premises (@p69 @p82) :args (@t47)) % 0.32/0.56 (step @p84 :rule cong :premises (@p83) :args ((not @t47))) % 0.32/0.56 (step @p85 :rule refl :args (tptp.emptyset)) % 0.32/0.56 (step @p86 :rule ho_cong :premises (@p48 @p85)) % 0.32/0.56 (step @p87 :rule ho_cong :premises (@p86 @p46)) % 0.32/0.56 (step @p88 :rule cong :premises (@p87) :args (@t17)) % 0.32/0.56 (step @p89 :rule cong :premises (@p43 @p88) :args (@t18)) % 0.32/0.56 (step @p90 :rule cong :premises (@p69 @p89) :args (@t19)) % 0.32/0.56 (step @p91 :rule cong :premises (@p90) :args (@t20)) % 0.32/0.56 (step @p92 :rule trans :premises (@p91 @p84)) % 0.32/0.56 (step @p93 :rule trans :premises (@p92 @p74)) % 0.32/0.56 (step @p94 :rule eq_resolve :premises (@p3 @p93)) % 0.32/0.56 (step @p95 :rule not_implies_elim1 :premises (@p94)) % 0.32/0.56 (step @p96 :rule not_implies_elim2 :premises (@p94)) % 0.32/0.56 (step @p97 :rule skolemize :premises (@p96)) % 0.32/0.56 (step @p98 :rule bool-double-not-elim :args (@t49)) % 0.32/0.56 (step @p99 :rule refl :args (@t51)) % 0.32/0.56 (step @p100 :rule nary_cong :premises (@p99 @p98) :args ((or @t51 (not @t50)))) % 0.32/0.56 (step @p101 :rule cnf_or_neg :args (@t51 0)) % 0.32/0.56 (step @p102 :rule eq_resolve :premises (@p101 @p100)) % 0.32/0.56 (step @p103 :rule reordering :premises (@p102) :args ((or @t49 @t51))) % 0.32/0.56 (step @p104 :rule chain_m_resolution :premises (@p103 @p97) :args (@t49 (@list true) (@list @t51))) % 0.32/0.56 (assume-push @p111 @t27) % 0.32/0.56 (step @p106 :rule instantiate :premises (@p95) :args ((@list @t48))) % 0.32/0.56 (step-pop @p112 :rule scope :premises (@p106)) % 0.32/0.56 (step @p107 :rule process_scope :premises (@p112) :args (@t50)) % 0.32/0.56 (step @p109 :rule implies_elim :premises (@p107)) % 0.32/0.56 (step @p110 false :rule chain_m_resolution :premises (@p109 @p104 @p95) :args (false (@list false false) (@list @t49 @t27))) % 0.32/0.56 ) % 0.32/0.56 % SZS output end Proof % 0.32/0.56 % cvc5 exiting %------------------------------------------------------------------------------