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