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