%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET923+1 : TPTP v9.2.1. Released v3.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:59 AM UTC 2026 % Result : Theorem 0.30s 0.55s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET923+1 : TPTP v9.2.1. Released v3.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:18:09 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.55 % SZS status Theorem % 0.30/0.55 % SZS output start Proof % 0.30/0.55 ( % 0.30/0.55 (declare-sort $$unsorted 0) % 0.30/0.55 (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.empty_set $$unsorted) % 0.30/0.55 (define @t1 () (@var "B" $$unsorted)) % 0.30/0.55 (define @t2 () (tptp.singleton @t1)) % 0.30/0.55 (define @t3 () (@var "A" $$unsorted)) % 0.30/0.55 (define @t4 () (= @t3 @t2)) % 0.30/0.55 (define @t5 () (= @t3 tptp.empty_set)) % 0.30/0.55 (define @t6 () (or @t5 @t4)) % 0.30/0.55 (define @t7 () (tptp.subset @t3 @t2)) % 0.30/0.55 (define @t8 () (= @t7 @t6)) % 0.30/0.55 (define @t9 () (@list @t3 @t1)) % 0.30/0.55 (define @t10 () (forall @t9 @t8)) % 0.30/0.55 (define @t11 () (tptp.empty @t3)) % 0.30/0.55 (define @t12 () (@list @t3)) % 0.30/0.55 (define @t13 () (tptp.subset @t3 @t1)) % 0.30/0.55 (define @t14 () (tptp.set_difference @t3 @t1)) % 0.30/0.55 (define @t15 () (= (= @t14 tptp.empty_set) @t13)) % 0.30/0.55 (define @t16 () (forall @t9 @t15)) % 0.30/0.55 (define @t17 () (not @t4)) % 0.30/0.55 (define @t18 () (not @t5)) % 0.30/0.55 (define @t19 () (tptp.set_difference @t3 @t2)) % 0.30/0.55 (define @t20 () (and (= @t19 tptp.empty_set) @t18 @t17)) % 0.30/0.55 (define @t21 () (not @t20)) % 0.30/0.55 (define @t22 () (forall @t9 @t21)) % 0.30/0.55 (define @t23 () (not @t22)) % 0.30/0.55 (define @t24 () (= tptp.empty_set @t14)) % 0.30/0.55 (define @t25 () (= tptp.empty_set @t3)) % 0.30/0.55 (define @t26 () (= tptp.empty_set @t19)) % 0.30/0.55 (define @t27 () (not @t26)) % 0.30/0.55 (define @t28 () (forall @t9 (or @t27 @t25 @t4))) % 0.30/0.55 (define @t29 () (@quantifiers_skolemize @t28 1)) % 0.30/0.55 (define @t30 () (tptp.singleton @t29)) % 0.30/0.55 (define @t31 () (@quantifiers_skolemize @t28 0)) % 0.30/0.55 (define @t32 () (tptp.subset @t31 @t30)) % 0.30/0.55 (define @t33 () (= tptp.empty_set (tptp.set_difference @t31 @t30))) % 0.30/0.55 (define @t34 () (forall @t9 (= @t13 @t24))) % 0.30/0.55 (define @t35 () (= @t32 @t33)) % 0.30/0.55 (define @t36 () (= @t33 @t32)) % 0.30/0.55 (define @t37 () (not @t17)) % 0.30/0.55 (define @t38 () (not @t25)) % 0.30/0.55 (define @t39 () (not @t38)) % 0.30/0.55 (define @t40 () (or @t27 @t39 @t37)) % 0.30/0.55 (define @t41 () (= @t31 @t30)) % 0.30/0.55 (define @t42 () (= tptp.empty_set @t31)) % 0.30/0.55 (define @t43 () (not @t33)) % 0.30/0.55 (define @t44 () (or @t43 @t42 @t41)) % 0.30/0.55 (define @t45 () (@list true)) % 0.30/0.55 (define @t46 () (@list @t44)) % 0.30/0.55 (define @t47 () (or @t42 @t41)) % 0.30/0.55 (define @t48 () (not @t47)) % 0.30/0.55 (define @t49 () (= @t32 @t47)) % 0.30/0.55 (assume @p1 (tptp.empty tptp.empty_set)) % 0.30/0.55 (assume @p2 @t10) % 0.30/0.55 (assume @p3 (exists @t12 @t11)) % 0.30/0.55 (assume @p4 (exists @t12 (not @t11))) % 0.30/0.55 (assume @p5 (forall @t9 (tptp.subset @t3 @t3))) % 0.30/0.55 (assume @p6 @t16) % 0.30/0.55 (assume @p7 @t23) % 0.30/0.55 (assume @p8 true) % 0.30/0.55 (step @p9 :rule eq-symm :args (@t24 @t13)) % 0.30/0.55 (step @p10 :rule refl :args (@t13)) % 0.30/0.55 (step @p11 :rule eq-symm :args (@t14 tptp.empty_set)) % 0.30/0.55 (step @p12 :rule cong :premises (@p11 @p10) :args (@t15)) % 0.30/0.55 (step @p13 :rule trans :premises (@p12 @p9)) % 0.30/0.55 (step @p14 :rule cong :premises (@p13) :args (@t16)) % 0.30/0.55 (step @p15 :rule eq_resolve :premises (@p6 @p14)) % 0.30/0.55 (step @p16 :rule eq-symm :args (@t32 @t33)) % 0.30/0.55 (step @p17 :rule refl :args (@t34)) % 0.30/0.55 (step @p18 :rule cong :premises (@p17 @p16) :args ((=> @t34 @t35))) % 0.30/0.55 (assume-push @p76 @t34) % 0.30/0.55 (step @p20 :rule instantiate :premises (@p15) :args ((@list @t31 @t30))) % 0.30/0.55 (step-pop @p77 :rule scope :premises (@p20)) % 0.30/0.55 (step @p21 :rule process_scope :premises (@p77) :args (@t35)) % 0.30/0.55 (step @p23 :rule eq_resolve :premises (@p21 @p18)) % 0.30/0.55 (step @p24 :rule implies_elim :premises (@p23)) % 0.30/0.55 (step @p25 :rule chain_m_resolution :premises (@p24 @p15) :args (@t36 (@list false) (@list @t34))) % 0.30/0.55 (step @p26 :rule bool-double-not-elim :args (@t4)) % 0.30/0.55 (step @p27 :rule bool-double-not-elim :args (@t25)) % 0.30/0.55 (step @p28 :rule refl :args (@t27)) % 0.30/0.55 (step @p29 :rule nary_cong :premises (@p28 @p27 @p26) :args (@t40)) % 0.30/0.55 (step @p30 :rule aci_norm :args ((= (or @t27 (or @t39 @t37)) @t40))) % 0.30/0.55 (step @p31 :rule trans :premises (@p30 @p29)) % 0.30/0.55 (step @p32 :rule bool-and-de-morgan :args (@t38 @t17 true)) % 0.30/0.55 (step @p33 :rule nary_cong :premises (@p28 @p32) :args ((or @t27 (not (and @t38 @t17))))) % 0.30/0.55 (step @p34 :rule bool-and-de-morgan :args (@t26 @t38 (and @t17))) % 0.30/0.55 (step @p35 :rule trans :premises (@p34 @p33)) % 0.30/0.55 (step @p36 :rule trans :premises (@p35 @p31)) % 0.30/0.55 (step @p37 :rule cong :premises (@p36) :args ((forall @t9 (not (and @t26 @t38 @t17))))) % 0.30/0.55 (step @p38 :rule refl :args (@t17)) % 0.30/0.55 (step @p39 :rule eq-symm :args (@t3 tptp.empty_set)) % 0.30/0.55 (step @p40 :rule cong :premises (@p39) :args (@t18)) % 0.30/0.55 (step @p41 :rule eq-symm :args (@t19 tptp.empty_set)) % 0.30/0.55 (step @p42 :rule nary_cong :premises (@p41 @p40 @p38) :args (@t20)) % 0.30/0.55 (step @p43 :rule cong :premises (@p42) :args (@t21)) % 0.30/0.55 (step @p44 :rule cong :premises (@p43) :args (@t22)) % 0.30/0.55 (step @p45 :rule trans :premises (@p44 @p37)) % 0.30/0.55 (step @p46 :rule cong :premises (@p45) :args (@t23)) % 0.30/0.55 (step @p47 :rule eq_resolve :premises (@p7 @p46)) % 0.30/0.55 (step @p48 :rule skolemize :premises (@p47)) % 0.30/0.55 (step @p49 :rule bool-double-not-elim :args (@t33)) % 0.30/0.55 (step @p50 :rule refl :args (@t44)) % 0.30/0.55 (step @p51 :rule nary_cong :premises (@p50 @p49) :args ((or @t44 (not @t43)))) % 0.30/0.55 (step @p52 :rule cnf_or_neg :args (@t44 0)) % 0.30/0.55 (step @p53 :rule eq_resolve :premises (@p52 @p51)) % 0.30/0.55 (step @p54 :rule reordering :premises (@p53) :args ((or @t33 @t44))) % 0.30/0.55 (step @p55 :rule chain_m_resolution :premises (@p54 @p48) :args (@t33 @t45 @t46)) % 0.30/0.55 (step @p56 :rule cnf_equiv_pos1 :args (@t36)) % 0.30/0.55 (step @p57 :rule reordering :premises (@p56) :args ((or @t43 @t32 (not @t36)))) % 0.30/0.55 (step @p58 :rule chain_m_resolution :premises (@p57 @p55 @p25) :args (@t32 (@list false false) (@list @t33 @t36))) % 0.30/0.55 (step @p59 :rule cnf_or_neg :args (@t44 2)) % 0.30/0.55 (step @p60 :rule chain_m_resolution :premises (@p59 @p48) :args ((not @t41) @t45 @t46)) % 0.30/0.55 (step @p61 :rule cnf_or_neg :args (@t44 1)) % 0.30/0.55 (step @p62 :rule chain_m_resolution :premises (@p61 @p48) :args ((not @t42) @t45 @t46)) % 0.30/0.55 (step @p63 :rule cnf_or_pos :args (@t47)) % 0.30/0.55 (step @p64 :rule reordering :premises (@p63) :args ((or @t42 @t41 @t48))) % 0.30/0.55 (step @p65 :rule chain_m_resolution :premises (@p64 @p62 @p60) :args (@t48 (@list true true) (@list @t42 @t41))) % 0.30/0.55 (step @p66 :rule refl :args (@t4)) % 0.30/0.55 (step @p67 :rule nary_cong :premises (@p39 @p66) :args (@t6)) % 0.30/0.55 (step @p68 :rule refl :args (@t7)) % 0.30/0.55 (step @p69 :rule cong :premises (@p68 @p67) :args (@t8)) % 0.30/0.55 (step @p70 :rule cong :premises (@p69) :args (@t10)) % 0.30/0.55 (step @p71 :rule eq_resolve :premises (@p2 @p70)) % 0.30/0.55 (step @p72 :rule instantiate :premises (@p71) :args ((@list @t31 @t29))) % 0.30/0.55 (step @p73 :rule cnf_equiv_pos1 :args (@t49)) % 0.30/0.55 (step @p74 :rule reordering :premises (@p73) :args ((or (not @t32) @t47 (not @t49)))) % 0.30/0.55 (step @p75 false :rule chain_m_resolution :premises (@p74 @p72 @p65 @p58) :args (false (@list false true false) (@list @t49 @t47 @t32))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.34/0.55 % cvc5 exiting %------------------------------------------------------------------------------