TSTP Solution File: SEU137+2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU137+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:29 EDT 2023
% Result : Theorem 0.20s 0.54s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU137+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 23 23:30:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.54 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.90Z1ixTI3z/cvc5---1.0.5_22084.p...
% 0.20/0.54 ------- get file name : TPTP file name is SEU137+2
% 0.20/0.54 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_22084.smt2...
% 0.20/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.54 % SZS status Theorem for SEU137+2
% 0.20/0.54 % SZS output start Proof for SEU137+2
% 0.20/0.54 (
% 0.20/0.54 (let ((_let_1 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset A B) (= B (tptp.set_union2 A (tptp.set_difference B A)))))))) (let ((_let_2 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.set_union2 A (tptp.set_difference B A)) (tptp.set_union2 A B))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.subset A B) (= (tptp.set_union2 A B) B))))) (let ((_let_4 (tptp.set_union2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 (tptp.set_difference SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)))) (let ((_let_5 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 _let_4))) (let ((_let_6 (tptp.set_union2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_7 (= _let_4 _let_6))) (let ((_let_8 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 _let_6))) (let ((_let_9 (tptp.subset SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_10 (not _let_9))) (let ((_let_11 (or _let_10 _let_5))) (let ((_let_12 (not _let_5))) (let ((_let_13 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.subset A B)) (= B (tptp.set_union2 A (tptp.set_difference B A))))))) (let ((_let_14 (not _let_11))) (let ((_let_15 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_16 (or))) (let ((_let_17 (not _let_13))) (let ((_let_18 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_15) :args (_let_17))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_17) _let_13))) (REFL :args (_let_14)) :args _let_16)) _let_15 :args (_let_14 true _let_13)))) (let ((_let_19 (_let_2))) (let ((_let_20 (ASSUME :args _let_19))) (let ((_let_21 (or _let_10 _let_8))) (let ((_let_22 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.subset A B)) (= B (tptp.set_union2 A B)))))) (let ((_let_23 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_24 (not _let_7))) (let ((_let_25 (not _let_8))) (let ((_let_26 (and _let_12 _let_7))) (let ((_let_27 (_let_12 _let_7))) (let ((_let_28 (ASSUME :args (_let_12)))) (let ((_let_29 (ASSUME :args (_let_7)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (RESOLUTION (CNF_AND_NEG :args (_let_26)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_28 _let_29) (SCOPE (FALSE_ELIM (TRANS (CONG (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5)) (SYMM _let_29) :args (=)) (FALSE_INTRO _let_28))) :args _let_27)) :args _let_27)) :args (true _let_26)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_5))) (REFL :args (_let_24)) (REFL :args (_let_25)) :args _let_16)) :args ((or _let_5 _let_25 _let_24))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_21)) :args ((or _let_10 _let_8 (not _let_21)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_11 0)) (CONG (REFL :args (_let_11)) (MACRO_SR_PRED_INTRO :args ((= (not _let_10) _let_9))) :args _let_16)) :args ((or _let_9 _let_11))) _let_18 :args (_let_9 true _let_11)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_23 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.subset A B) false))))) :args (_let_22))) _let_23 :args (_let_21 false _let_22)) :args (_let_8 false _let_9 false _let_21)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_20 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.set_difference B A)))) :args _let_19)) _let_20 :args (_let_7 false _let_2)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_11 1)) _let_18 :args (_let_12 true _let_11)) :args (false false _let_8 false _let_7 true _let_5)) :args ((forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in 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)))))) (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) (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))) 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)) (= (= (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)) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.disjoint A B) (tptp.disjoint B A))) _let_3 (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))) _let_2 (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))) _let_1 (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)) (=> (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.20/0.54 )
% 0.20/0.54 % SZS output end Proof for SEU137+2
% 0.20/0.54 % cvc5---1.0.5 exiting
% 0.20/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------