TSTP Solution File: KRS193+1 by cvc5---1.0.5

View Problem - Process Solution

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

% 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 : Thu Aug 31 05:41:47 EDT 2023

% Result   : Theorem 0.19s 0.54s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : KRS193+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Aug 28 01:36:22 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.19/0.48  %----Proving TF0_NAR, FOF, or CNF
% 0.19/0.54  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.b4com4lBTk/cvc5---1.0.5_15222.p...
% 0.19/0.54  ------- get file name : TPTP file name is KRS193+1
% 0.19/0.54  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_15222.smt2...
% 0.19/0.54  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.19/0.54  % SZS status Theorem for KRS193+1
% 0.19/0.54  % SZS output start Proof for KRS193+1
% 0.19/0.54  (
% 0.19/0.54  (let ((_let_1 (tptp.isa tptp.cax tptp.thm))) (let ((_let_2 (not _let_1))) (let ((_let_3 (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (forall ((Ax $$unsorted) (C $$unsorted)) (=> (tptp.status Ax C S1) (tptp.status Ax C S2))) (tptp.isa S1 S2))))) (let ((_let_4 (forall ((Ax $$unsorted) (C $$unsorted)) (= (not (exists ((I1 $$unsorted)) (tptp.model I1 Ax))) (tptp.status Ax C tptp.cax))))) (let ((_let_5 (forall ((Ax $$unsorted) (C $$unsorted)) (= (forall ((I1 $$unsorted)) (=> (tptp.model I1 Ax) (tptp.model I1 C))) (tptp.status Ax C tptp.thm))))) (let ((_let_6 (forall ((I1 $$unsorted)) (not (tptp.model I1 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23))))) (let ((_let_7 (tptp.model SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_25 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23))) (let ((_let_8 (tptp.status SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24 tptp.cax))) (let ((_let_9 (= _let_8 _let_6))) (let ((_let_10 (forall ((Ax $$unsorted) (C $$unsorted)) (= (tptp.status Ax C tptp.cax) (forall ((I1 $$unsorted)) (not (tptp.model I1 Ax))))))) (let ((_let_11 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_12 (tptp.status SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24 tptp.thm))) (let ((_let_13 (not _let_8))) (let ((_let_14 (or _let_13 _let_12))) (let ((_let_15 (forall ((Ax $$unsorted) (C $$unsorted)) (or (not (tptp.status Ax C tptp.cax)) (tptp.status Ax C tptp.thm))))) (let ((_let_16 (not _let_14))) (let ((_let_17 (= _let_1 _let_15))) (let ((_let_18 (not _let_15))) (let ((_let_19 (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (tptp.isa S1 S2) (forall ((Ax $$unsorted) (C $$unsorted)) (or (not (tptp.status Ax C S1)) (tptp.status Ax C S2))))))) (let ((_let_20 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_21 (or))) (let ((_let_22 (_let_18))) (let ((_let_23 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_22)) :args _let_22)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_18) _let_15))) (REFL :args (_let_16)) :args _let_21)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_17)) :args ((or _let_1 _let_18 (not _let_17)))) (ASSUME :args (_let_2)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_20 :args (tptp.cax tptp.thm QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.isa S1 S2)))) :args (_let_19))) _let_20 :args (_let_17 false _let_19)) :args (_let_18 true _let_1 false _let_17)) :args (_let_16 true _let_15)))) (let ((_let_24 (not _let_7))) (let ((_let_25 (or _let_24 (tptp.model SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_25 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24)))) (let ((_let_26 (forall ((I1 $$unsorted)) (or (not (tptp.model I1 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23)) (tptp.model I1 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24))))) (let ((_let_27 (not _let_25))) (let ((_let_28 (= _let_12 _let_26))) (let ((_let_29 (not _let_26))) (let ((_let_30 (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_31 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_32 (_let_29))) (let ((_let_33 (_let_6))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_33) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_25 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.model I1 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23) false))))) :args _let_33)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_25 0)) (CONG (REFL :args (_let_25)) (MACRO_SR_PRED_INTRO :args ((= (not _let_24) _let_7))) :args _let_21)) :args ((or _let_7 _let_25))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_32)) :args _let_32)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_29) _let_26))) (REFL :args (_let_27)) :args _let_21)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_28)) :args ((or _let_12 _let_29 (not _let_28)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_14 1)) _let_23 :args ((not _let_12) true _let_14)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_31 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.status Ax C tptp.thm)))) :args (_let_30))) _let_31 :args (_let_28 false _let_30)) :args (_let_29 true _let_12 false _let_28)) :args (_let_27 true _let_26)) :args (_let_7 true _let_25)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_9)) :args ((or _let_13 _let_6 (not _let_9)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 0)) (CONG (REFL :args (_let_14)) (MACRO_SR_PRED_INTRO :args ((= (not _let_13) _let_8))) :args _let_21)) :args ((or _let_8 _let_14))) _let_23 :args (_let_8 true _let_14)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_11 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.status Ax C tptp.cax)))) :args (_let_10))) _let_11 :args (_let_9 false _let_10)) :args (_let_6 false _let_8 false _let_9)) :args (false false _let_7 false _let_6)) :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_5 (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_4 (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))) (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_3 (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))))) (exists ((F $$unsorted)) (forall ((I $$unsorted)) (not (tptp.model I F)))) (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))))))))))))))))))))))))))))))))))))
% 0.19/0.55  )
% 0.19/0.55  % SZS output end Proof for KRS193+1
% 0.19/0.55  % cvc5---1.0.5 exiting
% 0.19/0.55  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------