%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET366+4 : 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 : n012.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:51 AM UTC 2026 % Result : Theorem 0.13s 0.38s % Output : Proof 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.06 % Problem : SET366+4 : TPTP v9.2.1. Released v2.2.0. % 0.00/0.07 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.08/0.27 % Computer : n012.cluster.edu % 0.08/0.27 % Model : x86_64 x86_64 % 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.27 % Memory : 8042.1875MB % 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.27 % CPULimit : 300 % 0.08/0.27 % WCLimit : 300 % 0.08/0.27 % DateTime : Tue Jun 2 15:32:18 EDT 2026 % 0.08/0.27 % CPUTime : % 0.13/0.34 %----Proving TF0_NAR, FOF, or CNF % 0.13/0.38 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.13/0.38 % SZS status Theorem % 0.13/0.38 % SZS output start Proof % 0.13/0.38 ( % 0.13/0.38 (declare-sort $$unsorted 0) % 0.13/0.38 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.13/0.38 (declare-const tptp.difference (-> $$unsorted $$unsorted $$unsorted)) % 0.13/0.38 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.13/0.38 (declare-const tptp.product (-> $$unsorted $$unsorted)) % 0.13/0.38 (declare-const tptp.empty_set $$unsorted) % 0.13/0.38 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.13/0.38 (declare-const tptp.power_set (-> $$unsorted $$unsorted)) % 0.13/0.38 (declare-const tptp.equal_set (-> $$unsorted $$unsorted Bool)) % 0.13/0.38 (declare-const tptp.sum (-> $$unsorted $$unsorted)) % 0.13/0.38 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.13/0.38 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.13/0.38 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.13/0.38 (define @t1 () (@var "B" $$unsorted)) % 0.13/0.38 (define @t2 () (@var "X" $$unsorted)) % 0.13/0.38 (define @t3 () (tptp.member @t2 @t1)) % 0.13/0.38 (define @t4 () (@var "A" $$unsorted)) % 0.13/0.38 (define @t5 () (tptp.member @t2 @t4)) % 0.13/0.38 (define @t6 () (@list @t2)) % 0.13/0.38 (define @t7 () (forall @t6 (=> @t5 @t3))) % 0.13/0.38 (define @t8 () (tptp.subset @t4 @t1)) % 0.13/0.38 (define @t9 () (= @t8 @t7)) % 0.13/0.38 (define @t10 () (@list @t4 @t1)) % 0.13/0.38 (define @t11 () (forall @t10 @t9)) % 0.13/0.38 (define @t12 () (tptp.power_set @t4)) % 0.13/0.38 (define @t13 () (@list @t2 @t4)) % 0.13/0.38 (define @t14 () (@list @t2 @t4 @t1)) % 0.13/0.38 (define @t15 () (not (tptp.member @t2 tptp.empty_set))) % 0.13/0.38 (define @t16 () (forall @t6 @t15)) % 0.13/0.38 (define @t17 () (@var "E" $$unsorted)) % 0.13/0.38 (define @t18 () (= @t2 @t4)) % 0.13/0.38 (define @t19 () (@var "Y" $$unsorted)) % 0.13/0.38 (define @t20 () (tptp.member @t2 @t19)) % 0.13/0.38 (define @t21 () (tptp.member @t19 @t4)) % 0.13/0.38 (define @t22 () (@list @t19)) % 0.13/0.38 (define @t23 () (forall (@list @t4) (tptp.member tptp.empty_set @t12))) % 0.13/0.38 (define @t24 () (@quantifiers_skolemize @t23 0)) % 0.13/0.38 (define @t25 () (@list tptp.empty_set @t24)) % 0.13/0.38 (define @t26 () (tptp.subset tptp.empty_set @t24)) % 0.13/0.38 (define @t27 () (tptp.member tptp.empty_set (tptp.power_set @t24))) % 0.13/0.38 (define @t28 () (= @t27 @t26)) % 0.13/0.38 (define @t29 () (not @t26)) % 0.13/0.38 (define @t30 () (@list true false)) % 0.13/0.38 (define @t31 () (forall @t6 (or @t15 (tptp.member @t2 @t24)))) % 0.13/0.38 (define @t32 () (= @t26 @t31)) % 0.13/0.38 (define @t33 () (not @t31)) % 0.13/0.38 (define @t34 () (@quantifiers_skolemize @t31 0)) % 0.13/0.38 (define @t35 () (tptp.member @t34 tptp.empty_set)) % 0.13/0.38 (define @t36 () (not @t35)) % 0.13/0.38 (define @t37 () (or @t36 (tptp.member @t34 @t24))) % 0.13/0.38 (assume @p1 @t11) % 0.13/0.38 (assume @p2 (forall @t10 (= (tptp.equal_set @t4 @t1) (and @t8 (tptp.subset @t1 @t4))))) % 0.13/0.38 (assume @p3 (forall @t13 (= (tptp.member @t2 @t12) (tptp.subset @t2 @t4)))) % 0.13/0.38 (assume @p4 (forall @t14 (= (tptp.member @t2 (tptp.intersection @t4 @t1)) (and @t5 @t3)))) % 0.13/0.38 (assume @p5 (forall @t14 (= (tptp.member @t2 (tptp.union @t4 @t1)) (or @t5 @t3)))) % 0.13/0.38 (assume @p6 @t16) % 0.13/0.38 (assume @p7 (forall (@list @t1 @t4 @t17) (= (tptp.member @t1 (tptp.difference @t17 @t4)) (and (tptp.member @t1 @t17) (not (tptp.member @t1 @t4)))))) % 0.13/0.38 (assume @p8 (forall @t13 (= (tptp.member @t2 (tptp.singleton @t4)) @t18))) % 0.13/0.38 (assume @p9 (forall @t14 (= (tptp.member @t2 (tptp.unordered_pair @t4 @t1)) (or @t18 (= @t2 @t1))))) % 0.13/0.38 (assume @p10 (forall @t13 (= (tptp.member @t2 (tptp.sum @t4)) (exists @t22 (and @t21 @t20))))) % 0.13/0.38 (assume @p11 (forall @t13 (= (tptp.member @t2 (tptp.product @t4)) (forall @t22 (=> @t21 @t20))))) % 0.13/0.38 (assume @p12 (not @t23)) % 0.13/0.38 (assume @p13 true) % 0.13/0.38 (step @p14 :rule bool-impl-elim :args (@t5 @t3)) % 0.13/0.38 (step @p15 :rule cong :premises (@p14) :args (@t7)) % 0.13/0.38 (step @p16 :rule refl :args (@t8)) % 0.13/0.38 (step @p17 :rule cong :premises (@p16 @p15) :args (@t9)) % 0.13/0.38 (step @p18 :rule cong :premises (@p17) :args (@t11)) % 0.13/0.38 (step @p19 :rule eq_resolve :premises (@p1 @p18)) % 0.13/0.38 (step @p20 :rule instantiate :premises (@p19) :args (@t25)) % 0.13/0.38 (step @p21 :rule instantiate :premises (@p3) :args (@t25)) % 0.13/0.38 (step @p22 :rule skolemize :premises (@p12)) % 0.13/0.38 (step @p23 :rule cnf_equiv_pos2 :args (@t28)) % 0.13/0.38 (step @p24 :rule reordering :premises (@p23) :args ((or @t27 @t29 (not @t28)))) % 0.13/0.38 (step @p25 :rule chain_m_resolution :premises (@p24 @p22 @p21) :args (@t29 @t30 (@list @t27 @t28))) % 0.13/0.38 (step @p26 :rule cnf_equiv_pos2 :args (@t32)) % 0.13/0.38 (step @p27 :rule reordering :premises (@p26) :args ((or @t26 @t33 (not @t32)))) % 0.13/0.38 (step @p28 :rule chain_m_resolution :premises (@p27 @p25 @p20) :args (@t33 @t30 (@list @t26 @t32))) % 0.13/0.38 (step @p29 :rule skolemize :premises (@p28)) % 0.13/0.38 (step @p30 :rule bool-double-not-elim :args (@t35)) % 0.13/0.38 (step @p31 :rule refl :args (@t37)) % 0.13/0.38 (step @p32 :rule nary_cong :premises (@p31 @p30) :args ((or @t37 (not @t36)))) % 0.13/0.38 (step @p33 :rule cnf_or_neg :args (@t37 0)) % 0.13/0.38 (step @p34 :rule eq_resolve :premises (@p33 @p32)) % 0.13/0.38 (step @p35 :rule reordering :premises (@p34) :args ((or @t35 @t37))) % 0.13/0.38 (step @p36 :rule chain_m_resolution :premises (@p35 @p29) :args (@t35 (@list true) (@list @t37))) % 0.13/0.38 (assume-push @p43 @t16) % 0.13/0.38 (step @p38 :rule instantiate :premises (@p6) :args ((@list @t34))) % 0.13/0.38 (step-pop @p44 :rule scope :premises (@p38)) % 0.13/0.38 (step @p39 :rule process_scope :premises (@p44) :args (@t36)) % 0.13/0.38 (step @p41 :rule implies_elim :premises (@p39)) % 0.13/0.38 (step @p42 false :rule chain_m_resolution :premises (@p41 @p36 @p6) :args (false (@list false false) (@list @t35 @t16))) % 0.13/0.38 ) % 0.13/0.38 % SZS output end Proof % 0.13/0.38 % cvc5 exiting %------------------------------------------------------------------------------