TSTP Solution File: SEU140+2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU140+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n029.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:30 EDT 2023
% Result : Theorem 0.18s 0.55s
% Output : Proof 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU140+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 24 00:01:53 EDT 2023
% 0.18/0.33 % CPUTime :
% 0.18/0.48 %----Proving TF0_NAR, FOF, or CNF
% 0.18/0.55 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.Jbj5HHh1YC/cvc5---1.0.5_17848.p...
% 0.18/0.55 ------- get file name : TPTP file name is SEU140+2
% 0.18/0.55 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_17848.smt2...
% 0.18/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.18/0.55 % SZS status Theorem for SEU140+2
% 0.18/0.55 % SZS output start Proof for SEU140+2
% 0.18/0.55 (
% 0.18/0.55 (let ((_let_1 (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.disjoint B C)) (tptp.disjoint A C)))))) (let ((_let_2 (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.disjoint A B))) (and (not (and (not _let_1) (forall ((C $$unsorted)) (not (and (tptp.in C A) (tptp.in C B)))))) (not (and (exists ((C $$unsorted)) (and (tptp.in C A) (tptp.in C B))) _let_1))))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.disjoint A B) (tptp.disjoint B A))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset A B) (forall ((C $$unsorted)) (=> (tptp.in C A) (tptp.in C B))))))) (let ((_let_5 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_6 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_7 (not _let_5))) (let ((_let_8 (or _let_7 _let_6))) (let ((_let_9 (tptp.in SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_10 (not _let_9))) (let ((_let_11 (or _let_7 _let_10))) (let ((_let_12 (forall ((C $$unsorted)) (or (not (tptp.in C SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)) (not (tptp.in C SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6)))))) (let ((_let_13 (not _let_11))) (let ((_let_14 (not _let_12))) (let ((_let_15 (tptp.disjoint SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_16 (or _let_15 _let_14))) (let ((_let_17 (forall ((BOUND_VARIABLE_1176 $$unsorted) (BOUND_VARIABLE_1178 $$unsorted)) (or (tptp.disjoint BOUND_VARIABLE_1176 BOUND_VARIABLE_1178) (not (forall ((C $$unsorted)) (or (not (tptp.in C BOUND_VARIABLE_1176)) (not (tptp.in C BOUND_VARIABLE_1178))))))))) (let ((_let_18 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_19 (_let_17))) (let ((_let_20 (tptp.disjoint SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_21 (not _let_20))) (let ((_let_22 (tptp.subset SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_23 (not _let_22))) (let ((_let_24 (or _let_23 _let_21 _let_15))) (let ((_let_25 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.subset A B)) (not (tptp.disjoint B C)) (tptp.disjoint A C))))) (let ((_let_26 (not _let_24))) (let ((_let_27 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_28 (or))) (let ((_let_29 (not _let_25))) (let ((_let_30 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_27) :args (_let_29))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_29) _let_25))) (REFL :args (_let_26)) :args _let_28)) _let_27 :args (_let_26 true _let_25)))) (let ((_let_31 (_let_14))) (let ((_let_32 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_31)) :args _let_31)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_14) _let_12))) (REFL :args (_let_13)) :args _let_28)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_16)) :args ((or _let_15 _let_14 (not _let_16)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_24 2)) _let_30 :args ((not _let_15) true _let_24)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_19) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.disjoint BOUND_VARIABLE_1176 BOUND_VARIABLE_1178) true))))) :args _let_19)) (AND_ELIM _let_18 :args (0)) :args (_let_16 false _let_17)) :args (_let_14 true _let_15 false _let_16)) :args (_let_13 true _let_12)))) (let ((_let_33 (REFL :args (_let_11)))) (let ((_let_34 (forall ((C $$unsorted)) (or (not (tptp.in C SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)) (tptp.in C SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))))) (let ((_let_35 (= _let_22 _let_34))) (let ((_let_36 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset A B) (forall ((C $$unsorted)) (or (not (tptp.in C A)) (tptp.in C B))))))) (let ((_let_37 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_38 (REFL :args (_let_24)))) (let ((_let_39 (_let_34))) (let ((_let_40 (not _let_6))) (let ((_let_41 (tptp.disjoint SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_42 (not _let_41))) (let ((_let_43 (or _let_42 _let_10 _let_40))) (let ((_let_44 (forall ((BOUND_VARIABLE_1191 $$unsorted) (BOUND_VARIABLE_1193 $$unsorted) (BOUND_VARIABLE_1207 $$unsorted)) (or (not (tptp.disjoint BOUND_VARIABLE_1191 BOUND_VARIABLE_1193)) (not (tptp.in BOUND_VARIABLE_1207 BOUND_VARIABLE_1191)) (not (tptp.in BOUND_VARIABLE_1207 BOUND_VARIABLE_1193)))))) (let ((_let_45 (_let_44))) (let ((_let_46 (or _let_21 _let_41))) (let ((_let_47 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.disjoint A B)) (tptp.disjoint B A))))) (let ((_let_48 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_8)) :args ((or _let_7 _let_6 (not _let_8)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_43)) :args ((or _let_42 _let_10 _let_40 (not _let_43)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_46)) :args ((or _let_21 _let_41 (not _let_46)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_24 1)) (CONG _let_38 (MACRO_SR_PRED_INTRO :args ((= (not _let_21) _let_20))) :args _let_28)) :args ((or _let_20 _let_24))) _let_30 :args (_let_20 true _let_24)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_48 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.disjoint A B) false))))) :args (_let_47))) _let_48 :args (_let_46 false _let_47)) :args (_let_41 false _let_20 false _let_46)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_11 1)) (CONG _let_33 (MACRO_SR_PRED_INTRO :args ((= (not _let_10) _let_9))) :args _let_28)) :args ((or _let_9 _let_11))) _let_32 :args (_let_9 true _let_11)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_45) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.disjoint BOUND_VARIABLE_1191 BOUND_VARIABLE_1193) false)) (not (= (tptp.in BOUND_VARIABLE_1207 BOUND_VARIABLE_1191) false))))) :args _let_45)) (AND_ELIM _let_18 :args (1)) :args (_let_43 false _let_44)) :args (_let_40 false _let_41 false _let_9 false _let_43)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_39) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.in C SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4) false))))) :args _let_39)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_35)) :args ((or _let_23 _let_34 (not _let_35)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_24 0)) (CONG _let_38 (MACRO_SR_PRED_INTRO :args ((= (not _let_23) _let_22))) :args _let_28)) :args ((or _let_22 _let_24))) _let_30 :args (_let_22 true _let_24)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_37 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.subset A B)))) :args (_let_36))) _let_37 :args (_let_35 false _let_36)) :args (_let_34 false _let_22 false _let_35)) :args (_let_8 false _let_34)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_11 0)) (CONG _let_33 (MACRO_SR_PRED_INTRO :args ((= (not _let_7) _let_5))) :args _let_28)) :args ((or _let_5 _let_11))) _let_32 :args (_let_5 true _let_11)) :args (false true _let_6 false _let_8 false _let_5)) :args ((forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.proper_subset A B) (not (tptp.proper_subset B A)))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_union2 A B) (tptp.set_union2 B A))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_intersection2 A B) (tptp.set_intersection2 B A))) (forall ((A $$unsorted) (B $$unsorted)) (= (= A B) (and (tptp.subset A B) (tptp.subset B A)))) (forall ((A $$unsorted)) (= (= A tptp.empty_set) (forall ((B $$unsorted)) (not (tptp.in B A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.set_union2 A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (or (tptp.in D A) (tptp.in D B)))))) _let_4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.set_intersection2 A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.in D A) (tptp.in D B)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.set_difference A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.in D A) (not (tptp.in D B))))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.disjoint A B) (= (tptp.set_intersection2 A B) tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.proper_subset A B) (and (tptp.subset A B) (not (= A B))))) true true true true (tptp.empty tptp.empty_set) (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)) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_intersection2 A A) A)) (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.proper_subset A A))) (forall ((A $$unsorted) (B $$unsorted)) (= (= (tptp.set_difference A B) tptp.empty_set) (tptp.subset A B))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (not (tptp.empty A))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset A A)) _let_3 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset A B) (= (tptp.set_union2 A B) B))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset (tptp.set_intersection2 A B) A)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset A C)) (tptp.subset A (tptp.set_intersection2 B C)))) (forall ((A $$unsorted)) (= (tptp.set_union2 A tptp.empty_set) A)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset B C)) (tptp.subset A C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.subset A B) (tptp.subset (tptp.set_intersection2 A C) (tptp.set_intersection2 B C)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset A B) (= (tptp.set_intersection2 A B) A))) (forall ((A $$unsorted)) (= (tptp.set_intersection2 A tptp.empty_set) tptp.empty_set)) (forall ((A $$unsorted) (B $$unsorted)) (=> (forall ((C $$unsorted)) (= (tptp.in C A) (tptp.in C B))) (= A B))) (forall ((A $$unsorted)) (tptp.subset tptp.empty_set A)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.subset A B) (tptp.subset (tptp.set_difference A C) (tptp.set_difference B C)))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset (tptp.set_difference A B) A)) (forall ((A $$unsorted) (B $$unsorted)) (= (= (tptp.set_difference A B) tptp.empty_set) (tptp.subset A B))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_union2 A (tptp.set_difference B A)) (tptp.set_union2 A B))) (forall ((A $$unsorted)) (= (tptp.set_difference A tptp.empty_set) A)) _let_2 (forall ((A $$unsorted)) (=> (tptp.subset A tptp.empty_set) (= A tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_difference (tptp.set_union2 A B) B) (tptp.set_difference A B))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset A B) (= B (tptp.set_union2 A (tptp.set_difference B A))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_difference A (tptp.set_difference A B)) (tptp.set_intersection2 A B))) (forall ((A $$unsorted)) (= (tptp.set_difference tptp.empty_set A) tptp.empty_set)) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.disjoint A B))) (and (not (and (not _let_1) (forall ((C $$unsorted)) (not (tptp.in C (tptp.set_intersection2 A B)))))) (not (and (exists ((C $$unsorted)) (tptp.in C (tptp.set_intersection2 A B))) _let_1))))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.subset A B) (tptp.proper_subset B A)))) _let_1 (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)) (tptp.subset A (tptp.set_union2 A B))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.empty A) (not (= A B)) (tptp.empty B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset C B)) (tptp.subset (tptp.set_union2 A C) B))) true)))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.18/0.55 )
% 0.18/0.55 % SZS output end Proof for SEU140+2
% 0.18/0.55 % cvc5---1.0.5 exiting
% 0.18/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------