%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL459+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 : n027.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:56 AM UTC 2026 % Result : Theorem 2.63s 3.02s % Output : Proof 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL459+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.35 % Computer : n027.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Fri Sep 4 14:33:12 UTC 2026 % 0.09/0.35 % CPUTime : % 0.12/0.43 %----Proving TF0_NAR, FOF, or CNF % 2.63/3.02 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 2.63/3.02 % SZS status Theorem % 2.63/3.02 % SZS output start Proof % 2.63/3.02 ( % 2.63/3.02 (declare-sort $$unsorted 0) % 2.63/3.02 (declare-const tptp.op_equiv Bool) % 2.63/3.02 (declare-const tptp.op_implies_or Bool) % 2.63/3.02 (declare-const tptp.op_and Bool) % 2.63/3.02 (declare-const tptp.r4 Bool) % 2.63/3.02 (declare-const tptp.r3 Bool) % 2.63/3.02 (declare-const tptp.implies_2 Bool) % 2.63/3.02 (declare-const tptp.and_2 Bool) % 2.63/3.02 (declare-const tptp.modus_tollens Bool) % 2.63/3.02 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 2.63/3.02 (declare-const tptp.op_or Bool) % 2.63/3.02 (declare-const tptp.or_1 Bool) % 2.63/3.02 (declare-const tptp.equivalence_3 Bool) % 2.63/3.02 (declare-const tptp.and_1 Bool) % 2.63/3.02 (declare-const tptp.equiv (-> $$unsorted $$unsorted $$unsorted)) % 2.63/3.02 (declare-const tptp.implies_3 Bool) % 2.63/3.02 (declare-const tptp.substitution_of_equivalents Bool) % 2.63/3.02 (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted)) % 2.63/3.02 (declare-const tptp.and (-> $$unsorted $$unsorted $$unsorted)) % 2.63/3.02 (declare-const tptp.op_implies_and Bool) % 2.63/3.02 (declare-const tptp.or_3 Bool) % 2.63/3.02 (declare-const tptp.equivalence_2 Bool) % 2.63/3.02 (declare-const tptp.modus_ponens Bool) % 2.63/3.02 (declare-const tptp.implies_1 Bool) % 2.63/3.02 (declare-const tptp.equivalence_1 Bool) % 2.63/3.02 (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted)) % 2.63/3.02 (declare-const tptp.r5 Bool) % 2.63/3.02 (declare-const tptp.and_3 Bool) % 2.63/3.02 (declare-const tptp.cn3 Bool) % 2.63/3.02 (declare-const tptp.or_2 Bool) % 2.63/3.02 (declare-const tptp.kn1 Bool) % 2.63/3.02 (declare-const tptp.cn1 Bool) % 2.63/3.02 (declare-const tptp.kn2 Bool) % 2.63/3.02 (declare-const tptp.cn2 Bool) % 2.63/3.02 (declare-const tptp.kn3 Bool) % 2.63/3.02 (declare-const tptp.is_a_theorem (-> $$unsorted Bool)) % 2.63/3.02 (declare-const tptp.r1 Bool) % 2.63/3.02 (declare-const tptp.r2 Bool) % 2.63/3.02 (define @t1 () (@var "Y" $$unsorted)) % 2.63/3.02 (define @t2 () (tptp.is_a_theorem @t1)) % 2.63/3.02 (define @t3 () (@var "X" $$unsorted)) % 2.63/3.02 (define @t4 () (tptp.implies @t3 @t1)) % 2.63/3.02 (define @t5 () (tptp.is_a_theorem @t4)) % 2.63/3.02 (define @t6 () (tptp.is_a_theorem @t3)) % 2.63/3.02 (define @t7 () (and @t6 @t5)) % 2.63/3.02 (define @t8 () (@list @t3 @t1)) % 2.63/3.02 (define @t9 () (forall @t8 (=> @t7 @t2))) % 2.63/3.02 (define @t10 () (= tptp.modus_ponens @t9)) % 2.63/3.02 (define @t11 () (tptp.equiv @t3 @t1)) % 2.63/3.02 (define @t12 () (tptp.not @t3)) % 2.63/3.02 (define @t13 () (tptp.not @t1)) % 2.63/3.02 (define @t14 () (tptp.implies @t1 @t3)) % 2.63/3.02 (define @t15 () (forall @t8 (tptp.is_a_theorem (tptp.implies (tptp.implies @t3 @t4) @t4)))) % 2.63/3.02 (define @t16 () (@var "Z" $$unsorted)) % 2.63/3.02 (define @t17 () (tptp.implies @t3 @t16)) % 2.63/3.02 (define @t18 () (tptp.implies @t1 @t16)) % 2.63/3.02 (define @t19 () (@list @t3 @t1 @t16)) % 2.63/3.02 (define @t20 () (tptp.and @t3 @t1)) % 2.63/3.02 (define @t21 () (forall @t8 (tptp.is_a_theorem (tptp.implies @t3 (tptp.implies @t1 @t20))))) % 2.63/3.02 (define @t22 () (tptp.or @t3 @t1)) % 2.63/3.02 (define @t23 () (@var "P" $$unsorted)) % 2.63/3.02 (define @t24 () (@list @t23)) % 2.63/3.02 (define @t25 () (forall @t24 (tptp.is_a_theorem (tptp.implies @t23 (tptp.and @t23 @t23))))) % 2.63/3.02 (define @t26 () (@var "Q" $$unsorted)) % 2.63/3.02 (define @t27 () (@list @t23 @t26)) % 2.63/3.02 (define @t28 () (@var "R" $$unsorted)) % 2.63/3.02 (define @t29 () (tptp.implies @t23 @t26)) % 2.63/3.02 (define @t30 () (@list @t23 @t26 @t28)) % 2.63/3.02 (define @t31 () (tptp.implies @t26 @t28)) % 2.63/3.02 (define @t32 () (tptp.not @t23)) % 2.63/3.02 (define @t33 () (tptp.or @t23 @t26)) % 2.63/3.02 (define @t34 () (tptp.or @t23 @t28)) % 2.63/3.02 (define @t35 () (@list false)) % 2.63/3.02 (define @t36 () (@quantifiers_skolemize @t25 0)) % 2.63/3.02 (define @t37 () (not @t5)) % 2.63/3.02 (define @t38 () (not @t6)) % 2.63/3.02 (define @t39 () (or @t38 @t37 @t2)) % 2.63/3.02 (define @t40 () (forall @t8 @t39)) % 2.63/3.02 (define @t41 () (tptp.and @t36 @t36)) % 2.63/3.02 (define @t42 () (tptp.implies @t36 @t41)) % 2.63/3.02 (define @t43 () (tptp.implies @t36 @t42)) % 2.63/3.02 (define @t44 () (tptp.is_a_theorem @t42)) % 2.63/3.02 (define @t45 () (tptp.is_a_theorem (tptp.implies @t43 @t42))) % 2.63/3.02 (define @t46 () (not @t45)) % 2.63/3.02 (define @t47 () (tptp.is_a_theorem @t43)) % 2.63/3.02 (define @t48 () (not @t47)) % 2.63/3.02 (define @t49 () (or @t48 @t46 @t44)) % 2.63/3.02 (assume @p1 @t10) % 2.63/3.02 (assume @p2 (= tptp.substitution_of_equivalents (forall @t8 (=> (tptp.is_a_theorem @t11) (= @t3 @t1))))) % 2.63/3.02 (assume @p3 (= tptp.modus_tollens (forall @t8 (tptp.is_a_theorem (tptp.implies (tptp.implies @t13 @t12) @t4))))) % 2.63/3.02 (assume @p4 (= tptp.implies_1 (forall @t8 (tptp.is_a_theorem (tptp.implies @t3 @t14))))) % 2.63/3.02 (assume @p5 (= tptp.implies_2 @t15)) % 2.63/3.02 (assume @p6 (= tptp.implies_3 (forall @t19 (tptp.is_a_theorem (tptp.implies @t4 (tptp.implies @t18 @t17)))))) % 2.63/3.02 (assume @p7 (= tptp.and_1 (forall @t8 (tptp.is_a_theorem (tptp.implies @t20 @t3))))) % 2.63/3.02 (assume @p8 (= tptp.and_2 (forall @t8 (tptp.is_a_theorem (tptp.implies @t20 @t1))))) % 2.63/3.02 (assume @p9 (= tptp.and_3 @t21)) % 2.63/3.02 (assume @p10 (= tptp.or_1 (forall @t8 (tptp.is_a_theorem (tptp.implies @t3 @t22))))) % 2.63/3.02 (assume @p11 (= tptp.or_2 (forall @t8 (tptp.is_a_theorem (tptp.implies @t1 @t22))))) % 2.63/3.02 (assume @p12 (= tptp.or_3 (forall @t19 (tptp.is_a_theorem (tptp.implies @t17 (tptp.implies @t18 (tptp.implies @t22 @t16))))))) % 2.63/3.02 (assume @p13 (= tptp.equivalence_1 (forall @t8 (tptp.is_a_theorem (tptp.implies @t11 @t4))))) % 2.63/3.02 (assume @p14 (= tptp.equivalence_2 (forall @t8 (tptp.is_a_theorem (tptp.implies @t11 @t14))))) % 2.63/3.02 (assume @p15 (= tptp.equivalence_3 (forall @t8 (tptp.is_a_theorem (tptp.implies @t4 (tptp.implies @t14 @t11)))))) % 2.63/3.02 (assume @p16 (= tptp.kn1 @t25)) % 2.63/3.02 (assume @p17 (= tptp.kn2 (forall @t27 (tptp.is_a_theorem (tptp.implies (tptp.and @t23 @t26) @t23))))) % 2.63/3.02 (assume @p18 (= tptp.kn3 (forall @t30 (tptp.is_a_theorem (tptp.implies @t29 (tptp.implies (tptp.not (tptp.and @t26 @t28)) (tptp.not (tptp.and @t28 @t23)))))))) % 2.63/3.02 (assume @p19 (= tptp.cn1 (forall @t30 (tptp.is_a_theorem (tptp.implies @t29 (tptp.implies @t31 (tptp.implies @t23 @t28))))))) % 2.63/3.02 (assume @p20 (= tptp.cn2 (forall @t27 (tptp.is_a_theorem (tptp.implies @t23 (tptp.implies @t32 @t26)))))) % 2.63/3.02 (assume @p21 (= tptp.cn3 (forall @t24 (tptp.is_a_theorem (tptp.implies (tptp.implies @t32 @t23) @t23))))) % 2.63/3.02 (assume @p22 (= tptp.r1 (forall @t24 (tptp.is_a_theorem (tptp.implies (tptp.or @t23 @t23) @t23))))) % 2.63/3.02 (assume @p23 (= tptp.r2 (forall @t27 (tptp.is_a_theorem (tptp.implies @t26 @t33))))) % 2.63/3.02 (assume @p24 (= tptp.r3 (forall @t27 (tptp.is_a_theorem (tptp.implies @t33 (tptp.or @t26 @t23)))))) % 2.63/3.02 (assume @p25 (= tptp.r4 (forall @t30 (tptp.is_a_theorem (tptp.implies (tptp.or @t23 (tptp.or @t26 @t28)) (tptp.or @t26 @t34)))))) % 2.63/3.02 (assume @p26 (= tptp.r5 (forall @t30 (tptp.is_a_theorem (tptp.implies @t31 (tptp.implies @t33 @t34)))))) % 2.63/3.02 (assume @p27 (=> tptp.op_or (forall @t8 (= @t22 (tptp.not (tptp.and @t12 @t13)))))) % 2.63/3.02 (assume @p28 (=> tptp.op_and (forall @t8 (= @t20 (tptp.not (tptp.or @t12 @t13)))))) % 2.63/3.02 (assume @p29 (=> tptp.op_implies_and (forall @t8 (= @t4 (tptp.not (tptp.and @t3 @t13)))))) % 2.63/3.02 (assume @p30 (=> tptp.op_implies_or (forall @t8 (= @t4 (tptp.or @t12 @t1))))) % 2.63/3.02 (assume @p31 (=> tptp.op_equiv (forall @t8 (= @t11 (tptp.and @t4 @t14))))) % 2.63/3.02 (assume @p32 tptp.op_or) % 2.63/3.02 (assume @p33 tptp.op_implies_and) % 2.63/3.02 (assume @p34 tptp.op_equiv) % 2.63/3.02 (assume @p35 tptp.modus_ponens) % 2.63/3.02 (assume @p36 tptp.modus_tollens) % 2.63/3.02 (assume @p37 tptp.implies_1) % 2.63/3.02 (assume @p38 tptp.implies_2) % 2.63/3.02 (assume @p39 tptp.implies_3) % 2.63/3.02 (assume @p40 tptp.and_1) % 2.63/3.02 (assume @p41 tptp.and_2) % 2.63/3.02 (assume @p42 tptp.and_3) % 2.63/3.02 (assume @p43 tptp.or_1) % 2.63/3.02 (assume @p44 tptp.or_2) % 2.63/3.02 (assume @p45 tptp.or_3) % 2.63/3.02 (assume @p46 tptp.equivalence_1) % 2.63/3.02 (assume @p47 tptp.equivalence_2) % 2.63/3.02 (assume @p48 tptp.equivalence_3) % 2.63/3.02 (assume @p49 tptp.substitution_of_equivalents) % 2.63/3.02 (assume @p50 (not tptp.kn1)) % 2.63/3.02 (assume @p51 true) % 2.63/3.02 (step @p52 :rule equiv_elim2 :premises (@p16)) % 2.63/3.02 (step @p53 :rule chain_m_resolution :premises (@p52 @p50) :args ((not @t25) (@list true) (@list tptp.kn1))) % 2.63/3.02 (step @p54 :rule skolemize :premises (@p53)) % 2.63/3.02 (step @p55 :rule equiv_elim1 :premises (@p9)) % 2.63/3.02 (step @p56 :rule reordering :premises (@p55) :args ((or @t21 (not tptp.and_3)))) % 2.63/3.02 (step @p57 :rule chain_m_resolution :premises (@p56 @p42) :args (@t21 @t35 (@list tptp.and_3))) % 2.63/3.02 (step @p58 :rule instantiate :premises (@p57) :args ((@list @t36 @t36))) % 2.63/3.02 (step @p59 :rule aci_norm :args ((= (or (or @t38 @t37) @t2) @t39))) % 2.63/3.02 (step @p60 :rule refl :args (@t2)) % 2.63/3.02 (step @p61 :rule bool-and-de-morgan :args (@t6 @t5 true)) % 2.63/3.02 (step @p62 :rule nary_cong :premises (@p61 @p60) :args ((or (not @t7) @t2))) % 2.63/3.02 (step @p63 :rule trans :premises (@p62 @p59)) % 2.63/3.02 (step @p64 :rule bool-impl-elim :args (@t7 @t2)) % 2.63/3.02 (step @p65 :rule trans :premises (@p64 @p63)) % 2.63/3.02 (step @p66 :rule cong :premises (@p65) :args (@t9)) % 2.63/3.02 (step @p67 :rule refl :args (tptp.modus_ponens)) % 2.63/3.02 (step @p68 :rule cong :premises (@p67 @p66) :args (@t10)) % 2.63/3.02 (step @p69 :rule eq_resolve :premises (@p1 @p68)) % 2.63/3.02 (step @p70 :rule equiv_elim1 :premises (@p69)) % 2.63/3.02 (step @p71 :rule reordering :premises (@p70) :args ((or @t40 (not tptp.modus_ponens)))) % 0.19/3.04 (step @p72 :rule chain_m_resolution :premises (@p71 @p35) :args (@t40 @t35 (@list tptp.modus_ponens))) % 0.19/3.04 (step @p73 :rule instantiate :premises (@p72) :args ((@list @t43 @t42))) % 0.19/3.04 (step @p74 :rule equiv_elim1 :premises (@p5)) % 0.19/3.04 (step @p75 :rule reordering :premises (@p74) :args ((or @t15 (not tptp.implies_2)))) % 0.19/3.04 (step @p76 :rule chain_m_resolution :premises (@p75 @p38) :args (@t15 @t35 (@list tptp.implies_2))) % 0.19/3.04 (step @p77 :rule instantiate :premises (@p76) :args ((@list @t36 @t41))) % 0.19/3.04 (step @p78 :rule cnf_or_pos :args (@t49)) % 0.19/3.04 (step @p79 :rule reordering :premises (@p78) :args ((or @t44 @t48 @t46 (not @t49)))) % 0.19/3.04 (step @p80 false :rule chain_m_resolution :premises (@p79 @p77 @p73 @p58 @p54) :args (false (@list false false false true) (@list @t45 @t49 @t47 @t44))) % 0.19/3.04 ) % 0.19/3.04 % SZS output end Proof % 0.19/3.04 % cvc5 exiting %------------------------------------------------------------------------------