TSTP Solution File: SET366+4 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SET366+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n031.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 14:38:38 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SET366+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n031.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   : Sat Aug 26 15:21:08 EDT 2023
% 0.21/0.35  % CPUTime    : 
% 0.22/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.53  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.GTI3HsAMrL/cvc5---1.0.5_3827.p...
% 0.22/0.53  ------- get file name : TPTP file name is SET366+4
% 0.22/0.53  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_3827.smt2...
% 0.22/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.53  % SZS status Theorem for SET366+4
% 0.22/0.53  % SZS output start Proof for SET366+4
% 0.22/0.53  (
% 0.22/0.53  (let ((_let_1 (forall ((A $$unsorted)) (tptp.member tptp.empty_set (tptp.power_set A))))) (let ((_let_2 (not _let_1))) (let ((_let_3 (forall ((X $$unsorted)) (not (tptp.member X tptp.empty_set))))) (let ((_let_4 (forall ((X $$unsorted) (A $$unsorted)) (= (tptp.member X (tptp.power_set A)) (tptp.subset X A))))) (let ((_let_5 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset A B) (forall ((X $$unsorted)) (=> (tptp.member X A) (tptp.member X B))))))) (let ((_let_6 (tptp.member SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 tptp.empty_set))) (let ((_let_7 (_let_3))) (let ((_let_8 (ASSUME :args _let_7))) (let ((_let_9 (not _let_6))) (let ((_let_10 (or _let_9 (tptp.member SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)))) (let ((_let_11 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.empty_set)) (tptp.member X SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))))) (let ((_let_12 (not _let_10))) (let ((_let_13 (tptp.subset tptp.empty_set SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_14 (= _let_13 _let_11))) (let ((_let_15 (not _let_11))) (let ((_let_16 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset A B) (forall ((X $$unsorted)) (or (not (tptp.member X A)) (tptp.member X B))))))) (let ((_let_17 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_18 (tptp.member tptp.empty_set (tptp.power_set SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)))) (let ((_let_19 (= _let_18 _let_13))) (let ((_let_20 (not _let_13))) (let ((_let_21 (_let_4))) (let ((_let_22 (ASSUME :args _let_21))) (let ((_let_23 (not _let_18))) (let ((_let_24 (_let_2))) (let ((_let_25 (ASSUME :args _let_24))) (let ((_let_26 (or))) (let ((_let_27 (_let_15))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_8 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.member X tptp.empty_set) false))))) :args _let_7)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_10 0)) (CONG (REFL :args (_let_10)) (MACRO_SR_PRED_INTRO :args ((= (not _let_9) _let_6))) :args _let_26)) :args ((or _let_6 _let_10))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_27)) :args _let_27)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_15) _let_11))) (REFL :args (_let_12)) :args _let_26)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_14)) :args ((or _let_13 _let_15 (not _let_14)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_19)) :args ((or _let_18 _let_20 (not _let_19)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_25) :args _let_24)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_2) _let_1))) (REFL :args (_let_23)) :args _let_26)) _let_25 :args (_let_23 true _let_1)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_22 :args (tptp.empty_set SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING ((tptp.member X (tptp.power_set A))))) :args _let_21)) _let_22 :args (_let_19 false _let_4)) :args (_let_20 true _let_18 false _let_19)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_17 :args (tptp.empty_set SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.subset A B)))) :args (_let_16))) _let_17 :args (_let_14 false _let_16)) :args (_let_15 true _let_13 false _let_14)) :args (_let_12 true _let_11)) :args (_let_6 true _let_10)) _let_8 :args (false false _let_6 false _let_3)) :args (_let_5 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.equal_set A B) (and (tptp.subset A B) (tptp.subset B A)))) _let_4 (forall ((X $$unsorted) (A $$unsorted) (B $$unsorted)) (= (tptp.member X (tptp.intersection A B)) (and (tptp.member X A) (tptp.member X B)))) (forall ((X $$unsorted) (A $$unsorted) (B $$unsorted)) (= (tptp.member X (tptp.union A B)) (or (tptp.member X A) (tptp.member X B)))) _let_3 (forall ((B $$unsorted) (A $$unsorted) (E $$unsorted)) (= (tptp.member B (tptp.difference E A)) (and (tptp.member B E) (not (tptp.member B A))))) (forall ((X $$unsorted) (A $$unsorted)) (= (tptp.member X (tptp.singleton A)) (= X A))) (forall ((X $$unsorted) (A $$unsorted) (B $$unsorted)) (= (tptp.member X (tptp.unordered_pair A B)) (or (= X A) (= X B)))) (forall ((X $$unsorted) (A $$unsorted)) (= (tptp.member X (tptp.sum A)) (exists ((Y $$unsorted)) (and (tptp.member Y A) (tptp.member X Y))))) (forall ((X $$unsorted) (A $$unsorted)) (= (tptp.member X (tptp.product A)) (forall ((Y $$unsorted)) (=> (tptp.member Y A) (tptp.member X Y))))) _let_2 true))))))))))))))))))))))))))))))
% 0.22/0.53  )
% 0.22/0.53  % SZS output end Proof for SET366+4
% 0.22/0.53  % cvc5---1.0.5 exiting
% 0.22/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------