%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : KRS171+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 : n027.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:29:03 AM UTC 2026 % Result : Theorem 0.30s 0.55s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS171+1 : TPTP v9.2.1. Released v3.1.0. % 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n027.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:28:36 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.55 % SZS status Theorem % 0.30/0.55 % SZS output start Proof % 0.30/0.55 ( % 0.30/0.55 (declare-sort $$unsorted 0) % 0.30/0.55 (declare-const tptp.rhasHead (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.xsd_string (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.xsd_integer (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.rhasLeader (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.cowlThing (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.cowlNothing (-> $$unsorted Bool)) % 0.30/0.55 (define @t1 () (@var "X" $$unsorted)) % 0.30/0.55 (define @t2 () (not (tptp.cowlNothing @t1))) % 0.30/0.55 (define @t3 () (tptp.cowlThing @t1)) % 0.30/0.55 (define @t4 () (@list @t1)) % 0.30/0.55 (define @t5 () (forall @t4 (and @t3 @t2))) % 0.30/0.55 (define @t6 () (forall @t4 (= (tptp.xsd_string @t1) (not (tptp.xsd_integer @t1))))) % 0.30/0.55 (define @t7 () (@var "Y" $$unsorted)) % 0.30/0.55 (define @t8 () (tptp.rhasLeader @t1 @t7)) % 0.30/0.55 (define @t9 () (tptp.rhasHead @t1 @t7)) % 0.30/0.55 (define @t10 () (@list @t1 @t7)) % 0.30/0.55 (define @t11 () (forall @t10 (=> @t9 @t8))) % 0.30/0.55 (define @t12 () (forall @t10 (=> @t8 @t9))) % 0.30/0.55 (define @t13 () (forall @t10 (= @t8 @t9))) % 0.30/0.55 (define @t14 () (and @t5 @t6 @t13)) % 0.30/0.55 (define @t15 () (not @t14)) % 0.30/0.55 (define @t16 () (forall @t4 @t2)) % 0.30/0.55 (define @t17 () (@list @t1)) % 0.30/0.55 (define @t18 () (@var "BOUND_VARIABLE_7444" $$unsorted)) % 0.30/0.55 (define @t19 () (forall @t4 @t3)) % 0.30/0.55 (define @t20 () (@var "BOUND_VARIABLE_7439" $$unsorted)) % 0.30/0.55 (define @t21 () (and @t19 @t16)) % 0.30/0.55 (define @t22 () (forall (@list @t18) (not (tptp.cowlNothing @t18)))) % 0.30/0.55 (define @t23 () (forall (@list @t20) (tptp.cowlThing @t20))) % 0.30/0.55 (define @t24 () (forall @t10 (= @t9 @t8))) % 0.30/0.55 (define @t25 () (not @t24)) % 0.30/0.55 (define @t26 () (@quantifiers_skolemize @t24 1)) % 0.30/0.55 (define @t27 () (@quantifiers_skolemize @t24 0)) % 0.30/0.55 (define @t28 () (tptp.rhasLeader @t27 @t26)) % 0.30/0.55 (define @t29 () (tptp.rhasHead @t27 @t26)) % 0.30/0.55 (define @t30 () (= @t29 @t28)) % 0.30/0.55 (define @t31 () (@list @t27 @t26)) % 0.30/0.55 (define @t32 () (not @t28)) % 0.30/0.55 (define @t33 () (or @t32 @t29)) % 0.30/0.55 (define @t34 () (@list true false)) % 0.30/0.55 (define @t35 () (not @t29)) % 0.30/0.55 (define @t36 () (or @t35 @t28)) % 0.30/0.55 (define @t37 () (not @t36)) % 0.30/0.55 (define @t38 () (forall @t10 (or (not @t9) @t8))) % 0.30/0.55 (assume @p1 @t5) % 0.30/0.55 (assume @p2 @t6) % 0.30/0.55 (assume @p3 @t11) % 0.30/0.55 (assume @p4 @t12) % 0.30/0.55 (assume @p5 @t15) % 0.30/0.55 (assume @p6 true) % 0.30/0.55 (step @p7 :rule bool-impl-elim :args (@t9 @t8)) % 0.30/0.55 (step @p8 :rule cong :premises (@p7) :args (@t11)) % 0.30/0.55 (step @p9 :rule eq_resolve :premises (@p3 @p8)) % 0.30/0.55 (step @p10 :rule alpha_equiv :args (@t16 @t17 (@list @t18))) % 0.30/0.55 (step @p11 :rule alpha_equiv :args (@t19 @t17 (@list @t20))) % 0.30/0.55 (step @p12 :rule nary_cong :premises (@p11 @p10) :args (@t21)) % 0.30/0.55 (step @p13 :rule quant-miniscope-and :args ((= @t5 @t21))) % 0.30/0.55 (step @p14 :rule trans :premises (@p13 @p12)) % 0.30/0.55 (step @p15 :rule eq_resolve :premises (@p1 @p14)) % 0.30/0.55 (step @p16 :rule and_elim :premises (@p15) :args (1)) % 0.30/0.55 (step @p17 :rule and_elim :premises (@p15) :args (0)) % 0.30/0.55 (step @p18 :rule aci_norm :args ((= (and (and @t23 @t22) @t6 @t24) (and @t6 @t24 @t23 @t22)))) % 0.30/0.55 (step @p19 :rule eq-symm :args (@t8 @t9)) % 0.30/0.55 (step @p20 :rule cong :premises (@p19) :args (@t13)) % 0.30/0.55 (step @p21 :rule refl :args (@t6)) % 0.30/0.55 (step @p22 :rule nary_cong :premises (@p14 @p21 @p20) :args (@t14)) % 0.30/0.55 (step @p23 :rule trans :premises (@p22 @p18)) % 0.30/0.55 (step @p24 :rule cong :premises (@p23) :args (@t15)) % 0.30/0.55 (step @p25 :rule eq_resolve :premises (@p5 @p24)) % 0.30/0.55 (step @p26 :rule not_and :premises (@p25)) % 0.30/0.55 (step @p27 :rule reordering :premises (@p26) :args ((or (not @t23) (not @t22) (not @t6) @t25))) % 0.30/0.55 (step @p28 :rule chain_m_resolution :premises (@p27 @p17 @p16 @p2) :args (@t25 (@list false false false) (@list @t23 @t22 @t6))) % 0.30/0.55 (step @p29 :rule skolemize :premises (@p28)) % 0.30/0.55 (step @p30 :rule cnf_equiv_neg1 :args (@t30)) % 0.30/0.55 (step @p31 :rule reordering :premises (@p30) :args ((or @t29 @t28 @t30))) % 0.30/0.55 (step @p32 :rule bool-impl-elim :args (@t8 @t9)) % 0.30/0.55 (step @p33 :rule cong :premises (@p32) :args (@t12)) % 0.30/0.55 (step @p34 :rule eq_resolve :premises (@p4 @p33)) % 0.30/0.55 (step @p35 :rule instantiate :premises (@p34) :args (@t31)) % 0.30/0.55 (step @p36 :rule cnf_or_pos :args (@t33)) % 0.30/0.55 (step @p37 :rule reordering :premises (@p36) :args ((or @t29 @t32 (not @t33)))) % 0.30/0.55 (step @p38 :rule chain_m_resolution :premises (@p37 @p35 @p31 @p29) :args (@t29 (@list false false true) (@list @t33 @t28 @t30))) % 0.30/0.55 (step @p39 :rule cnf_equiv_neg2 :args (@t30)) % 0.30/0.55 (step @p40 :rule chain_m_resolution :premises (@p39 @p29 @p38) :args (@t32 @t34 (@list @t30 @t29))) % 0.30/0.55 (step @p41 :rule cnf_or_pos :args (@t36)) % 0.30/0.55 (step @p42 :rule reordering :premises (@p41) :args ((or @t28 @t35 @t37))) % 0.30/0.55 (step @p43 :rule chain_m_resolution :premises (@p42 @p40 @p38) :args (@t37 @t34 (@list @t28 @t29))) % 0.30/0.55 (assume-push @p50 @t38) % 0.30/0.55 (step @p45 :rule instantiate :premises (@p9) :args (@t31)) % 0.30/0.55 (step-pop @p51 :rule scope :premises (@p45)) % 0.30/0.55 (step @p46 :rule process_scope :premises (@p51) :args (@t36)) % 0.30/0.55 (step @p48 :rule implies_elim :premises (@p46)) % 0.30/0.55 (step @p49 false :rule chain_m_resolution :premises (@p48 @p43 @p9) :args (false @t34 (@list @t36 @t38))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------