%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL491+1 : TPTP v9.3.1. Bugfixed v9.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n029.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:22:59 AM UTC 2026 % Result : Theorem 0.20s 0.55s % Output : Proof 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL491+1 : TPTP v9.3.1. Bugfixed v9.2.0. % 0.00/0.05 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.11/0.37 % Computer : n029.cluster.edu % 0.11/0.37 % Model : x86_64 x86_64 % 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.37 % Memory : 8046.5625MB % 0.11/0.37 % OS : Linux 6.8.0-71-generic % 0.11/0.37 % CPULimit : 300 % 0.11/0.38 % WCLimit : 300 % 0.11/0.38 % DateTime : Fri Sep 4 14:12:24 UTC 2026 % 0.11/0.38 % CPUTime : % 0.11/0.46 %----Proving TF0_NAR, FOF, or CNF % 0.20/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.20/0.55 % SZS status Theorem % 0.20/0.55 % SZS output start Proof % 0.20/0.55 ( % 0.20/0.55 (declare-sort $$unsorted 0) % 0.20/0.55 (declare-const tptp.op_equiv Bool) % 0.20/0.55 (declare-const tptp.op_implies_or Bool) % 0.20/0.55 (declare-const tptp.op_and Bool) % 0.20/0.55 (declare-const tptp.r4 Bool) % 0.20/0.55 (declare-const tptp.r3 Bool) % 0.20/0.55 (declare-const tptp.implies_2 Bool) % 0.20/0.55 (declare-const tptp.and_2 Bool) % 0.20/0.55 (declare-const tptp.modus_tollens Bool) % 0.20/0.55 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 0.20/0.55 (declare-const tptp.op_or Bool) % 0.20/0.55 (declare-const tptp.or_1 Bool) % 0.20/0.55 (declare-const tptp.equivalence_3 Bool) % 0.20/0.55 (declare-const tptp.and_1 Bool) % 0.20/0.55 (declare-const tptp.equiv (-> $$unsorted $$unsorted $$unsorted)) % 0.20/0.55 (declare-const tptp.implies_3 Bool) % 0.20/0.55 (declare-const tptp.substitution_of_equivalents Bool) % 0.20/0.55 (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted)) % 0.20/0.55 (declare-const tptp.and (-> $$unsorted $$unsorted $$unsorted)) % 0.20/0.55 (declare-const tptp.op_implies_and Bool) % 0.20/0.55 (declare-const tptp.or_3 Bool) % 0.20/0.55 (declare-const tptp.equivalence_2 Bool) % 0.20/0.55 (declare-const tptp.modus_ponens Bool) % 0.20/0.55 (declare-const tptp.implies_1 Bool) % 0.20/0.55 (declare-const tptp.equivalence_1 Bool) % 0.20/0.55 (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted)) % 0.20/0.55 (declare-const tptp.r5 Bool) % 0.20/0.55 (declare-const tptp.and_3 Bool) % 0.20/0.55 (declare-const tptp.cn3 Bool) % 0.20/0.55 (declare-const tptp.or_2 Bool) % 0.20/0.55 (declare-const tptp.kn1 Bool) % 0.20/0.55 (declare-const tptp.cn1 Bool) % 0.20/0.55 (declare-const tptp.kn2 Bool) % 0.20/0.55 (declare-const tptp.cn2 Bool) % 0.20/0.55 (declare-const tptp.kn3 Bool) % 0.20/0.55 (declare-const tptp.is_a_theorem (-> $$unsorted Bool)) % 0.20/0.55 (declare-const tptp.r1 Bool) % 0.20/0.55 (declare-const tptp.r2 Bool) % 0.20/0.55 (define @t1 () (@var "Y" $$unsorted)) % 0.20/0.55 (define @t2 () (@var "X" $$unsorted)) % 0.20/0.55 (define @t3 () (tptp.implies @t2 @t1)) % 0.20/0.55 (define @t4 () (@list @t2 @t1)) % 0.20/0.55 (define @t5 () (tptp.equiv @t2 @t1)) % 0.20/0.55 (define @t6 () (tptp.not @t2)) % 0.20/0.55 (define @t7 () (tptp.not @t1)) % 0.20/0.55 (define @t8 () (tptp.implies @t1 @t2)) % 0.20/0.55 (define @t9 () (@var "Z" $$unsorted)) % 0.20/0.55 (define @t10 () (tptp.implies @t2 @t9)) % 0.20/0.55 (define @t11 () (tptp.implies @t1 @t9)) % 0.20/0.55 (define @t12 () (@list @t2 @t1 @t9)) % 0.20/0.55 (define @t13 () (tptp.and @t2 @t1)) % 0.20/0.55 (define @t14 () (tptp.or @t2 @t1)) % 0.20/0.55 (define @t15 () (forall @t4 (tptp.is_a_theorem (tptp.implies @t1 @t14)))) % 0.20/0.55 (define @t16 () (@var "P" $$unsorted)) % 0.20/0.55 (define @t17 () (@list @t16)) % 0.20/0.55 (define @t18 () (@var "Q" $$unsorted)) % 0.20/0.55 (define @t19 () (@list @t16 @t18)) % 0.20/0.55 (define @t20 () (@var "R" $$unsorted)) % 0.20/0.55 (define @t21 () (tptp.implies @t16 @t18)) % 0.20/0.55 (define @t22 () (@list @t16 @t18 @t20)) % 0.20/0.55 (define @t23 () (tptp.implies @t18 @t20)) % 0.20/0.55 (define @t24 () (tptp.not @t16)) % 0.20/0.55 (define @t25 () (tptp.or @t16 @t18)) % 0.20/0.55 (define @t26 () (forall @t19 (tptp.is_a_theorem (tptp.implies @t18 @t25)))) % 0.20/0.55 (define @t27 () (tptp.or @t16 @t20)) % 0.20/0.55 (define @t28 () (@list false)) % 0.20/0.55 (assume @p1 (= tptp.modus_ponens (forall @t4 (=> (and (tptp.is_a_theorem @t2) (tptp.is_a_theorem @t3)) (tptp.is_a_theorem @t1))))) % 0.20/0.55 (assume @p2 (= tptp.substitution_of_equivalents (forall @t4 (=> (tptp.is_a_theorem @t5) (= @t2 @t1))))) % 0.20/0.55 (assume @p3 (= tptp.modus_tollens (forall @t4 (tptp.is_a_theorem (tptp.implies (tptp.implies @t7 @t6) @t3))))) % 0.20/0.55 (assume @p4 (= tptp.implies_1 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 @t8))))) % 0.20/0.55 (assume @p5 (= tptp.implies_2 (forall @t4 (tptp.is_a_theorem (tptp.implies (tptp.implies @t2 @t3) @t3))))) % 0.20/0.55 (assume @p6 (= tptp.implies_3 (forall @t12 (tptp.is_a_theorem (tptp.implies @t3 (tptp.implies @t11 @t10)))))) % 0.20/0.55 (assume @p7 (= tptp.and_1 (forall @t4 (tptp.is_a_theorem (tptp.implies @t13 @t2))))) % 0.20/0.55 (assume @p8 (= tptp.and_2 (forall @t4 (tptp.is_a_theorem (tptp.implies @t13 @t1))))) % 0.20/0.55 (assume @p9 (= tptp.and_3 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 (tptp.implies @t1 @t13)))))) % 0.20/0.55 (assume @p10 (= tptp.or_1 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 @t14))))) % 0.20/0.55 (assume @p11 (= tptp.or_2 @t15)) % 0.20/0.55 (assume @p12 (= tptp.or_3 (forall @t12 (tptp.is_a_theorem (tptp.implies @t10 (tptp.implies @t11 (tptp.implies @t14 @t9))))))) % 0.20/0.55 (assume @p13 (= tptp.equivalence_1 (forall @t4 (tptp.is_a_theorem (tptp.implies @t5 @t3))))) % 0.20/0.55 (assume @p14 (= tptp.equivalence_2 (forall @t4 (tptp.is_a_theorem (tptp.implies @t5 @t8))))) % 0.20/0.55 (assume @p15 (= tptp.equivalence_3 (forall @t4 (tptp.is_a_theorem (tptp.implies @t3 (tptp.implies @t8 @t5)))))) % 0.20/0.56 (assume @p16 (= tptp.kn1 (forall @t17 (tptp.is_a_theorem (tptp.implies @t16 (tptp.and @t16 @t16)))))) % 0.20/0.56 (assume @p17 (= tptp.kn2 (forall @t19 (tptp.is_a_theorem (tptp.implies (tptp.and @t16 @t18) @t16))))) % 0.20/0.56 (assume @p18 (= tptp.kn3 (forall @t22 (tptp.is_a_theorem (tptp.implies @t21 (tptp.implies (tptp.not (tptp.and @t18 @t20)) (tptp.not (tptp.and @t20 @t16)))))))) % 0.20/0.56 (assume @p19 (= tptp.cn1 (forall @t22 (tptp.is_a_theorem (tptp.implies @t21 (tptp.implies @t23 (tptp.implies @t16 @t20))))))) % 0.20/0.56 (assume @p20 (= tptp.cn2 (forall @t19 (tptp.is_a_theorem (tptp.implies @t16 (tptp.implies @t24 @t18)))))) % 0.20/0.56 (assume @p21 (= tptp.cn3 (forall @t17 (tptp.is_a_theorem (tptp.implies (tptp.implies @t24 @t16) @t16))))) % 0.20/0.56 (assume @p22 (= tptp.r1 (forall @t17 (tptp.is_a_theorem (tptp.implies (tptp.or @t16 @t16) @t16))))) % 0.20/0.56 (assume @p23 (= tptp.r2 @t26)) % 0.20/0.56 (assume @p24 (= tptp.r3 (forall @t19 (tptp.is_a_theorem (tptp.implies @t25 (tptp.or @t18 @t16)))))) % 0.20/0.56 (assume @p25 (= tptp.r4 (forall @t22 (tptp.is_a_theorem (tptp.implies (tptp.or @t16 (tptp.or @t18 @t20)) (tptp.or @t18 @t27)))))) % 0.20/0.56 (assume @p26 (= tptp.r5 (forall @t22 (tptp.is_a_theorem (tptp.implies @t23 (tptp.implies @t25 @t27)))))) % 0.20/0.56 (assume @p27 (=> tptp.op_or (forall @t4 (= @t14 (tptp.not (tptp.and @t6 @t7)))))) % 0.20/0.56 (assume @p28 (=> tptp.op_and (forall @t4 (= @t13 (tptp.not (tptp.or @t6 @t7)))))) % 0.20/0.56 (assume @p29 (=> tptp.op_implies_and (forall @t4 (= @t3 (tptp.not (tptp.and @t2 @t7)))))) % 0.20/0.56 (assume @p30 (=> tptp.op_implies_or (forall @t4 (= @t3 (tptp.or @t6 @t1))))) % 0.20/0.56 (assume @p31 (=> tptp.op_equiv (forall @t4 (= @t5 (tptp.and @t3 @t8))))) % 0.20/0.56 (assume @p32 tptp.op_implies_or) % 0.20/0.56 (assume @p33 tptp.op_and) % 0.20/0.56 (assume @p34 tptp.op_equiv) % 0.20/0.56 (assume @p35 tptp.modus_ponens) % 0.20/0.56 (assume @p36 tptp.r1) % 0.20/0.56 (assume @p37 tptp.r2) % 0.20/0.56 (assume @p38 tptp.r3) % 0.20/0.56 (assume @p39 tptp.r4) % 0.20/0.56 (assume @p40 tptp.r5) % 0.20/0.56 (assume @p41 tptp.substitution_of_equivalents) % 0.20/0.56 (assume @p42 tptp.op_or) % 0.20/0.56 (assume @p43 tptp.op_implies_and) % 0.20/0.56 (assume @p44 (not tptp.or_2)) % 0.20/0.56 (assume @p45 true) % 0.20/0.56 (step @p46 :rule equiv_elim1 :premises (@p23)) % 0.20/0.56 (step @p47 :rule reordering :premises (@p46) :args ((or @t26 (not tptp.r2)))) % 0.20/0.56 (step @p48 :rule chain_m_resolution :premises (@p47 @p37) :args (@t26 @t28 (@list tptp.r2))) % 0.20/0.56 (step @p49 :rule alpha_equiv :args (@t15 (@list @t1 @t2) (@list @t18 @t16))) % 0.20/0.56 (step @p50 :rule equiv_elim2 :premises (@p49)) % 0.20/0.56 (step @p51 :rule chain_m_resolution :premises (@p50 @p48) :args (@t15 @t28 (@list @t26))) % 0.20/0.56 (step @p52 :rule equiv_elim2 :premises (@p11)) % 0.20/0.56 (step @p53 :rule chain_m_resolution :premises (@p52 @p51) :args (tptp.or_2 @t28 (@list @t15))) % 0.20/0.56 (step @p54 false :rule chain_m_resolution :premises (@p44 @p53) :args (false @t28 (@list tptp.or_2))) % 0.20/0.56 ) % 0.20/0.56 % SZS output end Proof % 0.20/0.56 % cvc5 exiting %------------------------------------------------------------------------------