%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU123+1 : TPTP v9.2.1. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n009.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.34s 0.57s % Output : Proof 0.34s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU123+1 : TPTP v9.2.1. Released v3.3.0. % 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n009.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue Jun 2 16:30:29 EDT 2026 % 0.17/0.35 % CPUTime : % 0.27/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.34/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.34/0.57 % SZS status Theorem % 0.34/0.57 % SZS output start Proof % 0.34/0.57 ( % 0.34/0.57 (declare-sort $$unsorted 0) % 0.34/0.57 (declare-const tptp.empty_set $$unsorted) % 0.34/0.57 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.34/0.57 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.34/0.57 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.34/0.57 (define @t1 () (@var "A" $$unsorted)) % 0.34/0.57 (define @t2 () (@var "B" $$unsorted)) % 0.34/0.57 (define @t3 () (tptp.in @t1 @t2)) % 0.34/0.57 (define @t4 () (@list @t1 @t2)) % 0.34/0.57 (define @t5 () (= @t1 @t2)) % 0.34/0.57 (define @t6 () (forall @t4 (= @t5 (and (tptp.subset @t1 @t2) (tptp.subset @t2 @t1))))) % 0.34/0.57 (define @t7 () (tptp.empty @t1)) % 0.34/0.57 (define @t8 () (@list @t1)) % 0.34/0.57 (define @t9 () (forall @t8 (tptp.subset tptp.empty_set @t1))) % 0.34/0.57 (define @t10 () (= @t1 tptp.empty_set)) % 0.34/0.57 (define @t11 () (tptp.subset @t1 tptp.empty_set)) % 0.34/0.57 (define @t12 () (forall @t8 (=> @t11 @t10))) % 0.34/0.57 (define @t13 () (not @t12)) % 0.34/0.57 (define @t14 () (tptp.empty @t2)) % 0.34/0.57 (define @t15 () (forall @t8 (or (not @t11) @t10))) % 0.34/0.57 (define @t16 () (@quantifiers_skolemize @t15 0)) % 0.34/0.57 (define @t17 () (tptp.subset tptp.empty_set @t16)) % 0.34/0.57 (define @t18 () (tptp.subset @t16 tptp.empty_set)) % 0.34/0.57 (define @t19 () (and @t18 @t17)) % 0.34/0.57 (define @t20 () (= @t16 tptp.empty_set)) % 0.34/0.57 (define @t21 () (= @t20 @t19)) % 0.34/0.57 (define @t22 () (= tptp.empty_set @t16)) % 0.34/0.57 (define @t23 () (= @t22 @t19)) % 0.34/0.57 (define @t24 () (not @t18)) % 0.34/0.57 (define @t25 () (or @t24 @t22)) % 0.34/0.57 (define @t26 () (not @t25)) % 0.34/0.57 (define @t27 () (not @t15)) % 0.34/0.57 (define @t28 () (or @t24 @t20)) % 0.34/0.57 (define @t29 () (not @t28)) % 0.34/0.57 (define @t30 () (@list true)) % 0.34/0.57 (define @t31 () (@list @t25)) % 0.34/0.57 (define @t32 () (not @t19)) % 0.34/0.57 (define @t33 () (@list true false)) % 0.34/0.57 (define @t34 () (not @t17)) % 0.34/0.57 (assume @p1 (forall @t4 (=> @t3 (not (tptp.in @t2 @t1))))) % 0.34/0.57 (assume @p2 @t6) % 0.34/0.57 (assume @p3 true) % 0.34/0.57 (assume @p4 (tptp.empty tptp.empty_set)) % 0.34/0.57 (assume @p5 (exists @t8 @t7)) % 0.34/0.57 (assume @p6 (exists @t8 (not @t7))) % 0.34/0.57 (assume @p7 (forall @t4 (tptp.subset @t1 @t1))) % 0.34/0.57 (assume @p8 @t9) % 0.34/0.57 (assume @p9 @t13) % 0.34/0.57 (assume @p10 (forall @t8 (=> @t7 @t10))) % 0.34/0.57 (assume @p11 (forall @t4 (not (and @t3 @t14)))) % 0.34/0.57 (assume @p12 (forall @t4 (not (and @t7 (not @t5) @t14)))) % 0.34/0.57 (step @p13 :rule refl :args (@t19)) % 0.34/0.57 (step @p14 :rule eq-symm :args (@t16 tptp.empty_set)) % 0.34/0.57 (step @p15 :rule cong :premises (@p14 @p13) :args (@t21)) % 0.34/0.57 (step @p16 :rule refl :args (@t6)) % 0.34/0.57 (step @p17 :rule cong :premises (@p16 @p15) :args ((=> @t6 @t21))) % 0.34/0.57 (assume-push @p66 @t6) % 0.34/0.57 (step @p19 :rule instantiate :premises (@p2) :args ((@list @t16 tptp.empty_set))) % 0.34/0.57 (step-pop @p67 :rule scope :premises (@p19)) % 0.34/0.57 (step @p20 :rule process_scope :premises (@p67) :args (@t21)) % 0.34/0.57 (step @p22 :rule eq_resolve :premises (@p20 @p17)) % 0.34/0.57 (step @p23 :rule implies_elim :premises (@p22)) % 0.34/0.57 (step @p24 :rule chain_m_resolution :premises (@p23 @p2) :args (@t23 (@list false) (@list @t6))) % 0.34/0.57 (step @p25 :rule bool-impl-elim :args (@t11 @t10)) % 0.34/0.57 (step @p26 :rule cong :premises (@p25) :args (@t12)) % 0.34/0.57 (step @p27 :rule cong :premises (@p26) :args (@t13)) % 0.34/0.57 (step @p28 :rule eq_resolve :premises (@p9 @p27)) % 0.34/0.57 (step @p29 :rule refl :args (@t26)) % 0.34/0.57 (step @p30 :rule bool-double-not-elim :args (@t15)) % 0.34/0.57 (step @p31 :rule nary_cong :premises (@p30 @p29) :args ((or (not @t27) @t26))) % 0.34/0.57 (step @p32 :rule refl :args (@t24)) % 0.34/0.57 (step @p33 :rule nary_cong :premises (@p32 @p14) :args (@t28)) % 0.34/0.57 (step @p34 :rule cong :premises (@p33) :args (@t29)) % 0.34/0.57 (step @p35 :rule refl :args (@t27)) % 0.34/0.57 (step @p36 :rule cong :premises (@p35 @p34) :args ((=> @t27 @t29))) % 0.34/0.57 (assume-push @p68 @t27) % 0.34/0.57 (step @p38 :rule skolemize :premises (@p28)) % 0.34/0.57 (step-pop @p69 :rule scope :premises (@p38)) % 0.34/0.57 (step @p39 :rule process_scope :premises (@p69) :args (@t29)) % 0.34/0.57 (step @p41 :rule eq_resolve :premises (@p39 @p36)) % 0.34/0.57 (step @p42 :rule implies_elim :premises (@p41)) % 0.34/0.57 (step @p43 :rule eq_resolve :premises (@p42 @p31)) % 0.34/0.57 (step @p44 :rule chain_m_resolution :premises (@p43 @p28) :args (@t26 @t30 (@list @t15))) % 0.34/0.57 (step @p45 :rule cnf_or_neg :args (@t25 1)) % 0.34/0.57 (step @p46 :rule chain_m_resolution :premises (@p45 @p44) :args ((not @t22) @t30 @t31)) % 0.34/0.57 (step @p47 :rule cnf_equiv_pos2 :args (@t23)) % 0.34/0.57 (step @p48 :rule reordering :premises (@p47) :args ((or @t22 @t32 (not @t23)))) % 0.34/0.57 (step @p49 :rule chain_m_resolution :premises (@p48 @p46 @p24) :args (@t32 @t33 (@list @t22 @t23))) % 0.34/0.58 (step @p50 :rule bool-double-not-elim :args (@t18)) % 0.34/0.58 (step @p51 :rule refl :args (@t25)) % 0.34/0.58 (step @p52 :rule nary_cong :premises (@p51 @p50) :args ((or @t25 (not @t24)))) % 0.34/0.58 (step @p53 :rule cnf_or_neg :args (@t25 0)) % 0.34/0.58 (step @p54 :rule eq_resolve :premises (@p53 @p52)) % 0.34/0.58 (step @p55 :rule reordering :premises (@p54) :args ((or @t18 @t25))) % 0.34/0.58 (step @p56 :rule chain_m_resolution :premises (@p55 @p44) :args (@t18 @t30 @t31)) % 0.34/0.58 (step @p57 :rule cnf_and_neg :args (@t19)) % 0.34/0.58 (step @p58 :rule reordering :premises (@p57) :args ((or @t24 @t19 @t34))) % 0.34/0.58 (step @p59 :rule chain_m_resolution :premises (@p58 @p56 @p49) :args (@t34 (@list false true) (@list @t18 @t19))) % 0.34/0.58 (assume-push @p70 @t9) % 0.34/0.58 (step @p61 :rule instantiate :premises (@p8) :args ((@list @t16))) % 0.34/0.58 (step-pop @p71 :rule scope :premises (@p61)) % 0.34/0.58 (step @p62 :rule process_scope :premises (@p71) :args (@t17)) % 0.34/0.58 (step @p64 :rule implies_elim :premises (@p62)) % 0.34/0.58 (step @p65 false :rule chain_m_resolution :premises (@p64 @p59 @p8) :args (false @t33 (@list @t17 @t9))) % 0.34/0.58 ) % 0.34/0.58 % SZS output end Proof % 0.34/0.58 % cvc5 exiting %------------------------------------------------------------------------------