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