%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : NUM492+3 : 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 : n017.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:36 AM UTC 2026 % Result : Theorem 0.47s 0.66s % Output : Proof 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM492+3 : 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.35 % Computer : n017.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % 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 11:23:01 EDT 2026 % 0.17/0.35 % CPUTime : % 0.27/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.47/0.66 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.47/0.66 % SZS status Theorem % 0.47/0.66 % SZS output start Proof % 0.47/0.66 ( % 0.47/0.66 (declare-sort $$unsorted 0) % 0.47/0.66 (declare-const tptp.xr $$unsorted) % 0.47/0.66 (declare-const tptp.doDivides0 (-> $$unsorted $$unsorted Bool)) % 0.47/0.66 (declare-const tptp.xm $$unsorted) % 0.47/0.66 (declare-const tptp.sdtpldt0 (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.66 (declare-const tptp.sdtlseqdt0 (-> $$unsorted $$unsorted Bool)) % 0.47/0.66 (declare-const tptp.xn $$unsorted) % 0.47/0.66 (declare-const tptp.aNaturalNumber0 (-> $$unsorted Bool)) % 0.47/0.66 (declare-const tptp.sz00 $$unsorted) % 0.47/0.66 (declare-const tptp.sdtsldt0 (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.66 (declare-const tptp.sdtasdt0 (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.66 (declare-const tptp.sdtmndt0 (-> $$unsorted $$unsorted $$unsorted)) % 0.47/0.66 (declare-const tptp.iLess0 (-> $$unsorted $$unsorted Bool)) % 0.47/0.66 (declare-const tptp.isPrime0 (-> $$unsorted Bool)) % 0.47/0.66 (declare-const tptp.sz10 $$unsorted) % 0.47/0.66 (declare-const tptp.xp $$unsorted) % 0.47/0.66 (define @t1 () (@var "W0" $$unsorted)) % 0.47/0.66 (define @t2 () (tptp.aNaturalNumber0 @t1)) % 0.47/0.66 (define @t3 () (@list @t1)) % 0.47/0.66 (define @t4 () (@var "W1" $$unsorted)) % 0.47/0.66 (define @t5 () (tptp.sdtpldt0 @t1 @t4)) % 0.47/0.66 (define @t6 () (tptp.aNaturalNumber0 @t4)) % 0.47/0.66 (define @t7 () (and @t2 @t6)) % 0.47/0.66 (define @t8 () (@list @t1 @t4)) % 0.47/0.66 (define @t9 () (tptp.sdtasdt0 @t1 @t4)) % 0.47/0.66 (define @t10 () (tptp.aNaturalNumber0 @t9)) % 0.47/0.66 (define @t11 () (forall @t8 (=> @t7 @t10))) % 0.47/0.66 (define @t12 () (tptp.sdtpldt0 @t4 @t1)) % 0.47/0.66 (define @t13 () (@var "W2" $$unsorted)) % 0.47/0.66 (define @t14 () (tptp.sdtpldt0 @t4 @t13)) % 0.47/0.66 (define @t15 () (tptp.sdtpldt0 @t5 @t13)) % 0.47/0.66 (define @t16 () (tptp.aNaturalNumber0 @t13)) % 0.47/0.66 (define @t17 () (and @t2 @t6 @t16)) % 0.47/0.66 (define @t18 () (@list @t1 @t4 @t13)) % 0.47/0.66 (define @t19 () (tptp.sdtasdt0 @t4 @t1)) % 0.47/0.66 (define @t20 () (tptp.sdtasdt0 @t13 @t1)) % 0.47/0.66 (define @t21 () (tptp.sdtasdt0 @t1 @t13)) % 0.47/0.66 (define @t22 () (= @t4 @t13)) % 0.47/0.66 (define @t23 () (tptp.sdtpldt0 @t13 @t1)) % 0.47/0.66 (define @t24 () (tptp.sdtpldt0 @t1 @t13)) % 0.47/0.66 (define @t25 () (= @t19 @t20)) % 0.47/0.66 (define @t26 () (= @t9 @t21)) % 0.47/0.66 (define @t27 () (and @t6 @t16)) % 0.47/0.66 (define @t28 () (= @t1 tptp.sz00)) % 0.47/0.66 (define @t29 () (not @t28)) % 0.47/0.66 (define @t30 () (= @t4 tptp.sz00)) % 0.47/0.66 (define @t31 () (and @t16 (= @t24 @t4))) % 0.47/0.66 (define @t32 () (@list @t13)) % 0.47/0.66 (define @t33 () (tptp.sdtlseqdt0 @t1 @t4)) % 0.47/0.66 (define @t34 () (= @t1 @t4)) % 0.47/0.66 (define @t35 () (tptp.sdtlseqdt0 @t4 @t1)) % 0.47/0.66 (define @t36 () (tptp.sdtlseqdt0 @t4 @t13)) % 0.47/0.66 (define @t37 () (= @t4 @t1)) % 0.47/0.66 (define @t38 () (tptp.sdtpldt0 @t13 @t4)) % 0.47/0.66 (define @t39 () (and (not @t34) @t33)) % 0.47/0.66 (define @t40 () (= @t1 tptp.sz10)) % 0.47/0.66 (define @t41 () (tptp.iLess0 @t1 @t4)) % 0.47/0.66 (define @t42 () (and @t16 (= @t4 @t21))) % 0.47/0.66 (define @t43 () (tptp.doDivides0 @t1 @t4)) % 0.47/0.66 (define @t44 () (tptp.sdtsldt0 @t4 @t1)) % 0.47/0.66 (define @t45 () (and @t29 @t43)) % 0.47/0.66 (define @t46 () (tptp.doDivides0 @t1 @t13)) % 0.47/0.66 (define @t47 () (tptp.doDivides0 @t1 @t14)) % 0.47/0.66 (define @t48 () (and @t43 @t47)) % 0.47/0.66 (define @t49 () (=> @t48 @t46)) % 0.47/0.66 (define @t50 () (forall @t18 (=> @t17 @t49))) % 0.47/0.66 (define @t51 () (tptp.doDivides0 @t4 @t1)) % 0.47/0.66 (define @t52 () (@list @t4)) % 0.47/0.66 (define @t53 () (not @t40)) % 0.47/0.66 (define @t54 () (tptp.aNaturalNumber0 tptp.xp)) % 0.47/0.66 (define @t55 () (tptp.aNaturalNumber0 tptp.xm)) % 0.47/0.66 (define @t56 () (@var "W3" $$unsorted)) % 0.47/0.66 (define @t57 () (tptp.sdtasdt0 @t13 @t56)) % 0.47/0.66 (define @t58 () (tptp.aNaturalNumber0 @t56)) % 0.47/0.66 (define @t59 () (@list @t56)) % 0.47/0.66 (define @t60 () (@var "W4" $$unsorted)) % 0.47/0.66 (define @t61 () (tptp.sdtasdt0 tptp.xn tptp.xm)) % 0.47/0.66 (define @t62 () (tptp.sdtasdt0 tptp.xp @t1)) % 0.47/0.66 (define @t63 () (exists @t3 (and @t2 (= @t61 @t62)))) % 0.47/0.66 (define @t64 () (tptp.sdtpldt0 tptp.xp tptp.xr)) % 0.47/0.66 (define @t65 () (tptp.aNaturalNumber0 tptp.xr)) % 0.47/0.66 (define @t66 () (tptp.sdtasdt0 tptp.xr tptp.xm)) % 0.47/0.66 (define @t67 () (tptp.sdtasdt0 tptp.xp tptp.xm)) % 0.47/0.66 (define @t68 () (tptp.sdtpldt0 @t67 @t66)) % 0.47/0.66 (define @t69 () (tptp.doDivides0 tptp.xp @t67)) % 0.47/0.66 (define @t70 () (tptp.doDivides0 tptp.xp @t66)) % 0.47/0.66 (define @t71 () (and @t2 (= @t66 @t62))) % 0.47/0.66 (define @t72 () (exists @t3 @t71)) % 0.47/0.66 (define @t73 () (or @t72 @t70)) % 0.47/0.66 (define @t74 () (not @t73)) % 0.47/0.66 (define @t75 () (= @t62 @t66)) % 0.47/0.66 (define @t76 () (and @t2 @t75)) % 0.47/0.66 (define @t77 () (forall @t3 (not @t76))) % 0.47/0.66 (define @t78 () (not @t77)) % 0.47/0.66 (define @t79 () (tptp.doDivides0 tptp.xp @t68)) % 0.47/0.66 (define @t80 () (not @t47)) % 0.47/0.66 (define @t81 () (not @t43)) % 0.47/0.66 (define @t82 () (not @t16)) % 0.47/0.66 (define @t83 () (not @t6)) % 0.47/0.66 (define @t84 () (not @t2)) % 0.47/0.66 (define @t85 () (or @t81 @t80 @t46)) % 0.47/0.66 (define @t86 () (or @t84 @t83 @t82)) % 0.47/0.66 (define @t87 () (tptp.aNaturalNumber0 @t67)) % 0.47/0.66 (define @t88 () (not @t55)) % 0.47/0.66 (define @t89 () (not @t54)) % 0.47/0.66 (define @t90 () (or @t89 @t88 @t87)) % 0.47/0.66 (define @t91 () (@list false false false)) % 0.47/0.66 (define @t92 () (tptp.aNaturalNumber0 @t66)) % 0.47/0.66 (define @t93 () (not @t65)) % 0.47/0.66 (define @t94 () (or @t93 @t88 @t92)) % 0.47/0.66 (define @t95 () (not @t79)) % 0.47/0.66 (define @t96 () (not @t69)) % 0.47/0.66 (define @t97 () (not @t92)) % 0.47/0.66 (define @t98 () (not @t87)) % 0.47/0.66 (define @t99 () (or @t89 @t98 @t97 @t96 @t95 @t70)) % 0.47/0.66 (assume @p1 (forall @t3 (=> @t2 true))) % 0.47/0.66 (assume @p2 (tptp.aNaturalNumber0 tptp.sz00)) % 0.47/0.66 (assume @p3 (and (tptp.aNaturalNumber0 tptp.sz10) (not (= tptp.sz10 tptp.sz00)))) % 0.47/0.66 (assume @p4 (forall @t8 (=> @t7 (tptp.aNaturalNumber0 @t5)))) % 0.47/0.66 (assume @p5 @t11) % 0.47/0.66 (assume @p6 (forall @t8 (=> @t7 (= @t5 @t12)))) % 0.47/0.66 (assume @p7 (forall @t18 (=> @t17 (= @t15 (tptp.sdtpldt0 @t1 @t14))))) % 0.47/0.66 (assume @p8 (forall @t3 (=> @t2 (and (= (tptp.sdtpldt0 @t1 tptp.sz00) @t1) (= @t1 (tptp.sdtpldt0 tptp.sz00 @t1)))))) % 0.47/0.66 (assume @p9 (forall @t8 (=> @t7 (= @t9 @t19)))) % 0.47/0.66 (assume @p10 (forall @t18 (=> @t17 (= (tptp.sdtasdt0 @t9 @t13) (tptp.sdtasdt0 @t1 (tptp.sdtasdt0 @t4 @t13)))))) % 0.47/0.66 (assume @p11 (forall @t3 (=> @t2 (and (= (tptp.sdtasdt0 @t1 tptp.sz10) @t1) (= @t1 (tptp.sdtasdt0 tptp.sz10 @t1)))))) % 0.47/0.66 (assume @p12 (forall @t3 (=> @t2 (and (= (tptp.sdtasdt0 @t1 tptp.sz00) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 tptp.sz00 @t1)))))) % 0.47/0.66 (assume @p13 (forall @t18 (=> @t17 (and (= (tptp.sdtasdt0 @t1 @t14) (tptp.sdtpldt0 @t9 @t21)) (= (tptp.sdtasdt0 @t14 @t1) (tptp.sdtpldt0 @t19 @t20)))))) % 0.47/0.66 (assume @p14 (forall @t18 (=> @t17 (=> (or (= @t5 @t24) (= @t12 @t23)) @t22)))) % 0.47/0.66 (assume @p15 (forall @t3 (=> @t2 (=> @t29 (forall (@list @t4 @t13) (=> @t27 (=> (or @t26 @t25) @t22))))))) % 0.47/0.66 (assume @p16 (forall @t8 (=> @t7 (=> (= @t5 tptp.sz00) (and @t28 @t30))))) % 0.47/0.66 (assume @p17 (forall @t8 (=> @t7 (=> (= @t9 tptp.sz00) (or @t28 @t30))))) % 0.47/0.66 (assume @p18 (forall @t8 (=> @t7 (= @t33 (exists @t32 @t31))))) % 0.47/0.66 (assume @p19 (forall @t8 (=> @t7 (=> @t33 (forall @t32 (= (= @t13 (tptp.sdtmndt0 @t4 @t1)) @t31)))))) % 0.47/0.66 (assume @p20 (forall @t3 (=> @t2 (tptp.sdtlseqdt0 @t1 @t1)))) % 0.47/0.66 (assume @p21 (forall @t8 (=> @t7 (=> (and @t33 @t35) @t34)))) % 0.47/0.66 (assume @p22 (forall @t18 (=> @t17 (=> (and @t33 @t36) (tptp.sdtlseqdt0 @t1 @t13))))) % 0.47/0.66 (assume @p23 (forall @t8 (=> @t7 (or @t33 (and (not @t37) @t35))))) % 0.47/0.66 (assume @p24 (forall @t8 (=> @t7 (=> @t39 (forall @t32 (=> @t16 (and (not (= @t23 @t38)) (tptp.sdtlseqdt0 @t23 @t38) (not (= @t24 @t14)) (tptp.sdtlseqdt0 @t24 @t14)))))))) % 0.47/0.66 (assume @p25 (forall @t18 (=> @t17 (=> (and @t29 (not @t22) @t36) (and (not @t26) (tptp.sdtlseqdt0 @t9 @t21) (not @t25) (tptp.sdtlseqdt0 @t19 @t20)))))) % 0.47/0.66 (assume @p26 (forall @t3 (=> @t2 (or @t28 @t40 (and (not (= tptp.sz10 @t1)) (tptp.sdtlseqdt0 tptp.sz10 @t1)))))) % 0.47/0.66 (assume @p27 (forall @t8 (=> @t7 (=> @t29 (tptp.sdtlseqdt0 @t4 @t19))))) % 0.47/0.66 (assume @p28 (forall @t8 (=> @t7 (=> @t41 true)))) % 0.47/0.66 (assume @p29 (forall @t8 (=> @t7 (=> @t39 @t41)))) % 0.47/0.66 (assume @p30 (forall @t8 (=> @t7 (= @t43 (exists @t32 @t42))))) % 0.47/0.66 (assume @p31 (forall @t8 (=> @t7 (=> @t45 (forall @t32 (= (= @t13 @t44) @t42)))))) % 0.47/0.66 (assume @p32 (forall @t18 (=> @t17 (=> (and @t43 (tptp.doDivides0 @t4 @t13)) @t46)))) % 0.47/0.66 (assume @p33 (forall @t18 (=> @t17 (=> (and @t43 @t46) @t47)))) % 0.47/0.66 (assume @p34 @t50) % 0.47/0.66 (assume @p35 (forall @t8 (=> @t7 (=> (and @t43 (not @t30)) @t33)))) % 0.47/0.66 (assume @p36 (forall @t8 (=> @t7 (=> @t45 (forall @t32 (=> @t16 (= (tptp.sdtasdt0 @t13 @t44) (tptp.sdtsldt0 (tptp.sdtasdt0 @t13 @t4) @t1)))))))) % 0.47/0.66 (assume @p37 (forall @t3 (=> @t2 (= (tptp.isPrime0 @t1) (and @t29 @t53 (forall @t52 (=> (and @t6 @t51) (or (= @t4 tptp.sz10) @t37)))))))) % 0.47/0.66 (assume @p38 (forall @t3 (=> (and @t2 @t29 @t53) (exists @t52 (and @t6 @t51 (tptp.isPrime0 @t4)))))) % 0.47/0.66 (assume @p39 (and (tptp.aNaturalNumber0 tptp.xn) @t55 @t54)) % 0.47/0.66 (assume @p40 (forall @t18 (=> @t17 (=> (and (or (and (not (= @t13 tptp.sz00)) (not (= @t13 tptp.sz10)) (forall @t59 (=> (and @t58 (exists (@list @t60) (and (tptp.aNaturalNumber0 @t60) (= @t13 (tptp.sdtasdt0 @t56 @t60)))) (tptp.doDivides0 @t56 @t13)) (or (= @t56 tptp.sz10) (= @t56 @t13))))) (tptp.isPrime0 @t13)) (or (exists @t59 (and @t58 (= @t9 @t57))) (tptp.doDivides0 @t13 @t9))) (=> (tptp.iLess0 @t15 (tptp.sdtpldt0 (tptp.sdtpldt0 tptp.xn tptp.xm) tptp.xp)) (or (and (exists @t59 (and @t58 (= @t1 @t57))) (tptp.doDivides0 @t13 @t1)) (and (exists @t59 (and @t58 (= @t4 @t57))) (tptp.doDivides0 @t13 @t4)))))))) % 0.47/0.66 (assume @p41 (and (not (= tptp.xp tptp.sz00)) (not (= tptp.xp tptp.sz10)) (forall @t3 (=> (and @t2 (or (exists @t52 (and @t6 (= tptp.xp @t9))) (tptp.doDivides0 @t1 tptp.xp))) (or @t40 (= @t1 tptp.xp)))) (tptp.isPrime0 tptp.xp) @t63 (tptp.doDivides0 tptp.xp @t61))) % 0.47/0.66 (assume @p42 (and (exists @t3 (and @t2 (= (tptp.sdtpldt0 tptp.xp @t1) tptp.xn))) (tptp.sdtlseqdt0 tptp.xp tptp.xn))) % 0.47/0.66 (assume @p43 (and @t65 (= @t64 tptp.xn) (= tptp.xr (tptp.sdtmndt0 tptp.xn tptp.xp)))) % 0.47/0.66 (assume @p44 (and (not (= tptp.xr tptp.xn)) (exists @t3 (and @t2 (= (tptp.sdtpldt0 tptp.xr @t1) tptp.xn))) (tptp.sdtlseqdt0 tptp.xr tptp.xn))) % 0.47/0.66 (assume @p45 (= tptp.xn @t64)) % 0.47/0.66 (assume @p46 (= @t61 @t68)) % 0.47/0.66 (assume @p47 (and (= @t68 @t61) (= @t66 (tptp.sdtmndt0 @t61 @t67)))) % 0.47/0.66 (assume @p48 (and @t63 (exists @t3 (and @t2 (= @t67 @t62))) @t69)) % 0.47/0.66 (assume @p49 @t74) % 0.47/0.66 (assume @p50 true) % 0.47/0.66 (step @p51 :rule and_elim :premises (@p39) :args (2)) % 0.47/0.66 (step @p52 :rule and_elim :premises (@p48) :args (2)) % 0.47/0.66 (step @p53 :rule refl :args (@t70)) % 0.47/0.66 (step @p54 :rule bool-and-de-morgan :args (@t2 @t75 true)) % 0.47/0.66 (step @p55 :rule cong :premises (@p54) :args (@t77)) % 0.47/0.66 (step @p56 :rule cong :premises (@p55) :args (@t78)) % 0.47/0.66 (step @p57 :rule exists-elim :args ((= (exists @t3 @t76) @t78))) % 0.47/0.66 (step @p58 :rule trans :premises (@p57 @p56)) % 0.47/0.66 (step @p59 :rule eq-symm :args (@t66 @t62)) % 0.47/0.66 (step @p60 :rule refl :args (@t2)) % 0.47/0.66 (step @p61 :rule nary_cong :premises (@p60 @p59) :args (@t71)) % 0.47/0.66 (step @p62 :rule cong :premises (@p61) :args (@t72)) % 0.47/0.66 (step @p63 :rule trans :premises (@p62 @p58)) % 0.47/0.66 (step @p64 :rule nary_cong :premises (@p63 @p53) :args (@t73)) % 0.47/0.66 (step @p65 :rule cong :premises (@p64) :args (@t74)) % 0.47/0.66 (step @p66 :rule eq_resolve :premises (@p49 @p65)) % 0.47/0.66 (step @p67 :rule not_or_elim :premises (@p66) :args (1)) % 0.47/0.66 (step @p68 :rule and_elim :premises (@p41) :args (5)) % 0.47/0.66 (step @p69 :rule true_intro :premises (@p68)) % 0.47/0.66 (step @p70 :rule symm :premises (@p46)) % 0.47/0.66 (step @p71 :rule refl :args (tptp.xp)) % 0.47/0.66 (step @p72 :rule cong :premises (@p71 @p70) :args (@t79)) % 0.47/0.66 (step @p73 :rule trans :premises (@p72 @p69)) % 0.47/0.66 (step @p74 :rule true_elim :premises (@p73)) % 0.47/0.66 (step @p75 :rule aci_norm :args ((= (or @t86 @t85) (or @t84 @t83 @t82 @t81 @t80 @t46)))) % 0.47/0.66 (step @p76 :rule aci_norm :args ((= (or (or @t81 @t80) @t46) @t85))) % 0.47/0.66 (step @p77 :rule refl :args (@t46)) % 0.47/0.66 (step @p78 :rule bool-and-de-morgan :args (@t43 @t47 true)) % 0.47/0.66 (step @p79 :rule nary_cong :premises (@p78 @p77) :args ((or (not @t48) @t46))) % 0.47/0.66 (step @p80 :rule trans :premises (@p79 @p76)) % 0.47/0.66 (step @p81 :rule bool-impl-elim :args (@t48 @t46)) % 0.47/0.66 (step @p82 :rule trans :premises (@p81 @p80)) % 0.47/0.66 (step @p83 :rule aci_norm :args ((= (or @t84 (or @t83 @t82)) @t86))) % 0.47/0.66 (step @p84 :rule bool-and-de-morgan :args (@t6 @t16 true)) % 0.47/0.66 (step @p85 :rule refl :args (@t84)) % 0.47/0.66 (step @p86 :rule nary_cong :premises (@p85 @p84) :args ((or @t84 (not @t27)))) % 0.47/0.66 (step @p87 :rule bool-and-de-morgan :args (@t2 @t6 (and @t16))) % 0.47/0.66 (step @p88 :rule trans :premises (@p87 @p86)) % 0.47/0.66 (step @p89 :rule trans :premises (@p88 @p83)) % 0.47/0.66 (step @p90 :rule nary_cong :premises (@p89 @p82) :args ((or (not @t17) @t49))) % 0.47/0.66 (step @p91 :rule trans :premises (@p90 @p75)) % 0.47/0.66 (step @p92 :rule bool-impl-elim :args (@t17 @t49)) % 0.47/0.66 (step @p93 :rule trans :premises (@p92 @p91)) % 0.47/0.66 (step @p94 :rule cong :premises (@p93) :args (@t50)) % 0.47/0.66 (step @p95 :rule eq_resolve :premises (@p34 @p94)) % 0.47/0.66 (step @p96 :rule instantiate :premises (@p95) :args ((@list tptp.xp @t67 @t66))) % 0.47/0.66 (step @p97 :rule aci_norm :args ((= (or (or @t84 @t83) @t10) (or @t84 @t83 @t10)))) % 0.47/0.66 (step @p98 :rule refl :args (@t10)) % 0.47/0.66 (step @p99 :rule bool-and-de-morgan :args (@t2 @t6 true)) % 0.47/0.66 (step @p100 :rule nary_cong :premises (@p99 @p98) :args ((or (not @t7) @t10))) % 0.47/0.66 (step @p101 :rule trans :premises (@p100 @p97)) % 0.47/0.66 (step @p102 :rule bool-impl-elim :args (@t7 @t10)) % 0.47/0.66 (step @p103 :rule trans :premises (@p102 @p101)) % 0.47/0.66 (step @p104 :rule cong :premises (@p103) :args (@t11)) % 0.47/0.66 (step @p105 :rule eq_resolve :premises (@p5 @p104)) % 0.47/0.66 (step @p106 :rule instantiate :premises (@p105) :args ((@list tptp.xp tptp.xm))) % 0.47/0.66 (step @p107 :rule and_elim :premises (@p39) :args (1)) % 0.47/0.66 (step @p108 :rule cnf_or_pos :args (@t90)) % 0.47/0.66 (step @p109 :rule reordering :premises (@p108) :args ((or @t88 @t89 @t87 (not @t90)))) % 0.47/0.66 (step @p110 :rule chain_m_resolution :premises (@p109 @p107 @p51 @p106) :args (@t87 @t91 (@list @t55 @t54 @t90))) % 0.47/0.66 (step @p111 :rule instantiate :premises (@p105) :args ((@list tptp.xr tptp.xm))) % 0.47/0.66 (step @p112 :rule and_elim :premises (@p43) :args (0)) % 0.47/0.66 (step @p113 :rule cnf_or_pos :args (@t94)) % 0.47/0.66 (step @p114 :rule reordering :premises (@p113) :args ((or @t88 @t93 @t92 (not @t94)))) % 0.47/0.66 (step @p115 :rule chain_m_resolution :premises (@p114 @p107 @p112 @p111) :args (@t92 @t91 (@list @t55 @t65 @t94))) % 0.47/0.66 (step @p116 :rule cnf_or_pos :args (@t99)) % 0.47/0.66 (step @p117 :rule reordering :premises (@p116) :args ((or @t70 @t89 @t96 @t98 @t97 @t95 (not @t99)))) % 0.47/0.66 (step @p118 false :rule chain_m_resolution :premises (@p117 @p115 @p110 @p96 @p74 @p67 @p52 @p51) :args (false (@list false false false false true false false) (@list @t92 @t87 @t99 @t79 @t70 @t69 @t54))) % 0.47/0.66 ) % 0.47/0.66 % SZS output end Proof % 0.47/0.66 % cvc5 exiting %------------------------------------------------------------------------------