%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SET991+1 : TPTP v8.1.2. Released v3.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:41:16 EDT 2023

% Result   : Theorem 10.47s 10.70s
% Output   : Proof 10.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SET991+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.36  % Computer : n031.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   : Sat Aug 26 15:55:53 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.22/0.51  %----Proving TF0_NAR, FOF, or CNF
% 10.47/10.70  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.JSMoze6o8f/cvc5---1.0.5_25693.p...
% 10.47/10.70  ------- get file name : TPTP file name is SET991+1
% 10.47/10.70  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_25693.smt2...
% 10.47/10.70  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.47/10.70  --- Run --no-e-matching --full-saturate-quant at 5...
% 10.47/10.70  % SZS status Theorem for SET991+1
% 10.47/10.70  % SZS output start Proof for SET991+1
% 10.47/10.70  (
% 10.47/10.70  (let ((_let_1 (forall ((A $$unsorted)) (=> (and (tptp.relation A) (tptp.function A)) (forall ((B $$unsorted)) (= (= B (tptp.relation_rng A)) (forall ((C $$unsorted)) (= (tptp.in C B) (exists ((D $$unsorted)) (and (tptp.in D (tptp.relation_dom A)) (= C (tptp.apply A D)))))))))))) (let ((_let_2 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.relation B) (tptp.function B)) (=> (tptp.in A (tptp.relation_dom B)) (tptp.in (tptp.apply B A) (tptp.relation_rng B)))))))) (let ((_let_3 (tptp.empty tptp.empty_set))) (let ((_let_4 (tptp.relation tptp.empty_set))) (let ((_let_5 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8 (tptp.relation_dom SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9)))) (let ((_let_6 (forall ((D $$unsorted)) (or (not (tptp.in D (tptp.relation_dom SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9))) (not (= (tptp.apply SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8) (tptp.apply SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 D))))))) (let ((_let_7 (tptp.relation_rng SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9))) (let ((_let_8 (tptp.apply SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8))) (let ((_let_9 (tptp.in _let_8 _let_7))) (let ((_let_10 (not _let_5))) (let ((_let_11 (tptp.function SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9))) (let ((_let_12 (not _let_11))) (let ((_let_13 (tptp.relation SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9))) (let ((_let_14 (not _let_13))) (let ((_let_15 (or _let_14 _let_12 _let_10 _let_9))) (let ((_let_16 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.relation B)) (not (tptp.function B)) (not (tptp.in A (tptp.relation_dom B))) (tptp.in (tptp.apply B A) (tptp.relation_rng B)))))) (let ((_let_17 (not _let_15))) (let ((_let_18 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_19 (or))) (let ((_let_20 (not _let_16))) (let ((_let_21 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_18) :args (_let_20))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_20) _let_16))) (REFL :args (_let_17)) :args _let_19)) _let_18 :args (_let_17 true _let_16)))) (let ((_let_22 (REFL :args (_let_15)))) (let ((_let_23 (not _let_6))) (let ((_let_24 (= _let_9 _let_23))) (let ((_let_25 (forall ((C $$unsorted)) (= (not (forall ((D $$unsorted)) (or (not (tptp.in D (tptp.relation_dom SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9))) (not (= C (tptp.apply SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 D)))))) (tptp.in C (tptp.relation_rng SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9)))))) (let ((_let_26 (or _let_14 _let_12 _let_25))) (let ((_let_27 (forall ((A $$unsorted) (BOUND_VARIABLE_1013 $$unsorted)) (or (not (tptp.relation A)) (not (tptp.function A)) (= (= (tptp.relation_rng A) BOUND_VARIABLE_1013) (forall ((C $$unsorted)) (= (not (forall ((D $$unsorted)) (or (not (tptp.in D (tptp.relation_dom A))) (not (= C (tptp.apply A D)))))) (tptp.in C BOUND_VARIABLE_1013)))))))) (let ((_let_28 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_29 (_let_25))) (let ((_let_30 (not _let_24))) (let ((_let_31 (_let_6))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_31) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_31))) :args ((or _let_10 _let_23))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_EQUIV_POS2 :args (_let_24)) (CONG (REFL :args (_let_30)) (REFL :args (_let_9)) (MACRO_SR_PRED_INTRO :args ((= (not _let_23) _let_6))) :args _let_19)) :args ((or _let_9 _let_6 _let_30))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_15 3)) _let_21 :args ((not _let_9) true _let_15)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_29) :args (_let_8 QUANTIFIERS_INST_CBQI_PROP)) :args _let_29))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_26)) :args ((or _let_14 _let_12 _let_25 (not _let_26)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_15 0)) (CONG _let_22 (MACRO_SR_PRED_INTRO :args ((= (not _let_14) _let_13))) :args _let_19)) :args ((or _let_13 _let_15))) _let_21 :args (_let_13 true _let_15)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_15 1)) (CONG _let_22 (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_11))) :args _let_19)) :args ((or _let_11 _let_15))) _let_21 :args (_let_11 true _let_15)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_28 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 _let_7 QUANTIFIERS_INST_CBQI_PROP)) :args (_let_27)))) _let_28 :args (_let_26 false _let_27)) :args (_let_25 false _let_13 false _let_11 false _let_26)) :args (_let_24 false _let_25)) :args (_let_6 true _let_9 false _let_24)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_15 2)) (CONG _let_22 (MACRO_SR_PRED_INTRO :args ((= (not _let_10) _let_5))) :args _let_19)) :args ((or _let_5 _let_15))) _let_21 :args (_let_5 true _let_15)) :args (false false _let_6 false _let_5)) :args ((forall ((A $$unsorted) (B $$unsorted)) (tptp.subset A A)) (and _let_3 _let_4) (and _let_3 _let_4 (tptp.relation_empty_yielding tptp.empty_set)) _let_3 (forall ((A $$unsorted)) (exists ((B $$unsorted)) (tptp.element B A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.function A))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) (forall ((A $$unsorted)) (=> (and (not (tptp.empty A)) (tptp.relation A)) (not (tptp.empty (tptp.relation_dom A))))) (forall ((A $$unsorted)) (=> (and (not (tptp.empty A)) (tptp.relation A)) (not (tptp.empty (tptp.relation_rng A))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.relation_dom A))) (=> (tptp.empty A) (and (tptp.empty _let_1) (tptp.relation _let_1))))) (forall ((A $$unsorted)) (let ((_let_1 (tptp.relation_rng A))) (=> (tptp.empty A) (and (tptp.empty _let_1) (tptp.relation _let_1))))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.relation 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) (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.empty A) (not (= A B)) (tptp.empty B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A))) (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)) (and (tptp.empty A) (tptp.relation A))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.relation A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.relation_empty_yielding A))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (not (tptp.empty A))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.element A B))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.in A B) (tptp.empty B)))) _let_2 _let_1 true))))))))))))))))))))))))))))))))))
% 10.47/10.70  )
% 10.47/10.70  % SZS output end Proof for SET991+1
% 10.47/10.70  % cvc5---1.0.5 exiting
% 10.47/10.70  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------