%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU115+1 : TPTP v9.2.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n020.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:35 AM UTC 2026 % Result : Theorem 0.40s 0.58s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU115+1 : TPTP v9.2.1. Released v3.2.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n020.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % 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:25 EDT 2026 % 0.17/0.35 % CPUTime : % 0.29/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.58 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.58 % SZS status Theorem % 0.40/0.58 % SZS output start Proof % 0.40/0.58 ( % 0.40/0.58 (declare-sort $$unsorted 0) % 0.40/0.58 (declare-const tptp.relation (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.function (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.empty_set $$unsorted) % 0.40/0.58 (declare-const tptp.one_to_one (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.epsilon_connected (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.ordinal (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.element (-> $$unsorted $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.cup_closed (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.40/0.58 (declare-const tptp.epsilon_transitive (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.cap_closed (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.diff_closed (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.natural (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.preboolean (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.40/0.58 (declare-const tptp.finite (-> $$unsorted Bool)) % 0.40/0.58 (declare-const tptp.finite_subsets (-> $$unsorted $$unsorted)) % 0.40/0.58 (define @t1 () (@var "A" $$unsorted)) % 0.40/0.58 (define @t2 () (@var "B" $$unsorted)) % 0.40/0.58 (define @t3 () (@list @t1 @t2)) % 0.40/0.58 (define @t4 () (tptp.in @t1 @t2)) % 0.40/0.58 (define @t5 () (tptp.element @t1 @t2)) % 0.40/0.58 (define @t6 () (@var "C" $$unsorted)) % 0.40/0.58 (define @t7 () (tptp.element @t2 (tptp.powerset @t6))) % 0.40/0.58 (define @t8 () (@list @t1 @t2 @t6)) % 0.40/0.58 (define @t9 () (@list @t2)) % 0.40/0.58 (define @t10 () (@list @t1)) % 0.40/0.58 (define @t11 () (tptp.diff_closed @t1)) % 0.40/0.58 (define @t12 () (tptp.cup_closed @t1)) % 0.40/0.58 (define @t13 () (and @t12 @t11)) % 0.40/0.58 (define @t14 () (tptp.preboolean @t1)) % 0.40/0.58 (define @t15 () (tptp.finite @t2)) % 0.40/0.58 (define @t16 () (tptp.finite_subsets @t1)) % 0.40/0.58 (define @t17 () (tptp.finite @t1)) % 0.40/0.58 (define @t18 () (tptp.empty @t1)) % 0.40/0.58 (define @t19 () (forall @t10 (=> @t18 @t17))) % 0.40/0.58 (define @t20 () (tptp.powerset @t1)) % 0.40/0.58 (define @t21 () (tptp.element @t2 @t20)) % 0.40/0.58 (define @t22 () (tptp.empty @t2)) % 0.40/0.58 (define @t23 () (tptp.preboolean @t16)) % 0.40/0.58 (define @t24 () (not (tptp.empty @t20))) % 0.40/0.58 (define @t25 () (not @t18)) % 0.40/0.58 (define @t26 () (tptp.singleton @t1)) % 0.40/0.58 (define @t27 () (not (tptp.empty @t26))) % 0.40/0.58 (define @t28 () (not @t22)) % 0.40/0.58 (define @t29 () (tptp.empty tptp.empty_set)) % 0.40/0.58 (define @t30 () (tptp.singleton tptp.empty_set)) % 0.40/0.58 (define @t31 () (tptp.finite_subsets tptp.empty_set)) % 0.40/0.58 (define @t32 () (= @t16 @t20)) % 0.40/0.58 (define @t33 () (forall @t10 (=> @t17 @t32))) % 0.40/0.58 (define @t34 () (tptp.powerset tptp.empty_set)) % 0.40/0.58 (define @t35 () (= @t31 @t34)) % 0.40/0.58 (define @t36 () (@list tptp.empty_set)) % 0.40/0.58 (define @t37 () (tptp.finite tptp.empty_set)) % 0.40/0.58 (define @t38 () (not @t29)) % 0.40/0.58 (define @t39 () (or @t38 @t37)) % 0.40/0.58 (define @t40 () (not @t37)) % 0.40/0.58 (define @t41 () (or @t40 @t35)) % 0.40/0.58 (assume @p1 (forall @t3 (tptp.subset @t1 @t1))) % 0.40/0.58 (assume @p2 (forall @t3 (=> @t4 (not (tptp.in @t2 @t1))))) % 0.40/0.58 (assume @p3 (forall @t3 (=> @t4 @t5))) % 0.40/0.58 (assume @p4 (forall @t8 (=> (and @t4 @t7) (tptp.element @t1 @t6)))) % 0.40/0.58 (assume @p5 (forall @t8 (not (and @t4 @t7 (tptp.empty @t6))))) % 0.40/0.58 (assume @p6 (forall @t10 (exists @t9 (tptp.element @t2 @t1)))) % 0.40/0.58 (assume @p7 (forall @t10 (=> @t14 @t13))) % 0.40/0.58 (assume @p8 (forall @t10 (=> @t13 @t14))) % 0.40/0.58 (assume @p9 (forall @t3 (=> (tptp.element @t2 @t16) @t15))) % 0.40/0.58 (assume @p10 @t19) % 0.40/0.58 (assume @p11 (forall @t10 (=> @t17 (forall @t9 (=> @t21 @t15))))) % 0.40/0.58 (assume @p12 (forall @t3 (=> @t5 (or @t22 @t4)))) % 0.40/0.58 (assume @p13 (forall @t3 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2)))) % 0.40/0.58 (assume @p14 (forall @t3 (not (and @t4 @t22)))) % 0.40/0.58 (assume @p15 (forall @t3 (not (and @t18 (not (= @t1 @t2)) @t22)))) % 0.40/0.58 (assume @p16 (forall @t10 @t23)) % 0.40/0.58 (assume @p17 (forall @t10 (and @t24 (tptp.cup_closed @t20) (tptp.diff_closed @t20) (tptp.preboolean @t20)))) % 0.40/0.58 (assume @p18 (forall @t10 (and (not (tptp.empty @t16)) (tptp.cup_closed @t16) (tptp.diff_closed @t16) @t23))) % 0.40/0.58 (assume @p19 (exists @t10 (and @t25 @t12 (tptp.cap_closed @t1) @t11 @t14))) % 0.40/0.58 (assume @p20 (forall @t10 (and @t27 (tptp.finite @t26)))) % 0.40/0.58 (assume @p21 (exists @t10 (and @t25 @t17))) % 0.40/0.58 (assume @p22 (forall @t10 (exists @t9 (and @t21 @t22 (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) @t15)))) % 0.40/0.58 (assume @p23 (forall @t10 (=> @t25 (exists @t9 (and @t21 @t28 @t15))))) % 0.40/0.58 (assume @p24 (forall @t10 @t24)) % 0.40/0.58 (assume @p25 (forall @t10 @t27)) % 0.40/0.58 (assume @p26 (forall @t10 (=> @t25 (exists @t9 (and @t21 @t28))))) % 0.40/0.58 (assume @p27 (forall @t10 (exists @t9 (and @t21 @t22)))) % 0.40/0.58 (assume @p28 @t29) % 0.40/0.58 (assume @p29 (exists @t10 @t18)) % 0.40/0.58 (assume @p30 (exists @t10 @t25)) % 0.40/0.58 (assume @p31 (forall @t10 (=> @t18 (= @t1 tptp.empty_set)))) % 0.40/0.58 (assume @p32 (not (= @t31 @t30))) % 0.40/0.58 (assume @p33 @t33) % 0.40/0.58 (assume @p34 (= @t34 @t30)) % 0.40/0.58 (assume @p35 true) % 0.40/0.58 (step @p36 :rule false_intro :premises (@p32)) % 0.40/0.58 (step @p37 :rule refl :args (@t31)) % 0.40/0.58 (step @p38 :rule cong :premises (@p37 @p34) :args (@t35)) % 0.40/0.58 (step @p39 :rule trans :premises (@p38 @p36)) % 0.40/0.58 (step @p40 :rule false_elim :premises (@p39)) % 0.40/0.58 (step @p41 :rule bool-impl-elim :args (@t17 @t32)) % 0.40/0.58 (step @p42 :rule cong :premises (@p41) :args (@t33)) % 0.40/0.58 (step @p43 :rule eq_resolve :premises (@p33 @p42)) % 0.40/0.58 (step @p44 :rule instantiate :premises (@p43) :args (@t36)) % 0.40/0.58 (step @p45 :rule bool-impl-elim :args (@t18 @t17)) % 0.40/0.58 (step @p46 :rule cong :premises (@p45) :args (@t19)) % 0.40/0.58 (step @p47 :rule eq_resolve :premises (@p10 @p46)) % 0.40/0.58 (step @p48 :rule instantiate :premises (@p47) :args (@t36)) % 0.40/0.58 (step @p49 :rule cnf_or_pos :args (@t39)) % 0.40/0.58 (step @p50 :rule reordering :premises (@p49) :args ((or @t38 @t37 (not @t39)))) % 0.40/0.58 (step @p51 :rule chain_m_resolution :premises (@p50 @p28 @p48) :args (@t37 (@list false false) (@list @t29 @t39))) % 0.40/0.58 (step @p52 :rule cnf_or_pos :args (@t41)) % 0.40/0.58 (step @p53 :rule reordering :premises (@p52) :args ((or @t40 @t35 (not @t41)))) % 0.40/0.58 (step @p54 false :rule chain_m_resolution :premises (@p53 @p51 @p44 @p40) :args (false (@list false false true) (@list @t37 @t41 @t35))) % 0.40/0.58 ) % 0.40/0.58 % SZS output end Proof % 0.40/0.58 % cvc5 exiting %------------------------------------------------------------------------------