%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL529+1 : TPTP v9.3.1. Bugfixed v9.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n018.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 11:23:02 AM UTC 2026 % Result : Theorem 0.62s 0.91s % Output : Proof 0.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL529+1 : TPTP v9.3.1. Bugfixed v9.2.0. % 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.10/0.36 % Computer : n018.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Sat Sep 5 15:35:04 UTC 2026 % 0.03/0.36 % CPUTime : % 0.03/0.44 %----Proving TF0_NAR, FOF, or CNF % 0.62/0.91 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.62/0.91 % SZS status Theorem % 0.62/0.91 % SZS output start Proof % 0.62/0.91 ( % 0.62/0.91 (declare-sort $$unsorted 0) % 0.62/0.91 (declare-const tptp.op_strict_implies Bool) % 0.62/0.91 (declare-const tptp.op_possibly Bool) % 0.62/0.91 (declare-const tptp.axiom_m10 Bool) % 0.62/0.91 (declare-const tptp.axiom_m9 Bool) % 0.62/0.91 (declare-const tptp.axiom_m7 Bool) % 0.62/0.91 (declare-const tptp.axiom_m6 Bool) % 0.62/0.91 (declare-const tptp.r2 Bool) % 0.62/0.91 (declare-const tptp.r1 Bool) % 0.62/0.91 (declare-const tptp.is_a_theorem (-> $$unsorted Bool)) % 0.62/0.91 (declare-const tptp.op_necessarily Bool) % 0.62/0.91 (declare-const tptp.kn3 Bool) % 0.62/0.91 (declare-const tptp.strict_equiv (-> $$unsorted $$unsorted $$unsorted)) % 0.62/0.91 (declare-const tptp.cn2 Bool) % 0.62/0.91 (declare-const tptp.axiom_m3 Bool) % 0.62/0.91 (declare-const tptp.kn2 Bool) % 0.62/0.91 (declare-const tptp.cn1 Bool) % 0.62/0.91 (declare-const tptp.or_2 Bool) % 0.62/0.91 (declare-const tptp.and_3 Bool) % 0.62/0.91 (declare-const tptp.r5 Bool) % 0.62/0.91 (declare-const tptp.necessitation Bool) % 0.62/0.91 (declare-const tptp.equivalence_1 Bool) % 0.62/0.91 (declare-const tptp.implies_1 Bool) % 0.62/0.91 (declare-const tptp.equivalence_2 Bool) % 0.62/0.91 (declare-const tptp.or_3 Bool) % 0.62/0.91 (declare-const tptp.and (-> $$unsorted $$unsorted $$unsorted)) % 0.62/0.91 (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted)) % 0.62/0.91 (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted)) % 0.62/0.91 (declare-const tptp.substitution_of_equivalents Bool) % 0.62/0.91 (declare-const tptp.implies_3 Bool) % 0.62/0.91 (declare-const tptp.equiv (-> $$unsorted $$unsorted $$unsorted)) % 0.62/0.91 (declare-const tptp.axiom_m1 Bool) % 0.62/0.91 (declare-const tptp.and_1 Bool) % 0.62/0.91 (declare-const tptp.equivalence_3 Bool) % 0.62/0.91 (declare-const tptp.necessarily (-> $$unsorted $$unsorted)) % 0.62/0.91 (declare-const tptp.or_1 Bool) % 0.62/0.91 (declare-const tptp.op_or Bool) % 0.62/0.91 (declare-const tptp.cn3 Bool) % 0.62/0.91 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 0.62/0.91 (declare-const tptp.op_strict_equiv Bool) % 0.62/0.91 (declare-const tptp.axiom_4 Bool) % 0.62/0.91 (declare-const tptp.modus_tollens Bool) % 0.62/0.91 (declare-const tptp.and_2 Bool) % 0.62/0.91 (declare-const tptp.implies_2 Bool) % 0.62/0.91 (declare-const tptp.axiom_5 Bool) % 0.62/0.91 (declare-const tptp.axiom_s2 Bool) % 0.62/0.91 (declare-const tptp.r4 Bool) % 0.62/0.91 (declare-const tptp.kn1 Bool) % 0.62/0.91 (declare-const tptp.adjunction Bool) % 0.62/0.91 (declare-const tptp.modus_ponens Bool) % 0.62/0.91 (declare-const tptp.op_and Bool) % 0.62/0.91 (declare-const tptp.axiom_M Bool) % 0.62/0.91 (declare-const tptp.possibly (-> $$unsorted $$unsorted)) % 0.62/0.91 (declare-const tptp.op_equiv Bool) % 0.62/0.91 (declare-const tptp.strict_implies (-> $$unsorted $$unsorted $$unsorted)) % 0.62/0.91 (declare-const tptp.axiom_m8 Bool) % 0.62/0.91 (declare-const tptp.modus_ponens_strict_implies Bool) % 0.62/0.91 (declare-const tptp.substitution_strict_equiv Bool) % 0.62/0.91 (declare-const tptp.axiom_K Bool) % 0.62/0.91 (declare-const tptp.op_implies Bool) % 0.62/0.91 (declare-const tptp.axiom_B Bool) % 0.62/0.91 (declare-const tptp.axiom_s1 Bool) % 0.62/0.91 (declare-const tptp.r3 Bool) % 0.62/0.91 (declare-const tptp.axiom_s3 Bool) % 0.62/0.91 (declare-const tptp.axiom_s4 Bool) % 0.62/0.91 (declare-const tptp.axiom_m2 Bool) % 0.62/0.91 (declare-const tptp.op_implies_and Bool) % 0.62/0.91 (declare-const tptp.axiom_m4 Bool) % 0.62/0.91 (declare-const tptp.op_implies_or Bool) % 0.62/0.91 (declare-const tptp.axiom_m5 Bool) % 0.62/0.91 (define @t1 () (@var "Y" $$unsorted)) % 0.62/0.91 (define @t2 () (tptp.is_a_theorem @t1)) % 0.62/0.91 (define @t3 () (@var "X" $$unsorted)) % 0.62/0.91 (define @t4 () (tptp.implies @t3 @t1)) % 0.62/0.91 (define @t5 () (tptp.is_a_theorem @t3)) % 0.62/0.91 (define @t6 () (@list @t3 @t1)) % 0.62/0.91 (define @t7 () (= @t3 @t1)) % 0.62/0.91 (define @t8 () (tptp.equiv @t3 @t1)) % 0.62/0.91 (define @t9 () (tptp.not @t3)) % 0.62/0.91 (define @t10 () (tptp.not @t1)) % 0.62/0.91 (define @t11 () (tptp.implies @t1 @t3)) % 0.62/0.91 (define @t12 () (@var "Z" $$unsorted)) % 0.62/0.91 (define @t13 () (tptp.implies @t3 @t12)) % 0.62/0.91 (define @t14 () (tptp.implies @t1 @t12)) % 0.62/0.91 (define @t15 () (@list @t3 @t1 @t12)) % 0.62/0.91 (define @t16 () (tptp.and @t3 @t1)) % 0.62/0.91 (define @t17 () (forall @t6 (tptp.is_a_theorem (tptp.implies @t16 @t3)))) % 0.62/0.91 (define @t18 () (tptp.or @t3 @t1)) % 0.62/0.91 (define @t19 () (@var "P" $$unsorted)) % 0.62/0.91 (define @t20 () (@list @t19)) % 0.62/0.91 (define @t21 () (@var "Q" $$unsorted)) % 0.62/0.91 (define @t22 () (tptp.and @t19 @t21)) % 0.62/0.91 (define @t23 () (@list @t19 @t21)) % 0.62/0.91 (define @t24 () (@var "R" $$unsorted)) % 0.62/0.91 (define @t25 () (tptp.implies @t19 @t21)) % 0.62/0.91 (define @t26 () (@list @t19 @t21 @t24)) % 0.62/0.91 (define @t27 () (tptp.implies @t21 @t24)) % 0.62/0.91 (define @t28 () (tptp.not @t19)) % 0.62/0.91 (define @t29 () (tptp.or @t19 @t21)) % 0.62/0.91 (define @t30 () (tptp.or @t19 @t24)) % 0.62/0.91 (define @t31 () (tptp.necessarily @t3)) % 0.62/0.91 (define @t32 () (tptp.is_a_theorem @t31)) % 0.62/0.91 (define @t33 () (@list @t3)) % 0.62/0.91 (define @t34 () (forall @t33 (=> @t5 @t32))) % 0.62/0.91 (define @t35 () (= tptp.necessitation @t34)) % 0.62/0.91 (define @t36 () (tptp.strict_implies @t3 @t1)) % 0.62/0.91 (define @t37 () (tptp.strict_equiv @t3 @t1)) % 0.62/0.91 (define @t38 () (tptp.necessarily @t4)) % 0.62/0.91 (define @t39 () (tptp.necessarily @t31)) % 0.62/0.91 (define @t40 () (tptp.possibly @t3)) % 0.62/0.91 (define @t41 () (tptp.necessarily @t40)) % 0.62/0.91 (define @t42 () (tptp.possibly @t21)) % 0.62/0.91 (define @t43 () (tptp.possibly @t19)) % 0.62/0.91 (define @t44 () (tptp.possibly @t22)) % 0.62/0.91 (define @t45 () (forall @t6 (tptp.is_a_theorem (tptp.strict_implies @t16 @t3)))) % 0.62/0.91 (define @t46 () (forall @t6 (= @t36 @t38))) % 0.62/0.91 (define @t47 () (forall @t33 (or (not @t5) @t32))) % 0.62/0.91 (define @t48 () (@list false)) % 0.62/0.91 (define @t49 () (@quantifiers_skolemize @t45 0)) % 0.62/0.91 (define @t50 () (@quantifiers_skolemize @t45 1)) % 0.62/0.91 (define @t51 () (tptp.and @t49 @t50)) % 0.62/0.91 (define @t52 () (tptp.implies @t51 @t49)) % 0.62/0.91 (define @t53 () (tptp.is_a_theorem (tptp.necessarily @t52))) % 0.62/0.91 (define @t54 () (tptp.is_a_theorem @t52)) % 0.62/0.91 (define @t55 () (not @t54)) % 0.62/0.91 (define @t56 () (or @t55 @t53)) % 0.62/0.91 (assume @p1 (= tptp.modus_ponens (forall @t6 (=> (and @t5 (tptp.is_a_theorem @t4)) @t2)))) % 0.62/0.91 (assume @p2 (= tptp.substitution_of_equivalents (forall @t6 (=> (tptp.is_a_theorem @t8) @t7)))) % 0.62/0.91 (assume @p3 (= tptp.modus_tollens (forall @t6 (tptp.is_a_theorem (tptp.implies (tptp.implies @t10 @t9) @t4))))) % 0.62/0.91 (assume @p4 (= tptp.implies_1 (forall @t6 (tptp.is_a_theorem (tptp.implies @t3 @t11))))) % 0.62/0.91 (assume @p5 (= tptp.implies_2 (forall @t6 (tptp.is_a_theorem (tptp.implies (tptp.implies @t3 @t4) @t4))))) % 0.62/0.91 (assume @p6 (= tptp.implies_3 (forall @t15 (tptp.is_a_theorem (tptp.implies @t4 (tptp.implies @t14 @t13)))))) % 0.62/0.91 (assume @p7 (= tptp.and_1 @t17)) % 0.62/0.91 (assume @p8 (= tptp.and_2 (forall @t6 (tptp.is_a_theorem (tptp.implies @t16 @t1))))) % 0.62/0.91 (assume @p9 (= tptp.and_3 (forall @t6 (tptp.is_a_theorem (tptp.implies @t3 (tptp.implies @t1 @t16)))))) % 0.62/0.91 (assume @p10 (= tptp.or_1 (forall @t6 (tptp.is_a_theorem (tptp.implies @t3 @t18))))) % 0.62/0.91 (assume @p11 (= tptp.or_2 (forall @t6 (tptp.is_a_theorem (tptp.implies @t1 @t18))))) % 0.62/0.91 (assume @p12 (= tptp.or_3 (forall @t15 (tptp.is_a_theorem (tptp.implies @t13 (tptp.implies @t14 (tptp.implies @t18 @t12))))))) % 0.62/0.91 (assume @p13 (= tptp.equivalence_1 (forall @t6 (tptp.is_a_theorem (tptp.implies @t8 @t4))))) % 0.62/0.91 (assume @p14 (= tptp.equivalence_2 (forall @t6 (tptp.is_a_theorem (tptp.implies @t8 @t11))))) % 0.62/0.91 (assume @p15 (= tptp.equivalence_3 (forall @t6 (tptp.is_a_theorem (tptp.implies @t4 (tptp.implies @t11 @t8)))))) % 0.62/0.91 (assume @p16 (= tptp.kn1 (forall @t20 (tptp.is_a_theorem (tptp.implies @t19 (tptp.and @t19 @t19)))))) % 0.62/0.91 (assume @p17 (= tptp.kn2 (forall @t23 (tptp.is_a_theorem (tptp.implies @t22 @t19))))) % 0.62/0.91 (assume @p18 (= tptp.kn3 (forall @t26 (tptp.is_a_theorem (tptp.implies @t25 (tptp.implies (tptp.not (tptp.and @t21 @t24)) (tptp.not (tptp.and @t24 @t19)))))))) % 0.62/0.91 (assume @p19 (= tptp.cn1 (forall @t26 (tptp.is_a_theorem (tptp.implies @t25 (tptp.implies @t27 (tptp.implies @t19 @t24))))))) % 0.62/0.91 (assume @p20 (= tptp.cn2 (forall @t23 (tptp.is_a_theorem (tptp.implies @t19 (tptp.implies @t28 @t21)))))) % 0.62/0.91 (assume @p21 (= tptp.cn3 (forall @t20 (tptp.is_a_theorem (tptp.implies (tptp.implies @t28 @t19) @t19))))) % 0.62/0.91 (assume @p22 (= tptp.r1 (forall @t20 (tptp.is_a_theorem (tptp.implies (tptp.or @t19 @t19) @t19))))) % 0.62/0.91 (assume @p23 (= tptp.r2 (forall @t23 (tptp.is_a_theorem (tptp.implies @t21 @t29))))) % 0.62/0.91 (assume @p24 (= tptp.r3 (forall @t23 (tptp.is_a_theorem (tptp.implies @t29 (tptp.or @t21 @t19)))))) % 0.62/0.91 (assume @p25 (= tptp.r4 (forall @t26 (tptp.is_a_theorem (tptp.implies (tptp.or @t19 (tptp.or @t21 @t24)) (tptp.or @t21 @t30)))))) % 0.62/0.91 (assume @p26 (= tptp.r5 (forall @t26 (tptp.is_a_theorem (tptp.implies @t27 (tptp.implies @t29 @t30)))))) % 0.62/0.91 (assume @p27 (=> tptp.op_or (forall @t6 (= @t18 (tptp.not (tptp.and @t9 @t10)))))) % 0.62/0.91 (assume @p28 (=> tptp.op_and (forall @t6 (= @t16 (tptp.not (tptp.or @t9 @t10)))))) % 0.62/0.91 (assume @p29 (=> tptp.op_implies_and (forall @t6 (= @t4 (tptp.not (tptp.and @t3 @t10)))))) % 0.62/0.91 (assume @p30 (=> tptp.op_implies_or (forall @t6 (= @t4 (tptp.or @t9 @t1))))) % 0.62/0.91 (assume @p31 (=> tptp.op_equiv (forall @t6 (= @t8 (tptp.and @t4 @t11))))) % 0.62/0.91 (assume @p32 tptp.op_or) % 0.62/0.91 (assume @p33 tptp.op_implies_and) % 0.62/0.91 (assume @p34 tptp.op_equiv) % 0.62/0.91 (assume @p35 tptp.modus_ponens) % 0.62/0.91 (assume @p36 tptp.modus_tollens) % 0.62/0.91 (assume @p37 tptp.implies_1) % 0.62/0.91 (assume @p38 tptp.implies_2) % 0.62/0.91 (assume @p39 tptp.implies_3) % 0.62/0.91 (assume @p40 tptp.and_1) % 0.62/0.91 (assume @p41 tptp.and_2) % 0.62/0.91 (assume @p42 tptp.and_3) % 0.62/0.91 (assume @p43 tptp.or_1) % 0.62/0.91 (assume @p44 tptp.or_2) % 0.62/0.91 (assume @p45 tptp.or_3) % 0.62/0.91 (assume @p46 tptp.equivalence_1) % 0.62/0.91 (assume @p47 tptp.equivalence_2) % 0.62/0.91 (assume @p48 tptp.equivalence_3) % 0.62/0.91 (assume @p49 tptp.substitution_of_equivalents) % 0.62/0.91 (assume @p50 @t35) % 0.62/0.91 (assume @p51 (= tptp.modus_ponens_strict_implies (forall @t6 (=> (and @t5 (tptp.is_a_theorem @t36)) @t2)))) % 0.62/0.91 (assume @p52 (= tptp.adjunction (forall @t6 (=> (and @t5 @t2) (tptp.is_a_theorem @t16))))) % 0.62/0.91 (assume @p53 (= tptp.substitution_strict_equiv (forall @t6 (=> (tptp.is_a_theorem @t37) @t7)))) % 0.62/0.91 (assume @p54 (= tptp.axiom_K (forall @t6 (tptp.is_a_theorem (tptp.implies @t38 (tptp.implies @t31 (tptp.necessarily @t1))))))) % 0.62/0.91 (assume @p55 (= tptp.axiom_M (forall @t33 (tptp.is_a_theorem (tptp.implies @t31 @t3))))) % 0.62/0.91 (assume @p56 (= tptp.axiom_4 (forall @t33 (tptp.is_a_theorem (tptp.implies @t31 @t39))))) % 0.62/0.91 (assume @p57 (= tptp.axiom_B (forall @t33 (tptp.is_a_theorem (tptp.implies @t3 @t41))))) % 0.62/0.91 (assume @p58 (= tptp.axiom_5 (forall @t33 (tptp.is_a_theorem (tptp.implies @t40 @t41))))) % 0.62/0.91 (assume @p59 (= tptp.axiom_s1 (forall @t15 (tptp.is_a_theorem (tptp.implies (tptp.and @t38 (tptp.necessarily @t14)) (tptp.necessarily @t13)))))) % 0.62/0.91 (assume @p60 (= tptp.axiom_s2 (forall @t23 (tptp.is_a_theorem (tptp.strict_implies @t44 (tptp.and @t43 @t42)))))) % 0.62/0.91 (assume @p61 (= tptp.axiom_s3 (forall @t6 (tptp.is_a_theorem (tptp.strict_implies @t36 (tptp.strict_implies (tptp.not (tptp.possibly @t1)) (tptp.not @t40))))))) % 0.62/0.91 (assume @p62 (= tptp.axiom_s4 (forall @t33 (tptp.is_a_theorem (tptp.strict_implies @t31 @t39))))) % 0.62/0.91 (assume @p63 (= tptp.axiom_m1 (forall @t6 (tptp.is_a_theorem (tptp.strict_implies @t16 (tptp.and @t1 @t3)))))) % 0.62/0.91 (assume @p64 (= tptp.axiom_m2 @t45)) % 0.62/0.91 (assume @p65 (= tptp.axiom_m3 (forall @t15 (tptp.is_a_theorem (tptp.strict_implies (tptp.and @t16 @t12) (tptp.and @t3 (tptp.and @t1 @t12))))))) % 0.62/0.91 (assume @p66 (= tptp.axiom_m4 (forall @t33 (tptp.is_a_theorem (tptp.strict_implies @t3 (tptp.and @t3 @t3)))))) % 0.62/0.91 (assume @p67 (= tptp.axiom_m5 (forall @t15 (tptp.is_a_theorem (tptp.strict_implies (tptp.and @t36 (tptp.strict_implies @t1 @t12)) (tptp.strict_implies @t3 @t12)))))) % 0.62/0.91 (assume @p68 (= tptp.axiom_m6 (forall @t33 (tptp.is_a_theorem (tptp.strict_implies @t3 @t40))))) % 0.62/0.91 (assume @p69 (= tptp.axiom_m7 (forall @t23 (tptp.is_a_theorem (tptp.strict_implies @t44 @t19))))) % 0.62/0.91 (assume @p70 (= tptp.axiom_m8 (forall @t23 (tptp.is_a_theorem (tptp.strict_implies (tptp.strict_implies @t19 @t21) (tptp.strict_implies @t43 @t42)))))) % 0.62/0.91 (assume @p71 (= tptp.axiom_m9 (forall @t33 (tptp.is_a_theorem (tptp.strict_implies (tptp.possibly @t40) @t40))))) % 0.62/0.91 (assume @p72 (= tptp.axiom_m10 (forall @t33 (tptp.is_a_theorem (tptp.strict_implies @t40 @t41))))) % 0.62/0.91 (assume @p73 (=> tptp.op_possibly (forall @t33 (= @t40 (tptp.not (tptp.necessarily @t9)))))) % 0.62/0.91 (assume @p74 (=> tptp.op_necessarily (forall @t33 (= @t31 (tptp.not (tptp.possibly @t9)))))) % 0.62/0.91 (assume @p75 (=> tptp.op_strict_implies @t46)) % 0.62/0.91 (assume @p76 (=> tptp.op_strict_equiv (forall @t6 (= @t37 (tptp.and @t36 (tptp.strict_implies @t1 @t3)))))) % 0.62/0.91 (assume @p77 tptp.op_possibly) % 0.62/0.91 (assume @p78 tptp.necessitation) % 0.62/0.91 (assume @p79 tptp.axiom_K) % 0.62/0.91 (assume @p80 tptp.axiom_M) % 0.62/0.91 (assume @p81 tptp.axiom_5) % 0.62/0.91 (assume @p82 tptp.op_implies) % 0.62/0.91 (assume @p83 tptp.op_strict_implies) % 0.62/0.91 (assume @p84 tptp.op_strict_equiv) % 0.62/0.91 (assume @p85 (not tptp.axiom_m2)) % 0.62/0.91 (assume @p86 true) % 0.62/0.91 (step @p87 :rule evaluate :args ((= false true))) % 0.62/0.91 (step @p88 :rule bool-impl-elim :args (@t5 @t32)) % 0.62/0.91 (step @p89 :rule cong :premises (@p88) :args (@t34)) % 0.62/0.91 (step @p90 :rule refl :args (tptp.necessitation)) % 0.62/0.91 (step @p91 :rule cong :premises (@p90 @p89) :args (@t35)) % 0.62/0.91 (step @p92 :rule eq_resolve :premises (@p50 @p91)) % 0.62/0.91 (step @p93 :rule equiv_elim1 :premises (@p92)) % 0.62/0.91 (step @p94 :rule reordering :premises (@p93) :args ((or @t47 (not tptp.necessitation)))) % 0.62/0.91 (step @p95 :rule chain_m_resolution :premises (@p94 @p78) :args (@t47 @t48 (@list tptp.necessitation))) % 0.62/0.92 (step @p96 :rule instantiate :premises (@p95) :args ((@list @t52))) % 0.62/0.92 (step @p97 :rule equiv_elim1 :premises (@p7)) % 0.62/0.92 (step @p98 :rule reordering :premises (@p97) :args ((or @t17 (not tptp.and_1)))) % 0.62/0.92 (step @p99 :rule chain_m_resolution :premises (@p98 @p40) :args (@t17 @t48 (@list tptp.and_1))) % 0.62/0.92 (step @p100 :rule instantiate :premises (@p99) :args ((@list @t49 @t50))) % 0.62/0.92 (step @p101 :rule cnf_or_pos :args (@t56)) % 0.62/0.92 (step @p102 :rule reordering :premises (@p101) :args ((or @t55 @t53 (not @t56)))) % 0.62/0.92 (step @p103 :rule chain_m_resolution :premises (@p102 @p100 @p96) :args (@t53 (@list false false) (@list @t54 @t56))) % 0.62/0.92 (step @p104 :rule true_intro :premises (@p103)) % 0.62/0.92 (step @p105 :rule implies_elim :premises (@p75)) % 0.62/0.92 (step @p106 :rule reordering :premises (@p105) :args ((or @t46 (not tptp.op_strict_implies)))) % 0.62/0.92 (step @p107 :rule chain_m_resolution :premises (@p106 @p83) :args (@t46 @t48 (@list tptp.op_strict_implies))) % 0.62/0.92 (step @p108 :rule instantiate :premises (@p107) :args ((@list @t51 @t49))) % 0.62/0.92 (step @p109 :rule cong :premises (@p108) :args ((tptp.is_a_theorem (tptp.strict_implies @t51 @t49)))) % 0.62/0.92 (step @p110 :rule equiv_elim2 :premises (@p64)) % 0.62/0.92 (step @p111 :rule chain_m_resolution :premises (@p110 @p85) :args ((not @t45) (@list true) (@list tptp.axiom_m2))) % 0.62/0.92 (step @p112 :rule skolemize :premises (@p111)) % 0.62/0.92 (step @p113 :rule false_intro :premises (@p112)) % 0.62/0.92 (step @p114 :rule symm :premises (@p113)) % 0.62/0.92 (step @p115 :rule trans :premises (@p114 @p109 @p104)) % 0.62/0.92 (step @p116 false :rule eq_resolve :premises (@p115 @p87)) % 0.62/0.92 ) % 0.62/0.92 % SZS output end Proof % 0.62/0.92 % cvc5 exiting %------------------------------------------------------------------------------