%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET617+3 : 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:48:15 AM UTC 2026 % Result : Theorem 0.31s 0.55s % Output : Proof 0.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET617+3 : TPTP v9.2.1. Released v2.2.0. % 0.13/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 16:03:31 EDT 2026 % 0.17/0.34 % CPUTime : % 0.31/0.48 %----Proving TF0_NAR, FOF, or CNF % 0.31/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.31/0.55 % SZS status Theorem % 0.31/0.55 % SZS output start Proof % 0.31/0.55 ( % 0.31/0.55 (declare-sort $$unsorted 0) % 0.31/0.55 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.31/0.55 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.31/0.55 (declare-const tptp.empty_set $$unsorted) % 0.31/0.55 (declare-const tptp.symmetric_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.31/0.55 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.31/0.55 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.31/0.55 (declare-const tptp.difference (-> $$unsorted $$unsorted $$unsorted)) % 0.31/0.55 (define @t1 () (@var "B" $$unsorted)) % 0.31/0.55 (define @t2 () (@var "C" $$unsorted)) % 0.31/0.55 (define @t3 () (tptp.symmetric_difference @t1 @t2)) % 0.31/0.55 (define @t4 () (@list @t1 @t2)) % 0.31/0.55 (define @t5 () (tptp.union @t1 tptp.empty_set)) % 0.31/0.55 (define @t6 () (@list @t1)) % 0.31/0.55 (define @t7 () (forall @t6 (= @t5 @t1))) % 0.31/0.55 (define @t8 () (tptp.difference @t1 tptp.empty_set)) % 0.31/0.55 (define @t9 () (forall @t6 (= @t8 @t1))) % 0.31/0.55 (define @t10 () (tptp.difference tptp.empty_set @t1)) % 0.31/0.55 (define @t11 () (forall @t6 (= @t10 tptp.empty_set))) % 0.31/0.55 (define @t12 () (tptp.subset @t1 @t2)) % 0.31/0.55 (define @t13 () (= @t1 @t2)) % 0.31/0.55 (define @t14 () (@var "D" $$unsorted)) % 0.31/0.55 (define @t15 () (tptp.member @t14 @t2)) % 0.31/0.55 (define @t16 () (tptp.member @t14 @t1)) % 0.31/0.55 (define @t17 () (@list @t14)) % 0.31/0.55 (define @t18 () (tptp.symmetric_difference tptp.empty_set @t1)) % 0.31/0.55 (define @t19 () (tptp.symmetric_difference @t1 tptp.empty_set)) % 0.31/0.55 (define @t20 () (and (= @t19 @t1) (= @t18 @t1))) % 0.31/0.55 (define @t21 () (forall @t6 @t20)) % 0.31/0.55 (define @t22 () (not @t21)) % 0.31/0.55 (define @t23 () (@var "BOUND_VARIABLE_7499" $$unsorted)) % 0.31/0.55 (define @t24 () (forall (@list @t23) (= @t23 (tptp.symmetric_difference @t23 tptp.empty_set)))) % 0.31/0.55 (define @t25 () (@quantifiers_skolemize @t24 0)) % 0.31/0.55 (define @t26 () (@list @t25)) % 0.31/0.55 (define @t27 () (tptp.difference @t25 tptp.empty_set)) % 0.31/0.55 (define @t28 () (= @t25 (tptp.symmetric_difference @t25 tptp.empty_set))) % 0.31/0.55 (define @t29 () (not @t28)) % 0.31/0.55 (define @t30 () (not @t24)) % 0.31/0.55 (define @t31 () (@list false)) % 0.31/0.55 (define @t32 () (@var "BOUND_VARIABLE_7505" $$unsorted)) % 0.31/0.55 (define @t33 () (forall (@list @t32) (= @t32 (tptp.symmetric_difference tptp.empty_set @t32)))) % 0.31/0.55 (define @t34 () (@quantifiers_skolemize @t33 0)) % 0.31/0.55 (define @t35 () (@list @t34)) % 0.31/0.55 (define @t36 () (tptp.difference @t34 tptp.empty_set)) % 0.31/0.55 (define @t37 () (= @t34 (tptp.symmetric_difference tptp.empty_set @t34))) % 0.31/0.55 (define @t38 () (not @t37)) % 0.31/0.55 (define @t39 () (not @t33)) % 0.31/0.55 (define @t40 () (= @t1 @t18)) % 0.31/0.55 (define @t41 () (forall @t6 @t40)) % 0.31/0.55 (define @t42 () (@list @t1)) % 0.31/0.55 (define @t43 () (= @t1 @t19)) % 0.31/0.55 (define @t44 () (forall @t6 @t43)) % 0.31/0.55 (define @t45 () (and @t44 @t41)) % 0.31/0.55 (assume @p1 (forall @t4 (= @t3 (tptp.union (tptp.difference @t1 @t2) (tptp.difference @t2 @t1))))) % 0.31/0.55 (assume @p2 @t7) % 0.31/0.55 (assume @p3 @t9) % 0.31/0.55 (assume @p4 @t11) % 0.31/0.55 (assume @p5 (forall @t6 (not (tptp.member @t1 tptp.empty_set)))) % 0.31/0.55 (assume @p6 (forall @t4 (= @t13 (and @t12 (tptp.subset @t2 @t1))))) % 0.31/0.55 (assume @p7 (forall @t4 (= (tptp.union @t1 @t2) (tptp.union @t2 @t1)))) % 0.31/0.55 (assume @p8 (forall @t4 (= @t3 (tptp.symmetric_difference @t2 @t1)))) % 0.31/0.55 (assume @p9 (forall @t4 (= @t13 (forall @t17 (= @t16 @t15))))) % 0.31/0.55 (assume @p10 (forall @t4 (= @t12 (forall @t17 (=> @t16 @t15))))) % 0.31/0.55 (assume @p11 (forall @t6 (tptp.subset @t1 @t1))) % 0.31/0.55 (assume @p12 (forall @t6 (= (tptp.empty @t1) (forall (@list @t2) (not (tptp.member @t2 @t1)))))) % 0.31/0.55 (assume @p13 @t22) % 0.31/0.55 (assume @p14 true) % 0.31/0.55 (step @p15 :rule instantiate :premises (@p1) :args ((@list @t25 tptp.empty_set))) % 0.31/0.55 (step @p16 :rule symm :premises (@p15)) % 0.31/0.55 (step @p17 :rule eq-symm :args (@t10 tptp.empty_set)) % 0.31/0.55 (step @p18 :rule cong :premises (@p17) :args (@t11)) % 0.31/0.55 (step @p19 :rule eq_resolve :premises (@p4 @p18)) % 0.31/0.55 (step @p20 :rule instantiate :premises (@p19) :args (@t26)) % 0.31/0.55 (step @p21 :rule refl :args (@t27)) % 0.31/0.55 (step @p22 :rule cong :premises (@p21 @p20) :args ((tptp.union @t27 tptp.empty_set))) % 0.31/0.55 (step @p23 :rule eq-symm :args (@t5 @t1)) % 0.31/0.55 (step @p24 :rule cong :premises (@p23) :args (@t7)) % 0.31/0.55 (step @p25 :rule eq_resolve :premises (@p2 @p24)) % 0.31/0.55 (step @p26 :rule instantiate :premises (@p25) :args ((@list @t27))) % 0.31/0.55 (step @p27 :rule eq-symm :args (@t8 @t1)) % 0.31/0.55 (step @p28 :rule cong :premises (@p27) :args (@t9)) % 0.31/0.55 (step @p29 :rule eq_resolve :premises (@p3 @p28)) % 0.31/0.55 (step @p30 :rule instantiate :premises (@p29) :args (@t26)) % 0.31/0.55 (step @p31 :rule trans :premises (@p30 @p26 @p22 @p16)) % 0.31/0.55 (step @p32 :rule refl :args (@t29)) % 0.31/0.55 (step @p33 :rule bool-double-not-elim :args (@t24)) % 0.31/0.55 (step @p34 :rule nary_cong :premises (@p33 @p32) :args ((or (not @t30) @t29))) % 0.31/0.55 (assume-push @p76 @t30) % 0.31/0.55 (step @p36 :rule skolemize :premises (@p76)) % 0.31/0.55 (step-pop @p77 :rule scope :premises (@p36)) % 0.31/0.55 (step @p37 :rule process_scope :premises (@p77) :args (@t29)) % 0.31/0.55 (step @p39 :rule implies_elim :premises (@p37)) % 0.31/0.55 (step @p40 :rule eq_resolve :premises (@p39 @p34)) % 0.31/0.55 (step @p41 :rule chain_m_resolution :premises (@p40 @p31) :args (@t24 @t31 (@list @t28))) % 0.31/0.55 (step @p42 :rule instantiate :premises (@p8) :args ((@list tptp.empty_set @t34))) % 0.31/0.55 (step @p43 :rule symm :premises (@p42)) % 0.31/0.55 (step @p44 :rule instantiate :premises (@p1) :args ((@list @t34 tptp.empty_set))) % 0.31/0.55 (step @p45 :rule symm :premises (@p44)) % 0.31/0.55 (step @p46 :rule instantiate :premises (@p19) :args (@t35)) % 0.31/0.55 (step @p47 :rule refl :args (@t36)) % 0.31/0.55 (step @p48 :rule cong :premises (@p47 @p46) :args ((tptp.union @t36 tptp.empty_set))) % 0.31/0.55 (step @p49 :rule instantiate :premises (@p25) :args ((@list @t36))) % 0.31/0.55 (step @p50 :rule instantiate :premises (@p29) :args (@t35)) % 0.31/0.55 (step @p51 :rule trans :premises (@p50 @p49 @p48 @p45 @p43)) % 0.31/0.55 (step @p52 :rule refl :args (@t38)) % 0.31/0.55 (step @p53 :rule bool-double-not-elim :args (@t33)) % 0.31/0.55 (step @p54 :rule nary_cong :premises (@p53 @p52) :args ((or (not @t39) @t38))) % 0.31/0.55 (assume-push @p78 @t39) % 0.31/0.55 (step @p56 :rule skolemize :premises (@p78)) % 0.31/0.55 (step-pop @p79 :rule scope :premises (@p56)) % 0.31/0.55 (step @p57 :rule process_scope :premises (@p79) :args (@t38)) % 0.31/0.55 (step @p59 :rule implies_elim :premises (@p57)) % 0.31/0.55 (step @p60 :rule eq_resolve :premises (@p59 @p54)) % 0.31/0.55 (step @p61 :rule chain_m_resolution :premises (@p60 @p51) :args (@t33 @t31 (@list @t37))) % 0.31/0.55 (step @p62 :rule alpha_equiv :args (@t41 @t42 (@list @t32))) % 0.31/0.55 (step @p63 :rule alpha_equiv :args (@t44 @t42 (@list @t23))) % 0.31/0.55 (step @p64 :rule nary_cong :premises (@p63 @p62) :args (@t45)) % 0.31/0.55 (step @p65 :rule quant-miniscope-and :args ((= (forall @t6 (and @t43 @t40)) @t45))) % 0.31/0.55 (step @p66 :rule trans :premises (@p65 @p64)) % 0.31/0.55 (step @p67 :rule eq-symm :args (@t18 @t1)) % 0.31/0.55 (step @p68 :rule eq-symm :args (@t19 @t1)) % 0.31/0.55 (step @p69 :rule nary_cong :premises (@p68 @p67) :args (@t20)) % 0.31/0.55 (step @p70 :rule cong :premises (@p69) :args (@t21)) % 0.31/0.55 (step @p71 :rule trans :premises (@p70 @p66)) % 0.31/0.55 (step @p72 :rule cong :premises (@p71) :args (@t22)) % 0.31/0.55 (step @p73 :rule eq_resolve :premises (@p13 @p72)) % 0.31/0.55 (step @p74 :rule not_and :premises (@p73)) % 0.31/0.55 (step @p75 false :rule chain_m_resolution :premises (@p74 @p61 @p41) :args (false (@list false false) (@list @t33 @t24))) % 0.31/0.55 ) % 0.31/0.55 % SZS output end Proof % 0.31/0.55 % cvc5 exiting %------------------------------------------------------------------------------