TSTP Solution File: KRS254+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : KRS254+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n017.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:56 EDT 2023
% Result : Theorem 0.20s 0.57s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS254+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 01:23:13 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.57 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.8xWJN1VPmE/cvc5---1.0.5_28922.p...
% 0.20/0.57 ------- get file name : TPTP file name is KRS254+1
% 0.20/0.57 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_28922.smt2...
% 0.20/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.57 % SZS status Theorem for KRS254+1
% 0.20/0.57 % SZS output start Proof for KRS254+1
% 0.20/0.57 (
% 0.20/0.57 (let ((_let_1 (tptp.mighta tptp.unp tptp.thm))) (let ((_let_2 (not _let_1))) (let ((_let_3 (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_4 (forall ((Ax $$unsorted) (C $$unsorted)) (= (forall ((I1 $$unsorted)) (=> (tptp.model I1 Ax) (tptp.model I1 C))) (tptp.status Ax C tptp.thm))))) (let ((_let_5 (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))))) (let ((_let_6 (forall ((I1 $$unsorted)) (not (tptp.model I1 tptp.thm))))) (let ((_let_7 (forall ((I2 $$unsorted)) (not (tptp.model I2 tptp.thm))))) (let ((_let_8 (not _let_6))) (let ((_let_9 (or _let_8 _let_7))) (let ((_let_10 (tptp.status tptp.thm tptp.thm tptp.unp))) (let ((_let_11 (= _let_10 _let_9))) (let ((_let_12 (not _let_9))) (let ((_let_13 (forall ((Ax $$unsorted) (C $$unsorted)) (= (tptp.status Ax C tptp.unp) (or (not (forall ((I1 $$unsorted)) (not (tptp.model I1 Ax)))) (forall ((I2 $$unsorted)) (not (tptp.model I2 C)))))))) (let ((_let_14 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_15 (tptp.thm tptp.thm QUANTIFIERS_INST_ENUM))) (let ((_let_16 (tptp.status tptp.thm tptp.thm tptp.thm))) (let ((_let_17 (not _let_16))) (let ((_let_18 (not _let_10))) (let ((_let_19 (or _let_18 _let_17))) (let ((_let_20 (forall ((Ax $$unsorted) (C $$unsorted)) (or (not (tptp.status Ax C tptp.unp)) (not (tptp.status Ax C tptp.thm)))))) (let ((_let_21 (not _let_20))) (let ((_let_22 (= _let_1 _let_21))) (let ((_let_23 (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_24 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_25 (not _let_22))) (let ((_let_26 (or))) (let ((_let_27 (_let_20))) (let ((_let_28 (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_29 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_30 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_11)) :args ((or _let_10 _let_12 (not _let_11)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_18 _let_17 (not _let_19)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_29 :args _let_15) :args (_let_28)))) _let_29 :args (_let_16 false _let_28)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_27) :args _let_15) :args _let_27)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_EQUIV_POS2 :args (_let_22)) (CONG (REFL :args (_let_25)) (REFL :args (_let_1)) (MACRO_SR_PRED_INTRO :args ((= (not _let_21) _let_20))) :args _let_26)) :args ((or _let_1 _let_20 _let_25))) (ASSUME :args (_let_2)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_24 :args (tptp.unp tptp.thm QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.mighta S1 S2)))) :args (_let_23))) _let_24 :args (_let_22 false _let_23)) :args (_let_20 true _let_1 false _let_22)) :args (_let_19 false _let_20)) :args (_let_18 false _let_16 false _let_19)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_14 :args _let_15) :args (_let_13))) _let_14 :args (_let_11 false _let_13)) :args (_let_12 true _let_10 false _let_11)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_6 (= I1 I2)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_9 1)) _let_30 :args ((not _let_7) true _let_9)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_9 0)) (CONG (REFL :args (_let_9)) (MACRO_SR_PRED_INTRO :args ((= (not _let_8) _let_6))) :args _let_26)) :args ((or _let_6 _let_9))) _let_30 :args (_let_6 true _let_9)) :args (false true _let_7 false _let_6)) :args (_let_5 (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_4 (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))) (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_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))) (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.20/0.57 )
% 0.20/0.57 % SZS output end Proof for KRS254+1
% 0.20/0.57 % cvc5---1.0.5 exiting
% 0.20/0.57 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------