%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET146+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 : n010.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:30 AM UTC 2026 % Result : Theorem 0.36s 0.59s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.14 % Problem : SET146+3 : TPTP v9.2.1. Released v2.2.0. % 0.09/0.15 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.20/0.37 % Computer : n010.cluster.edu % 0.20/0.37 % Model : x86_64 x86_64 % 0.20/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.20/0.37 % Memory : 8042.1875MB % 0.20/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.20/0.37 % CPULimit : 300 % 0.20/0.37 % WCLimit : 300 % 0.20/0.37 % DateTime : Tue Jun 2 15:01:40 EDT 2026 % 0.20/0.37 % CPUTime : % 0.29/0.52 %----Proving TF0_NAR, FOF, or CNF % 0.36/0.59 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.36/0.59 % SZS status Theorem % 0.36/0.59 % SZS output start Proof % 0.36/0.59 ( % 0.36/0.59 (declare-sort $$unsorted 0) % 0.36/0.59 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.36/0.59 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.36/0.59 (declare-const tptp.empty_set $$unsorted) % 0.36/0.59 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.59 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.36/0.59 (define @t1 () (@var "C" $$unsorted)) % 0.36/0.59 (define @t2 () (@var "D" $$unsorted)) % 0.36/0.59 (define @t3 () (tptp.member @t2 @t1)) % 0.36/0.59 (define @t4 () (@var "B" $$unsorted)) % 0.36/0.59 (define @t5 () (tptp.member @t2 @t4)) % 0.36/0.59 (define @t6 () (tptp.intersection @t4 @t1)) % 0.36/0.59 (define @t7 () (@list @t4)) % 0.36/0.59 (define @t8 () (tptp.subset @t4 @t1)) % 0.36/0.59 (define @t9 () (= @t4 @t1)) % 0.36/0.59 (define @t10 () (@list @t4 @t1)) % 0.36/0.59 (define @t11 () (@list @t2)) % 0.36/0.59 (define @t12 () (tptp.intersection @t4 tptp.empty_set)) % 0.36/0.59 (define @t13 () (forall @t7 (= @t12 tptp.empty_set))) % 0.36/0.59 (define @t14 () (not @t13)) % 0.36/0.59 (define @t15 () (@quantifiers_skolemize (forall @t7 (= tptp.empty_set @t12)) 0)) % 0.36/0.59 (define @t16 () (tptp.intersection @t15 tptp.empty_set)) % 0.36/0.59 (define @t17 () (forall @t11 (= (tptp.member @t2 tptp.empty_set) (tptp.member @t2 @t16)))) % 0.36/0.59 (define @t18 () (@quantifiers_skolemize @t17 0)) % 0.36/0.59 (define @t19 () (= tptp.empty_set @t16)) % 0.36/0.59 (define @t20 () (= @t19 @t17)) % 0.36/0.59 (define @t21 () (not @t17)) % 0.36/0.59 (define @t22 () (tptp.member @t18 @t16)) % 0.36/0.59 (define @t23 () (tptp.member @t18 tptp.empty_set)) % 0.36/0.59 (define @t24 () (= @t23 @t22)) % 0.36/0.59 (define @t25 () (and (tptp.member @t18 @t15) @t23)) % 0.36/0.59 (define @t26 () (not @t25)) % 0.36/0.59 (define @t27 () (= @t22 @t25)) % 0.36/0.59 (assume @p1 (forall (@list @t4 @t1 @t2) (= (tptp.member @t2 @t6) (and @t5 @t3)))) % 0.36/0.59 (assume @p2 (forall @t7 (not (tptp.member @t4 tptp.empty_set)))) % 0.36/0.59 (assume @p3 (forall @t10 (= @t9 (and @t8 (tptp.subset @t1 @t4))))) % 0.36/0.59 (assume @p4 (forall @t10 (= @t6 (tptp.intersection @t1 @t4)))) % 0.36/0.59 (assume @p5 (forall @t10 (= @t8 (forall @t11 (=> @t5 @t3))))) % 0.36/0.59 (assume @p6 (forall @t7 (tptp.subset @t4 @t4))) % 0.36/0.59 (assume @p7 (forall @t7 (= (tptp.empty @t4) (forall (@list @t1) (not (tptp.member @t1 @t4)))))) % 0.36/0.59 (assume @p8 (forall @t10 (= @t9 (forall @t11 (= @t5 @t3))))) % 0.36/0.59 (assume @p9 @t14) % 0.36/0.59 (assume @p10 true) % 0.36/0.59 (step @p11 :rule instantiate :premises (@p1) :args ((@list @t15 tptp.empty_set @t18))) % 0.36/0.59 (step @p12 :rule instantiate :premises (@p8) :args ((@list tptp.empty_set @t16))) % 0.36/0.59 (step @p13 :rule eq-symm :args (@t12 tptp.empty_set)) % 0.36/0.59 (step @p14 :rule cong :premises (@p13) :args (@t13)) % 0.36/0.59 (step @p15 :rule cong :premises (@p14) :args (@t14)) % 0.36/0.59 (step @p16 :rule eq_resolve :premises (@p9 @p15)) % 0.36/0.59 (step @p17 :rule skolemize :premises (@p16)) % 0.36/0.59 (step @p18 :rule cnf_equiv_pos2 :args (@t20)) % 0.36/0.59 (step @p19 :rule reordering :premises (@p18) :args ((or @t19 @t21 (not @t20)))) % 0.36/0.59 (step @p20 :rule chain_m_resolution :premises (@p19 @p17 @p12) :args (@t21 (@list true false) (@list @t19 @t20))) % 0.36/0.59 (step @p21 :rule skolemize :premises (@p20)) % 0.36/0.59 (step @p22 :rule instantiate :premises (@p2) :args ((@list @t18))) % 0.36/0.59 (step @p23 :rule cnf_equiv_neg1 :args (@t24)) % 0.36/0.59 (step @p24 :rule reordering :premises (@p23) :args ((or @t23 @t22 @t24))) % 0.36/0.59 (step @p25 :rule chain_m_resolution :premises (@p24 @p22 @p21) :args (@t22 (@list true true) (@list @t23 @t24))) % 0.36/0.59 (step @p26 :rule cnf_and_pos :args (@t25 1)) % 0.36/0.59 (step @p27 :rule reordering :premises (@p26) :args ((or @t23 @t26))) % 0.36/0.59 (step @p28 :rule chain_m_resolution :premises (@p27 @p22) :args (@t26 (@list true) (@list @t23))) % 0.36/0.59 (step @p29 :rule cnf_equiv_pos1 :args (@t27)) % 0.36/0.59 (step @p30 :rule reordering :premises (@p29) :args ((or (not @t22) @t25 (not @t27)))) % 0.36/0.59 (step @p31 false :rule chain_m_resolution :premises (@p30 @p28 @p25 @p11) :args (false (@list true false false) (@list @t25 @t22 @t27))) % 0.36/0.59 ) % 0.36/0.59 % SZS output end Proof % 0.36/0.59 % cvc5 exiting %------------------------------------------------------------------------------