%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET592+3 : TPTP v9.2.1. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n015.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:48:08 AM UTC 2026 % Result : Theorem 0.40s 0.58s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET592+3 : TPTP v9.2.1. Released v2.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.35 % Computer : n015.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:04:04 EDT 2026 % 0.18/0.35 % CPUTime : % 0.29/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.58 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.58 % SZS status Theorem % 0.40/0.58 % SZS output start Proof % 0.40/0.58 ( % 0.40/0.58 (declare-sort $$unsorted 0) % 0.40/0.58 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.58 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.empty_set $$unsorted) % 0.40/0.58 (define @t1 () (@var "B" $$unsorted)) % 0.40/0.58 (define @t2 () (= @t1 tptp.empty_set)) % 0.40/0.58 (define @t3 () (tptp.subset @t1 tptp.empty_set)) % 0.40/0.58 (define @t4 () (=> @t3 @t2)) % 0.40/0.58 (define @t5 () (@list @t1)) % 0.40/0.58 (define @t6 () (forall @t5 @t4)) % 0.40/0.58 (define @t7 () (@var "D" $$unsorted)) % 0.40/0.58 (define @t8 () (@var "C" $$unsorted)) % 0.40/0.58 (define @t9 () (tptp.intersection @t8 @t7)) % 0.40/0.58 (define @t10 () (tptp.subset @t1 @t9)) % 0.40/0.58 (define @t11 () (tptp.subset @t1 @t7)) % 0.40/0.58 (define @t12 () (tptp.subset @t1 @t8)) % 0.40/0.58 (define @t13 () (and @t12 @t11)) % 0.40/0.58 (define @t14 () (@list @t1 @t8 @t7)) % 0.40/0.58 (define @t15 () (forall @t14 (=> @t13 @t10))) % 0.40/0.58 (define @t16 () (tptp.member @t7 @t8)) % 0.40/0.58 (define @t17 () (tptp.member @t7 @t1)) % 0.40/0.58 (define @t18 () (tptp.intersection @t1 @t8)) % 0.40/0.58 (define @t19 () (@list @t7)) % 0.40/0.58 (define @t20 () (@list @t1 @t8)) % 0.40/0.58 (define @t21 () (= @t1 @t8)) % 0.40/0.58 (define @t22 () (and @t12 @t11 (= @t9 tptp.empty_set))) % 0.40/0.58 (define @t23 () (=> @t22 @t2)) % 0.40/0.58 (define @t24 () (forall @t14 @t23)) % 0.40/0.58 (define @t25 () (not @t24)) % 0.40/0.58 (define @t26 () (not @t11)) % 0.40/0.58 (define @t27 () (not @t12)) % 0.40/0.58 (define @t28 () (= tptp.empty_set @t1)) % 0.40/0.58 (define @t29 () (= tptp.empty_set @t9)) % 0.40/0.58 (define @t30 () (not @t29)) % 0.40/0.58 (define @t31 () (or @t27 @t26 @t30 @t28)) % 0.40/0.58 (define @t32 () (forall @t14 @t31)) % 0.40/0.58 (define @t33 () (@quantifiers_skolemize @t32 1)) % 0.40/0.58 (define @t34 () (@quantifiers_skolemize @t32 2)) % 0.40/0.58 (define @t35 () (@quantifiers_skolemize @t32 0)) % 0.40/0.58 (define @t36 () (or @t27 @t26 @t30)) % 0.40/0.58 (define @t37 () (and @t12 @t11 @t29)) % 0.40/0.58 (define @t38 () (tptp.subset @t35 @t34)) % 0.40/0.58 (define @t39 () (= tptp.empty_set @t35)) % 0.40/0.58 (define @t40 () (= tptp.empty_set (tptp.intersection @t33 @t34))) % 0.40/0.58 (define @t41 () (not @t40)) % 0.40/0.58 (define @t42 () (not @t38)) % 0.40/0.58 (define @t43 () (tptp.subset @t35 @t33)) % 0.40/0.58 (define @t44 () (not @t43)) % 0.40/0.58 (define @t45 () (or @t44 @t42 @t41 @t39)) % 0.40/0.58 (define @t46 () (@list true)) % 0.40/0.58 (define @t47 () (@list @t45)) % 0.40/0.58 (define @t48 () (tptp.subset @t35 (tptp.intersection @t34 @t33))) % 0.40/0.58 (define @t49 () (or @t42 @t44 @t48)) % 0.40/0.58 (define @t50 () (tptp.subset @t35 tptp.empty_set)) % 0.40/0.58 (define @t51 () (not @t50)) % 0.40/0.58 (define @t52 () (or @t51 @t39)) % 0.40/0.58 (assume @p1 @t6) % 0.40/0.58 (assume @p2 @t15) % 0.40/0.58 (assume @p3 (forall @t5 (not (tptp.member @t1 tptp.empty_set)))) % 0.40/0.58 (assume @p4 (forall @t14 (= (tptp.member @t7 @t18) (and @t17 @t16)))) % 0.40/0.58 (assume @p5 (forall @t20 (= @t12 (forall @t19 (=> @t17 @t16))))) % 0.40/0.58 (assume @p6 (forall @t20 (= @t21 (and @t12 (tptp.subset @t8 @t1))))) % 0.40/0.58 (assume @p7 (forall @t20 (= @t18 (tptp.intersection @t8 @t1)))) % 0.40/0.58 (assume @p8 (forall @t5 (tptp.subset @t1 @t1))) % 0.40/0.58 (assume @p9 (forall @t5 (= (tptp.empty @t1) (forall (@list @t8) (not (tptp.member @t8 @t1)))))) % 0.40/0.58 (assume @p10 (forall @t20 (= @t21 (forall @t19 (= @t17 @t16))))) % 0.40/0.58 (assume @p11 @t25) % 0.40/0.58 (assume @p12 true) % 0.40/0.58 (step @p13 :rule evaluate :args ((= false true))) % 0.40/0.58 (step @p14 :rule aci_norm :args ((= (or (or @t27 @t26) @t10) (or @t27 @t26 @t10)))) % 0.40/0.58 (step @p15 :rule refl :args (@t10)) % 0.40/0.58 (step @p16 :rule bool-and-de-morgan :args (@t12 @t11 true)) % 0.40/0.58 (step @p17 :rule nary_cong :premises (@p16 @p15) :args ((or (not @t13) @t10))) % 0.40/0.58 (step @p18 :rule trans :premises (@p17 @p14)) % 0.40/0.58 (step @p19 :rule bool-impl-elim :args (@t13 @t10)) % 0.40/0.58 (step @p20 :rule trans :premises (@p19 @p18)) % 0.40/0.58 (step @p21 :rule cong :premises (@p20) :args (@t15)) % 0.40/0.58 (step @p22 :rule eq_resolve :premises (@p2 @p21)) % 0.40/0.58 (step @p23 :rule instantiate :premises (@p22) :args ((@list @t35 @t34 @t33))) % 0.40/0.58 (step @p24 :rule aci_norm :args ((= (or @t36 @t28) @t31))) % 0.40/0.58 (step @p25 :rule refl :args (@t28)) % 0.40/0.58 (step @p26 :rule aci_norm :args ((= (or @t27 (or @t26 @t30)) @t36))) % 0.40/0.58 (step @p27 :rule bool-and-de-morgan :args (@t11 @t29 true)) % 0.40/0.58 (step @p28 :rule refl :args (@t27)) % 0.40/0.58 (step @p29 :rule nary_cong :premises (@p28 @p27) :args ((or @t27 (not (and @t11 @t29))))) % 0.40/0.58 (step @p30 :rule bool-and-de-morgan :args (@t12 @t11 (and @t29))) % 0.40/0.58 (step @p31 :rule trans :premises (@p30 @p29)) % 0.40/0.58 (step @p32 :rule trans :premises (@p31 @p26)) % 0.40/0.58 (step @p33 :rule nary_cong :premises (@p32 @p25) :args ((or (not @t37) @t28))) % 0.40/0.58 (step @p34 :rule trans :premises (@p33 @p24)) % 0.40/0.58 (step @p35 :rule bool-impl-elim :args (@t37 @t28)) % 0.40/0.58 (step @p36 :rule trans :premises (@p35 @p34)) % 0.40/0.58 (step @p37 :rule cong :premises (@p36) :args ((forall @t14 (=> @t37 @t28)))) % 0.40/0.58 (step @p38 :rule eq-symm :args (@t1 tptp.empty_set)) % 0.40/0.58 (step @p39 :rule eq-symm :args (@t9 tptp.empty_set)) % 0.40/0.58 (step @p40 :rule refl :args (@t11)) % 0.40/0.58 (step @p41 :rule refl :args (@t12)) % 0.40/0.58 (step @p42 :rule nary_cong :premises (@p41 @p40 @p39) :args (@t22)) % 0.40/0.58 (step @p43 :rule cong :premises (@p42 @p38) :args (@t23)) % 0.40/0.58 (step @p44 :rule cong :premises (@p43) :args (@t24)) % 0.40/0.58 (step @p45 :rule trans :premises (@p44 @p37)) % 0.40/0.58 (step @p46 :rule cong :premises (@p45) :args (@t25)) % 0.40/0.58 (step @p47 :rule eq_resolve :premises (@p11 @p46)) % 0.40/0.58 (step @p48 :rule skolemize :premises (@p47)) % 0.40/0.58 (step @p49 :rule bool-double-not-elim :args (@t38)) % 0.40/0.58 (step @p50 :rule refl :args (@t45)) % 0.40/0.58 (step @p51 :rule nary_cong :premises (@p50 @p49) :args ((or @t45 (not @t42)))) % 0.40/0.58 (step @p52 :rule cnf_or_neg :args (@t45 1)) % 0.40/0.58 (step @p53 :rule eq_resolve :premises (@p52 @p51)) % 0.40/0.58 (step @p54 :rule reordering :premises (@p53) :args ((or @t38 @t45))) % 0.40/0.58 (step @p55 :rule chain_m_resolution :premises (@p54 @p48) :args (@t38 @t46 @t47)) % 0.40/0.58 (step @p56 :rule bool-double-not-elim :args (@t43)) % 0.40/0.58 (step @p57 :rule nary_cong :premises (@p50 @p56) :args ((or @t45 (not @t44)))) % 0.40/0.58 (step @p58 :rule cnf_or_neg :args (@t45 0)) % 0.40/0.58 (step @p59 :rule eq_resolve :premises (@p58 @p57)) % 0.40/0.58 (step @p60 :rule reordering :premises (@p59) :args ((or @t43 @t45))) % 0.40/0.58 (step @p61 :rule chain_m_resolution :premises (@p60 @p48) :args (@t43 @t46 @t47)) % 0.40/0.58 (step @p62 :rule cnf_or_pos :args (@t49)) % 0.40/0.58 (step @p63 :rule reordering :premises (@p62) :args ((or @t44 @t42 @t48 (not @t49)))) % 0.40/0.58 (step @p64 :rule chain_m_resolution :premises (@p63 @p61 @p55 @p23) :args (@t48 (@list false false false) (@list @t43 @t38 @t49))) % 0.40/0.58 (step @p65 :rule true_intro :premises (@p64)) % 0.40/0.58 (step @p66 :rule instantiate :premises (@p7) :args ((@list @t33 @t34))) % 0.40/0.58 (step @p67 :rule bool-double-not-elim :args (@t40)) % 0.40/0.58 (step @p68 :rule nary_cong :premises (@p50 @p67) :args ((or @t45 (not @t41)))) % 0.40/0.58 (step @p69 :rule cnf_or_neg :args (@t45 2)) % 0.40/0.58 (step @p70 :rule eq_resolve :premises (@p69 @p68)) % 0.40/0.58 (step @p71 :rule reordering :premises (@p70) :args ((or @t40 @t45))) % 0.40/0.58 (step @p72 :rule chain_m_resolution :premises (@p71 @p48) :args (@t40 @t46 @t47)) % 0.40/0.58 (step @p73 :rule trans :premises (@p72 @p66)) % 0.40/0.58 (step @p74 :rule refl :args (@t35)) % 0.40/0.58 (step @p75 :rule cong :premises (@p74 @p73) :args (@t50)) % 0.40/0.58 (step @p76 :rule bool-impl-elim :args (@t3 @t28)) % 0.40/0.58 (step @p77 :rule cong :premises (@p76) :args ((forall @t5 (=> @t3 @t28)))) % 0.40/0.58 (step @p78 :rule refl :args (@t3)) % 0.40/0.58 (step @p79 :rule cong :premises (@p78 @p38) :args (@t4)) % 0.40/0.58 (step @p80 :rule cong :premises (@p79) :args (@t6)) % 0.40/0.58 (step @p81 :rule trans :premises (@p80 @p77)) % 0.40/0.58 (step @p82 :rule eq_resolve :premises (@p1 @p81)) % 0.40/0.58 (step @p83 :rule instantiate :premises (@p82) :args ((@list @t35))) % 0.40/0.58 (step @p84 :rule cnf_or_neg :args (@t45 3)) % 0.40/0.58 (step @p85 :rule chain_m_resolution :premises (@p84 @p48) :args ((not @t39) @t46 @t47)) % 0.40/0.58 (step @p86 :rule cnf_or_pos :args (@t52)) % 0.40/0.58 (step @p87 :rule reordering :premises (@p86) :args ((or @t39 @t51 (not @t52)))) % 0.40/0.58 (step @p88 :rule chain_m_resolution :premises (@p87 @p85 @p83) :args (@t51 (@list true false) (@list @t39 @t52))) % 0.40/0.58 (step @p89 :rule false_intro :premises (@p88)) % 0.40/0.58 (step @p90 :rule symm :premises (@p89)) % 0.40/0.58 (step @p91 :rule trans :premises (@p90 @p75 @p65)) % 0.40/0.58 (step @p92 false :rule eq_resolve :premises (@p91 @p13)) % 0.40/0.58 ) % 0.40/0.58 % SZS output end Proof % 0.40/0.58 % cvc5 exiting %------------------------------------------------------------------------------