TSTP Solution File: SEU085+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU085+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n018.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:29:13 EDT 2023
% Result : Theorem 0.22s 0.54s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU085+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed Aug 23 20:34:57 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.54 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.RwLiCpMkjk/cvc5---1.0.5_17723.p...
% 0.22/0.54 ------- get file name : TPTP file name is SEU085+1
% 0.22/0.54 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_17723.smt2...
% 0.22/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.54 % SZS status Theorem for SEU085+1
% 0.22/0.54 % SZS output start Proof for SEU085+1
% 0.22/0.54 (
% 0.22/0.54 (let ((_let_1 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.finite A) (tptp.finite (tptp.set_difference A B))))))) (let ((_let_2 (tptp.relation tptp.empty_set))) (let ((_let_3 (tptp.empty tptp.empty_set))) (let ((_let_4 (tptp.relation_empty_yielding tptp.empty_set))) (let ((_let_5 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.finite A) (tptp.finite (tptp.set_difference A B)))))) (let ((_let_6 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.finite A)) (tptp.finite (tptp.set_difference A B)))))) (let ((_let_7 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.finite A)) (tptp.finite (tptp.set_difference A B)))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_7 (= A A) (= B B)))) :args ((or _let_6 (not _let_7)))) (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))) :args (_let_6 false _let_7)) :args (false false _let_6)) :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))))) (forall ((A $$unsorted)) (=> (tptp.finite A) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (tptp.finite B))))) (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))) _let_5 (and _let_3 _let_2 _let_4) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) _let_3 (and _let_2 _let_4 (tptp.function tptp.empty_set) (tptp.one_to_one tptp.empty_set) _let_3 (tptp.epsilon_transitive tptp.empty_set) (tptp.epsilon_connected tptp.empty_set) (tptp.ordinal tptp.empty_set)) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation A) (tptp.relation B)) (tptp.relation (tptp.set_difference A B)))) (and _let_3 _let_2) (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)) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.subset A B) (tptp.finite B)) (tptp.finite A))) _let_1 (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)))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset (tptp.set_difference A B) A)) (forall ((A $$unsorted)) (= (tptp.set_difference A tptp.empty_set) A)) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.element A (tptp.powerset B)) (tptp.subset A B))) (forall ((A $$unsorted)) (= (tptp.set_difference tptp.empty_set A) tptp.empty_set)) (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.22/0.55 )
% 0.22/0.55 % SZS output end Proof for SEU085+1
% 0.22/0.55 % cvc5---1.0.5 exiting
% 0.22/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------