%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL321-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 : n006.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:38 AM UTC 2026 % Result : Unsatisfiable 0.21s 0.51s % Output : Proof 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL321-3 : TPTP v9.3.1. Released v2.3.0. % 0.00/0.05 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.12/0.37 % Computer : n006.cluster.edu % 0.12/0.37 % Model : x86_64 x86_64 % 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.37 % Memory : 8046.5625MB % 0.12/0.37 % OS : Linux 6.8.0-71-generic % 0.12/0.37 % CPULimit : 300 % 0.12/0.37 % WCLimit : 300 % 0.12/0.37 % DateTime : Fri Sep 4 22:34:16 UTC 2026 % 0.12/0.37 % CPUTime : % 0.12/0.44 %----Proving TF0_NAR, FOF, or CNF % 0.21/0.46 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.21/0.51 % SZS status Unsatisfiable % 0.21/0.51 % SZS output start Proof % 0.21/0.52 ( % 0.21/0.52 (declare-sort $$unsorted 0) % 0.21/0.52 (declare-const tptp.q $$unsorted) % 0.21/0.52 (declare-const tptp.theorem (-> $$unsorted Bool)) % 0.21/0.52 (declare-const tptp.not (-> $$unsorted $$unsorted)) % 0.21/0.52 (declare-const tptp.p $$unsorted) % 0.21/0.52 (declare-const tptp.axiom (-> $$unsorted Bool)) % 0.21/0.52 (declare-const tptp.implies (-> $$unsorted $$unsorted $$unsorted)) % 0.21/0.52 (declare-const tptp.or (-> $$unsorted $$unsorted $$unsorted)) % 0.21/0.52 (define @t1 () (@var "A" $$unsorted)) % 0.21/0.52 (define @t2 () (@var "B" $$unsorted)) % 0.21/0.52 (define @t3 () (tptp.or @t2 @t1)) % 0.21/0.52 (define @t4 () (@list @t1 @t2)) % 0.21/0.52 (define @t5 () (@var "C" $$unsorted)) % 0.21/0.52 (define @t6 () (@list @t1 @t2 @t5)) % 0.21/0.52 (define @t7 () (@var "Y" $$unsorted)) % 0.21/0.52 (define @t8 () (@var "X" $$unsorted)) % 0.21/0.52 (define @t9 () (@list @t8 @t7)) % 0.21/0.52 (define @t10 () (tptp.theorem @t8)) % 0.21/0.52 (define @t11 () (tptp.not tptp.q)) % 0.21/0.52 (define @t12 () (tptp.implies tptp.p tptp.q)) % 0.21/0.52 (define @t13 () (tptp.or @t11 @t12)) % 0.21/0.52 (define @t14 () (tptp.or @t12 @t11)) % 0.21/0.52 (define @t15 () (tptp.implies @t13 @t14)) % 0.21/0.52 (define @t16 () (tptp.axiom @t15)) % 0.21/0.52 (define @t17 () (not @t16)) % 0.21/0.52 (define @t18 () (tptp.theorem @t15)) % 0.21/0.52 (define @t19 () (or @t18 @t17)) % 0.21/0.52 (define @t20 () (@list false false)) % 0.21/0.52 (define @t21 () (tptp.not tptp.p)) % 0.21/0.52 (define @t22 () (tptp.or @t21 @t14)) % 0.21/0.52 (define @t23 () (tptp.implies @t14 @t22)) % 0.21/0.52 (define @t24 () (tptp.axiom @t23)) % 0.21/0.52 (define @t25 () (not @t24)) % 0.21/0.52 (define @t26 () (tptp.theorem @t23)) % 0.21/0.52 (define @t27 () (or @t26 @t25)) % 0.21/0.52 (define @t28 () (tptp.or @t12 (tptp.or @t21 @t11))) % 0.21/0.52 (define @t29 () (tptp.implies @t22 @t28)) % 0.21/0.52 (define @t30 () (tptp.axiom @t29)) % 0.21/0.52 (define @t31 () (not @t30)) % 0.21/0.52 (define @t32 () (tptp.theorem @t29)) % 0.21/0.52 (define @t33 () (or @t32 @t31)) % 0.21/0.52 (define @t34 () (tptp.theorem @t28)) % 0.21/0.52 (define @t35 () (tptp.theorem @t22)) % 0.21/0.52 (define @t36 () (not @t35)) % 0.21/0.52 (define @t37 () (not @t32)) % 0.21/0.52 (define @t38 () (or @t34 @t37 @t36)) % 0.21/0.52 (define @t39 () (@list true false false)) % 0.21/0.52 (define @t40 () (tptp.theorem @t14)) % 0.21/0.52 (define @t41 () (not @t40)) % 0.21/0.52 (define @t42 () (not @t26)) % 0.21/0.52 (define @t43 () (or @t35 @t42 @t41)) % 0.21/0.52 (define @t44 () (not (tptp.theorem @t13))) % 0.21/0.52 (define @t45 () (not @t18)) % 0.21/0.52 (define @t46 () (or @t40 @t45 @t44)) % 0.21/0.52 (define @t47 () (tptp.or @t21 tptp.q)) % 0.21/0.52 (define @t48 () (tptp.implies tptp.q @t47)) % 0.21/0.52 (define @t49 () (tptp.theorem @t48)) % 0.21/0.52 (define @t50 () (tptp.axiom @t48)) % 0.21/0.52 (define @t51 () (not @t50)) % 0.21/0.52 (define @t52 () (or @t49 @t51)) % 0.21/0.52 (assume @p1 (forall (@list @t1) (tptp.axiom (tptp.implies (tptp.or @t1 @t1) @t1)))) % 0.21/0.52 (assume @p2 (forall @t4 (tptp.axiom (tptp.implies @t1 @t3)))) % 0.21/0.52 (assume @p3 (forall @t4 (tptp.axiom (tptp.implies (tptp.or @t1 @t2) @t3)))) % 0.21/0.52 (assume @p4 (forall @t6 (tptp.axiom (tptp.implies (tptp.or @t1 (tptp.or @t2 @t5)) (tptp.or @t2 (tptp.or @t1 @t5)))))) % 0.21/0.52 (assume @p5 (forall @t6 (tptp.axiom (tptp.implies (tptp.implies @t1 @t2) (tptp.implies (tptp.or @t5 @t1) (tptp.or @t5 @t2)))))) % 0.21/0.52 (assume @p6 (forall @t9 (= (tptp.implies @t8 @t7) (tptp.or (tptp.not @t8) @t7)))) % 0.21/0.52 (assume @p7 (forall (@list @t8) (or @t10 (not (tptp.axiom @t8))))) % 0.21/0.52 (assume @p8 (forall @t9 (or @t10 (not (tptp.theorem (tptp.implies @t7 @t8))) (not (tptp.theorem @t7))))) % 0.21/0.52 (assume @p9 (not (tptp.theorem (tptp.or @t12 (tptp.implies tptp.p @t11))))) % 0.21/0.52 (step @p10 :rule evaluate :args ((= true false))) % 0.21/0.52 (step @p11 :rule instantiate :premises (@p8) :args ((@list @t14 @t13))) % 0.21/0.52 (step @p12 :rule instantiate :premises (@p7) :args ((@list @t15))) % 0.21/0.52 (step @p13 :rule instantiate :premises (@p3) :args ((@list @t11 @t12))) % 0.21/0.52 (step @p14 :rule cnf_or_pos :args (@t19)) % 0.21/0.52 (step @p15 :rule reordering :premises (@p14) :args ((or @t17 @t18 (not @t19)))) % 0.21/0.52 (step @p16 :rule chain_m_resolution :premises (@p15 @p13 @p12) :args (@t18 @t20 (@list @t16 @t19))) % 0.21/0.52 (step @p17 :rule instantiate :premises (@p8) :args ((@list @t22 @t14))) % 0.21/0.52 (step @p18 :rule instantiate :premises (@p7) :args ((@list @t23))) % 0.21/0.52 (step @p19 :rule instantiate :premises (@p2) :args ((@list @t14 @t21))) % 0.21/0.52 (step @p20 :rule cnf_or_pos :args (@t27)) % 0.21/0.52 (step @p21 :rule reordering :premises (@p20) :args ((or @t25 @t26 (not @t27)))) % 0.21/0.52 (step @p22 :rule chain_m_resolution :premises (@p21 @p19 @p18) :args (@t26 @t20 (@list @t24 @t27))) % 0.21/0.52 (step @p23 :rule instantiate :premises (@p8) :args ((@list @t28 @t22))) % 0.21/0.52 (step @p24 :rule instantiate :premises (@p7) :args ((@list @t29))) % 0.21/0.52 (step @p25 :rule instantiate :premises (@p4) :args ((@list @t21 @t12 @t11))) % 0.21/0.52 (step @p26 :rule cnf_or_pos :args (@t33)) % 0.21/0.52 (step @p27 :rule reordering :premises (@p26) :args ((or @t31 @t32 (not @t33)))) % 0.21/0.52 (step @p28 :rule chain_m_resolution :premises (@p27 @p25 @p24) :args (@t32 @t20 (@list @t30 @t33))) % 0.21/0.52 (step @p29 :rule false_intro :premises (@p9)) % 0.21/0.52 (step @p30 :rule instantiate :premises (@p6) :args ((@list tptp.p @t11))) % 0.21/0.52 (step @p31 :rule symm :premises (@p30)) % 0.21/0.52 (step @p32 :rule refl :args (@t12)) % 0.21/0.52 (step @p33 :rule cong :premises (@p32 @p31) :args (@t28)) % 0.21/0.52 (step @p34 :rule cong :premises (@p33) :args (@t34)) % 0.21/0.52 (step @p35 :rule trans :premises (@p34 @p29)) % 0.21/0.52 (step @p36 :rule false_elim :premises (@p35)) % 0.21/0.52 (step @p37 :rule cnf_or_pos :args (@t38)) % 0.21/0.52 (step @p38 :rule reordering :premises (@p37) :args ((or @t34 @t37 @t36 (not @t38)))) % 0.21/0.52 (step @p39 :rule chain_m_resolution :premises (@p38 @p36 @p28 @p23) :args (@t36 @t39 (@list @t34 @t32 @t38))) % 0.21/0.52 (step @p40 :rule cnf_or_pos :args (@t43)) % 0.21/0.52 (step @p41 :rule reordering :premises (@p40) :args ((or @t35 @t42 @t41 (not @t43)))) % 0.21/0.52 (step @p42 :rule chain_m_resolution :premises (@p41 @p39 @p22 @p17) :args (@t41 @t39 (@list @t35 @t26 @t43))) % 0.21/0.52 (step @p43 :rule cnf_or_pos :args (@t46)) % 0.21/0.52 (step @p44 :rule reordering :premises (@p43) :args ((or @t40 @t45 @t44 (not @t46)))) % 0.21/0.52 (step @p45 :rule chain_m_resolution :premises (@p44 @p42 @p16 @p11) :args (@t44 @t39 (@list @t40 @t18 @t46))) % 0.21/0.52 (step @p46 :rule false_intro :premises (@p45)) % 0.21/0.52 (step @p47 :rule instantiate :premises (@p6) :args ((@list tptp.p tptp.q))) % 0.21/0.52 (step @p48 :rule symm :premises (@p47)) % 0.21/0.52 (step @p49 :rule refl :args (@t11)) % 0.21/0.52 (step @p50 :rule cong :premises (@p49 @p48) :args ((tptp.or @t11 @t47))) % 0.21/0.52 (step @p51 :rule instantiate :premises (@p6) :args ((@list tptp.q @t47))) % 0.21/0.52 (step @p52 :rule trans :premises (@p51 @p50)) % 0.21/0.52 (step @p53 :rule cong :premises (@p52) :args (@t49)) % 0.21/0.52 (step @p54 :rule instantiate :premises (@p7) :args ((@list @t48))) % 0.21/0.52 (step @p55 :rule instantiate :premises (@p2) :args ((@list tptp.q @t21))) % 0.21/0.52 (step @p56 :rule cnf_or_pos :args (@t52)) % 0.21/0.52 (step @p57 :rule reordering :premises (@p56) :args ((or @t51 @t49 (not @t52)))) % 0.21/0.52 (step @p58 :rule chain_m_resolution :premises (@p57 @p55 @p54) :args (@t49 @t20 (@list @t50 @t52))) % 0.21/0.52 (step @p59 :rule true_intro :premises (@p58)) % 0.21/0.52 (step @p60 :rule symm :premises (@p59)) % 0.21/0.52 (step @p61 :rule trans :premises (@p60 @p53 @p46)) % 0.21/0.52 (step @p62 false :rule eq_resolve :premises (@p61 @p10)) % 0.21/0.52 ) % 0.21/0.52 % SZS output end Proof % 0.21/0.52 % cvc5 exiting %------------------------------------------------------------------------------