%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET638+3 : 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 : n008.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:20 AM UTC 2026 % Result : Theorem 0.40s 0.60s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SET638+3 : TPTP v9.2.1. Released v2.2.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.35 % Computer : n008.cluster.edu % 0.16/0.35 % Model : x86_64 x86_64 % 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.35 % Memory : 8042.1875MB % 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.35 % CPULimit : 300 % 0.16/0.35 % WCLimit : 300 % 0.16/0.35 % DateTime : Tue Jun 2 16:05:48 EDT 2026 % 0.16/0.35 % CPUTime : % 0.32/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.60 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.60 % SZS status Theorem % 0.40/0.60 % SZS output start Proof % 0.40/0.60 ( % 0.40/0.60 (declare-sort $$unsorted 0) % 0.40/0.60 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.40/0.60 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.40/0.60 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.60 (declare-const tptp.empty_set $$unsorted) % 0.40/0.60 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.60 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.60 (define @t1 () (@var "B" $$unsorted)) % 0.40/0.60 (define @t2 () (@var "C" $$unsorted)) % 0.40/0.60 (define @t3 () (tptp.intersection @t1 @t2)) % 0.40/0.60 (define @t4 () (@list @t1 @t2)) % 0.40/0.60 (define @t5 () (tptp.subset @t1 @t2)) % 0.40/0.60 (define @t6 () (=> @t5 (= @t3 @t1))) % 0.40/0.60 (define @t7 () (forall @t4 @t6)) % 0.40/0.60 (define @t8 () (tptp.union @t1 tptp.empty_set)) % 0.40/0.60 (define @t9 () (@list @t1)) % 0.40/0.60 (define @t10 () (forall @t9 (= @t8 @t1))) % 0.40/0.60 (define @t11 () (@var "D" $$unsorted)) % 0.40/0.60 (define @t12 () (tptp.intersection @t1 @t11)) % 0.40/0.60 (define @t13 () (tptp.union @t2 @t11)) % 0.40/0.60 (define @t14 () (@list @t1 @t2 @t11)) % 0.40/0.60 (define @t15 () (tptp.member @t11 @t2)) % 0.40/0.60 (define @t16 () (tptp.member @t11 @t1)) % 0.40/0.60 (define @t17 () (tptp.union @t1 @t2)) % 0.40/0.60 (define @t18 () (@list @t11)) % 0.40/0.60 (define @t19 () (= @t1 @t2)) % 0.40/0.60 (define @t20 () (tptp.subset @t1 @t13)) % 0.40/0.60 (define @t21 () (and @t20 (= @t12 tptp.empty_set))) % 0.40/0.60 (define @t22 () (=> @t21 @t5)) % 0.40/0.60 (define @t23 () (forall @t14 @t22)) % 0.40/0.60 (define @t24 () (not @t23)) % 0.40/0.60 (define @t25 () (= tptp.empty_set @t12)) % 0.40/0.60 (define @t26 () (not @t25)) % 0.40/0.60 (define @t27 () (not @t20)) % 0.40/0.60 (define @t28 () (or @t27 @t26 @t5)) % 0.40/0.60 (define @t29 () (forall @t14 @t28)) % 0.40/0.60 (define @t30 () (@quantifiers_skolemize @t29 0)) % 0.40/0.60 (define @t31 () (@quantifiers_skolemize @t29 1)) % 0.40/0.60 (define @t32 () (tptp.intersection @t30 @t31)) % 0.40/0.60 (define @t33 () (and @t20 @t25)) % 0.40/0.60 (define @t34 () (@quantifiers_skolemize @t29 2)) % 0.40/0.60 (define @t35 () (tptp.intersection @t30 @t34)) % 0.40/0.60 (define @t36 () (= tptp.empty_set @t35)) % 0.40/0.60 (define @t37 () (tptp.subset @t30 @t31)) % 0.40/0.60 (define @t38 () (not @t36)) % 0.40/0.60 (define @t39 () (tptp.union @t31 @t34)) % 0.40/0.60 (define @t40 () (tptp.subset @t30 @t39)) % 0.40/0.60 (define @t41 () (not @t40)) % 0.40/0.60 (define @t42 () (or @t41 @t38 @t37)) % 0.40/0.60 (define @t43 () (@list true)) % 0.40/0.60 (define @t44 () (@list @t42)) % 0.40/0.60 (define @t45 () (= @t1 @t3)) % 0.40/0.60 (define @t46 () (= @t30 (tptp.intersection @t30 @t39))) % 0.40/0.60 (define @t47 () (or @t41 @t46)) % 0.40/0.60 (assume @p1 (forall @t4 (tptp.subset @t3 @t1))) % 0.40/0.60 (assume @p2 @t7) % 0.40/0.60 (assume @p3 @t10) % 0.40/0.60 (assume @p4 (forall @t14 (= (tptp.intersection @t1 @t13) (tptp.union @t3 @t12)))) % 0.40/0.60 (assume @p5 (forall @t14 (= (tptp.member @t11 @t17) (or @t16 @t15)))) % 0.40/0.60 (assume @p6 (forall @t9 (not (tptp.member @t1 tptp.empty_set)))) % 0.40/0.60 (assume @p7 (forall @t14 (= (tptp.member @t11 @t3) (and @t16 @t15)))) % 0.40/0.60 (assume @p8 (forall @t4 (= @t5 (forall @t18 (=> @t16 @t15))))) % 0.40/0.60 (assume @p9 (forall @t4 (= @t19 (and @t5 (tptp.subset @t2 @t1))))) % 0.40/0.60 (assume @p10 (forall @t4 (= @t17 (tptp.union @t2 @t1)))) % 0.40/0.60 (assume @p11 (forall @t4 (= @t3 (tptp.intersection @t2 @t1)))) % 0.40/0.60 (assume @p12 (forall @t9 (tptp.subset @t1 @t1))) % 0.40/0.60 (assume @p13 (forall @t9 (= (tptp.empty @t1) (forall (@list @t2) (not (tptp.member @t2 @t1)))))) % 0.40/0.60 (assume @p14 (forall @t4 (= @t19 (forall @t18 (= @t16 @t15))))) % 0.40/0.60 (assume @p15 @t24) % 0.40/0.60 (assume @p16 true) % 0.40/0.60 (step @p17 :rule evaluate :args ((= false true))) % 0.40/0.60 (step @p18 :rule instantiate :premises (@p1) :args ((@list @t31 @t30))) % 0.40/0.60 (step @p19 :rule true_intro :premises (@p18)) % 0.40/0.60 (step @p20 :rule refl :args (@t31)) % 0.40/0.60 (step @p21 :rule instantiate :premises (@p11) :args ((@list @t30 @t31))) % 0.40/0.60 (step @p22 :rule eq-symm :args (@t8 @t1)) % 0.40/0.60 (step @p23 :rule cong :premises (@p22) :args (@t10)) % 0.40/0.60 (step @p24 :rule eq_resolve :premises (@p3 @p23)) % 0.40/0.60 (step @p25 :rule instantiate :premises (@p24) :args ((@list @t32))) % 0.40/0.60 (step @p26 :rule symm :premises (@p25)) % 0.40/0.60 (step @p27 :rule aci_norm :args ((= (or (or @t27 @t26) @t5) @t28))) % 0.40/0.60 (step @p28 :rule refl :args (@t5)) % 0.40/0.60 (step @p29 :rule bool-and-de-morgan :args (@t20 @t25 true)) % 0.40/0.60 (step @p30 :rule nary_cong :premises (@p29 @p28) :args ((or (not @t33) @t5))) % 0.40/0.60 (step @p31 :rule trans :premises (@p30 @p27)) % 0.40/0.60 (step @p32 :rule bool-impl-elim :args (@t33 @t5)) % 0.40/0.60 (step @p33 :rule trans :premises (@p32 @p31)) % 0.40/0.60 (step @p34 :rule cong :premises (@p33) :args ((forall @t14 (=> @t33 @t5)))) % 0.40/0.61 (step @p35 :rule refl :args (@t5)) % 0.40/0.61 (step @p36 :rule eq-symm :args (@t12 tptp.empty_set)) % 0.40/0.61 (step @p37 :rule refl :args (@t20)) % 0.40/0.61 (step @p38 :rule nary_cong :premises (@p37 @p36) :args (@t21)) % 0.40/0.61 (step @p39 :rule cong :premises (@p38 @p35) :args (@t22)) % 0.40/0.61 (step @p40 :rule cong :premises (@p39) :args (@t23)) % 0.40/0.61 (step @p41 :rule trans :premises (@p40 @p34)) % 0.40/0.61 (step @p42 :rule cong :premises (@p41) :args (@t24)) % 0.40/0.61 (step @p43 :rule eq_resolve :premises (@p15 @p42)) % 0.40/0.61 (step @p44 :rule skolemize :premises (@p43)) % 0.40/0.61 (step @p45 :rule bool-double-not-elim :args (@t36)) % 0.40/0.61 (step @p46 :rule refl :args (@t42)) % 0.40/0.61 (step @p47 :rule nary_cong :premises (@p46 @p45) :args ((or @t42 (not @t38)))) % 0.40/0.61 (step @p48 :rule cnf_or_neg :args (@t42 1)) % 0.40/0.61 (step @p49 :rule eq_resolve :premises (@p48 @p47)) % 0.40/0.61 (step @p50 :rule reordering :premises (@p49) :args ((or @t36 @t42))) % 0.40/0.61 (step @p51 :rule chain_m_resolution :premises (@p50 @p44) :args (@t36 @t43 @t44)) % 0.40/0.61 (step @p52 :rule symm :premises (@p51)) % 0.40/0.61 (step @p53 :rule refl :args (@t32)) % 0.40/0.61 (step @p54 :rule cong :premises (@p53 @p52) :args ((tptp.union @t32 @t35))) % 0.40/0.61 (step @p55 :rule instantiate :premises (@p4) :args ((@list @t30 @t31 @t34))) % 0.40/0.61 (step @p56 :rule bool-impl-elim :args (@t5 @t45)) % 0.40/0.61 (step @p57 :rule cong :premises (@p56) :args ((forall @t4 (=> @t5 @t45)))) % 0.40/0.61 (step @p58 :rule eq-symm :args (@t3 @t1)) % 0.40/0.61 (step @p59 :rule cong :premises (@p35 @p58) :args (@t6)) % 0.40/0.61 (step @p60 :rule cong :premises (@p59) :args (@t7)) % 0.40/0.61 (step @p61 :rule trans :premises (@p60 @p57)) % 0.40/0.61 (step @p62 :rule eq_resolve :premises (@p2 @p61)) % 0.40/0.61 (step @p63 :rule instantiate :premises (@p62) :args ((@list @t30 @t39))) % 0.40/0.61 (step @p64 :rule bool-double-not-elim :args (@t40)) % 0.40/0.61 (step @p65 :rule nary_cong :premises (@p46 @p64) :args ((or @t42 (not @t41)))) % 0.40/0.61 (step @p66 :rule cnf_or_neg :args (@t42 0)) % 0.40/0.61 (step @p67 :rule eq_resolve :premises (@p66 @p65)) % 0.40/0.61 (step @p68 :rule reordering :premises (@p67) :args ((or @t40 @t42))) % 0.40/0.61 (step @p69 :rule chain_m_resolution :premises (@p68 @p44) :args (@t40 @t43 @t44)) % 0.40/0.61 (step @p70 :rule cnf_or_pos :args (@t47)) % 0.40/0.61 (step @p71 :rule reordering :premises (@p70) :args ((or @t41 @t46 (not @t47)))) % 0.40/0.61 (step @p72 :rule chain_m_resolution :premises (@p71 @p69 @p63) :args (@t46 (@list false false) (@list @t40 @t47))) % 0.40/0.61 (step @p73 :rule trans :premises (@p72 @p55 @p54 @p26 @p21)) % 0.40/0.61 (step @p74 :rule cong :premises (@p73 @p20) :args (@t37)) % 0.40/0.61 (step @p75 :rule cnf_or_neg :args (@t42 2)) % 0.40/0.61 (step @p76 :rule chain_m_resolution :premises (@p75 @p44) :args ((not @t37) @t43 @t44)) % 0.40/0.61 (step @p77 :rule false_intro :premises (@p76)) % 0.40/0.61 (step @p78 :rule symm :premises (@p77)) % 0.40/0.61 (step @p79 :rule trans :premises (@p78 @p74 @p19)) % 0.40/0.61 (step @p80 false :rule eq_resolve :premises (@p79 @p17)) % 0.40/0.61 ) % 0.40/0.61 % SZS output end Proof % 0.40/0.61 % cvc5 exiting %------------------------------------------------------------------------------