%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET063+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 : n017.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:12 AM UTC 2026 % Result : Theorem 0.36s 0.56s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET063+4 : TPTP v9.2.1. Released v2.2.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n017.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 14:48:31 EDT 2026 % 0.17/0.34 % CPUTime : % 0.26/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.36/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.36/0.56 % SZS status Theorem % 0.36/0.56 % SZS output start Proof % 0.36/0.56 ( % 0.36/0.56 (declare-sort $$unsorted 0) % 0.36/0.56 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.difference (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.product (-> $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.empty_set $$unsorted) % 0.36/0.56 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.power_set (-> $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.equal_set (-> $$unsorted $$unsorted Bool)) % 0.36/0.56 (declare-const tptp.sum (-> $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.36/0.56 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.36/0.56 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.36/0.56 (define @t1 () (@var "B" $$unsorted)) % 0.36/0.56 (define @t2 () (@var "X" $$unsorted)) % 0.36/0.56 (define @t3 () (tptp.member @t2 @t1)) % 0.36/0.56 (define @t4 () (@var "A" $$unsorted)) % 0.36/0.56 (define @t5 () (tptp.member @t2 @t4)) % 0.36/0.56 (define @t6 () (@list @t2)) % 0.36/0.56 (define @t7 () (forall @t6 (=> @t5 @t3))) % 0.36/0.56 (define @t8 () (tptp.subset @t4 @t1)) % 0.36/0.56 (define @t9 () (= @t8 @t7)) % 0.36/0.56 (define @t10 () (@list @t4 @t1)) % 0.36/0.56 (define @t11 () (forall @t10 @t9)) % 0.36/0.56 (define @t12 () (@list @t2 @t4)) % 0.36/0.56 (define @t13 () (@list @t2 @t4 @t1)) % 0.36/0.56 (define @t14 () (tptp.member @t2 tptp.empty_set)) % 0.36/0.56 (define @t15 () (not @t14)) % 0.36/0.56 (define @t16 () (@var "E" $$unsorted)) % 0.36/0.56 (define @t17 () (= @t2 @t4)) % 0.36/0.56 (define @t18 () (@var "Y" $$unsorted)) % 0.36/0.56 (define @t19 () (tptp.member @t2 @t18)) % 0.36/0.56 (define @t20 () (tptp.member @t18 @t4)) % 0.36/0.56 (define @t21 () (@list @t18)) % 0.36/0.56 (define @t22 () (forall (@list @t4) (tptp.equal_set (tptp.intersection @t4 tptp.empty_set) tptp.empty_set))) % 0.36/0.56 (define @t23 () (@quantifiers_skolemize @t22 0)) % 0.36/0.56 (define @t24 () (tptp.intersection @t23 tptp.empty_set)) % 0.36/0.56 (define @t25 () (@list @t24 tptp.empty_set)) % 0.36/0.56 (define @t26 () (tptp.member @t2 @t24)) % 0.36/0.56 (define @t27 () (forall @t6 (or @t15 @t26))) % 0.36/0.56 (define @t28 () (@quantifiers_skolemize @t27 0)) % 0.36/0.56 (define @t29 () (tptp.member @t28 tptp.empty_set)) % 0.36/0.56 (define @t30 () (not @t29)) % 0.36/0.56 (define @t31 () (or @t30 (tptp.member @t28 @t24))) % 0.36/0.56 (define @t32 () (@list true)) % 0.36/0.56 (define @t33 () (not @t31)) % 0.36/0.56 (define @t34 () (not @t27)) % 0.36/0.56 (define @t35 () (tptp.subset tptp.empty_set @t24)) % 0.36/0.56 (define @t36 () (= @t35 @t27)) % 0.36/0.56 (define @t37 () (@list false false)) % 0.36/0.56 (define @t38 () (tptp.subset @t24 tptp.empty_set)) % 0.36/0.56 (define @t39 () (and @t38 @t35)) % 0.36/0.56 (define @t40 () (tptp.equal_set @t24 tptp.empty_set)) % 0.36/0.56 (define @t41 () (= @t40 @t39)) % 0.36/0.56 (define @t42 () (not @t39)) % 0.36/0.56 (define @t43 () (@list true false)) % 0.36/0.56 (define @t44 () (forall @t6 (or (not @t26) @t14))) % 0.36/0.56 (define @t45 () (= @t38 @t44)) % 0.36/0.56 (define @t46 () (not @t44)) % 0.36/0.56 (define @t47 () (@quantifiers_skolemize @t44 0)) % 0.36/0.56 (define @t48 () (tptp.member @t47 tptp.empty_set)) % 0.36/0.56 (define @t49 () (tptp.member @t47 @t24)) % 0.36/0.56 (define @t50 () (not @t49)) % 0.36/0.56 (define @t51 () (or @t50 @t48)) % 0.36/0.56 (define @t52 () (not @t51)) % 0.36/0.56 (define @t53 () (@list @t51)) % 0.36/0.56 (define @t54 () (and (tptp.member @t47 @t23) @t48)) % 0.36/0.56 (define @t55 () (= @t49 @t54)) % 0.36/0.56 (assume @p1 @t11) % 0.36/0.56 (assume @p2 (forall @t10 (= (tptp.equal_set @t4 @t1) (and @t8 (tptp.subset @t1 @t4))))) % 0.36/0.56 (assume @p3 (forall @t12 (= (tptp.member @t2 (tptp.power_set @t4)) (tptp.subset @t2 @t4)))) % 0.36/0.56 (assume @p4 (forall @t13 (= (tptp.member @t2 (tptp.intersection @t4 @t1)) (and @t5 @t3)))) % 0.36/0.56 (assume @p5 (forall @t13 (= (tptp.member @t2 (tptp.union @t4 @t1)) (or @t5 @t3)))) % 0.36/0.56 (assume @p6 (forall @t6 @t15)) % 0.36/0.56 (assume @p7 (forall (@list @t1 @t4 @t16) (= (tptp.member @t1 (tptp.difference @t16 @t4)) (and (tptp.member @t1 @t16) (not (tptp.member @t1 @t4)))))) % 0.36/0.56 (assume @p8 (forall @t12 (= (tptp.member @t2 (tptp.singleton @t4)) @t17))) % 0.36/0.56 (assume @p9 (forall @t13 (= (tptp.member @t2 (tptp.unordered_pair @t4 @t1)) (or @t17 (= @t2 @t1))))) % 0.36/0.56 (assume @p10 (forall @t12 (= (tptp.member @t2 (tptp.sum @t4)) (exists @t21 (and @t20 @t19))))) % 0.36/0.56 (assume @p11 (forall @t12 (= (tptp.member @t2 (tptp.product @t4)) (forall @t21 (=> @t20 @t19))))) % 0.36/0.56 (assume @p12 (not @t22)) % 0.36/0.56 (assume @p13 true) % 0.36/0.56 (step @p14 :rule bool-impl-elim :args (@t5 @t3)) % 0.36/0.57 (step @p15 :rule cong :premises (@p14) :args (@t7)) % 0.36/0.57 (step @p16 :rule refl :args (@t8)) % 0.36/0.57 (step @p17 :rule cong :premises (@p16 @p15) :args (@t9)) % 0.36/0.57 (step @p18 :rule cong :premises (@p17) :args (@t11)) % 0.36/0.57 (step @p19 :rule eq_resolve :premises (@p1 @p18)) % 0.36/0.57 (step @p20 :rule instantiate :premises (@p19) :args (@t25)) % 0.36/0.57 (step @p21 :rule instantiate :premises (@p19) :args ((@list tptp.empty_set @t24))) % 0.36/0.57 (step @p22 :rule instantiate :premises (@p6) :args ((@list @t28))) % 0.36/0.57 (step @p23 :rule bool-double-not-elim :args (@t29)) % 0.36/0.57 (step @p24 :rule refl :args (@t31)) % 0.36/0.57 (step @p25 :rule nary_cong :premises (@p24 @p23) :args ((or @t31 (not @t30)))) % 0.36/0.57 (step @p26 :rule cnf_or_neg :args (@t31 0)) % 0.36/0.57 (step @p27 :rule eq_resolve :premises (@p26 @p25)) % 0.36/0.57 (step @p28 :rule reordering :premises (@p27) :args ((or @t29 @t31))) % 0.36/0.57 (step @p29 :rule chain_m_resolution :premises (@p28 @p22) :args (@t31 @t32 (@list @t29))) % 0.36/0.57 (step @p30 :rule refl :args (@t33)) % 0.36/0.57 (step @p31 :rule bool-double-not-elim :args (@t27)) % 0.36/0.57 (step @p32 :rule nary_cong :premises (@p31 @p30) :args ((or (not @t34) @t33))) % 0.36/0.57 (assume-push @p79 @t34) % 0.36/0.57 (step @p34 :rule skolemize :premises (@p79)) % 0.36/0.57 (step-pop @p80 :rule scope :premises (@p34)) % 0.36/0.57 (step @p35 :rule process_scope :premises (@p80) :args (@t33)) % 0.36/0.57 (step @p37 :rule implies_elim :premises (@p35)) % 0.36/0.57 (step @p38 :rule eq_resolve :premises (@p37 @p32)) % 0.36/0.57 (step @p39 :rule chain_m_resolution :premises (@p38 @p29) :args (@t27 (@list false) (@list @t31))) % 0.36/0.57 (step @p40 :rule cnf_equiv_pos2 :args (@t36)) % 0.36/0.57 (step @p41 :rule reordering :premises (@p40) :args ((or @t35 @t34 (not @t36)))) % 0.36/0.57 (step @p42 :rule chain_m_resolution :premises (@p41 @p39 @p21) :args (@t35 @t37 (@list @t27 @t36))) % 0.36/0.57 (step @p43 :rule instantiate :premises (@p2) :args (@t25)) % 0.36/0.57 (step @p44 :rule skolemize :premises (@p12)) % 0.36/0.57 (step @p45 :rule cnf_equiv_pos2 :args (@t41)) % 0.36/0.57 (step @p46 :rule reordering :premises (@p45) :args ((or @t40 @t42 (not @t41)))) % 0.36/0.57 (step @p47 :rule chain_m_resolution :premises (@p46 @p44 @p43) :args (@t42 @t43 (@list @t40 @t41))) % 0.36/0.57 (step @p48 :rule cnf_and_neg :args (@t39)) % 0.36/0.57 (step @p49 :rule chain_m_resolution :premises (@p48 @p47 @p42) :args ((not @t38) @t43 (@list @t39 @t35))) % 0.36/0.57 (step @p50 :rule cnf_equiv_pos2 :args (@t45)) % 0.36/0.57 (step @p51 :rule reordering :premises (@p50) :args ((or @t38 @t46 (not @t45)))) % 0.36/0.57 (step @p52 :rule chain_m_resolution :premises (@p51 @p49 @p20) :args (@t46 @t43 (@list @t38 @t45))) % 0.36/0.57 (step @p53 :rule refl :args (@t52)) % 0.36/0.57 (step @p54 :rule bool-double-not-elim :args (@t44)) % 0.36/0.57 (step @p55 :rule nary_cong :premises (@p54 @p53) :args ((or (not @t46) @t52))) % 0.36/0.57 (assume-push @p81 @t46) % 0.36/0.57 (step @p57 :rule skolemize :premises (@p81)) % 0.36/0.57 (step-pop @p82 :rule scope :premises (@p57)) % 0.36/0.57 (step @p58 :rule process_scope :premises (@p82) :args (@t52)) % 0.36/0.57 (step @p60 :rule implies_elim :premises (@p58)) % 0.36/0.57 (step @p61 :rule eq_resolve :premises (@p60 @p55)) % 0.36/0.57 (step @p62 :rule chain_m_resolution :premises (@p61 @p52) :args (@t52 @t32 (@list @t44))) % 0.36/0.57 (step @p63 :rule cnf_or_neg :args (@t51 1)) % 0.36/0.57 (step @p64 :rule chain_m_resolution :premises (@p63 @p62) :args ((not @t48) @t32 @t53)) % 0.36/0.57 (step @p65 :rule instantiate :premises (@p4) :args ((@list @t47 @t23 tptp.empty_set))) % 0.36/0.57 (step @p66 :rule bool-double-not-elim :args (@t49)) % 0.36/0.57 (step @p67 :rule refl :args (@t51)) % 0.36/0.57 (step @p68 :rule nary_cong :premises (@p67 @p66) :args ((or @t51 (not @t50)))) % 0.36/0.57 (step @p69 :rule cnf_or_neg :args (@t51 0)) % 0.36/0.57 (step @p70 :rule eq_resolve :premises (@p69 @p68)) % 0.36/0.57 (step @p71 :rule reordering :premises (@p70) :args ((or @t49 @t51))) % 0.36/0.57 (step @p72 :rule chain_m_resolution :premises (@p71 @p62) :args (@t49 @t32 @t53)) % 0.36/0.57 (step @p73 :rule cnf_equiv_pos1 :args (@t55)) % 0.36/0.57 (step @p74 :rule reordering :premises (@p73) :args ((or @t50 @t54 (not @t55)))) % 0.36/0.57 (step @p75 :rule chain_m_resolution :premises (@p74 @p72 @p65) :args (@t54 @t37 (@list @t49 @t55))) % 0.36/0.57 (step @p76 :rule cnf_and_pos :args (@t54 1)) % 0.36/0.57 (step @p77 :rule reordering :premises (@p76) :args ((or @t48 (not @t54)))) % 0.36/0.57 (step @p78 false :rule chain_m_resolution :premises (@p77 @p75 @p64) :args (false (@list false true) (@list @t54 @t48))) % 0.36/0.57 ) % 0.36/0.57 % SZS output end Proof % 0.36/0.57 % cvc5 exiting %------------------------------------------------------------------------------