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

View Problem - Process Solution

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

% Computer : n023.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:39:55 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SET687+4 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n023.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat Aug 26 12:40:11 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.53  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.OdxQu7fKzl/cvc5---1.0.5_5452.p...
% 0.20/0.53  ------- get file name : TPTP file name is SET687+4
% 0.20/0.53  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_5452.smt2...
% 0.20/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.53  % SZS status Theorem for SET687+4
% 0.20/0.53  % SZS output start Proof for SET687+4
% 0.20/0.53  (
% 0.20/0.53  (let ((_let_1 (forall ((A $$unsorted)) (tptp.subset A A)))) (let ((_let_2 (not _let_1))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset A B) (forall ((X $$unsorted)) (=> (tptp.member X A) (tptp.member X B))))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset A B) (forall ((X $$unsorted)) (or (not (tptp.member X A)) (tptp.member X B))))))) (let ((_let_5 (tptp.subset SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_6 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_7 (not _let_5))) (let ((_let_8 (_let_2))) (let ((_let_9 (ASSUME :args _let_8))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_6 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.subset A B)))) :args (_let_4)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_9) :args _let_8)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_2) _let_1))) (REFL :args (_let_7)) :args (or))) _let_9 :args (_let_7 true _let_1)) _let_6 :args (false true _let_5 false _let_4)) :args (_let_3 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.equal_set A B) (and (tptp.subset A B) (tptp.subset B A)))) (forall ((X $$unsorted) (A $$unsorted)) (= (tptp.member X (tptp.power_set A)) (tptp.subset X A))) (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)))) (forall ((X $$unsorted)) (not (tptp.member X tptp.empty_set))) (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.20/0.53  )
% 0.20/0.53  % SZS output end Proof for SET687+4
% 0.20/0.53  % cvc5---1.0.5 exiting
% 0.20/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------