%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU561^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 : 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:12 AM UTC 2026 % Result : Theorem 0.33s 0.56s % Output : Proof 0.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU561^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.18/0.35 % Computer : n002.cluster.edu % 0.18/0.35 % Model : x86_64 x86_64 % 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.35 % Memory : 8042.1875MB % 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.35 % CPULimit : 300 % 0.18/0.35 % WCLimit : 300 % 0.18/0.35 % DateTime : Tue Jun 2 17:42:03 EDT 2026 % 0.18/0.35 % CPUTime : % 0.33/0.50 %----Proving TH0 % 0.33/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.33/0.56 % SZS status Theorem % 0.33/0.56 % SZS output start Proof % 0.33/0.56 ( % 0.33/0.56 (declare-sort $$unsorted 0) % 0.33/0.56 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.33/0.56 (declare-const tptp.subsetI1 Bool) % 0.33/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.33/0.56 (define @t1 () (@var "B" $$unsorted)) % 0.33/0.56 (define @t2 () (@var "A" $$unsorted)) % 0.33/0.56 (define @t3 () (_ (_ tptp.subset @t2) @t1)) % 0.33/0.56 (define @t4 () (@var "Xx" $$unsorted)) % 0.33/0.56 (define @t5 () (_ tptp.in @t4)) % 0.33/0.56 (define @t6 () (_ @t5 @t1)) % 0.33/0.56 (define @t7 () (_ @t5 @t2)) % 0.33/0.56 (define @t8 () (@list @t4)) % 0.33/0.56 (define @t9 () (forall @t8 (=> @t7 @t6))) % 0.33/0.56 (define @t10 () (@list @t2 @t1)) % 0.33/0.56 (define @t11 () (= @t2 @t1)) % 0.33/0.56 (define @t12 () (=> @t11 @t3)) % 0.33/0.56 (define @t13 () (forall @t10 @t12)) % 0.33/0.56 (define @t14 () (=> tptp.subsetI1 @t13)) % 0.33/0.56 (define @t15 () (not @t14)) % 0.33/0.56 (define @t16 () (lambda @t10 @t9)) % 0.33/0.56 (define @t17 () (@var "BOUND_VARIABLE_7474" $$unsorted)) % 0.33/0.56 (define @t18 () (@list @t1 @t17)) % 0.33/0.56 (define @t19 () (tptp.in @t17 @t1)) % 0.33/0.56 (define @t20 () (not @t19)) % 0.33/0.56 (define @t21 () (or @t20 @t19)) % 0.33/0.56 (define @t22 () (not (= @t1 @t1))) % 0.33/0.56 (define @t23 () (or @t22 @t20 @t19)) % 0.33/0.56 (define @t24 () (not (tptp.in @t17 @t2))) % 0.33/0.56 (define @t25 () (not @t11)) % 0.33/0.56 (define @t26 () (or @t25 @t25 @t24 @t19)) % 0.33/0.56 (define @t27 () (@list @t2)) % 0.33/0.56 (define @t28 () (or @t25 @t24 @t19)) % 0.33/0.56 (define @t29 () (forall @t27 @t28)) % 0.33/0.56 (define @t30 () (forall @t18 @t29)) % 0.33/0.56 (define @t31 () (forall (@list @t1 @t17 @t2) @t28)) % 0.33/0.56 (define @t32 () (@list @t2 @t1 @t17)) % 0.33/0.56 (define @t33 () (or @t24 @t19)) % 0.33/0.56 (define @t34 () (or @t25 @t33)) % 0.33/0.56 (define @t35 () (forall @t32 @t34)) % 0.33/0.56 (define @t36 () (@list @t17)) % 0.33/0.56 (define @t37 () (forall @t36 @t34)) % 0.33/0.56 (define @t38 () (forall @t36 @t33)) % 0.33/0.56 (define @t39 () (or @t25 @t38)) % 0.33/0.56 (define @t40 () (tptp.in @t4 @t1)) % 0.33/0.56 (define @t41 () (tptp.in @t4 @t2)) % 0.33/0.56 (define @t42 () (forall @t8 (or (not @t41) @t40))) % 0.33/0.56 (define @t43 () (lambda (@list @t1) @t42)) % 0.33/0.56 (define @t44 () (_ (lambda @t10 @t42) @t2)) % 0.33/0.56 (define @t45 () (=> @t11 (_ @t44 @t1))) % 0.33/0.56 (define @t46 () (forall @t10 @t45)) % 0.33/0.56 (define @t47 () (=> tptp.subsetI1 @t46)) % 0.33/0.56 (define @t48 () (not @t7)) % 0.33/0.56 (define @t49 () (or @t48 @t6)) % 0.33/0.56 (assume @p1 (= tptp.subsetI1 (forall @t10 (=> @t9 @t3)))) % 0.33/0.56 (assume @p2 @t15) % 0.33/0.56 (assume @p3 true) % 0.33/0.56 (step @p4 (= tptp.subset @t16) :rule refl :args (@t16)) % 0.33/0.56 (step @p5 :rule evaluate :args ((not true))) % 0.33/0.56 (step @p6 :rule bool-impl-true1 :args (tptp.subsetI1)) % 0.33/0.56 (step @p7 :rule quant-unused-vars :args ((= (forall @t18 true) true))) % 0.33/0.56 (step @p8 :rule bool-or-taut2 :args (false @t19 false false)) % 0.33/0.56 (step @p9 :rule cong :premises (@p8) :args ((forall @t18 @t21))) % 0.33/0.56 (step @p10 :rule trans :premises (@p9 @p7)) % 0.33/0.56 (step @p11 :rule aci_norm :args ((= (or false @t20 @t19) @t21))) % 0.33/0.56 (step @p12 :rule refl :args (@t19)) % 0.33/0.56 (step @p13 :rule refl :args (@t20)) % 0.33/0.56 (step @p14 :rule eq-refl :args (@t1)) % 0.33/0.56 (step @p15 :rule cong :premises (@p14) :args (@t22)) % 0.33/0.56 (step @p16 :rule trans :premises (@p15 @p5)) % 0.33/0.56 (step @p17 :rule nary_cong :premises (@p16 @p13 @p12) :args (@t23)) % 0.33/0.56 (step @p18 :rule trans :premises (@p17 @p11)) % 0.33/0.56 (step @p19 :rule cong :premises (@p18) :args ((forall @t18 @t23))) % 0.33/0.56 (step @p20 :rule trans :premises (@p19 @p10)) % 0.33/0.56 (step @p21 :rule quant-var-elim-eq :args ((= (forall @t27 @t26) @t23))) % 0.33/0.56 (step @p22 :rule aci_norm :args ((= @t28 @t26))) % 0.33/0.56 (step @p23 :rule cong :premises (@p22) :args (@t29)) % 0.33/0.56 (step @p24 :rule trans :premises (@p23 @p21)) % 0.33/0.56 (step @p25 :rule cong :premises (@p24) :args (@t30)) % 0.33/0.56 (step @p26 :rule quant-merge-prenex :args ((= @t30 @t31))) % 0.33/0.56 (step @p27 :rule symm :premises (@p26)) % 0.33/0.56 (step @p28 :rule quant_var_reordering :args ((= (forall @t32 @t28) @t31))) % 0.33/0.56 (step @p29 :rule trans :premises (@p28 @p27 @p25)) % 0.33/0.56 (step @p30 :rule trans :premises (@p29 @p20)) % 0.33/0.56 (step @p31 :rule aci_norm :args ((= @t34 @t28))) % 0.33/0.56 (step @p32 :rule cong :premises (@p31) :args (@t35)) % 0.33/0.56 (step @p33 :rule trans :premises (@p32 @p30)) % 0.33/0.56 (step @p34 :rule quant-merge-prenex :args ((= (forall @t10 @t37) @t35))) % 0.33/0.56 (step @p35 :rule alpha_equiv :args (@t38 (@list @t17) (@list @t4))) % 0.33/0.56 (step @p36 :rule refl :args (@t25)) % 0.33/0.56 (step @p37 :rule nary_cong :premises (@p36 @p35) :args (@t39)) % 0.33/0.56 (step @p38 :rule quant-miniscope-or :args ((= @t37 @t39))) % 0.33/0.56 (step @p39 :rule trans :premises (@p38 @p37)) % 0.33/0.56 (step @p40 :rule symm :premises (@p39)) % 0.33/0.56 (step @p41 :rule cong :premises (@p40) :args ((forall @t10 (or @t25 @t42)))) % 0.33/0.56 (step @p42 :rule trans :premises (@p41 @p34)) % 0.33/0.56 (step @p43 :rule trans :premises (@p42 @p33)) % 0.33/0.56 (step @p44 :rule bool-impl-elim :args (@t11 @t42)) % 0.33/0.56 (step @p45 :rule cong :premises (@p44) :args ((forall @t10 (=> @t11 @t42)))) % 0.33/0.56 (step @p46 :rule trans :premises (@p45 @p43)) % 0.33/0.56 (step @p47 :rule beta-reduce :args ((= (_ @t43 @t1) @t42))) % 0.33/0.56 (step @p48 :rule refl :args (@t1)) % 0.33/0.56 (step @p49 :rule beta-reduce :args ((= @t44 @t43))) % 0.33/0.56 (step @p50 :rule ho_cong :premises (@p49 @p48)) % 0.33/0.56 (step @p51 :rule trans :premises (@p50 @p47)) % 0.33/0.56 (step @p52 :rule refl :args (@t11)) % 0.33/0.56 (step @p53 :rule cong :premises (@p52 @p51) :args (@t45)) % 0.33/0.56 (step @p54 :rule cong :premises (@p53) :args (@t46)) % 0.33/0.56 (step @p55 :rule trans :premises (@p54 @p46)) % 0.33/0.56 (step @p56 :rule refl :args (tptp.subsetI1)) % 0.33/0.56 (step @p57 :rule cong :premises (@p56 @p55) :args (@t47)) % 0.33/0.56 (step @p58 :rule trans :premises (@p57 @p6)) % 0.33/0.56 (step @p59 :rule cong :premises (@p58) :args ((not @t47))) % 0.33/0.56 (step @p60 :rule trans :premises (@p59 @p5)) % 0.33/0.56 (step @p61 :rule refl :args (@t2)) % 0.33/0.56 (step @p62 :rule refl :args (@t40)) % 0.33/0.56 (step @p63 :rule refl :args (@t6)) % 0.33/0.56 (step @p64 :rule cong :premises (@p63 @p62) :args ((= @t6 @t40))) % 0.33/0.56 (step @p65 :rule symm :premises (@p64)) % 0.33/0.56 (step @p66 :rule eq_resolve :premises (@p63 @p65)) % 0.33/0.56 (step @p67 :rule refl :args (@t41)) % 0.33/0.56 (step @p68 :rule refl :args (@t7)) % 0.33/0.56 (step @p69 :rule cong :premises (@p68 @p67) :args ((= @t7 @t41))) % 0.33/0.56 (step @p70 :rule symm :premises (@p69)) % 0.33/0.56 (step @p71 :rule eq_resolve :premises (@p68 @p70)) % 0.33/0.56 (step @p72 :rule cong :premises (@p71) :args (@t48)) % 0.33/0.56 (step @p73 :rule nary_cong :premises (@p72 @p66) :args (@t49)) % 0.33/0.56 (step @p74 :rule cong :premises (@p73) :args ((forall @t8 @t49))) % 0.33/0.56 (step @p75 :rule bool-impl-elim :args (@t7 @t6)) % 0.33/0.56 (step @p76 :rule cong :premises (@p75) :args (@t9)) % 0.33/0.56 (step @p77 :rule trans :premises (@p76 @p74)) % 0.33/0.56 (step @p78 :rule cong :premises (@p77) :args (@t16)) % 0.33/0.56 (step @p79 :rule trans :premises (@p4 @p78)) % 0.33/0.56 (step @p80 :rule ho_cong :premises (@p79 @p61)) % 0.33/0.56 (step @p81 :rule ho_cong :premises (@p80 @p48)) % 0.33/0.56 (step @p82 :rule cong :premises (@p52 @p81) :args (@t12)) % 0.33/0.56 (step @p83 :rule cong :premises (@p82) :args (@t13)) % 0.33/0.56 (step @p84 :rule cong :premises (@p56 @p83) :args (@t14)) % 0.33/0.56 (step @p85 :rule cong :premises (@p84) :args (@t15)) % 0.33/0.56 (step @p86 :rule trans :premises (@p85 @p60)) % 0.33/0.56 (step @p87 false :rule eq_resolve :premises (@p2 @p86)) % 0.33/0.56 ) % 0.33/0.56 % SZS output end Proof % 0.33/0.56 % cvc5 exiting %------------------------------------------------------------------------------