↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SEU096+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 : n029.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:50:33 AM UTC 2026

% Result   : Theorem 0.45s 0.64s
% Output   : Proof 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU096+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.17/0.34  % Computer : n029.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % 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:29:02 EDT 2026
% 0.17/0.35  % CPUTime  : 
% 0.28/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.45/0.64  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.45/0.64  % SZS status Theorem
% 0.45/0.64  % SZS output start Proof
% 0.45/0.64  (
% 0.45/0.64  (declare-sort $$unsorted 0)
% 0.45/0.64  (declare-const tptp.being_limit_ordinal (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.ordinal_yielding (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.relation_non_empty (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.relation_inverse_image (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.64  (declare-const tptp.relation_rng (-> $$unsorted $$unsorted))
% 0.45/0.64  (declare-const tptp.relation_empty_yielding (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.empty_set $$unsorted)
% 0.45/0.64  (declare-const tptp.in (-> $$unsorted $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.function_yielding (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.ordinal (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.empty (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.powerset (-> $$unsorted $$unsorted))
% 0.45/0.64  (declare-const tptp.element (-> $$unsorted $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.relation_image (-> $$unsorted $$unsorted $$unsorted))
% 0.45/0.64  (declare-const tptp.finite (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.function (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.with_non_empty_elements (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.natural (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.transfinite_sequence (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.epsilon_connected (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.positive_rationals $$unsorted)
% 0.45/0.64  (declare-const tptp.subset (-> $$unsorted $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.epsilon_transitive (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.relation (-> $$unsorted Bool))
% 0.45/0.64  (declare-const tptp.one_to_one (-> $$unsorted Bool))
% 0.45/0.64  (define @t1 () (@var "A" $$unsorted))
% 0.45/0.64  (define @t2 () (@var "B" $$unsorted))
% 0.45/0.64  (define @t3 () (tptp.in @t1 @t2))
% 0.45/0.64  (define @t4 () (@list @t1 @t2))
% 0.45/0.64  (define @t5 () (tptp.ordinal @t2))
% 0.45/0.64  (define @t6 () (tptp.epsilon_connected @t2))
% 0.45/0.64  (define @t7 () (tptp.epsilon_transitive @t2))
% 0.45/0.64  (define @t8 () (tptp.element @t2 @t1))
% 0.45/0.64  (define @t9 () (@list @t2))
% 0.45/0.64  (define @t10 () (tptp.ordinal @t1))
% 0.45/0.64  (define @t11 () (@list @t1))
% 0.45/0.64  (define @t12 () (tptp.finite @t1))
% 0.45/0.64  (define @t13 () (tptp.empty @t1))
% 0.45/0.64  (define @t14 () (tptp.function @t1))
% 0.45/0.64  (define @t15 () (tptp.epsilon_connected @t1))
% 0.45/0.64  (define @t16 () (tptp.epsilon_transitive @t1))
% 0.45/0.64  (define @t17 () (and @t16 @t15))
% 0.45/0.64  (define @t18 () (tptp.relation @t1))
% 0.45/0.64  (define @t19 () (tptp.natural @t1))
% 0.45/0.64  (define @t20 () (and @t16 @t15 @t10 @t19))
% 0.45/0.64  (define @t21 () (tptp.finite @t2))
% 0.45/0.64  (define @t22 () (tptp.powerset @t1))
% 0.45/0.64  (define @t23 () (tptp.element @t2 @t22))
% 0.45/0.64  (define @t24 () (tptp.one_to_one @t1))
% 0.45/0.64  (define @t25 () (and @t18 @t14 @t24))
% 0.45/0.64  (define @t26 () (and @t18 @t13 @t14))
% 0.45/0.64  (define @t27 () (and @t16 @t15 @t10))
% 0.45/0.64  (define @t28 () (tptp.element @t1 tptp.positive_rationals))
% 0.45/0.64  (define @t29 () (tptp.relation_empty_yielding tptp.empty_set))
% 0.45/0.64  (define @t30 () (tptp.relation tptp.empty_set))
% 0.45/0.64  (define @t31 () (tptp.empty tptp.empty_set))
% 0.45/0.64  (define @t32 () (tptp.finite (tptp.relation_image @t1 @t2)))
% 0.45/0.64  (define @t33 () (and @t18 @t14 @t21))
% 0.45/0.64  (define @t34 () (forall @t4 (=> @t33 @t32)))
% 0.45/0.64  (define @t35 () (tptp.relation_rng @t1))
% 0.45/0.64  (define @t36 () (and @t18 (tptp.relation_non_empty @t1) @t14))
% 0.45/0.64  (define @t37 () (tptp.empty @t35))
% 0.45/0.64  (define @t38 () (not @t13))
% 0.45/0.64  (define @t39 () (and @t38 @t18))
% 0.45/0.64  (define @t40 () (tptp.empty @t2))
% 0.45/0.64  (define @t41 () (not @t40))
% 0.45/0.64  (define @t42 () (tptp.function @t2))
% 0.45/0.64  (define @t43 () (tptp.relation @t2))
% 0.45/0.64  (define @t44 () (tptp.transfinite_sequence @t1))
% 0.45/0.64  (define @t45 () (tptp.relation_empty_yielding @t1))
% 0.45/0.64  (define @t46 () (tptp.relation_inverse_image @t2 @t1))
% 0.45/0.64  (define @t47 () (tptp.relation_image @t2 @t46))
% 0.45/0.64  (define @t48 () (tptp.subset @t1 (tptp.relation_rng @t2)))
% 0.45/0.64  (define @t49 () (=> @t48 (= @t47 @t1)))
% 0.45/0.64  (define @t50 () (and @t43 @t42))
% 0.45/0.64  (define @t51 () (=> @t50 @t49))
% 0.45/0.64  (define @t52 () (forall @t4 @t51))
% 0.45/0.64  (define @t53 () (tptp.element @t1 @t2))
% 0.45/0.64  (define @t54 () (tptp.finite @t46))
% 0.45/0.64  (define @t55 () (and @t48 @t54))
% 0.45/0.64  (define @t56 () (=> @t55 @t12))
% 0.45/0.64  (define @t57 () (forall @t4 (=> @t50 @t56)))
% 0.45/0.64  (define @t58 () (not @t57))
% 0.45/0.64  (define @t59 () (@var "C" $$unsorted))
% 0.45/0.64  (define @t60 () (tptp.element @t2 (tptp.powerset @t59)))
% 0.45/0.64  (define @t61 () (@list @t1 @t2 @t59))
% 0.45/0.64  (define @t62 () (not @t21))
% 0.45/0.64  (define @t63 () (not @t14))
% 0.45/0.64  (define @t64 () (not @t18))
% 0.45/0.64  (define @t65 () (or @t64 @t63 @t62))
% 0.45/0.64  (define @t66 () (not @t54))
% 0.45/0.64  (define @t67 () (not @t48))
% 0.45/0.64  (define @t68 () (not @t42))
% 0.45/0.64  (define @t69 () (not @t43))
% 0.45/0.64  (define @t70 () (or @t69 @t68 @t67 @t66 @t12))
% 0.45/0.64  (define @t71 () (forall @t4 @t70))
% 0.45/0.64  (define @t72 () (@quantifiers_skolemize @t71 0))
% 0.45/0.64  (define @t73 () (@quantifiers_skolemize @t71 1))
% 0.45/0.64  (define @t74 () (tptp.relation_inverse_image @t73 @t72))
% 0.45/0.64  (define @t75 () (or @t67 @t66 @t12))
% 0.45/0.64  (define @t76 () (or @t69 @t68))
% 0.45/0.64  (define @t77 () (not @t50))
% 0.45/0.64  (define @t78 () (tptp.finite @t74))
% 0.45/0.64  (define @t79 () (tptp.finite @t72))
% 0.45/0.64  (define @t80 () (not @t78))
% 0.45/0.64  (define @t81 () (tptp.subset @t72 (tptp.relation_rng @t73)))
% 0.45/0.64  (define @t82 () (not @t81))
% 0.45/0.64  (define @t83 () (tptp.function @t73))
% 0.45/0.64  (define @t84 () (not @t83))
% 0.45/0.64  (define @t85 () (tptp.relation @t73))
% 0.45/0.64  (define @t86 () (not @t85))
% 0.45/0.64  (define @t87 () (or @t86 @t84 @t82 @t80 @t79))
% 0.45/0.64  (define @t88 () (@list true))
% 0.45/0.64  (define @t89 () (@list @t87))
% 0.45/0.64  (define @t90 () (tptp.relation_image @t73 @t74))
% 0.45/0.64  (define @t91 () (tptp.finite @t90))
% 0.45/0.64  (define @t92 () (or @t86 @t84 @t80 @t91))
% 0.45/0.64  (define @t93 () (@list false false false false))
% 0.45/0.64  (define @t94 () (= @t1 @t47))
% 0.45/0.64  (define @t95 () (=> @t48 @t94))
% 0.45/0.64  (define @t96 () (= @t72 @t90))
% 0.45/0.64  (define @t97 () (or @t86 @t84 @t82 @t96))
% 0.45/0.64  (assume @p1 (forall @t4 (=> @t3 (not (tptp.in @t2 @t1)))))
% 0.45/0.64  (assume @p2 (forall @t11 (=> @t10 (forall @t9 (=> @t8 (and @t7 @t6 @t5))))))
% 0.45/0.64  (assume @p3 (forall @t11 (=> @t13 @t12)))
% 0.45/0.64  (assume @p4 (forall @t11 (=> @t13 @t14)))
% 0.45/0.64  (assume @p5 (forall @t11 (=> @t10 @t17)))
% 0.45/0.64  (assume @p6 (forall @t11 (=> @t13 @t18)))
% 0.45/0.64  (assume @p7 (forall @t11 (=> (and @t13 @t10) @t20)))
% 0.45/0.64  (assume @p8 (forall @t11 (=> @t12 (forall @t9 (=> @t23 @t21)))))
% 0.45/0.64  (assume @p9 (forall @t11 (=> @t26 @t25)))
% 0.45/0.64  (assume @p10 (forall @t11 (=> @t17 @t10)))
% 0.45/0.64  (assume @p11 (forall @t11 (=> @t13 @t27)))
% 0.45/0.64  (assume @p12 (forall @t11 (=> @t28 (=> @t10 @t20))))
% 0.45/0.64  (assume @p13 (forall @t11 (exists @t9 @t8)))
% 0.45/0.64  (assume @p14 (and @t31 @t30 @t29))
% 0.45/0.64  (assume @p15 @t34)
% 0.45/0.64  (assume @p16 (forall @t11 (not (tptp.empty @t22))))
% 0.45/0.64  (assume @p17 @t31)
% 0.45/0.64  (assume @p18 (and @t30 @t29 (tptp.function tptp.empty_set) (tptp.one_to_one tptp.empty_set) @t31 (tptp.epsilon_transitive tptp.empty_set) (tptp.epsilon_connected tptp.empty_set) (tptp.ordinal tptp.empty_set)))
% 0.45/0.64  (assume @p19 (and @t31 @t30))
% 0.45/0.64  (assume @p20 (forall @t11 (=> @t36 (tptp.with_non_empty_elements @t35))))
% 0.45/0.64  (assume @p21 (forall @t11 (=> @t39 (not @t37))))
% 0.45/0.64  (assume @p22 (not (tptp.empty tptp.positive_rationals)))
% 0.45/0.64  (assume @p23 (forall @t11 (=> @t13 (and @t37 (tptp.relation @t35)))))
% 0.45/0.64  (assume @p24 (exists @t11 (and @t38 @t16 @t15 @t10 @t19)))
% 0.45/0.64  (assume @p25 (exists @t11 (and @t38 @t12)))
% 0.45/0.64  (assume @p26 (exists @t11 (and @t18 @t14 (tptp.function_yielding @t1))))
% 0.45/0.64  (assume @p27 (exists @t11 (and @t18 @t14)))
% 0.45/0.64  (assume @p28 (exists @t11 @t27))
% 0.45/0.64  (assume @p29 (exists @t11 (and @t16 @t15 @t10 (tptp.being_limit_ordinal @t1))))
% 0.45/0.64  (assume @p30 (exists @t11 (and @t13 @t18)))
% 0.45/0.64  (assume @p31 (forall @t11 (=> @t38 (exists @t9 (and @t23 @t41)))))
% 0.45/0.64  (assume @p32 (exists @t11 @t13))
% 0.45/0.64  (assume @p33 (exists @t11 (and @t28 @t38 @t16 @t15 @t10)))
% 0.45/0.64  (assume @p34 (forall @t11 (exists @t9 (and @t23 @t40 @t43 @t42 (tptp.one_to_one @t2) @t7 @t6 @t5 (tptp.natural @t2) @t21))))
% 0.45/0.64  (assume @p35 (exists @t11 @t26))
% 0.45/0.64  (assume @p36 (exists @t11 (and @t18 @t14 @t24 @t13 @t16 @t15 @t10)))
% 0.45/0.64  (assume @p37 (exists @t11 (and @t18 @t14 @t44 (tptp.ordinal_yielding @t1))))
% 0.45/0.64  (assume @p38 (exists @t11 @t39))
% 0.45/0.64  (assume @p39 (forall @t11 (exists @t9 (and @t23 @t40))))
% 0.45/0.64  (assume @p40 (exists @t11 @t38))
% 0.45/0.64  (assume @p41 (exists @t11 (and @t28 @t13 @t16 @t15 @t10 @t19)))
% 0.45/0.64  (assume @p42 (forall @t11 (=> @t38 (exists @t9 (and @t23 @t41 @t21)))))
% 0.45/0.64  (assume @p43 (exists @t11 @t25))
% 0.45/0.64  (assume @p44 (exists @t11 (and @t38 @t16 @t15 @t10)))
% 0.45/0.64  (assume @p45 (exists @t11 (and @t18 @t45)))
% 0.45/0.64  (assume @p46 (exists @t11 (and @t18 @t45 @t14)))
% 0.45/0.64  (assume @p47 (exists @t11 (and @t18 @t14 @t44)))
% 0.45/0.64  (assume @p48 (exists @t11 @t36))
% 0.45/0.64  (assume @p49 (forall @t4 (tptp.subset @t1 @t1)))
% 0.45/0.64  (assume @p50 @t52)
% 0.45/0.64  (assume @p51 (forall @t4 (=> @t50 (=> @t12 (tptp.finite (tptp.relation_image @t2 @t1))))))
% 0.45/0.64  (assume @p52 (forall @t4 (=> @t3 @t53)))
% 0.45/0.64  (assume @p53 @t58)
% 0.45/0.64  (assume @p54 (forall @t4 (=> @t53 (or @t40 @t3))))
% 0.45/0.64  (assume @p55 (forall @t4 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2))))
% 0.45/0.64  (assume @p56 (forall @t61 (=> (and @t3 @t60) (tptp.element @t1 @t59))))
% 0.45/0.64  (assume @p57 (forall @t61 (not (and @t3 @t60 (tptp.empty @t59)))))
% 0.45/0.64  (assume @p58 (forall @t11 (=> @t13 (= @t1 tptp.empty_set))))
% 0.45/0.64  (assume @p59 (forall @t4 (not (and @t3 @t40))))
% 0.45/0.64  (assume @p60 (forall @t4 (not (and @t13 (not (= @t1 @t2)) @t40))))
% 0.45/0.64  (assume @p61 true)
% 0.45/0.64  (step @p62 :rule evaluate :args ((= false true)))
% 0.45/0.64  (step @p63 :rule aci_norm :args ((= (or @t65 @t32) (or @t64 @t63 @t62 @t32))))
% 0.45/0.64  (step @p64 :rule refl :args (@t32))
% 0.45/0.64  (step @p65 :rule aci_norm :args ((= (or @t64 (or @t63 @t62)) @t65)))
% 0.45/0.64  (step @p66 :rule bool-and-de-morgan :args (@t14 @t21 true))
% 0.45/0.64  (step @p67 :rule refl :args (@t64))
% 0.45/0.64  (step @p68 :rule nary_cong :premises (@p67 @p66) :args ((or @t64 (not (and @t14 @t21)))))
% 0.45/0.64  (step @p69 :rule bool-and-de-morgan :args (@t18 @t14 (and @t21)))
% 0.45/0.64  (step @p70 :rule trans :premises (@p69 @p68))
% 0.45/0.64  (step @p71 :rule trans :premises (@p70 @p65))
% 0.45/0.64  (step @p72 :rule nary_cong :premises (@p71 @p64) :args ((or (not @t33) @t32)))
% 0.45/0.64  (step @p73 :rule trans :premises (@p72 @p63))
% 0.45/0.64  (step @p74 :rule bool-impl-elim :args (@t33 @t32))
% 0.45/0.64  (step @p75 :rule trans :premises (@p74 @p73))
% 0.45/0.64  (step @p76 :rule cong :premises (@p75) :args (@t34))
% 0.45/0.64  (step @p77 :rule eq_resolve :premises (@p15 @p76))
% 0.45/0.64  (step @p78 :rule instantiate :premises (@p77) :args ((@list @t73 @t74)))
% 0.45/0.64  (step @p79 :rule aci_norm :args ((= (or @t76 @t75) @t70)))
% 0.45/0.64  (step @p80 :rule aci_norm :args ((= (or (or @t67 @t66) @t12) @t75)))
% 0.45/0.64  (step @p81 :rule refl :args (@t12))
% 0.45/0.64  (step @p82 :rule bool-and-de-morgan :args (@t48 @t54 true))
% 0.45/0.64  (step @p83 :rule nary_cong :premises (@p82 @p81) :args ((or (not @t55) @t12)))
% 0.45/0.64  (step @p84 :rule trans :premises (@p83 @p80))
% 0.45/0.64  (step @p85 :rule bool-impl-elim :args (@t55 @t12))
% 0.45/0.64  (step @p86 :rule trans :premises (@p85 @p84))
% 0.45/0.64  (step @p87 :rule bool-and-de-morgan :args (@t43 @t42 true))
% 0.45/0.64  (step @p88 :rule nary_cong :premises (@p87 @p86) :args ((or @t77 @t56)))
% 0.45/0.64  (step @p89 :rule trans :premises (@p88 @p79))
% 0.45/0.64  (step @p90 :rule bool-impl-elim :args (@t50 @t56))
% 0.45/0.64  (step @p91 :rule trans :premises (@p90 @p89))
% 0.45/0.64  (step @p92 :rule cong :premises (@p91) :args (@t57))
% 0.45/0.64  (step @p93 :rule cong :premises (@p92) :args (@t58))
% 0.45/0.64  (step @p94 :rule eq_resolve :premises (@p53 @p93))
% 0.45/0.64  (step @p95 :rule skolemize :premises (@p94))
% 0.45/0.64  (step @p96 :rule bool-double-not-elim :args (@t78))
% 0.45/0.64  (step @p97 :rule refl :args (@t87))
% 0.45/0.64  (step @p98 :rule nary_cong :premises (@p97 @p96) :args ((or @t87 (not @t80))))
% 0.45/0.64  (step @p99 :rule cnf_or_neg :args (@t87 3))
% 0.45/0.64  (step @p100 :rule eq_resolve :premises (@p99 @p98))
% 0.45/0.64  (step @p101 :rule reordering :premises (@p100) :args ((or @t78 @t87)))
% 0.45/0.64  (step @p102 :rule chain_m_resolution :premises (@p101 @p95) :args (@t78 @t88 @t89))
% 0.45/0.64  (step @p103 :rule bool-double-not-elim :args (@t83))
% 0.45/0.64  (step @p104 :rule nary_cong :premises (@p97 @p103) :args ((or @t87 (not @t84))))
% 0.45/0.64  (step @p105 :rule cnf_or_neg :args (@t87 1))
% 0.45/0.64  (step @p106 :rule eq_resolve :premises (@p105 @p104))
% 0.45/0.64  (step @p107 :rule reordering :premises (@p106) :args ((or @t83 @t87)))
% 0.45/0.64  (step @p108 :rule chain_m_resolution :premises (@p107 @p95) :args (@t83 @t88 @t89))
% 0.45/0.64  (step @p109 :rule bool-double-not-elim :args (@t85))
% 0.45/0.64  (step @p110 :rule nary_cong :premises (@p97 @p109) :args ((or @t87 (not @t86))))
% 0.45/0.64  (step @p111 :rule cnf_or_neg :args (@t87 0))
% 0.45/0.64  (step @p112 :rule eq_resolve :premises (@p111 @p110))
% 0.45/0.64  (step @p113 :rule reordering :premises (@p112) :args ((or @t85 @t87)))
% 0.45/0.64  (step @p114 :rule chain_m_resolution :premises (@p113 @p95) :args (@t85 @t88 @t89))
% 0.45/0.64  (step @p115 :rule cnf_or_pos :args (@t92))
% 0.45/0.64  (step @p116 :rule reordering :premises (@p115) :args ((or @t86 @t84 @t80 @t91 (not @t92))))
% 0.45/0.64  (step @p117 :rule chain_m_resolution :premises (@p116 @p114 @p108 @p102 @p78) :args (@t91 @t93 (@list @t85 @t83 @t78 @t92)))
% 0.45/0.64  (step @p118 :rule true_intro :premises (@p117))
% 0.45/0.64  (step @p119 :rule aci_norm :args ((= (or @t76 (or @t67 @t94)) (or @t69 @t68 @t67 @t94))))
% 0.45/0.64  (step @p120 :rule bool-impl-elim :args (@t48 @t94))
% 0.45/0.64  (step @p121 :rule nary_cong :premises (@p87 @p120) :args ((or @t77 @t95)))
% 0.45/0.64  (step @p122 :rule trans :premises (@p121 @p119))
% 0.45/0.64  (step @p123 :rule bool-impl-elim :args (@t50 @t95))
% 0.45/0.64  (step @p124 :rule trans :premises (@p123 @p122))
% 0.45/0.64  (step @p125 :rule cong :premises (@p124) :args ((forall @t4 (=> @t50 @t95))))
% 0.45/0.64  (step @p126 :rule eq-symm :args (@t47 @t1))
% 0.45/0.64  (step @p127 :rule refl :args (@t48))
% 0.45/0.64  (step @p128 :rule cong :premises (@p127 @p126) :args (@t49))
% 0.45/0.64  (step @p129 :rule refl :args (@t50))
% 0.45/0.64  (step @p130 :rule cong :premises (@p129 @p128) :args (@t51))
% 0.45/0.64  (step @p131 :rule cong :premises (@p130) :args (@t52))
% 0.45/0.64  (step @p132 :rule trans :premises (@p131 @p125))
% 0.45/0.64  (step @p133 :rule eq_resolve :premises (@p50 @p132))
% 0.45/0.64  (step @p134 :rule instantiate :premises (@p133) :args ((@list @t72 @t73)))
% 0.45/0.64  (step @p135 :rule bool-double-not-elim :args (@t81))
% 0.45/0.64  (step @p136 :rule nary_cong :premises (@p97 @p135) :args ((or @t87 (not @t82))))
% 0.45/0.64  (step @p137 :rule cnf_or_neg :args (@t87 2))
% 0.45/0.64  (step @p138 :rule eq_resolve :premises (@p137 @p136))
% 0.45/0.64  (step @p139 :rule reordering :premises (@p138) :args ((or @t81 @t87)))
% 0.45/0.64  (step @p140 :rule chain_m_resolution :premises (@p139 @p95) :args (@t81 @t88 @t89))
% 0.45/0.64  (step @p141 :rule cnf_or_pos :args (@t97))
% 0.45/0.64  (step @p142 :rule reordering :premises (@p141) :args ((or @t86 @t84 @t82 @t96 (not @t97))))
% 0.45/0.64  (step @p143 :rule chain_m_resolution :premises (@p142 @p114 @p108 @p140 @p134) :args (@t96 @t93 (@list @t85 @t83 @t81 @t97)))
% 0.45/0.64  (step @p144 :rule cong :premises (@p143) :args (@t79))
% 0.45/0.64  (step @p145 :rule cnf_or_neg :args (@t87 4))
% 0.45/0.64  (step @p146 :rule chain_m_resolution :premises (@p145 @p95) :args ((not @t79) @t88 @t89))
% 0.45/0.64  (step @p147 :rule false_intro :premises (@p146))
% 0.45/0.64  (step @p148 :rule symm :premises (@p147))
% 0.45/0.64  (step @p149 :rule trans :premises (@p148 @p144 @p118))
% 0.45/0.64  (step @p150 false :rule eq_resolve :premises (@p149 @p62))
% 0.45/0.64  )
% 0.45/0.64  % SZS output end Proof
% 0.45/0.64  % cvc5 exiting
%------------------------------------------------------------------------------