%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL192-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 : n019.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 34.99s 36.29s % Output : Proof 33.26s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL192-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.36 % Computer : n019.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 03:35:38 UTC 2026 % 0.13/0.36 % CPUTime : % 0.13/0.42 %----Proving TF0_NAR, FOF, or CNF % 0.13/0.44 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.18/15.61 --- Run --no-e-matching --full-saturate-quant at 6... % 21.19/21.95 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 6... % 27.21/28.29 --- Run --finite-model-find --uf-ss=no-minimal at 6... % 33.23/34.45 --- Run --multi-trigger-when-single --full-saturate-quant at 30... % 34.99/36.29 % SZS status Unsatisfiable % 34.99/36.29 % SZS output start Proof % 34.99/36.29 ( % 34.99/36.29 (declare-sort $$unsorted 0) % 34.99/36.29 (declare-const tptp.q $$unsorted) % 34.99/36.29 (declare-const tptp.r $$unsorted) % 34.99/36.29 (declare-const tptp.theorem (-> $$unsorted Bool)) % 34.99/36.29 (declare-const tptp.p $$unsorted) % 34.99/36.29 (declare-const tptp.axiom (-> $$unsorted Bool)) % 34.99/36.29 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 34.99/36.29 (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted)) % 34.99/36.29 (define @t1 () (@var "A" $$unsorted)) % 34.99/36.29 (define @t2 () (@var "B" $$unsorted)) % 34.99/36.29 (define @t3 () (tptp.or @t2 @t1)) % 34.99/36.29 (define @t4 () (tptp.not @t1)) % 34.99/36.29 (define @t5 () (@list @t1 @t2)) % 34.99/36.29 (define @t6 () (@var "C" $$unsorted)) % 34.99/36.29 (define @t7 () (@list @t1 @t2 @t6)) % 34.99/36.29 (define @t8 () (@var "X" $$unsorted)) % 34.99/36.29 (define @t9 () (tptp.theorem @t8)) % 34.99/36.29 (define @t10 () (@var "Y" $$unsorted)) % 34.99/36.29 (define @t11 () (tptp.not @t10)) % 34.99/36.29 (define @t12 () (forall (@list @t8 @t10) (or @t9 (not (tptp.axiom (tptp.or @t11 @t8))) (not (tptp.theorem @t10))))) % 34.99/36.29 (define @t13 () (@var "Z" $$unsorted)) % 34.99/36.29 (define @t14 () (tptp.not @t8)) % 34.99/36.29 (define @t15 () (tptp.or tptp.q tptp.r)) % 34.99/36.29 (define @t16 () (tptp.or tptp.p @t15)) % 34.99/36.29 (define @t17 () (tptp.or tptp.p tptp.q)) % 34.99/36.29 (define @t18 () (tptp.or @t17 tptp.r)) % 34.99/36.29 (define @t19 () (tptp.not @t18)) % 34.99/36.29 (define @t20 () (tptp.theorem (tptp.or @t19 @t16))) % 34.99/36.29 (define @t21 () (tptp.or tptp.r tptp.q)) % 34.99/36.29 (define @t22 () (tptp.or (tptp.not @t21) @t15)) % 34.99/36.29 (define @t23 () (tptp.axiom @t22)) % 34.99/36.29 (define @t24 () (not @t23)) % 34.99/36.29 (define @t25 () (tptp.theorem @t22)) % 34.99/36.29 (define @t26 () (or @t25 @t24)) % 34.99/36.29 (define @t27 () (tptp.or tptp.p @t21)) % 34.99/36.29 (define @t28 () (tptp.or tptp.r @t17)) % 34.99/36.29 (define @t29 () (tptp.not @t28)) % 34.99/36.29 (define @t30 () (tptp.theorem (tptp.or @t29 @t16))) % 34.99/36.29 (define @t31 () (not @t30)) % 34.99/36.29 (define @t32 () (tptp.axiom (tptp.or @t19 @t28))) % 34.99/36.29 (define @t33 () (not @t32)) % 34.99/36.29 (define @t34 () (or @t20 @t33 @t31)) % 34.99/36.29 (define @t35 () (@list true false false)) % 34.99/36.29 (define @t36 () (tptp.or (tptp.not @t27) @t16)) % 34.99/36.29 (define @t37 () (tptp.theorem @t36)) % 34.99/36.29 (define @t38 () (not @t37)) % 34.99/36.29 (define @t39 () (tptp.axiom (tptp.or @t29 @t27))) % 34.99/36.29 (define @t40 () (not @t39)) % 34.99/36.29 (define @t41 () (or @t30 @t40 @t38)) % 34.99/36.29 (define @t42 () (not @t25)) % 34.99/36.29 (define @t43 () (tptp.axiom (tptp.or (tptp.not @t22) @t36))) % 34.99/36.29 (define @t44 () (not @t43)) % 34.99/36.29 (define @t45 () (or @t37 @t44 @t42)) % 34.99/36.29 (define @t46 () (not @t45)) % 34.99/36.29 (assume @p1 (forall (@list @t1) (tptp.axiom (tptp.or (tptp.not (tptp.or @t1 @t1)) @t1)))) % 34.99/36.29 (assume @p2 (forall @t5 (tptp.axiom (tptp.or @t4 @t3)))) % 34.99/36.29 (assume @p3 (forall @t5 (tptp.axiom (tptp.or (tptp.not (tptp.or @t1 @t2)) @t3)))) % 34.99/36.29 (assume @p4 (forall @t7 (tptp.axiom (tptp.or (tptp.not (tptp.or @t1 (tptp.or @t2 @t6))) (tptp.or @t2 (tptp.or @t1 @t6)))))) % 34.99/36.29 (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)))))) % 34.99/36.29 (assume @p6 (forall (@list @t8) (or @t9 (not (tptp.axiom @t8))))) % 34.99/36.29 (assume @p7 @t12) % 34.99/36.29 (assume @p8 (forall (@list @t8 @t13 @t10) (or (tptp.theorem (tptp.or @t14 @t13)) (not (tptp.axiom (tptp.or @t14 @t10))) (not (tptp.theorem (tptp.or @t11 @t13)))))) % 34.99/36.29 (assume @p9 (not @t20)) % 34.99/36.29 (step @p10 :rule instantiate :premises (@p6) :args ((@list @t22))) % 34.99/36.29 (step @p11 :rule instantiate :premises (@p3) :args ((@list tptp.r tptp.q))) % 34.99/36.29 (step @p12 :rule cnf_or_pos :args (@t26)) % 34.99/36.29 (step @p13 :rule reordering :premises (@p12) :args ((or @t24 @t25 (not @t26)))) % 34.99/36.29 (step @p14 :rule chain_m_resolution :premises (@p13 @p11 @p10) :args (@t25 (@list false false) (@list @t23 @t26))) % 34.99/36.29 (step @p15 :rule instantiate :premises (@p5) :args ((@list @t21 @t15 tptp.p))) % 34.99/36.29 (step @p16 :rule instantiate :premises (@p8) :args ((@list @t28 @t16 @t27))) % 34.99/36.29 (step @p17 :rule instantiate :premises (@p4) :args ((@list tptp.r tptp.p tptp.q))) % 34.99/36.29 (step @p18 :rule instantiate :premises (@p8) :args ((@list @t18 @t16 @t28))) % 34.99/36.29 (step @p19 :rule instantiate :premises (@p3) :args ((@list @t17 tptp.r))) % 34.99/36.29 (step @p20 :rule cnf_or_pos :args (@t34)) % 34.99/36.29 (step @p21 :rule reordering :premises (@p20) :args ((or @t20 @t33 @t31 (not @t34)))) % 34.99/36.29 (step @p22 :rule chain_m_resolution :premises (@p21 @p9 @p19 @p18) :args (@t31 @t35 (@list @t20 @t32 @t34))) % 34.99/36.29 (step @p23 :rule cnf_or_pos :args (@t41)) % 34.99/36.29 (step @p24 :rule reordering :premises (@p23) :args ((or @t30 @t40 @t38 (not @t41)))) % 34.99/36.29 (step @p25 :rule chain_m_resolution :premises (@p24 @p22 @p17 @p16) :args (@t38 @t35 (@list @t30 @t39 @t41))) % 34.99/36.29 (step @p26 :rule cnf_or_pos :args (@t45)) % 34.99/36.29 (step @p27 :rule reordering :premises (@p26) :args ((or @t37 @t44 @t42 @t46))) % 34.99/36.29 (step @p28 :rule chain_m_resolution :premises (@p27 @p25 @p15 @p14) :args (@t46 @t35 (@list @t37 @t43 @t25))) % 34.99/36.29 (assume-push @p35 @t12) % 34.99/36.29 (step @p30 :rule instantiate :premises (@p7) :args ((@list @t36 @t22))) % 34.99/36.29 (step-pop @p36 :rule scope :premises (@p30)) % 34.99/36.29 (step @p31 :rule process_scope :premises (@p36) :args (@t45)) % 34.99/36.29 (step @p33 :rule implies_elim :premises (@p31)) % 34.99/36.29 (step @p34 false :rule chain_m_resolution :premises (@p33 @p28 @p7) :args (false (@list true false) (@list @t45 @t12))) % 34.99/36.29 ) % 33.26/36.30 % SZS output end Proof % 33.26/36.30 % cvc5 exiting %------------------------------------------------------------------------------