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