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