%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET602+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 : n022.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:10 AM UTC 2026 % Result : Theorem 0.40s 0.56s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET602+3 : TPTP v9.2.1. Released v2.2.0. % 0.13/0.14 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.19/0.35 % Computer : n022.cluster.edu % 0.19/0.35 % Model : x86_64 x86_64 % 0.19/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.19/0.35 % Memory : 8042.1875MB % 0.19/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.19/0.35 % CPULimit : 300 % 0.19/0.35 % WCLimit : 300 % 0.19/0.35 % DateTime : Tue Jun 2 16:04:23 EDT 2026 % 0.19/0.35 % CPUTime : % 0.27/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.56 % SZS status Theorem % 0.40/0.56 % SZS output start Proof % 0.40/0.56 ( % 0.40/0.56 (declare-sort $$unsorted 0) % 0.40/0.56 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.difference (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.56 (declare-const tptp.empty_set $$unsorted) % 0.40/0.56 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (define @t1 () (@var "C" $$unsorted)) % 0.40/0.56 (define @t2 () (@var "B" $$unsorted)) % 0.40/0.56 (define @t3 () (tptp.subset @t2 @t1)) % 0.40/0.56 (define @t4 () (tptp.difference @t2 @t1)) % 0.40/0.56 (define @t5 () (= (= @t4 tptp.empty_set) @t3)) % 0.40/0.56 (define @t6 () (@list @t2 @t1)) % 0.40/0.56 (define @t7 () (forall @t6 @t5)) % 0.40/0.56 (define @t8 () (@list @t2)) % 0.40/0.56 (define @t9 () (@var "D" $$unsorted)) % 0.40/0.56 (define @t10 () (tptp.member @t9 @t1)) % 0.40/0.56 (define @t11 () (tptp.member @t9 @t2)) % 0.40/0.56 (define @t12 () (forall @t6 (= (= @t2 @t1) (and @t3 (tptp.subset @t1 @t2))))) % 0.40/0.56 (define @t13 () (tptp.difference @t2 @t2)) % 0.40/0.56 (define @t14 () (forall @t8 (= @t13 tptp.empty_set))) % 0.40/0.56 (define @t15 () (not @t14)) % 0.40/0.56 (define @t16 () (= tptp.empty_set @t4)) % 0.40/0.56 (define @t17 () (@quantifiers_skolemize (forall @t8 (= tptp.empty_set @t13)) 0)) % 0.40/0.56 (define @t18 () (tptp.subset @t17 @t17)) % 0.40/0.56 (define @t19 () (= tptp.empty_set (tptp.difference @t17 @t17))) % 0.40/0.56 (define @t20 () (forall @t6 (= @t3 @t16))) % 0.40/0.56 (define @t21 () (= @t18 @t19)) % 0.40/0.56 (define @t22 () (@list @t17 @t17)) % 0.40/0.56 (define @t23 () (= @t19 @t18)) % 0.40/0.56 (define @t24 () (not @t18)) % 0.40/0.56 (define @t25 () (@list true false)) % 0.40/0.56 (define @t26 () (and @t18 @t18)) % 0.40/0.56 (define @t27 () (= (= @t17 @t17) @t26)) % 0.40/0.56 (assume @p1 @t7) % 0.40/0.56 (assume @p2 (forall @t8 (not (tptp.member @t2 tptp.empty_set)))) % 0.40/0.56 (assume @p3 (forall (@list @t2 @t1 @t9) (= (tptp.member @t9 @t4) (and @t11 (not @t10))))) % 0.40/0.56 (assume @p4 @t12) % 0.40/0.56 (assume @p5 (forall @t6 (= @t3 (forall (@list @t9) (=> @t11 @t10))))) % 0.40/0.56 (assume @p6 (forall @t8 (tptp.subset @t2 @t2))) % 0.40/0.56 (assume @p7 (forall @t8 (= (tptp.empty @t2) (forall (@list @t1) (not (tptp.member @t1 @t2)))))) % 0.40/0.56 (assume @p8 @t15) % 0.40/0.56 (assume @p9 true) % 0.40/0.56 (step @p10 :rule eq-symm :args (@t16 @t3)) % 0.40/0.56 (step @p11 :rule refl :args (@t3)) % 0.40/0.56 (step @p12 :rule eq-symm :args (@t4 tptp.empty_set)) % 0.40/0.56 (step @p13 :rule cong :premises (@p12 @p11) :args (@t5)) % 0.40/0.56 (step @p14 :rule trans :premises (@p13 @p10)) % 0.40/0.56 (step @p15 :rule cong :premises (@p14) :args (@t7)) % 0.40/0.56 (step @p16 :rule eq_resolve :premises (@p1 @p15)) % 0.40/0.56 (step @p17 :rule eq-symm :args (@t18 @t19)) % 0.40/0.56 (step @p18 :rule refl :args (@t20)) % 0.40/0.56 (step @p19 :rule cong :premises (@p18 @p17) :args ((=> @t20 @t21))) % 0.40/0.56 (assume-push @p51 @t20) % 0.40/0.56 (step @p21 :rule instantiate :premises (@p16) :args (@t22)) % 0.40/0.56 (step-pop @p52 :rule scope :premises (@p21)) % 0.40/0.56 (step @p22 :rule process_scope :premises (@p52) :args (@t21)) % 0.40/0.56 (step @p24 :rule eq_resolve :premises (@p22 @p19)) % 0.40/0.56 (step @p25 :rule implies_elim :premises (@p24)) % 0.40/0.56 (step @p26 :rule chain_m_resolution :premises (@p25 @p16) :args (@t23 (@list false) (@list @t20))) % 0.40/0.56 (step @p27 :rule eq-symm :args (@t13 tptp.empty_set)) % 0.40/0.56 (step @p28 :rule cong :premises (@p27) :args (@t14)) % 0.40/0.56 (step @p29 :rule cong :premises (@p28) :args (@t15)) % 0.40/0.56 (step @p30 :rule eq_resolve :premises (@p8 @p29)) % 0.40/0.56 (step @p31 :rule skolemize :premises (@p30)) % 0.40/0.56 (step @p32 :rule cnf_equiv_pos2 :args (@t23)) % 0.40/0.56 (step @p33 :rule reordering :premises (@p32) :args ((or @t19 @t24 (not @t23)))) % 0.40/0.56 (step @p34 :rule chain_m_resolution :premises (@p33 @p31 @p26) :args (@t24 @t25 (@list @t19 @t23))) % 0.40/0.56 (step @p35 :rule bool-eq-true :args (@t18)) % 0.40/0.56 (step @p36 :rule eq-symm :args (true @t18)) % 0.40/0.56 (step @p37 :rule trans :premises (@p36 @p35)) % 0.40/0.56 (step @p38 :rule aci_norm :args ((= @t26 @t18))) % 0.40/0.56 (step @p39 :rule eq-refl :args (@t17)) % 0.40/0.56 (step @p40 :rule cong :premises (@p39 @p38) :args (@t27)) % 0.40/0.56 (step @p41 :rule trans :premises (@p40 @p37)) % 0.40/0.56 (step @p42 :rule refl :args (@t12)) % 0.40/0.56 (step @p43 :rule cong :premises (@p42 @p41) :args ((=> @t12 @t27))) % 0.40/0.56 (assume-push @p53 @t12) % 0.40/0.56 (step @p45 :rule instantiate :premises (@p4) :args (@t22)) % 0.40/0.56 (step-pop @p54 :rule scope :premises (@p45)) % 0.40/0.56 (step @p46 :rule process_scope :premises (@p54) :args (@t27)) % 0.40/0.56 (step @p48 :rule eq_resolve :premises (@p46 @p43)) % 0.40/0.56 (step @p49 :rule implies_elim :premises (@p48)) % 0.40/0.57 (step @p50 false :rule chain_m_resolution :premises (@p49 @p34 @p4) :args (false @t25 (@list @t18 @t12))) % 0.40/0.57 ) % 0.40/0.57 % SZS output end Proof % 0.40/0.57 % cvc5 exiting %------------------------------------------------------------------------------