↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SET064+1 : TPTP v9.2.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n011.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:13 AM UTC 2026

% Result   : Theorem 16.12s 16.39s
% Output   : Proof 16.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET064+1 : TPTP v9.2.1. Bugfixed v5.4.0.
% 0.13/0.14  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.35  % Computer : n011.cluster.edu
% 0.18/0.35  % Model    : x86_64 x86_64
% 0.18/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35  % Memory   : 8042.1875MB
% 0.18/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35  % CPULimit : 300
% 0.18/0.35  % WCLimit  : 300
% 0.18/0.35  % DateTime : Tue Jun  2 14:49:35 EDT 2026
% 0.18/0.35  % CPUTime  : 
% 0.32/0.51  %----Proving TF0_NAR, FOF, or CNF
% 16.12/16.39  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 16.12/16.39  --- Run --no-e-matching --full-saturate-quant at 6...
% 16.12/16.39  % SZS status Theorem
% 16.12/16.39  % SZS output start Proof
% 16.12/16.39  (
% 16.12/16.39  (declare-sort $$unsorted 0)
% 16.12/16.39  (declare-const tptp.apply (-> $$unsorted $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.disjoint (-> $$unsorted $$unsorted Bool))
% 16.12/16.39  (declare-const tptp.restrict (-> $$unsorted $$unsorted $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.element_relation $$unsorted)
% 16.12/16.39  (declare-const tptp.first (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.intersection (-> $$unsorted $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.domain_of (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.second (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.ordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.universal_class $$unsorted)
% 16.12/16.39  (declare-const tptp.cross_product (-> $$unsorted $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.unordered_pair (-> $$unsorted $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.inductive (-> $$unsorted Bool))
% 16.12/16.39  (declare-const tptp.function (-> $$unsorted Bool))
% 16.12/16.39  (declare-const tptp.subclass (-> $$unsorted $$unsorted Bool))
% 16.12/16.39  (declare-const tptp.member (-> $$unsorted $$unsorted Bool))
% 16.12/16.39  (declare-const tptp.sum_class (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.null_class $$unsorted)
% 16.12/16.39  (declare-const tptp.rotate (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.flip (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.singleton (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.complement (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.union (-> $$unsorted $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.successor (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.successor_relation $$unsorted)
% 16.12/16.39  (declare-const tptp.range_of (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.power_class (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.inverse (-> $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.compose (-> $$unsorted $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.image (-> $$unsorted $$unsorted $$unsorted))
% 16.12/16.39  (declare-const tptp.identity_relation $$unsorted)
% 16.12/16.39  (define @t1 () (@var "Y" $$unsorted))
% 16.12/16.39  (define @t2 () (@var "U" $$unsorted))
% 16.12/16.39  (define @t3 () (tptp.member @t2 @t1))
% 16.12/16.39  (define @t4 () (@var "X" $$unsorted))
% 16.12/16.39  (define @t5 () (tptp.member @t2 @t4))
% 16.12/16.39  (define @t6 () (@list @t2))
% 16.12/16.39  (define @t7 () (tptp.subclass @t4 @t1))
% 16.12/16.39  (define @t8 () (@list @t4 @t1))
% 16.12/16.39  (define @t9 () (@list @t4))
% 16.12/16.39  (define @t10 () (tptp.member @t2 tptp.universal_class))
% 16.12/16.39  (define @t11 () (tptp.unordered_pair @t4 @t1))
% 16.12/16.39  (define @t12 () (tptp.singleton @t4))
% 16.12/16.39  (define @t13 () (tptp.singleton @t1))
% 16.12/16.39  (define @t14 () (tptp.ordered_pair @t4 @t1))
% 16.12/16.39  (define @t15 () (@var "V" $$unsorted))
% 16.12/16.39  (define @t16 () (tptp.cross_product @t4 @t1))
% 16.12/16.39  (define @t17 () (tptp.ordered_pair @t2 @t15))
% 16.12/16.39  (define @t18 () (tptp.member @t1 tptp.universal_class))
% 16.12/16.39  (define @t19 () (tptp.member @t4 tptp.universal_class))
% 16.12/16.39  (define @t20 () (@var "Z" $$unsorted))
% 16.12/16.39  (define @t21 () (@list @t4 @t1 @t20))
% 16.12/16.39  (define @t22 () (tptp.cross_product tptp.universal_class tptp.universal_class))
% 16.12/16.39  (define @t23 () (tptp.member @t20 @t1))
% 16.12/16.39  (define @t24 () (tptp.member @t20 @t4))
% 16.12/16.39  (define @t25 () (tptp.member @t20 tptp.universal_class))
% 16.12/16.39  (define @t26 () (@list @t4 @t20))
% 16.12/16.39  (define @t27 () (@var "XR" $$unsorted))
% 16.12/16.39  (define @t28 () (@var "W" $$unsorted))
% 16.12/16.39  (define @t29 () (tptp.cross_product @t22 tptp.universal_class))
% 16.12/16.39  (define @t30 () (tptp.ordered_pair @t17 @t28))
% 16.12/16.39  (define @t31 () (tptp.member @t30 @t29))
% 16.12/16.39  (define @t32 () (tptp.rotate @t4))
% 16.12/16.39  (define @t33 () (tptp.flip @t4))
% 16.12/16.39  (define @t34 () (tptp.successor @t4))
% 16.12/16.39  (define @t35 () (@list @t1))
% 16.12/16.39  (define @t36 () (@list @t20))
% 16.12/16.39  (define @t37 () (tptp.inductive @t4))
% 16.12/16.39  (define @t38 () (tptp.sum_class @t4))
% 16.12/16.39  (define @t39 () (@list @t2 @t4))
% 16.12/16.39  (define @t40 () (@var "YR" $$unsorted))
% 16.12/16.39  (define @t41 () (tptp.compose @t40 @t27))
% 16.12/16.39  (define @t42 () (@var "XF" $$unsorted))
% 16.12/16.39  (define @t43 () (tptp.function @t42))
% 16.12/16.39  (define @t44 () (@list @t42))
% 16.12/16.39  (define @t45 () (tptp.disjoint @t2 @t4))
% 16.12/16.39  (define @t46 () (and @t10 @t5 @t45))
% 16.12/16.39  (define @t47 () (exists @t6 @t46))
% 16.12/16.39  (define @t48 () (= @t4 tptp.null_class))
% 16.12/16.39  (define @t49 () (not @t48))
% 16.12/16.39  (define @t50 () (=> @t49 @t47))
% 16.12/16.39  (define @t51 () (forall @t9 @t50))
% 16.12/16.39  (define @t52 () (tptp.apply @t42 @t1))
% 16.12/16.39  (define @t53 () (tptp.member @t1 @t20))
% 16.12/16.39  (define @t54 () (exists @t35 @t53))
% 16.12/16.39  (define @t55 () (= @t20 tptp.null_class))
% 16.12/16.39  (define @t56 () (or @t55 @t54))
% 16.12/16.39  (define @t57 () (forall @t36 @t56))
% 16.12/16.39  (define @t58 () (not @t57))
% 16.12/16.39  (define @t59 () (not (forall @t35 (not @t53))))
% 16.12/16.39  (define @t60 () (forall @t36 (or @t55 @t59)))
% 16.12/16.39  (define @t61 () (@quantifiers_skolemize @t60 0))
% 16.12/16.39  (define @t62 () (forall @t35 (not (tptp.member @t1 @t61))))
% 16.12/16.39  (define @t63 () (not @t62))
% 16.12/16.39  (define @t64 () (= tptp.null_class @t61))
% 16.12/16.39  (define @t65 () (or @t64 @t63))
% 16.12/16.39  (define @t66 () (not @t65))
% 16.12/16.39  (define @t67 () (not @t60))
% 16.12/16.39  (define @t68 () (= @t61 tptp.null_class))
% 16.12/16.39  (define @t69 () (or @t68 @t63))
% 16.12/16.39  (define @t70 () (not @t69))
% 16.12/16.39  (define @t71 () (@list true))
% 16.12/16.39  (define @t72 () (@list @t65))
% 16.12/16.39  (define @t73 () (not @t45))
% 16.12/16.39  (define @t74 () (not @t5))
% 16.12/16.39  (define @t75 () (not @t10))
% 16.12/16.39  (define @t76 () (or @t75 @t74 @t73))
% 16.12/16.39  (define @t77 () (not (forall @t6 @t76)))
% 16.12/16.39  (define @t78 () (forall @t6 (not @t46)))
% 16.12/16.39  (define @t79 () (not @t78))
% 16.12/16.39  (define @t80 () (forall @t6 (or @t75 (not (tptp.member @t2 @t61)) (not (tptp.disjoint @t2 @t61)))))
% 16.12/16.39  (define @t81 () (not @t80))
% 16.12/16.39  (define @t82 () (or @t68 @t81))
% 16.12/16.39  (define @t83 () (forall @t9 (or @t48 @t77)))
% 16.12/16.39  (define @t84 () (or @t64 @t81))
% 16.12/16.39  (define @t85 () (@quantifiers_skolemize @t80 0))
% 16.12/16.39  (define @t86 () (tptp.member @t85 @t61))
% 16.12/16.39  (define @t87 () (not @t86))
% 16.12/16.39  (define @t88 () (or (not (tptp.member @t85 tptp.universal_class)) @t87 (not (tptp.disjoint @t85 @t61))))
% 16.12/16.39  (assume @p1 (forall @t8 (= @t7 (forall @t6 (=> @t5 @t3)))))
% 16.12/16.39  (assume @p2 (forall @t9 (tptp.subclass @t4 tptp.universal_class)))
% 16.12/16.39  (assume @p3 (forall @t8 (= (= @t4 @t1) (and @t7 (tptp.subclass @t1 @t4)))))
% 16.12/16.39  (assume @p4 (forall (@list @t2 @t4 @t1) (= (tptp.member @t2 @t11) (and @t10 (or (= @t2 @t4) (= @t2 @t1))))))
% 16.12/16.39  (assume @p5 (forall @t8 (tptp.member @t11 tptp.universal_class)))
% 16.12/16.39  (assume @p6 (forall @t9 (= @t12 (tptp.unordered_pair @t4 @t4))))
% 16.12/16.39  (assume @p7 (forall @t8 (= @t14 (tptp.unordered_pair @t12 (tptp.unordered_pair @t4 @t13)))))
% 16.12/16.39  (assume @p8 (forall (@list @t2 @t15 @t4 @t1) (= (tptp.member @t17 @t16) (and @t5 (tptp.member @t15 @t1)))))
% 16.12/16.39  (assume @p9 (forall @t8 (=> (and @t19 @t18) (and (= (tptp.first @t14) @t4) (= (tptp.second @t14) @t1)))))
% 16.12/16.39  (assume @p10 (forall @t21 (=> (tptp.member @t20 @t16) (= @t20 (tptp.ordered_pair (tptp.first @t20) (tptp.second @t20))))))
% 16.12/16.39  (assume @p11 (forall @t8 (= (tptp.member @t14 tptp.element_relation) (and @t18 (tptp.member @t4 @t1)))))
% 16.12/16.39  (assume @p12 (tptp.subclass tptp.element_relation @t22))
% 16.12/16.39  (assume @p13 (forall @t21 (= (tptp.member @t20 (tptp.intersection @t4 @t1)) (and @t24 @t23))))
% 16.12/16.39  (assume @p14 (forall @t26 (= (tptp.member @t20 (tptp.complement @t4)) (and @t25 (not @t24)))))
% 16.12/16.39  (assume @p15 (forall (@list @t4 @t27 @t1) (= (tptp.restrict @t27 @t4 @t1) (tptp.intersection @t27 @t16))))
% 16.12/16.39  (assume @p16 (forall @t9 (not (tptp.member @t4 tptp.null_class))))
% 16.12/16.39  (assume @p17 (forall @t26 (= (tptp.member @t20 (tptp.domain_of @t4)) (and @t25 (not (= (tptp.restrict @t4 (tptp.singleton @t20) tptp.universal_class) tptp.null_class))))))
% 16.12/16.39  (assume @p18 (forall (@list @t4 @t2 @t15 @t28) (= (tptp.member @t30 @t32) (and @t31 (tptp.member (tptp.ordered_pair (tptp.ordered_pair @t15 @t28) @t2) @t4)))))
% 16.12/16.39  (assume @p19 (forall @t9 (tptp.subclass @t32 @t29)))
% 16.12/16.39  (assume @p20 (forall (@list @t2 @t15 @t28 @t4) (= (tptp.member @t30 @t33) (and @t31 (tptp.member (tptp.ordered_pair (tptp.ordered_pair @t15 @t2) @t28) @t4)))))
% 16.12/16.39  (assume @p21 (forall @t9 (tptp.subclass @t33 @t29)))
% 16.12/16.39  (assume @p22 (forall @t21 (= (tptp.member @t20 (tptp.union @t4 @t1)) (or @t24 @t23))))
% 16.12/16.39  (assume @p23 (forall @t9 (= @t34 (tptp.union @t4 @t12))))
% 16.12/16.39  (assume @p24 (tptp.subclass tptp.successor_relation @t22))
% 16.12/16.39  (assume @p25 (forall @t8 (= (tptp.member @t14 tptp.successor_relation) (and @t19 @t18 (= @t34 @t1)))))
% 16.12/16.39  (assume @p26 (forall @t35 (= (tptp.inverse @t1) (tptp.domain_of (tptp.flip (tptp.cross_product @t1 tptp.universal_class))))))
% 16.12/16.39  (assume @p27 (forall @t36 (= (tptp.range_of @t20) (tptp.domain_of (tptp.inverse @t20)))))
% 16.12/16.39  (assume @p28 (forall (@list @t4 @t27) (= (tptp.image @t27 @t4) (tptp.range_of (tptp.restrict @t27 @t4 tptp.universal_class)))))
% 16.12/16.39  (assume @p29 (forall @t9 (= @t37 (and (tptp.member tptp.null_class @t4) (tptp.subclass (tptp.image tptp.successor_relation @t4) @t4)))))
% 16.12/16.39  (assume @p30 (exists @t9 (and @t19 @t37 (forall @t35 (=> (tptp.inductive @t1) @t7)))))
% 16.12/16.39  (assume @p31 (forall @t39 (= (tptp.member @t2 @t38) (exists @t35 (and @t3 (tptp.member @t1 @t4))))))
% 16.12/16.39  (assume @p32 (forall @t9 (=> @t19 (tptp.member @t38 tptp.universal_class))))
% 16.12/16.39  (assume @p33 (forall @t39 (= (tptp.member @t2 (tptp.power_class @t4)) (and @t10 (tptp.subclass @t2 @t4)))))
% 16.12/16.39  (assume @p34 (forall @t6 (=> @t10 (tptp.member (tptp.power_class @t2) tptp.universal_class))))
% 16.12/16.39  (assume @p35 (forall (@list @t27 @t40) (tptp.subclass @t41 @t22)))
% 16.12/16.39  (assume @p36 (forall (@list @t27 @t40 @t2 @t15) (= (tptp.member @t17 @t41) (and @t10 (tptp.member @t15 (tptp.image @t40 (tptp.image @t27 (tptp.singleton @t2))))))))
% 16.12/16.39  (assume @p37 (forall @t36 (= (tptp.member @t20 tptp.identity_relation) (exists @t9 (and @t19 (= @t20 (tptp.ordered_pair @t4 @t4)))))))
% 16.12/16.39  (assume @p38 (forall @t44 (= @t43 (and (tptp.subclass @t42 @t22) (tptp.subclass (tptp.compose @t42 (tptp.inverse @t42)) tptp.identity_relation)))))
% 16.12/16.39  (assume @p39 (forall (@list @t4 @t42) (=> (and @t19 @t43) (tptp.member (tptp.image @t42 @t4) tptp.universal_class))))
% 16.12/16.39  (assume @p40 (forall @t8 (= (tptp.disjoint @t4 @t1) (forall @t6 (not (and @t5 @t3))))))
% 16.12/16.39  (assume @p41 @t51)
% 16.12/16.39  (assume @p42 (forall (@list @t42 @t1) (= @t52 (tptp.sum_class (tptp.image @t42 @t13)))))
% 16.12/16.39  (assume @p43 (exists @t44 (and @t43 (forall @t35 (=> @t18 (or (= @t1 tptp.null_class) (tptp.member @t52 @t1)))))))
% 16.12/16.39  (assume @p44 @t58)
% 16.12/16.39  (assume @p45 true)
% 16.12/16.39  (step @p46 :rule exists-elim :args ((= @t54 @t59)))
% 16.12/16.39  (step @p47 :rule refl :args (@t55))
% 16.12/16.39  (step @p48 :rule nary_cong :premises (@p47 @p46) :args (@t56))
% 16.12/16.39  (step @p49 :rule cong :premises (@p48) :args (@t57))
% 16.12/16.39  (step @p50 :rule cong :premises (@p49) :args (@t58))
% 16.12/16.39  (step @p51 :rule eq_resolve :premises (@p44 @p50))
% 16.12/16.39  (step @p52 :rule refl :args (@t66))
% 16.12/16.39  (step @p53 :rule bool-double-not-elim :args (@t60))
% 16.12/16.39  (step @p54 :rule nary_cong :premises (@p53 @p52) :args ((or (not @t67) @t66)))
% 16.12/16.39  (step @p55 :rule refl :args (@t63))
% 16.12/16.39  (step @p56 :rule eq-symm :args (@t61 tptp.null_class))
% 16.12/16.39  (step @p57 :rule nary_cong :premises (@p56 @p55) :args (@t69))
% 16.12/16.39  (step @p58 :rule cong :premises (@p57) :args (@t70))
% 16.12/16.39  (step @p59 :rule refl :args (@t67))
% 16.12/16.39  (step @p60 :rule cong :premises (@p59 @p58) :args ((=> @t67 @t70)))
% 16.12/16.39  (assume-push @p128 @t67)
% 16.12/16.39  (step @p62 :rule skolemize :premises (@p51))
% 16.12/16.39  (step-pop @p129 :rule scope :premises (@p62))
% 16.12/16.39  (step @p63 :rule process_scope :premises (@p129) :args (@t70))
% 16.12/16.39  (step @p65 :rule eq_resolve :premises (@p63 @p60))
% 16.12/16.39  (step @p66 :rule implies_elim :premises (@p65))
% 16.12/16.39  (step @p67 :rule eq_resolve :premises (@p66 @p54))
% 16.12/16.39  (step @p68 :rule chain_m_resolution :premises (@p67 @p51) :args (@t66 @t71 (@list @t60)))
% 16.12/16.39  (step @p69 :rule bool-double-not-elim :args (@t62))
% 16.12/16.39  (step @p70 :rule refl :args (@t65))
% 16.12/16.39  (step @p71 :rule nary_cong :premises (@p70 @p69) :args ((or @t65 (not @t63))))
% 16.12/16.39  (step @p72 :rule cnf_or_neg :args (@t65 1))
% 16.12/16.39  (step @p73 :rule eq_resolve :premises (@p72 @p71))
% 16.12/16.39  (step @p74 :rule reordering :premises (@p73) :args ((or @t62 @t65)))
% 16.12/16.39  (step @p75 :rule chain_m_resolution :premises (@p74 @p68) :args (@t62 @t71 @t72))
% 16.12/16.39  (step @p76 :rule refl :args (@t77))
% 16.12/16.39  (step @p77 :rule bool-double-not-elim :args (@t48))
% 16.12/16.39  (step @p78 :rule nary_cong :premises (@p77 @p76) :args ((or (not @t49) @t77)))
% 16.12/16.39  (step @p79 :rule bool-impl-elim :args (@t49 @t77))
% 16.12/16.39  (step @p80 :rule trans :premises (@p79 @p78))
% 16.12/16.39  (step @p81 :rule cong :premises (@p80) :args ((forall @t9 (=> @t49 @t77))))
% 16.12/16.39  (step @p82 :rule aci_norm :args ((= (or @t75 (or @t74 @t73)) @t76)))
% 16.12/16.39  (step @p83 :rule bool-and-de-morgan :args (@t5 @t45 true))
% 16.12/16.39  (step @p84 :rule refl :args (@t75))
% 16.12/16.39  (step @p85 :rule nary_cong :premises (@p84 @p83) :args ((or @t75 (not (and @t5 @t45)))))
% 16.12/16.39  (step @p86 :rule bool-and-de-morgan :args (@t10 @t5 (and @t45)))
% 16.12/16.39  (step @p87 :rule trans :premises (@p86 @p85))
% 16.12/16.39  (step @p88 :rule trans :premises (@p87 @p82))
% 16.12/16.39  (step @p89 :rule cong :premises (@p88) :args (@t78))
% 16.12/16.39  (step @p90 :rule cong :premises (@p89) :args (@t79))
% 16.12/16.39  (step @p91 :rule exists-elim :args ((= @t47 @t79)))
% 16.12/16.39  (step @p92 :rule trans :premises (@p91 @p90))
% 16.12/16.39  (step @p93 :rule refl :args (@t49))
% 16.12/16.39  (step @p94 :rule cong :premises (@p93 @p92) :args (@t50))
% 16.12/16.39  (step @p95 :rule cong :premises (@p94) :args (@t51))
% 16.12/16.39  (step @p96 :rule trans :premises (@p95 @p81))
% 16.12/16.39  (step @p97 :rule eq_resolve :premises (@p41 @p96))
% 16.12/16.39  (step @p98 :rule refl :args (@t81))
% 16.12/16.39  (step @p99 :rule nary_cong :premises (@p56 @p98) :args (@t82))
% 16.12/16.39  (step @p100 :rule refl :args (@t83))
% 16.12/16.39  (step @p101 :rule cong :premises (@p100 @p99) :args ((=> @t83 @t82)))
% 16.12/16.39  (assume-push @p130 @t83)
% 16.12/16.39  (step @p103 :rule instantiate :premises (@p97) :args ((@list @t61)))
% 16.12/16.39  (step-pop @p131 :rule scope :premises (@p103))
% 16.12/16.39  (step @p104 :rule process_scope :premises (@p131) :args (@t82))
% 16.12/16.39  (step @p106 :rule eq_resolve :premises (@p104 @p101))
% 16.12/16.39  (step @p107 :rule implies_elim :premises (@p106))
% 16.12/16.39  (step @p108 :rule chain_m_resolution :premises (@p107 @p97) :args (@t84 (@list false) (@list @t83)))
% 16.12/16.39  (step @p109 :rule cnf_or_neg :args (@t65 0))
% 16.12/16.39  (step @p110 :rule chain_m_resolution :premises (@p109 @p68) :args ((not @t64) @t71 @t72))
% 16.12/16.39  (step @p111 :rule cnf_or_pos :args (@t84))
% 16.12/16.39  (step @p112 :rule reordering :premises (@p111) :args ((or @t64 @t81 (not @t84))))
% 16.12/16.39  (step @p113 :rule chain_m_resolution :premises (@p112 @p110 @p108) :args (@t81 (@list true false) (@list @t64 @t84)))
% 16.12/16.39  (step @p114 :rule skolemize :premises (@p113))
% 16.12/16.39  (step @p115 :rule bool-double-not-elim :args (@t86))
% 16.12/16.39  (step @p116 :rule refl :args (@t88))
% 16.12/16.39  (step @p117 :rule nary_cong :premises (@p116 @p115) :args ((or @t88 (not @t87))))
% 16.12/16.39  (step @p118 :rule cnf_or_neg :args (@t88 1))
% 16.12/16.39  (step @p119 :rule eq_resolve :premises (@p118 @p117))
% 16.12/16.39  (step @p120 :rule reordering :premises (@p119) :args ((or @t86 @t88)))
% 16.12/16.39  (step @p121 :rule chain_m_resolution :premises (@p120 @p114) :args (@t86 @t71 (@list @t88)))
% 16.12/16.39  (assume-push @p132 @t62)
% 16.12/16.39  (step @p123 :rule instantiate :premises (@p75) :args ((@list @t85)))
% 16.12/16.39  (step-pop @p133 :rule scope :premises (@p123))
% 16.12/16.39  (step @p124 :rule process_scope :premises (@p133) :args (@t87))
% 16.12/16.39  (step @p126 :rule implies_elim :premises (@p124))
% 16.12/16.39  (step @p127 false :rule chain_m_resolution :premises (@p126 @p121 @p75) :args (false (@list false false) (@list @t86 @t62)))
% 16.12/16.39  )
% 16.12/16.39  % SZS output end Proof
% 16.12/16.39  % cvc5 exiting
%------------------------------------------------------------------------------