%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET917+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 : n013.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:58 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 : SET917+1 : TPTP v9.2.1. Released v3.2.0. % 0.13/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n013.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:17:30 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.disjoint (-> $$unsorted $$unsorted Bool)) % 0.31/0.55 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.31/0.55 (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted)) % 0.31/0.55 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.31/0.55 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.31/0.55 (define @t1 () (@var "A" $$unsorted)) % 0.31/0.55 (define @t2 () (@var "B" $$unsorted)) % 0.31/0.55 (define @t3 () (tptp.in @t1 @t2)) % 0.31/0.55 (define @t4 () (@list @t1 @t2)) % 0.31/0.55 (define @t5 () (tptp.singleton @t1)) % 0.31/0.55 (define @t6 () (tptp.disjoint @t5 @t2)) % 0.31/0.55 (define @t7 () (not @t3)) % 0.31/0.55 (define @t8 () (forall @t4 (=> @t7 @t6))) % 0.31/0.55 (define @t9 () (tptp.set_intersection2 @t2 @t5)) % 0.31/0.55 (define @t10 () (=> @t3 (= @t9 @t5))) % 0.31/0.55 (define @t11 () (forall @t4 @t10)) % 0.31/0.55 (define @t12 () (tptp.empty @t1)) % 0.31/0.55 (define @t13 () (@list @t1)) % 0.31/0.55 (define @t14 () (tptp.set_intersection2 @t5 @t2)) % 0.31/0.55 (define @t15 () (or @t6 (= @t14 @t5))) % 0.31/0.55 (define @t16 () (forall @t4 @t15)) % 0.31/0.55 (define @t17 () (not @t16)) % 0.31/0.55 (define @t18 () (= @t5 @t9)) % 0.31/0.55 (define @t19 () (forall @t4 (or @t6 (= @t5 @t14)))) % 0.31/0.55 (define @t20 () (@quantifiers_skolemize @t19 1)) % 0.31/0.55 (define @t21 () (@quantifiers_skolemize @t19 0)) % 0.31/0.55 (define @t22 () (tptp.singleton @t21)) % 0.31/0.55 (define @t23 () (= @t22 (tptp.set_intersection2 @t22 @t20))) % 0.31/0.55 (define @t24 () (tptp.disjoint @t22 @t20)) % 0.31/0.55 (define @t25 () (or @t24 @t23)) % 0.31/0.55 (define @t26 () (@list true)) % 0.31/0.55 (define @t27 () (@list @t25)) % 0.31/0.55 (define @t28 () (= @t22 (tptp.set_intersection2 @t20 @t22))) % 0.31/0.55 (define @t29 () (@list @t21 @t20)) % 0.31/0.55 (define @t30 () (tptp.in @t21 @t20)) % 0.31/0.55 (define @t31 () (or @t30 @t24)) % 0.31/0.55 (define @t32 () (@list true false)) % 0.31/0.55 (define @t33 () (not @t30)) % 0.31/0.55 (define @t34 () (or @t33 @t28)) % 0.31/0.55 (define @t35 () (not @t34)) % 0.31/0.55 (define @t36 () (forall @t4 (or @t7 @t18))) % 0.31/0.55 (assume @p1 (forall @t4 (=> @t3 (not (tptp.in @t2 @t1))))) % 0.31/0.55 (assume @p2 (forall @t4 (= (tptp.set_intersection2 @t1 @t2) (tptp.set_intersection2 @t2 @t1)))) % 0.31/0.55 (assume @p3 (forall @t4 (= (tptp.set_intersection2 @t1 @t1) @t1))) % 0.31/0.55 (assume @p4 @t8) % 0.31/0.55 (assume @p5 @t11) % 0.31/0.55 (assume @p6 (exists @t13 @t12)) % 0.31/0.55 (assume @p7 (exists @t13 (not @t12))) % 0.31/0.55 (assume @p8 (forall @t4 (=> (tptp.disjoint @t1 @t2) (tptp.disjoint @t2 @t1)))) % 0.31/0.55 (assume @p9 @t17) % 0.31/0.55 (assume @p10 true) % 0.31/0.55 (step @p11 :rule bool-impl-elim :args (@t3 @t18)) % 0.31/0.55 (step @p12 :rule cong :premises (@p11) :args ((forall @t4 (=> @t3 @t18)))) % 0.31/0.55 (step @p13 :rule eq-symm :args (@t9 @t5)) % 0.31/0.55 (step @p14 :rule refl :args (@t3)) % 0.31/0.55 (step @p15 :rule cong :premises (@p14 @p13) :args (@t10)) % 0.31/0.55 (step @p16 :rule cong :premises (@p15) :args (@t11)) % 0.31/0.55 (step @p17 :rule trans :premises (@p16 @p12)) % 0.31/0.55 (step @p18 :rule eq_resolve :premises (@p5 @p17)) % 0.31/0.55 (step @p19 :rule eq-symm :args (@t14 @t5)) % 0.31/0.55 (step @p20 :rule refl :args (@t6)) % 0.31/0.55 (step @p21 :rule nary_cong :premises (@p20 @p19) :args (@t15)) % 0.31/0.55 (step @p22 :rule cong :premises (@p21) :args (@t16)) % 0.31/0.55 (step @p23 :rule cong :premises (@p22) :args (@t17)) % 0.31/0.55 (step @p24 :rule eq_resolve :premises (@p9 @p23)) % 0.31/0.55 (step @p25 :rule skolemize :premises (@p24)) % 0.31/0.55 (step @p26 :rule cnf_or_neg :args (@t25 1)) % 0.31/0.55 (step @p27 :rule chain_m_resolution :premises (@p26 @p25) :args ((not @t23) @t26 @t27)) % 0.31/0.55 (step @p28 :rule false_intro :premises (@p27)) % 0.31/0.55 (step @p29 :rule instantiate :premises (@p2) :args ((@list @t22 @t20))) % 0.31/0.55 (step @p30 :rule symm :premises (@p29)) % 0.31/0.55 (step @p31 :rule refl :args (@t22)) % 0.31/0.55 (step @p32 :rule cong :premises (@p31 @p30) :args (@t28)) % 0.31/0.55 (step @p33 :rule trans :premises (@p32 @p28)) % 0.31/0.55 (step @p34 :rule false_elim :premises (@p33)) % 0.31/0.55 (step @p35 :rule refl :args (@t6)) % 0.31/0.55 (step @p36 :rule bool-double-not-elim :args (@t3)) % 0.31/0.55 (step @p37 :rule nary_cong :premises (@p36 @p35) :args ((or (not @t7) @t6))) % 0.31/0.55 (step @p38 :rule bool-impl-elim :args (@t7 @t6)) % 0.31/0.55 (step @p39 :rule trans :premises (@p38 @p37)) % 0.31/0.55 (step @p40 :rule cong :premises (@p39) :args (@t8)) % 0.31/0.55 (step @p41 :rule eq_resolve :premises (@p4 @p40)) % 0.31/0.55 (step @p42 :rule instantiate :premises (@p41) :args (@t29)) % 0.31/0.55 (step @p43 :rule cnf_or_neg :args (@t25 0)) % 0.31/0.55 (step @p44 :rule chain_m_resolution :premises (@p43 @p25) :args ((not @t24) @t26 @t27)) % 0.31/0.55 (step @p45 :rule cnf_or_pos :args (@t31)) % 0.31/0.55 (step @p46 :rule reordering :premises (@p45) :args ((or @t24 @t30 (not @t31)))) % 0.31/0.55 (step @p47 :rule chain_m_resolution :premises (@p46 @p44 @p42) :args (@t30 @t32 (@list @t24 @t31))) % 0.31/0.55 (step @p48 :rule cnf_or_pos :args (@t34)) % 0.31/0.55 (step @p49 :rule reordering :premises (@p48) :args ((or @t33 @t28 @t35))) % 0.31/0.55 (step @p50 :rule chain_m_resolution :premises (@p49 @p47 @p34) :args (@t35 (@list false true) (@list @t30 @t28))) % 0.31/0.55 (assume-push @p57 @t36) % 0.31/0.55 (step @p52 :rule instantiate :premises (@p18) :args (@t29)) % 0.31/0.55 (step-pop @p58 :rule scope :premises (@p52)) % 0.31/0.55 (step @p53 :rule process_scope :premises (@p58) :args (@t34)) % 0.31/0.55 (step @p55 :rule implies_elim :premises (@p53)) % 0.31/0.55 (step @p56 false :rule chain_m_resolution :premises (@p55 @p50 @p18) :args (false @t32 (@list @t34 @t36))) % 0.31/0.55 ) % 0.31/0.55 % SZS output end Proof % 0.31/0.55 % cvc5 exiting %------------------------------------------------------------------------------