TSTP Solution File: SEU116+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU116+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n016.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:19 EDT 2023
% Result : Theorem 0.21s 0.53s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU116+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n016.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 : Wed Aug 23 16:51:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.53 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.w10e5gUR2R/cvc5---1.0.5_7283.p...
% 0.21/0.53 ------- get file name : TPTP file name is SEU116+1
% 0.21/0.53 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_7283.smt2...
% 0.21/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.53 % SZS status Theorem for SEU116+1
% 0.21/0.53 % SZS output start Proof for SEU116+1
% 0.21/0.53 (
% 0.21/0.53 (let ((_let_1 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.finite_subsets A)) (tptp.finite B)))))) (let ((_let_2 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.finite_subsets A)) (tptp.finite B))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.element B (tptp.finite_subsets A))) (tptp.finite B))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.element B (tptp.finite_subsets A))) (tptp.finite 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_4 (= B B) (= A A)))) :args ((or _let_3 (not _let_4)))) (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))) :args (_let_3 false _let_4)) :args (false false _let_3)) :args ((forall ((A $$unsorted) (B $$unsorted)) (tptp.subset A A)) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) (tptp.empty tptp.empty_set) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.element A B))) (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) (B $$unsorted)) (not (and (tptp.empty A) (not (= A B)) (tptp.empty B)))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.powerset A))) (and (not (tptp.empty _let_1)) (tptp.cup_closed _let_1) (tptp.diff_closed _let_1) (tptp.preboolean _let_1)))) (forall ((A $$unsorted)) (=> (tptp.preboolean A) (and (tptp.cup_closed A) (tptp.diff_closed A)))) (forall ((A $$unsorted)) (=> (and (tptp.cup_closed A) (tptp.diff_closed A)) (tptp.preboolean A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.finite A))) (forall ((A $$unsorted)) (=> (tptp.finite A) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (tptp.finite B))))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element A B) (or (tptp.empty B) (tptp.in A B)))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.element A (tptp.powerset B)) (tptp.subset A B))) (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)) (exists ((B $$unsorted)) (tptp.element B A))) (forall ((A $$unsorted)) (tptp.preboolean (tptp.finite_subsets A))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.finite_subsets A))) (and (not (tptp.empty _let_1)) (tptp.cup_closed _let_1) (tptp.diff_closed _let_1) (tptp.preboolean _let_1)))) _let_2 (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.cup_closed A) (tptp.cap_closed A) (tptp.diff_closed A) (tptp.preboolean A))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.finite 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)))) (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)) (tptp.finite B))))) (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)) (tptp.finite B))))) (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)))))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (tptp.empty B)))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (not (tptp.empty A))) _let_1 true)))))))
% 0.21/0.53 )
% 0.21/0.53 % SZS output end Proof for SEU116+1
% 0.21/0.54 % cvc5---1.0.5 exiting
% 0.21/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------