%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU139+2 : TPTP v9.2.1. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n011.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:41 AM UTC 2026 % Result : Theorem 0.40s 0.60s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU139+2 : TPTP v9.2.1. Released v3.3.0. % 0.12/0.14 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n011.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue Jun 2 16:31:35 EDT 2026 % 0.17/0.35 % CPUTime : % 0.32/0.52 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.60 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.60 % SZS status Theorem % 0.40/0.60 % SZS output start Proof % 0.40/0.60 ( % 0.40/0.60 (declare-sort $$unsorted 0) % 0.40/0.60 (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool)) % 0.40/0.60 (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.60 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.40/0.60 (declare-const tptp.empty_set $$unsorted) % 0.40/0.60 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.60 (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.60 (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.60 (declare-const tptp.proper_subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.60 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.40/0.60 (define @t1 () (@var "A" $$unsorted)) % 0.40/0.60 (define @t2 () (@var "B" $$unsorted)) % 0.40/0.60 (define @t3 () (not (tptp.in @t2 @t1))) % 0.40/0.60 (define @t4 () (tptp.in @t1 @t2)) % 0.40/0.60 (define @t5 () (@list @t1 @t2)) % 0.40/0.60 (define @t6 () (tptp.proper_subset @t2 @t1)) % 0.40/0.60 (define @t7 () (not @t6)) % 0.40/0.60 (define @t8 () (tptp.proper_subset @t1 @t2)) % 0.40/0.60 (define @t9 () (forall @t5 (=> @t8 @t7))) % 0.40/0.60 (define @t10 () (tptp.set_union2 @t2 @t1)) % 0.40/0.60 (define @t11 () (tptp.set_union2 @t1 @t2)) % 0.40/0.60 (define @t12 () (tptp.set_intersection2 @t1 @t2)) % 0.40/0.60 (define @t13 () (tptp.subset @t1 @t2)) % 0.40/0.60 (define @t14 () (= @t1 @t2)) % 0.40/0.60 (define @t15 () (= @t1 tptp.empty_set)) % 0.40/0.60 (define @t16 () (@list @t1)) % 0.40/0.60 (define @t17 () (@var "D" $$unsorted)) % 0.40/0.60 (define @t18 () (tptp.in @t17 @t2)) % 0.40/0.60 (define @t19 () (tptp.in @t17 @t1)) % 0.40/0.60 (define @t20 () (@var "C" $$unsorted)) % 0.40/0.60 (define @t21 () (tptp.in @t17 @t20)) % 0.40/0.60 (define @t22 () (@list @t17)) % 0.40/0.60 (define @t23 () (@list @t1 @t2 @t20)) % 0.40/0.60 (define @t24 () (tptp.in @t20 @t2)) % 0.40/0.60 (define @t25 () (tptp.in @t20 @t1)) % 0.40/0.60 (define @t26 () (@list @t20)) % 0.40/0.60 (define @t27 () (tptp.set_difference @t1 @t2)) % 0.40/0.60 (define @t28 () (tptp.disjoint @t1 @t2)) % 0.40/0.60 (define @t29 () (not @t14)) % 0.40/0.60 (define @t30 () (forall @t5 (= @t8 (and @t13 @t29)))) % 0.40/0.60 (define @t31 () (tptp.empty @t1)) % 0.40/0.60 (define @t32 () (not @t31)) % 0.40/0.60 (define @t33 () (tptp.set_intersection2 @t2 @t20)) % 0.40/0.60 (define @t34 () (tptp.subset @t1 @t20)) % 0.40/0.60 (define @t35 () (tptp.set_union2 @t1 (tptp.set_difference @t2 @t1))) % 0.40/0.60 (define @t36 () (and @t25 @t24)) % 0.40/0.60 (define @t37 () (not @t28)) % 0.40/0.60 (define @t38 () (tptp.in @t20 @t12)) % 0.40/0.60 (define @t39 () (forall @t5 (not (and @t13 @t6)))) % 0.40/0.60 (define @t40 () (not @t39)) % 0.40/0.60 (define @t41 () (tptp.empty @t2)) % 0.40/0.60 (define @t42 () (forall @t5 (or (not @t13) @t7))) % 0.40/0.60 (define @t43 () (@quantifiers_skolemize @t42 1)) % 0.40/0.60 (define @t44 () (@quantifiers_skolemize @t42 0)) % 0.40/0.60 (define @t45 () (tptp.subset @t44 @t43)) % 0.40/0.60 (define @t46 () (tptp.proper_subset @t43 @t44)) % 0.40/0.60 (define @t47 () (not @t46)) % 0.40/0.60 (define @t48 () (not @t45)) % 0.40/0.60 (define @t49 () (or @t48 @t47)) % 0.40/0.60 (define @t50 () (@list true)) % 0.40/0.60 (define @t51 () (@list @t49)) % 0.40/0.60 (define @t52 () (@list @t43 @t44)) % 0.40/0.60 (define @t53 () (tptp.proper_subset @t44 @t43)) % 0.40/0.60 (define @t54 () (not @t53)) % 0.40/0.60 (define @t55 () (or @t47 @t54)) % 0.40/0.60 (define @t56 () (@list false false)) % 0.40/0.60 (define @t57 () (= @t44 @t43)) % 0.40/0.60 (define @t58 () (not @t57)) % 0.40/0.60 (define @t59 () (and @t45 @t58)) % 0.40/0.60 (define @t60 () (= @t53 @t59)) % 0.40/0.60 (define @t61 () (not @t59)) % 0.40/0.60 (define @t62 () (not (= @t43 @t44))) % 0.40/0.60 (define @t63 () (tptp.subset @t43 @t44)) % 0.40/0.60 (define @t64 () (and @t63 @t62)) % 0.40/0.60 (define @t65 () (= @t46 @t64)) % 0.40/0.60 (define @t66 () (and @t63 @t58)) % 0.40/0.60 (define @t67 () (= @t46 @t66)) % 0.40/0.60 (define @t68 () (@list false)) % 0.40/0.60 (assume @p1 (forall @t5 (=> @t4 @t3))) % 0.40/0.60 (assume @p2 @t9) % 0.40/0.60 (assume @p3 (forall @t5 (= @t11 @t10))) % 0.40/0.60 (assume @p4 (forall @t5 (= @t12 (tptp.set_intersection2 @t2 @t1)))) % 0.40/0.60 (assume @p5 (forall @t5 (= @t14 (and @t13 (tptp.subset @t2 @t1))))) % 0.40/0.60 (assume @p6 (forall @t16 (= @t15 (forall (@list @t2) @t3)))) % 0.40/0.60 (assume @p7 (forall @t23 (= (= @t20 @t11) (forall @t22 (= @t21 (or @t19 @t18)))))) % 0.40/0.60 (assume @p8 (forall @t5 (= @t13 (forall @t26 (=> @t25 @t24))))) % 0.40/0.60 (assume @p9 (forall @t23 (= (= @t20 @t12) (forall @t22 (= @t21 (and @t19 @t18)))))) % 0.40/0.60 (assume @p10 (forall @t23 (= (= @t20 @t27) (forall @t22 (= @t21 (and @t19 (not @t18))))))) % 0.40/0.60 (assume @p11 (forall @t5 (= @t28 (= @t12 tptp.empty_set)))) % 0.40/0.60 (assume @p12 @t30) % 0.40/0.60 (assume @p13 true) % 0.40/0.60 (assume @p14 (tptp.empty tptp.empty_set)) % 0.40/0.60 (assume @p15 (forall @t5 (=> @t32 (not (tptp.empty @t11))))) % 0.40/0.60 (assume @p16 (forall @t5 (=> @t32 (not (tptp.empty @t10))))) % 0.40/0.60 (assume @p17 (forall @t5 (= (tptp.set_union2 @t1 @t1) @t1))) % 0.40/0.60 (assume @p18 (forall @t5 (= (tptp.set_intersection2 @t1 @t1) @t1))) % 0.40/0.60 (assume @p19 (forall @t5 (not (tptp.proper_subset @t1 @t1)))) % 0.40/0.60 (assume @p20 (forall @t5 (= (= @t27 tptp.empty_set) @t13))) % 0.40/0.60 (assume @p21 (exists @t16 @t31)) % 0.40/0.60 (assume @p22 (exists @t16 @t32)) % 0.40/0.60 (assume @p23 (forall @t5 (tptp.subset @t1 @t1))) % 0.40/0.60 (assume @p24 (forall @t5 (=> @t28 (tptp.disjoint @t2 @t1)))) % 0.40/0.60 (assume @p25 (forall @t5 (=> @t13 (= @t11 @t2)))) % 0.40/0.60 (assume @p26 (forall @t5 (tptp.subset @t12 @t1))) % 0.40/0.60 (assume @p27 (forall @t23 (=> (and @t13 @t34) (tptp.subset @t1 @t33)))) % 0.40/0.60 (assume @p28 (forall @t16 (= (tptp.set_union2 @t1 tptp.empty_set) @t1))) % 0.40/0.60 (assume @p29 (forall @t23 (=> (and @t13 (tptp.subset @t2 @t20)) @t34))) % 0.40/0.60 (assume @p30 (forall @t23 (=> @t13 (tptp.subset (tptp.set_intersection2 @t1 @t20) @t33)))) % 0.40/0.60 (assume @p31 (forall @t5 (=> @t13 (= @t12 @t1)))) % 0.40/0.60 (assume @p32 (forall @t16 (= (tptp.set_intersection2 @t1 tptp.empty_set) tptp.empty_set))) % 0.40/0.60 (assume @p33 (forall @t5 (=> (forall @t26 (= @t25 @t24)) @t14))) % 0.40/0.60 (assume @p34 (forall @t16 (tptp.subset tptp.empty_set @t1))) % 0.40/0.60 (assume @p35 (forall @t23 (=> @t13 (tptp.subset (tptp.set_difference @t1 @t20) (tptp.set_difference @t2 @t20))))) % 0.40/0.60 (assume @p36 (forall @t5 (tptp.subset @t27 @t1))) % 0.40/0.60 (assume @p37 (forall @t5 (= @t35 @t11))) % 0.40/0.60 (assume @p38 (forall @t16 (= (tptp.set_difference @t1 tptp.empty_set) @t1))) % 0.40/0.60 (assume @p39 (forall @t5 (and (not (and @t37 (forall @t26 (not @t36)))) (not (and (exists @t26 @t36) @t28))))) % 0.40/0.60 (assume @p40 (forall @t16 (=> (tptp.subset @t1 tptp.empty_set) @t15))) % 0.40/0.60 (assume @p41 (forall @t5 (= (tptp.set_difference @t11 @t2) @t27))) % 0.40/0.60 (assume @p42 (forall @t5 (=> @t13 (= @t2 @t35)))) % 0.40/0.60 (assume @p43 (forall @t5 (= (tptp.set_difference @t1 @t27) @t12))) % 0.40/0.60 (assume @p44 (forall @t16 (= (tptp.set_difference tptp.empty_set @t1) tptp.empty_set))) % 0.40/0.60 (assume @p45 (forall @t5 (and (not (and @t37 (forall @t26 (not @t38)))) (not (and (exists @t26 @t38) @t28))))) % 0.40/0.60 (assume @p46 @t40) % 0.40/0.60 (assume @p47 (forall @t16 (=> @t31 @t15))) % 0.40/0.60 (assume @p48 (forall @t5 (not (and @t4 @t41)))) % 0.40/0.60 (assume @p49 (forall @t5 (tptp.subset @t1 @t11))) % 0.40/0.60 (assume @p50 (forall @t5 (not (and @t31 @t29 @t41)))) % 0.40/0.60 (assume @p51 (forall @t23 (=> (and @t13 (tptp.subset @t20 @t2)) (tptp.subset (tptp.set_union2 @t1 @t20) @t2)))) % 0.40/0.60 (step @p52 :rule bool-and-de-morgan :args (@t13 @t6 true)) % 0.40/0.60 (step @p53 :rule cong :premises (@p52) :args (@t39)) % 0.40/0.60 (step @p54 :rule cong :premises (@p53) :args (@t40)) % 0.40/0.60 (step @p55 :rule eq_resolve :premises (@p46 @p54)) % 0.40/0.60 (step @p56 :rule skolemize :premises (@p55)) % 0.40/0.60 (step @p57 :rule bool-double-not-elim :args (@t45)) % 0.40/0.60 (step @p58 :rule refl :args (@t49)) % 0.40/0.60 (step @p59 :rule nary_cong :premises (@p58 @p57) :args ((or @t49 (not @t48)))) % 0.40/0.60 (step @p60 :rule cnf_or_neg :args (@t49 0)) % 0.40/0.60 (step @p61 :rule eq_resolve :premises (@p60 @p59)) % 0.40/0.60 (step @p62 :rule reordering :premises (@p61) :args ((or @t45 @t49))) % 0.40/0.60 (step @p63 :rule chain_m_resolution :premises (@p62 @p56) :args (@t45 @t50 @t51)) % 0.40/0.60 (step @p64 :rule instantiate :premises (@p12) :args ((@list @t44 @t43))) % 0.40/0.60 (step @p65 :rule bool-impl-elim :args (@t8 @t7)) % 0.40/0.60 (step @p66 :rule cong :premises (@p65) :args (@t9)) % 0.40/0.60 (step @p67 :rule eq_resolve :premises (@p2 @p66)) % 0.40/0.60 (step @p68 :rule instantiate :premises (@p67) :args (@t52)) % 0.40/0.60 (step @p69 :rule bool-double-not-elim :args (@t46)) % 0.40/0.60 (step @p70 :rule nary_cong :premises (@p58 @p69) :args ((or @t49 (not @t47)))) % 0.40/0.60 (step @p71 :rule cnf_or_neg :args (@t49 1)) % 0.40/0.60 (step @p72 :rule eq_resolve :premises (@p71 @p70)) % 0.40/0.60 (step @p73 :rule reordering :premises (@p72) :args ((or @t46 @t49))) % 0.40/0.60 (step @p74 :rule chain_m_resolution :premises (@p73 @p56) :args (@t46 @t50 @t51)) % 0.40/0.60 (step @p75 :rule cnf_or_pos :args (@t55)) % 0.40/0.60 (step @p76 :rule reordering :premises (@p75) :args ((or @t47 @t54 (not @t55)))) % 0.40/0.60 (step @p77 :rule chain_m_resolution :premises (@p76 @p74 @p68) :args (@t54 @t56 (@list @t46 @t55))) % 0.40/0.60 (step @p78 :rule cnf_equiv_pos2 :args (@t60)) % 0.40/0.60 (step @p79 :rule reordering :premises (@p78) :args ((or @t53 @t61 (not @t60)))) % 0.40/0.60 (step @p80 :rule chain_m_resolution :premises (@p79 @p77 @p64) :args (@t61 (@list true false) (@list @t53 @t60))) % 0.40/0.60 (step @p81 :rule eq-symm :args (@t43 @t44)) % 0.40/0.60 (step @p82 :rule cong :premises (@p81) :args (@t62)) % 0.40/0.60 (step @p83 :rule refl :args (@t63)) % 0.40/0.60 (step @p84 :rule nary_cong :premises (@p83 @p82) :args (@t64)) % 0.40/0.60 (step @p85 :rule refl :args (@t46)) % 0.40/0.60 (step @p86 :rule cong :premises (@p85 @p84) :args (@t65)) % 0.40/0.60 (step @p87 :rule refl :args (@t30)) % 0.40/0.60 (step @p88 :rule cong :premises (@p87 @p86) :args ((=> @t30 @t65))) % 0.40/0.60 (assume-push @p110 @t30) % 0.40/0.60 (step @p90 :rule instantiate :premises (@p12) :args (@t52)) % 0.40/0.60 (step-pop @p111 :rule scope :premises (@p90)) % 0.40/0.60 (step @p91 :rule process_scope :premises (@p111) :args (@t65)) % 0.40/0.60 (step @p93 :rule eq_resolve :premises (@p91 @p88)) % 0.40/0.60 (step @p94 :rule implies_elim :premises (@p93)) % 0.40/0.60 (step @p95 :rule chain_m_resolution :premises (@p94 @p12) :args (@t67 @t68 (@list @t30))) % 0.40/0.60 (step @p96 :rule cnf_equiv_pos1 :args (@t67)) % 0.40/0.60 (step @p97 :rule reordering :premises (@p96) :args ((or @t47 @t66 (not @t67)))) % 0.40/0.60 (step @p98 :rule chain_m_resolution :premises (@p97 @p74 @p95) :args (@t66 @t56 (@list @t46 @t67))) % 0.40/0.60 (step @p99 :rule cnf_and_pos :args (@t66 1)) % 0.40/0.60 (step @p100 :rule reordering :premises (@p99) :args ((or @t58 (not @t66)))) % 0.40/0.60 (step @p101 :rule chain_m_resolution :premises (@p100 @p98) :args (@t58 @t68 (@list @t66))) % 0.40/0.60 (step @p102 :rule bool-double-not-elim :args (@t57)) % 0.40/0.60 (step @p103 :rule refl :args (@t48)) % 0.40/0.60 (step @p104 :rule refl :args (@t59)) % 0.40/0.60 (step @p105 :rule nary_cong :premises (@p104 @p103 @p102) :args ((or @t59 @t48 (not @t58)))) % 0.40/0.60 (step @p106 :rule cnf_and_neg :args (@t59)) % 0.40/0.60 (step @p107 :rule eq_resolve :premises (@p106 @p105)) % 0.40/0.60 (step @p108 :rule reordering :premises (@p107) :args ((or @t48 @t57 @t59))) % 0.40/0.60 (step @p109 false :rule chain_m_resolution :premises (@p108 @p101 @p80 @p63) :args (false (@list true true false) (@list @t57 @t59 @t45))) % 0.40/0.60 ) % 0.40/0.60 % SZS output end Proof % 0.40/0.60 % cvc5 exiting %------------------------------------------------------------------------------