TSTP Solution File: SEU239+1 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SEU239+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n021.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:30:19 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SEU239+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14  % Command    : do_cvc5 %s %d
% 0.19/0.36  % Computer : n021.cluster.edu
% 0.19/0.36  % Model    : x86_64 x86_64
% 0.19/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36  % Memory   : 8042.1875MB
% 0.19/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36  % CPULimit   : 300
% 0.19/0.36  % WCLimit    : 300
% 0.19/0.36  % DateTime   : Wed Aug 23 19:27:09 EDT 2023
% 0.19/0.36  % CPUTime    : 
% 0.22/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.55  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.lzXuEmGkil/cvc5---1.0.5_29690.p...
% 0.22/0.55  ------- get file name : TPTP file name is SEU239+1
% 0.22/0.55  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_29690.smt2...
% 0.22/0.55  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.55  % SZS status Theorem for SEU239+1
% 0.22/0.55  % SZS output start Proof for SEU239+1
% 0.22/0.55  (
% 0.22/0.55  (let ((_let_1 (not (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.reflexive A) (forall ((B $$unsorted)) (=> (tptp.in B (tptp.relation_field A)) (tptp.in (tptp.ordered_pair B B) A))))))))) (let ((_let_2 (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.reflexive A) (tptp.is_reflexive_in A (tptp.relation_field A))))))) (let ((_let_3 (forall ((A $$unsorted)) (=> (tptp.relation A) (forall ((B $$unsorted)) (= (tptp.is_reflexive_in A B) (forall ((C $$unsorted)) (=> (tptp.in C B) (tptp.in (tptp.ordered_pair C C) A))))))))) (let ((_let_4 (forall ((C $$unsorted)) (or (not (tptp.in C (tptp.relation_field SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (tptp.in (tptp.ordered_pair C C) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))))) (let ((_let_5 (tptp.relation_field SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_6 (tptp.is_reflexive_in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 _let_5))) (let ((_let_7 (= _let_6 _let_4))) (let ((_let_8 (tptp.relation SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_9 (not _let_8))) (let ((_let_10 (or _let_9 _let_7))) (let ((_let_11 (forall ((A $$unsorted) (BOUND_VARIABLE_833 $$unsorted)) (or (not (tptp.relation A)) (= (tptp.is_reflexive_in A BOUND_VARIABLE_833) (forall ((C $$unsorted)) (or (not (tptp.in C BOUND_VARIABLE_833)) (tptp.in (tptp.ordered_pair C C) A)))))))) (let ((_let_12 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_13 (forall ((B $$unsorted)) (or (not (tptp.in B (tptp.relation_field SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (tptp.in (tptp.ordered_pair B B) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))))) (let ((_let_14 (tptp.reflexive SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_15 (= _let_14 _let_13))) (let ((_let_16 (or _let_9 _let_15))) (let ((_let_17 (forall ((A $$unsorted)) (or (not (tptp.relation A)) (= (tptp.reflexive A) (forall ((B $$unsorted)) (or (not (tptp.in B (tptp.relation_field A))) (tptp.in (tptp.ordered_pair B B) A)))))))) (let ((_let_18 (not _let_16))) (let ((_let_19 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_20 (or))) (let ((_let_21 (not _let_17))) (let ((_let_22 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_19) :args (_let_21))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_21) _let_17))) (REFL :args (_let_18)) :args _let_20)) _let_19 :args (_let_18 true _let_17)))) (let ((_let_23 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_16 0)) (CONG (REFL :args (_let_16)) (MACRO_SR_PRED_INTRO :args ((= (not _let_9) _let_8))) :args _let_20)) :args ((or _let_8 _let_16))) _let_22 :args (_let_8 true _let_16)))) (let ((_let_24 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_10)) :args ((or _let_9 _let_7 (not _let_10)))) _let_23 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_12 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 _let_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.is_reflexive_in A BOUND_VARIABLE_833)))) :args (_let_11))) _let_12 :args (_let_10 false _let_11)) :args (_let_7 false _let_8 false _let_10)))) (let ((_let_25 (= _let_14 _let_6))) (let ((_let_26 (or _let_9 _let_25))) (let ((_let_27 (forall ((A $$unsorted)) (or (not (tptp.relation A)) (= (tptp.reflexive A) (tptp.is_reflexive_in A (tptp.relation_field A))))))) (let ((_let_28 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_29 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_26)) :args ((or _let_9 _let_25 (not _let_26)))) _let_23 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_28 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.reflexive A)))) :args (_let_27))) _let_28 :args (_let_26 false _let_27)) :args (_let_25 false _let_8 false _let_26)))) (let ((_let_30 (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_16 1)) _let_22 :args ((not _let_15) true _let_16)))) (let ((_let_31 (_let_15))) (let ((_let_32 (not _let_25))) (let ((_let_33 (not _let_6))) (let ((_let_34 (_let_25))) (let ((_let_35 (ALPHA_EQUIV :args (_let_13 (= B C))))) (let ((_let_36 (not _let_7))) (let ((_let_37 (not _let_4))) (let ((_let_38 (_let_7))) (let ((_let_39 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args _let_38) :args ((or _let_6 _let_37 _let_36))) _let_24 (EQUIV_ELIM1 _let_35) (REORDERING (CNF_EQUIV_POS2 :args _let_34) :args ((or _let_14 _let_33 _let_32))) _let_29 (REORDERING (CNF_EQUIV_NEG1 :args _let_31) :args ((or _let_14 _let_13 _let_15))) _let_30 :args (_let_14 false _let_7 false _let_4 true _let_6 false _let_25 false _let_13 true _let_15)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args _let_38) :args ((or _let_33 _let_4 _let_36))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_35) (MACRO_RESOLUTION_TRUST (CNF_EQUIV_NEG2 :args _let_31) _let_30 _let_39 :args ((not _let_13) true _let_15 false _let_14)) :args (_let_37 true _let_13)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args _let_34) :args ((or (not _let_14) _let_6 _let_32))) _let_39 _let_29 :args (_let_6 false _let_14 false _let_25)) _let_24 :args (false true _let_4 false _let_6 false _let_7)) :args ((forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) (forall ((A $$unsorted)) (=> (tptp.empty A) (tptp.function A))) (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) (B $$unsorted)) (= (tptp.unordered_pair A B) (tptp.unordered_pair B A))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_union2 A B) (tptp.set_union2 B A))) _let_3 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.ordered_pair A B) (tptp.unordered_pair (tptp.unordered_pair A B) (tptp.singleton A)))) (forall ((A $$unsorted)) (=> (tptp.relation A) (= (tptp.relation_field A) (tptp.set_union2 (tptp.relation_dom A) (tptp.relation_rng A))))) _let_2 true true true true true true true true true (forall ((A $$unsorted)) (exists ((B $$unsorted)) (tptp.element B A))) (tptp.empty tptp.empty_set) (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.empty (tptp.ordered_pair A B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (not (tptp.empty A)) (not (tptp.empty (tptp.set_union2 A B))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (not (tptp.empty A)) (not (tptp.empty (tptp.set_union2 B A))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_union2 A A) A)) _let_1 (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.empty A) (tptp.function A))) (exists ((A $$unsorted)) (not (tptp.empty A))) (exists ((A $$unsorted)) (and (tptp.relation A) (tptp.function A) (tptp.one_to_one A))) (forall ((A $$unsorted)) (= (tptp.set_union2 A tptp.empty_set) A)) (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)) (=> (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 SEU239+1
% 0.22/0.55  % cvc5---1.0.5 exiting
% 0.22/0.55  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------