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