%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL190-3 : TPTP v9.3.1. Released v2.3.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n009.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:22 AM UTC 2026 % Result : Unsatisfiable 0.17s 0.49s % Output : Proof 0.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL190-3 : TPTP v9.3.1. Released v2.3.0. % 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.08/0.35 % Computer : n009.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Fri Sep 4 20:36:51 UTC 2026 % 0.08/0.35 % CPUTime : % 0.12/0.42 %----Proving TF0_NAR, FOF, or CNF % 0.12/0.44 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.17/0.49 % SZS status Unsatisfiable % 0.17/0.49 % SZS output start Proof % 0.17/0.49 ( % 0.17/0.49 (declare-sort $$unsorted 0) % 0.17/0.49 (declare-const tptp.r $$unsorted) % 0.17/0.49 (declare-const tptp.q $$unsorted) % 0.17/0.49 (declare-const tptp.theorem (-> $$unsorted Bool)) % 0.17/0.49 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 0.17/0.49 (declare-const tptp.p $$unsorted) % 0.17/0.49 (declare-const tptp.axiom (-> $$unsorted Bool)) % 0.17/0.49 (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted)) % 0.17/0.49 (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted)) % 0.17/0.49 (define @t1 () (@var "A" $$unsorted)) % 0.17/0.49 (define @t2 () (@var "B" $$unsorted)) % 0.17/0.49 (define @t3 () (tptp.or @t2 @t1)) % 0.17/0.49 (define @t4 () (@list @t1 @t2)) % 0.17/0.49 (define @t5 () (@var "C" $$unsorted)) % 0.17/0.49 (define @t6 () (@list @t1 @t2 @t5)) % 0.17/0.49 (define @t7 () (@var "Y" $$unsorted)) % 0.17/0.49 (define @t8 () (@var "X" $$unsorted)) % 0.17/0.49 (define @t9 () (@list @t8 @t7)) % 0.17/0.49 (define @t10 () (tptp.theorem @t8)) % 0.17/0.49 (define @t11 () (tptp.or tptp.r tptp.q)) % 0.17/0.49 (define @t12 () (tptp.or tptp.q tptp.r)) % 0.17/0.49 (define @t13 () (tptp.implies (tptp.or tptp.p @t12) (tptp.or tptp.p @t11))) % 0.17/0.49 (define @t14 () (tptp.theorem @t13)) % 0.17/0.49 (define @t15 () (tptp.implies @t12 @t11)) % 0.17/0.49 (define @t16 () (tptp.axiom @t15)) % 0.17/0.49 (define @t17 () (not @t16)) % 0.17/0.49 (define @t18 () (tptp.theorem @t15)) % 0.17/0.49 (define @t19 () (or @t18 @t17)) % 0.17/0.49 (define @t20 () (@list false false)) % 0.17/0.49 (define @t21 () (tptp.implies @t15 @t13)) % 0.17/0.49 (define @t22 () (tptp.axiom @t21)) % 0.17/0.49 (define @t23 () (not @t22)) % 0.17/0.49 (define @t24 () (tptp.theorem @t21)) % 0.17/0.49 (define @t25 () (or @t24 @t23)) % 0.17/0.49 (define @t26 () (not @t18)) % 0.17/0.49 (define @t27 () (not @t24)) % 0.17/0.49 (define @t28 () (or @t14 @t27 @t26)) % 0.17/0.49 (assume @p1 (forall (@list @t1) (tptp.axiom (tptp.implies (tptp.or @t1 @t1) @t1)))) % 0.17/0.49 (assume @p2 (forall @t4 (tptp.axiom (tptp.implies @t1 @t3)))) % 0.17/0.49 (assume @p3 (forall @t4 (tptp.axiom (tptp.implies (tptp.or @t1 @t2) @t3)))) % 0.17/0.49 (assume @p4 (forall @t6 (tptp.axiom (tptp.implies (tptp.or @t1 (tptp.or @t2 @t5)) (tptp.or @t2 (tptp.or @t1 @t5)))))) % 0.17/0.49 (assume @p5 (forall @t6 (tptp.axiom (tptp.implies (tptp.implies @t1 @t2) (tptp.implies (tptp.or @t5 @t1) (tptp.or @t5 @t2)))))) % 0.17/0.49 (assume @p6 (forall @t9 (= (tptp.implies @t8 @t7) (tptp.or (tptp.not @t8) @t7)))) % 0.17/0.49 (assume @p7 (forall (@list @t8) (or @t10 (not (tptp.axiom @t8))))) % 0.17/0.49 (assume @p8 (forall @t9 (or @t10 (not (tptp.theorem (tptp.implies @t7 @t8))) (not (tptp.theorem @t7))))) % 0.17/0.49 (assume @p9 (not @t14)) % 0.17/0.49 (step @p10 :rule instantiate :premises (@p8) :args ((@list @t13 @t15))) % 0.17/0.49 (step @p11 :rule instantiate :premises (@p7) :args ((@list @t15))) % 0.17/0.49 (step @p12 :rule instantiate :premises (@p3) :args ((@list tptp.q tptp.r))) % 0.17/0.49 (step @p13 :rule cnf_or_pos :args (@t19)) % 0.17/0.49 (step @p14 :rule reordering :premises (@p13) :args ((or @t17 @t18 (not @t19)))) % 0.17/0.49 (step @p15 :rule chain_m_resolution :premises (@p14 @p12 @p11) :args (@t18 @t20 (@list @t16 @t19))) % 0.17/0.49 (step @p16 :rule instantiate :premises (@p7) :args ((@list @t21))) % 0.17/0.49 (step @p17 :rule instantiate :premises (@p5) :args ((@list @t12 @t11 tptp.p))) % 0.17/0.49 (step @p18 :rule cnf_or_pos :args (@t25)) % 0.17/0.49 (step @p19 :rule reordering :premises (@p18) :args ((or @t23 @t24 (not @t25)))) % 0.17/0.49 (step @p20 :rule chain_m_resolution :premises (@p19 @p17 @p16) :args (@t24 @t20 (@list @t22 @t25))) % 0.17/0.49 (step @p21 :rule cnf_or_pos :args (@t28)) % 0.17/0.49 (step @p22 :rule reordering :premises (@p21) :args ((or @t14 @t26 @t27 (not @t28)))) % 0.17/0.49 (step @p23 false :rule chain_m_resolution :premises (@p22 @p20 @p15 @p10 @p9) :args (false (@list false false false true) (@list @t24 @t18 @t28 @t14))) % 0.17/0.49 ) % 0.17/0.49 % SZS output end Proof % 0.17/0.50 % cvc5 exiting %------------------------------------------------------------------------------