%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : KRS267+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n007.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:59 EDT 2023

% Result   : Theorem 62.01s 62.41s
% Output   : Proof 62.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14  % Problem    : KRS267+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.11/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n007.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Aug 28 01:11:15 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.23/0.51  %----Proving TF0_NAR, FOF, or CNF
% 62.01/62.41  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.OVqUKTtP2i/cvc5---1.0.5_25921.p...
% 62.01/62.41  ------- get file name : TPTP file name is KRS267+1
% 62.01/62.41  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_25921.smt2...
% 62.01/62.41  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 62.01/62.41  --- Run --no-e-matching --full-saturate-quant at 5...
% 62.01/62.41  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 62.01/62.41  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 62.01/62.41  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 62.01/62.41  --- Run --trigger-sel=max --full-saturate-quant at 5...
% 62.01/62.41  --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 62.01/62.41  --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 62.01/62.41  --- Run --prenex-quant=none --full-saturate-quant at 5...
% 62.01/62.41  --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 5...
% 62.01/62.41  --- Run --relevant-triggers --full-saturate-quant at 5...
% 62.01/62.41  --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 5...
% 62.01/62.41  % SZS status Theorem for KRS267+1
% 62.01/62.41  % SZS output start Proof for KRS267+1
% 62.01/62.41  (
% 62.01/62.41  (let ((_let_1 (not (tptp.mighta tptp.tca tptp.thm)))) (let ((_let_2 (exists ((F $$unsorted)) (forall ((I $$unsorted)) (not (tptp.model I F)))))) (let ((_let_3 (exists ((F $$unsorted)) (forall ((I $$unsorted)) (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)) (= (and (not (exists ((I1 $$unsorted)) (tptp.model I1 Ax))) (forall ((I2 $$unsorted)) (tptp.model I2 C))) (tptp.status Ax C tptp.tca))))) (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 (io_tptp.status_3 Ax C i_tptp.tca_18)) (not (io_tptp.status_3 Ax C i_tptp.thm_8)))))) (let ((_let_8 (io_tptp.status_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_32 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_28 i_tptp.thm_8))) (let ((_let_9 (not _let_8))) (let ((_let_10 (io_tptp.status_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_32 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_28 i_tptp.tca_18))) (let ((_let_11 (not _let_10))) (let ((_let_12 (or _let_11 _let_9))) (let ((_let_13 (not _let_7))) (let ((_let_14 (io_tptp.mighta_23 i_tptp.tca_18 i_tptp.thm_8))) (let ((_let_15 (= _let_14 _let_13))) (let ((_let_16 (forall ((b_S1 it_7_$$unsorted) (b_S2 it_7_$$unsorted)) (= (io_tptp.mighta_23 b_S1 b_S2) (not (forall ((Ax $$unsorted) (C $$unsorted)) (or (not (io_tptp.status_3 Ax C b_S1)) (not (io_tptp.status_3 Ax C b_S2))))))))) (let ((_let_17 (EQ_RESOLVE (ASSUME :args (_let_4)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (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_16))))))) (let ((_let_18 (not _let_15))) (let ((_let_19 (or))) (let ((_let_20 (not _let_12))) (let ((_let_21 (forall ((b_I2 it_8_$$unsorted)) (io_tptp.model_4 b_I2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_28)))) (let ((_let_22 (forall ((b_I1 it_8_$$unsorted)) (not (io_tptp.model_4 b_I1 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_32))))) (let ((_let_23 (and _let_22 _let_21))) (let ((_let_24 (= _let_10 _let_23))) (let ((_let_25 (forall ((Ax $$unsorted) (C $$unsorted)) (= (io_tptp.status_3 Ax C i_tptp.tca_18) (and (forall ((b_I1 it_8_$$unsorted)) (not (io_tptp.model_4 b_I1 Ax))) (forall ((b_I2 it_8_$$unsorted)) (io_tptp.model_4 b_I2 C))))))) (let ((_let_26 (EQ_RESOLVE (ASSUME :args (_let_5)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((Ax $$unsorted) (C $$unsorted)) (= (tptp.status Ax C tptp.tca) (and (forall ((I1 $$unsorted)) (not (tptp.model I1 Ax))) (forall ((I2 $$unsorted)) (tptp.model I2 C))))) _let_25))))))) (let ((_let_27 (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_32 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_28 QUANTIFIERS_INST_FMF_FMC_EXH))) (let ((_let_28 (forall ((b_I it_8_$$unsorted)) (io_tptp.model_4 b_I SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_28)))) (let ((_let_29 (forall ((F $$unsorted)) (not (forall ((b_I it_8_$$unsorted)) (io_tptp.model_4 b_I F)))))) (let ((_let_30 (not _let_29))) (let ((_let_31 (EQ_RESOLVE (ASSUME :args (_let_3)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (forall ((F $$unsorted)) (not (forall ((I $$unsorted)) (tptp.model I F))))) _let_30))))))) (let ((_let_32 (_let_28))) (let ((_let_33 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE _let_31) :args (_let_30)) (REWRITE :args ((=> _let_30 (not (not _let_28))))))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_30) _let_29))) (REFL :args _let_32) :args _let_19)) _let_31 :args (_let_28 true _let_29)))) (let ((_let_34 (forall ((b_I it_8_$$unsorted)) (not (io_tptp.model_4 b_I SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_32))))) (let ((_let_35 (forall ((F $$unsorted)) (not (forall ((b_I it_8_$$unsorted)) (not (io_tptp.model_4 b_I F))))))) (let ((_let_36 (not _let_35))) (let ((_let_37 (EQ_RESOLVE (ASSUME :args (_let_2)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (forall ((F $$unsorted)) (not (forall ((I $$unsorted)) (not (tptp.model I F)))))) _let_36))))))) (let ((_let_38 (forall ((b_I1 it_8_$$unsorted)) (or (not (io_tptp.model_4 b_I1 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_32)) (io_tptp.model_4 b_I1 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_28))))) (let ((_let_39 (= _let_8 _let_38))) (let ((_let_40 (forall ((Ax $$unsorted) (C $$unsorted)) (= (io_tptp.status_3 Ax C i_tptp.thm_8) (forall ((b_I1 it_8_$$unsorted)) (or (not (io_tptp.model_4 b_I1 Ax)) (io_tptp.model_4 b_I1 C))))))) (let ((_let_41 (EQ_RESOLVE (ASSUME :args (_let_6)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_6 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (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_40))))))) (let ((_let_42 (io_tptp.model_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_101 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_28))) (let ((_let_43 (or (not (io_tptp.model_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_101 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_32)) _let_42))) (let ((_let_44 (not _let_38))) (let ((_let_45 (_let_44))) (let ((_let_46 (_let_7))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_46) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_32 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_28 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_46)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_12)) :args ((or _let_9 _let_11 _let_20))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_39)) :args ((or _let_8 _let_44 (not _let_39)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_45)) :args _let_45)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_44) _let_38))) (REFL :args ((not _let_43))) :args _let_19)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_43 1)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_32) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_101 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_32)) _let_33 :args (_let_42 false _let_28)) :args (_let_43 false _let_42)) :args (_let_38 false _let_43)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_41 :args _let_27) :args (_let_40))) _let_41 :args (_let_39 false _let_40)) :args (_let_8 false _let_38 false _let_39)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_24)) :args ((or _let_10 (not _let_23) (not _let_24)))) (MACRO_RESOLUTION_TRUST (CNF_AND_NEG :args (_let_23)) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_34 (= b_I b_I1)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE _let_37) :args (_let_36)) (REWRITE :args ((=> _let_36 (not (not _let_34))))))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_36) _let_35))) (REFL :args (_let_34)) :args _let_19)) _let_37 :args (_let_34 true _let_35)) :args (_let_22 false _let_34)) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_28 (= b_I b_I2)))) _let_33 :args (_let_21 false _let_28)) :args (_let_23 false _let_22 false _let_21)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_26 :args _let_27) :args (_let_25))) _let_26 :args (_let_24 false _let_25)) :args (_let_10 false _let_23 false _let_24)) :args (_let_20 false _let_8 false _let_10)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_EQUIV_POS2 :args (_let_15)) (CONG (REFL :args (_let_18)) (REFL :args (_let_14)) (MACRO_SR_PRED_INTRO :args ((= (not _let_13) _let_7))) :args _let_19)) :args ((or _let_14 _let_7 _let_18))) (EQ_RESOLVE (ASSUME :args (_let_1)) (PREPROCESS :args ((= _let_1 (not _let_14))))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_17 :args (i_tptp.tca_18 i_tptp.thm_8 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((io_tptp.mighta_23 b_S1 b_S2)))) :args (_let_16))) _let_17 :args (_let_15 false _let_16)) :args (_let_7 true _let_14 false _let_15)) :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))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (not (exists ((I1 $$unsorted)) (tptp.model I1 Ax))) (tptp.status Ax C tptp.cax))) (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))) _let_5 (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))))) _let_3 (exists ((F $$unsorted)) (and (exists ((I1 $$unsorted)) (tptp.model I1 F)) (exists ((I2 $$unsorted)) (not (tptp.model I2 F))))) _let_2 (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_1 true)))))))))))))))))))))))))))))))))))))))))))))))))
% 62.01/62.41  )
% 62.01/62.41  % SZS output end Proof for KRS267+1
% 62.01/62.41  % cvc5---1.0.5 exiting
% 62.01/62.42  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------