↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:04:58 AM UTC 2026

% Result   : Theorem 0.20s 0.52s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n006.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep  7 14:01:31 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.45  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.20/0.52  % SZS status Theorem
% 0.20/0.52  % SZS output start Proof
% 0.20/0.52  (
% 0.20/0.52  (declare-sort $$unsorted 0)
% 0.20/0.52  (declare-const tptp.axis_subsumes (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.axis_compatible (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.less (-> $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.box_verdict (-> $$unsorted $$unsorted $$unsorted))
% 0.20/0.52  (declare-const tptp.in_lopen (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.leq (-> $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.or_verdict (-> $$unsorted $$unsorted $$unsorted))
% 0.20/0.52  (declare-const tptp.axis_conflict (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.is_verdict (-> $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.compatible $$unsorted)
% 0.20/0.52  (declare-const tptp.in_open (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.conflict $$unsorted)
% 0.20/0.52  (declare-const tptp.xone_verdict (-> $$unsorted $$unsorted $$unsorted))
% 0.20/0.52  (declare-const tptp.in_closed (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (declare-const tptp.unknown $$unsorted)
% 0.20/0.52  (declare-const tptp.in_ropen (-> $$unsorted $$unsorted $$unsorted Bool))
% 0.20/0.52  (define @t1 () (@var "X" $$unsorted))
% 0.20/0.52  (define @t2 () (@list @t1))
% 0.20/0.52  (define @t3 () (@var "Z" $$unsorted))
% 0.20/0.52  (define @t4 () (tptp.less @t1 @t3))
% 0.20/0.52  (define @t5 () (@var "Y" $$unsorted))
% 0.20/0.52  (define @t6 () (tptp.less @t5 @t3))
% 0.20/0.52  (define @t7 () (tptp.less @t1 @t5))
% 0.20/0.52  (define @t8 () (@list @t1 @t5 @t3))
% 0.20/0.52  (define @t9 () (= @t1 @t5))
% 0.20/0.52  (define @t10 () (@list @t1 @t5))
% 0.20/0.52  (define @t11 () (tptp.leq @t1 @t5))
% 0.20/0.52  (define @t12 () (tptp.leq @t5 @t3))
% 0.20/0.52  (define @t13 () (@var "V2" $$unsorted))
% 0.20/0.52  (define @t14 () (@var "V1" $$unsorted))
% 0.20/0.52  (define @t15 () (tptp.or_verdict @t14 @t13))
% 0.20/0.52  (define @t16 () (= @t15 tptp.compatible))
% 0.20/0.52  (define @t17 () (= @t13 tptp.compatible))
% 0.20/0.52  (define @t18 () (= @t14 tptp.compatible))
% 0.20/0.52  (define @t19 () (tptp.is_verdict @t13))
% 0.20/0.52  (define @t20 () (tptp.is_verdict @t14))
% 0.20/0.52  (define @t21 () (@list @t14 @t13))
% 0.20/0.52  (define @t22 () (= @t15 tptp.conflict))
% 0.20/0.52  (define @t23 () (= @t13 tptp.conflict))
% 0.20/0.52  (define @t24 () (= @t14 tptp.conflict))
% 0.20/0.52  (define @t25 () (= @t15 tptp.unknown))
% 0.20/0.52  (define @t26 () (and @t20 @t19))
% 0.20/0.52  (define @t27 () (@var "Vr" $$unsorted))
% 0.20/0.52  (define @t28 () (@var "Vm" $$unsorted))
% 0.20/0.52  (define @t29 () (tptp.xone_verdict @t28 @t27))
% 0.20/0.52  (define @t30 () (= @t29 tptp.compatible))
% 0.20/0.52  (define @t31 () (= @t27 tptp.conflict))
% 0.20/0.52  (define @t32 () (= @t28 tptp.compatible))
% 0.20/0.52  (define @t33 () (tptp.is_verdict @t27))
% 0.20/0.52  (define @t34 () (tptp.is_verdict @t28))
% 0.20/0.52  (define @t35 () (and @t34 @t33 @t32 @t31))
% 0.20/0.52  (define @t36 () (=> @t35 @t30))
% 0.20/0.52  (define @t37 () (@list @t28 @t27))
% 0.20/0.52  (define @t38 () (forall @t37 @t36))
% 0.20/0.52  (define @t39 () (= @t29 tptp.conflict))
% 0.20/0.52  (define @t40 () (= @t28 tptp.conflict))
% 0.20/0.52  (define @t41 () (= @t29 tptp.unknown))
% 0.20/0.52  (define @t42 () (@var "B2hi" $$unsorted))
% 0.20/0.52  (define @t43 () (@var "B2lo" $$unsorted))
% 0.20/0.52  (define @t44 () (@var "B1hi" $$unsorted))
% 0.20/0.52  (define @t45 () (@var "B1lo" $$unsorted))
% 0.20/0.52  (define @t46 () (@var "A2hi" $$unsorted))
% 0.20/0.52  (define @t47 () (@var "A2lo" $$unsorted))
% 0.20/0.52  (define @t48 () (@var "A1hi" $$unsorted))
% 0.20/0.52  (define @t49 () (@var "A1lo" $$unsorted))
% 0.20/0.52  (define @t50 () (@var "B" $$unsorted))
% 0.20/0.52  (define @t51 () (tptp.leq @t1 @t50))
% 0.20/0.52  (define @t52 () (@var "A" $$unsorted))
% 0.20/0.52  (define @t53 () (tptp.leq @t52 @t1))
% 0.20/0.52  (define @t54 () (@list @t1 @t52 @t50))
% 0.20/0.52  (define @t55 () (tptp.less @t52 @t1))
% 0.20/0.52  (define @t56 () (tptp.less @t1 @t50))
% 0.20/0.52  (define @t57 () (@var "I2hi" $$unsorted))
% 0.20/0.52  (define @t58 () (@var "I2lo" $$unsorted))
% 0.20/0.52  (define @t59 () (tptp.in_closed @t1 @t58 @t57))
% 0.20/0.52  (define @t60 () (@var "I1hi" $$unsorted))
% 0.20/0.52  (define @t61 () (@var "I1lo" $$unsorted))
% 0.20/0.52  (define @t62 () (tptp.in_closed @t1 @t61 @t60))
% 0.20/0.52  (define @t63 () (exists @t2 (and @t62 @t59)))
% 0.20/0.52  (define @t64 () (@list @t61 @t60 @t58 @t57))
% 0.20/0.52  (define @t65 () (tptp.is_verdict tptp.conflict))
% 0.20/0.52  (define @t66 () (tptp.is_verdict tptp.compatible))
% 0.20/0.52  (define @t67 () (@var "V" $$unsorted))
% 0.20/0.52  (define @t68 () (tptp.box_verdict @t14 @t13))
% 0.20/0.52  (define @t69 () (= @t68 tptp.conflict))
% 0.20/0.52  (define @t70 () (= @t68 tptp.compatible))
% 0.20/0.52  (define @t71 () (= @t68 tptp.unknown))
% 0.20/0.52  (define @t72 () (tptp.xone_verdict tptp.compatible tptp.conflict))
% 0.20/0.52  (define @t73 () (= tptp.compatible @t72))
% 0.20/0.52  (define @t74 () (not @t65))
% 0.20/0.52  (define @t75 () (not @t66))
% 0.20/0.52  (define @t76 () (or @t74 @t73))
% 0.20/0.52  (define @t77 () (not (= tptp.conflict tptp.conflict)))
% 0.20/0.52  (define @t78 () (or @t74 @t77 @t73))
% 0.20/0.52  (define @t79 () (= tptp.compatible (tptp.xone_verdict tptp.compatible @t27)))
% 0.20/0.52  (define @t80 () (= tptp.conflict @t27))
% 0.20/0.52  (define @t81 () (not @t80))
% 0.20/0.52  (define @t82 () (not @t33))
% 0.20/0.52  (define @t83 () (@list @t27))
% 0.20/0.52  (define @t84 () (or @t81 @t82 @t81 @t79))
% 0.20/0.52  (define @t85 () (or @t82 @t81 @t79))
% 0.20/0.52  (define @t86 () (forall @t83 @t85))
% 0.20/0.52  (define @t87 () (or @t75 @t86))
% 0.20/0.52  (define @t88 () (or @t75 @t85))
% 0.20/0.52  (define @t89 () (or @t75 @t82 @t81 @t79))
% 0.20/0.52  (define @t90 () (not (= tptp.compatible tptp.compatible)))
% 0.20/0.52  (define @t91 () (or @t75 @t82 @t90 @t81 @t79))
% 0.20/0.52  (define @t92 () (= tptp.compatible @t29))
% 0.20/0.52  (define @t93 () (= tptp.compatible @t28))
% 0.20/0.52  (define @t94 () (not @t93))
% 0.20/0.52  (define @t95 () (not @t34))
% 0.20/0.52  (define @t96 () (@list @t28))
% 0.20/0.52  (define @t97 () (or @t94 @t95 @t82 @t94 @t81 @t92))
% 0.20/0.52  (define @t98 () (or @t95 @t82 @t94 @t81 @t92))
% 0.20/0.52  (define @t99 () (forall @t96 @t98))
% 0.20/0.52  (define @t100 () (forall @t83 @t99))
% 0.20/0.52  (define @t101 () (forall (@list @t27 @t28) @t98))
% 0.20/0.52  (define @t102 () (or @t95 @t82 @t94 @t81))
% 0.20/0.52  (define @t103 () (and @t34 @t33 @t93 @t80))
% 0.20/0.52  (assume @p1 (forall @t2 (not (tptp.less @t1 @t1))))
% 0.20/0.52  (assume @p2 (forall @t8 (=> (and @t7 @t6) @t4)))
% 0.20/0.52  (assume @p3 (forall @t10 (or @t7 @t9 (tptp.less @t5 @t1))))
% 0.20/0.52  (assume @p4 (forall @t10 (= @t11 (or @t7 @t9))))
% 0.20/0.52  (assume @p5 (forall @t10 (=> (and @t11 (tptp.leq @t5 @t1)) @t9)))
% 0.20/0.52  (assume @p6 (forall @t10 (=> @t7 @t11)))
% 0.20/0.52  (assume @p7 (forall @t8 (=> (and @t11 @t6) @t4)))
% 0.20/0.52  (assume @p8 (forall @t8 (=> (and @t7 @t12) @t4)))
% 0.20/0.52  (assume @p9 (forall @t8 (=> (and @t11 @t12) (tptp.leq @t1 @t3))))
% 0.20/0.52  (assume @p10 (forall @t21 (=> (and @t20 @t19 (or @t18 @t17)) @t16)))
% 0.20/0.52  (assume @p11 (forall @t21 (=> (and @t20 @t19 @t24 @t23) @t22)))
% 0.20/0.52  (assume @p12 (forall @t21 (=> (and @t20 @t19 (not @t18) (not @t17) (not (and @t24 @t23))) @t25)))
% 0.20/0.52  (assume @p13 (forall @t21 (=> @t26 (or @t16 @t22 @t25))))
% 0.20/0.52  (assume @p14 @t38)
% 0.20/0.52  (assume @p15 (forall @t37 (=> (and @t34 @t33 @t40 @t31) @t39)))
% 0.20/0.52  (assume @p16 (forall @t37 (=> (and @t34 @t33 (not (and @t32 @t31)) (not (and @t40 @t31))) @t41)))
% 0.20/0.52  (assume @p17 (forall @t37 (=> (and @t34 @t33) (or @t30 @t39 @t41))))
% 0.20/0.52  (assume @p18 (forall (@list @t49 @t48 @t47 @t46 @t45 @t44 @t43 @t42) (=> (and (tptp.axis_conflict @t49 @t48 @t45 @t44) (tptp.axis_conflict @t49 @t48 @t43 @t42) (tptp.axis_conflict @t47 @t46 @t45 @t44) (tptp.axis_conflict @t47 @t46 @t43 @t42)) (not (exists @t2 (and (or (tptp.in_closed @t1 @t49 @t48) (tptp.in_closed @t1 @t47 @t46)) (or (tptp.in_closed @t1 @t45 @t44) (tptp.in_closed @t1 @t43 @t42))))))))
% 0.20/0.52  (assume @p19 (forall @t54 (= (tptp.in_closed @t1 @t52 @t50) (and @t53 @t51))))
% 0.20/0.52  (assume @p20 (forall @t54 (= (tptp.in_lopen @t1 @t52 @t50) (and @t55 @t51))))
% 0.20/0.52  (assume @p21 (forall @t54 (= (tptp.in_ropen @t1 @t52 @t50) (and @t53 @t56))))
% 0.20/0.52  (assume @p22 (forall @t54 (= (tptp.in_open @t1 @t52 @t50) (and @t55 @t56))))
% 0.20/0.52  (assume @p23 (forall @t64 (= (tptp.axis_conflict @t61 @t60 @t58 @t57) (not @t63))))
% 0.20/0.52  (assume @p24 (forall @t64 (= (tptp.axis_compatible @t61 @t60 @t58 @t57) @t63)))
% 0.20/0.52  (assume @p25 (forall @t64 (= (tptp.axis_subsumes @t61 @t60 @t58 @t57) (forall @t2 (=> @t62 @t59)))))
% 0.20/0.52  (assume @p26 @t65)
% 0.20/0.52  (assume @p27 @t66)
% 0.20/0.52  (assume @p28 (tptp.is_verdict tptp.unknown))
% 0.20/0.52  (assume @p29 (not (= tptp.conflict tptp.compatible)))
% 0.20/0.52  (assume @p30 (not (= tptp.conflict tptp.unknown)))
% 0.20/0.52  (assume @p31 (not (= tptp.compatible tptp.unknown)))
% 0.20/0.52  (assume @p32 (forall (@list @t67) (=> (tptp.is_verdict @t67) (or (= @t67 tptp.conflict) (= @t67 tptp.compatible) (= @t67 tptp.unknown)))))
% 0.20/0.52  (assume @p33 (forall @t21 (=> (and @t20 @t19 (or @t24 @t23)) @t69)))
% 0.20/0.52  (assume @p34 (forall @t21 (=> (and @t20 @t19 @t18 @t17) @t70)))
% 0.20/0.52  (assume @p35 (forall @t21 (=> (and @t20 @t19 (or (= @t14 tptp.unknown) (= @t13 tptp.unknown)) (not @t24) (not @t23)) @t71)))
% 0.20/0.52  (assume @p36 (forall @t21 (=> @t26 (or @t69 @t70 @t71))))
% 0.20/0.52  (assume @p37 (not (= @t72 tptp.compatible)))
% 0.20/0.52  (assume @p38 true)
% 0.20/0.52  (step @p39 :rule aci_norm :args ((= (or @t75 @t76) (or @t75 @t74 @t73))))
% 0.20/0.52  (step @p40 :rule aci_norm :args ((= (or @t74 false @t73) @t76)))
% 0.20/0.52  (step @p41 :rule refl :args (@t73))
% 0.20/0.52  (step @p42 :rule evaluate :args ((not true)))
% 0.20/0.52  (step @p43 :rule eq-refl :args (tptp.conflict))
% 0.20/0.52  (step @p44 :rule cong :premises (@p43) :args (@t77))
% 0.20/0.52  (step @p45 :rule trans :premises (@p44 @p42))
% 0.20/0.52  (step @p46 :rule refl :args (@t74))
% 0.20/0.52  (step @p47 :rule nary_cong :premises (@p46 @p45 @p41) :args (@t78))
% 0.20/0.52  (step @p48 :rule trans :premises (@p47 @p40))
% 0.20/0.52  (step @p49 :rule quant-var-elim-eq :args ((= (forall @t83 (or (not @t31) @t82 @t81 @t79)) @t78)))
% 0.20/0.52  (step @p50 :rule refl :args (@t79))
% 0.20/0.52  (step @p51 :rule refl :args (@t81))
% 0.20/0.52  (step @p52 :rule refl :args (@t82))
% 0.20/0.52  (step @p53 :rule eq-symm :args (tptp.conflict @t27))
% 0.20/0.52  (step @p54 :rule cong :premises (@p53) :args (@t81))
% 0.20/0.52  (step @p55 :rule nary_cong :premises (@p54 @p52 @p51 @p50) :args (@t84))
% 0.20/0.52  (step @p56 :rule aci_norm :args ((= @t85 @t84)))
% 0.20/0.52  (step @p57 :rule trans :premises (@p56 @p55))
% 0.20/0.52  (step @p58 :rule cong :premises (@p57) :args (@t86))
% 0.20/0.52  (step @p59 :rule trans :premises (@p58 @p49))
% 0.20/0.52  (step @p60 :rule trans :premises (@p59 @p48))
% 0.20/0.52  (step @p61 :rule refl :args (@t75))
% 0.20/0.52  (step @p62 :rule nary_cong :premises (@p61 @p60) :args (@t87))
% 0.20/0.52  (step @p63 :rule trans :premises (@p62 @p39))
% 0.20/0.52  (step @p64 :rule quant-miniscope-or :args ((= (forall @t83 @t88) @t87)))
% 0.20/0.52  (step @p65 :rule aci_norm :args ((= @t89 @t88)))
% 0.20/0.52  (step @p66 :rule cong :premises (@p65) :args ((forall @t83 @t89)))
% 0.20/0.52  (step @p67 :rule trans :premises (@p66 @p64))
% 0.20/0.52  (step @p68 :rule trans :premises (@p67 @p63))
% 0.20/0.52  (step @p69 :rule aci_norm :args ((= (or @t75 @t82 false @t81 @t79) @t89)))
% 0.20/0.52  (step @p70 :rule refl :args (@t79))
% 0.20/0.52  (step @p71 :rule refl :args (@t81))
% 0.20/0.52  (step @p72 :rule eq-refl :args (tptp.compatible))
% 0.20/0.52  (step @p73 :rule cong :premises (@p72) :args (@t90))
% 0.20/0.52  (step @p74 :rule trans :premises (@p73 @p42))
% 0.20/0.52  (step @p75 :rule refl :args (@t82))
% 0.20/0.52  (step @p76 :rule nary_cong :premises (@p61 @p75 @p74 @p71 @p70) :args (@t91))
% 0.20/0.52  (step @p77 :rule trans :premises (@p76 @p69))
% 0.20/0.52  (step @p78 :rule cong :premises (@p77) :args ((forall @t83 @t91)))
% 0.20/0.52  (step @p79 :rule trans :premises (@p78 @p68))
% 0.20/0.52  (step @p80 :rule quant-var-elim-eq :args ((= (forall @t96 (or (not @t32) @t95 @t82 @t94 @t81 @t92)) @t91)))
% 0.20/0.52  (step @p81 :rule refl :args (@t92))
% 0.20/0.52  (step @p82 :rule refl :args (@t94))
% 0.20/0.52  (step @p83 :rule refl :args (@t95))
% 0.20/0.52  (step @p84 :rule eq-symm :args (tptp.compatible @t28))
% 0.20/0.52  (step @p85 :rule cong :premises (@p84) :args (@t94))
% 0.20/0.52  (step @p86 :rule nary_cong :premises (@p85 @p83 @p52 @p82 @p51 @p81) :args (@t97))
% 0.20/0.52  (step @p87 :rule aci_norm :args ((= @t98 @t97)))
% 0.20/0.52  (step @p88 :rule trans :premises (@p87 @p86))
% 0.20/0.52  (step @p89 :rule cong :premises (@p88) :args (@t99))
% 0.20/0.52  (step @p90 :rule trans :premises (@p89 @p80))
% 0.20/0.52  (step @p91 :rule cong :premises (@p90) :args (@t100))
% 0.20/0.52  (step @p92 :rule quant-merge-prenex :args ((= @t100 @t101)))
% 0.20/0.52  (step @p93 :rule symm :premises (@p92))
% 0.20/0.52  (step @p94 :rule quant_var_reordering :args ((= (forall @t37 @t98) @t101)))
% 0.20/0.52  (step @p95 :rule trans :premises (@p94 @p93 @p91))
% 0.20/0.52  (step @p96 :rule trans :premises (@p95 @p79))
% 0.20/0.52  (step @p97 :rule aci_norm :args ((= (or @t102 @t92) @t98)))
% 0.20/0.52  (step @p98 :rule aci_norm :args ((= (or @t95 (or @t82 (or @t94 @t81))) @t102)))
% 0.20/0.52  (step @p99 :rule bool-and-de-morgan :args (@t93 @t80 true))
% 0.20/0.52  (step @p100 :rule nary_cong :premises (@p52 @p99) :args ((or @t82 (not (and @t93 @t80)))))
% 0.20/0.52  (step @p101 :rule bool-and-de-morgan :args (@t33 @t93 (and @t80)))
% 0.20/0.52  (step @p102 :rule trans :premises (@p101 @p100))
% 0.20/0.52  (step @p103 :rule nary_cong :premises (@p83 @p102) :args ((or @t95 (not (and @t33 @t93 @t80)))))
% 0.20/0.52  (step @p104 :rule bool-and-de-morgan :args (@t34 @t33 (and @t93 @t80)))
% 0.20/0.52  (step @p105 :rule trans :premises (@p104 @p103))
% 0.20/0.52  (step @p106 :rule trans :premises (@p105 @p98))
% 0.20/0.52  (step @p107 :rule nary_cong :premises (@p106 @p81) :args ((or (not @t103) @t92)))
% 0.20/0.52  (step @p108 :rule trans :premises (@p107 @p97))
% 0.20/0.52  (step @p109 :rule bool-impl-elim :args (@t103 @t92))
% 0.20/0.52  (step @p110 :rule trans :premises (@p109 @p108))
% 0.20/0.52  (step @p111 :rule cong :premises (@p110) :args ((forall @t37 (=> @t103 @t92))))
% 0.20/0.52  (step @p112 :rule trans :premises (@p111 @p96))
% 0.20/0.52  (step @p113 :rule eq-symm :args (@t29 tptp.compatible))
% 0.20/0.52  (step @p114 :rule eq-symm :args (@t27 tptp.conflict))
% 0.20/0.52  (step @p115 :rule eq-symm :args (@t28 tptp.compatible))
% 0.20/0.52  (step @p116 :rule refl :args (@t33))
% 0.20/0.52  (step @p117 :rule refl :args (@t34))
% 0.20/0.52  (step @p118 :rule nary_cong :premises (@p117 @p116 @p115 @p114) :args (@t35))
% 0.20/0.52  (step @p119 :rule cong :premises (@p118 @p113) :args (@t36))
% 0.20/0.52  (step @p120 :rule cong :premises (@p119) :args (@t38))
% 0.20/0.52  (step @p121 :rule trans :premises (@p120 @p112))
% 0.20/0.52  (step @p122 :rule eq_resolve :premises (@p14 @p121))
% 0.20/0.52  (step @p123 :rule reordering :premises (@p122) :args ((or @t74 @t75 @t73)))
% 0.20/0.52  (step @p124 :rule chain_m_resolution :premises (@p123 @p26 @p27) :args (@t73 (@list false false) (@list @t65 @t66)))
% 0.20/0.52  (step @p125 :rule symm :premises (@p37))
% 0.20/0.52  (step @p126 false :rule chain_m_resolution :premises (@p125 @p124) :args (false (@list false) (@list @t73)))
% 0.20/0.52  )
% 0.20/0.52  % SZS output end Proof
% 0.20/0.52  % cvc5 exiting
%------------------------------------------------------------------------------