%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL046-1 : TPTP v9.3.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n027.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:05 AM UTC 2026 % Result : Unsatisfiable 1.14s 1.49s % Output : Proof 1.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL046-1 : TPTP v9.3.1. Released v1.0.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 : n027.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 22:39:43 UTC 2026 % 0.11/0.37 % CPUTime : % 0.11/0.43 %----Proving TF0_NAR, FOF, or CNF % 0.11/0.45 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 1.14/1.49 % SZS status Unsatisfiable % 1.14/1.49 % SZS output start Proof % 1.14/1.49 ( % 1.14/1.49 (declare-sort $$unsorted 0) % 1.14/1.49 (declare-const tptp.a $$unsorted) % 1.14/1.49 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 1.14/1.49 (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted)) % 1.14/1.49 (declare-const tptp.is_a_theorem (-> $$unsorted Bool)) % 1.14/1.49 (define @t1 () (@var "Y" $$unsorted)) % 1.14/1.49 (define @t2 () (@var "X" $$unsorted)) % 1.14/1.49 (define @t3 () (tptp.implies @t2 @t1)) % 1.14/1.49 (define @t4 () (@list @t2 @t1)) % 1.14/1.49 (define @t5 () (forall @t4 (or (not (tptp.is_a_theorem @t3)) (not (tptp.is_a_theorem @t2)) (tptp.is_a_theorem @t1)))) % 1.14/1.49 (define @t6 () (@var "Z" $$unsorted)) % 1.14/1.49 (define @t7 () (tptp.not @t2)) % 1.14/1.49 (define @t8 () (tptp.implies tptp.a tptp.a)) % 1.14/1.49 (define @t9 () (tptp.is_a_theorem @t8)) % 1.14/1.49 (define @t10 () (tptp.implies (tptp.not tptp.a) tptp.a)) % 1.14/1.49 (define @t11 () (tptp.implies @t10 tptp.a)) % 1.14/1.49 (define @t12 () (tptp.is_a_theorem @t11)) % 1.14/1.49 (define @t13 () (not @t12)) % 1.14/1.49 (define @t14 () (tptp.implies @t11 @t8)) % 1.14/1.49 (define @t15 () (tptp.is_a_theorem @t14)) % 1.14/1.49 (define @t16 () (not @t15)) % 1.14/1.49 (define @t17 () (or @t16 @t13 @t9)) % 1.14/1.49 (define @t18 () (tptp.implies tptp.a @t10)) % 1.14/1.49 (define @t19 () (tptp.is_a_theorem @t18)) % 1.14/1.49 (define @t20 () (not @t19)) % 1.14/1.49 (define @t21 () (tptp.is_a_theorem (tptp.implies @t18 @t14))) % 1.14/1.49 (define @t22 () (not @t21)) % 1.14/1.49 (define @t23 () (or @t22 @t20 @t15)) % 1.14/1.49 (define @t24 () (not @t23)) % 1.14/1.49 (assume @p1 @t5) % 1.14/1.49 (assume @p2 (forall (@list @t2 @t1 @t6) (tptp.is_a_theorem (tptp.implies @t3 (tptp.implies (tptp.implies @t1 @t6) (tptp.implies @t2 @t6)))))) % 1.14/1.49 (assume @p3 (forall (@list @t2) (tptp.is_a_theorem (tptp.implies (tptp.implies @t7 @t2) @t2)))) % 1.14/1.49 (assume @p4 (forall @t4 (tptp.is_a_theorem (tptp.implies @t2 (tptp.implies @t7 @t1))))) % 1.14/1.49 (assume @p5 (not @t9)) % 1.14/1.49 (step @p6 :rule instantiate :premises (@p2) :args ((@list tptp.a @t10 tptp.a))) % 1.14/1.49 (step @p7 :rule instantiate :premises (@p1) :args ((@list @t11 @t8))) % 1.14/1.49 (step @p8 :rule instantiate :premises (@p3) :args ((@list tptp.a))) % 1.14/1.49 (step @p9 :rule cnf_or_pos :args (@t17)) % 1.14/1.49 (step @p10 :rule reordering :premises (@p9) :args ((or @t9 @t13 @t16 (not @t17)))) % 1.14/1.49 (step @p11 :rule chain_m_resolution :premises (@p10 @p5 @p8 @p7) :args (@t16 (@list true false false) (@list @t9 @t12 @t17))) % 1.14/1.49 (step @p12 :rule instantiate :premises (@p4) :args ((@list tptp.a tptp.a))) % 1.14/1.49 (step @p13 :rule cnf_or_pos :args (@t23)) % 1.14/1.49 (step @p14 :rule reordering :premises (@p13) :args ((or @t20 @t15 @t22 @t24))) % 1.14/1.49 (step @p15 :rule chain_m_resolution :premises (@p14 @p12 @p11 @p6) :args (@t24 (@list false true false) (@list @t19 @t15 @t21))) % 1.14/1.49 (assume-push @p22 @t5) % 1.14/1.49 (step @p17 :rule instantiate :premises (@p1) :args ((@list @t18 @t14))) % 1.14/1.49 (step-pop @p23 :rule scope :premises (@p17)) % 1.14/1.49 (step @p18 :rule process_scope :premises (@p23) :args (@t23)) % 1.14/1.49 (step @p20 :rule implies_elim :premises (@p18)) % 1.14/1.49 (step @p21 false :rule chain_m_resolution :premises (@p20 @p15 @p1) :args (false (@list true false) (@list @t23 @t5))) % 1.14/1.49 ) % 1.14/1.49 % SZS output end Proof % 1.14/1.49 % cvc5 exiting %------------------------------------------------------------------------------