%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU089+1 : TPTP v9.2.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n027.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:50:33 AM UTC 2026 % Result : Theorem 0.46s 0.63s % Output : Proof 0.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU089+1 : TPTP v9.2.1. Released v3.2.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.18/0.34 % Computer : n027.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 16:28:21 EDT 2026 % 0.18/0.34 % CPUTime : % 0.31/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.46/0.63 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.46/0.63 % SZS status Theorem % 0.46/0.63 % SZS output start Proof % 0.46/0.63 ( % 0.46/0.63 (declare-sort $$unsorted 0) % 0.46/0.63 (declare-const tptp.transfinite_sequence (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.ordinal_yielding (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.relation_empty_yielding (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.empty_set $$unsorted) % 0.46/0.63 (declare-const tptp.cartesian_product3 (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.46/0.63 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.positive_rationals $$unsorted) % 0.46/0.63 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.natural (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.ordinal (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.epsilon_connected (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.being_limit_ordinal (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.element (-> $$unsorted $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.finite (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.function (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.one_to_one (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.epsilon_transitive (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.relation (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.cartesian_product2 (-> $$unsorted $$unsorted $$unsorted)) % 0.46/0.63 (declare-const tptp.relation_non_empty (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.function_yielding (-> $$unsorted Bool)) % 0.46/0.63 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.46/0.63 (define @t1 () (@var "A" $$unsorted)) % 0.46/0.63 (define @t2 () (@var "B" $$unsorted)) % 0.46/0.63 (define @t3 () (tptp.in @t1 @t2)) % 0.46/0.63 (define @t4 () (@list @t1 @t2)) % 0.46/0.63 (define @t5 () (tptp.ordinal @t2)) % 0.46/0.63 (define @t6 () (tptp.epsilon_connected @t2)) % 0.46/0.63 (define @t7 () (tptp.epsilon_transitive @t2)) % 0.46/0.63 (define @t8 () (tptp.element @t2 @t1)) % 0.46/0.63 (define @t9 () (@list @t2)) % 0.46/0.63 (define @t10 () (tptp.ordinal @t1)) % 0.46/0.63 (define @t11 () (@list @t1)) % 0.46/0.63 (define @t12 () (tptp.finite @t1)) % 0.46/0.63 (define @t13 () (tptp.empty @t1)) % 0.46/0.63 (define @t14 () (tptp.function @t1)) % 0.46/0.63 (define @t15 () (tptp.epsilon_connected @t1)) % 0.46/0.63 (define @t16 () (tptp.epsilon_transitive @t1)) % 0.46/0.63 (define @t17 () (and @t16 @t15)) % 0.46/0.63 (define @t18 () (tptp.relation @t1)) % 0.46/0.63 (define @t19 () (@var "C" $$unsorted)) % 0.46/0.63 (define @t20 () (tptp.cartesian_product2 @t1 @t2)) % 0.46/0.63 (define @t21 () (@list @t1 @t2 @t19)) % 0.46/0.63 (define @t22 () (tptp.natural @t1)) % 0.46/0.63 (define @t23 () (and @t16 @t15 @t10 @t22)) % 0.46/0.63 (define @t24 () (tptp.finite @t2)) % 0.46/0.63 (define @t25 () (tptp.powerset @t1)) % 0.46/0.63 (define @t26 () (tptp.element @t2 @t25)) % 0.46/0.63 (define @t27 () (tptp.one_to_one @t1)) % 0.46/0.63 (define @t28 () (and @t18 @t14 @t27)) % 0.46/0.63 (define @t29 () (and @t18 @t13 @t14)) % 0.46/0.63 (define @t30 () (and @t16 @t15 @t10)) % 0.46/0.63 (define @t31 () (tptp.element @t1 tptp.positive_rationals)) % 0.46/0.63 (define @t32 () (tptp.cartesian_product3 @t1 @t2 @t19)) % 0.46/0.63 (define @t33 () (tptp.relation_empty_yielding tptp.empty_set)) % 0.46/0.63 (define @t34 () (tptp.relation tptp.empty_set)) % 0.46/0.63 (define @t35 () (tptp.empty tptp.empty_set)) % 0.46/0.63 (define @t36 () (tptp.finite @t20)) % 0.46/0.63 (define @t37 () (and @t12 @t24)) % 0.46/0.63 (define @t38 () (forall @t4 (=> @t37 @t36))) % 0.46/0.63 (define @t39 () (tptp.empty @t2)) % 0.46/0.63 (define @t40 () (not @t39)) % 0.46/0.63 (define @t41 () (not @t13)) % 0.46/0.63 (define @t42 () (tptp.empty @t19)) % 0.46/0.63 (define @t43 () (tptp.transfinite_sequence @t1)) % 0.46/0.63 (define @t44 () (tptp.relation_empty_yielding @t1)) % 0.46/0.63 (define @t45 () (tptp.element @t1 @t2)) % 0.46/0.63 (define @t46 () (tptp.finite @t32)) % 0.46/0.63 (define @t47 () (tptp.finite @t19)) % 0.46/0.63 (define @t48 () (and @t12 @t24 @t47)) % 0.46/0.63 (define @t49 () (forall @t21 (=> @t48 @t46))) % 0.46/0.63 (define @t50 () (not @t49)) % 0.46/0.63 (define @t51 () (tptp.element @t2 (tptp.powerset @t19))) % 0.46/0.63 (define @t52 () (not @t24)) % 0.46/0.63 (define @t53 () (not @t12)) % 0.46/0.63 (define @t54 () (not @t47)) % 0.46/0.63 (define @t55 () (or @t53 @t52 @t54 @t46)) % 0.46/0.63 (define @t56 () (forall @t21 @t55)) % 0.46/0.63 (define @t57 () (@quantifiers_skolemize @t56 2)) % 0.46/0.63 (define @t58 () (@quantifiers_skolemize @t56 1)) % 0.46/0.63 (define @t59 () (@quantifiers_skolemize @t56 0)) % 0.46/0.63 (define @t60 () (tptp.cartesian_product2 @t59 @t58)) % 0.46/0.63 (define @t61 () (or @t53 @t52 @t54)) % 0.46/0.63 (define @t62 () (tptp.finite @t58)) % 0.46/0.63 (define @t63 () (tptp.finite (tptp.cartesian_product3 @t59 @t58 @t57))) % 0.46/0.63 (define @t64 () (tptp.finite @t57)) % 0.46/0.63 (define @t65 () (not @t64)) % 0.46/0.63 (define @t66 () (not @t62)) % 0.46/0.63 (define @t67 () (tptp.finite @t59)) % 0.46/0.63 (define @t68 () (not @t67)) % 0.46/0.63 (define @t69 () (or @t68 @t66 @t65 @t63)) % 0.46/0.63 (define @t70 () (@list true)) % 0.46/0.63 (define @t71 () (@list @t69)) % 0.46/0.63 (define @t72 () (tptp.finite @t60)) % 0.46/0.63 (define @t73 () (or @t68 @t66 @t72)) % 0.46/0.63 (define @t74 () (@list false false false)) % 0.46/0.63 (define @t75 () (tptp.finite (tptp.cartesian_product2 @t60 @t57))) % 0.46/0.63 (define @t76 () (not @t72)) % 0.46/0.63 (define @t77 () (or @t76 @t65 @t75)) % 0.46/0.63 (assume @p1 (forall @t4 (=> @t3 (not (tptp.in @t2 @t1))))) % 0.46/0.63 (assume @p2 (forall @t11 (=> @t10 (forall @t9 (=> @t8 (and @t7 @t6 @t5)))))) % 0.46/0.63 (assume @p3 (forall @t11 (=> @t13 @t12))) % 0.46/0.63 (assume @p4 (forall @t11 (=> @t13 @t14))) % 0.46/0.63 (assume @p5 (forall @t11 (=> @t10 @t17))) % 0.46/0.63 (assume @p6 (forall @t11 (=> @t13 @t18))) % 0.46/0.63 (assume @p7 (forall @t21 (=> (tptp.element @t19 (tptp.powerset @t20)) (tptp.relation @t19)))) % 0.46/0.63 (assume @p8 (forall @t11 (=> (and @t13 @t10) @t23))) % 0.46/0.63 (assume @p9 (forall @t11 (=> @t12 (forall @t9 (=> @t26 @t24))))) % 0.46/0.63 (assume @p10 (forall @t11 (=> @t29 @t28))) % 0.46/0.63 (assume @p11 (forall @t11 (=> @t17 @t10))) % 0.46/0.63 (assume @p12 (forall @t11 (=> @t13 @t30))) % 0.46/0.63 (assume @p13 (forall @t11 (=> @t31 (=> @t10 @t23)))) % 0.46/0.63 (assume @p14 (forall @t21 (= @t32 (tptp.cartesian_product2 @t20 @t19)))) % 0.46/0.63 (assume @p15 (forall @t11 (exists @t9 @t8))) % 0.46/0.63 (assume @p16 (and @t35 @t34 @t33)) % 0.46/0.63 (assume @p17 @t38) % 0.46/0.63 (assume @p18 (forall @t11 (not (tptp.empty @t25)))) % 0.46/0.63 (assume @p19 @t35) % 0.46/0.63 (assume @p20 (and @t34 @t33 (tptp.function tptp.empty_set) (tptp.one_to_one tptp.empty_set) @t35 (tptp.epsilon_transitive tptp.empty_set) (tptp.epsilon_connected tptp.empty_set) (tptp.ordinal tptp.empty_set))) % 0.46/0.63 (assume @p21 (and @t35 @t34)) % 0.46/0.63 (assume @p22 (forall @t4 (=> (and @t41 @t40) (not (tptp.empty @t20))))) % 0.46/0.63 (assume @p23 (forall @t21 (=> (and @t41 @t40 (not @t42)) (not (tptp.empty @t32))))) % 0.46/0.63 (assume @p24 (not (tptp.empty tptp.positive_rationals))) % 0.46/0.63 (assume @p25 (exists @t11 (and @t41 @t16 @t15 @t10 @t22))) % 0.46/0.63 (assume @p26 (exists @t11 (and @t41 @t12))) % 0.46/0.63 (assume @p27 (exists @t11 (and @t18 @t14 (tptp.function_yielding @t1)))) % 0.46/0.63 (assume @p28 (exists @t11 (and @t18 @t14))) % 0.46/0.63 (assume @p29 (exists @t11 @t30)) % 0.46/0.63 (assume @p30 (exists @t11 (and @t16 @t15 @t10 (tptp.being_limit_ordinal @t1)))) % 0.46/0.63 (assume @p31 (exists @t11 (and @t13 @t18))) % 0.46/0.63 (assume @p32 (forall @t11 (=> @t41 (exists @t9 (and @t26 @t40))))) % 0.46/0.63 (assume @p33 (exists @t11 @t13)) % 0.46/0.63 (assume @p34 (exists @t11 (and @t31 @t41 @t16 @t15 @t10))) % 0.46/0.63 (assume @p35 (forall @t11 (exists @t9 (and @t26 @t39 (tptp.relation @t2) (tptp.function @t2) (tptp.one_to_one @t2) @t7 @t6 @t5 (tptp.natural @t2) @t24)))) % 0.46/0.63 (assume @p36 (exists @t11 @t29)) % 0.46/0.63 (assume @p37 (exists @t11 (and @t18 @t14 @t27 @t13 @t16 @t15 @t10))) % 0.46/0.63 (assume @p38 (exists @t11 (and @t18 @t14 @t43 (tptp.ordinal_yielding @t1)))) % 0.46/0.63 (assume @p39 (exists @t11 (and @t41 @t18))) % 0.46/0.63 (assume @p40 (forall @t11 (exists @t9 (and @t26 @t39)))) % 0.46/0.63 (assume @p41 (exists @t11 @t41)) % 0.46/0.63 (assume @p42 (exists @t11 (and @t31 @t13 @t16 @t15 @t10 @t22))) % 0.46/0.63 (assume @p43 (forall @t11 (=> @t41 (exists @t9 (and @t26 @t40 @t24))))) % 0.46/0.63 (assume @p44 (exists @t11 @t28)) % 0.46/0.63 (assume @p45 (exists @t11 (and @t41 @t16 @t15 @t10))) % 0.46/0.63 (assume @p46 (exists @t11 (and @t18 @t44))) % 0.46/0.63 (assume @p47 (exists @t11 (and @t18 @t44 @t14))) % 0.46/0.63 (assume @p48 (exists @t11 (and @t18 @t14 @t43))) % 0.46/0.63 (assume @p49 (exists @t11 (and @t18 (tptp.relation_non_empty @t1) @t14))) % 0.46/0.63 (assume @p50 (forall @t4 (tptp.subset @t1 @t1))) % 0.46/0.63 (assume @p51 (forall @t4 (=> @t3 @t45))) % 0.46/0.63 (assume @p52 @t50) % 0.46/0.63 (assume @p53 (forall @t4 (=> @t45 (or @t39 @t3)))) % 0.46/0.63 (assume @p54 (forall @t4 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2)))) % 0.46/0.63 (assume @p55 (forall @t21 (=> (and @t3 @t51) (tptp.element @t1 @t19)))) % 0.46/0.63 (assume @p56 (forall @t21 (not (and @t3 @t51 @t42)))) % 0.46/0.63 (assume @p57 (forall @t11 (=> @t13 (= @t1 tptp.empty_set)))) % 0.46/0.63 (assume @p58 (forall @t4 (not (and @t3 @t39)))) % 0.46/0.63 (assume @p59 (forall @t4 (not (and @t13 (not (= @t1 @t2)) @t39)))) % 0.46/0.63 (assume @p60 true) % 0.46/0.63 (step @p61 :rule evaluate :args ((= false true))) % 0.46/0.63 (step @p62 :rule aci_norm :args ((= (or (or @t53 @t52) @t36) (or @t53 @t52 @t36)))) % 0.46/0.63 (step @p63 :rule refl :args (@t36)) % 0.46/0.63 (step @p64 :rule bool-and-de-morgan :args (@t12 @t24 true)) % 0.46/0.63 (step @p65 :rule nary_cong :premises (@p64 @p63) :args ((or (not @t37) @t36))) % 0.46/0.63 (step @p66 :rule trans :premises (@p65 @p62)) % 0.46/0.63 (step @p67 :rule bool-impl-elim :args (@t37 @t36)) % 0.46/0.63 (step @p68 :rule trans :premises (@p67 @p66)) % 0.46/0.63 (step @p69 :rule cong :premises (@p68) :args (@t38)) % 0.46/0.63 (step @p70 :rule eq_resolve :premises (@p17 @p69)) % 0.46/0.63 (step @p71 :rule instantiate :premises (@p70) :args ((@list @t60 @t57))) % 0.46/0.63 (step @p72 :rule instantiate :premises (@p70) :args ((@list @t59 @t58))) % 0.46/0.63 (step @p73 :rule aci_norm :args ((= (or @t61 @t46) @t55))) % 0.46/0.63 (step @p74 :rule refl :args (@t46)) % 0.46/0.63 (step @p75 :rule aci_norm :args ((= (or @t53 (or @t52 @t54)) @t61))) % 0.46/0.63 (step @p76 :rule bool-and-de-morgan :args (@t24 @t47 true)) % 0.46/0.63 (step @p77 :rule refl :args (@t53)) % 0.46/0.63 (step @p78 :rule nary_cong :premises (@p77 @p76) :args ((or @t53 (not (and @t24 @t47))))) % 0.46/0.63 (step @p79 :rule bool-and-de-morgan :args (@t12 @t24 (and @t47))) % 0.46/0.63 (step @p80 :rule trans :premises (@p79 @p78)) % 0.46/0.63 (step @p81 :rule trans :premises (@p80 @p75)) % 0.46/0.63 (step @p82 :rule nary_cong :premises (@p81 @p74) :args ((or (not @t48) @t46))) % 0.46/0.63 (step @p83 :rule trans :premises (@p82 @p73)) % 0.46/0.63 (step @p84 :rule bool-impl-elim :args (@t48 @t46)) % 0.46/0.63 (step @p85 :rule trans :premises (@p84 @p83)) % 0.46/0.63 (step @p86 :rule cong :premises (@p85) :args (@t49)) % 0.46/0.63 (step @p87 :rule cong :premises (@p86) :args (@t50)) % 0.46/0.63 (step @p88 :rule eq_resolve :premises (@p52 @p87)) % 0.46/0.63 (step @p89 :rule skolemize :premises (@p88)) % 0.46/0.63 (step @p90 :rule bool-double-not-elim :args (@t62)) % 0.46/0.63 (step @p91 :rule refl :args (@t69)) % 0.46/0.63 (step @p92 :rule nary_cong :premises (@p91 @p90) :args ((or @t69 (not @t66)))) % 0.46/0.63 (step @p93 :rule cnf_or_neg :args (@t69 1)) % 0.46/0.63 (step @p94 :rule eq_resolve :premises (@p93 @p92)) % 0.46/0.63 (step @p95 :rule reordering :premises (@p94) :args ((or @t62 @t69))) % 0.46/0.63 (step @p96 :rule chain_m_resolution :premises (@p95 @p89) :args (@t62 @t70 @t71)) % 0.46/0.63 (step @p97 :rule bool-double-not-elim :args (@t67)) % 0.46/0.63 (step @p98 :rule nary_cong :premises (@p91 @p97) :args ((or @t69 (not @t68)))) % 0.46/0.63 (step @p99 :rule cnf_or_neg :args (@t69 0)) % 0.46/0.63 (step @p100 :rule eq_resolve :premises (@p99 @p98)) % 0.46/0.63 (step @p101 :rule reordering :premises (@p100) :args ((or @t67 @t69))) % 0.46/0.63 (step @p102 :rule chain_m_resolution :premises (@p101 @p89) :args (@t67 @t70 @t71)) % 0.46/0.63 (step @p103 :rule cnf_or_pos :args (@t73)) % 0.46/0.63 (step @p104 :rule reordering :premises (@p103) :args ((or @t68 @t66 @t72 (not @t73)))) % 0.46/0.63 (step @p105 :rule chain_m_resolution :premises (@p104 @p102 @p96 @p72) :args (@t72 @t74 (@list @t67 @t62 @t73))) % 0.46/0.63 (step @p106 :rule bool-double-not-elim :args (@t64)) % 0.46/0.63 (step @p107 :rule nary_cong :premises (@p91 @p106) :args ((or @t69 (not @t65)))) % 0.46/0.63 (step @p108 :rule cnf_or_neg :args (@t69 2)) % 0.46/0.63 (step @p109 :rule eq_resolve :premises (@p108 @p107)) % 0.46/0.63 (step @p110 :rule reordering :premises (@p109) :args ((or @t64 @t69))) % 0.46/0.63 (step @p111 :rule chain_m_resolution :premises (@p110 @p89) :args (@t64 @t70 @t71)) % 0.46/0.63 (step @p112 :rule cnf_or_pos :args (@t77)) % 0.46/0.63 (step @p113 :rule reordering :premises (@p112) :args ((or @t65 @t76 @t75 (not @t77)))) % 0.46/0.63 (step @p114 :rule chain_m_resolution :premises (@p113 @p111 @p105 @p71) :args (@t75 @t74 (@list @t64 @t72 @t77))) % 0.46/0.63 (step @p115 :rule true_intro :premises (@p114)) % 0.46/0.63 (step @p116 :rule instantiate :premises (@p14) :args ((@list @t59 @t58 @t57))) % 0.46/0.63 (step @p117 :rule cong :premises (@p116) :args (@t63)) % 0.46/0.63 (step @p118 :rule cnf_or_neg :args (@t69 3)) % 0.46/0.63 (step @p119 :rule chain_m_resolution :premises (@p118 @p89) :args ((not @t63) @t70 @t71)) % 0.46/0.63 (step @p120 :rule false_intro :premises (@p119)) % 0.46/0.63 (step @p121 :rule symm :premises (@p120)) % 0.46/0.63 (step @p122 :rule trans :premises (@p121 @p117 @p115)) % 0.46/0.63 (step @p123 false :rule eq_resolve :premises (@p122 @p61)) % 0.46/0.63 ) % 0.46/0.63 % SZS output end Proof % 0.46/0.63 % cvc5 exiting %------------------------------------------------------------------------------