%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET175+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 : n003.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:47:34 AM UTC 2026 % Result : Theorem 0.40s 0.62s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET175+3 : TPTP v9.2.1. Released v2.2.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n003.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 15:06:59 EDT 2026 % 0.17/0.35 % CPUTime : % 0.28/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.62 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.62 % SZS status Theorem % 0.40/0.62 % SZS output start Proof % 0.40/0.62 ( % 0.40/0.62 (declare-sort $$unsorted 0) % 0.40/0.62 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.62 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.40/0.62 (define @t1 () (@var "C" $$unsorted)) % 0.40/0.62 (define @t2 () (@var "D" $$unsorted)) % 0.40/0.62 (define @t3 () (tptp.member @t2 @t1)) % 0.40/0.62 (define @t4 () (@var "B" $$unsorted)) % 0.40/0.62 (define @t5 () (tptp.member @t2 @t4)) % 0.40/0.62 (define @t6 () (tptp.union @t4 @t1)) % 0.40/0.62 (define @t7 () (@list @t4 @t1 @t2)) % 0.40/0.62 (define @t8 () (tptp.intersection @t4 @t1)) % 0.40/0.62 (define @t9 () (tptp.subset @t4 @t1)) % 0.40/0.62 (define @t10 () (= @t4 @t1)) % 0.40/0.62 (define @t11 () (@list @t4 @t1)) % 0.40/0.62 (define @t12 () (@list @t2)) % 0.40/0.62 (define @t13 () (tptp.union @t4 @t8)) % 0.40/0.62 (define @t14 () (forall @t11 (= @t13 @t4))) % 0.40/0.62 (define @t15 () (not @t14)) % 0.40/0.62 (define @t16 () (forall @t11 (= @t4 @t13))) % 0.40/0.62 (define @t17 () (@quantifiers_skolemize @t16 1)) % 0.40/0.62 (define @t18 () (@quantifiers_skolemize @t16 0)) % 0.40/0.62 (define @t19 () (tptp.intersection @t18 @t17)) % 0.40/0.62 (define @t20 () (tptp.member @t2 @t18)) % 0.40/0.62 (define @t21 () (forall @t12 (or (not (tptp.member @t2 @t19)) @t20))) % 0.40/0.62 (define @t22 () (@quantifiers_skolemize @t21 0)) % 0.40/0.62 (define @t23 () (tptp.member @t22 @t19)) % 0.40/0.62 (define @t24 () (tptp.member @t22 @t18)) % 0.40/0.62 (define @t25 () (not @t23)) % 0.40/0.62 (define @t26 () (or @t25 @t24)) % 0.40/0.62 (define @t27 () (and @t24 (tptp.member @t22 @t17))) % 0.40/0.62 (define @t28 () (= @t23 @t27)) % 0.40/0.62 (define @t29 () (not @t26)) % 0.40/0.62 (define @t30 () (not @t21)) % 0.40/0.62 (define @t31 () (tptp.union @t18 @t19)) % 0.40/0.62 (define @t32 () (forall @t12 (= @t20 (tptp.member @t2 @t31)))) % 0.40/0.62 (define @t33 () (@quantifiers_skolemize @t32 0)) % 0.40/0.62 (define @t34 () (tptp.member @t33 @t19)) % 0.40/0.62 (define @t35 () (tptp.member @t33 @t18)) % 0.40/0.62 (define @t36 () (or @t35 @t34)) % 0.40/0.62 (define @t37 () (not @t35)) % 0.40/0.62 (define @t38 () (tptp.member @t33 @t31)) % 0.40/0.62 (define @t39 () (= @t38 @t36)) % 0.40/0.62 (define @t40 () (not @t39)) % 0.40/0.62 (define @t41 () (= @t18 @t31)) % 0.40/0.62 (define @t42 () (= @t41 @t32)) % 0.40/0.62 (define @t43 () (not @t32)) % 0.40/0.62 (define @t44 () (@list true false)) % 0.40/0.62 (define @t45 () (= @t35 @t38)) % 0.40/0.62 (define @t46 () (not @t36)) % 0.40/0.62 (define @t47 () (not @t34)) % 0.40/0.62 (define @t48 () (or @t47 @t35)) % 0.40/0.62 (define @t49 () (not @t48)) % 0.40/0.62 (assume @p1 (forall @t7 (= (tptp.member @t2 @t6) (or @t5 @t3)))) % 0.40/0.62 (assume @p2 (forall @t7 (= (tptp.member @t2 @t8) (and @t5 @t3)))) % 0.40/0.62 (assume @p3 (forall @t11 (= @t10 (and @t9 (tptp.subset @t1 @t4))))) % 0.40/0.62 (assume @p4 (forall @t11 (= @t6 (tptp.union @t1 @t4)))) % 0.40/0.62 (assume @p5 (forall @t11 (= @t8 (tptp.intersection @t1 @t4)))) % 0.40/0.62 (assume @p6 (forall @t11 (= @t9 (forall @t12 (=> @t5 @t3))))) % 0.40/0.62 (assume @p7 (forall (@list @t4) (tptp.subset @t4 @t4))) % 0.40/0.62 (assume @p8 (forall @t11 (= @t10 (forall @t12 (= @t5 @t3))))) % 0.40/0.62 (assume @p9 @t15) % 0.40/0.62 (assume @p10 true) % 0.40/0.62 (step @p11 :rule bool-double-not-elim :args (@t23)) % 0.40/0.62 (step @p12 :rule refl :args (@t26)) % 0.40/0.62 (step @p13 :rule nary_cong :premises (@p12 @p11) :args ((or @t26 (not @t25)))) % 0.40/0.62 (step @p14 :rule cnf_or_neg :args (@t26 0)) % 0.40/0.62 (step @p15 :rule eq_resolve :premises (@p14 @p13)) % 0.40/0.62 (step @p16 :rule reordering :premises (@p15) :args ((or @t23 @t26))) % 0.40/0.62 (step @p17 :rule cnf_or_neg :args (@t26 1)) % 0.40/0.62 (step @p18 :rule instantiate :premises (@p2) :args ((@list @t18 @t17 @t22))) % 0.40/0.62 (step @p19 :rule cnf_equiv_pos1 :args (@t28)) % 0.40/0.62 (step @p20 :rule reordering :premises (@p19) :args ((or @t25 @t27 (not @t28)))) % 0.40/0.62 (step @p21 :rule cnf_and_pos :args (@t27 0)) % 0.40/0.62 (step @p22 :rule reordering :premises (@p21) :args ((or @t24 (not @t27)))) % 0.40/0.62 (step @p23 :rule chain_m_resolution :premises (@p22 @p20 @p18 @p17 @p16) :args (@t26 (@list false false true false) (@list @t27 @t28 @t24 @t23))) % 0.40/0.62 (step @p24 :rule refl :args (@t29)) % 0.40/0.62 (step @p25 :rule bool-double-not-elim :args (@t21)) % 0.40/0.62 (step @p26 :rule nary_cong :premises (@p25 @p24) :args ((or (not @t30) @t29))) % 0.40/0.62 (assume-push @p69 @t30) % 0.40/0.62 (step @p28 :rule skolemize :premises (@p69)) % 0.40/0.62 (step-pop @p70 :rule scope :premises (@p28)) % 0.40/0.62 (step @p29 :rule process_scope :premises (@p70) :args (@t29)) % 0.40/0.62 (step @p31 :rule implies_elim :premises (@p29)) % 0.40/0.62 (step @p32 :rule eq_resolve :premises (@p31 @p26)) % 0.40/0.62 (step @p33 :rule chain_m_resolution :premises (@p32 @p23) :args (@t21 (@list false) (@list @t26))) % 0.40/0.62 (step @p34 :rule cnf_or_neg :args (@t36 0)) % 0.40/0.62 (step @p35 :rule reordering :premises (@p34) :args ((or @t37 @t36))) % 0.40/0.62 (step @p36 :rule instantiate :premises (@p1) :args ((@list @t18 @t19 @t33))) % 0.40/0.62 (step @p37 :rule cnf_equiv_pos1 :args (@t39)) % 0.40/0.62 (step @p38 :rule reordering :premises (@p37) :args ((or (not @t38) @t36 @t40))) % 0.40/0.62 (step @p39 :rule instantiate :premises (@p8) :args ((@list @t18 @t31))) % 0.40/0.62 (step @p40 :rule eq-symm :args (@t13 @t4)) % 0.40/0.62 (step @p41 :rule cong :premises (@p40) :args (@t14)) % 0.40/0.62 (step @p42 :rule cong :premises (@p41) :args (@t15)) % 0.40/0.62 (step @p43 :rule eq_resolve :premises (@p9 @p42)) % 0.40/0.62 (step @p44 :rule skolemize :premises (@p43)) % 0.40/0.62 (step @p45 :rule cnf_equiv_pos2 :args (@t42)) % 0.40/0.62 (step @p46 :rule reordering :premises (@p45) :args ((or @t41 @t43 (not @t42)))) % 0.40/0.62 (step @p47 :rule chain_m_resolution :premises (@p46 @p44 @p39) :args (@t43 @t44 (@list @t41 @t42))) % 0.40/0.62 (step @p48 :rule skolemize :premises (@p47)) % 0.40/0.62 (step @p49 :rule cnf_equiv_neg1 :args (@t45)) % 0.40/0.62 (step @p50 :rule reordering :premises (@p49) :args ((or @t35 @t38 @t45))) % 0.40/0.62 (step @p51 :rule chain_m_resolution :premises (@p50 @p48 @p38 @p36 @p35) :args (@t36 (@list true true false true) (@list @t45 @t38 @t39 @t35))) % 0.40/0.62 (step @p52 :rule cnf_equiv_pos2 :args (@t39)) % 0.40/0.62 (step @p53 :rule reordering :premises (@p52) :args ((or @t38 @t46 @t40))) % 0.40/0.62 (step @p54 :rule chain_m_resolution :premises (@p53 @p51 @p36) :args (@t38 (@list false false) (@list @t36 @t39))) % 0.40/0.62 (step @p55 :rule cnf_equiv_neg2 :args (@t45)) % 0.40/0.62 (step @p56 :rule chain_m_resolution :premises (@p55 @p48 @p54) :args (@t37 @t44 (@list @t45 @t38))) % 0.40/0.62 (step @p57 :rule cnf_or_pos :args (@t36)) % 0.40/0.62 (step @p58 :rule reordering :premises (@p57) :args ((or @t35 @t34 @t46))) % 0.40/0.62 (step @p59 :rule chain_m_resolution :premises (@p58 @p56 @p51) :args (@t34 @t44 (@list @t35 @t36))) % 0.40/0.62 (step @p60 :rule cnf_or_pos :args (@t48)) % 0.40/0.62 (step @p61 :rule reordering :premises (@p60) :args ((or @t35 @t47 @t49))) % 0.40/0.62 (step @p62 :rule chain_m_resolution :premises (@p61 @p56 @p59) :args (@t49 @t44 (@list @t35 @t34))) % 0.40/0.62 (assume-push @p71 @t21) % 0.40/0.62 (step @p64 :rule instantiate :premises (@p71) :args ((@list @t33))) % 0.40/0.62 (step-pop @p72 :rule scope :premises (@p64)) % 0.40/0.62 (step @p65 :rule process_scope :premises (@p72) :args (@t48)) % 0.40/0.62 (step @p67 :rule implies_elim :premises (@p65)) % 0.40/0.62 (step @p68 false :rule chain_m_resolution :premises (@p67 @p62 @p33) :args (false @t44 (@list @t48 @t21))) % 0.40/0.62 ) % 0.40/0.62 % SZS output end Proof % 0.40/0.62 % cvc5 exiting %------------------------------------------------------------------------------