%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET619+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 : n005.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:15 AM UTC 2026 % Result : Theorem 0.40s 0.57s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SET619+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 : n005.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:05:03 EDT 2026 % 0.19/0.35 % CPUTime : % 0.33/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.57 % SZS status Theorem % 0.40/0.57 % SZS output start Proof % 0.40/0.57 ( % 0.40/0.57 (declare-sort $$unsorted 0) % 0.40/0.57 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.57 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.40/0.57 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.57 (declare-const tptp.symmetric_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.57 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.57 (declare-const tptp.difference (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.57 (define @t1 () (@var "B" $$unsorted)) % 0.40/0.57 (define @t2 () (@var "C" $$unsorted)) % 0.40/0.57 (define @t3 () (tptp.difference @t1 @t2)) % 0.40/0.57 (define @t4 () (tptp.symmetric_difference @t1 @t2)) % 0.40/0.57 (define @t5 () (@list @t1 @t2)) % 0.40/0.57 (define @t6 () (@var "D" $$unsorted)) % 0.40/0.57 (define @t7 () (tptp.union @t1 @t2)) % 0.40/0.57 (define @t8 () (@list @t1 @t2 @t6)) % 0.40/0.57 (define @t9 () (forall @t8 (= (tptp.union @t7 @t6) (tptp.union @t1 (tptp.union @t2 @t6))))) % 0.40/0.57 (define @t10 () (tptp.intersection @t1 @t2)) % 0.40/0.57 (define @t11 () (tptp.union @t1 @t10)) % 0.40/0.57 (define @t12 () (forall @t5 (= @t11 @t1))) % 0.40/0.57 (define @t13 () (tptp.union @t10 @t3)) % 0.40/0.57 (define @t14 () (forall @t5 (= @t13 @t1))) % 0.40/0.57 (define @t15 () (tptp.member @t6 @t2)) % 0.40/0.57 (define @t16 () (tptp.member @t6 @t1)) % 0.40/0.57 (define @t17 () (tptp.subset @t1 @t2)) % 0.40/0.57 (define @t18 () (= @t1 @t2)) % 0.40/0.57 (define @t19 () (@list @t6)) % 0.40/0.57 (define @t20 () (forall @t5 (= @t7 (tptp.union @t4 @t10)))) % 0.40/0.57 (define @t21 () (@quantifiers_skolemize @t20 1)) % 0.40/0.57 (define @t22 () (@quantifiers_skolemize @t20 0)) % 0.40/0.57 (define @t23 () (tptp.intersection @t22 @t21)) % 0.40/0.57 (define @t24 () (@list @t22 @t21)) % 0.40/0.57 (define @t25 () (@list @t21 @t22)) % 0.40/0.57 (define @t26 () (tptp.difference @t22 @t21)) % 0.40/0.57 (define @t27 () (tptp.difference @t21 @t22)) % 0.40/0.57 (define @t28 () (tptp.intersection @t21 @t22)) % 0.40/0.57 (define @t29 () (tptp.union @t28 (tptp.union @t27 @t26))) % 0.40/0.57 (define @t30 () (tptp.union (tptp.union @t28 @t27) @t26)) % 0.40/0.57 (define @t31 () (= @t30 @t29)) % 0.40/0.57 (assume @p1 (forall @t5 (= @t4 (tptp.union @t3 (tptp.difference @t2 @t1))))) % 0.40/0.57 (assume @p2 @t9) % 0.40/0.57 (assume @p3 @t12) % 0.40/0.57 (assume @p4 @t14) % 0.40/0.57 (assume @p5 (forall @t8 (= (tptp.member @t6 @t7) (or @t16 @t15)))) % 0.40/0.57 (assume @p6 (forall @t8 (= (tptp.member @t6 @t10) (and @t16 @t15)))) % 0.40/0.57 (assume @p7 (forall @t5 (= @t18 (and @t17 (tptp.subset @t2 @t1))))) % 0.40/0.57 (assume @p8 (forall @t5 (= @t7 (tptp.union @t2 @t1)))) % 0.40/0.57 (assume @p9 (forall @t5 (= @t10 (tptp.intersection @t2 @t1)))) % 0.40/0.57 (assume @p10 (forall @t5 (= @t4 (tptp.symmetric_difference @t2 @t1)))) % 0.40/0.57 (assume @p11 (forall @t5 (= @t18 (forall @t19 (= @t16 @t15))))) % 0.40/0.57 (assume @p12 (forall @t5 (= @t17 (forall @t19 (=> @t16 @t15))))) % 0.40/0.57 (assume @p13 (forall (@list @t1) (tptp.subset @t1 @t1))) % 0.40/0.57 (assume @p14 (not @t20)) % 0.40/0.57 (assume @p15 true) % 0.40/0.57 (step @p16 :rule skolemize :premises (@p14)) % 0.40/0.57 (step @p17 :rule false_intro :premises (@p16)) % 0.40/0.57 (step @p18 :rule instantiate :premises (@p8) :args ((@list (tptp.symmetric_difference @t22 @t21) @t23))) % 0.40/0.57 (step @p19 :rule symm :premises (@p18)) % 0.40/0.57 (step @p20 :rule instantiate :premises (@p10) :args (@t24)) % 0.40/0.57 (step @p21 :rule symm :premises (@p20)) % 0.40/0.57 (step @p22 :rule instantiate :premises (@p1) :args (@t25)) % 0.40/0.57 (step @p23 :rule symm :premises (@p22)) % 0.40/0.57 (step @p24 :rule trans :premises (@p23 @p21)) % 0.40/0.57 (step @p25 :rule instantiate :premises (@p9) :args (@t24)) % 0.40/0.57 (step @p26 :rule symm :premises (@p25)) % 0.40/0.57 (step @p27 :rule cong :premises (@p26 @p24) :args (@t29)) % 0.40/0.57 (step @p28 :rule trans :premises (@p27 @p19)) % 0.40/0.57 (step @p29 :rule instantiate :premises (@p8) :args (@t24)) % 0.40/0.57 (step @p30 :rule symm :premises (@p29)) % 0.40/0.57 (step @p31 :rule eq-symm :args (@t13 @t1)) % 0.40/0.57 (step @p32 :rule cong :premises (@p31) :args (@t14)) % 0.40/0.57 (step @p33 :rule eq_resolve :premises (@p4 @p32)) % 0.40/0.57 (step @p34 :rule instantiate :premises (@p33) :args (@t24)) % 0.40/0.57 (step @p35 :rule symm :premises (@p34)) % 0.40/0.57 (step @p36 :rule refl :args (@t21)) % 0.40/0.57 (step @p37 :rule cong :premises (@p36 @p35) :args ((tptp.union @t21 (tptp.union @t23 @t26)))) % 0.40/0.57 (step @p38 :rule instantiate :premises (@p2) :args ((@list @t21 @t23 @t26))) % 0.40/0.57 (step @p39 :rule refl :args (@t26)) % 0.40/0.57 (step @p40 :rule cong :premises (@p36 @p26) :args ((tptp.union @t21 @t28))) % 0.40/0.57 (step @p41 :rule eq-symm :args (@t11 @t1)) % 0.40/0.57 (step @p42 :rule cong :premises (@p41) :args (@t12)) % 0.40/0.58 (step @p43 :rule eq_resolve :premises (@p3 @p42)) % 0.40/0.58 (step @p44 :rule instantiate :premises (@p43) :args (@t25)) % 0.40/0.58 (step @p45 :rule instantiate :premises (@p33) :args (@t25)) % 0.40/0.58 (step @p46 :rule symm :premises (@p45)) % 0.40/0.58 (step @p47 :rule trans :premises (@p46 @p44 @p40)) % 0.40/0.58 (step @p48 :rule cong :premises (@p47 @p39) :args (@t30)) % 0.40/0.58 (step @p49 :rule trans :premises (@p48 @p38 @p37 @p30)) % 0.40/0.58 (step @p50 :rule cong :premises (@p49 @p28) :args (@t31)) % 0.40/0.58 (step @p51 :rule trans :premises (@p50 @p17)) % 0.40/0.58 (step @p52 :rule false_elim :premises (@p51)) % 0.40/0.58 (assume-push @p59 @t9) % 0.40/0.58 (step @p54 :rule instantiate :premises (@p2) :args ((@list @t28 @t27 @t26))) % 0.40/0.58 (step-pop @p60 :rule scope :premises (@p54)) % 0.40/0.58 (step @p55 :rule process_scope :premises (@p60) :args (@t31)) % 0.40/0.58 (step @p57 :rule implies_elim :premises (@p55)) % 0.40/0.58 (step @p58 false :rule chain_m_resolution :premises (@p57 @p52 @p2) :args (false (@list true false) (@list @t31 @t9))) % 0.40/0.58 ) % 0.40/0.58 % SZS output end Proof % 0.40/0.58 % cvc5 exiting %------------------------------------------------------------------------------