%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU568^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 : n017.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:14 AM UTC 2026 % Result : Theorem 0.27s 0.56s % Output : Proof 0.27s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SEU568^2 : TPTP v9.2.1. Released v3.7.0. % 0.12/0.14 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.35 % Computer : n017.cluster.edu % 0.16/0.35 % Model : x86_64 x86_64 % 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.35 % Memory : 8042.1875MB % 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.35 % CPULimit : 300 % 0.16/0.35 % WCLimit : 300 % 0.16/0.35 % DateTime : Tue Jun 2 17:40:31 EDT 2026 % 0.16/0.35 % CPUTime : % 0.27/0.50 %----Proving TH0 % 0.27/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.27/0.56 % SZS status Theorem % 0.27/0.56 % SZS output start Proof % 0.27/0.56 ( % 0.27/0.56 (declare-sort $$unsorted 0) % 0.27/0.56 (declare-const tptp.notsubsetI Bool) % 0.27/0.56 (declare-const tptp.notequalI1 Bool) % 0.27/0.56 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.27/0.56 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.27/0.56 (define @t1 () (@var "B" $$unsorted)) % 0.27/0.56 (define @t2 () (@var "A" $$unsorted)) % 0.27/0.56 (define @t3 () (not (_ (_ tptp.subset @t2) @t1))) % 0.27/0.56 (define @t4 () (@var "Xx" $$unsorted)) % 0.27/0.56 (define @t5 () (_ tptp.in @t4)) % 0.27/0.56 (define @t6 () (_ @t5 @t1)) % 0.27/0.56 (define @t7 () (not @t6)) % 0.27/0.56 (define @t8 () (_ @t5 @t2)) % 0.27/0.56 (define @t9 () (@list @t2 @t1 @t4)) % 0.27/0.56 (define @t10 () (not (= @t2 @t1))) % 0.27/0.56 (define @t11 () (=> @t7 @t10)) % 0.27/0.56 (define @t12 () (forall @t9 (=> @t8 @t11))) % 0.27/0.56 (define @t13 () (=> tptp.notequalI1 @t12)) % 0.27/0.56 (define @t14 () (=> tptp.notsubsetI @t13)) % 0.27/0.56 (define @t15 () (not @t14)) % 0.27/0.56 (define @t16 () (@list @t1 @t4)) % 0.27/0.56 (define @t17 () (tptp.in @t4 @t1)) % 0.27/0.56 (define @t18 () (not @t17)) % 0.27/0.56 (define @t19 () (or @t18 @t17)) % 0.27/0.56 (define @t20 () (not (= @t1 @t1))) % 0.27/0.56 (define @t21 () (or @t18 @t17 @t20)) % 0.27/0.56 (define @t22 () (tptp.in @t4 @t2)) % 0.27/0.56 (define @t23 () (not @t22)) % 0.27/0.56 (define @t24 () (or @t10 @t23 @t17 @t10)) % 0.27/0.56 (define @t25 () (@list @t2)) % 0.27/0.56 (define @t26 () (or @t23 @t17 @t10)) % 0.27/0.56 (define @t27 () (forall @t25 @t26)) % 0.27/0.56 (define @t28 () (forall @t16 @t27)) % 0.27/0.56 (define @t29 () (forall (@list @t1 @t4 @t2) @t26)) % 0.27/0.56 (define @t30 () (not @t8)) % 0.27/0.56 (define @t31 () (or @t30 @t6 @t10)) % 0.27/0.56 (assume @p1 (= tptp.notsubsetI (forall @t9 (=> @t8 (=> @t7 @t3))))) % 0.27/0.56 (assume @p2 (= tptp.notequalI1 (forall (@list @t2 @t1) (=> @t3 @t10)))) % 0.27/0.56 (assume @p3 @t15) % 0.27/0.56 (assume @p4 true) % 0.27/0.56 (step @p5 :rule evaluate :args ((not true))) % 0.27/0.56 (step @p6 :rule bool-impl-true1 :args (tptp.notsubsetI)) % 0.27/0.56 (step @p7 :rule bool-impl-true1 :args (tptp.notequalI1)) % 0.27/0.56 (step @p8 :rule quant-unused-vars :args ((= (forall @t16 true) true))) % 0.27/0.56 (step @p9 :rule bool-or-taut2 :args (false @t17 false false)) % 0.27/0.56 (step @p10 :rule cong :premises (@p9) :args ((forall @t16 @t19))) % 0.27/0.56 (step @p11 :rule trans :premises (@p10 @p8)) % 0.27/0.56 (step @p12 :rule aci_norm :args ((= (or @t18 @t17 false) @t19))) % 0.27/0.56 (step @p13 :rule eq-refl :args (@t1)) % 0.27/0.56 (step @p14 :rule cong :premises (@p13) :args (@t20)) % 0.27/0.56 (step @p15 :rule trans :premises (@p14 @p5)) % 0.27/0.56 (step @p16 :rule refl :args (@t17)) % 0.27/0.56 (step @p17 :rule refl :args (@t18)) % 0.27/0.56 (step @p18 :rule nary_cong :premises (@p17 @p16 @p15) :args (@t21)) % 0.27/0.56 (step @p19 :rule trans :premises (@p18 @p12)) % 0.27/0.56 (step @p20 :rule cong :premises (@p19) :args ((forall @t16 @t21))) % 0.27/0.56 (step @p21 :rule trans :premises (@p20 @p11)) % 0.27/0.56 (step @p22 :rule quant-var-elim-eq :args ((= (forall @t25 @t24) @t21))) % 0.27/0.56 (step @p23 :rule aci_norm :args ((= @t26 @t24))) % 0.27/0.56 (step @p24 :rule cong :premises (@p23) :args (@t27)) % 0.27/0.56 (step @p25 :rule trans :premises (@p24 @p22)) % 0.27/0.56 (step @p26 :rule cong :premises (@p25) :args (@t28)) % 0.27/0.56 (step @p27 :rule quant-merge-prenex :args ((= @t28 @t29))) % 0.27/0.56 (step @p28 :rule symm :premises (@p27)) % 0.27/0.56 (step @p29 :rule quant_var_reordering :args ((= (forall @t9 @t26) @t29))) % 0.27/0.56 (step @p30 :rule trans :premises (@p29 @p28 @p26)) % 0.27/0.56 (step @p31 :rule trans :premises (@p30 @p21)) % 0.27/0.56 (step @p32 :rule refl :args (@t10)) % 0.27/0.56 (step @p33 :rule refl :args (@t17)) % 0.27/0.56 (step @p34 :rule refl :args (@t6)) % 0.27/0.56 (step @p35 :rule cong :premises (@p34 @p33) :args ((= @t6 @t17))) % 0.27/0.56 (step @p36 :rule symm :premises (@p35)) % 0.27/0.56 (step @p37 :rule eq_resolve :premises (@p34 @p36)) % 0.27/0.56 (step @p38 :rule refl :args (@t22)) % 0.27/0.56 (step @p39 :rule refl :args (@t8)) % 0.27/0.56 (step @p40 :rule cong :premises (@p39 @p38) :args ((= @t8 @t22))) % 0.27/0.56 (step @p41 :rule symm :premises (@p40)) % 0.27/0.56 (step @p42 :rule eq_resolve :premises (@p39 @p41)) % 0.27/0.56 (step @p43 :rule cong :premises (@p42) :args (@t30)) % 0.27/0.56 (step @p44 :rule nary_cong :premises (@p43 @p37 @p32) :args (@t31)) % 0.27/0.56 (step @p45 :rule cong :premises (@p44) :args ((forall @t9 @t31))) % 0.27/0.56 (step @p46 :rule trans :premises (@p45 @p31)) % 0.27/0.56 (step @p47 :rule aci_norm :args ((= (or @t30 (or @t6 @t10)) @t31))) % 0.27/0.56 (step @p48 :rule bool-double-not-elim :args (@t6)) % 0.27/0.56 (step @p49 :rule nary_cong :premises (@p48 @p32) :args ((or (not @t7) @t10))) % 0.27/0.56 (step @p50 :rule bool-impl-elim :args (@t7 @t10)) % 0.27/0.56 (step @p51 :rule trans :premises (@p50 @p49)) % 0.27/0.56 (step @p52 :rule refl :args (@t30)) % 0.27/0.56 (step @p53 :rule nary_cong :premises (@p52 @p51) :args ((or @t30 @t11))) % 0.27/0.56 (step @p54 :rule trans :premises (@p53 @p47)) % 0.27/0.56 (step @p55 :rule bool-impl-elim :args (@t8 @t11)) % 0.27/0.56 (step @p56 :rule trans :premises (@p55 @p54)) % 0.27/0.56 (step @p57 :rule cong :premises (@p56) :args (@t12)) % 0.27/0.56 (step @p58 :rule trans :premises (@p57 @p46)) % 0.27/0.56 (step @p59 :rule refl :args (tptp.notequalI1)) % 0.27/0.56 (step @p60 :rule cong :premises (@p59 @p58) :args (@t13)) % 0.27/0.56 (step @p61 :rule trans :premises (@p60 @p7)) % 0.27/0.56 (step @p62 :rule refl :args (tptp.notsubsetI)) % 0.27/0.56 (step @p63 :rule cong :premises (@p62 @p61) :args (@t14)) % 0.27/0.56 (step @p64 :rule trans :premises (@p63 @p6)) % 0.27/0.56 (step @p65 :rule cong :premises (@p64) :args (@t15)) % 0.27/0.56 (step @p66 :rule trans :premises (@p65 @p5)) % 0.27/0.56 (step @p67 false :rule eq_resolve :premises (@p3 @p66)) % 0.27/0.56 ) % 0.27/0.56 % SZS output end Proof % 0.27/0.56 % cvc5 exiting %------------------------------------------------------------------------------