%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL172-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 : n001.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:18 AM UTC 2026 % Result : Unsatisfiable 0.20s 0.51s % Output : Proof 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL172-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.11/0.37 % Computer : n001.cluster.edu % 0.11/0.37 % Model : x86_64 x86_64 % 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.37 % Memory : 8046.5625MB % 0.11/0.37 % OS : Linux 6.8.0-71-generic % 0.11/0.37 % CPULimit : 300 % 0.11/0.37 % WCLimit : 300 % 0.11/0.37 % DateTime : Sat Sep 5 13:32:31 UTC 2026 % 0.11/0.37 % CPUTime : % 0.11/0.45 %----Proving TF0_NAR, FOF, or CNF % 0.11/0.46 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.20/0.51 % SZS status Unsatisfiable % 0.20/0.51 % SZS output start Proof % 0.20/0.51 ( % 0.20/0.51 (declare-sort $$unsorted 0) % 0.20/0.51 (declare-const tptp.q $$unsorted) % 0.20/0.51 (declare-const tptp.r $$unsorted) % 0.20/0.51 (declare-const tptp.theorem (-> $$unsorted Bool)) % 0.20/0.51 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 0.20/0.51 (declare-const tptp.p $$unsorted) % 0.20/0.51 (declare-const tptp.axiom (-> $$unsorted Bool)) % 0.20/0.51 (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted)) % 0.20/0.51 (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted)) % 0.20/0.51 (define @t1 () (@var "A" $$unsorted)) % 0.20/0.51 (define @t2 () (@var "B" $$unsorted)) % 0.20/0.51 (define @t3 () (tptp.or @t2 @t1)) % 0.20/0.51 (define @t4 () (@list @t1 @t2)) % 0.20/0.51 (define @t5 () (@var "C" $$unsorted)) % 0.20/0.51 (define @t6 () (@list @t1 @t2 @t5)) % 0.20/0.51 (define @t7 () (@var "Y" $$unsorted)) % 0.20/0.51 (define @t8 () (@var "X" $$unsorted)) % 0.20/0.51 (define @t9 () (@list @t8 @t7)) % 0.20/0.51 (define @t10 () (tptp.theorem @t8)) % 0.20/0.51 (define @t11 () (tptp.implies tptp.p tptp.r)) % 0.20/0.51 (define @t12 () (tptp.implies tptp.q tptp.r)) % 0.20/0.51 (define @t13 () (tptp.implies (tptp.implies tptp.p @t12) (tptp.implies tptp.q @t11))) % 0.20/0.51 (define @t14 () (tptp.theorem @t13)) % 0.20/0.51 (define @t15 () (tptp.not tptp.q)) % 0.20/0.51 (define @t16 () (tptp.not tptp.p)) % 0.20/0.51 (define @t17 () (tptp.axiom @t13)) % 0.20/0.51 (define @t18 () (not @t17)) % 0.20/0.51 (define @t19 () (or @t14 @t18)) % 0.20/0.51 (assume @p1 (forall (@list @t1) (tptp.axiom (tptp.implies (tptp.or @t1 @t1) @t1)))) % 0.20/0.51 (assume @p2 (forall @t4 (tptp.axiom (tptp.implies @t1 @t3)))) % 0.20/0.51 (assume @p3 (forall @t4 (tptp.axiom (tptp.implies (tptp.or @t1 @t2) @t3)))) % 0.20/0.51 (assume @p4 (forall @t6 (tptp.axiom (tptp.implies (tptp.or @t1 (tptp.or @t2 @t5)) (tptp.or @t2 (tptp.or @t1 @t5)))))) % 0.20/0.51 (assume @p5 (forall @t6 (tptp.axiom (tptp.implies (tptp.implies @t1 @t2) (tptp.implies (tptp.or @t5 @t1) (tptp.or @t5 @t2)))))) % 0.20/0.51 (assume @p6 (forall @t9 (= (tptp.implies @t8 @t7) (tptp.or (tptp.not @t8) @t7)))) % 0.20/0.51 (assume @p7 (forall (@list @t8) (or @t10 (not (tptp.axiom @t8))))) % 0.20/0.51 (assume @p8 (forall @t9 (or @t10 (not (tptp.theorem (tptp.implies @t7 @t8))) (not (tptp.theorem @t7))))) % 0.20/0.51 (assume @p9 (not @t14)) % 0.20/0.51 (step @p10 :rule evaluate :args ((= false true))) % 0.20/0.51 (step @p11 :rule instantiate :premises (@p4) :args ((@list @t16 @t15 tptp.r))) % 0.20/0.51 (step @p12 :rule true_intro :premises (@p11)) % 0.20/0.51 (step @p13 :rule instantiate :premises (@p6) :args ((@list tptp.p tptp.r))) % 0.20/0.51 (step @p14 :rule refl :args (@t15)) % 0.20/0.51 (step @p15 :rule cong :premises (@p14 @p13) :args ((tptp.or @t15 @t11))) % 0.20/0.51 (step @p16 :rule instantiate :premises (@p6) :args ((@list tptp.q @t11))) % 0.20/0.51 (step @p17 :rule trans :premises (@p16 @p15)) % 0.20/0.51 (step @p18 :rule instantiate :premises (@p6) :args ((@list tptp.q tptp.r))) % 0.20/0.51 (step @p19 :rule refl :args (@t16)) % 0.20/0.51 (step @p20 :rule cong :premises (@p19 @p18) :args ((tptp.or @t16 @t12))) % 0.20/0.51 (step @p21 :rule instantiate :premises (@p6) :args ((@list tptp.p @t12))) % 0.20/0.51 (step @p22 :rule trans :premises (@p21 @p20)) % 0.20/0.51 (step @p23 :rule cong :premises (@p22 @p17) :args (@t13)) % 0.20/0.51 (step @p24 :rule cong :premises (@p23) :args (@t17)) % 0.20/0.51 (step @p25 :rule instantiate :premises (@p7) :args ((@list @t13))) % 0.20/0.51 (step @p26 :rule cnf_or_pos :args (@t19)) % 0.20/0.51 (step @p27 :rule reordering :premises (@p26) :args ((or @t14 @t18 (not @t19)))) % 0.20/0.51 (step @p28 :rule chain_m_resolution :premises (@p27 @p9 @p25) :args (@t18 (@list true false) (@list @t14 @t19))) % 0.20/0.51 (step @p29 :rule false_intro :premises (@p28)) % 0.20/0.51 (step @p30 :rule symm :premises (@p29)) % 0.20/0.51 (step @p31 :rule trans :premises (@p30 @p24 @p12)) % 0.20/0.51 (step @p32 false :rule eq_resolve :premises (@p31 @p10)) % 0.20/0.51 ) % 0.20/0.52 % SZS output end Proof % 0.20/0.52 % cvc5 exiting %------------------------------------------------------------------------------