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