TSTP Solution File: SEU167+2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU167+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n010.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:45 EDT 2023
% Result : Theorem 0.97s 1.16s
% Output : Proof 0.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU167+2 : TPTP v8.1.2. Released v3.3.0.
% 0.15/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n010.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 : Wed Aug 23 23:41:36 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.97/1.16 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.ZSo5Ml9Cjt/cvc5---1.0.5_4667.p...
% 0.97/1.16 ------- get file name : TPTP file name is SEU167+2
% 0.97/1.16 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_4667.smt2...
% 0.97/1.16 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.97/1.16 % SZS status Theorem for SEU167+2
% 0.97/1.16 % SZS output start Proof for SEU167+2
% 0.97/1.16 (
% 0.97/1.16 (let ((_let_1 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset B C)) (tptp.subset A C))))) (let ((_let_2 (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (and (tptp.subset A B) (tptp.subset C D)) (tptp.subset (tptp.cartesian_product2 A C) (tptp.cartesian_product2 B D))))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.subset A B) (and (tptp.subset (tptp.cartesian_product2 A C) (tptp.cartesian_product2 B C)) (tptp.subset (tptp.cartesian_product2 C A) (tptp.cartesian_product2 C B))))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.subset A B)) (not (tptp.subset B C)) (tptp.subset A C))))) (let ((_let_5 (tptp.cartesian_product2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_6 (tptp.cartesian_product2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_7 (tptp.subset _let_6 _let_5))) (let ((_let_8 (tptp.cartesian_product2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_9 (tptp.subset _let_8 _let_5))) (let ((_let_10 (not _let_9))) (let ((_let_11 (tptp.subset _let_6 _let_8))) (let ((_let_12 (not _let_11))) (let ((_let_13 (or _let_12 _let_10 _let_7))) (let ((_let_14 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_15 (not _let_13))) (let ((_let_16 (tptp.cartesian_product2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_17 (and (tptp.subset _let_16 (tptp.cartesian_product2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5)) _let_9))) (let ((_let_18 (tptp.subset SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_19 (not _let_18))) (let ((_let_20 (or _let_19 _let_17))) (let ((_let_21 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.subset A B)) (and (tptp.subset (tptp.cartesian_product2 A C) (tptp.cartesian_product2 B C)) (tptp.subset (tptp.cartesian_product2 C A) (tptp.cartesian_product2 C B))))))) (let ((_let_22 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_23 (_let_21))) (let ((_let_24 (tptp.subset SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_25 (not _let_24))) (let ((_let_26 (or _let_25 _let_19 _let_7))) (let ((_let_27 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.subset A B)) (not (tptp.subset C D)) (tptp.subset (tptp.cartesian_product2 A C) (tptp.cartesian_product2 B D)))))) (let ((_let_28 (not _let_26))) (let ((_let_29 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_30 (or))) (let ((_let_31 (not _let_27))) (let ((_let_32 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_29) :args (_let_31))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_31) _let_27))) (REFL :args (_let_28)) :args _let_30)) _let_29 :args (_let_28 true _let_27)))) (let ((_let_33 (REFL :args (_let_26)))) (let ((_let_34 (and _let_11 (tptp.subset (tptp.cartesian_product2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4) _let_16)))) (let ((_let_35 (or _let_25 _let_34))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_14 :args (_let_6 _let_8 _let_5 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.subset A B) false)) (not (= (tptp.subset B C) false))))) :args (_let_4))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_13)) :args ((or _let_7 _let_12 _let_10 _let_15))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_26 2)) _let_32 :args ((not _let_7) true _let_26)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_34 0)) :args ((or _let_11 (not _let_34)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_35)) :args ((or _let_25 _let_34 (not _let_35)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_26 0)) (CONG _let_33 (MACRO_SR_PRED_INTRO :args ((= (not _let_25) _let_24))) :args _let_30)) :args ((or _let_24 _let_26))) _let_32 :args (_let_24 true _let_26)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_22 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 QUANTIFIERS_INST_E_MATCHING ((tptp.subset (tptp.cartesian_product2 A C) (tptp.cartesian_product2 B C))))) :args _let_23)) _let_22 :args (_let_35 false _let_21)) :args (_let_34 false _let_24 false _let_35)) :args (_let_11 false _let_34)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_17 1)) :args ((or _let_9 (not _let_17)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_20)) :args ((or _let_19 _let_17 (not _let_20)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_26 1)) (CONG _let_33 (MACRO_SR_PRED_INTRO :args ((= (not _let_19) _let_18))) :args _let_30)) :args ((or _let_18 _let_26))) _let_32 :args (_let_18 true _let_26)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_22 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING ((tptp.subset (tptp.cartesian_product2 C A) (tptp.cartesian_product2 C B))))) :args _let_23)) _let_22 :args (_let_20 false _let_21)) :args (_let_17 false _let_18 false _let_20)) :args (_let_9 false _let_17)) :args (_let_15 true _let_7 false _let_11 false _let_9)) _let_14 :args (false true _let_13 false _let_4)) :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.unordered_pair A B) (tptp.unordered_pair 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) (B $$unsorted)) (= (= B (tptp.singleton A)) (forall ((C $$unsorted)) (= (tptp.in C B) (= C A))))) (forall ((A $$unsorted)) (= (= A tptp.empty_set) (forall ((B $$unsorted)) (not (tptp.in B A))))) (forall ((A $$unsorted) (B $$unsorted)) (= (= B (tptp.powerset A)) (forall ((C $$unsorted)) (= (tptp.in C B) (tptp.subset C A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.unordered_pair A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (or (= D A) (= D B)))))) (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)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (= C (tptp.cartesian_product2 A B)) (forall ((D $$unsorted)) (= (tptp.in D C) (exists ((E $$unsorted) (F $$unsorted)) (and (tptp.in E A) (tptp.in F B) (= D (tptp.ordered_pair E F)))))))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset A B) (forall ((C $$unsorted)) (=> (tptp.in C A) (tptp.in C B))))) (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)) (= (= B (tptp.union A)) (forall ((C $$unsorted)) (= (tptp.in C B) (exists ((D $$unsorted)) (and (tptp.in C D) (tptp.in D A))))))) (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.ordered_pair A B) (tptp.unordered_pair (tptp.unordered_pair A B) (tptp.singleton A)))) (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 true true true true true true (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)) (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)) (not (= (tptp.singleton A) tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (= (tptp.set_union2 (tptp.singleton A) B) B))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.disjoint (tptp.singleton A) B) (tptp.in A B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (not (tptp.in A B)) (tptp.disjoint (tptp.singleton A) B))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.subset (tptp.singleton A) B) (tptp.in A B))) (forall ((A $$unsorted) (B $$unsorted)) (= (= (tptp.set_difference A B) tptp.empty_set) (tptp.subset A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.subset A B) (or (tptp.in C A) (tptp.subset A (tptp.set_difference B (tptp.singleton C)))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.singleton B))) (= (tptp.subset A _let_1) (or (= A tptp.empty_set) (= A _let_1))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.subset A (tptp.union B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (= (tptp.in (tptp.ordered_pair A B) (tptp.cartesian_product2 C D)) (and (tptp.in A C) (tptp.in B D)))) (exists ((A $$unsorted)) (tptp.empty A)) (exists ((A $$unsorted)) (not (tptp.empty A))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset A A)) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.disjoint A B) (tptp.disjoint B A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (= (tptp.in (tptp.ordered_pair A B) (tptp.cartesian_product2 C D)) (and (tptp.in A C) (tptp.in B D)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (not (and (= (tptp.unordered_pair A B) (tptp.unordered_pair C D)) (not (= A C)) (not (= A D))))) _let_3 _let_2 (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)) _let_1 (= (tptp.powerset tptp.empty_set) (tptp.singleton tptp.empty_set)) (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) (C $$unsorted) (D $$unsorted)) (=> (= (tptp.ordered_pair A B) (tptp.ordered_pair C D)) (and (= A C) (= B D)))) (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.subset (tptp.singleton A) B) (tptp.in A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (tptp.subset (tptp.unordered_pair A B) C) (and (tptp.in A C) (tptp.in B C)))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_union2 A (tptp.set_difference B A)) (tptp.set_union2 A B))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.singleton B))) (= (tptp.subset A _let_1) (or (= A tptp.empty_set) (= A _let_1))))) (forall ((A $$unsorted)) (= (tptp.set_difference A tptp.empty_set) A)) (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))))) (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.in A B) (= (tptp.set_union2 (tptp.singleton A) B) B))) (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)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.subset A B) (tptp.disjoint B C)) (tptp.disjoint A C))) (forall ((A $$unsorted) (B $$unsorted)) (= (= (tptp.set_difference A (tptp.singleton B)) A) (not (tptp.in B A)))) (forall ((A $$unsorted)) (= (tptp.unordered_pair A A) (tptp.singleton A))) (forall ((A $$unsorted)) (=> (tptp.empty A) (= A tptp.empty_set))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset (tptp.singleton A) (tptp.singleton B)) (= A B))) (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)) (= (tptp.disjoint A B) (= (tptp.set_difference A B) A))) (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))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (= (tptp.singleton A) (tptp.unordered_pair B C)) (= A B))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (tptp.subset A (tptp.union B)))) (forall ((A $$unsorted)) (= (tptp.union (tptp.powerset A)) A)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (= (tptp.singleton A) (tptp.unordered_pair B C)) (= B C))) true))))))))))))))))))))))))))))))))))))))
% 0.97/1.17 )
% 0.97/1.17 % SZS output end Proof for SEU167+2
% 0.97/1.17 % cvc5---1.0.5 exiting
% 0.97/1.17 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------