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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : KRS148+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n005.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:37 EDT 2023

% Result   : Theorem 0.22s 0.61s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15  % Problem    : KRS148+1 : TPTP v8.1.2. Released v3.1.0.
% 0.15/0.16  % Command    : do_cvc5 %s %d
% 0.16/0.37  % Computer : n005.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Mon Aug 28 01:02:38 EDT 2023
% 0.16/0.37  % CPUTime    : 
% 0.22/0.52  %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.61  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.rrsxyPpNcC/cvc5---1.0.5_15007.p...
% 0.22/0.61  ------- get file name : TPTP file name is KRS148+1
% 0.22/0.61  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_15007.smt2...
% 0.22/0.61  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.61  % SZS status Theorem for KRS148+1
% 0.22/0.61  % SZS output start Proof for KRS148+1
% 0.22/0.61  (
% 0.22/0.61  (let ((_let_1 (tptp.cC140 tptp.iV5475))) (let ((_let_2 (tptp.cC116 tptp.iV5475))) (let ((_let_3 (tptp.cowlThing tptp.iV5475))) (let ((_let_4 (tptp.cC138 tptp.iV5475))) (let ((_let_5 (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))))) (let ((_let_6 (not (and (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) _let_5 _let_4 _let_3 _let_2 _let_1)))) (let ((_let_7 (tptp.cC114 tptp.iV5475))) (let ((_let_8 (not _let_7))) (let ((_let_9 (tptp.cTOP tptp.iV5475))) (let ((_let_10 (tptp.cTEST tptp.iV5475))) (let ((_let_11 (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X)))))) (let ((_let_12 (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X)))))) (let ((_let_13 (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (not (tptp.cC114 X))))))) (let ((_let_14 (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))))) (let ((_let_15 (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))))) (let ((_let_16 (and _let_9 _let_4))) (let ((_let_17 (= _let_1 _let_16))) (let ((_let_18 (and _let_1 _let_2))) (let ((_let_19 (= _let_10 _let_18))) (let ((_let_20 (_let_11))) (let ((_let_21 (ASSUME :args _let_20))) (let ((_let_22 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_18 0)) :args ((or _let_1 (not _let_18)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_19)) :args ((or (not _let_10) _let_18 (not _let_19)))) (ASSUME :args (_let_10)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (tptp.iV5475 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.cTEST X)))) :args _let_20)) _let_21 :args (_let_19 false _let_11)) :args (_let_18 false _let_10 false _let_19)) :args (_let_1 false _let_18)))) (let ((_let_23 (not _let_16))) (let ((_let_24 (forall ((BOUND_VARIABLE_1882 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1882))))) (let ((_let_25 (forall ((BOUND_VARIABLE_1877 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1877)))) (let ((_let_26 (not _let_4))) (let ((_let_27 (forall ((BOUND_VARIABLE_1454 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1454))))) (let ((_let_28 (EQ_RESOLVE (ASSUME :args (_let_15)) (MACRO_SR_EQ_INTRO :args (_let_15 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_29 (forall ((BOUND_VARIABLE_1449 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1449)))) (let ((_let_30 (and _let_9 _let_8))) (let ((_let_31 (= _let_2 _let_30))) (let ((_let_32 (_let_13))) (let ((_let_33 (ASSUME :args _let_32))) (let ((_let_34 (not _let_9))) (let ((_let_35 (_let_30))) (let ((_let_36 (not _let_1))) (let ((_let_37 (_let_12))) (let ((_let_38 (ASSUME :args _let_37))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_17)) :args ((or _let_36 _let_16 (not _let_17)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_38 :args (tptp.iV5475 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.cC140 X)))) :args _let_37)) _let_38 :args (_let_17 false _let_12)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_16 1)) :args ((or _let_4 _let_23))) (MACRO_RESOLUTION_TRUST (REORDERING (NOT_AND (EQ_RESOLVE (ASSUME :args (_let_6)) (MACRO_SR_EQ_INTRO :args (_let_6 SB_DEFAULT SBA_FIXPOINT)))) :args ((or (not _let_3) (not _let_5) _let_26 (not _let_2) _let_36 (not _let_25) (not _let_24)))) (ASSUME :args (_let_3)) (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_14 (= X X)))) :args ((or _let_5 (not _let_14)))) (ASSUME :args (_let_14)) :args (_let_5 false _let_14)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_31)) :args ((or _let_2 (not _let_30) (not _let_31)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_AND_NEG :args _let_35) (CONG (REFL :args _let_35) (REFL :args (_let_34)) (MACRO_SR_PRED_INTRO :args ((= (not _let_8) _let_7))) :args (or))) :args ((or _let_7 _let_34 _let_30))) (ASSUME :args (_let_8)) (ASSUME :args (_let_9)) :args (_let_30 true _let_7 false _let_9)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_33 :args (tptp.iV5475 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.cC116 X)))) :args _let_32)) _let_33 :args (_let_31 false _let_13)) :args (_let_2 false _let_30 false _let_31)) _let_22 (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_29 (= BOUND_VARIABLE_1449 BOUND_VARIABLE_1877)))) :args ((or _let_25 (not _let_29)))) (AND_ELIM _let_28 :args (0)) :args (_let_25 false _let_29)) (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_27 (= BOUND_VARIABLE_1454 BOUND_VARIABLE_1882)))) :args ((or _let_24 (not _let_27)))) (AND_ELIM _let_28 :args (1)) :args (_let_24 false _let_27)) :args (_let_26 false _let_3 false _let_5 false _let_2 false _let_1 false _let_25 false _let_24)) :args (_let_23 true _let_4)) _let_22 :args (false false _let_17 true _let_16 false _let_1)) :args (_let_15 _let_14 (forall ((X $$unsorted)) (= (tptp.cC10 X) (and (not (tptp.cC8 X)) (not (tptp.cC2 X))))) (forall ((X $$unsorted)) (= (tptp.cC100 X) (and (not (tptp.cC98 X)) (tptp.cC94 X)))) (forall ((X $$unsorted)) (= (tptp.cC102 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC100 Y))))) (forall ((X $$unsorted)) (= (tptp.cC104 X) (and (not (tptp.cC102 X)) (tptp.cC88 X)))) (forall ((X $$unsorted)) (= (tptp.cC106 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC104 Y))))) (forall ((X $$unsorted)) (= (tptp.cC108 X) (and (tptp.cC84 X) (not (tptp.cC106 X))))) (forall ((X $$unsorted)) (= (tptp.cC110 X) (and (tptp.cC62 X) (not (tptp.cC108 X))))) (forall ((X $$unsorted)) (= (tptp.cC112 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC110 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC114 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC112 Y))))) _let_13 (forall ((X $$unsorted)) (= (tptp.cC118 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC12 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC10 Y))))) (forall ((X $$unsorted)) (= (tptp.cC120 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC118 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC122 X) (and (not (tptp.cC2 X)) (tptp.cC120 X)))) (forall ((X $$unsorted)) (= (tptp.cC124 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC126 X) (and (tptp.cC124 X) (tptp.cC2 X)))) (forall ((X $$unsorted)) (= (tptp.cC128 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC126 Y))))) (forall ((X $$unsorted)) (= (tptp.cC130 X) (and (not (tptp.cC2 X)) (not (tptp.cC128 X))))) (forall ((X $$unsorted)) (= (tptp.cC132 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC130 Y))))) (forall ((X $$unsorted)) (= (tptp.cC134 X) (and (tptp.cC122 X) (not (tptp.cC132 X))))) (forall ((X $$unsorted)) (= (tptp.cC136 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC134 Y))))) (forall ((X $$unsorted)) (= (tptp.cC138 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC136 Y))))) (forall ((X $$unsorted)) (= (tptp.cC14 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC12 Y))))) _let_12 (forall ((X $$unsorted)) (= (tptp.cC16 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC18 X) (and (tptp.cC16 X) (tptp.cC2 X)))) (forall ((X $$unsorted)) (= (tptp.cC20 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC18 Y))))) (forall ((X $$unsorted)) (= (tptp.cC22 X) (and (not (tptp.cC20 X)) (not (tptp.cC2 X))))) (forall ((X $$unsorted)) (= (tptp.cC24 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC22 Y))))) (forall ((X $$unsorted)) (= (tptp.cC26 X) (and (tptp.cC14 X) (not (tptp.cC24 X))))) (forall ((X $$unsorted)) (= (tptp.cC28 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC30 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC28 Y))))) (forall ((X $$unsorted)) (= (tptp.cC32 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC34 X) (and (tptp.cC30 X) (not (tptp.cC32 X))))) (forall ((X $$unsorted)) (= (tptp.cC36 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC34 Y))))) (forall ((X $$unsorted)) (= (tptp.cC38 X) (and (not (tptp.cC36 X)) (not (tptp.cC26 X))))) (forall ((X $$unsorted)) (= (tptp.cC4 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC40 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC42 X) (and (not (tptp.cC2 X)) (tptp.cC40 X)))) (forall ((X $$unsorted)) (= (tptp.cC44 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC46 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC44 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC48 X) (and (tptp.cC42 X) (tptp.cC46 X)))) (forall ((X $$unsorted)) (= (tptp.cC50 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC52 X) (and (tptp.cC2 X) (tptp.cC50 X)))) (forall ((X $$unsorted)) (= (tptp.cC54 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC52 Y))))) (forall ((X $$unsorted)) (= (tptp.cC56 X) (and (not (tptp.cC54 X)) (not (tptp.cC2 X))))) (forall ((X $$unsorted)) (= (tptp.cC58 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC56 Y))))) (forall ((X $$unsorted)) (= (tptp.cC6 X) (and (tptp.cC2 X) (tptp.cC4 X)))) (forall ((X $$unsorted)) (= (tptp.cC60 X) (and (tptp.cC48 X) (not (tptp.cC58 X))))) (forall ((X $$unsorted)) (= (tptp.cC62 X) (and (tptp.cC38 X) (not (tptp.cC60 X))))) (forall ((X $$unsorted)) (= (tptp.cC64 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC66 X) (and (tptp.cC64 X) (tptp.cC2 X)))) (forall ((X $$unsorted)) (= (tptp.cC68 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC70 X) (and (tptp.cC2 X) (tptp.cC68 X)))) (forall ((X $$unsorted)) (= (tptp.cC72 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC70 Y))))) (forall ((X $$unsorted)) (= (tptp.cC74 X) (and (tptp.cC66 X) (tptp.cC72 X)))) (forall ((X $$unsorted)) (= (tptp.cC76 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC78 X) (and (tptp.cC76 X) (tptp.cC2 X)))) (forall ((X $$unsorted)) (= (tptp.cC8 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC6 Y))))) (forall ((X $$unsorted)) (= (tptp.cC80 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC78 Y))))) (forall ((X $$unsorted)) (= (tptp.cC82 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC80 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC84 X) (and (tptp.cC82 X) (tptp.cC74 X)))) (forall ((X $$unsorted)) (= (tptp.cC86 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC88 X) (and (tptp.cC86 X) (tptp.cC2 X)))) (forall ((X $$unsorted)) (= (tptp.cC90 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC92 X) (and (tptp.cC2 X) (tptp.cC90 X)))) (forall ((X $$unsorted)) (= (tptp.cC94 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC92 Y))))) (forall ((X $$unsorted)) (= (tptp.cC96 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (not (tptp.cC2 Y)))))) (forall ((X $$unsorted)) (= (tptp.cC98 X) (and (tptp.cC96 X) (tptp.cC2 X)))) _let_11 _let_10 _let_9 _let_3 (forall ((X $$unsorted)) (=> (tptp.rR1 tptp.iV5475 X) (not (tptp.cC112 X)))) _let_8 (tptp.rR1 tptp.iV5475 tptp.iV5476) (tptp.cowlThing tptp.iV5476) (not (tptp.cC34 tptp.iV5478)) (not (tptp.cC12 tptp.iV5478)) (forall ((X $$unsorted)) (=> (tptp.rR1 tptp.iV5478 X) (tptp.cC2 X))) (not (tptp.cC30 tptp.iV5478)) (not (tptp.cC130 tptp.iV5478)) (not (tptp.cC118 tptp.iV5478)) (tptp.cowlThing tptp.iV5478) (tptp.cC2 tptp.iV5478) (forall ((X $$unsorted)) (=> (tptp.rR1 tptp.iV5478 X) (not (tptp.cC28 X)))) (forall ((X $$unsorted)) (=> (tptp.rR1 tptp.iV5478 X) (not (tptp.cC10 X)))) _let_6 true)))))))))))))))))))))))))))))))))))))))))
% 0.22/0.62  )
% 0.22/0.62  % SZS output end Proof for KRS148+1
% 0.22/0.62  % cvc5---1.0.5 exiting
% 0.22/0.62  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------