%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET583+3 : 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 : n016.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:06 AM UTC 2026 % Result : Theorem 0.31s 0.55s % Output : Proof 0.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET583+3 : TPTP v9.2.1. Released v2.2.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n016.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Jun 2 16:03:54 EDT 2026 % 0.16/0.34 % CPUTime : % 0.31/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.31/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.31/0.55 % SZS status Theorem % 0.31/0.55 % SZS output start Proof % 0.31/0.55 ( % 0.31/0.55 (declare-sort $$unsorted 0) % 0.31/0.55 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.31/0.55 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.31/0.55 (define @t1 () (@var "B" $$unsorted)) % 0.31/0.55 (define @t2 () (@var "C" $$unsorted)) % 0.31/0.55 (define @t3 () (tptp.subset @t2 @t1)) % 0.31/0.55 (define @t4 () (tptp.subset @t1 @t2)) % 0.31/0.55 (define @t5 () (and @t4 @t3)) % 0.31/0.55 (define @t6 () (= @t1 @t2)) % 0.31/0.55 (define @t7 () (@list @t1 @t2)) % 0.31/0.55 (define @t8 () (@var "D" $$unsorted)) % 0.31/0.55 (define @t9 () (forall @t7 (=> @t5 @t6))) % 0.31/0.55 (define @t10 () (not @t9)) % 0.31/0.55 (define @t11 () (not @t3)) % 0.31/0.55 (define @t12 () (not @t4)) % 0.31/0.55 (define @t13 () (or @t12 @t11 @t6)) % 0.31/0.55 (define @t14 () (forall @t7 @t13)) % 0.31/0.55 (define @t15 () (@quantifiers_skolemize @t14 1)) % 0.31/0.55 (define @t16 () (@quantifiers_skolemize @t14 0)) % 0.31/0.55 (define @t17 () (= @t16 @t15)) % 0.31/0.55 (define @t18 () (tptp.subset @t15 @t16)) % 0.31/0.55 (define @t19 () (not @t18)) % 0.31/0.55 (define @t20 () (tptp.subset @t16 @t15)) % 0.31/0.55 (define @t21 () (not @t20)) % 0.31/0.55 (define @t22 () (or @t21 @t19 @t17)) % 0.31/0.55 (define @t23 () (@list true)) % 0.31/0.55 (define @t24 () (@list @t22)) % 0.31/0.55 (define @t25 () (and @t20 @t18)) % 0.31/0.55 (define @t26 () (= @t17 @t25)) % 0.31/0.55 (assume @p1 (forall @t7 (= @t6 @t5))) % 0.31/0.55 (assume @p2 (forall @t7 (= @t4 (forall (@list @t8) (=> (tptp.member @t8 @t1) (tptp.member @t8 @t2)))))) % 0.31/0.55 (assume @p3 (forall (@list @t1) (tptp.subset @t1 @t1))) % 0.31/0.55 (assume @p4 @t10) % 0.31/0.55 (assume @p5 true) % 0.31/0.55 (step @p6 :rule aci_norm :args ((= (or (or @t12 @t11) @t6) @t13))) % 0.31/0.55 (step @p7 :rule refl :args (@t6)) % 0.31/0.55 (step @p8 :rule bool-and-de-morgan :args (@t4 @t3 true)) % 0.31/0.55 (step @p9 :rule nary_cong :premises (@p8 @p7) :args ((or (not @t5) @t6))) % 0.31/0.55 (step @p10 :rule trans :premises (@p9 @p6)) % 0.31/0.55 (step @p11 :rule bool-impl-elim :args (@t5 @t6)) % 0.31/0.55 (step @p12 :rule trans :premises (@p11 @p10)) % 0.31/0.55 (step @p13 :rule cong :premises (@p12) :args (@t9)) % 0.31/0.55 (step @p14 :rule cong :premises (@p13) :args (@t10)) % 0.31/0.55 (step @p15 :rule eq_resolve :premises (@p4 @p14)) % 0.31/0.55 (step @p16 :rule skolemize :premises (@p15)) % 0.31/0.55 (step @p17 :rule cnf_or_neg :args (@t22 2)) % 0.31/0.55 (step @p18 :rule chain_m_resolution :premises (@p17 @p16) :args ((not @t17) @t23 @t24)) % 0.31/0.55 (step @p19 :rule bool-double-not-elim :args (@t18)) % 0.31/0.55 (step @p20 :rule refl :args (@t22)) % 0.31/0.55 (step @p21 :rule nary_cong :premises (@p20 @p19) :args ((or @t22 (not @t19)))) % 0.31/0.55 (step @p22 :rule cnf_or_neg :args (@t22 1)) % 0.31/0.55 (step @p23 :rule eq_resolve :premises (@p22 @p21)) % 0.31/0.55 (step @p24 :rule reordering :premises (@p23) :args ((or @t18 @t22))) % 0.31/0.55 (step @p25 :rule chain_m_resolution :premises (@p24 @p16) :args (@t18 @t23 @t24)) % 0.31/0.55 (step @p26 :rule bool-double-not-elim :args (@t20)) % 0.31/0.55 (step @p27 :rule nary_cong :premises (@p20 @p26) :args ((or @t22 (not @t21)))) % 0.31/0.55 (step @p28 :rule cnf_or_neg :args (@t22 0)) % 0.31/0.55 (step @p29 :rule eq_resolve :premises (@p28 @p27)) % 0.31/0.55 (step @p30 :rule reordering :premises (@p29) :args ((or @t20 @t22))) % 0.31/0.55 (step @p31 :rule chain_m_resolution :premises (@p30 @p16) :args (@t20 @t23 @t24)) % 0.31/0.55 (step @p32 :rule cnf_and_neg :args (@t25)) % 0.31/0.55 (step @p33 :rule reordering :premises (@p32) :args ((or @t21 @t19 @t25))) % 0.31/0.55 (step @p34 :rule chain_m_resolution :premises (@p33 @p31 @p25) :args (@t25 (@list false false) (@list @t20 @t18))) % 0.31/0.55 (step @p35 :rule instantiate :premises (@p1) :args ((@list @t16 @t15))) % 0.31/0.55 (step @p36 :rule cnf_equiv_pos2 :args (@t26)) % 0.31/0.55 (step @p37 :rule reordering :premises (@p36) :args ((or @t17 (not @t25) (not @t26)))) % 0.31/0.55 (step @p38 false :rule chain_m_resolution :premises (@p37 @p35 @p34 @p18) :args (false (@list false false true) (@list @t26 @t25 @t17))) % 0.31/0.55 ) % 0.31/0.55 % SZS output end Proof % 0.31/0.55 % cvc5 exiting %------------------------------------------------------------------------------