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