%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GEO117+1 : TPTP v9.2.1. Released v2.4.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:16:23 AM UTC 2026 % Result : Theorem 0.45s 0.67s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GEO117+1 : TPTP v9.2.1. Released v2.4.0. % 0.13/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 : Mon Jun 1 23:25:39 EDT 2026 % 0.17/0.34 % CPUTime : % 0.31/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.45/0.67 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.45/0.67 % SZS status Theorem % 0.45/0.67 % SZS output start Proof % 0.45/0.67 ( % 0.45/0.67 (declare-sort $$unsorted 0) % 0.45/0.67 (declare-const tptp.finish_point (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.inner_point (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.part_of (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.sum (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.67 (declare-const tptp.end_point (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.meet (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.open (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.ordered_by (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.start_point (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.incident_c (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.closed (-> $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.between_o (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.underlying_curve (-> $$unsorted $$unsorted)) % 0.45/0.67 (declare-const tptp.between_c (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.45/0.67 (declare-const tptp.incident_o (-> $$unsorted $$unsorted Bool)) % 0.45/0.67 (define @t1 () (@var "C" $$unsorted)) % 0.45/0.67 (define @t2 () (@var "P" $$unsorted)) % 0.45/0.67 (define @t3 () (tptp.incident_c @t2 @t1)) % 0.45/0.67 (define @t4 () (@var "C1" $$unsorted)) % 0.45/0.67 (define @t5 () (tptp.incident_c @t2 @t4)) % 0.45/0.67 (define @t6 () (@list @t2)) % 0.45/0.67 (define @t7 () (tptp.part_of @t4 @t1)) % 0.45/0.67 (define @t8 () (@list @t1 @t4)) % 0.45/0.67 (define @t9 () (@var "C2" $$unsorted)) % 0.45/0.67 (define @t10 () (@var "Q" $$unsorted)) % 0.45/0.67 (define @t11 () (tptp.incident_c @t10 @t4)) % 0.45/0.67 (define @t12 () (tptp.incident_c @t10 @t1)) % 0.45/0.67 (define @t13 () (@list @t10)) % 0.45/0.67 (define @t14 () (= @t1 (tptp.sum @t4 @t9))) % 0.45/0.67 (define @t15 () (tptp.part_of @t9 @t4)) % 0.45/0.67 (define @t16 () (tptp.part_of @t4 @t9)) % 0.45/0.67 (define @t17 () (tptp.part_of @t9 @t1)) % 0.45/0.67 (define @t18 () (@list @t4 @t9)) % 0.45/0.67 (define @t19 () (tptp.end_point @t2 @t1)) % 0.45/0.67 (define @t20 () (@list @t2 @t1)) % 0.45/0.67 (define @t21 () (tptp.inner_point @t2 @t1)) % 0.45/0.67 (define @t22 () (tptp.end_point @t10 @t4)) % 0.45/0.67 (define @t23 () (tptp.end_point @t10 @t1)) % 0.45/0.67 (define @t24 () (exists @t6 @t19)) % 0.45/0.67 (define @t25 () (tptp.closed @t1)) % 0.45/0.67 (define @t26 () (@list @t1)) % 0.45/0.67 (define @t27 () (tptp.open @t1)) % 0.45/0.67 (define @t28 () (@var "C3" $$unsorted)) % 0.45/0.67 (define @t29 () (tptp.meet @t2 @t4 @t9)) % 0.45/0.67 (define @t30 () (@list @t1 @t2)) % 0.45/0.67 (define @t31 () (@var "R" $$unsorted)) % 0.45/0.67 (define @t32 () (= @t2 @t31)) % 0.45/0.67 (define @t33 () (= @t2 @t10)) % 0.45/0.67 (define @t34 () (@list @t1 @t2 @t10 @t31)) % 0.45/0.67 (define @t35 () (not @t33)) % 0.45/0.67 (define @t36 () (@var "Cpp" $$unsorted)) % 0.45/0.67 (define @t37 () (tptp.inner_point @t10 @t36)) % 0.45/0.67 (define @t38 () (tptp.end_point @t31 @t36)) % 0.45/0.67 (define @t39 () (tptp.end_point @t2 @t36)) % 0.45/0.67 (define @t40 () (tptp.part_of @t36 @t1)) % 0.45/0.67 (define @t41 () (and @t40 @t39 @t38 @t37)) % 0.45/0.67 (define @t42 () (@list @t36)) % 0.45/0.67 (define @t43 () (exists @t42 @t41)) % 0.45/0.67 (define @t44 () (not @t32)) % 0.45/0.67 (define @t45 () (and @t44 @t43)) % 0.45/0.67 (define @t46 () (tptp.between_c @t1 @t2 @t10 @t31)) % 0.45/0.67 (define @t47 () (= @t46 @t45)) % 0.45/0.67 (define @t48 () (forall @t34 @t47)) % 0.45/0.67 (define @t49 () (@var "O" $$unsorted)) % 0.45/0.67 (define @t50 () (tptp.ordered_by @t49 @t10 @t2)) % 0.45/0.67 (define @t51 () (tptp.ordered_by @t49 @t2 @t10)) % 0.45/0.67 (define @t52 () (tptp.between_o @t49 @t2 @t10 @t31)) % 0.45/0.67 (define @t53 () (forall (@list @t49 @t2 @t10 @t31) (= @t52 (or (and @t51 (tptp.ordered_by @t49 @t10 @t31)) (and (tptp.ordered_by @t49 @t31 @t10) @t50))))) % 0.45/0.67 (define @t54 () (tptp.incident_o @t10 @t49)) % 0.45/0.67 (define @t55 () (and @t35 @t54)) % 0.45/0.67 (define @t56 () (tptp.incident_o @t2 @t49)) % 0.45/0.67 (define @t57 () (tptp.start_point @t2 @t49)) % 0.45/0.67 (define @t58 () (@list @t2 @t49)) % 0.45/0.67 (define @t59 () (forall @t6 (= @t56 @t3))) % 0.45/0.67 (define @t60 () (@list @t49)) % 0.45/0.67 (define @t61 () (and @t59 @t46)) % 0.45/0.67 (define @t62 () (exists @t26 @t61)) % 0.45/0.67 (define @t63 () (= @t52 @t62)) % 0.45/0.67 (define @t64 () (@list @t2 @t10 @t31 @t49)) % 0.45/0.67 (define @t65 () (forall @t64 @t63)) % 0.45/0.67 (define @t66 () (@var "O2" $$unsorted)) % 0.45/0.67 (define @t67 () (@var "O1" $$unsorted)) % 0.45/0.67 (define @t68 () (forall (@list @t49 @t2) (not (tptp.ordered_by @t49 @t2 @t2)))) % 0.45/0.67 (define @t69 () (not @t68)) % 0.45/0.67 (define @t70 () (not @t37)) % 0.45/0.67 (define @t71 () (not @t38)) % 0.45/0.67 (define @t72 () (not @t39)) % 0.45/0.67 (define @t73 () (not @t40)) % 0.45/0.67 (define @t74 () (or @t73 @t72 @t71 @t70)) % 0.45/0.67 (define @t75 () (forall @t42 (not @t41))) % 0.45/0.67 (define @t76 () (not @t75)) % 0.45/0.67 (define @t77 () (not @t46)) % 0.45/0.67 (define @t78 () (forall @t6 (= @t3 @t56))) % 0.45/0.67 (define @t79 () (@var "BOUND_VARIABLE_7864" $$unsorted)) % 0.45/0.67 (define @t80 () (not @t78)) % 0.45/0.67 (define @t81 () (or @t80 @t77)) % 0.45/0.67 (define @t82 () (forall @t26 @t81)) % 0.45/0.67 (define @t83 () (not @t82)) % 0.45/0.67 (define @t84 () (= @t52 @t83)) % 0.45/0.67 (define @t85 () (and @t78 @t46)) % 0.45/0.67 (define @t86 () (forall @t26 (not @t85))) % 0.45/0.67 (define @t87 () (not @t86)) % 0.45/0.67 (define @t88 () (@quantifiers_skolemize @t68 0)) % 0.45/0.67 (define @t89 () (@quantifiers_skolemize @t68 1)) % 0.45/0.67 (define @t90 () (tptp.between_o @t88 @t89 @t89 @t89)) % 0.45/0.67 (define @t91 () (tptp.ordered_by @t88 @t89 @t89)) % 0.45/0.67 (define @t92 () (and @t91 @t91)) % 0.45/0.67 (define @t93 () (or @t92 @t92)) % 0.45/0.67 (define @t94 () (= @t90 @t93)) % 0.45/0.67 (define @t95 () (= @t91 @t90)) % 0.45/0.67 (define @t96 () (not @t91)) % 0.45/0.67 (define @t97 () (not @t96)) % 0.45/0.67 (define @t98 () (@list true)) % 0.45/0.67 (define @t99 () (@list false false)) % 0.45/0.67 (define @t100 () (tptp.incident_o @t79 @t88)) % 0.45/0.67 (define @t101 () (@list @t79)) % 0.45/0.67 (define @t102 () (forall @t26 (or (not (forall @t101 (= (tptp.incident_c @t79 @t1) @t100))) (not (tptp.between_c @t1 @t89 @t89 @t89))))) % 0.45/0.67 (define @t103 () (not @t102)) % 0.45/0.67 (define @t104 () (= @t90 @t103)) % 0.45/0.67 (define @t105 () (@quantifiers_skolemize @t102 0)) % 0.45/0.67 (define @t106 () (tptp.between_c @t105 @t89 @t89 @t89)) % 0.45/0.67 (define @t107 () (not @t106)) % 0.45/0.67 (define @t108 () (tptp.incident_c @t79 @t105)) % 0.45/0.67 (define @t109 () (or (not (forall @t101 (= @t100 @t108))) @t107)) % 0.45/0.67 (define @t110 () (not @t109)) % 0.45/0.67 (define @t111 () (forall @t101 (= @t108 @t100))) % 0.45/0.67 (define @t112 () (not @t111)) % 0.45/0.67 (define @t113 () (or @t112 @t107)) % 0.45/0.67 (define @t114 () (not @t113)) % 0.45/0.67 (define @t115 () (not (tptp.inner_point @t89 @t36))) % 0.45/0.67 (define @t116 () (not (tptp.end_point @t89 @t36))) % 0.45/0.67 (define @t117 () (not (tptp.part_of @t36 @t105))) % 0.45/0.67 (define @t118 () (or @t117 @t116 @t115)) % 0.45/0.67 (define @t119 () (or @t117 @t116 @t116 @t115)) % 0.45/0.67 (define @t120 () (forall @t42 @t119)) % 0.45/0.67 (define @t121 () (not @t120)) % 0.45/0.67 (define @t122 () (not (= @t89 @t89))) % 0.45/0.67 (define @t123 () (and @t122 @t121)) % 0.45/0.67 (define @t124 () (= @t106 @t123)) % 0.45/0.67 (define @t125 () (forall @t34 (= @t46 (and @t44 (not (forall @t42 @t74)))))) % 0.45/0.67 (assume @p1 (forall @t8 (= @t7 (forall @t6 (=> @t5 @t3))))) % 0.45/0.67 (assume @p2 (forall (@list @t1 @t4 @t9) (= @t14 (forall @t13 (= @t12 (or @t11 (tptp.incident_c @t10 @t9))))))) % 0.45/0.67 (assume @p3 (forall @t20 (= @t19 (and @t3 (forall @t18 (=> (and @t7 @t17 @t5 (tptp.incident_c @t2 @t9)) (or @t16 @t15))))))) % 0.45/0.67 (assume @p4 (forall @t20 (= @t21 (and @t3 (not @t19))))) % 0.45/0.67 (assume @p5 (forall (@list @t2 @t1 @t4) (= (tptp.meet @t2 @t1 @t4) (and @t3 @t5 (forall @t13 (=> (and @t12 @t11) (and @t23 @t22))))))) % 0.45/0.67 (assume @p6 (forall @t26 (= @t25 (not @t24)))) % 0.45/0.67 (assume @p7 (forall @t26 (= @t27 @t24))) % 0.45/0.67 (assume @p8 (forall @t8 (=> (and @t7 (not (= @t4 @t1))) (tptp.open @t4)))) % 0.45/0.67 (assume @p9 (forall (@list @t1 @t4 @t9 @t28) (=> (and @t7 @t17 (tptp.part_of @t28 @t1) (exists @t6 (and (tptp.end_point @t2 @t4) (tptp.end_point @t2 @t9) (tptp.end_point @t2 @t28)))) (or (tptp.part_of @t9 @t28) (tptp.part_of @t28 @t9) @t16 @t15 (tptp.part_of @t4 @t28) (tptp.part_of @t28 @t4))))) % 0.45/0.67 (assume @p10 (forall @t26 (exists @t6 @t21))) % 0.45/0.67 (assume @p11 (forall @t30 (=> @t21 (exists @t18 (and @t29 @t14))))) % 0.45/0.67 (assume @p12 (forall @t34 (=> (and @t19 @t23 (tptp.end_point @t31 @t1)) (or @t33 @t32 (= @t10 @t31))))) % 0.45/0.67 (assume @p13 (forall @t30 (=> @t19 (exists @t13 (and @t23 @t35))))) % 0.45/0.67 (assume @p14 (forall (@list @t1 @t4 @t9 @t2) (=> (and @t25 @t29 @t14) (forall @t13 (=> @t22 (tptp.meet @t10 @t4 @t9)))))) % 0.45/0.67 (assume @p15 (forall @t18 (=> (exists @t6 @t29) (exists @t26 @t14)))) % 0.45/0.67 (assume @p16 (forall @t8 (=> (forall @t6 (= @t3 @t5)) (= @t1 @t4)))) % 0.45/0.67 (assume @p17 @t48) % 0.45/0.67 (assume @p18 @t53) % 0.45/0.67 (assume @p19 (forall @t58 (= @t57 (and @t56 (forall @t13 (=> @t55 @t51)))))) % 0.45/0.67 (assume @p20 (forall @t58 (= (tptp.finish_point @t2 @t49) (and @t56 (forall @t13 (=> @t55 @t50)))))) % 0.45/0.67 (assume @p21 (forall (@list @t49 @t2 @t10) (=> @t51 (and @t56 @t54)))) % 0.45/0.67 (assume @p22 (forall @t60 (exists @t26 (and @t27 @t59)))) % 0.45/0.67 (assume @p23 @t65) % 0.45/0.67 (assume @p24 (forall @t60 (exists @t6 @t57))) % 0.45/0.67 (assume @p25 (forall (@list @t2 @t10 @t1) (=> (and @t27 @t35 @t3 @t12) (exists @t60 (and (forall (@list @t31) (= (tptp.incident_o @t31 @t49) (tptp.incident_c @t31 @t1))) @t51))))) % 0.45/0.67 (assume @p26 (forall (@list @t67 @t66) (=> (forall (@list @t2 @t10) (= (tptp.ordered_by @t67 @t2 @t10) (tptp.ordered_by @t66 @t2 @t10))) (= @t67 @t66)))) % 0.45/0.67 (assume @p27 (forall (@list @t1 @t49) (= (= @t1 (tptp.underlying_curve @t49)) @t59))) % 0.45/0.67 (assume @p28 @t69) % 0.45/0.67 (assume @p29 true) % 0.45/0.67 (step @p30 :rule aci_norm :args ((= (or @t73 (or @t72 (or @t71 @t70))) @t74))) % 0.45/0.67 (step @p31 :rule bool-and-de-morgan :args (@t38 @t37 true)) % 0.45/0.67 (step @p32 :rule refl :args (@t72)) % 0.45/0.67 (step @p33 :rule nary_cong :premises (@p32 @p31) :args ((or @t72 (not (and @t38 @t37))))) % 0.45/0.67 (step @p34 :rule bool-and-de-morgan :args (@t39 @t38 (and @t37))) % 0.45/0.67 (step @p35 :rule trans :premises (@p34 @p33)) % 0.45/0.67 (step @p36 :rule refl :args (@t73)) % 0.45/0.67 (step @p37 :rule nary_cong :premises (@p36 @p35) :args ((or @t73 (not (and @t39 @t38 @t37))))) % 0.45/0.67 (step @p38 :rule bool-and-de-morgan :args (@t40 @t39 (and @t38 @t37))) % 0.45/0.67 (step @p39 :rule trans :premises (@p38 @p37)) % 0.45/0.67 (step @p40 :rule trans :premises (@p39 @p30)) % 0.45/0.67 (step @p41 :rule cong :premises (@p40) :args (@t75)) % 0.45/0.67 (step @p42 :rule cong :premises (@p41) :args (@t76)) % 0.45/0.67 (step @p43 :rule exists-elim :args ((= @t43 @t76))) % 0.45/0.67 (step @p44 :rule trans :premises (@p43 @p42)) % 0.45/0.67 (step @p45 :rule refl :args (@t44)) % 0.45/0.67 (step @p46 :rule nary_cong :premises (@p45 @p44) :args (@t45)) % 0.45/0.67 (step @p47 :rule refl :args (@t46)) % 0.45/0.67 (step @p48 :rule cong :premises (@p47 @p46) :args (@t47)) % 0.45/0.67 (step @p49 :rule cong :premises (@p48) :args (@t48)) % 0.45/0.67 (step @p50 :rule eq_resolve :premises (@p17 @p49)) % 0.45/0.67 (step @p51 :rule refl :args (@t77)) % 0.45/0.67 (step @p52 :rule alpha_equiv :args (@t78 (@list @t2) (@list @t79))) % 0.45/0.67 (step @p53 :rule cong :premises (@p52) :args (@t80)) % 0.45/0.67 (step @p54 :rule nary_cong :premises (@p53 @p51) :args (@t81)) % 0.45/0.67 (step @p55 :rule cong :premises (@p54) :args (@t82)) % 0.45/0.67 (step @p56 :rule cong :premises (@p55) :args (@t83)) % 0.45/0.67 (step @p57 :rule refl :args (@t52)) % 0.45/0.67 (step @p58 :rule cong :premises (@p57 @p56) :args (@t84)) % 0.45/0.67 (step @p59 :rule cong :premises (@p58) :args ((forall @t64 @t84))) % 0.45/0.67 (step @p60 :rule bool-and-de-morgan :args (@t78 @t46 true)) % 0.45/0.67 (step @p61 :rule cong :premises (@p60) :args (@t86)) % 0.45/0.67 (step @p62 :rule cong :premises (@p61) :args (@t87)) % 0.45/0.67 (step @p63 :rule exists-elim :args ((= (exists @t26 @t85) @t87))) % 0.45/0.67 (step @p64 :rule trans :premises (@p63 @p62)) % 0.45/0.67 (step @p65 :rule eq-symm :args (@t56 @t3)) % 0.45/0.67 (step @p66 :rule cong :premises (@p65) :args (@t59)) % 0.45/0.67 (step @p67 :rule nary_cong :premises (@p66 @p47) :args (@t61)) % 0.45/0.67 (step @p68 :rule cong :premises (@p67) :args (@t62)) % 0.45/0.67 (step @p69 :rule trans :premises (@p68 @p64)) % 0.45/0.67 (step @p70 :rule refl :args (@t52)) % 0.45/0.67 (step @p71 :rule cong :premises (@p70 @p69) :args (@t63)) % 0.45/0.67 (step @p72 :rule cong :premises (@p71) :args (@t65)) % 0.45/0.67 (step @p73 :rule trans :premises (@p72 @p59)) % 0.45/0.67 (step @p74 :rule eq_resolve :premises (@p23 @p73)) % 0.45/0.67 (step @p75 :rule instantiate :premises (@p74) :args ((@list @t89 @t89 @t89 @t88))) % 0.45/0.67 (step @p76 :rule eq-symm :args (@t90 @t91)) % 0.45/0.67 (step @p77 :rule aci_norm :args ((= @t92 @t91))) % 0.45/0.67 (step @p78 :rule aci_norm :args ((= @t93 @t92))) % 0.45/0.67 (step @p79 :rule trans :premises (@p78 @p77)) % 0.45/0.67 (step @p80 :rule refl :args (@t90)) % 0.45/0.67 (step @p81 :rule cong :premises (@p80 @p79) :args (@t94)) % 0.45/0.67 (step @p82 :rule trans :premises (@p81 @p76)) % 0.45/0.67 (step @p83 :rule refl :args (@t53)) % 0.45/0.67 (step @p84 :rule cong :premises (@p83 @p82) :args ((=> @t53 @t94))) % 0.45/0.67 (assume-push @p161 @t53) % 0.45/0.67 (step @p86 :rule instantiate :premises (@p18) :args ((@list @t88 @t89 @t89 @t89))) % 0.45/0.67 (step-pop @p162 :rule scope :premises (@p86)) % 0.45/0.67 (step @p87 :rule process_scope :premises (@p162) :args (@t94)) % 0.45/0.67 (step @p89 :rule eq_resolve :premises (@p87 @p84)) % 0.45/0.67 (step @p90 :rule implies_elim :premises (@p89)) % 0.45/0.67 (step @p91 :rule chain_m_resolution :premises (@p90 @p18) :args (@t95 (@list false) (@list @t53))) % 0.45/0.67 (step @p92 :rule refl :args (@t91)) % 0.45/0.67 (step @p93 :rule bool-double-not-elim :args (@t68)) % 0.45/0.67 (step @p94 :rule nary_cong :premises (@p93 @p92) :args ((or (not @t69) @t91))) % 0.45/0.67 (step @p95 :rule bool-double-not-elim :args (@t91)) % 0.45/0.67 (step @p96 :rule refl :args (@t69)) % 0.45/0.67 (step @p97 :rule cong :premises (@p96 @p95) :args ((=> @t69 @t97))) % 0.45/0.68 (assume-push @p163 @t69) % 0.45/0.68 (step @p99 :rule skolemize :premises (@p28)) % 0.45/0.68 (step-pop @p164 :rule scope :premises (@p99)) % 0.45/0.68 (step @p100 :rule process_scope :premises (@p164) :args (@t97)) % 0.45/0.68 (step @p102 :rule eq_resolve :premises (@p100 @p97)) % 0.45/0.68 (step @p103 :rule implies_elim :premises (@p102)) % 0.45/0.68 (step @p104 :rule eq_resolve :premises (@p103 @p94)) % 0.45/0.68 (step @p105 :rule chain_m_resolution :premises (@p104 @p28) :args (@t91 @t98 (@list @t68))) % 0.45/0.68 (step @p106 :rule cnf_equiv_pos1 :args (@t95)) % 0.45/0.68 (step @p107 :rule reordering :premises (@p106) :args ((or @t96 @t90 (not @t95)))) % 0.45/0.68 (step @p108 :rule chain_m_resolution :premises (@p107 @p105 @p91) :args (@t90 @t99 (@list @t91 @t95))) % 0.45/0.68 (step @p109 :rule cnf_equiv_pos1 :args (@t104)) % 0.45/0.68 (step @p110 :rule reordering :premises (@p109) :args ((or (not @t90) @t103 (not @t104)))) % 0.45/0.68 (step @p111 :rule chain_m_resolution :premises (@p110 @p108 @p75) :args (@t103 @t99 (@list @t90 @t104))) % 0.45/0.68 (step @p112 :rule refl :args (@t110)) % 0.45/0.68 (step @p113 :rule bool-double-not-elim :args (@t102)) % 0.45/0.68 (step @p114 :rule nary_cong :premises (@p113 @p112) :args ((or (not @t103) @t110))) % 0.45/0.68 (step @p115 :rule refl :args (@t107)) % 0.45/0.68 (step @p116 :rule eq-symm :args (@t108 @t100)) % 0.45/0.68 (step @p117 :rule cong :premises (@p116) :args (@t111)) % 0.45/0.68 (step @p118 :rule cong :premises (@p117) :args (@t112)) % 0.45/0.68 (step @p119 :rule nary_cong :premises (@p118 @p115) :args (@t113)) % 0.45/0.68 (step @p120 :rule cong :premises (@p119) :args (@t114)) % 0.45/0.68 (step @p121 :rule refl :args (@t103)) % 0.45/0.68 (step @p122 :rule cong :premises (@p121 @p120) :args ((=> @t103 @t114))) % 0.45/0.68 (assume-push @p165 @t103) % 0.45/0.68 (step @p124 :rule skolemize :premises (@p111)) % 0.45/0.68 (step-pop @p166 :rule scope :premises (@p124)) % 0.45/0.68 (step @p125 :rule process_scope :premises (@p166) :args (@t114)) % 0.45/0.68 (step @p127 :rule eq_resolve :premises (@p125 @p122)) % 0.45/0.68 (step @p128 :rule implies_elim :premises (@p127)) % 0.45/0.68 (step @p129 :rule eq_resolve :premises (@p128 @p114)) % 0.45/0.68 (step @p130 :rule chain_m_resolution :premises (@p129 @p111) :args (@t110 @t98 (@list @t102))) % 0.45/0.68 (step @p131 :rule bool-double-not-elim :args (@t106)) % 0.45/0.68 (step @p132 :rule refl :args (@t109)) % 0.45/0.68 (step @p133 :rule nary_cong :premises (@p132 @p131) :args ((or @t109 (not @t107)))) % 0.45/0.68 (step @p134 :rule cnf_or_neg :args (@t109 1)) % 0.45/0.68 (step @p135 :rule eq_resolve :premises (@p134 @p133)) % 0.45/0.68 (step @p136 :rule reordering :premises (@p135) :args ((or @t106 @t109))) % 0.45/0.68 (step @p137 :rule chain_m_resolution :premises (@p136 @p130) :args (@t106 @t98 (@list @t109))) % 0.45/0.68 (step @p138 :rule bool-eq-false :args (@t106)) % 0.45/0.68 (step @p139 :rule absorb :args ((= (and false (not (forall @t42 @t118))) false))) % 0.45/0.68 (step @p140 :rule aci_norm :args ((= @t119 @t118))) % 0.45/0.68 (step @p141 :rule cong :premises (@p140) :args (@t120)) % 0.45/0.68 (step @p142 :rule cong :premises (@p141) :args (@t121)) % 0.45/0.68 (step @p143 :rule evaluate :args ((not true))) % 0.45/0.68 (step @p144 :rule eq-refl :args (@t89)) % 0.45/0.68 (step @p145 :rule cong :premises (@p144) :args (@t122)) % 0.45/0.68 (step @p146 :rule trans :premises (@p145 @p143)) % 0.45/0.68 (step @p147 :rule nary_cong :premises (@p146 @p142) :args (@t123)) % 0.45/0.68 (step @p148 :rule trans :premises (@p147 @p139)) % 0.45/0.68 (step @p149 :rule refl :args (@t106)) % 0.45/0.68 (step @p150 :rule cong :premises (@p149 @p148) :args (@t124)) % 0.45/0.68 (step @p151 :rule trans :premises (@p150 @p138)) % 0.45/0.68 (step @p152 :rule refl :args (@t125)) % 0.45/0.68 (step @p153 :rule cong :premises (@p152 @p151) :args ((=> @t125 @t124))) % 0.45/0.68 (assume-push @p167 @t125) % 0.45/0.68 (step @p155 :rule instantiate :premises (@p50) :args ((@list @t105 @t89 @t89 @t89))) % 0.45/0.68 (step-pop @p168 :rule scope :premises (@p155)) % 0.45/0.68 (step @p156 :rule process_scope :premises (@p168) :args (@t124)) % 0.45/0.68 (step @p158 :rule eq_resolve :premises (@p156 @p153)) % 0.45/0.68 (step @p159 :rule implies_elim :premises (@p158)) % 0.45/0.68 (step @p160 false :rule chain_m_resolution :premises (@p159 @p137 @p50) :args (false @t99 (@list @t106 @t125))) % 0.45/0.68 ) % 0.45/0.68 % SZS output end Proof % 0.45/0.68 % cvc5 exiting %------------------------------------------------------------------------------