%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET063+1 : TPTP v9.2.1. Bugfixed v5.4.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n010.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.45s 0.63s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET063+1 : TPTP v9.2.1. Bugfixed v5.4.0. % 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n010.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 14:48:55 EDT 2026 % 0.16/0.34 % CPUTime : % 0.27/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.45/0.63 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.45/0.63 % SZS status Theorem % 0.45/0.63 % SZS output start Proof % 0.45/0.63 ( % 0.45/0.63 (declare-sort $$unsorted 0) % 0.45/0.63 (declare-const tptp.apply (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool)) % 0.45/0.63 (declare-const tptp.restrict (-> $$unsorted $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.element_relation $$unsorted) % 0.45/0.63 (declare-const tptp.first (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.domain_of (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.second (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.universal_class $$unsorted) % 0.45/0.63 (declare-const tptp.cross_product (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.inductive (-> $$unsorted Bool)) % 0.45/0.63 (declare-const tptp.function (-> $$unsorted Bool)) % 0.45/0.63 (declare-const tptp.subclass (-> $$unsorted $$unsorted Bool)) % 0.45/0.63 (declare-const tptp.member (-> $$unsorted $$unsorted Bool)) % 0.45/0.63 (declare-const tptp.sum_class (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.null_class $$unsorted) % 0.45/0.63 (declare-const tptp.rotate (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.flip (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.singleton (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.complement (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.successor (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.successor_relation $$unsorted) % 0.45/0.63 (declare-const tptp.range_of (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.power_class (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.inverse (-> $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.compose (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.image (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.63 (declare-const tptp.identity_relation $$unsorted) % 0.45/0.63 (define @t1 () (@var "Y" $$unsorted)) % 0.45/0.63 (define @t2 () (@var "U" $$unsorted)) % 0.45/0.63 (define @t3 () (tptp.member @t2 @t1)) % 0.45/0.63 (define @t4 () (@var "X" $$unsorted)) % 0.45/0.63 (define @t5 () (tptp.member @t2 @t4)) % 0.45/0.63 (define @t6 () (@list @t2)) % 0.45/0.63 (define @t7 () (forall @t6 (=> @t5 @t3))) % 0.45/0.63 (define @t8 () (tptp.subclass @t4 @t1)) % 0.45/0.63 (define @t9 () (= @t8 @t7)) % 0.45/0.63 (define @t10 () (@list @t4 @t1)) % 0.45/0.63 (define @t11 () (forall @t10 @t9)) % 0.45/0.63 (define @t12 () (@list @t4)) % 0.45/0.63 (define @t13 () (forall @t10 (= (= @t4 @t1) (and @t8 (tptp.subclass @t1 @t4))))) % 0.45/0.63 (define @t14 () (tptp.member @t2 tptp.universal_class)) % 0.45/0.63 (define @t15 () (tptp.unordered_pair @t4 @t1)) % 0.45/0.63 (define @t16 () (tptp.singleton @t4)) % 0.45/0.63 (define @t17 () (tptp.singleton @t1)) % 0.45/0.63 (define @t18 () (tptp.ordered_pair @t4 @t1)) % 0.45/0.63 (define @t19 () (@var "V" $$unsorted)) % 0.45/0.63 (define @t20 () (tptp.cross_product @t4 @t1)) % 0.45/0.63 (define @t21 () (tptp.ordered_pair @t2 @t19)) % 0.45/0.63 (define @t22 () (tptp.member @t1 tptp.universal_class)) % 0.45/0.63 (define @t23 () (tptp.member @t4 tptp.universal_class)) % 0.45/0.63 (define @t24 () (@var "Z" $$unsorted)) % 0.45/0.63 (define @t25 () (@list @t4 @t1 @t24)) % 0.45/0.63 (define @t26 () (tptp.cross_product tptp.universal_class tptp.universal_class)) % 0.45/0.63 (define @t27 () (tptp.member @t24 @t1)) % 0.45/0.63 (define @t28 () (tptp.member @t24 @t4)) % 0.45/0.63 (define @t29 () (tptp.member @t24 tptp.universal_class)) % 0.45/0.63 (define @t30 () (@list @t4 @t24)) % 0.45/0.63 (define @t31 () (@var "XR" $$unsorted)) % 0.45/0.63 (define @t32 () (forall @t12 (not (tptp.member @t4 tptp.null_class)))) % 0.45/0.63 (define @t33 () (@var "W" $$unsorted)) % 0.45/0.63 (define @t34 () (tptp.cross_product @t26 tptp.universal_class)) % 0.45/0.63 (define @t35 () (tptp.ordered_pair @t21 @t33)) % 0.45/0.63 (define @t36 () (tptp.member @t35 @t34)) % 0.45/0.63 (define @t37 () (tptp.rotate @t4)) % 0.45/0.63 (define @t38 () (tptp.flip @t4)) % 0.45/0.63 (define @t39 () (tptp.successor @t4)) % 0.45/0.63 (define @t40 () (@list @t1)) % 0.45/0.63 (define @t41 () (@list @t24)) % 0.45/0.63 (define @t42 () (tptp.inductive @t4)) % 0.45/0.63 (define @t43 () (tptp.sum_class @t4)) % 0.45/0.63 (define @t44 () (@list @t2 @t4)) % 0.45/0.63 (define @t45 () (@var "YR" $$unsorted)) % 0.45/0.63 (define @t46 () (tptp.compose @t45 @t31)) % 0.45/0.63 (define @t47 () (@var "XF" $$unsorted)) % 0.45/0.63 (define @t48 () (tptp.function @t47)) % 0.45/0.63 (define @t49 () (@list @t47)) % 0.45/0.63 (define @t50 () (= @t4 tptp.null_class)) % 0.45/0.63 (define @t51 () (tptp.apply @t47 @t1)) % 0.45/0.63 (define @t52 () (tptp.subclass @t4 tptp.null_class)) % 0.45/0.63 (define @t53 () (forall @t12 (=> @t52 @t50))) % 0.45/0.63 (define @t54 () (not @t53)) % 0.45/0.63 (define @t55 () (forall @t12 (or (not @t52) @t50))) % 0.45/0.63 (define @t56 () (@quantifiers_skolemize @t55 0)) % 0.45/0.63 (define @t57 () (tptp.subclass tptp.null_class @t56)) % 0.45/0.63 (define @t58 () (tptp.subclass @t56 tptp.null_class)) % 0.45/0.63 (define @t59 () (and @t58 @t57)) % 0.45/0.63 (define @t60 () (= @t56 tptp.null_class)) % 0.45/0.63 (define @t61 () (= @t60 @t59)) % 0.45/0.63 (define @t62 () (= tptp.null_class @t56)) % 0.45/0.63 (define @t63 () (= @t62 @t59)) % 0.45/0.63 (define @t64 () (not @t58)) % 0.45/0.63 (define @t65 () (or @t64 @t62)) % 0.45/0.63 (define @t66 () (not @t65)) % 0.45/0.63 (define @t67 () (not @t55)) % 0.45/0.63 (define @t68 () (or @t64 @t60)) % 0.45/0.63 (define @t69 () (not @t68)) % 0.45/0.63 (define @t70 () (@list true)) % 0.45/0.63 (define @t71 () (@list @t65)) % 0.45/0.63 (define @t72 () (not @t59)) % 0.45/0.63 (define @t73 () (@list true false)) % 0.45/0.63 (define @t74 () (not @t57)) % 0.45/0.63 (define @t75 () (forall @t6 (or (not (tptp.member @t2 tptp.null_class)) (tptp.member @t2 @t56)))) % 0.45/0.63 (define @t76 () (= @t57 @t75)) % 0.45/0.63 (define @t77 () (not @t75)) % 0.45/0.63 (define @t78 () (@quantifiers_skolemize @t75 0)) % 0.45/0.63 (define @t79 () (tptp.member @t78 tptp.null_class)) % 0.45/0.63 (define @t80 () (not @t79)) % 0.45/0.63 (define @t81 () (or @t80 (tptp.member @t78 @t56))) % 0.45/0.63 (assume @p1 @t11) % 0.45/0.63 (assume @p2 (forall @t12 (tptp.subclass @t4 tptp.universal_class))) % 0.45/0.63 (assume @p3 @t13) % 0.45/0.63 (assume @p4 (forall (@list @t2 @t4 @t1) (= (tptp.member @t2 @t15) (and @t14 (or (= @t2 @t4) (= @t2 @t1)))))) % 0.45/0.63 (assume @p5 (forall @t10 (tptp.member @t15 tptp.universal_class))) % 0.45/0.63 (assume @p6 (forall @t12 (= @t16 (tptp.unordered_pair @t4 @t4)))) % 0.45/0.63 (assume @p7 (forall @t10 (= @t18 (tptp.unordered_pair @t16 (tptp.unordered_pair @t4 @t17))))) % 0.45/0.63 (assume @p8 (forall (@list @t2 @t19 @t4 @t1) (= (tptp.member @t21 @t20) (and @t5 (tptp.member @t19 @t1))))) % 0.45/0.63 (assume @p9 (forall @t10 (=> (and @t23 @t22) (and (= (tptp.first @t18) @t4) (= (tptp.second @t18) @t1))))) % 0.45/0.63 (assume @p10 (forall @t25 (=> (tptp.member @t24 @t20) (= @t24 (tptp.ordered_pair (tptp.first @t24) (tptp.second @t24)))))) % 0.45/0.63 (assume @p11 (forall @t10 (= (tptp.member @t18 tptp.element_relation) (and @t22 (tptp.member @t4 @t1))))) % 0.45/0.63 (assume @p12 (tptp.subclass tptp.element_relation @t26)) % 0.45/0.63 (assume @p13 (forall @t25 (= (tptp.member @t24 (tptp.intersection @t4 @t1)) (and @t28 @t27)))) % 0.45/0.63 (assume @p14 (forall @t30 (= (tptp.member @t24 (tptp.complement @t4)) (and @t29 (not @t28))))) % 0.45/0.63 (assume @p15 (forall (@list @t4 @t31 @t1) (= (tptp.restrict @t31 @t4 @t1) (tptp.intersection @t31 @t20)))) % 0.45/0.63 (assume @p16 @t32) % 0.45/0.63 (assume @p17 (forall @t30 (= (tptp.member @t24 (tptp.domain_of @t4)) (and @t29 (not (= (tptp.restrict @t4 (tptp.singleton @t24) tptp.universal_class) tptp.null_class)))))) % 0.45/0.63 (assume @p18 (forall (@list @t4 @t2 @t19 @t33) (= (tptp.member @t35 @t37) (and @t36 (tptp.member (tptp.ordered_pair (tptp.ordered_pair @t19 @t33) @t2) @t4))))) % 0.45/0.63 (assume @p19 (forall @t12 (tptp.subclass @t37 @t34))) % 0.45/0.63 (assume @p20 (forall (@list @t2 @t19 @t33 @t4) (= (tptp.member @t35 @t38) (and @t36 (tptp.member (tptp.ordered_pair (tptp.ordered_pair @t19 @t2) @t33) @t4))))) % 0.45/0.63 (assume @p21 (forall @t12 (tptp.subclass @t38 @t34))) % 0.45/0.63 (assume @p22 (forall @t25 (= (tptp.member @t24 (tptp.union @t4 @t1)) (or @t28 @t27)))) % 0.45/0.63 (assume @p23 (forall @t12 (= @t39 (tptp.union @t4 @t16)))) % 0.45/0.63 (assume @p24 (tptp.subclass tptp.successor_relation @t26)) % 0.45/0.63 (assume @p25 (forall @t10 (= (tptp.member @t18 tptp.successor_relation) (and @t23 @t22 (= @t39 @t1))))) % 0.45/0.63 (assume @p26 (forall @t40 (= (tptp.inverse @t1) (tptp.domain_of (tptp.flip (tptp.cross_product @t1 tptp.universal_class)))))) % 0.45/0.63 (assume @p27 (forall @t41 (= (tptp.range_of @t24) (tptp.domain_of (tptp.inverse @t24))))) % 0.45/0.63 (assume @p28 (forall (@list @t4 @t31) (= (tptp.image @t31 @t4) (tptp.range_of (tptp.restrict @t31 @t4 tptp.universal_class))))) % 0.45/0.63 (assume @p29 (forall @t12 (= @t42 (and (tptp.member tptp.null_class @t4) (tptp.subclass (tptp.image tptp.successor_relation @t4) @t4))))) % 0.45/0.63 (assume @p30 (exists @t12 (and @t23 @t42 (forall @t40 (=> (tptp.inductive @t1) @t8))))) % 0.45/0.63 (assume @p31 (forall @t44 (= (tptp.member @t2 @t43) (exists @t40 (and @t3 (tptp.member @t1 @t4)))))) % 0.45/0.63 (assume @p32 (forall @t12 (=> @t23 (tptp.member @t43 tptp.universal_class)))) % 0.45/0.63 (assume @p33 (forall @t44 (= (tptp.member @t2 (tptp.power_class @t4)) (and @t14 (tptp.subclass @t2 @t4))))) % 0.45/0.63 (assume @p34 (forall @t6 (=> @t14 (tptp.member (tptp.power_class @t2) tptp.universal_class)))) % 0.45/0.63 (assume @p35 (forall (@list @t31 @t45) (tptp.subclass @t46 @t26))) % 0.45/0.63 (assume @p36 (forall (@list @t31 @t45 @t2 @t19) (= (tptp.member @t21 @t46) (and @t14 (tptp.member @t19 (tptp.image @t45 (tptp.image @t31 (tptp.singleton @t2)))))))) % 0.45/0.63 (assume @p37 (forall @t41 (= (tptp.member @t24 tptp.identity_relation) (exists @t12 (and @t23 (= @t24 (tptp.ordered_pair @t4 @t4))))))) % 0.45/0.63 (assume @p38 (forall @t49 (= @t48 (and (tptp.subclass @t47 @t26) (tptp.subclass (tptp.compose @t47 (tptp.inverse @t47)) tptp.identity_relation))))) % 0.45/0.63 (assume @p39 (forall (@list @t4 @t47) (=> (and @t23 @t48) (tptp.member (tptp.image @t47 @t4) tptp.universal_class)))) % 0.45/0.63 (assume @p40 (forall @t10 (= (tptp.disjoint @t4 @t1) (forall @t6 (not (and @t5 @t3)))))) % 0.45/0.63 (assume @p41 (forall @t12 (=> (not @t50) (exists @t6 (and @t14 @t5 (tptp.disjoint @t2 @t4)))))) % 0.45/0.63 (assume @p42 (forall (@list @t47 @t1) (= @t51 (tptp.sum_class (tptp.image @t47 @t17))))) % 0.45/0.63 (assume @p43 (exists @t49 (and @t48 (forall @t40 (=> @t22 (or (= @t1 tptp.null_class) (tptp.member @t51 @t1))))))) % 0.45/0.63 (assume @p44 @t54) % 0.45/0.63 (assume @p45 true) % 0.45/0.63 (step @p46 :rule bool-impl-elim :args (@t5 @t3)) % 0.45/0.63 (step @p47 :rule cong :premises (@p46) :args (@t7)) % 0.45/0.63 (step @p48 :rule refl :args (@t8)) % 0.45/0.63 (step @p49 :rule cong :premises (@p48 @p47) :args (@t9)) % 0.45/0.63 (step @p50 :rule cong :premises (@p49) :args (@t11)) % 0.45/0.63 (step @p51 :rule eq_resolve :premises (@p1 @p50)) % 0.45/0.63 (step @p52 :rule instantiate :premises (@p51) :args ((@list tptp.null_class @t56))) % 0.45/0.63 (step @p53 :rule refl :args (@t59)) % 0.45/0.63 (step @p54 :rule eq-symm :args (@t56 tptp.null_class)) % 0.45/0.63 (step @p55 :rule cong :premises (@p54 @p53) :args (@t61)) % 0.45/0.63 (step @p56 :rule refl :args (@t13)) % 0.45/0.63 (step @p57 :rule cong :premises (@p56 @p55) :args ((=> @t13 @t61))) % 0.45/0.63 (assume-push @p117 @t13) % 0.45/0.63 (step @p59 :rule instantiate :premises (@p3) :args ((@list @t56 tptp.null_class))) % 0.45/0.63 (step-pop @p118 :rule scope :premises (@p59)) % 0.45/0.63 (step @p60 :rule process_scope :premises (@p118) :args (@t61)) % 0.45/0.63 (step @p62 :rule eq_resolve :premises (@p60 @p57)) % 0.45/0.63 (step @p63 :rule implies_elim :premises (@p62)) % 0.45/0.63 (step @p64 :rule chain_m_resolution :premises (@p63 @p3) :args (@t63 (@list false) (@list @t13))) % 0.45/0.63 (step @p65 :rule bool-impl-elim :args (@t52 @t50)) % 0.45/0.63 (step @p66 :rule cong :premises (@p65) :args (@t53)) % 0.45/0.63 (step @p67 :rule cong :premises (@p66) :args (@t54)) % 0.45/0.63 (step @p68 :rule eq_resolve :premises (@p44 @p67)) % 0.45/0.63 (step @p69 :rule refl :args (@t66)) % 0.45/0.63 (step @p70 :rule bool-double-not-elim :args (@t55)) % 0.45/0.63 (step @p71 :rule nary_cong :premises (@p70 @p69) :args ((or (not @t67) @t66))) % 0.45/0.63 (step @p72 :rule refl :args (@t64)) % 0.45/0.63 (step @p73 :rule nary_cong :premises (@p72 @p54) :args (@t68)) % 0.45/0.63 (step @p74 :rule cong :premises (@p73) :args (@t69)) % 0.45/0.63 (step @p75 :rule refl :args (@t67)) % 0.45/0.63 (step @p76 :rule cong :premises (@p75 @p74) :args ((=> @t67 @t69))) % 0.45/0.63 (assume-push @p119 @t67) % 0.45/0.63 (step @p78 :rule skolemize :premises (@p68)) % 0.45/0.63 (step-pop @p120 :rule scope :premises (@p78)) % 0.45/0.63 (step @p79 :rule process_scope :premises (@p120) :args (@t69)) % 0.45/0.63 (step @p81 :rule eq_resolve :premises (@p79 @p76)) % 0.45/0.63 (step @p82 :rule implies_elim :premises (@p81)) % 0.45/0.63 (step @p83 :rule eq_resolve :premises (@p82 @p71)) % 0.45/0.63 (step @p84 :rule chain_m_resolution :premises (@p83 @p68) :args (@t66 @t70 (@list @t55))) % 0.45/0.63 (step @p85 :rule cnf_or_neg :args (@t65 1)) % 0.45/0.63 (step @p86 :rule chain_m_resolution :premises (@p85 @p84) :args ((not @t62) @t70 @t71)) % 0.45/0.63 (step @p87 :rule cnf_equiv_pos2 :args (@t63)) % 0.45/0.63 (step @p88 :rule reordering :premises (@p87) :args ((or @t62 @t72 (not @t63)))) % 0.45/0.63 (step @p89 :rule chain_m_resolution :premises (@p88 @p86 @p64) :args (@t72 @t73 (@list @t62 @t63))) % 0.45/0.63 (step @p90 :rule bool-double-not-elim :args (@t58)) % 0.45/0.63 (step @p91 :rule refl :args (@t65)) % 0.45/0.63 (step @p92 :rule nary_cong :premises (@p91 @p90) :args ((or @t65 (not @t64)))) % 0.45/0.63 (step @p93 :rule cnf_or_neg :args (@t65 0)) % 0.45/0.63 (step @p94 :rule eq_resolve :premises (@p93 @p92)) % 0.45/0.63 (step @p95 :rule reordering :premises (@p94) :args ((or @t58 @t65))) % 0.45/0.64 (step @p96 :rule chain_m_resolution :premises (@p95 @p84) :args (@t58 @t70 @t71)) % 0.45/0.64 (step @p97 :rule cnf_and_neg :args (@t59)) % 0.45/0.64 (step @p98 :rule reordering :premises (@p97) :args ((or @t64 @t59 @t74))) % 0.45/0.64 (step @p99 :rule chain_m_resolution :premises (@p98 @p96 @p89) :args (@t74 (@list false true) (@list @t58 @t59))) % 0.45/0.64 (step @p100 :rule cnf_equiv_pos2 :args (@t76)) % 0.45/0.64 (step @p101 :rule reordering :premises (@p100) :args ((or @t57 @t77 (not @t76)))) % 0.45/0.64 (step @p102 :rule chain_m_resolution :premises (@p101 @p99 @p52) :args (@t77 @t73 (@list @t57 @t76))) % 0.45/0.64 (step @p103 :rule skolemize :premises (@p102)) % 0.45/0.64 (step @p104 :rule bool-double-not-elim :args (@t79)) % 0.45/0.64 (step @p105 :rule refl :args (@t81)) % 0.45/0.64 (step @p106 :rule nary_cong :premises (@p105 @p104) :args ((or @t81 (not @t80)))) % 0.45/0.64 (step @p107 :rule cnf_or_neg :args (@t81 0)) % 0.45/0.64 (step @p108 :rule eq_resolve :premises (@p107 @p106)) % 0.45/0.64 (step @p109 :rule reordering :premises (@p108) :args ((or @t79 @t81))) % 0.45/0.64 (step @p110 :rule chain_m_resolution :premises (@p109 @p103) :args (@t79 @t70 (@list @t81))) % 0.45/0.64 (assume-push @p121 @t32) % 0.45/0.64 (step @p112 :rule instantiate :premises (@p16) :args ((@list @t78))) % 0.45/0.64 (step-pop @p122 :rule scope :premises (@p112)) % 0.45/0.64 (step @p113 :rule process_scope :premises (@p122) :args (@t80)) % 0.45/0.64 (step @p115 :rule implies_elim :premises (@p113)) % 0.45/0.64 (step @p116 false :rule chain_m_resolution :premises (@p115 @p110 @p16) :args (false (@list false false) (@list @t79 @t32))) % 0.45/0.64 ) % 0.45/0.64 % SZS output end Proof % 0.45/0.64 % cvc5 exiting %------------------------------------------------------------------------------