%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : KRS135+1 : TPTP v9.2.1. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n010.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Jun 3 08:28:59 AM UTC 2026 % Result : Theorem 0.30s 0.56s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS135+1 : TPTP v9.2.1. Released v3.1.0. % 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n010.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 05:27:55 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.56 % SZS status Theorem % 0.30/0.56 % SZS output start Proof % 0.30/0.56 ( % 0.30/0.56 (declare-sort $$unsorted 0) % 0.30/0.56 (declare-const tptp.rprop (-> $$unsorted $$unsorted Bool)) % 0.30/0.56 (declare-const tptp.xsd_string (-> $$unsorted Bool)) % 0.30/0.56 (declare-const tptp.xsd_integer (-> $$unsorted Bool)) % 0.30/0.56 (declare-const tptp.cA (-> $$unsorted Bool)) % 0.30/0.56 (declare-const tptp.cowlThing (-> $$unsorted Bool)) % 0.30/0.56 (declare-const tptp.cowlNothing (-> $$unsorted Bool)) % 0.30/0.56 (define @t1 () (@var "X" $$unsorted)) % 0.30/0.56 (define @t2 () (not (tptp.cowlNothing @t1))) % 0.30/0.56 (define @t3 () (tptp.cowlThing @t1)) % 0.30/0.56 (define @t4 () (@list @t1)) % 0.30/0.56 (define @t5 () (forall @t4 (and @t3 @t2))) % 0.30/0.56 (define @t6 () (forall @t4 (= (tptp.xsd_string @t1) (not (tptp.xsd_integer @t1))))) % 0.30/0.56 (define @t7 () (@var "Y" $$unsorted)) % 0.30/0.56 (define @t8 () (tptp.cA @t7)) % 0.30/0.56 (define @t9 () (tptp.rprop @t1 @t7)) % 0.30/0.56 (define @t10 () (=> @t9 @t8)) % 0.30/0.56 (define @t11 () (@list @t7)) % 0.30/0.56 (define @t12 () (forall @t11 @t10)) % 0.30/0.56 (define @t13 () (=> @t3 @t12)) % 0.30/0.56 (define @t14 () (forall @t4 @t13)) % 0.30/0.56 (define @t15 () (@list @t1 @t7)) % 0.30/0.56 (define @t16 () (forall @t15 @t10)) % 0.30/0.56 (define @t17 () (and @t5 @t6 @t16)) % 0.30/0.56 (define @t18 () (not @t17)) % 0.30/0.56 (define @t19 () (forall @t4 @t2)) % 0.30/0.56 (define @t20 () (@list @t1)) % 0.30/0.56 (define @t21 () (@var "BOUND_VARIABLE_7444" $$unsorted)) % 0.30/0.56 (define @t22 () (forall @t4 @t3)) % 0.30/0.56 (define @t23 () (@var "BOUND_VARIABLE_7439" $$unsorted)) % 0.30/0.56 (define @t24 () (and @t22 @t19)) % 0.30/0.56 (define @t25 () (@var "BOUND_VARIABLE_7460" $$unsorted)) % 0.30/0.56 (define @t26 () (tptp.cA @t25)) % 0.30/0.56 (define @t27 () (not (tptp.rprop @t1 @t25))) % 0.30/0.56 (define @t28 () (not @t3)) % 0.30/0.56 (define @t29 () (or @t27 @t26)) % 0.30/0.56 (define @t30 () (or @t28 @t29)) % 0.30/0.56 (define @t31 () (forall (@list @t1 @t25) @t30)) % 0.30/0.56 (define @t32 () (@list @t25)) % 0.30/0.56 (define @t33 () (forall @t32 @t30)) % 0.30/0.56 (define @t34 () (forall @t32 @t29)) % 0.30/0.56 (define @t35 () (or @t28 @t34)) % 0.30/0.56 (define @t36 () (or (not @t9) @t8)) % 0.30/0.56 (define @t37 () (forall @t11 @t36)) % 0.30/0.56 (define @t38 () (forall @t15 @t36)) % 0.30/0.56 (define @t39 () (@quantifiers_skolemize @t38 1)) % 0.30/0.56 (define @t40 () (@quantifiers_skolemize @t38 0)) % 0.30/0.56 (define @t41 () (forall (@list @t21) (not (tptp.cowlNothing @t21)))) % 0.30/0.56 (define @t42 () (forall (@list @t23) (tptp.cowlThing @t23))) % 0.30/0.56 (define @t43 () (not @t38)) % 0.30/0.56 (define @t44 () (tptp.cA @t39)) % 0.30/0.56 (define @t45 () (tptp.rprop @t40 @t39)) % 0.30/0.56 (define @t46 () (not @t45)) % 0.30/0.56 (define @t47 () (or @t46 @t44)) % 0.30/0.56 (define @t48 () (@list true)) % 0.30/0.56 (define @t49 () (@list @t47)) % 0.30/0.56 (define @t50 () (tptp.cowlThing @t40)) % 0.30/0.56 (define @t51 () (not @t50)) % 0.30/0.56 (define @t52 () (or @t51 @t46 @t44)) % 0.30/0.56 (assume @p1 @t5) % 0.30/0.56 (assume @p2 @t6) % 0.30/0.56 (assume @p3 @t14) % 0.30/0.56 (assume @p4 @t18) % 0.30/0.56 (assume @p5 true) % 0.30/0.56 (step @p6 :rule alpha_equiv :args (@t19 @t20 (@list @t21))) % 0.30/0.56 (step @p7 :rule alpha_equiv :args (@t22 @t20 (@list @t23))) % 0.30/0.56 (step @p8 :rule nary_cong :premises (@p7 @p6) :args (@t24)) % 0.30/0.56 (step @p9 :rule quant-miniscope-and :args ((= @t5 @t24))) % 0.30/0.56 (step @p10 :rule trans :premises (@p9 @p8)) % 0.30/0.56 (step @p11 :rule eq_resolve :premises (@p1 @p10)) % 0.30/0.56 (step @p12 :rule and_elim :premises (@p11) :args (0)) % 0.30/0.56 (step @p13 :rule aci_norm :args ((= @t30 (or @t28 @t27 @t26)))) % 0.30/0.56 (step @p14 :rule cong :premises (@p13) :args (@t31)) % 0.30/0.56 (step @p15 :rule quant-merge-prenex :args ((= (forall @t4 @t33) @t31))) % 0.30/0.56 (step @p16 :rule alpha_equiv :args (@t34 (@list @t25) (@list @t7))) % 0.30/0.56 (step @p17 :rule refl :args (@t28)) % 0.30/0.56 (step @p18 :rule nary_cong :premises (@p17 @p16) :args (@t35)) % 0.30/0.56 (step @p19 :rule quant-miniscope-or :args ((= @t33 @t35))) % 0.30/0.56 (step @p20 :rule trans :premises (@p19 @p18)) % 0.30/0.56 (step @p21 :rule symm :premises (@p20)) % 0.30/0.56 (step @p22 :rule cong :premises (@p21) :args ((forall @t4 (or @t28 @t37)))) % 0.30/0.56 (step @p23 :rule trans :premises (@p22 @p15)) % 0.30/0.56 (step @p24 :rule trans :premises (@p23 @p14)) % 0.30/0.56 (step @p25 :rule bool-impl-elim :args (@t3 @t37)) % 0.30/0.56 (step @p26 :rule cong :premises (@p25) :args ((forall @t4 (=> @t3 @t37)))) % 0.30/0.56 (step @p27 :rule trans :premises (@p26 @p24)) % 0.30/0.56 (step @p28 :rule bool-impl-elim :args (@t9 @t8)) % 0.30/0.56 (step @p29 :rule cong :premises (@p28) :args (@t12)) % 0.30/0.56 (step @p30 :rule refl :args (@t3)) % 0.30/0.56 (step @p31 :rule cong :premises (@p30 @p29) :args (@t13)) % 0.30/0.56 (step @p32 :rule cong :premises (@p31) :args (@t14)) % 0.30/0.56 (step @p33 :rule trans :premises (@p32 @p27)) % 0.30/0.56 (step @p34 :rule eq_resolve :premises (@p3 @p33)) % 0.30/0.56 (step @p35 :rule instantiate :premises (@p34) :args ((@list @t40 @t39))) % 0.30/0.56 (step @p36 :rule and_elim :premises (@p11) :args (1)) % 0.30/0.56 (step @p37 :rule aci_norm :args ((= (and (and @t42 @t41) @t6 @t38) (and @t6 @t38 @t42 @t41)))) % 0.30/0.56 (step @p38 :rule cong :premises (@p28) :args (@t16)) % 0.30/0.56 (step @p39 :rule refl :args (@t6)) % 0.30/0.56 (step @p40 :rule nary_cong :premises (@p10 @p39 @p38) :args (@t17)) % 0.30/0.56 (step @p41 :rule trans :premises (@p40 @p37)) % 0.30/0.56 (step @p42 :rule cong :premises (@p41) :args (@t18)) % 0.30/0.56 (step @p43 :rule eq_resolve :premises (@p4 @p42)) % 0.30/0.56 (step @p44 :rule not_and :premises (@p43)) % 0.30/0.56 (step @p45 :rule reordering :premises (@p44) :args ((or (not @t42) (not @t41) (not @t6) @t43))) % 0.30/0.56 (step @p46 :rule chain_m_resolution :premises (@p45 @p12 @p36 @p2) :args (@t43 (@list false false false) (@list @t42 @t41 @t6))) % 0.30/0.56 (step @p47 :rule skolemize :premises (@p46)) % 0.30/0.56 (step @p48 :rule cnf_or_neg :args (@t47 1)) % 0.30/0.56 (step @p49 :rule chain_m_resolution :premises (@p48 @p47) :args ((not @t44) @t48 @t49)) % 0.30/0.56 (step @p50 :rule bool-double-not-elim :args (@t45)) % 0.30/0.56 (step @p51 :rule refl :args (@t47)) % 0.30/0.56 (step @p52 :rule nary_cong :premises (@p51 @p50) :args ((or @t47 (not @t46)))) % 0.30/0.56 (step @p53 :rule cnf_or_neg :args (@t47 0)) % 0.30/0.56 (step @p54 :rule eq_resolve :premises (@p53 @p52)) % 0.30/0.56 (step @p55 :rule reordering :premises (@p54) :args ((or @t45 @t47))) % 0.30/0.56 (step @p56 :rule chain_m_resolution :premises (@p55 @p47) :args (@t45 @t48 @t49)) % 0.30/0.56 (step @p57 :rule cnf_or_pos :args (@t52)) % 0.30/0.56 (step @p58 :rule reordering :premises (@p57) :args ((or @t46 @t44 @t51 (not @t52)))) % 0.30/0.56 (step @p59 :rule chain_m_resolution :premises (@p58 @p56 @p49 @p35) :args (@t51 (@list false true false) (@list @t45 @t44 @t52))) % 0.30/0.56 (assume-push @p66 @t42) % 0.30/0.56 (step @p61 :rule instantiate :premises (@p12) :args ((@list @t40))) % 0.30/0.56 (step-pop @p67 :rule scope :premises (@p61)) % 0.30/0.56 (step @p62 :rule process_scope :premises (@p67) :args (@t50)) % 0.30/0.56 (step @p64 :rule implies_elim :premises (@p62)) % 0.30/0.56 (step @p65 false :rule chain_m_resolution :premises (@p64 @p59 @p12) :args (false (@list true false) (@list @t50 @t42))) % 0.30/0.56 ) % 0.30/0.56 % SZS output end Proof % 0.30/0.56 % cvc5 exiting %------------------------------------------------------------------------------