%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL185-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 : n004.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:20 AM UTC 2026 % Result : Unsatisfiable 1.21s 1.58s % Output : Proof 1.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL185-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.09/0.36 % Computer : n004.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.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Sat Sep 5 17:07:59 UTC 2026 % 0.13/0.36 % CPUTime : % 0.13/0.43 %----Proving TF0_NAR, FOF, or CNF % 0.13/0.45 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 1.21/1.58 % SZS status Unsatisfiable % 1.21/1.58 % SZS output start Proof % 1.21/1.58 ( % 1.21/1.58 (declare-sort $$unsorted 0) % 1.21/1.58 (declare-const tptp.q $$unsorted) % 1.21/1.58 (declare-const tptp.theorem (-> $$unsorted Bool)) % 1.21/1.58 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 1.21/1.58 (declare-const tptp.p $$unsorted) % 1.21/1.58 (declare-const tptp.axiom (-> $$unsorted Bool)) % 1.21/1.58 (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted)) % 1.21/1.58 (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted)) % 1.21/1.58 (define @t1 () (@var "A" $$unsorted)) % 1.21/1.58 (define @t2 () (@var "B" $$unsorted)) % 1.21/1.58 (define @t3 () (tptp.or @t2 @t1)) % 1.21/1.58 (define @t4 () (@list @t1 @t2)) % 1.21/1.58 (define @t5 () (@var "C" $$unsorted)) % 1.21/1.58 (define @t6 () (@list @t1 @t2 @t5)) % 1.21/1.58 (define @t7 () (@var "Y" $$unsorted)) % 1.21/1.58 (define @t8 () (@var "X" $$unsorted)) % 1.21/1.58 (define @t9 () (@list @t8 @t7)) % 1.21/1.58 (define @t10 () (tptp.theorem @t8)) % 1.21/1.58 (define @t11 () (tptp.or tptp.p tptp.q)) % 1.21/1.58 (define @t12 () (tptp.or tptp.q tptp.p)) % 1.21/1.58 (define @t13 () (tptp.implies @t12 @t11)) % 1.21/1.58 (define @t14 () (tptp.axiom @t13)) % 1.21/1.58 (define @t15 () (not @t14)) % 1.21/1.58 (define @t16 () (tptp.theorem @t13)) % 1.21/1.58 (define @t17 () (or @t16 @t15)) % 1.21/1.58 (define @t18 () (@list false false)) % 1.21/1.58 (define @t19 () (tptp.not tptp.p)) % 1.21/1.58 (define @t20 () (tptp.or @t19 @t11)) % 1.21/1.58 (define @t21 () (tptp.or @t19 @t12)) % 1.21/1.58 (define @t22 () (tptp.implies @t21 @t20)) % 1.21/1.58 (define @t23 () (tptp.implies @t13 @t22)) % 1.21/1.58 (define @t24 () (tptp.axiom @t23)) % 1.21/1.58 (define @t25 () (not @t24)) % 1.21/1.58 (define @t26 () (tptp.theorem @t23)) % 1.21/1.58 (define @t27 () (or @t26 @t25)) % 1.21/1.58 (define @t28 () (tptp.implies tptp.p @t12)) % 1.21/1.58 (define @t29 () (tptp.axiom @t28)) % 1.21/1.58 (define @t30 () (not @t29)) % 1.21/1.58 (define @t31 () (tptp.theorem @t28)) % 1.21/1.58 (define @t32 () (or @t31 @t30)) % 1.21/1.58 (define @t33 () (tptp.theorem @t21)) % 1.21/1.58 (define @t34 () (tptp.theorem @t20)) % 1.21/1.58 (define @t35 () (not @t33)) % 1.21/1.58 (define @t36 () (tptp.theorem @t22)) % 1.21/1.58 (define @t37 () (not @t36)) % 1.21/1.58 (define @t38 () (or @t34 @t37 @t35)) % 1.21/1.58 (define @t39 () (not @t16)) % 1.21/1.58 (define @t40 () (not @t26)) % 1.21/1.58 (define @t41 () (or @t36 @t40 @t39)) % 1.21/1.58 (assume @p1 (forall (@list @t1) (tptp.axiom (tptp.implies (tptp.or @t1 @t1) @t1)))) % 1.21/1.58 (assume @p2 (forall @t4 (tptp.axiom (tptp.implies @t1 @t3)))) % 1.21/1.58 (assume @p3 (forall @t4 (tptp.axiom (tptp.implies (tptp.or @t1 @t2) @t3)))) % 1.21/1.58 (assume @p4 (forall @t6 (tptp.axiom (tptp.implies (tptp.or @t1 (tptp.or @t2 @t5)) (tptp.or @t2 (tptp.or @t1 @t5)))))) % 1.21/1.58 (assume @p5 (forall @t6 (tptp.axiom (tptp.implies (tptp.implies @t1 @t2) (tptp.implies (tptp.or @t5 @t1) (tptp.or @t5 @t2)))))) % 1.21/1.58 (assume @p6 (forall @t9 (= (tptp.implies @t8 @t7) (tptp.or (tptp.not @t8) @t7)))) % 1.21/1.58 (assume @p7 (forall (@list @t8) (or @t10 (not (tptp.axiom @t8))))) % 1.21/1.58 (assume @p8 (forall @t9 (or @t10 (not (tptp.theorem (tptp.implies @t7 @t8))) (not (tptp.theorem @t7))))) % 1.21/1.58 (assume @p9 (not (tptp.theorem (tptp.implies tptp.p @t11)))) % 1.21/1.58 (step @p10 :rule instantiate :premises (@p7) :args ((@list @t13))) % 1.21/1.58 (step @p11 :rule instantiate :premises (@p3) :args ((@list tptp.q tptp.p))) % 1.21/1.58 (step @p12 :rule cnf_or_pos :args (@t17)) % 1.21/1.58 (step @p13 :rule reordering :premises (@p12) :args ((or @t15 @t16 (not @t17)))) % 1.21/1.58 (step @p14 :rule chain_m_resolution :premises (@p13 @p11 @p10) :args (@t16 @t18 (@list @t14 @t17))) % 1.21/1.58 (step @p15 :rule instantiate :premises (@p8) :args ((@list @t22 @t13))) % 1.21/1.58 (step @p16 :rule instantiate :premises (@p7) :args ((@list @t23))) % 1.21/1.58 (step @p17 :rule instantiate :premises (@p5) :args ((@list @t12 @t11 @t19))) % 1.21/1.58 (step @p18 :rule cnf_or_pos :args (@t27)) % 1.21/1.58 (step @p19 :rule reordering :premises (@p18) :args ((or @t25 @t26 (not @t27)))) % 1.21/1.58 (step @p20 :rule chain_m_resolution :premises (@p19 @p17 @p16) :args (@t26 @t18 (@list @t24 @t27))) % 1.21/1.58 (step @p21 :rule instantiate :premises (@p8) :args ((@list @t20 @t21))) % 1.21/1.58 (step @p22 :rule instantiate :premises (@p7) :args ((@list @t28))) % 1.21/1.58 (step @p23 :rule instantiate :premises (@p2) :args ((@list tptp.p tptp.q))) % 1.21/1.58 (step @p24 :rule cnf_or_pos :args (@t32)) % 1.21/1.58 (step @p25 :rule reordering :premises (@p24) :args ((or @t30 @t31 (not @t32)))) % 1.21/1.58 (step @p26 :rule chain_m_resolution :premises (@p25 @p23 @p22) :args (@t31 @t18 (@list @t29 @t32))) % 1.21/1.58 (step @p27 :rule true_intro :premises (@p26)) % 1.21/1.58 (step @p28 :rule instantiate :premises (@p6) :args ((@list tptp.p @t12))) % 1.21/1.58 (step @p29 :rule symm :premises (@p28)) % 1.21/1.58 (step @p30 :rule cong :premises (@p29) :args (@t33)) % 1.21/1.58 (step @p31 :rule trans :premises (@p30 @p27)) % 1.21/1.58 (step @p32 :rule true_elim :premises (@p31)) % 1.21/1.58 (step @p33 :rule false_intro :premises (@p9)) % 1.21/1.58 (step @p34 :rule instantiate :premises (@p6) :args ((@list tptp.p @t11))) % 1.21/1.58 (step @p35 :rule symm :premises (@p34)) % 1.21/1.58 (step @p36 :rule cong :premises (@p35) :args (@t34)) % 1.21/1.58 (step @p37 :rule trans :premises (@p36 @p33)) % 1.21/1.58 (step @p38 :rule false_elim :premises (@p37)) % 1.21/1.58 (step @p39 :rule cnf_or_pos :args (@t38)) % 1.21/1.58 (step @p40 :rule reordering :premises (@p39) :args ((or @t34 @t35 @t37 (not @t38)))) % 1.21/1.58 (step @p41 :rule chain_m_resolution :premises (@p40 @p38 @p32 @p21) :args (@t37 (@list true false false) (@list @t34 @t33 @t38))) % 1.21/1.58 (step @p42 :rule cnf_or_pos :args (@t41)) % 1.21/1.58 (step @p43 :rule reordering :premises (@p42) :args ((or @t39 @t36 @t40 (not @t41)))) % 1.21/1.58 (step @p44 false :rule chain_m_resolution :premises (@p43 @p41 @p20 @p15 @p14) :args (false (@list true false false false) (@list @t36 @t26 @t41 @t16))) % 1.21/1.58 ) % 1.21/1.59 % SZS output end Proof % 1.21/1.59 % cvc5 exiting %------------------------------------------------------------------------------