TSTP Solution File: KRS265+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : KRS265+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n002.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 : Thu Aug 31 05:41:58 EDT 2023
% Result : Theorem 22.74s 23.08s
% Output : Proof 22.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS265+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.11/0.13 % Command : do_cvc5 %s %d
% 0.13/0.32 % Computer : n002.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon Aug 28 02:30:19 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.17/0.46 %----Proving TF0_NAR, FOF, or CNF
% 22.74/23.08 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.GRrtTaK6Oc/cvc5---1.0.5_16041.p...
% 22.74/23.08 ------- get file name : TPTP file name is KRS265+1
% 22.74/23.08 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_16041.smt2...
% 22.74/23.08 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 22.74/23.08 --- Run --no-e-matching --full-saturate-quant at 5...
% 22.74/23.08 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 22.74/23.08 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 22.74/23.08 % SZS status Theorem for KRS265+1
% 22.74/23.08 % SZS output start Proof for KRS265+1
% 22.74/23.08 (
% 22.74/23.08 (let ((_let_1 (tptp.mighta tptp.cax tptp.thm))) (let ((_let_2 (not _let_1))) (let ((_let_3 (exists ((F $$unsorted)) (forall ((I $$unsorted)) (not (tptp.model I F)))))) (let ((_let_4 (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (exists ((Ax $$unsorted) (C $$unsorted)) (and (tptp.status Ax C S1) (tptp.status Ax C S2))) (tptp.mighta S1 S2))))) (let ((_let_5 (forall ((Ax $$unsorted) (C $$unsorted)) (= (not (exists ((I1 $$unsorted)) (tptp.model I1 Ax))) (tptp.status Ax C tptp.cax))))) (let ((_let_6 (forall ((Ax $$unsorted) (C $$unsorted)) (= (forall ((I1 $$unsorted)) (=> (tptp.model I1 Ax) (tptp.model I1 C))) (tptp.status Ax C tptp.thm))))) (let ((_let_7 (forall ((Ax $$unsorted) (C $$unsorted)) (or (not (tptp.status Ax C tptp.cax)) (not (tptp.status Ax C tptp.thm)))))) (let ((_let_8 (tptp.status SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 tptp.thm tptp.thm))) (let ((_let_9 (not _let_8))) (let ((_let_10 (tptp.status SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 tptp.thm tptp.cax))) (let ((_let_11 (not _let_10))) (let ((_let_12 (or _let_11 _let_9))) (let ((_let_13 (not _let_7))) (let ((_let_14 (= _let_1 _let_13))) (let ((_let_15 (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (tptp.mighta S1 S2) (not (forall ((Ax $$unsorted) (C $$unsorted)) (or (not (tptp.status Ax C S1)) (not (tptp.status Ax C S2))))))))) (let ((_let_16 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_17 (not _let_14))) (let ((_let_18 (or))) (let ((_let_19 (not _let_12))) (let ((_let_20 (forall ((I1 $$unsorted)) (not (tptp.model I1 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))))) (let ((_let_21 (= _let_20 _let_10))) (let ((_let_22 (forall ((Ax $$unsorted) (C $$unsorted)) (= (tptp.status Ax C tptp.cax) (forall ((I1 $$unsorted)) (not (tptp.model I1 Ax))))))) (let ((_let_23 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_24 (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 tptp.thm QUANTIFIERS_INST_FMF_FMC_EXH))) (let ((_let_25 (forall ((I $$unsorted)) (not (tptp.model I SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))))) (let ((_let_26 (forall ((F $$unsorted)) (not (forall ((I $$unsorted)) (not (tptp.model I F))))))) (let ((_let_27 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_28 (_let_25))) (let ((_let_29 (not _let_26))) (let ((_let_30 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE _let_27) :args (_let_29)) (REWRITE :args ((=> _let_29 (not (not _let_25))))))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_29) _let_26))) (REFL :args _let_28) :args _let_18)) _let_27 :args (_let_25 true _let_26)))) (let ((_let_31 (forall ((I1 $$unsorted)) (or (not (tptp.model I1 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6)) (tptp.model I1 tptp.thm))))) (let ((_let_32 (= _let_8 _let_31))) (let ((_let_33 (forall ((Ax $$unsorted) (C $$unsorted)) (= (tptp.status Ax C tptp.thm) (forall ((I1 $$unsorted)) (or (not (tptp.model I1 Ax)) (tptp.model I1 C))))))) (let ((_let_34 (EQ_RESOLVE (ASSUME :args (_let_6)) (MACRO_SR_EQ_INTRO :args (_let_6 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_35 (tptp.model SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_72 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_36 (not _let_35))) (let ((_let_37 (or _let_36 (tptp.model SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_72 tptp.thm)))) (let ((_let_38 (not _let_31))) (let ((_let_39 (_let_38))) (let ((_let_40 (_let_7))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_40) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 tptp.thm QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_40)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_12)) :args ((or _let_9 _let_11 _let_19))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_32)) :args ((or _let_8 _let_38 (not _let_32)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_39)) :args _let_39)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_38) _let_31))) (REFL :args ((not _let_37))) :args _let_18)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_37 0)) (CONG (REFL :args (_let_37)) (MACRO_SR_PRED_INTRO :args ((= (not _let_36) _let_35))) :args _let_18)) :args ((or _let_35 _let_37))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_28) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_72 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_28)) _let_30 :args (_let_36 false _let_25)) :args (_let_37 true _let_35)) :args (_let_31 false _let_37)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_34 :args _let_24) :args (_let_33))) _let_34 :args (_let_32 false _let_33)) :args (_let_8 false _let_31 false _let_32)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_21)) :args ((or _let_10 (not _let_20) (not _let_21)))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_25 (= I I1)))) _let_30 :args (_let_20 false _let_25)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_23 :args _let_24) :args (_let_22)))) _let_23 :args (_let_21 false _let_22)) :args (_let_10 false _let_20 false _let_21)) :args (_let_19 false _let_8 false _let_10)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_EQUIV_POS2 :args (_let_14)) (CONG (REFL :args (_let_17)) (REFL :args (_let_1)) (MACRO_SR_PRED_INTRO :args ((= (not _let_13) _let_7))) :args _let_18)) :args ((or _let_1 _let_7 _let_17))) (ASSUME :args (_let_2)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_16 :args (tptp.cax tptp.thm QUANTIFIERS_INST_CBQI_PROP)) :args (_let_15))) _let_16 :args (_let_14 false _let_15)) :args (_let_7 true _let_1 false _let_14)) :args (false true _let_12 false _let_7)) :args ((forall ((Ax $$unsorted) (C $$unsorted)) (= (=> (not (exists ((I1 $$unsorted)) (tptp.model I1 Ax))) (not (exists ((I2 $$unsorted)) (tptp.model I2 C)))) (tptp.status Ax C tptp.unp))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (=> (exists ((I1 $$unsorted)) (tptp.model I1 Ax)) (exists ((I2 $$unsorted)) (tptp.model I2 C))) (tptp.status Ax C tptp.sap))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (= (exists ((I1 $$unsorted)) (tptp.model I1 Ax)) (exists ((I2 $$unsorted)) (tptp.model I2 C))) (tptp.status Ax C tptp.esa))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (exists ((I1 $$unsorted)) (and (tptp.model I1 Ax) (tptp.model I1 C))) (tptp.status Ax C tptp.sat))) _let_6 (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (tptp.model I1 Ax)) (forall ((I2 $$unsorted)) (= (tptp.model I2 Ax) (tptp.model I2 C)))) (tptp.status Ax C tptp.eqv))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (tptp.model I1 Ax)) (forall ((I2 $$unsorted)) (tptp.model I2 C))) (tptp.status Ax C tptp.tac))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (tptp.model I1 Ax)) (forall ((I2 $$unsorted)) (=> (tptp.model I2 Ax) (tptp.model I2 C))) (exists ((I3 $$unsorted)) (and (tptp.model I3 C) (not (tptp.model I3 Ax))))) (tptp.status Ax C tptp.wec))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (tptp.model I1 Ax)) (exists ((I2 $$unsorted)) (not (tptp.model I2 Ax))) (forall ((I3 $$unsorted)) (= (tptp.model I3 Ax) (tptp.model I3 C)))) (tptp.status Ax C tptp.eth))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (forall ((I1 $$unsorted)) (and (tptp.model I1 Ax) (tptp.model I1 C))) (tptp.status Ax C tptp.tau))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (tptp.model I1 Ax)) (exists ((I2 $$unsorted)) (not (tptp.model I2 Ax))) (forall ((I3 $$unsorted)) (tptp.model I3 C))) (tptp.status Ax C tptp.wtc))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (tptp.model I1 Ax)) (forall ((I2 $$unsorted)) (=> (tptp.model I2 Ax) (tptp.model I2 C))) (exists ((I3 $$unsorted)) (and (tptp.model I3 C) (not (tptp.model I3 Ax)))) (exists ((I4 $$unsorted)) (not (tptp.model I4 C)))) (tptp.status Ax C tptp.wth))) _let_5 (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (not (exists ((I1 $$unsorted)) (tptp.model I1 Ax))) (exists ((I2 $$unsorted)) (tptp.model I2 C))) (tptp.status Ax C tptp.sca))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (not (exists ((I1 $$unsorted)) (tptp.model I1 Ax))) (forall ((I2 $$unsorted)) (tptp.model I2 C))) (tptp.status Ax C tptp.tca))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (not (exists ((I1 $$unsorted)) (tptp.model I1 Ax))) (exists ((I2 $$unsorted)) (tptp.model I2 C)) (exists ((I3 $$unsorted)) (not (tptp.model I3 C)))) (tptp.status Ax C tptp.wca))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (exists ((I1 $$unsorted)) (and (tptp.model I1 Ax) (tptp.model I1 (tptp.not C)))) (tptp.status Ax C tptp.csa))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (forall ((I1 $$unsorted)) (tptp.model I1 Ax)) (forall ((I2 $$unsorted)) (tptp.model I2 (tptp.not C)))) (tptp.status Ax C tptp.uns))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (and (tptp.model I1 Ax) (tptp.model I1 C))) (exists ((I2 $$unsorted)) (and (tptp.model I2 Ax) (tptp.model I2 (tptp.not C))))) (tptp.status Ax C tptp.noc))) _let_4 (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (forall ((Ax $$unsorted) (C $$unsorted)) (=> (tptp.status Ax C S1) (tptp.status Ax C S2))) (tptp.isa S1 S2))) (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (exists ((Ax $$unsorted) (C $$unsorted)) (and (tptp.status Ax C S1) (not (tptp.status Ax C S2)))) (tptp.nota S1 S2))) (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (forall ((Ax $$unsorted) (C $$unsorted)) (=> (tptp.status Ax C S1) (not (tptp.status Ax C S2)))) (tptp.nevera S1 S2))) (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (forall ((Ax $$unsorted) (C $$unsorted)) (xor (tptp.status Ax C S1) (tptp.status Ax C S2))) (tptp.xora S1 S2))) (forall ((I $$unsorted) (F $$unsorted)) (xor (tptp.model I F) (tptp.model I (tptp.not F)))) (forall ((I $$unsorted) (F $$unsorted)) (= (tptp.model I F) (not (tptp.model I (tptp.not F))))) (exists ((F $$unsorted)) (forall ((I $$unsorted)) (tptp.model I F))) (exists ((F $$unsorted)) (and (exists ((I1 $$unsorted)) (tptp.model I1 F)) (exists ((I2 $$unsorted)) (not (tptp.model I2 F))))) _let_3 (exists ((Ax $$unsorted) (C $$unsorted)) (and (exists ((I1 $$unsorted)) (and (tptp.model I1 Ax) (tptp.model I1 C))) (exists ((I2 $$unsorted)) (or (not (tptp.model I2 Ax)) (not (tptp.model I2 C)))))) (exists ((Ax $$unsorted) (C $$unsorted)) (and (exists ((I1 $$unsorted)) (tptp.model I1 Ax)) (forall ((I2 $$unsorted)) (=> (tptp.model I2 Ax) (tptp.model I2 C))) (exists ((I3 $$unsorted)) (and (not (tptp.model I3 Ax)) (tptp.model I3 C))) (exists ((I4 $$unsorted)) (not (tptp.model I4 C))))) (exists ((I1 $$unsorted) (Ax $$unsorted) (C $$unsorted)) (and (tptp.model I1 Ax) (not (tptp.model I1 C)) (exists ((I2 $$unsorted)) (tptp.model I2 C)))) _let_2 true)))))))))))))))))))))))))))))))))))))))))))
% 22.74/23.09 )
% 22.74/23.09 % SZS output end Proof for KRS265+1
% 22.74/23.09 % cvc5---1.0.5 exiting
% 22.74/23.09 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------