%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET027+4 : TPTP v9.2.1. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n024.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:47:02 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 : SET027+4 : TPTP v9.2.1. Released v2.2.0. % 0.00/0.06 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.08/0.25 % Computer : n024.cluster.edu % 0.08/0.25 % Model : x86_64 x86_64 % 0.08/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.25 % Memory : 8042.1875MB % 0.08/0.25 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.25 % CPULimit : 300 % 0.08/0.25 % WCLimit : 300 % 0.08/0.25 % DateTime : Tue Jun 2 09:41:30 EDT 2026 % 0.08/0.25 % CPUTime : % 0.08/0.32 %----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.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.difference (-> $$unsorted $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.product (-> $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.empty_set $$unsorted) % 0.16/0.36 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.power_set (-> $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.equal_set (-> $$unsorted $$unsorted Bool)) % 0.16/0.36 (declare-const tptp.sum (-> $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.16/0.36 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.16/0.36 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.16/0.36 (define @t1 () (@var "B" $$unsorted)) % 0.16/0.36 (define @t2 () (@var "X" $$unsorted)) % 0.16/0.36 (define @t3 () (tptp.member @t2 @t1)) % 0.16/0.36 (define @t4 () (@var "A" $$unsorted)) % 0.16/0.36 (define @t5 () (tptp.member @t2 @t4)) % 0.16/0.36 (define @t6 () (@list @t2)) % 0.16/0.36 (define @t7 () (forall @t6 (=> @t5 @t3))) % 0.16/0.36 (define @t8 () (tptp.subset @t4 @t1)) % 0.16/0.36 (define @t9 () (= @t8 @t7)) % 0.16/0.36 (define @t10 () (@list @t4 @t1)) % 0.16/0.36 (define @t11 () (forall @t10 @t9)) % 0.16/0.36 (define @t12 () (@list @t2 @t4)) % 0.16/0.36 (define @t13 () (@list @t2 @t4 @t1)) % 0.16/0.36 (define @t14 () (@var "E" $$unsorted)) % 0.16/0.36 (define @t15 () (= @t2 @t4)) % 0.16/0.36 (define @t16 () (@var "Y" $$unsorted)) % 0.16/0.36 (define @t17 () (tptp.member @t2 @t16)) % 0.16/0.36 (define @t18 () (tptp.member @t16 @t4)) % 0.16/0.36 (define @t19 () (@list @t16)) % 0.16/0.36 (define @t20 () (@var "C" $$unsorted)) % 0.16/0.36 (define @t21 () (tptp.subset @t4 @t20)) % 0.16/0.36 (define @t22 () (tptp.subset @t1 @t20)) % 0.16/0.36 (define @t23 () (and @t8 @t22)) % 0.16/0.36 (define @t24 () (@list @t4 @t1 @t20)) % 0.16/0.36 (define @t25 () (forall @t24 (=> @t23 @t21))) % 0.16/0.36 (define @t26 () (not @t25)) % 0.16/0.36 (define @t27 () (not @t22)) % 0.16/0.36 (define @t28 () (not @t8)) % 0.16/0.36 (define @t29 () (or @t28 @t27 @t21)) % 0.16/0.36 (define @t30 () (forall @t24 @t29)) % 0.16/0.36 (define @t31 () (@quantifiers_skolemize @t30 2)) % 0.16/0.36 (define @t32 () (@quantifiers_skolemize @t30 0)) % 0.16/0.36 (define @t33 () (tptp.subset @t32 @t31)) % 0.16/0.36 (define @t34 () (@quantifiers_skolemize @t30 1)) % 0.16/0.36 (define @t35 () (tptp.subset @t34 @t31)) % 0.16/0.36 (define @t36 () (not @t35)) % 0.16/0.36 (define @t37 () (tptp.subset @t32 @t34)) % 0.16/0.36 (define @t38 () (not @t37)) % 0.16/0.36 (define @t39 () (or @t38 @t36 @t33)) % 0.16/0.36 (define @t40 () (@list true)) % 0.16/0.36 (define @t41 () (@list @t39)) % 0.16/0.36 (define @t42 () (tptp.member @t2 @t31)) % 0.16/0.36 (define @t43 () (not (tptp.member @t2 @t32))) % 0.16/0.36 (define @t44 () (forall @t6 (or @t43 @t42))) % 0.16/0.36 (define @t45 () (= @t33 @t44)) % 0.16/0.36 (define @t46 () (not @t44)) % 0.16/0.36 (define @t47 () (@quantifiers_skolemize @t44 0)) % 0.16/0.36 (define @t48 () (tptp.member @t47 @t31)) % 0.16/0.36 (define @t49 () (tptp.member @t47 @t32)) % 0.16/0.36 (define @t50 () (not @t49)) % 0.16/0.36 (define @t51 () (or @t50 @t48)) % 0.16/0.36 (define @t52 () (@list @t51)) % 0.16/0.36 (define @t53 () (tptp.member @t2 @t34)) % 0.16/0.36 (define @t54 () (forall @t6 (or (not @t53) @t42))) % 0.16/0.36 (define @t55 () (= @t35 @t54)) % 0.16/0.36 (define @t56 () (@list false false)) % 0.16/0.36 (define @t57 () (@list @t47)) % 0.16/0.36 (define @t58 () (forall @t6 (or @t43 @t53))) % 0.16/0.36 (define @t59 () (= @t37 @t58)) % 0.16/0.36 (define @t60 () (tptp.member @t47 @t34)) % 0.16/0.36 (define @t61 () (or @t50 @t60)) % 0.16/0.36 (define @t62 () (not @t60)) % 0.16/0.36 (define @t63 () (or @t62 @t48)) % 0.16/0.36 (assume @p1 @t11) % 0.16/0.36 (assume @p2 (forall @t10 (= (tptp.equal_set @t4 @t1) (and @t8 (tptp.subset @t1 @t4))))) % 0.16/0.36 (assume @p3 (forall @t12 (= (tptp.member @t2 (tptp.power_set @t4)) (tptp.subset @t2 @t4)))) % 0.16/0.36 (assume @p4 (forall @t13 (= (tptp.member @t2 (tptp.intersection @t4 @t1)) (and @t5 @t3)))) % 0.16/0.36 (assume @p5 (forall @t13 (= (tptp.member @t2 (tptp.union @t4 @t1)) (or @t5 @t3)))) % 0.16/0.36 (assume @p6 (forall @t6 (not (tptp.member @t2 tptp.empty_set)))) % 0.16/0.36 (assume @p7 (forall (@list @t1 @t4 @t14) (= (tptp.member @t1 (tptp.difference @t14 @t4)) (and (tptp.member @t1 @t14) (not (tptp.member @t1 @t4)))))) % 0.16/0.36 (assume @p8 (forall @t12 (= (tptp.member @t2 (tptp.singleton @t4)) @t15))) % 0.16/0.36 (assume @p9 (forall @t13 (= (tptp.member @t2 (tptp.unordered_pair @t4 @t1)) (or @t15 (= @t2 @t1))))) % 0.16/0.36 (assume @p10 (forall @t12 (= (tptp.member @t2 (tptp.sum @t4)) (exists @t19 (and @t18 @t17))))) % 0.16/0.36 (assume @p11 (forall @t12 (= (tptp.member @t2 (tptp.product @t4)) (forall @t19 (=> @t18 @t17))))) % 0.16/0.36 (assume @p12 @t26) % 0.16/0.36 (assume @p13 true) % 0.16/0.36 (step @p14 :rule bool-impl-elim :args (@t5 @t3)) % 0.16/0.36 (step @p15 :rule cong :premises (@p14) :args (@t7)) % 0.16/0.36 (step @p16 :rule refl :args (@t8)) % 0.16/0.36 (step @p17 :rule cong :premises (@p16 @p15) :args (@t9)) % 0.16/0.36 (step @p18 :rule cong :premises (@p17) :args (@t11)) % 0.16/0.36 (step @p19 :rule eq_resolve :premises (@p1 @p18)) % 0.16/0.36 (step @p20 :rule instantiate :premises (@p19) :args ((@list @t32 @t31))) % 0.16/0.36 (step @p21 :rule aci_norm :args ((= (or (or @t28 @t27) @t21) @t29))) % 0.16/0.36 (step @p22 :rule refl :args (@t21)) % 0.16/0.36 (step @p23 :rule bool-and-de-morgan :args (@t8 @t22 true)) % 0.16/0.36 (step @p24 :rule nary_cong :premises (@p23 @p22) :args ((or (not @t23) @t21))) % 0.16/0.36 (step @p25 :rule trans :premises (@p24 @p21)) % 0.16/0.36 (step @p26 :rule bool-impl-elim :args (@t23 @t21)) % 0.16/0.36 (step @p27 :rule trans :premises (@p26 @p25)) % 0.16/0.36 (step @p28 :rule cong :premises (@p27) :args (@t25)) % 0.16/0.36 (step @p29 :rule cong :premises (@p28) :args (@t26)) % 0.16/0.36 (step @p30 :rule eq_resolve :premises (@p12 @p29)) % 0.16/0.36 (step @p31 :rule skolemize :premises (@p30)) % 0.16/0.36 (step @p32 :rule cnf_or_neg :args (@t39 2)) % 0.16/0.36 (step @p33 :rule chain_m_resolution :premises (@p32 @p31) :args ((not @t33) @t40 @t41)) % 0.16/0.36 (step @p34 :rule cnf_equiv_pos2 :args (@t45)) % 0.16/0.36 (step @p35 :rule reordering :premises (@p34) :args ((or @t33 @t46 (not @t45)))) % 0.16/0.36 (step @p36 :rule chain_m_resolution :premises (@p35 @p33 @p20) :args (@t46 (@list true false) (@list @t33 @t45))) % 0.16/0.36 (step @p37 :rule skolemize :premises (@p36)) % 0.16/0.36 (step @p38 :rule cnf_or_neg :args (@t51 1)) % 0.16/0.36 (step @p39 :rule chain_m_resolution :premises (@p38 @p37) :args ((not @t48) @t40 @t52)) % 0.16/0.36 (step @p40 :rule instantiate :premises (@p19) :args ((@list @t34 @t31))) % 0.16/0.36 (step @p41 :rule bool-double-not-elim :args (@t35)) % 0.16/0.36 (step @p42 :rule refl :args (@t39)) % 0.16/0.36 (step @p43 :rule nary_cong :premises (@p42 @p41) :args ((or @t39 (not @t36)))) % 0.16/0.36 (step @p44 :rule cnf_or_neg :args (@t39 1)) % 0.16/0.36 (step @p45 :rule eq_resolve :premises (@p44 @p43)) % 0.16/0.36 (step @p46 :rule reordering :premises (@p45) :args ((or @t35 @t39))) % 0.16/0.36 (step @p47 :rule chain_m_resolution :premises (@p46 @p31) :args (@t35 @t40 @t41)) % 0.16/0.36 (step @p48 :rule cnf_equiv_pos1 :args (@t55)) % 0.16/0.36 (step @p49 :rule reordering :premises (@p48) :args ((or @t36 @t54 (not @t55)))) % 0.16/0.36 (step @p50 :rule chain_m_resolution :premises (@p49 @p47 @p40) :args (@t54 @t56 (@list @t35 @t55))) % 0.16/0.36 (step @p51 :rule instantiate :premises (@p50) :args (@t57)) % 0.16/0.36 (step @p52 :rule instantiate :premises (@p19) :args ((@list @t32 @t34))) % 0.16/0.36 (step @p53 :rule bool-double-not-elim :args (@t37)) % 0.16/0.36 (step @p54 :rule nary_cong :premises (@p42 @p53) :args ((or @t39 (not @t38)))) % 0.16/0.36 (step @p55 :rule cnf_or_neg :args (@t39 0)) % 0.16/0.36 (step @p56 :rule eq_resolve :premises (@p55 @p54)) % 0.16/0.36 (step @p57 :rule reordering :premises (@p56) :args ((or @t37 @t39))) % 0.16/0.36 (step @p58 :rule chain_m_resolution :premises (@p57 @p31) :args (@t37 @t40 @t41)) % 0.16/0.36 (step @p59 :rule cnf_equiv_pos1 :args (@t59)) % 0.16/0.36 (step @p60 :rule reordering :premises (@p59) :args ((or @t38 @t58 (not @t59)))) % 0.16/0.36 (step @p61 :rule chain_m_resolution :premises (@p60 @p58 @p52) :args (@t58 @t56 (@list @t37 @t59))) % 0.16/0.36 (step @p62 :rule instantiate :premises (@p61) :args (@t57)) % 0.16/0.36 (step @p63 :rule bool-double-not-elim :args (@t49)) % 0.16/0.36 (step @p64 :rule refl :args (@t51)) % 0.16/0.36 (step @p65 :rule nary_cong :premises (@p64 @p63) :args ((or @t51 (not @t50)))) % 0.16/0.36 (step @p66 :rule cnf_or_neg :args (@t51 0)) % 0.16/0.36 (step @p67 :rule eq_resolve :premises (@p66 @p65)) % 0.16/0.36 (step @p68 :rule reordering :premises (@p67) :args ((or @t49 @t51))) % 0.16/0.36 (step @p69 :rule chain_m_resolution :premises (@p68 @p37) :args (@t49 @t40 @t52)) % 0.16/0.36 (step @p70 :rule cnf_or_pos :args (@t61)) % 0.16/0.36 (step @p71 :rule reordering :premises (@p70) :args ((or @t50 @t60 (not @t61)))) % 0.16/0.36 (step @p72 :rule chain_m_resolution :premises (@p71 @p69 @p62) :args (@t60 @t56 (@list @t49 @t61))) % 0.16/0.36 (step @p73 :rule cnf_or_pos :args (@t63)) % 0.16/0.36 (step @p74 :rule reordering :premises (@p73) :args ((or @t48 @t62 (not @t63)))) % 0.16/0.36 (step @p75 false :rule chain_m_resolution :premises (@p74 @p72 @p51 @p39) :args (false (@list false false true) (@list @t60 @t63 @t48))) % 0.16/0.36 ) % 0.16/0.36 % SZS output end Proof % 0.16/0.36 % cvc5 exiting %------------------------------------------------------------------------------