%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU116+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 : n023.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:36 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 : SEU116+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.17/0.34 % Computer : n023.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.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 16:30:58 EDT 2026 % 0.17/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.relation (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.function (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.one_to_one (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.epsilon_transitive (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.epsilon_connected (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.ordinal (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.natural (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.cap_closed (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.element (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.diff_closed (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.preboolean (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.empty_set $$unsorted) % 0.30/0.55 (declare-const tptp.cup_closed (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.finite_subsets (-> $$unsorted $$unsorted)) % 0.30/0.55 (declare-const tptp.finite (-> $$unsorted Bool)) % 0.30/0.55 (define @t1 () (@var "A" $$unsorted)) % 0.30/0.55 (define @t2 () (@var "B" $$unsorted)) % 0.30/0.55 (define @t3 () (@list @t1 @t2)) % 0.30/0.55 (define @t4 () (tptp.in @t1 @t2)) % 0.30/0.55 (define @t5 () (tptp.element @t1 @t2)) % 0.30/0.55 (define @t6 () (@var "C" $$unsorted)) % 0.30/0.55 (define @t7 () (tptp.element @t2 (tptp.powerset @t6))) % 0.30/0.55 (define @t8 () (@list @t1 @t2 @t6)) % 0.30/0.55 (define @t9 () (tptp.empty @t2)) % 0.30/0.55 (define @t10 () (tptp.empty @t1)) % 0.30/0.55 (define @t11 () (tptp.powerset @t1)) % 0.30/0.55 (define @t12 () (not (tptp.empty @t11))) % 0.30/0.55 (define @t13 () (@list @t1)) % 0.30/0.55 (define @t14 () (tptp.diff_closed @t1)) % 0.30/0.55 (define @t15 () (tptp.cup_closed @t1)) % 0.30/0.55 (define @t16 () (and @t15 @t14)) % 0.30/0.55 (define @t17 () (tptp.preboolean @t1)) % 0.30/0.55 (define @t18 () (tptp.finite @t1)) % 0.30/0.55 (define @t19 () (tptp.finite @t2)) % 0.30/0.55 (define @t20 () (tptp.element @t2 @t11)) % 0.30/0.55 (define @t21 () (@list @t2)) % 0.30/0.55 (define @t22 () (tptp.finite_subsets @t1)) % 0.30/0.55 (define @t23 () (tptp.preboolean @t22)) % 0.30/0.55 (define @t24 () (tptp.element @t2 @t22)) % 0.30/0.55 (define @t25 () (forall @t3 (=> @t24 @t19))) % 0.30/0.55 (define @t26 () (not @t10)) % 0.30/0.55 (define @t27 () (not @t9)) % 0.30/0.55 (define @t28 () (not @t25)) % 0.30/0.55 (assume @p1 (forall @t3 (tptp.subset @t1 @t1))) % 0.30/0.55 (assume @p2 (forall @t3 (=> @t4 (not (tptp.in @t2 @t1))))) % 0.30/0.55 (assume @p3 (tptp.empty tptp.empty_set)) % 0.30/0.55 (assume @p4 (forall @t3 (=> @t4 @t5))) % 0.30/0.55 (assume @p5 (forall @t8 (=> (and @t4 @t7) (tptp.element @t1 @t6)))) % 0.30/0.55 (assume @p6 (forall @t8 (not (and @t4 @t7 (tptp.empty @t6))))) % 0.30/0.55 (assume @p7 (forall @t3 (not (and @t10 (not (= @t1 @t2)) @t9)))) % 0.30/0.55 (assume @p8 (forall @t13 (and @t12 (tptp.cup_closed @t11) (tptp.diff_closed @t11) (tptp.preboolean @t11)))) % 0.30/0.55 (assume @p9 (forall @t13 (=> @t17 @t16))) % 0.30/0.55 (assume @p10 (forall @t13 (=> @t16 @t17))) % 0.30/0.55 (assume @p11 (forall @t13 (=> @t10 @t18))) % 0.30/0.55 (assume @p12 (forall @t13 (=> @t18 (forall @t21 (=> @t20 @t19))))) % 0.30/0.55 (assume @p13 (forall @t13 @t12)) % 0.30/0.55 (assume @p14 (forall @t3 (=> @t5 (or @t9 @t4)))) % 0.30/0.55 (assume @p15 (forall @t3 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2)))) % 0.30/0.55 (assume @p16 (forall @t13 (=> @t10 (= @t1 tptp.empty_set)))) % 0.30/0.55 (assume @p17 (forall @t3 (not (and @t4 @t9)))) % 0.30/0.55 (assume @p18 (forall @t13 (exists @t21 (tptp.element @t2 @t1)))) % 0.30/0.55 (assume @p19 (forall @t13 @t23)) % 0.30/0.55 (assume @p20 (forall @t13 (and (not (tptp.empty @t22)) (tptp.cup_closed @t22) (tptp.diff_closed @t22) @t23))) % 0.30/0.55 (assume @p21 @t25) % 0.30/0.55 (assume @p22 (exists @t13 (and @t26 @t15 (tptp.cap_closed @t1) @t14 @t17))) % 0.30/0.55 (assume @p23 (exists @t13 (and @t26 @t18))) % 0.30/0.55 (assume @p24 (forall @t13 (exists @t21 (and @t20 @t9 (tptp.relation @t2) (tptp.function @t2) (tptp.one_to_one @t2) (tptp.epsilon_transitive @t2) (tptp.epsilon_connected @t2) (tptp.ordinal @t2) (tptp.natural @t2) @t19)))) % 0.30/0.55 (assume @p25 (forall @t13 (=> @t26 (exists @t21 (and @t20 @t27 @t19))))) % 0.30/0.55 (assume @p26 (forall @t13 (=> @t26 (exists @t21 (and @t20 @t27))))) % 0.30/0.55 (assume @p27 (forall @t13 (exists @t21 (and @t20 @t9)))) % 0.30/0.55 (assume @p28 (exists @t13 @t10)) % 0.30/0.55 (assume @p29 (exists @t13 @t26)) % 0.30/0.55 (assume @p30 @t28) % 0.30/0.55 (assume @p31 true) % 0.30/0.55 (step @p32 :rule bool-impl-elim :args (@t24 @t19)) % 0.30/0.55 (step @p33 :rule cong :premises (@p32) :args (@t25)) % 0.30/0.55 (step @p34 :rule eq_resolve :premises (@p21 @p33)) % 0.30/0.55 (step @p35 :rule cong :premises (@p33) :args (@t28)) % 0.30/0.55 (step @p36 :rule eq_resolve :premises (@p30 @p35)) % 0.30/0.55 (step @p37 false :rule chain_m_resolution :premises (@p36 @p34) :args (false (@list false) (@list (forall @t3 (or (not @t24) @t19))))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------