%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU243+1 : TPTP v9.2.1. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n026.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:51:06 AM UTC 2026 % Result : Theorem 0.36s 0.60s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SEU243+1 : TPTP v9.2.1. Released v3.3.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n026.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue Jun 2 16:47:40 EDT 2026 % 0.17/0.35 % CPUTime : % 0.27/0.51 %----Proving TF0_NAR, FOF, or CNF % 0.36/0.60 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.36/0.60 % SZS status Theorem % 0.36/0.60 % SZS output start Proof % 0.36/0.60 ( % 0.36/0.60 (declare-sort $$unsorted 0) % 0.36/0.60 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.36/0.60 (declare-const tptp.element (-> $$unsorted $$unsorted Bool)) % 0.36/0.60 (declare-const tptp.relation_dom (-> $$unsorted $$unsorted)) % 0.36/0.60 (declare-const tptp.relation_rng (-> $$unsorted $$unsorted)) % 0.36/0.60 (declare-const tptp.one_to_one (-> $$unsorted Bool)) % 0.36/0.60 (declare-const tptp.well_founded_relation (-> $$unsorted Bool)) % 0.36/0.60 (declare-const tptp.function (-> $$unsorted Bool)) % 0.36/0.60 (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool)) % 0.36/0.60 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.36/0.60 (declare-const tptp.fiber (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.60 (declare-const tptp.relation (-> $$unsorted Bool)) % 0.36/0.60 (declare-const tptp.set_union2 (-> $$unsorted $$unsorted $$unsorted)) % 0.36/0.60 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.36/0.60 (declare-const tptp.empty_set $$unsorted) % 0.36/0.60 (declare-const tptp.relation_field (-> $$unsorted $$unsorted)) % 0.36/0.60 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.36/0.60 (declare-const tptp.is_well_founded_in (-> $$unsorted $$unsorted Bool)) % 0.36/0.60 (define @t1 () (@var "A" $$unsorted)) % 0.36/0.60 (define @t2 () (@var "B" $$unsorted)) % 0.36/0.60 (define @t3 () (tptp.in @t1 @t2)) % 0.36/0.60 (define @t4 () (@list @t1 @t2)) % 0.36/0.60 (define @t5 () (tptp.function @t1)) % 0.36/0.60 (define @t6 () (tptp.empty @t1)) % 0.36/0.60 (define @t7 () (@list @t1)) % 0.36/0.60 (define @t8 () (tptp.relation @t1)) % 0.36/0.60 (define @t9 () (and @t8 @t5 (tptp.one_to_one @t1))) % 0.36/0.60 (define @t10 () (and @t8 @t6 @t5)) % 0.36/0.60 (define @t11 () (tptp.set_union2 @t2 @t1)) % 0.36/0.60 (define @t12 () (tptp.set_union2 @t1 @t2)) % 0.36/0.60 (define @t13 () (@var "C" $$unsorted)) % 0.36/0.60 (define @t14 () (tptp.disjoint (tptp.fiber @t1 @t13) @t2)) % 0.36/0.60 (define @t15 () (tptp.in @t13 @t2)) % 0.36/0.60 (define @t16 () (@list @t13)) % 0.36/0.60 (define @t17 () (forall @t16 (not (and @t15 @t14)))) % 0.36/0.60 (define @t18 () (= @t2 tptp.empty_set)) % 0.36/0.60 (define @t19 () (not @t18)) % 0.36/0.60 (define @t20 () (tptp.relation_field @t1)) % 0.36/0.60 (define @t21 () (tptp.subset @t2 @t20)) % 0.36/0.60 (define @t22 () (and @t21 @t19 @t17)) % 0.36/0.60 (define @t23 () (not @t22)) % 0.36/0.60 (define @t24 () (@list @t2)) % 0.36/0.60 (define @t25 () (forall @t24 @t23)) % 0.36/0.60 (define @t26 () (tptp.well_founded_relation @t1)) % 0.36/0.60 (define @t27 () (= @t26 @t25)) % 0.36/0.60 (define @t28 () (=> @t8 @t27)) % 0.36/0.60 (define @t29 () (forall @t7 @t28)) % 0.36/0.60 (define @t30 () (@var "D" $$unsorted)) % 0.36/0.60 (define @t31 () (tptp.disjoint (tptp.fiber @t1 @t30) @t13)) % 0.36/0.60 (define @t32 () (tptp.in @t30 @t13)) % 0.36/0.60 (define @t33 () (@list @t30)) % 0.36/0.60 (define @t34 () (forall @t33 (not (and @t32 @t31)))) % 0.36/0.60 (define @t35 () (= @t13 tptp.empty_set)) % 0.36/0.60 (define @t36 () (not @t35)) % 0.36/0.60 (define @t37 () (tptp.subset @t13 @t2)) % 0.36/0.60 (define @t38 () (and @t37 @t36 @t34)) % 0.36/0.60 (define @t39 () (not @t38)) % 0.36/0.60 (define @t40 () (forall @t16 @t39)) % 0.36/0.60 (define @t41 () (tptp.is_well_founded_in @t1 @t2)) % 0.36/0.60 (define @t42 () (= @t41 @t40)) % 0.36/0.60 (define @t43 () (forall @t24 @t42)) % 0.36/0.60 (define @t44 () (=> @t8 @t43)) % 0.36/0.60 (define @t45 () (forall @t7 @t44)) % 0.36/0.60 (define @t46 () (not @t6)) % 0.36/0.60 (define @t47 () (tptp.element @t1 @t2)) % 0.36/0.60 (define @t48 () (tptp.empty @t2)) % 0.36/0.60 (define @t49 () (tptp.element @t2 (tptp.powerset @t13))) % 0.36/0.60 (define @t50 () (@list @t1 @t2 @t13)) % 0.36/0.60 (define @t51 () (= @t26 (tptp.is_well_founded_in @t1 @t20))) % 0.36/0.60 (define @t52 () (forall @t7 (=> @t8 @t51))) % 0.36/0.60 (define @t53 () (not @t52)) % 0.36/0.60 (define @t54 () (not @t15)) % 0.36/0.60 (define @t55 () (forall @t16 (or @t54 (not @t14)))) % 0.36/0.60 (define @t56 () (not @t55)) % 0.36/0.60 (define @t57 () (not @t21)) % 0.36/0.60 (define @t58 () (= @t26 (forall @t24 (or @t57 @t18 @t56)))) % 0.36/0.60 (define @t59 () (not @t19)) % 0.36/0.60 (define @t60 () (or @t57 @t59 @t56)) % 0.36/0.60 (define @t61 () (not @t8)) % 0.36/0.60 (define @t62 () (@quantifiers_skolemize (forall @t7 (or @t61 @t51)) 0)) % 0.36/0.60 (define @t63 () (tptp.relation @t62)) % 0.36/0.60 (define @t64 () (tptp.relation_field @t62)) % 0.36/0.60 (define @t65 () (tptp.is_well_founded_in @t62 @t64)) % 0.36/0.60 (define @t66 () (tptp.well_founded_relation @t62)) % 0.36/0.60 (define @t67 () (= @t66 @t65)) % 0.36/0.60 (define @t68 () (not @t63)) % 0.36/0.60 (define @t69 () (or @t68 @t67)) % 0.36/0.60 (define @t70 () (@list true)) % 0.36/0.60 (define @t71 () (@list @t69)) % 0.36/0.60 (define @t72 () (forall @t24 (or (not (tptp.subset @t2 @t64)) @t18 (not (forall @t16 (or @t54 (not (tptp.disjoint (tptp.fiber @t62 @t13) @t2)))))))) % 0.36/0.60 (define @t73 () (= @t66 @t72)) % 0.36/0.60 (define @t74 () (or @t68 @t73)) % 0.36/0.60 (define @t75 () (@list false false)) % 0.36/0.60 (define @t76 () (not @t73)) % 0.36/0.60 (define @t77 () (not @t72)) % 0.36/0.60 (define @t78 () (not @t32)) % 0.36/0.60 (define @t79 () (forall @t33 (or @t78 (not @t31)))) % 0.36/0.60 (define @t80 () (not @t79)) % 0.36/0.60 (define @t81 () (= tptp.empty_set @t13)) % 0.36/0.60 (define @t82 () (@var "BOUND_VARIABLE_7616" $$unsorted)) % 0.36/0.60 (define @t83 () (= (tptp.is_well_founded_in @t1 @t82) (forall @t16 (or (not (tptp.subset @t13 @t82)) @t81 @t80)))) % 0.36/0.60 (define @t84 () (or @t61 @t83)) % 0.36/0.60 (define @t85 () (@list @t82)) % 0.36/0.60 (define @t86 () (forall @t85 @t84)) % 0.36/0.60 (define @t87 () (forall @t85 @t83)) % 0.36/0.60 (define @t88 () (or @t61 @t87)) % 0.36/0.60 (define @t89 () (not @t37)) % 0.36/0.60 (define @t90 () (forall @t24 (= @t41 (forall @t16 (or @t89 @t81 @t80))))) % 0.36/0.60 (define @t91 () (not @t81)) % 0.36/0.60 (define @t92 () (not @t91)) % 0.36/0.60 (define @t93 () (or @t89 @t92 @t80)) % 0.36/0.60 (define @t94 () (not (forall @t33 (or @t78 (not (tptp.disjoint (tptp.fiber @t62 @t30) @t13)))))) % 0.36/0.60 (define @t95 () (not (tptp.subset @t13 @t64))) % 0.36/0.60 (define @t96 () (forall @t16 (or @t95 @t81 @t94))) % 0.36/0.60 (define @t97 () (= @t65 @t96)) % 0.36/0.60 (define @t98 () (or @t68 @t97)) % 0.36/0.60 (define @t99 () (not @t97)) % 0.36/0.60 (define @t100 () (not @t65)) % 0.36/0.60 (define @t101 () (or @t95 @t35 @t94)) % 0.36/0.60 (define @t102 () (@var "BOUND_VARIABLE_8816" $$unsorted)) % 0.36/0.60 (define @t103 () (@var "BOUND_VARIABLE_8815" $$unsorted)) % 0.36/0.60 (define @t104 () (@list @t103 @t102)) % 0.36/0.60 (define @t105 () (@list true false)) % 0.36/0.60 (define @t106 () (not @t96)) % 0.36/0.60 (assume @p1 (forall @t4 (=> @t3 (not (tptp.in @t2 @t1))))) % 0.36/0.60 (assume @p2 (forall @t7 (=> @t6 @t5))) % 0.36/0.60 (assume @p3 (forall @t7 (=> @t10 @t9))) % 0.36/0.60 (assume @p4 (forall @t4 (= @t12 @t11))) % 0.36/0.60 (assume @p5 @t29) % 0.36/0.60 (assume @p6 @t45) % 0.36/0.60 (assume @p7 (forall @t7 (=> @t8 (= @t20 (tptp.set_union2 (tptp.relation_dom @t1) (tptp.relation_rng @t1)))))) % 0.36/0.60 (assume @p8 true) % 0.36/0.60 (assume @p9 (forall @t7 (exists @t24 (tptp.element @t2 @t1)))) % 0.36/0.60 (assume @p10 (tptp.empty tptp.empty_set)) % 0.36/0.60 (assume @p11 (forall @t4 (=> @t46 (not (tptp.empty @t12))))) % 0.36/0.60 (assume @p12 (forall @t4 (=> @t46 (not (tptp.empty @t11))))) % 0.36/0.60 (assume @p13 (forall @t4 (= (tptp.set_union2 @t1 @t1) @t1))) % 0.36/0.60 (assume @p14 (exists @t7 (and @t8 @t5))) % 0.36/0.60 (assume @p15 (exists @t7 @t6)) % 0.36/0.60 (assume @p16 (exists @t7 @t10)) % 0.36/0.60 (assume @p17 (exists @t7 @t46)) % 0.36/0.60 (assume @p18 (exists @t7 @t9)) % 0.36/0.60 (assume @p19 (forall @t4 (tptp.subset @t1 @t1))) % 0.36/0.60 (assume @p20 (forall @t4 (=> (tptp.disjoint @t1 @t2) (tptp.disjoint @t2 @t1)))) % 0.36/0.60 (assume @p21 (forall @t7 (= (tptp.set_union2 @t1 tptp.empty_set) @t1))) % 0.36/0.60 (assume @p22 (forall @t4 (=> @t3 @t47))) % 0.36/0.60 (assume @p23 (forall @t4 (=> @t47 (or @t48 @t3)))) % 0.36/0.60 (assume @p24 (forall @t4 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2)))) % 0.36/0.60 (assume @p25 (forall @t50 (=> (and @t3 @t49) (tptp.element @t1 @t13)))) % 0.36/0.60 (assume @p26 (forall @t50 (not (and @t3 @t49 (tptp.empty @t13))))) % 0.36/0.60 (assume @p27 @t53) % 0.36/0.60 (assume @p28 (forall @t7 (=> @t6 (= @t1 tptp.empty_set)))) % 0.36/0.60 (assume @p29 (forall @t4 (not (and @t3 @t48)))) % 0.36/0.60 (assume @p30 (forall @t4 (not (and @t6 (not (= @t1 @t2)) @t48)))) % 0.36/0.60 (step @p31 :rule bool-impl-elim :args (@t8 @t58)) % 0.36/0.60 (step @p32 :rule cong :premises (@p31) :args ((forall @t7 (=> @t8 @t58)))) % 0.36/0.60 (step @p33 :rule refl :args (@t56)) % 0.36/0.60 (step @p34 :rule bool-double-not-elim :args (@t18)) % 0.36/0.60 (step @p35 :rule refl :args (@t57)) % 0.36/0.60 (step @p36 :rule nary_cong :premises (@p35 @p34 @p33) :args (@t60)) % 0.36/0.60 (step @p37 :rule aci_norm :args ((= (or @t57 (or @t59 @t56)) @t60))) % 0.36/0.60 (step @p38 :rule trans :premises (@p37 @p36)) % 0.36/0.60 (step @p39 :rule bool-and-de-morgan :args (@t19 @t55 true)) % 0.36/0.60 (step @p40 :rule nary_cong :premises (@p35 @p39) :args ((or @t57 (not (and @t19 @t55))))) % 0.36/0.60 (step @p41 :rule bool-and-de-morgan :args (@t21 @t19 (and @t55))) % 0.36/0.60 (step @p42 :rule trans :premises (@p41 @p40)) % 0.36/0.60 (step @p43 :rule trans :premises (@p42 @p38)) % 0.36/0.60 (step @p44 :rule cong :premises (@p43) :args ((forall @t24 (not (and @t21 @t19 @t55))))) % 0.36/0.60 (step @p45 :rule bool-and-de-morgan :args (@t15 @t14 true)) % 0.36/0.60 (step @p46 :rule cong :premises (@p45) :args (@t17)) % 0.36/0.60 (step @p47 :rule refl :args (@t19)) % 0.36/0.60 (step @p48 :rule refl :args (@t21)) % 0.36/0.60 (step @p49 :rule nary_cong :premises (@p48 @p47 @p46) :args (@t22)) % 0.36/0.60 (step @p50 :rule cong :premises (@p49) :args (@t23)) % 0.36/0.60 (step @p51 :rule cong :premises (@p50) :args (@t25)) % 0.36/0.60 (step @p52 :rule trans :premises (@p51 @p44)) % 0.36/0.60 (step @p53 :rule refl :args (@t26)) % 0.36/0.60 (step @p54 :rule cong :premises (@p53 @p52) :args (@t27)) % 0.36/0.60 (step @p55 :rule refl :args (@t8)) % 0.36/0.60 (step @p56 :rule cong :premises (@p55 @p54) :args (@t28)) % 0.36/0.60 (step @p57 :rule cong :premises (@p56) :args (@t29)) % 0.36/0.60 (step @p58 :rule trans :premises (@p57 @p32)) % 0.36/0.60 (step @p59 :rule eq_resolve :premises (@p5 @p58)) % 0.36/0.60 (step @p60 :rule instantiate :premises (@p59) :args ((@list @t62))) % 0.36/0.60 (step @p61 :rule bool-impl-elim :args (@t8 @t51)) % 0.36/0.60 (step @p62 :rule cong :premises (@p61) :args (@t52)) % 0.36/0.60 (step @p63 :rule cong :premises (@p62) :args (@t53)) % 0.36/0.60 (step @p64 :rule eq_resolve :premises (@p27 @p63)) % 0.36/0.60 (step @p65 :rule skolemize :premises (@p64)) % 0.36/0.60 (step @p66 :rule bool-double-not-elim :args (@t63)) % 0.36/0.60 (step @p67 :rule refl :args (@t69)) % 0.36/0.60 (step @p68 :rule nary_cong :premises (@p67 @p66) :args ((or @t69 (not @t68)))) % 0.36/0.60 (step @p69 :rule cnf_or_neg :args (@t69 0)) % 0.36/0.60 (step @p70 :rule eq_resolve :premises (@p69 @p68)) % 0.36/0.60 (step @p71 :rule reordering :premises (@p70) :args ((or @t63 @t69))) % 0.36/0.60 (step @p72 :rule chain_m_resolution :premises (@p71 @p65) :args (@t63 @t70 @t71)) % 0.36/0.60 (step @p73 :rule cnf_or_pos :args (@t74)) % 0.36/0.60 (step @p74 :rule reordering :premises (@p73) :args ((or @t68 @t73 (not @t74)))) % 0.36/0.60 (step @p75 :rule chain_m_resolution :premises (@p74 @p72 @p60) :args (@t73 @t75 (@list @t63 @t74))) % 0.36/0.60 (step @p76 :rule cnf_or_neg :args (@t69 1)) % 0.36/0.60 (step @p77 :rule chain_m_resolution :premises (@p76 @p65) :args ((not @t67) @t70 @t71)) % 0.36/0.60 (step @p78 :rule cnf_equiv_neg1 :args (@t67)) % 0.36/0.60 (step @p79 :rule reordering :premises (@p78) :args ((or @t66 @t65 @t67))) % 0.36/0.60 (step @p80 :rule cnf_equiv_pos2 :args (@t73)) % 0.36/0.60 (step @p81 :rule reordering :premises (@p80) :args ((or @t66 @t77 @t76))) % 0.36/0.60 (step @p82 :rule quant-merge-prenex :args ((= (forall @t7 @t86) (forall (@list @t1 @t82) @t84)))) % 0.36/0.60 (step @p83 :rule alpha_equiv :args (@t87 (@list @t82) (@list @t2))) % 0.36/0.60 (step @p84 :rule refl :args (@t61)) % 0.36/0.60 (step @p85 :rule nary_cong :premises (@p84 @p83) :args (@t88)) % 0.36/0.60 (step @p86 :rule quant-miniscope-or :args ((= @t86 @t88))) % 0.36/0.60 (step @p87 :rule trans :premises (@p86 @p85)) % 0.36/0.60 (step @p88 :rule symm :premises (@p87)) % 0.36/0.60 (step @p89 :rule cong :premises (@p88) :args ((forall @t7 (or @t61 @t90)))) % 0.36/0.60 (step @p90 :rule trans :premises (@p89 @p82)) % 0.36/0.60 (step @p91 :rule bool-impl-elim :args (@t8 @t90)) % 0.36/0.60 (step @p92 :rule cong :premises (@p91) :args ((forall @t7 (=> @t8 @t90)))) % 0.36/0.60 (step @p93 :rule trans :premises (@p92 @p90)) % 0.36/0.60 (step @p94 :rule refl :args (@t80)) % 0.36/0.60 (step @p95 :rule bool-double-not-elim :args (@t81)) % 0.36/0.60 (step @p96 :rule refl :args (@t89)) % 0.36/0.60 (step @p97 :rule nary_cong :premises (@p96 @p95 @p94) :args (@t93)) % 0.36/0.60 (step @p98 :rule aci_norm :args ((= (or @t89 (or @t92 @t80)) @t93))) % 0.36/0.60 (step @p99 :rule trans :premises (@p98 @p97)) % 0.36/0.60 (step @p100 :rule bool-and-de-morgan :args (@t91 @t79 true)) % 0.36/0.60 (step @p101 :rule nary_cong :premises (@p96 @p100) :args ((or @t89 (not (and @t91 @t79))))) % 0.36/0.60 (step @p102 :rule bool-and-de-morgan :args (@t37 @t91 (and @t79))) % 0.36/0.60 (step @p103 :rule trans :premises (@p102 @p101)) % 0.36/0.60 (step @p104 :rule trans :premises (@p103 @p99)) % 0.36/0.60 (step @p105 :rule cong :premises (@p104) :args ((forall @t16 (not (and @t37 @t91 @t79))))) % 0.36/0.60 (step @p106 :rule bool-and-de-morgan :args (@t32 @t31 true)) % 0.36/0.60 (step @p107 :rule cong :premises (@p106) :args (@t34)) % 0.36/0.60 (step @p108 :rule eq-symm :args (@t13 tptp.empty_set)) % 0.36/0.60 (step @p109 :rule cong :premises (@p108) :args (@t36)) % 0.36/0.60 (step @p110 :rule refl :args (@t37)) % 0.36/0.60 (step @p111 :rule nary_cong :premises (@p110 @p109 @p107) :args (@t38)) % 0.36/0.60 (step @p112 :rule cong :premises (@p111) :args (@t39)) % 0.36/0.60 (step @p113 :rule cong :premises (@p112) :args (@t40)) % 0.36/0.60 (step @p114 :rule trans :premises (@p113 @p105)) % 0.36/0.60 (step @p115 :rule refl :args (@t41)) % 0.36/0.60 (step @p116 :rule cong :premises (@p115 @p114) :args (@t42)) % 0.36/0.60 (step @p117 :rule cong :premises (@p116) :args (@t43)) % 0.36/0.60 (step @p118 :rule cong :premises (@p55 @p117) :args (@t44)) % 0.36/0.60 (step @p119 :rule cong :premises (@p118) :args (@t45)) % 0.36/0.60 (step @p120 :rule trans :premises (@p119 @p93)) % 0.36/0.60 (step @p121 :rule eq_resolve :premises (@p6 @p120)) % 0.36/0.60 (step @p122 :rule instantiate :premises (@p121) :args ((@list @t62 @t64))) % 0.36/0.60 (step @p123 :rule cnf_or_pos :args (@t98)) % 0.36/0.60 (step @p124 :rule reordering :premises (@p123) :args ((or @t68 @t97 (not @t98)))) % 0.36/0.61 (step @p125 :rule chain_m_resolution :premises (@p124 @p72 @p122) :args (@t97 @t75 (@list @t63 @t98))) % 0.36/0.61 (step @p126 :rule cnf_equiv_pos1 :args (@t97)) % 0.36/0.61 (step @p127 :rule reordering :premises (@p126) :args ((or @t100 @t96 @t99))) % 0.36/0.61 (step @p128 :rule refl :args (@t94)) % 0.36/0.61 (step @p129 :rule refl :args (@t95)) % 0.36/0.61 (step @p130 :rule nary_cong :premises (@p129 @p108 @p128) :args (@t101)) % 0.36/0.61 (step @p131 :rule cong :premises (@p130) :args ((forall @t16 @t101))) % 0.36/0.61 (step @p132 :rule alpha_equiv :args ((forall (@list @t102) (or (not (tptp.subset @t102 @t64)) (= @t102 tptp.empty_set) (not (forall (@list @t103) (or (not (tptp.in @t103 @t102)) (not (tptp.disjoint (tptp.fiber @t62 @t103) @t102))))))) @t104 (@list @t30 @t13))) % 0.36/0.61 (step @p133 :rule alpha_equiv :args (@t72 (@list @t13 @t2) @t104)) % 0.36/0.61 (step @p134 :rule trans :premises (@p133 @p132 @p131)) % 0.36/0.61 (step @p135 :rule equiv_elim2 :premises (@p134)) % 0.36/0.61 (step @p136 :rule chain_m_resolution :premises (@p135 @p127 @p125 @p81 @p75 @p79 @p77) :args (@t66 (@list false false true false false true) (@list @t96 @t97 @t72 @t73 @t65 @t67))) % 0.36/0.61 (step @p137 :rule cnf_equiv_pos1 :args (@t73)) % 0.36/0.61 (step @p138 :rule reordering :premises (@p137) :args ((or (not @t66) @t72 @t76))) % 0.36/0.61 (step @p139 :rule chain_m_resolution :premises (@p138 @p136 @p75) :args (@t72 @t75 (@list @t66 @t73))) % 0.36/0.61 (step @p140 :rule cnf_equiv_neg2 :args (@t67)) % 0.36/0.61 (step @p141 :rule chain_m_resolution :premises (@p140 @p77 @p136) :args (@t100 @t105 (@list @t67 @t66))) % 0.36/0.61 (step @p142 :rule cnf_equiv_pos2 :args (@t97)) % 0.36/0.61 (step @p143 :rule reordering :premises (@p142) :args ((or @t65 @t106 @t99))) % 0.36/0.61 (step @p144 :rule chain_m_resolution :premises (@p143 @p141 @p125) :args (@t106 @t105 (@list @t65 @t97))) % 0.36/0.61 (step @p145 :rule equiv_elim1 :premises (@p134)) % 0.36/0.61 (step @p146 :rule reordering :premises (@p145) :args ((or @t96 @t77))) % 0.36/0.61 (step @p147 false :rule chain_m_resolution :premises (@p146 @p144 @p139) :args (false @t105 (@list @t96 @t72))) % 0.36/0.61 ) % 0.36/0.61 % SZS output end Proof % 0.36/0.61 % cvc5 exiting %------------------------------------------------------------------------------