%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : NUM430+1 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n016.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:39:23 AM UTC 2026 % Result : Theorem 0.44s 0.64s % Output : Proof 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM430+1 : TPTP v9.2.1. Released v4.0.0. % 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n016.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.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 11:18:54 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.44/0.64 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.44/0.64 % SZS status Theorem % 0.44/0.64 % SZS output start Proof % 0.44/0.64 ( % 0.44/0.64 (declare-sort $$unsorted 0) % 0.44/0.64 (declare-const tptp.xa $$unsorted) % 0.44/0.64 (declare-const tptp.xq $$unsorted) % 0.44/0.64 (declare-const tptp.xc $$unsorted) % 0.44/0.64 (declare-const tptp.xn $$unsorted) % 0.44/0.64 (declare-const tptp.xb $$unsorted) % 0.44/0.64 (declare-const tptp.sdtasdt0 (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.sdtpldt0 (-> $$unsorted $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.smndt0 (-> $$unsorted $$unsorted)) % 0.44/0.64 (declare-const tptp.sz10 $$unsorted) % 0.44/0.64 (declare-const tptp.sdteqdtlpzmzozddtrp0 (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.sz00 $$unsorted) % 0.44/0.64 (declare-const tptp.aDivisorOf0 (-> $$unsorted $$unsorted Bool)) % 0.44/0.64 (declare-const tptp.aInteger0 (-> $$unsorted Bool)) % 0.44/0.64 (define @t1 () (@var "W0" $$unsorted)) % 0.44/0.64 (define @t2 () (tptp.aInteger0 @t1)) % 0.44/0.64 (define @t3 () (@list @t1)) % 0.44/0.64 (define @t4 () (tptp.smndt0 @t1)) % 0.44/0.64 (define @t5 () (tptp.aInteger0 @t4)) % 0.44/0.64 (define @t6 () (forall @t3 (=> @t2 @t5))) % 0.44/0.64 (define @t7 () (@var "W1" $$unsorted)) % 0.44/0.64 (define @t8 () (tptp.sdtpldt0 @t1 @t7)) % 0.44/0.64 (define @t9 () (tptp.aInteger0 @t8)) % 0.44/0.64 (define @t10 () (tptp.aInteger0 @t7)) % 0.44/0.64 (define @t11 () (and @t2 @t10)) % 0.44/0.64 (define @t12 () (@list @t1 @t7)) % 0.44/0.64 (define @t13 () (forall @t12 (=> @t11 @t9))) % 0.44/0.64 (define @t14 () (tptp.sdtasdt0 @t1 @t7)) % 0.44/0.64 (define @t15 () (@var "W2" $$unsorted)) % 0.44/0.64 (define @t16 () (tptp.sdtpldt0 @t7 @t15)) % 0.44/0.64 (define @t17 () (tptp.aInteger0 @t15)) % 0.44/0.64 (define @t18 () (and @t2 @t10 @t17)) % 0.44/0.64 (define @t19 () (@list @t1 @t7 @t15)) % 0.44/0.64 (define @t20 () (tptp.sdtasdt0 @t7 @t15)) % 0.44/0.64 (define @t21 () (tptp.sdtasdt0 @t1 @t15)) % 0.44/0.64 (define @t22 () (tptp.smndt0 tptp.sz10)) % 0.44/0.64 (define @t23 () (= @t7 tptp.sz00)) % 0.44/0.64 (define @t24 () (and @t17 (= @t20 @t1))) % 0.44/0.64 (define @t25 () (@list @t15)) % 0.44/0.64 (define @t26 () (exists @t25 @t24)) % 0.44/0.64 (define @t27 () (not @t23)) % 0.44/0.64 (define @t28 () (and @t10 @t27 @t26)) % 0.44/0.64 (define @t29 () (tptp.aDivisorOf0 @t7 @t1)) % 0.44/0.64 (define @t30 () (= @t29 @t28)) % 0.44/0.64 (define @t31 () (@list @t7)) % 0.44/0.64 (define @t32 () (forall @t31 @t30)) % 0.44/0.64 (define @t33 () (=> @t2 @t32)) % 0.44/0.64 (define @t34 () (forall @t3 @t33)) % 0.44/0.64 (define @t35 () (tptp.sdteqdtlpzmzozddtrp0 @t1 @t7 @t15)) % 0.44/0.64 (define @t36 () (= @t35 (tptp.aDivisorOf0 @t15 (tptp.sdtpldt0 @t1 (tptp.smndt0 @t7))))) % 0.44/0.64 (define @t37 () (not (= @t15 tptp.sz00))) % 0.44/0.64 (define @t38 () (and @t2 @t10 @t17 @t37)) % 0.44/0.64 (define @t39 () (=> @t38 @t36)) % 0.44/0.64 (define @t40 () (forall @t19 @t39)) % 0.44/0.64 (define @t41 () (tptp.aInteger0 tptp.xc)) % 0.44/0.64 (define @t42 () (tptp.aInteger0 tptp.xq)) % 0.44/0.64 (define @t43 () (tptp.aInteger0 tptp.xb)) % 0.44/0.64 (define @t44 () (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)) % 0.44/0.64 (define @t45 () (tptp.smndt0 tptp.xc)) % 0.44/0.64 (define @t46 () (tptp.sdtpldt0 tptp.xb @t45)) % 0.44/0.64 (define @t47 () (= (tptp.sdtasdt0 tptp.xq @t1) @t46)) % 0.44/0.64 (define @t48 () (and @t2 @t47)) % 0.44/0.64 (define @t49 () (exists @t3 @t48)) % 0.44/0.64 (define @t50 () (not @t49)) % 0.44/0.64 (define @t51 () (@var "BOUND_VARIABLE_7680" $$unsorted)) % 0.44/0.64 (define @t52 () (not @t17)) % 0.44/0.64 (define @t53 () (= (tptp.aDivisorOf0 @t51 @t1) (and (tptp.aInteger0 @t51) (not (= tptp.sz00 @t51)) (not (forall @t25 (or @t52 (not (= @t1 (tptp.sdtasdt0 @t51 @t15))))))))) % 0.44/0.64 (define @t54 () (not @t2)) % 0.44/0.64 (define @t55 () (or @t54 @t53)) % 0.44/0.64 (define @t56 () (@list @t51)) % 0.44/0.64 (define @t57 () (forall @t56 @t55)) % 0.44/0.64 (define @t58 () (forall @t56 @t53)) % 0.44/0.64 (define @t59 () (or @t54 @t58)) % 0.44/0.64 (define @t60 () (= @t1 @t20)) % 0.44/0.64 (define @t61 () (forall @t31 (= @t29 (and @t10 (not (= tptp.sz00 @t7)) (not (forall @t25 (or @t52 (not @t60)))))))) % 0.44/0.64 (define @t62 () (and @t17 @t60)) % 0.44/0.64 (define @t63 () (forall @t25 (not @t62))) % 0.44/0.64 (define @t64 () (not @t63)) % 0.44/0.64 (define @t65 () (not @t10)) % 0.44/0.64 (define @t66 () (tptp.aInteger0 @t45)) % 0.44/0.64 (define @t67 () (not @t41)) % 0.44/0.64 (define @t68 () (or @t67 @t66)) % 0.44/0.64 (define @t69 () (@list false false)) % 0.44/0.64 (define @t70 () (tptp.aInteger0 @t46)) % 0.44/0.64 (define @t71 () (not @t66)) % 0.44/0.64 (define @t72 () (not @t43)) % 0.44/0.64 (define @t73 () (or @t72 @t71 @t70)) % 0.44/0.64 (define @t74 () (forall @t3 (or @t54 (not @t47)))) % 0.44/0.64 (define @t75 () (forall @t3 (not @t48))) % 0.44/0.64 (define @t76 () (not @t75)) % 0.44/0.64 (define @t77 () (tptp.sdtasdt0 tptp.xq @t15)) % 0.44/0.64 (define @t78 () (not (= @t77 @t46))) % 0.44/0.64 (define @t79 () (or @t52 @t78)) % 0.44/0.64 (define @t80 () (forall @t25 (or @t52 (not (= @t46 @t77))))) % 0.44/0.64 (define @t81 () (@list false)) % 0.44/0.64 (define @t82 () (not @t80)) % 0.44/0.64 (define @t83 () (= tptp.sz00 tptp.xq)) % 0.44/0.64 (define @t84 () (and @t42 (not @t83) @t82)) % 0.44/0.64 (define @t85 () (not @t84)) % 0.44/0.64 (define @t86 () (= tptp.sz00 @t15)) % 0.44/0.64 (define @t87 () (not @t86)) % 0.44/0.64 (define @t88 () (not @t87)) % 0.44/0.64 (define @t89 () (or @t54 @t65 @t52 @t88)) % 0.44/0.64 (define @t90 () (and @t2 @t10 @t17 @t87)) % 0.44/0.64 (define @t91 () (tptp.aDivisorOf0 tptp.xq @t46)) % 0.44/0.64 (define @t92 () (= @t44 @t91)) % 0.44/0.64 (define @t93 () (not @t42)) % 0.44/0.64 (define @t94 () (or @t72 @t67 @t93 @t83 @t92)) % 0.44/0.64 (define @t95 () (= @t91 @t84)) % 0.44/0.64 (define @t96 () (not @t95)) % 0.44/0.64 (define @t97 () (not @t70)) % 0.44/0.64 (define @t98 () (or @t97 @t95)) % 0.44/0.64 (assume @p1 (forall @t3 (=> @t2 true))) % 0.44/0.64 (assume @p2 (tptp.aInteger0 tptp.sz00)) % 0.44/0.64 (assume @p3 (tptp.aInteger0 tptp.sz10)) % 0.44/0.64 (assume @p4 @t6) % 0.44/0.64 (assume @p5 @t13) % 0.44/0.64 (assume @p6 (forall @t12 (=> @t11 (tptp.aInteger0 @t14)))) % 0.44/0.64 (assume @p7 (forall @t19 (=> @t18 (= (tptp.sdtpldt0 @t1 @t16) (tptp.sdtpldt0 @t8 @t15))))) % 0.44/0.64 (assume @p8 (forall @t12 (=> @t11 (= @t8 (tptp.sdtpldt0 @t7 @t1))))) % 0.44/0.64 (assume @p9 (forall @t3 (=> @t2 (and (= (tptp.sdtpldt0 @t1 tptp.sz00) @t1) (= @t1 (tptp.sdtpldt0 tptp.sz00 @t1)))))) % 0.44/0.64 (assume @p10 (forall @t3 (=> @t2 (and (= (tptp.sdtpldt0 @t1 @t4) tptp.sz00) (= tptp.sz00 (tptp.sdtpldt0 @t4 @t1)))))) % 0.44/0.64 (assume @p11 (forall @t19 (=> @t18 (= (tptp.sdtasdt0 @t1 @t20) (tptp.sdtasdt0 @t14 @t15))))) % 0.44/0.64 (assume @p12 (forall @t12 (=> @t11 (= @t14 (tptp.sdtasdt0 @t7 @t1))))) % 0.44/0.64 (assume @p13 (forall @t3 (=> @t2 (and (= (tptp.sdtasdt0 @t1 tptp.sz10) @t1) (= @t1 (tptp.sdtasdt0 tptp.sz10 @t1)))))) % 0.44/0.64 (assume @p14 (forall @t19 (=> @t18 (and (= (tptp.sdtasdt0 @t1 @t16) (tptp.sdtpldt0 @t14 @t21)) (= (tptp.sdtasdt0 @t8 @t15) (tptp.sdtpldt0 @t21 @t20)))))) % 0.44/0.64 (assume @p15 (forall @t3 (=> @t2 (and (= (tptp.sdtasdt0 @t1 tptp.sz00) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 tptp.sz00 @t1)))))) % 0.44/0.64 (assume @p16 (forall @t3 (=> @t2 (and (= (tptp.sdtasdt0 @t22 @t1) @t4) (= @t4 (tptp.sdtasdt0 @t1 @t22)))))) % 0.44/0.64 (assume @p17 (forall @t12 (=> @t11 (=> (= @t14 tptp.sz00) (or (= @t1 tptp.sz00) @t23))))) % 0.44/0.64 (assume @p18 @t34) % 0.44/0.64 (assume @p19 @t40) % 0.44/0.64 (assume @p20 (forall @t12 (=> (and @t2 @t10 @t27) (tptp.sdteqdtlpzmzozddtrp0 @t1 @t1 @t7)))) % 0.44/0.64 (assume @p21 (forall @t19 (=> @t38 (=> @t35 (tptp.sdteqdtlpzmzozddtrp0 @t7 @t1 @t15))))) % 0.44/0.64 (assume @p22 (and (tptp.aInteger0 tptp.xa) @t43 @t42 (not (= tptp.xq tptp.sz00)) @t41)) % 0.44/0.64 (assume @p23 (and (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) @t44)) % 0.44/0.64 (assume @p24 (and (tptp.aInteger0 tptp.xn) (= (tptp.sdtasdt0 tptp.xq tptp.xn) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) % 0.44/0.64 (assume @p25 @t50) % 0.44/0.64 (assume @p26 true) % 0.44/0.64 (step @p27 :rule quant-merge-prenex :args ((= (forall @t3 @t57) (forall (@list @t1 @t51) @t55)))) % 0.44/0.64 (step @p28 :rule alpha_equiv :args (@t58 (@list @t51) (@list @t7))) % 0.44/0.64 (step @p29 :rule refl :args (@t54)) % 0.44/0.64 (step @p30 :rule nary_cong :premises (@p29 @p28) :args (@t59)) % 0.44/0.64 (step @p31 :rule quant-miniscope-or :args ((= @t57 @t59))) % 0.44/0.64 (step @p32 :rule trans :premises (@p31 @p30)) % 0.44/0.64 (step @p33 :rule symm :premises (@p32)) % 0.44/0.64 (step @p34 :rule cong :premises (@p33) :args ((forall @t3 (or @t54 @t61)))) % 0.44/0.64 (step @p35 :rule trans :premises (@p34 @p27)) % 0.44/0.64 (step @p36 :rule bool-impl-elim :args (@t2 @t61)) % 0.44/0.64 (step @p37 :rule cong :premises (@p36) :args ((forall @t3 (=> @t2 @t61)))) % 0.44/0.64 (step @p38 :rule trans :premises (@p37 @p35)) % 0.44/0.64 (step @p39 :rule bool-and-de-morgan :args (@t17 @t60 true)) % 0.44/0.64 (step @p40 :rule cong :premises (@p39) :args (@t63)) % 0.44/0.64 (step @p41 :rule cong :premises (@p40) :args (@t64)) % 0.44/0.64 (step @p42 :rule exists-elim :args ((= (exists @t25 @t62) @t64))) % 0.44/0.64 (step @p43 :rule trans :premises (@p42 @p41)) % 0.44/0.64 (step @p44 :rule eq-symm :args (@t20 @t1)) % 0.44/0.64 (step @p45 :rule refl :args (@t17)) % 0.44/0.64 (step @p46 :rule nary_cong :premises (@p45 @p44) :args (@t24)) % 0.44/0.64 (step @p47 :rule cong :premises (@p46) :args (@t26)) % 0.44/0.64 (step @p48 :rule trans :premises (@p47 @p43)) % 0.44/0.64 (step @p49 :rule eq-symm :args (@t7 tptp.sz00)) % 0.44/0.64 (step @p50 :rule cong :premises (@p49) :args (@t27)) % 0.44/0.64 (step @p51 :rule refl :args (@t10)) % 0.44/0.64 (step @p52 :rule nary_cong :premises (@p51 @p50 @p48) :args (@t28)) % 0.44/0.64 (step @p53 :rule refl :args (@t29)) % 0.44/0.64 (step @p54 :rule cong :premises (@p53 @p52) :args (@t30)) % 0.44/0.64 (step @p55 :rule cong :premises (@p54) :args (@t32)) % 0.44/0.64 (step @p56 :rule refl :args (@t2)) % 0.44/0.64 (step @p57 :rule cong :premises (@p56 @p55) :args (@t33)) % 0.44/0.64 (step @p58 :rule cong :premises (@p57) :args (@t34)) % 0.44/0.64 (step @p59 :rule trans :premises (@p58 @p38)) % 0.44/0.64 (step @p60 :rule eq_resolve :premises (@p18 @p59)) % 0.44/0.64 (step @p61 :rule instantiate :premises (@p60) :args ((@list @t46 tptp.xq))) % 0.44/0.64 (step @p62 :rule aci_norm :args ((= (or (or @t54 @t65) @t9) (or @t54 @t65 @t9)))) % 0.44/0.64 (step @p63 :rule refl :args (@t9)) % 0.44/0.64 (step @p64 :rule bool-and-de-morgan :args (@t2 @t10 true)) % 0.44/0.64 (step @p65 :rule nary_cong :premises (@p64 @p63) :args ((or (not @t11) @t9))) % 0.44/0.64 (step @p66 :rule trans :premises (@p65 @p62)) % 0.44/0.64 (step @p67 :rule bool-impl-elim :args (@t11 @t9)) % 0.44/0.64 (step @p68 :rule trans :premises (@p67 @p66)) % 0.44/0.64 (step @p69 :rule cong :premises (@p68) :args (@t13)) % 0.44/0.64 (step @p70 :rule eq_resolve :premises (@p5 @p69)) % 0.44/0.64 (step @p71 :rule instantiate :premises (@p70) :args ((@list tptp.xb @t45))) % 0.44/0.64 (step @p72 :rule bool-impl-elim :args (@t2 @t5)) % 0.44/0.64 (step @p73 :rule cong :premises (@p72) :args (@t6)) % 0.44/0.64 (step @p74 :rule eq_resolve :premises (@p4 @p73)) % 0.44/0.64 (step @p75 :rule instantiate :premises (@p74) :args ((@list tptp.xc))) % 0.44/0.64 (step @p76 :rule and_elim :premises (@p22) :args (4)) % 0.44/0.64 (step @p77 :rule cnf_or_pos :args (@t68)) % 0.44/0.64 (step @p78 :rule reordering :premises (@p77) :args ((or @t67 @t66 (not @t68)))) % 0.44/0.64 (step @p79 :rule chain_m_resolution :premises (@p78 @p76 @p75) :args (@t66 @t69 (@list @t41 @t68))) % 0.44/0.64 (step @p80 :rule and_elim :premises (@p22) :args (1)) % 0.44/0.64 (step @p81 :rule cnf_or_pos :args (@t73)) % 0.44/0.64 (step @p82 :rule reordering :premises (@p81) :args ((or @t72 @t71 @t70 (not @t73)))) % 0.44/0.64 (step @p83 :rule chain_m_resolution :premises (@p82 @p80 @p79 @p71) :args (@t70 (@list false false false) (@list @t43 @t66 @t73))) % 0.44/0.64 (step @p84 :rule bool-double-not-elim :args (@t74)) % 0.44/0.64 (step @p85 :rule bool-and-de-morgan :args (@t2 @t47 true)) % 0.44/0.64 (step @p86 :rule cong :premises (@p85) :args (@t75)) % 0.44/0.64 (step @p87 :rule cong :premises (@p86) :args (@t76)) % 0.44/0.64 (step @p88 :rule exists-elim :args ((= @t49 @t76))) % 0.44/0.64 (step @p89 :rule trans :premises (@p88 @p87)) % 0.44/0.64 (step @p90 :rule cong :premises (@p89) :args (@t50)) % 0.44/0.64 (step @p91 :rule trans :premises (@p90 @p84)) % 0.44/0.64 (step @p92 :rule eq_resolve :premises (@p25 @p91)) % 0.44/0.64 (step @p93 :rule eq-symm :args (@t77 @t46)) % 0.44/0.64 (step @p94 :rule cong :premises (@p93) :args (@t78)) % 0.44/0.64 (step @p95 :rule refl :args (@t52)) % 0.44/0.64 (step @p96 :rule nary_cong :premises (@p95 @p94) :args (@t79)) % 0.44/0.64 (step @p97 :rule cong :premises (@p96) :args ((forall @t25 @t79))) % 0.44/0.64 (step @p98 :rule alpha_equiv :args (@t74 (@list @t1) (@list @t15))) % 0.44/0.64 (step @p99 :rule trans :premises (@p98 @p97)) % 0.44/0.64 (step @p100 :rule equiv_elim1 :premises (@p99)) % 0.44/0.64 (step @p101 :rule chain_m_resolution :premises (@p100 @p92) :args (@t80 @t81 (@list @t74))) % 0.44/0.64 (step @p102 :rule cnf_and_pos :args (@t84 2)) % 0.44/0.64 (step @p103 :rule reordering :premises (@p102) :args ((or @t82 @t85))) % 0.44/0.64 (step @p104 :rule chain_m_resolution :premises (@p103 @p101) :args (@t85 @t81 (@list @t80))) % 0.44/0.64 (step @p105 :rule aci_norm :args ((= (or (or @t54 @t65 @t52 @t86) @t36) (or @t54 @t65 @t52 @t86 @t36)))) % 0.44/0.64 (step @p106 :rule refl :args (@t36)) % 0.44/0.64 (step @p107 :rule bool-double-not-elim :args (@t86)) % 0.44/0.64 (step @p108 :rule refl :args (@t52)) % 0.44/0.64 (step @p109 :rule refl :args (@t65)) % 0.44/0.64 (step @p110 :rule nary_cong :premises (@p29 @p109 @p108 @p107) :args (@t89)) % 0.44/0.64 (step @p111 :rule aci_norm :args ((= (or @t54 (or @t65 (or @t52 @t88))) @t89))) % 0.44/0.64 (step @p112 :rule trans :premises (@p111 @p110)) % 0.44/0.64 (step @p113 :rule bool-and-de-morgan :args (@t17 @t87 true)) % 0.44/0.64 (step @p114 :rule nary_cong :premises (@p109 @p113) :args ((or @t65 (not (and @t17 @t87))))) % 0.44/0.64 (step @p115 :rule bool-and-de-morgan :args (@t10 @t17 (and @t87))) % 0.44/0.64 (step @p116 :rule trans :premises (@p115 @p114)) % 0.44/0.64 (step @p117 :rule nary_cong :premises (@p29 @p116) :args ((or @t54 (not (and @t10 @t17 @t87))))) % 0.44/0.64 (step @p118 :rule bool-and-de-morgan :args (@t2 @t10 (and @t17 @t87))) % 0.44/0.64 (step @p119 :rule trans :premises (@p118 @p117)) % 0.44/0.64 (step @p120 :rule trans :premises (@p119 @p112)) % 0.44/0.64 (step @p121 :rule nary_cong :premises (@p120 @p106) :args ((or (not @t90) @t36))) % 0.44/0.64 (step @p122 :rule trans :premises (@p121 @p105)) % 0.44/0.64 (step @p123 :rule bool-impl-elim :args (@t90 @t36)) % 0.44/0.65 (step @p124 :rule trans :premises (@p123 @p122)) % 0.44/0.65 (step @p125 :rule cong :premises (@p124) :args ((forall @t19 (=> @t90 @t36)))) % 0.44/0.65 (step @p126 :rule refl :args (@t36)) % 0.44/0.65 (step @p127 :rule eq-symm :args (@t15 tptp.sz00)) % 0.44/0.65 (step @p128 :rule cong :premises (@p127) :args (@t37)) % 0.44/0.65 (step @p129 :rule nary_cong :premises (@p56 @p51 @p45 @p128) :args (@t38)) % 0.44/0.65 (step @p130 :rule cong :premises (@p129 @p126) :args (@t39)) % 0.44/0.65 (step @p131 :rule cong :premises (@p130) :args (@t40)) % 0.44/0.65 (step @p132 :rule trans :premises (@p131 @p125)) % 0.44/0.65 (step @p133 :rule eq_resolve :premises (@p19 @p132)) % 0.44/0.65 (step @p134 :rule instantiate :premises (@p133) :args ((@list tptp.xb tptp.xc tptp.xq))) % 0.44/0.65 (step @p135 :rule and_elim :premises (@p22) :args (2)) % 0.44/0.65 (step @p136 :rule and_elim :premises (@p22) :args (3)) % 0.44/0.65 (step @p137 :rule symm :premises (@p136)) % 0.44/0.65 (step @p138 :rule cnf_or_pos :args (@t94)) % 0.44/0.65 (step @p139 :rule reordering :premises (@p138) :args ((or @t83 @t72 @t93 @t67 @t92 (not @t94)))) % 0.44/0.65 (step @p140 :rule chain_m_resolution :premises (@p139 @p137 @p80 @p135 @p76 @p134) :args (@t92 (@list true false false false false) (@list @t83 @t43 @t42 @t41 @t94))) % 0.44/0.65 (step @p141 :rule and_elim :premises (@p23) :args (1)) % 0.44/0.65 (step @p142 :rule cnf_equiv_pos1 :args (@t92)) % 0.44/0.65 (step @p143 :rule reordering :premises (@p142) :args ((or (not @t44) @t91 (not @t92)))) % 0.44/0.65 (step @p144 :rule chain_m_resolution :premises (@p143 @p141 @p140) :args (@t91 @t69 (@list @t44 @t92))) % 0.44/0.65 (step @p145 :rule cnf_equiv_pos1 :args (@t95)) % 0.44/0.65 (step @p146 :rule reordering :premises (@p145) :args ((or (not @t91) @t84 @t96))) % 0.44/0.65 (step @p147 :rule chain_m_resolution :premises (@p146 @p144 @p104) :args (@t96 (@list false true) (@list @t91 @t84))) % 0.44/0.65 (step @p148 :rule cnf_or_pos :args (@t98)) % 0.44/0.65 (step @p149 :rule reordering :premises (@p148) :args ((or @t97 @t95 (not @t98)))) % 0.44/0.65 (step @p150 false :rule chain_m_resolution :premises (@p149 @p147 @p83 @p61) :args (false (@list true false false) (@list @t95 @t70 @t98))) % 0.44/0.65 ) % 0.44/0.65 % SZS output end Proof % 0.44/0.65 % cvc5 exiting %------------------------------------------------------------------------------