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