TSTP Solution File: SEU294+3 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU294+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n009.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 16:30:41 EDT 2023
% Result : Theorem 0.21s 0.55s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU294+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n009.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Wed Aug 23 23:21:06 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.55 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.oextSYerrJ/cvc5---1.0.5_10394.p...
% 0.21/0.55 ------- get file name : TPTP file name is SEU294+3
% 0.21/0.55 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_10394.smt2...
% 0.21/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.55 % SZS status Theorem for SEU294+3
% 0.21/0.55 % SZS output start Proof for SEU294+3
% 0.21/0.55 (
% 0.21/0.55 (let ((_let_1 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.element A (tptp.powerset B)) (tptp.subset A B))))) (let ((_let_2 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.subset A B) (tptp.finite B)) (tptp.finite A)))))) (let ((_let_3 (tptp.relation tptp.empty_set))) (let ((_let_4 (tptp.empty tptp.empty_set))) (let ((_let_5 (tptp.relation_empty_yielding tptp.empty_set))) (let ((_let_6 (forall ((A $$unsorted)) (=> (tptp.finite A) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (tptp.finite B))))))) (let ((_let_7 (forall ((A $$unsorted) (BOUND_VARIABLE_1088 $$unsorted)) (or (not (tptp.finite A)) (not (tptp.element BOUND_VARIABLE_1088 (tptp.powerset A))) (tptp.finite BOUND_VARIABLE_1088))))) (let ((_let_8 (tptp.finite SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23))) (let ((_let_9 (tptp.element SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23 (tptp.powerset SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24)))) (let ((_let_10 (not _let_9))) (let ((_let_11 (tptp.finite SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24))) (let ((_let_12 (not _let_11))) (let ((_let_13 (or _let_12 _let_10 _let_8))) (let ((_let_14 (EQ_RESOLVE (ASSUME :args (_let_6)) (MACRO_SR_EQ_INTRO :args (_let_6 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_15 (not _let_13))) (let ((_let_16 (tptp.subset SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24))) (let ((_let_17 (= _let_16 _let_9))) (let ((_let_18 (_let_1))) (let ((_let_19 (ASSUME :args _let_18))) (let ((_let_20 (not _let_16))) (let ((_let_21 (or _let_20 _let_12 _let_8))) (let ((_let_22 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.subset A B)) (not (tptp.finite B)) (tptp.finite A))))) (let ((_let_23 (not _let_21))) (let ((_let_24 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_25 (or))) (let ((_let_26 (not _let_22))) (let ((_let_27 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_24) :args (_let_26))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_26) _let_22))) (REFL :args (_let_23)) :args _let_25)) _let_24 :args (_let_23 true _let_22)))) (let ((_let_28 (REFL :args (_let_21)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_14 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.element BOUND_VARIABLE_1088 (tptp.powerset A)) false))))) :args (_let_7))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_13)) :args ((or _let_12 _let_8 _let_10 _let_15))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_21 1)) (CONG _let_28 (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_11))) :args _let_25)) :args ((or _let_11 _let_21))) _let_27 :args (_let_11 true _let_21)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_21 2)) _let_27 :args ((not _let_8) true _let_21)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_17)) :args ((or _let_20 _let_9 (not _let_17)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_21 0)) (CONG _let_28 (MACRO_SR_PRED_INTRO :args ((= (not _let_20) _let_16))) :args _let_25)) :args ((or _let_16 _let_21))) _let_27 :args (_let_16 true _let_21)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_19 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_23 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.subset A B)))) :args _let_18))) _let_19 :args (_let_17 false _let_1)) :args (_let_9 false _let_16 false _let_17)) :args (_let_15 false _let_11 true _let_8 false _let_9)) _let_14 :args (false true _let_13 false _let_7)) :args ((forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) (forall ((A $$unsorted)) (=> (tptp.ordinal A) (forall ((B $$unsorted)) (=> (tptp.element B A) (and (tptp.epsilon_transitive B) (tptp.epsilon_connected B) (tptp.ordinal B)))))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.finite A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.function A))) (forall ((A $$unsorted)) (=> (tptp.ordinal A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.relation A))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.ordinal A))) (=> (and (tptp.empty A) _let_1) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) _let_1 (tptp.natural A))))) _let_6 (forall ((A $$unsorted)) (let ((_let_1 (tptp.function A))) (let ((_let_2 (tptp.relation A))) (=> (and _let_2 (tptp.empty A) _let_1) (and _let_2 _let_1 (tptp.one_to_one A)))))) (forall ((A $$unsorted)) (=> (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A)) (tptp.ordinal A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A)))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.ordinal A))) (=> (tptp.element A tptp.positive_rationals) (=> _let_1 (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) _let_1 (tptp.natural A)))))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (tptp.element B A))) (and _let_4 _let_3 _let_5) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) _let_4 (and _let_3 _let_5 (tptp.function tptp.empty_set) (tptp.one_to_one tptp.empty_set) _let_4 (tptp.epsilon_transitive tptp.empty_set) (tptp.epsilon_connected tptp.empty_set) (tptp.ordinal tptp.empty_set)) (and _let_4 _let_3) (not (tptp.empty tptp.positive_rationals)) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A) (tptp.natural A))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.finite A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.function_yielding A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A))) (exists ((A $$unsorted)) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (exists ((A $$unsorted)) (and (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A) (tptp.being_limit_ordinal A))) (exists ((A $$unsorted)) (and (tptp.empty A) (tptp.relation A))) (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)))))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (and (tptp.element A tptp.positive_rationals) (not (tptp.empty A)) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (tptp.empty B) (tptp.relation B) (tptp.function B) (tptp.one_to_one B) (tptp.epsilon_transitive B) (tptp.epsilon_connected B) (tptp.ordinal B) (tptp.natural B) (tptp.finite B)))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.empty A) (tptp.function A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.one_to_one A) (tptp.empty A) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.transfinite_sequence A) (tptp.ordinal_yielding A))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.relation A))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (tptp.empty B)))) (exists ((A $$unsorted)) (not (tptp.empty A))) (exists ((A $$unsorted)) (and (tptp.element A tptp.positive_rationals) (tptp.empty A) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A) (tptp.natural A))) (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)) (tptp.finite B))))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.one_to_one A))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.epsilon_transitive A) (tptp.epsilon_connected A) (tptp.ordinal A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.relation_empty_yielding A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.relation_empty_yielding A) (tptp.function A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.transfinite_sequence A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.relation_non_empty A) (tptp.function A))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset A A)) _let_2 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.element A B))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element A B) (or (tptp.empty B) (tptp.in A B)))) _let_1 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.in A B) (tptp.element B (tptp.powerset C))) (tptp.element A C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (not (and (tptp.in A B) (tptp.element B (tptp.powerset C)) (tptp.empty C)))) (forall ((A $$unsorted)) (=> (tptp.empty A) (= A tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.in A B) (tptp.empty B)))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.empty A) (not (= A B)) (tptp.empty B)))) true)))))))))))))))))))))))))))))))
% 0.21/0.55 )
% 0.21/0.55 % SZS output end Proof for SEU294+3
% 0.21/0.55 % cvc5---1.0.5 exiting
% 0.21/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------