%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET931+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 : n004.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:01 AM UTC 2026 % Result : Theorem 0.40s 0.56s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET931+1 : TPTP v9.2.1. Released v3.2.0. % 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.18/0.34 % Computer : n004.cluster.edu % 0.18/0.34 % Model : x86_64 x86_64 % 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.34 % Memory : 8042.1875MB % 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 300 % 0.18/0.34 % DateTime : Tue Jun 2 16:18:07 EDT 2026 % 0.18/0.34 % CPUTime : % 0.33/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.56 % SZS status Theorem % 0.40/0.56 % SZS output start Proof % 0.40/0.56 ( % 0.40/0.56 (declare-sort $$unsorted 0) % 0.40/0.56 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.set_difference (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.56 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.40/0.56 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.empty_set $$unsorted) % 0.40/0.56 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.40/0.56 (define @t1 () (@var "A" $$unsorted)) % 0.40/0.56 (define @t2 () (@var "B" $$unsorted)) % 0.40/0.56 (define @t3 () (@list @t1 @t2)) % 0.40/0.56 (define @t4 () (@var "C" $$unsorted)) % 0.40/0.56 (define @t5 () (tptp.unordered_pair @t2 @t4)) % 0.40/0.56 (define @t6 () (= @t1 @t5)) % 0.40/0.56 (define @t7 () (not @t6)) % 0.40/0.56 (define @t8 () (= @t1 (tptp.singleton @t4))) % 0.40/0.56 (define @t9 () (not @t8)) % 0.40/0.56 (define @t10 () (= @t1 (tptp.singleton @t2))) % 0.40/0.56 (define @t11 () (not @t10)) % 0.40/0.56 (define @t12 () (= @t1 tptp.empty_set)) % 0.40/0.56 (define @t13 () (not @t12)) % 0.40/0.56 (define @t14 () (not (and @t13 @t11 @t9 @t7))) % 0.40/0.56 (define @t15 () (tptp.subset @t1 @t5)) % 0.40/0.56 (define @t16 () (= @t15 @t14)) % 0.40/0.56 (define @t17 () (@list @t1 @t2 @t4)) % 0.40/0.56 (define @t18 () (forall @t17 @t16)) % 0.40/0.56 (define @t19 () (tptp.empty @t1)) % 0.40/0.56 (define @t20 () (@list @t1)) % 0.40/0.56 (define @t21 () (tptp.subset @t1 @t2)) % 0.40/0.56 (define @t22 () (tptp.set_difference @t1 @t2)) % 0.40/0.56 (define @t23 () (= (= @t22 tptp.empty_set) @t21)) % 0.40/0.56 (define @t24 () (forall @t3 @t23)) % 0.40/0.56 (define @t25 () (tptp.set_difference @t1 @t5)) % 0.40/0.56 (define @t26 () (= @t25 tptp.empty_set)) % 0.40/0.56 (define @t27 () (forall @t17 (= @t26 @t14))) % 0.40/0.56 (define @t28 () (not @t27)) % 0.40/0.56 (define @t29 () (not @t7)) % 0.40/0.56 (define @t30 () (not @t9)) % 0.40/0.56 (define @t31 () (not @t11)) % 0.40/0.56 (define @t32 () (not @t13)) % 0.40/0.56 (define @t33 () (or @t32 @t31 @t30 @t29)) % 0.40/0.56 (define @t34 () (= tptp.empty_set @t25)) % 0.40/0.56 (define @t35 () (or @t12 @t10 @t8 @t6)) % 0.40/0.56 (define @t36 () (forall @t17 (= @t35 @t34))) % 0.40/0.56 (define @t37 () (@quantifiers_skolemize @t36 2)) % 0.40/0.56 (define @t38 () (@quantifiers_skolemize @t36 1)) % 0.40/0.56 (define @t39 () (tptp.unordered_pair @t38 @t37)) % 0.40/0.56 (define @t40 () (@quantifiers_skolemize @t36 0)) % 0.40/0.56 (define @t41 () (tptp.subset @t40 @t39)) % 0.40/0.56 (define @t42 () (= @t40 @t39)) % 0.40/0.56 (define @t43 () (= @t40 (tptp.singleton @t37))) % 0.40/0.56 (define @t44 () (= @t40 (tptp.singleton @t38))) % 0.40/0.56 (define @t45 () (or (= @t40 tptp.empty_set) @t44 @t43 @t42)) % 0.40/0.56 (define @t46 () (forall @t17 (= @t15 @t35))) % 0.40/0.56 (define @t47 () (= @t41 @t45)) % 0.40/0.56 (define @t48 () (or (= tptp.empty_set @t40) @t44 @t43 @t42)) % 0.40/0.56 (define @t49 () (= @t48 @t41)) % 0.40/0.56 (define @t50 () (@list false)) % 0.40/0.56 (define @t51 () (= @t14 @t34)) % 0.40/0.56 (define @t52 () (= tptp.empty_set (tptp.set_difference @t40 @t39))) % 0.40/0.56 (define @t53 () (= @t52 @t48)) % 0.40/0.56 (define @t54 () (not @t53)) % 0.40/0.56 (define @t55 () (not @t36)) % 0.40/0.56 (define @t56 () (= @t45 @t52)) % 0.40/0.56 (define @t57 () (not @t56)) % 0.40/0.56 (define @t58 () (= tptp.empty_set @t22)) % 0.40/0.56 (define @t59 () (forall @t3 (= @t21 @t58))) % 0.40/0.56 (define @t60 () (= @t41 @t52)) % 0.40/0.56 (define @t61 () (= @t52 @t41)) % 0.40/0.56 (define @t62 () (not @t61)) % 0.40/0.56 (define @t63 () (not @t41)) % 0.40/0.56 (define @t64 () (not @t49)) % 0.40/0.56 (define @t65 () (not @t48)) % 0.40/0.56 (assume @p1 (forall @t3 (= (tptp.unordered_pair @t1 @t2) (tptp.unordered_pair @t2 @t1)))) % 0.40/0.56 (assume @p2 (tptp.empty tptp.empty_set)) % 0.40/0.56 (assume @p3 @t18) % 0.40/0.56 (assume @p4 (exists @t20 @t19)) % 0.40/0.56 (assume @p5 (exists @t20 (not @t19))) % 0.40/0.56 (assume @p6 (forall @t3 (tptp.subset @t1 @t1))) % 0.40/0.56 (assume @p7 @t24) % 0.40/0.56 (assume @p8 @t28) % 0.40/0.56 (assume @p9 true) % 0.40/0.56 (step @p10 :rule bool-double-not-elim :args (@t6)) % 0.40/0.56 (step @p11 :rule bool-double-not-elim :args (@t8)) % 0.40/0.56 (step @p12 :rule bool-double-not-elim :args (@t10)) % 0.40/0.56 (step @p13 :rule bool-double-not-elim :args (@t12)) % 0.40/0.56 (step @p14 :rule nary_cong :premises (@p13 @p12 @p11 @p10) :args (@t33)) % 0.40/0.56 (step @p15 :rule aci_norm :args ((= (or @t32 (or @t31 (or @t30 @t29))) @t33))) % 0.40/0.56 (step @p16 :rule trans :premises (@p15 @p14)) % 0.40/0.56 (step @p17 :rule bool-and-de-morgan :args (@t9 @t7 true)) % 0.40/0.56 (step @p18 :rule refl :args (@t31)) % 0.40/0.56 (step @p19 :rule nary_cong :premises (@p18 @p17) :args ((or @t31 (not (and @t9 @t7))))) % 0.40/0.56 (step @p20 :rule bool-and-de-morgan :args (@t11 @t9 (and @t7))) % 0.40/0.56 (step @p21 :rule trans :premises (@p20 @p19)) % 0.40/0.56 (step @p22 :rule refl :args (@t32)) % 0.40/0.56 (step @p23 :rule nary_cong :premises (@p22 @p21) :args ((or @t32 (not (and @t11 @t9 @t7))))) % 0.40/0.56 (step @p24 :rule bool-and-de-morgan :args (@t13 @t11 (and @t9 @t7))) % 0.40/0.56 (step @p25 :rule trans :premises (@p24 @p23)) % 0.40/0.56 (step @p26 :rule trans :premises (@p25 @p16)) % 0.40/0.56 (step @p27 :rule refl :args (@t15)) % 0.40/0.56 (step @p28 :rule cong :premises (@p27 @p26) :args (@t16)) % 0.40/0.56 (step @p29 :rule cong :premises (@p28) :args (@t18)) % 0.40/0.56 (step @p30 :rule eq_resolve :premises (@p3 @p29)) % 0.40/0.56 (step @p31 :rule refl :args (@t41)) % 0.40/0.56 (step @p32 :rule refl :args (@t42)) % 0.40/0.56 (step @p33 :rule refl :args (@t43)) % 0.40/0.56 (step @p34 :rule refl :args (@t44)) % 0.40/0.56 (step @p35 :rule eq-symm :args (@t40 tptp.empty_set)) % 0.40/0.56 (step @p36 :rule nary_cong :premises (@p35 @p34 @p33 @p32) :args (@t45)) % 0.40/0.56 (step @p37 :rule cong :premises (@p36 @p31) :args ((= @t45 @t41))) % 0.40/0.56 (step @p38 :rule eq-symm :args (@t41 @t45)) % 0.40/0.56 (step @p39 :rule trans :premises (@p38 @p37)) % 0.40/0.56 (step @p40 :rule refl :args (@t46)) % 0.40/0.56 (step @p41 :rule cong :premises (@p40 @p39) :args ((=> @t46 @t47))) % 0.40/0.56 (assume-push @p111 @t46) % 0.40/0.56 (step @p43 :rule instantiate :premises (@p30) :args ((@list @t40 @t38 @t37))) % 0.40/0.56 (step-pop @p112 :rule scope :premises (@p43)) % 0.40/0.56 (step @p44 :rule process_scope :premises (@p112) :args (@t47)) % 0.40/0.56 (step @p46 :rule eq_resolve :premises (@p44 @p41)) % 0.40/0.56 (step @p47 :rule implies_elim :premises (@p46)) % 0.40/0.56 (step @p48 :rule chain_m_resolution :premises (@p47 @p30) :args (@t49 @t50 (@list @t46))) % 0.40/0.56 (step @p49 :rule refl :args (@t34)) % 0.40/0.56 (step @p50 :rule cong :premises (@p26 @p49) :args (@t51)) % 0.40/0.56 (step @p51 :rule cong :premises (@p50) :args ((forall @t17 @t51))) % 0.40/0.56 (step @p52 :rule eq-symm :args (@t25 tptp.empty_set)) % 0.40/0.56 (step @p53 :rule refl :args (@t14)) % 0.40/0.56 (step @p54 :rule cong :premises (@p53 @p52) :args ((= @t14 @t26))) % 0.40/0.56 (step @p55 :rule eq-symm :args (@t26 @t14)) % 0.40/0.56 (step @p56 :rule trans :premises (@p55 @p54)) % 0.40/0.56 (step @p57 :rule cong :premises (@p56) :args (@t27)) % 0.40/0.56 (step @p58 :rule trans :premises (@p57 @p51)) % 0.40/0.56 (step @p59 :rule cong :premises (@p58) :args (@t28)) % 0.40/0.56 (step @p60 :rule eq_resolve :premises (@p8 @p59)) % 0.40/0.56 (step @p61 :rule refl :args (@t54)) % 0.40/0.56 (step @p62 :rule bool-double-not-elim :args (@t36)) % 0.40/0.56 (step @p63 :rule nary_cong :premises (@p62 @p61) :args ((or (not @t55) @t54))) % 0.40/0.56 (step @p64 :rule eq-symm :args (@t48 @t52)) % 0.40/0.56 (step @p65 :rule refl :args (@t52)) % 0.40/0.56 (step @p66 :rule cong :premises (@p36 @p65) :args (@t56)) % 0.40/0.56 (step @p67 :rule trans :premises (@p66 @p64)) % 0.40/0.56 (step @p68 :rule cong :premises (@p67) :args (@t57)) % 0.40/0.56 (step @p69 :rule refl :args (@t55)) % 0.40/0.56 (step @p70 :rule cong :premises (@p69 @p68) :args ((=> @t55 @t57))) % 0.40/0.56 (assume-push @p113 @t55) % 0.40/0.56 (step @p72 :rule skolemize :premises (@p60)) % 0.40/0.56 (step-pop @p114 :rule scope :premises (@p72)) % 0.40/0.56 (step @p73 :rule process_scope :premises (@p114) :args (@t57)) % 0.40/0.56 (step @p75 :rule eq_resolve :premises (@p73 @p70)) % 0.40/0.56 (step @p76 :rule implies_elim :premises (@p75)) % 0.40/0.56 (step @p77 :rule eq_resolve :premises (@p76 @p63)) % 0.40/0.56 (step @p78 :rule chain_m_resolution :premises (@p77 @p60) :args (@t54 (@list true) (@list @t36))) % 0.40/0.56 (step @p79 :rule cnf_equiv_neg1 :args (@t53)) % 0.40/0.56 (step @p80 :rule reordering :premises (@p79) :args ((or @t52 @t48 @t53))) % 0.40/0.56 (step @p81 :rule eq-symm :args (@t58 @t21)) % 0.40/0.56 (step @p82 :rule refl :args (@t21)) % 0.40/0.56 (step @p83 :rule eq-symm :args (@t22 tptp.empty_set)) % 0.40/0.56 (step @p84 :rule cong :premises (@p83 @p82) :args (@t23)) % 0.40/0.56 (step @p85 :rule trans :premises (@p84 @p81)) % 0.40/0.56 (step @p86 :rule cong :premises (@p85) :args (@t24)) % 0.40/0.56 (step @p87 :rule eq_resolve :premises (@p7 @p86)) % 0.40/0.56 (step @p88 :rule eq-symm :args (@t41 @t52)) % 0.40/0.56 (step @p89 :rule refl :args (@t59)) % 0.40/0.56 (step @p90 :rule cong :premises (@p89 @p88) :args ((=> @t59 @t60))) % 0.40/0.56 (assume-push @p115 @t59) % 0.40/0.56 (step @p92 :rule instantiate :premises (@p87) :args ((@list @t40 @t39))) % 0.40/0.56 (step-pop @p116 :rule scope :premises (@p92)) % 0.40/0.56 (step @p93 :rule process_scope :premises (@p116) :args (@t60)) % 0.40/0.56 (step @p95 :rule eq_resolve :premises (@p93 @p90)) % 0.40/0.56 (step @p96 :rule implies_elim :premises (@p95)) % 0.40/0.56 (step @p97 :rule chain_m_resolution :premises (@p96 @p87) :args (@t61 @t50 (@list @t59))) % 0.40/0.56 (step @p98 :rule cnf_equiv_pos2 :args (@t61)) % 0.40/0.56 (step @p99 :rule reordering :premises (@p98) :args ((or @t52 @t63 @t62))) % 0.40/0.56 (step @p100 :rule cnf_equiv_pos1 :args (@t49)) % 0.40/0.56 (step @p101 :rule reordering :premises (@p100) :args ((or @t65 @t41 @t64))) % 0.40/0.56 (step @p102 :rule chain_m_resolution :premises (@p101 @p48 @p99 @p97 @p80 @p78) :args (@t52 (@list false true false false true) (@list @t49 @t41 @t61 @t48 @t53))) % 0.40/0.56 (step @p103 :rule cnf_equiv_neg2 :args (@t53)) % 0.40/0.56 (step @p104 :rule chain_m_resolution :premises (@p103 @p78 @p102) :args (@t65 (@list true false) (@list @t53 @t52))) % 0.40/0.56 (step @p105 :rule cnf_equiv_pos1 :args (@t61)) % 0.40/0.56 (step @p106 :rule reordering :premises (@p105) :args ((or (not @t52) @t41 @t62))) % 0.40/0.56 (step @p107 :rule chain_m_resolution :premises (@p106 @p102 @p97) :args (@t41 (@list false false) (@list @t52 @t61))) % 0.40/0.56 (step @p108 :rule cnf_equiv_pos2 :args (@t49)) % 0.40/0.56 (step @p109 :rule reordering :premises (@p108) :args ((or @t48 @t63 @t64))) % 0.40/0.56 (step @p110 false :rule chain_m_resolution :premises (@p109 @p107 @p104 @p48) :args (false (@list false true false) (@list @t41 @t48 @t49))) % 0.40/0.56 ) % 0.40/0.56 % SZS output end Proof % 0.40/0.56 % cvc5 exiting %------------------------------------------------------------------------------