%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET954+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 : n012.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:49:03 AM UTC 2026 % Result : Theorem 0.16s 0.36s % Output : Proof 0.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.06 % Problem : SET954+1 : TPTP v9.2.1. Released v3.2.0. % 0.00/0.07 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.07/0.25 % Computer : n012.cluster.edu % 0.07/0.25 % Model : x86_64 x86_64 % 0.07/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.25 % Memory : 8042.1875MB % 0.07/0.25 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.25 % CPULimit : 300 % 0.07/0.25 % WCLimit : 300 % 0.07/0.25 % DateTime : Tue Jun 2 16:18:48 EDT 2026 % 0.07/0.25 % CPUTime : % 0.16/0.33 %----Proving TF0_NAR, FOF, or CNF % 0.16/0.36 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.16/0.36 % SZS status Theorem % 0.16/0.36 % SZS output start Proof % 0.16/0.36 ( % 0.16/0.36 (declare-sort $$unsorted 0) % 0.16/0.36 (declare-const tptp.cartesian_product2 (-> $$unsorted $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.16/0.36 (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.16/0.36 (define @t1 () (@var "A" $$unsorted)) % 0.16/0.36 (define @t2 () (@var "B" $$unsorted)) % 0.16/0.36 (define @t3 () (@list @t1 @t2)) % 0.16/0.36 (define @t4 () (tptp.unordered_pair @t1 @t2)) % 0.16/0.36 (define @t5 () (tptp.ordered_pair @t1 @t2)) % 0.16/0.36 (define @t6 () (@var "D" $$unsorted)) % 0.16/0.36 (define @t7 () (@var "C" $$unsorted)) % 0.16/0.36 (define @t8 () (tptp.in @t5 (tptp.cartesian_product2 @t7 @t6))) % 0.16/0.36 (define @t9 () (@list @t1 @t2 @t7 @t6)) % 0.16/0.36 (define @t10 () (tptp.empty @t1)) % 0.16/0.36 (define @t11 () (@list @t1)) % 0.16/0.36 (define @t12 () (tptp.in (tptp.ordered_pair @t2 @t1) (tptp.cartesian_product2 @t6 @t7))) % 0.16/0.36 (define @t13 () (forall @t9 (=> @t8 @t12))) % 0.16/0.36 (define @t14 () (not @t13)) % 0.16/0.36 (define @t15 () (forall @t9 (or (not @t8) @t12))) % 0.16/0.36 (define @t16 () (@quantifiers_skolemize @t15 2)) % 0.16/0.36 (define @t17 () (@quantifiers_skolemize @t15 3)) % 0.16/0.36 (define @t18 () (@quantifiers_skolemize @t15 0)) % 0.16/0.36 (define @t19 () (@quantifiers_skolemize @t15 1)) % 0.16/0.36 (define @t20 () (tptp.in (tptp.ordered_pair @t19 @t18) (tptp.cartesian_product2 @t17 @t16))) % 0.16/0.36 (define @t21 () (tptp.in (tptp.ordered_pair @t18 @t19) (tptp.cartesian_product2 @t16 @t17))) % 0.16/0.36 (define @t22 () (not @t21)) % 0.16/0.36 (define @t23 () (or @t22 @t20)) % 0.16/0.36 (define @t24 () (@list true)) % 0.16/0.36 (define @t25 () (@list @t23)) % 0.16/0.36 (define @t26 () (tptp.in @t18 @t16)) % 0.16/0.36 (define @t27 () (tptp.in @t19 @t17)) % 0.16/0.36 (define @t28 () (and @t27 @t26)) % 0.16/0.36 (define @t29 () (= @t20 @t28)) % 0.16/0.36 (define @t30 () (not @t28)) % 0.16/0.36 (define @t31 () (and @t26 @t27)) % 0.16/0.36 (define @t32 () (= @t21 @t31)) % 0.16/0.36 (define @t33 () (not @t31)) % 0.16/0.36 (define @t34 () (@list false)) % 0.16/0.36 (define @t35 () (@list @t31)) % 0.16/0.36 (assume @p1 (forall @t3 (=> (tptp.in @t1 @t2) (not (tptp.in @t2 @t1))))) % 0.16/0.36 (assume @p2 (forall @t3 (= @t4 (tptp.unordered_pair @t2 @t1)))) % 0.16/0.36 (assume @p3 (forall @t3 (= @t5 (tptp.unordered_pair @t4 (tptp.singleton @t1))))) % 0.16/0.36 (assume @p4 (forall @t3 (not (tptp.empty @t5)))) % 0.16/0.36 (assume @p5 (forall @t9 (= @t8 (and (tptp.in @t1 @t7) (tptp.in @t2 @t6))))) % 0.16/0.36 (assume @p6 (exists @t11 @t10)) % 0.16/0.36 (assume @p7 (exists @t11 (not @t10))) % 0.16/0.36 (assume @p8 @t14) % 0.16/0.36 (assume @p9 true) % 0.16/0.36 (step @p10 :rule instantiate :premises (@p5) :args ((@list @t19 @t18 @t17 @t16))) % 0.16/0.36 (step @p11 :rule bool-impl-elim :args (@t8 @t12)) % 0.16/0.36 (step @p12 :rule cong :premises (@p11) :args (@t13)) % 0.16/0.36 (step @p13 :rule cong :premises (@p12) :args (@t14)) % 0.16/0.36 (step @p14 :rule eq_resolve :premises (@p8 @p13)) % 0.16/0.36 (step @p15 :rule skolemize :premises (@p14)) % 0.16/0.36 (step @p16 :rule cnf_or_neg :args (@t23 1)) % 0.16/0.36 (step @p17 :rule chain_m_resolution :premises (@p16 @p15) :args ((not @t20) @t24 @t25)) % 0.16/0.36 (step @p18 :rule cnf_equiv_pos2 :args (@t29)) % 0.16/0.36 (step @p19 :rule reordering :premises (@p18) :args ((or @t20 @t30 (not @t29)))) % 0.16/0.36 (step @p20 :rule chain_m_resolution :premises (@p19 @p17 @p10) :args (@t30 (@list true false) (@list @t20 @t29))) % 0.16/0.36 (step @p21 :rule instantiate :premises (@p5) :args ((@list @t18 @t19 @t16 @t17))) % 0.16/0.36 (step @p22 :rule bool-double-not-elim :args (@t21)) % 0.16/0.36 (step @p23 :rule refl :args (@t23)) % 0.16/0.36 (step @p24 :rule nary_cong :premises (@p23 @p22) :args ((or @t23 (not @t22)))) % 0.16/0.36 (step @p25 :rule cnf_or_neg :args (@t23 0)) % 0.16/0.36 (step @p26 :rule eq_resolve :premises (@p25 @p24)) % 0.16/0.36 (step @p27 :rule reordering :premises (@p26) :args ((or @t21 @t23))) % 0.16/0.36 (step @p28 :rule chain_m_resolution :premises (@p27 @p15) :args (@t21 @t24 @t25)) % 0.16/0.36 (step @p29 :rule cnf_equiv_pos1 :args (@t32)) % 0.16/0.36 (step @p30 :rule reordering :premises (@p29) :args ((or @t22 @t31 (not @t32)))) % 0.16/0.36 (step @p31 :rule chain_m_resolution :premises (@p30 @p28 @p21) :args (@t31 (@list false false) (@list @t21 @t32))) % 0.16/0.36 (step @p32 :rule cnf_and_pos :args (@t31 0)) % 0.16/0.36 (step @p33 :rule reordering :premises (@p32) :args ((or @t26 @t33))) % 0.16/0.36 (step @p34 :rule chain_m_resolution :premises (@p33 @p31) :args (@t26 @t34 @t35)) % 0.16/0.36 (step @p35 :rule cnf_and_pos :args (@t31 1)) % 0.16/0.36 (step @p36 :rule reordering :premises (@p35) :args ((or @t27 @t33))) % 0.16/0.36 (step @p37 :rule chain_m_resolution :premises (@p36 @p31) :args (@t27 @t34 @t35)) % 0.16/0.36 (step @p38 :rule cnf_and_neg :args (@t28)) % 0.16/0.36 (step @p39 :rule reordering :premises (@p38) :args ((or @t28 (not @t26) (not @t27)))) % 0.16/0.36 (step @p40 false :rule chain_m_resolution :premises (@p39 @p37 @p34 @p20) :args (false (@list false false true) (@list @t27 @t26 @t28))) % 0.16/0.36 ) % 0.16/0.36 % SZS output end Proof % 0.16/0.36 % cvc5 exiting %------------------------------------------------------------------------------