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