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