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