%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET062+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 : n008.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:11 AM UTC 2026 % Result : Theorem 0.30s 0.54s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET062+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.17/0.34 % Computer : n008.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 14:50:03 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.48 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.54 % SZS status Theorem % 0.30/0.54 % SZS output start Proof % 0.30/0.54 ( % 0.30/0.54 (declare-sort $$unsorted 0) % 0.30/0.54 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.30/0.54 (declare-const tptp.empty_set $$unsorted) % 0.30/0.54 (define @t1 () (@var "B" $$unsorted)) % 0.30/0.54 (define @t2 () (@list @t1)) % 0.30/0.54 (define @t3 () (forall @t2 (not (tptp.member @t1 tptp.empty_set)))) % 0.30/0.54 (define @t4 () (@var "C" $$unsorted)) % 0.30/0.54 (define @t5 () (@var "D" $$unsorted)) % 0.30/0.54 (define @t6 () (tptp.member @t5 @t4)) % 0.30/0.54 (define @t7 () (tptp.member @t5 @t1)) % 0.30/0.54 (define @t8 () (@list @t5)) % 0.30/0.54 (define @t9 () (forall @t8 (=> @t7 @t6))) % 0.30/0.54 (define @t10 () (tptp.subset @t1 @t4)) % 0.30/0.54 (define @t11 () (= @t10 @t9)) % 0.30/0.54 (define @t12 () (forall (@list @t1 @t4) @t11)) % 0.30/0.54 (define @t13 () (forall @t2 (tptp.subset tptp.empty_set @t1))) % 0.30/0.54 (define @t14 () (@quantifiers_skolemize @t13 0)) % 0.30/0.54 (define @t15 () (forall @t8 (or (not (tptp.member @t5 tptp.empty_set)) (tptp.member @t5 @t14)))) % 0.30/0.54 (define @t16 () (tptp.subset tptp.empty_set @t14)) % 0.30/0.54 (define @t17 () (= @t16 @t15)) % 0.30/0.54 (define @t18 () (not @t15)) % 0.30/0.54 (define @t19 () (@quantifiers_skolemize @t15 0)) % 0.30/0.54 (define @t20 () (tptp.member @t19 tptp.empty_set)) % 0.30/0.54 (define @t21 () (not @t20)) % 0.30/0.54 (define @t22 () (or @t21 (tptp.member @t19 @t14))) % 0.30/0.54 (assume @p1 @t3) % 0.30/0.54 (assume @p2 @t12) % 0.30/0.54 (assume @p3 (forall @t2 (tptp.subset @t1 @t1))) % 0.30/0.54 (assume @p4 (forall @t2 (= (tptp.empty @t1) (forall (@list @t4) (not (tptp.member @t4 @t1)))))) % 0.30/0.54 (assume @p5 (not @t13)) % 0.30/0.54 (assume @p6 true) % 0.30/0.54 (step @p7 :rule bool-impl-elim :args (@t7 @t6)) % 0.30/0.54 (step @p8 :rule cong :premises (@p7) :args (@t9)) % 0.30/0.54 (step @p9 :rule refl :args (@t10)) % 0.30/0.54 (step @p10 :rule cong :premises (@p9 @p8) :args (@t11)) % 0.30/0.54 (step @p11 :rule cong :premises (@p10) :args (@t12)) % 0.30/0.54 (step @p12 :rule eq_resolve :premises (@p2 @p11)) % 0.30/0.54 (step @p13 :rule instantiate :premises (@p12) :args ((@list tptp.empty_set @t14))) % 0.30/0.54 (step @p14 :rule skolemize :premises (@p5)) % 0.30/0.54 (step @p15 :rule cnf_equiv_pos2 :args (@t17)) % 0.30/0.54 (step @p16 :rule reordering :premises (@p15) :args ((or @t16 @t18 (not @t17)))) % 0.30/0.54 (step @p17 :rule chain_m_resolution :premises (@p16 @p14 @p13) :args (@t18 (@list true false) (@list @t16 @t17))) % 0.30/0.54 (step @p18 :rule skolemize :premises (@p17)) % 0.30/0.54 (step @p19 :rule bool-double-not-elim :args (@t20)) % 0.30/0.54 (step @p20 :rule refl :args (@t22)) % 0.30/0.54 (step @p21 :rule nary_cong :premises (@p20 @p19) :args ((or @t22 (not @t21)))) % 0.30/0.54 (step @p22 :rule cnf_or_neg :args (@t22 0)) % 0.30/0.54 (step @p23 :rule eq_resolve :premises (@p22 @p21)) % 0.30/0.54 (step @p24 :rule reordering :premises (@p23) :args ((or @t20 @t22))) % 0.30/0.54 (step @p25 :rule chain_m_resolution :premises (@p24 @p18) :args (@t20 (@list true) (@list @t22))) % 0.30/0.54 (assume-push @p32 @t3) % 0.30/0.54 (step @p27 :rule instantiate :premises (@p1) :args ((@list @t19))) % 0.30/0.54 (step-pop @p33 :rule scope :premises (@p27)) % 0.30/0.54 (step @p28 :rule process_scope :premises (@p33) :args (@t21)) % 0.30/0.54 (step @p30 :rule implies_elim :premises (@p28)) % 0.30/0.54 (step @p31 false :rule chain_m_resolution :premises (@p30 @p25 @p1) :args (false (@list false false) (@list @t20 @t3))) % 0.30/0.54 ) % 0.30/0.54 % SZS output end Proof % 0.30/0.54 % cvc5 exiting %------------------------------------------------------------------------------