%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU122+2 : TPTP v9.2.1. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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:50:37 AM UTC 2026 % Result : Theorem 0.28s 0.55s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU122+2 : TPTP v9.2.1. Released v3.3.0. % 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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:30:30 EDT 2026 % 0.16/0.34 % CPUTime : % 0.28/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.28/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.28/0.55 % SZS status Theorem % 0.28/0.55 % SZS output start Proof % 0.28/0.55 ( % 0.28/0.55 (declare-sort $$unsorted 0) % 0.28/0.55 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.28/0.55 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.28/0.55 (declare-const tptp.empty_set $$unsorted) % 0.28/0.55 (declare-const tptp.set_intersection2 (-> $$unsorted $$unsorted $$unsorted)) % 0.28/0.55 (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool)) % 0.28/0.55 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.28/0.55 (define @t1 () (@var "A" $$unsorted)) % 0.28/0.55 (define @t2 () (@var "B" $$unsorted)) % 0.28/0.55 (define @t3 () (not (tptp.in @t2 @t1))) % 0.28/0.55 (define @t4 () (tptp.in @t1 @t2)) % 0.28/0.55 (define @t5 () (@list @t1 @t2)) % 0.28/0.55 (define @t6 () (tptp.set_intersection2 @t1 @t2)) % 0.28/0.55 (define @t7 () (= @t1 tptp.empty_set)) % 0.28/0.55 (define @t8 () (@list @t1)) % 0.28/0.55 (define @t9 () (@var "C" $$unsorted)) % 0.28/0.55 (define @t10 () (tptp.in @t9 @t2)) % 0.28/0.55 (define @t11 () (tptp.in @t9 @t1)) % 0.28/0.55 (define @t12 () (@list @t9)) % 0.28/0.55 (define @t13 () (forall @t12 (=> @t11 @t10))) % 0.28/0.55 (define @t14 () (tptp.subset @t1 @t2)) % 0.28/0.55 (define @t15 () (= @t14 @t13)) % 0.28/0.55 (define @t16 () (forall @t5 @t15)) % 0.28/0.55 (define @t17 () (@var "D" $$unsorted)) % 0.28/0.55 (define @t18 () (@list @t1 @t2 @t9)) % 0.28/0.55 (define @t19 () (tptp.disjoint @t1 @t2)) % 0.28/0.55 (define @t20 () (tptp.empty tptp.empty_set)) % 0.28/0.55 (define @t21 () (tptp.empty @t1)) % 0.28/0.55 (define @t22 () (forall @t8 (tptp.subset tptp.empty_set @t1))) % 0.28/0.55 (define @t23 () (and @t11 @t10)) % 0.28/0.55 (define @t24 () (not @t19)) % 0.28/0.55 (define @t25 () (tptp.in @t9 @t6)) % 0.28/0.55 (define @t26 () (tptp.empty @t2)) % 0.28/0.55 (define @t27 () (forall @t5 (not (and @t4 @t26)))) % 0.28/0.55 (define @t28 () (@quantifiers_skolemize @t22 0)) % 0.28/0.55 (define @t29 () (forall @t12 (or (not (tptp.in @t9 tptp.empty_set)) (tptp.in @t9 @t28)))) % 0.28/0.55 (define @t30 () (tptp.subset tptp.empty_set @t28)) % 0.28/0.55 (define @t31 () (= @t30 @t29)) % 0.28/0.55 (define @t32 () (not @t29)) % 0.28/0.55 (define @t33 () (@list true false)) % 0.28/0.55 (define @t34 () (@quantifiers_skolemize @t29 0)) % 0.28/0.55 (define @t35 () (tptp.in @t34 tptp.empty_set)) % 0.28/0.55 (define @t36 () (not @t35)) % 0.28/0.55 (define @t37 () (or @t36 (tptp.in @t34 @t28))) % 0.28/0.55 (define @t38 () (not @t20)) % 0.28/0.55 (define @t39 () (or @t36 @t38)) % 0.28/0.55 (define @t40 () (not @t39)) % 0.28/0.55 (define @t41 () (forall @t5 (or (not @t4) (not @t26)))) % 0.28/0.55 (assume @p1 (forall @t5 (=> @t4 @t3))) % 0.28/0.55 (assume @p2 (forall @t5 (= @t6 (tptp.set_intersection2 @t2 @t1)))) % 0.28/0.55 (assume @p3 (forall @t8 (= @t7 (forall (@list @t2) @t3)))) % 0.28/0.55 (assume @p4 @t16) % 0.28/0.55 (assume @p5 (forall @t18 (= (= @t9 @t6) (forall (@list @t17) (= (tptp.in @t17 @t9) (and (tptp.in @t17 @t1) (tptp.in @t17 @t2))))))) % 0.28/0.55 (assume @p6 (forall @t5 (= @t19 (= @t6 tptp.empty_set)))) % 0.28/0.55 (assume @p7 true) % 0.28/0.55 (assume @p8 @t20) % 0.28/0.55 (assume @p9 (forall @t5 (= (tptp.set_intersection2 @t1 @t1) @t1))) % 0.28/0.55 (assume @p10 (exists @t8 @t21)) % 0.28/0.55 (assume @p11 (exists @t8 (not @t21))) % 0.28/0.55 (assume @p12 (forall @t5 (tptp.subset @t1 @t1))) % 0.28/0.55 (assume @p13 (forall @t5 (=> @t19 (tptp.disjoint @t2 @t1)))) % 0.28/0.55 (assume @p14 (forall @t18 (=> (and @t14 (tptp.subset @t2 @t9)) (tptp.subset @t1 @t9)))) % 0.28/0.55 (assume @p15 (not @t22)) % 0.28/0.55 (assume @p16 (forall @t5 (and (not (and @t24 (forall @t12 (not @t23)))) (not (and (exists @t12 @t23) @t19))))) % 0.28/0.55 (assume @p17 (forall @t5 (and (not (and @t24 (forall @t12 (not @t25)))) (not (and (exists @t12 @t25) @t19))))) % 0.28/0.55 (assume @p18 (forall @t8 (=> @t21 @t7))) % 0.28/0.55 (assume @p19 @t27) % 0.28/0.55 (assume @p20 (forall @t5 (not (and @t21 (not (= @t1 @t2)) @t26)))) % 0.28/0.55 (step @p21 :rule bool-and-de-morgan :args (@t4 @t26 true)) % 0.28/0.55 (step @p22 :rule cong :premises (@p21) :args (@t27)) % 0.28/0.55 (step @p23 :rule eq_resolve :premises (@p19 @p22)) % 0.28/0.55 (step @p24 :rule bool-impl-elim :args (@t11 @t10)) % 0.28/0.55 (step @p25 :rule cong :premises (@p24) :args (@t13)) % 0.28/0.55 (step @p26 :rule refl :args (@t14)) % 0.28/0.55 (step @p27 :rule cong :premises (@p26 @p25) :args (@t15)) % 0.28/0.55 (step @p28 :rule cong :premises (@p27) :args (@t16)) % 0.28/0.55 (step @p29 :rule eq_resolve :premises (@p4 @p28)) % 0.28/0.55 (step @p30 :rule instantiate :premises (@p29) :args ((@list tptp.empty_set @t28))) % 0.28/0.55 (step @p31 :rule skolemize :premises (@p15)) % 0.28/0.55 (step @p32 :rule cnf_equiv_pos2 :args (@t31)) % 0.28/0.55 (step @p33 :rule reordering :premises (@p32) :args ((or @t30 @t32 (not @t31)))) % 0.28/0.55 (step @p34 :rule chain_m_resolution :premises (@p33 @p31 @p30) :args (@t32 @t33 (@list @t30 @t31))) % 0.28/0.55 (step @p35 :rule skolemize :premises (@p34)) % 0.36/0.55 (step @p36 :rule bool-double-not-elim :args (@t35)) % 0.36/0.55 (step @p37 :rule refl :args (@t37)) % 0.36/0.55 (step @p38 :rule nary_cong :premises (@p37 @p36) :args ((or @t37 (not @t36)))) % 0.36/0.55 (step @p39 :rule cnf_or_neg :args (@t37 0)) % 0.36/0.55 (step @p40 :rule eq_resolve :premises (@p39 @p38)) % 0.36/0.55 (step @p41 :rule reordering :premises (@p40) :args ((or @t35 @t37))) % 0.36/0.55 (step @p42 :rule chain_m_resolution :premises (@p41 @p35) :args (@t35 (@list true) (@list @t37))) % 0.36/0.55 (step @p43 :rule cnf_or_pos :args (@t39)) % 0.36/0.55 (step @p44 :rule reordering :premises (@p43) :args ((or @t38 @t36 @t40))) % 0.36/0.55 (step @p45 :rule chain_m_resolution :premises (@p44 @p8 @p42) :args (@t40 (@list false false) (@list @t20 @t35))) % 0.36/0.55 (assume-push @p52 @t41) % 0.36/0.55 (step @p47 :rule instantiate :premises (@p23) :args ((@list @t34 tptp.empty_set))) % 0.36/0.55 (step-pop @p53 :rule scope :premises (@p47)) % 0.36/0.55 (step @p48 :rule process_scope :premises (@p53) :args (@t39)) % 0.36/0.55 (step @p50 :rule implies_elim :premises (@p48)) % 0.36/0.55 (step @p51 false :rule chain_m_resolution :premises (@p50 @p45 @p23) :args (false @t33 (@list @t39 @t41))) % 0.36/0.55 ) % 0.36/0.55 % SZS output end Proof % 0.36/0.55 % cvc5 exiting %------------------------------------------------------------------------------