%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL044-1 : TPTP v9.3.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n026.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:05 AM UTC 2026 % Result : Unsatisfiable 0.21s 0.48s % Output : Proof 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL044-1 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.11/0.36 % Computer : n026.cluster.edu % 0.11/0.36 % Model : x86_64 x86_64 % 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.36 % Memory : 8046.5625MB % 0.11/0.36 % OS : Linux 6.8.0-71-generic % 0.11/0.36 % CPULimit : 300 % 0.11/0.36 % WCLimit : 300 % 0.11/0.36 % DateTime : Sat Sep 5 05:25:25 UTC 2026 % 0.14/0.36 % CPUTime : % 0.14/0.43 %----Proving TF0_NAR, FOF, or CNF % 0.14/0.45 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.21/0.48 % SZS status Unsatisfiable % 0.21/0.48 % SZS output start Proof % 0.21/0.49 ( % 0.21/0.49 (declare-sort $$unsorted 0) % 0.21/0.49 (declare-const tptp.a $$unsorted) % 0.21/0.49 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 0.21/0.49 (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted)) % 0.21/0.49 (declare-const tptp.is_a_theorem (-> $$unsorted Bool)) % 0.21/0.49 (define @t1 () (@var "Y" $$unsorted)) % 0.21/0.49 (define @t2 () (@var "X" $$unsorted)) % 0.21/0.49 (define @t3 () (tptp.implies @t2 @t1)) % 0.21/0.49 (define @t4 () (@list @t2 @t1)) % 0.21/0.49 (define @t5 () (tptp.implies (tptp.not @t2) @t1)) % 0.21/0.49 (define @t6 () (@var "Z" $$unsorted)) % 0.21/0.49 (define @t7 () (tptp.implies @t2 @t6)) % 0.21/0.49 (define @t8 () (tptp.implies @t1 @t6)) % 0.21/0.49 (define @t9 () (tptp.not tptp.a)) % 0.21/0.49 (define @t10 () (tptp.not @t9)) % 0.21/0.49 (define @t11 () (tptp.implies tptp.a @t10)) % 0.21/0.49 (define @t12 () (tptp.is_a_theorem @t11)) % 0.21/0.49 (define @t13 () (tptp.implies @t10 @t11)) % 0.21/0.49 (define @t14 () (tptp.implies @t13 @t11)) % 0.21/0.49 (define @t15 () (tptp.implies @t9 @t11)) % 0.21/0.49 (define @t16 () (tptp.is_a_theorem @t13)) % 0.21/0.49 (define @t17 () (not @t16)) % 0.21/0.49 (define @t18 () (tptp.is_a_theorem @t14)) % 0.21/0.49 (define @t19 () (not @t18)) % 0.21/0.49 (define @t20 () (or @t19 @t17 @t12)) % 0.21/0.49 (define @t21 () (tptp.is_a_theorem @t15)) % 0.21/0.49 (define @t22 () (not @t21)) % 0.21/0.49 (define @t23 () (tptp.is_a_theorem (tptp.implies @t15 @t14))) % 0.21/0.49 (define @t24 () (not @t23)) % 0.21/0.49 (define @t25 () (or @t24 @t22 @t18)) % 0.21/0.49 (define @t26 () (tptp.implies tptp.a (tptp.implies @t9 @t10))) % 0.21/0.49 (define @t27 () (tptp.is_a_theorem @t26)) % 0.21/0.49 (define @t28 () (not @t27)) % 0.21/0.49 (define @t29 () (tptp.is_a_theorem (tptp.implies @t26 @t15))) % 0.21/0.49 (define @t30 () (not @t29)) % 0.21/0.49 (define @t31 () (or @t30 @t28 @t21)) % 0.21/0.49 (assume @p1 (forall @t4 (or (not (tptp.is_a_theorem @t3)) (not (tptp.is_a_theorem @t2)) (tptp.is_a_theorem @t1)))) % 0.21/0.49 (assume @p2 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 @t5)))) % 0.21/0.49 (assume @p3 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 (tptp.implies @t1 @t2))))) % 0.21/0.49 (assume @p4 (forall (@list @t2 @t1 @t6) (tptp.is_a_theorem (tptp.implies (tptp.implies @t2 @t8) (tptp.implies @t1 @t7))))) % 0.21/0.49 (assume @p5 (forall (@list @t1 @t6 @t2) (tptp.is_a_theorem (tptp.implies @t8 (tptp.implies @t3 @t7))))) % 0.21/0.49 (assume @p6 (forall @t4 (tptp.is_a_theorem (tptp.implies @t3 (tptp.implies @t5 @t1))))) % 0.21/0.49 (assume @p7 (not @t12)) % 0.21/0.49 (step @p8 :rule instantiate :premises (@p4) :args ((@list tptp.a @t9 @t10))) % 0.21/0.49 (step @p9 :rule instantiate :premises (@p1) :args ((@list @t15 @t14))) % 0.21/0.49 (step @p10 :rule instantiate :premises (@p1) :args ((@list @t13 @t11))) % 0.21/0.49 (step @p11 :rule instantiate :premises (@p3) :args ((@list @t10 tptp.a))) % 0.21/0.49 (step @p12 :rule cnf_or_pos :args (@t20)) % 0.21/0.49 (step @p13 :rule reordering :premises (@p12) :args ((or @t12 @t17 @t19 (not @t20)))) % 0.21/0.49 (step @p14 :rule chain_m_resolution :premises (@p13 @p7 @p11 @p10) :args (@t19 (@list true false false) (@list @t12 @t16 @t20))) % 0.21/0.49 (step @p15 :rule instantiate :premises (@p6) :args ((@list @t9 @t11))) % 0.21/0.49 (step @p16 :rule cnf_or_pos :args (@t25)) % 0.21/0.49 (step @p17 :rule reordering :premises (@p16) :args ((or @t24 @t22 @t18 (not @t25)))) % 0.21/0.49 (step @p18 :rule chain_m_resolution :premises (@p17 @p15 @p14 @p9) :args (@t22 (@list false true false) (@list @t23 @t18 @t25))) % 0.21/0.49 (step @p19 :rule instantiate :premises (@p1) :args ((@list @t26 @t15))) % 0.21/0.49 (step @p20 :rule instantiate :premises (@p2) :args ((@list tptp.a @t10))) % 0.21/0.49 (step @p21 :rule cnf_or_pos :args (@t31)) % 0.21/0.49 (step @p22 :rule reordering :premises (@p21) :args ((or @t21 @t30 @t28 (not @t31)))) % 0.21/0.49 (step @p23 false :rule chain_m_resolution :premises (@p22 @p20 @p19 @p18 @p8) :args (false (@list false false true false) (@list @t27 @t31 @t21 @t29))) % 0.21/0.49 ) % 0.21/0.49 % SZS output end Proof % 0.21/0.49 % cvc5 exiting %------------------------------------------------------------------------------