%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU126+2 : 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 : n023.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:38 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 : SEU126+2 : TPTP v9.2.1. Released v3.3.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.35 % Computer : n023.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 16:31:43 EDT 2026 % 0.16/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.disjoint (-> $$unsorted $$unsorted Bool)) % 0.40/0.59 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.40/0.59 (declare-const tptp.empty_set $$unsorted) % 0.40/0.59 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.59 (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.59 (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.59 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.40/0.59 (define @t1 () (@var "A" $$unsorted)) % 0.40/0.59 (define @t2 () (@var "B" $$unsorted)) % 0.40/0.59 (define @t3 () (not (tptp.in @t2 @t1))) % 0.40/0.59 (define @t4 () (tptp.in @t1 @t2)) % 0.40/0.59 (define @t5 () (@list @t1 @t2)) % 0.40/0.59 (define @t6 () (tptp.set_union2 @t2 @t1)) % 0.40/0.59 (define @t7 () (tptp.set_union2 @t1 @t2)) % 0.40/0.59 (define @t8 () (tptp.set_intersection2 @t1 @t2)) % 0.40/0.59 (define @t9 () (tptp.subset @t1 @t2)) % 0.40/0.59 (define @t10 () (= @t1 @t2)) % 0.40/0.59 (define @t11 () (forall @t5 (= @t10 (and @t9 (tptp.subset @t2 @t1))))) % 0.40/0.59 (define @t12 () (= @t1 tptp.empty_set)) % 0.40/0.59 (define @t13 () (@list @t1)) % 0.40/0.59 (define @t14 () (@var "D" $$unsorted)) % 0.40/0.59 (define @t15 () (tptp.in @t14 @t2)) % 0.40/0.59 (define @t16 () (tptp.in @t14 @t1)) % 0.40/0.59 (define @t17 () (@var "C" $$unsorted)) % 0.40/0.59 (define @t18 () (tptp.in @t14 @t17)) % 0.40/0.59 (define @t19 () (@list @t14)) % 0.40/0.59 (define @t20 () (@list @t1 @t2 @t17)) % 0.40/0.59 (define @t21 () (tptp.in @t17 @t2)) % 0.40/0.59 (define @t22 () (tptp.in @t17 @t1)) % 0.40/0.59 (define @t23 () (@list @t17)) % 0.40/0.59 (define @t24 () (tptp.disjoint @t1 @t2)) % 0.40/0.59 (define @t25 () (tptp.empty @t1)) % 0.40/0.59 (define @t26 () (not @t25)) % 0.40/0.59 (define @t27 () (=> @t9 (= @t7 @t2))) % 0.40/0.59 (define @t28 () (forall @t5 @t27)) % 0.40/0.59 (define @t29 () (not @t28)) % 0.40/0.59 (define @t30 () (and @t22 @t21)) % 0.40/0.59 (define @t31 () (not @t24)) % 0.40/0.59 (define @t32 () (tptp.in @t17 @t8)) % 0.40/0.59 (define @t33 () (tptp.empty @t2)) % 0.40/0.59 (define @t34 () (tptp.subset (tptp.set_union2 @t1 @t17) @t2)) % 0.40/0.59 (define @t35 () (tptp.subset @t17 @t2)) % 0.40/0.59 (define @t36 () (and @t9 @t35)) % 0.40/0.59 (define @t37 () (forall @t20 (=> @t36 @t34))) % 0.40/0.59 (define @t38 () (not @t35)) % 0.40/0.59 (define @t39 () (not @t9)) % 0.40/0.59 (define @t40 () (= @t2 @t7)) % 0.40/0.59 (define @t41 () (forall @t5 (or @t39 @t40))) % 0.40/0.59 (define @t42 () (@quantifiers_skolemize @t41 1)) % 0.40/0.59 (define @t43 () (@quantifiers_skolemize @t41 0)) % 0.40/0.59 (define @t44 () (tptp.set_union2 @t42 @t43)) % 0.40/0.59 (define @t45 () (tptp.set_union2 @t43 @t42)) % 0.40/0.59 (define @t46 () (= @t42 @t45)) % 0.40/0.59 (define @t47 () (tptp.subset @t43 @t42)) % 0.40/0.59 (define @t48 () (not @t47)) % 0.40/0.59 (define @t49 () (or @t48 @t46)) % 0.40/0.59 (define @t50 () (@list true)) % 0.40/0.59 (define @t51 () (@list @t49)) % 0.40/0.59 (define @t52 () (= @t42 @t44)) % 0.40/0.59 (define @t53 () (tptp.subset @t44 @t42)) % 0.40/0.59 (define @t54 () (tptp.subset @t42 @t44)) % 0.40/0.59 (define @t55 () (and @t54 @t53)) % 0.40/0.59 (define @t56 () (= @t52 @t55)) % 0.40/0.59 (define @t57 () (not @t55)) % 0.40/0.59 (define @t58 () (@list true false)) % 0.40/0.59 (define @t59 () (not @t53)) % 0.40/0.59 (define @t60 () (tptp.subset @t45 @t42)) % 0.40/0.59 (define @t61 () (tptp.subset @t42 @t42)) % 0.40/0.59 (define @t62 () (not @t61)) % 0.40/0.59 (define @t63 () (or @t48 @t62 @t60)) % 0.40/0.59 (define @t64 () (and @t61 @t61)) % 0.40/0.59 (define @t65 () (= (= @t42 @t42) @t64)) % 0.40/0.59 (assume @p1 (forall @t5 (=> @t4 @t3))) % 0.40/0.59 (assume @p2 (forall @t5 (= @t7 @t6))) % 0.40/0.59 (assume @p3 (forall @t5 (= @t8 (tptp.set_intersection2 @t2 @t1)))) % 0.40/0.59 (assume @p4 @t11) % 0.40/0.59 (assume @p5 (forall @t13 (= @t12 (forall (@list @t2) @t3)))) % 0.40/0.59 (assume @p6 (forall @t20 (= (= @t17 @t7) (forall @t19 (= @t18 (or @t16 @t15)))))) % 0.40/0.59 (assume @p7 (forall @t5 (= @t9 (forall @t23 (=> @t22 @t21))))) % 0.40/0.59 (assume @p8 (forall @t20 (= (= @t17 @t8) (forall @t19 (= @t18 (and @t16 @t15)))))) % 0.40/0.59 (assume @p9 (forall @t5 (= @t24 (= @t8 tptp.empty_set)))) % 0.40/0.59 (assume @p10 true) % 0.40/0.59 (assume @p11 (tptp.empty tptp.empty_set)) % 0.40/0.59 (assume @p12 (forall @t5 (=> @t26 (not (tptp.empty @t7))))) % 0.40/0.59 (assume @p13 (forall @t5 (=> @t26 (not (tptp.empty @t6))))) % 0.40/0.59 (assume @p14 (forall @t5 (= (tptp.set_union2 @t1 @t1) @t1))) % 0.40/0.59 (assume @p15 (forall @t5 (= (tptp.set_intersection2 @t1 @t1) @t1))) % 0.40/0.59 (assume @p16 (exists @t13 @t25)) % 0.40/0.59 (assume @p17 (exists @t13 @t26)) % 0.40/0.59 (assume @p18 (forall @t5 (tptp.subset @t1 @t1))) % 0.40/0.59 (assume @p19 (forall @t5 (=> @t24 (tptp.disjoint @t2 @t1)))) % 0.40/0.59 (assume @p20 @t29) % 0.40/0.59 (assume @p21 (forall @t13 (= (tptp.set_union2 @t1 tptp.empty_set) @t1))) % 0.40/0.59 (assume @p22 (forall @t20 (=> (and @t9 (tptp.subset @t2 @t17)) (tptp.subset @t1 @t17)))) % 0.40/0.59 (assume @p23 (forall @t13 (tptp.subset tptp.empty_set @t1))) % 0.40/0.59 (assume @p24 (forall @t5 (and (not (and @t31 (forall @t23 (not @t30)))) (not (and (exists @t23 @t30) @t24))))) % 0.40/0.59 (assume @p25 (forall @t13 (=> (tptp.subset @t1 tptp.empty_set) @t12))) % 0.40/0.59 (assume @p26 (forall @t5 (and (not (and @t31 (forall @t23 (not @t32)))) (not (and (exists @t23 @t32) @t24))))) % 0.40/0.59 (assume @p27 (forall @t13 (=> @t25 @t12))) % 0.40/0.59 (assume @p28 (forall @t5 (not (and @t4 @t33)))) % 0.40/0.59 (assume @p29 (forall @t5 (tptp.subset @t1 @t7))) % 0.40/0.59 (assume @p30 (forall @t5 (not (and @t25 (not @t10) @t33)))) % 0.40/0.59 (assume @p31 @t37) % 0.40/0.59 (step @p32 :rule aci_norm :args ((= (or (or @t39 @t38) @t34) (or @t39 @t38 @t34)))) % 0.40/0.59 (step @p33 :rule refl :args (@t34)) % 0.40/0.59 (step @p34 :rule bool-and-de-morgan :args (@t9 @t35 true)) % 0.40/0.59 (step @p35 :rule nary_cong :premises (@p34 @p33) :args ((or (not @t36) @t34))) % 0.40/0.59 (step @p36 :rule trans :premises (@p35 @p32)) % 0.40/0.59 (step @p37 :rule bool-impl-elim :args (@t36 @t34)) % 0.40/0.59 (step @p38 :rule trans :premises (@p37 @p36)) % 0.40/0.59 (step @p39 :rule cong :premises (@p38) :args (@t37)) % 0.40/0.59 (step @p40 :rule eq_resolve :premises (@p31 @p39)) % 0.40/0.59 (step @p41 :rule instantiate :premises (@p40) :args ((@list @t43 @t42 @t42))) % 0.40/0.59 (step @p42 :rule instantiate :premises (@p4) :args ((@list @t42 @t44))) % 0.40/0.59 (step @p43 :rule bool-impl-elim :args (@t9 @t40)) % 0.40/0.59 (step @p44 :rule cong :premises (@p43) :args ((forall @t5 (=> @t9 @t40)))) % 0.40/0.59 (step @p45 :rule eq-symm :args (@t7 @t2)) % 0.40/0.59 (step @p46 :rule refl :args (@t9)) % 0.40/0.59 (step @p47 :rule cong :premises (@p46 @p45) :args (@t27)) % 0.40/0.59 (step @p48 :rule cong :premises (@p47) :args (@t28)) % 0.40/0.59 (step @p49 :rule trans :premises (@p48 @p44)) % 0.40/0.59 (step @p50 :rule cong :premises (@p49) :args (@t29)) % 0.40/0.59 (step @p51 :rule eq_resolve :premises (@p20 @p50)) % 0.40/0.59 (step @p52 :rule skolemize :premises (@p51)) % 0.40/0.59 (step @p53 :rule cnf_or_neg :args (@t49 1)) % 0.40/0.59 (step @p54 :rule chain_m_resolution :premises (@p53 @p52) :args ((not @t46) @t50 @t51)) % 0.40/0.59 (step @p55 :rule false_intro :premises (@p54)) % 0.40/0.59 (step @p56 :rule instantiate :premises (@p2) :args ((@list @t43 @t42))) % 0.40/0.59 (step @p57 :rule symm :premises (@p56)) % 0.40/0.59 (step @p58 :rule refl :args (@t42)) % 0.40/0.59 (step @p59 :rule cong :premises (@p58 @p57) :args (@t52)) % 0.40/0.59 (step @p60 :rule trans :premises (@p59 @p55)) % 0.40/0.59 (step @p61 :rule false_elim :premises (@p60)) % 0.40/0.59 (step @p62 :rule cnf_equiv_pos2 :args (@t56)) % 0.40/0.59 (step @p63 :rule reordering :premises (@p62) :args ((or @t52 @t57 (not @t56)))) % 0.40/0.59 (step @p64 :rule chain_m_resolution :premises (@p63 @p61 @p42) :args (@t57 @t58 (@list @t52 @t56))) % 0.40/0.59 (step @p65 :rule instantiate :premises (@p29) :args ((@list @t42 @t43))) % 0.40/0.59 (step @p66 :rule cnf_and_neg :args (@t55)) % 0.40/0.59 (step @p67 :rule reordering :premises (@p66) :args ((or (not @t54) @t55 @t59))) % 0.40/0.59 (step @p68 :rule chain_m_resolution :premises (@p67 @p65 @p64) :args (@t59 (@list false true) (@list @t54 @t55))) % 0.40/0.59 (step @p69 :rule false_intro :premises (@p68)) % 0.40/0.59 (step @p70 :rule cong :premises (@p56 @p58) :args (@t60)) % 0.40/0.59 (step @p71 :rule trans :premises (@p70 @p69)) % 0.40/0.59 (step @p72 :rule false_elim :premises (@p71)) % 0.40/0.59 (step @p73 :rule bool-double-not-elim :args (@t47)) % 0.40/0.59 (step @p74 :rule refl :args (@t49)) % 0.40/0.59 (step @p75 :rule nary_cong :premises (@p74 @p73) :args ((or @t49 (not @t48)))) % 0.40/0.59 (step @p76 :rule cnf_or_neg :args (@t49 0)) % 0.40/0.59 (step @p77 :rule eq_resolve :premises (@p76 @p75)) % 0.40/0.59 (step @p78 :rule reordering :premises (@p77) :args ((or @t47 @t49))) % 0.40/0.59 (step @p79 :rule chain_m_resolution :premises (@p78 @p52) :args (@t47 @t50 @t51)) % 0.40/0.59 (step @p80 :rule cnf_or_pos :args (@t63)) % 0.40/0.59 (step @p81 :rule reordering :premises (@p80) :args ((or @t48 @t62 @t60 (not @t63)))) % 0.40/0.59 (step @p82 :rule chain_m_resolution :premises (@p81 @p79 @p72 @p41) :args (@t62 (@list false true false) (@list @t47 @t60 @t63))) % 0.40/0.59 (step @p83 :rule bool-eq-true :args (@t61)) % 0.40/0.59 (step @p84 :rule eq-symm :args (true @t61)) % 0.40/0.59 (step @p85 :rule trans :premises (@p84 @p83)) % 0.40/0.59 (step @p86 :rule aci_norm :args ((= @t64 @t61))) % 0.40/0.59 (step @p87 :rule eq-refl :args (@t42)) % 0.40/0.59 (step @p88 :rule cong :premises (@p87 @p86) :args (@t65)) % 0.40/0.59 (step @p89 :rule trans :premises (@p88 @p85)) % 0.40/0.59 (step @p90 :rule refl :args (@t11)) % 0.40/0.59 (step @p91 :rule cong :premises (@p90 @p89) :args ((=> @t11 @t65))) % 0.40/0.59 (assume-push @p99 @t11) % 0.40/0.59 (step @p93 :rule instantiate :premises (@p4) :args ((@list @t42 @t42))) % 0.40/0.59 (step-pop @p100 :rule scope :premises (@p93)) % 0.40/0.59 (step @p94 :rule process_scope :premises (@p100) :args (@t65)) % 0.40/0.59 (step @p96 :rule eq_resolve :premises (@p94 @p91)) % 0.40/0.59 (step @p97 :rule implies_elim :premises (@p96)) % 0.40/0.59 (step @p98 false :rule chain_m_resolution :premises (@p97 @p82 @p4) :args (false @t58 (@list @t61 @t11))) % 0.40/0.59 ) % 0.40/0.59 % SZS output end Proof % 0.40/0.59 % cvc5 exiting %------------------------------------------------------------------------------