TSTP Solution File: NUM009-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NUM009-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n014.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 10:41:58 EDT 2023
% Result : Unsatisfiable 0.22s 0.68s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM009-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.16 % Command : do_cvc5 %s %d
% 0.16/0.37 % Computer : n014.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri Aug 25 15:52:03 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.22/0.52 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.53 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.J7XJ7mS5vR/cvc5---1.0.5_5468.p...
% 0.22/0.56 ------- get file name : TPTP file name is NUM009-1
% 0.22/0.57 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_5468.smt2...
% 0.22/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.68 % SZS status Unsatisfiable for NUM009-1
% 0.22/0.68 % SZS output start Proof for NUM009-1
% 0.22/0.69 (
% 0.22/0.69 (let ((_let_1 (tptp.member tptp.empty_set tptp.natural_numbers))) (let ((_let_2 (not _let_1))) (let ((_let_3 (forall ((Z $$unsorted)) (or (tptp.member Z tptp.natural_numbers) (not (tptp.member Z (tptp.f44 Z))))))) (let ((_let_4 (forall ((Z $$unsorted)) (or (tptp.member Z tptp.natural_numbers) (not (tptp.little_set Z)) (tptp.member tptp.empty_set (tptp.f44 Z)))))) (let ((_let_5 (tptp.member tptp.empty_set tptp.infinity))) (let ((_let_6 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.member X Y)) (tptp.little_set X))))) (let ((_let_7 (tptp.member tptp.empty_set (tptp.f44 tptp.empty_set)))) (let ((_let_8 (tptp.little_set tptp.empty_set))) (let ((_let_9 (not _let_8))) (let ((_let_10 (or _let_1 _let_9 _let_7))) (let ((_let_11 (ASSUME :args (_let_2)))) (let ((_let_12 (_let_4))) (let ((_let_13 (ASSUME :args _let_12))) (let ((_let_14 (not _let_5))) (let ((_let_15 (or _let_14 _let_8))) (let ((_let_16 (_let_6))) (let ((_let_17 (ASSUME :args _let_16))) (let ((_let_18 (not _let_7))) (let ((_let_19 (or _let_1 _let_18))) (let ((_let_20 (_let_3))) (let ((_let_21 (ASSUME :args _let_20))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_10)) :args ((or _let_1 _let_9 _let_7 (not _let_10)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_1 _let_18 (not _let_19)))) _let_11 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (tptp.empty_set QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.member Z tptp.natural_numbers) true))))) :args _let_20)) _let_21 :args (_let_19 false _let_3)) :args (_let_18 true _let_1 false _let_19)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_15)) :args ((or _let_14 _let_8 (not _let_15)))) (ASSUME :args (_let_5)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_17 :args (tptp.empty_set tptp.infinity QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.member X Y) false))))) :args _let_16)) _let_17 :args (_let_15 false _let_6)) :args (_let_8 false _let_5 false _let_15)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_13 :args (tptp.empty_set QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.member Z tptp.natural_numbers) true))))) :args _let_12)) _let_13 :args (_let_10 false _let_4)) _let_11 :args (false true _let_7 false _let_8 false _let_10 true _let_1)) :args (_let_6 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.little_set (tptp.f1 X Y)) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.f1 X Y))) (or (tptp.member _let_1 X) (tptp.member _let_1 Y) (= X Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.f1 X Y))) (or (not (tptp.member _let_1 X)) (not (tptp.member _let_1 Y)) (= X Y)))) (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member U (tptp.non_ordered_pair X Y))) (= U X) (= U Y))) (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member U (tptp.non_ordered_pair X Y)) (not (tptp.little_set U)) (not (= U X)))) (forall ((U $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member U (tptp.non_ordered_pair X Y)) (not (tptp.little_set U)) (not (= U Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.little_set (tptp.non_ordered_pair X Y))) (forall ((X $$unsorted)) (= (tptp.singleton_set X) (tptp.non_ordered_pair X X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.ordered_pair X Y) (tptp.non_ordered_pair (tptp.singleton_set X) (tptp.non_ordered_pair X Y)))) (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set (tptp.f2 X)))) (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (tptp.little_set (tptp.f3 X)))) (forall ((X $$unsorted)) (or (not (tptp.ordered_pair_predicate X)) (= X (tptp.ordered_pair (tptp.f2 X) (tptp.f3 X))))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (tptp.ordered_pair_predicate X) (not (tptp.little_set Y)) (not (tptp.little_set Z)) (not (= X (tptp.ordered_pair Y Z))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (tptp.little_set (tptp.f4 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (tptp.little_set (tptp.f5 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (= X (tptp.ordered_pair (tptp.f4 Z X) (tptp.f5 Z X))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.first X))) (tptp.member Z (tptp.f4 Z X)))) (forall ((Z $$unsorted) (X $$unsorted) (U $$unsorted) (V $$unsorted)) (or (tptp.member Z (tptp.first X)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (= X (tptp.ordered_pair U V))) (not (tptp.member Z U)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (tptp.little_set (tptp.f6 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (tptp.little_set (tptp.f7 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (= X (tptp.ordered_pair (tptp.f6 Z X) (tptp.f7 Z X))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.second X))) (tptp.member Z (tptp.f7 Z X)))) (forall ((Z $$unsorted) (X $$unsorted) (U $$unsorted) (V $$unsorted)) (or (tptp.member Z (tptp.second X)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (= X (tptp.ordered_pair U V))) (not (tptp.member Z V)))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.estin)) (tptp.ordered_pair_predicate Z))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.estin)) (tptp.member (tptp.first Z) (tptp.second Z)))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.estin) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Z)) (not (tptp.member (tptp.first Z) (tptp.second Z))))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z X))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.intersection X Y))) (tptp.member Z Y))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member Z (tptp.intersection X Y)) (not (tptp.member Z X)) (not (tptp.member Z Y)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.complement X))) (not (tptp.member Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (tptp.member Z (tptp.complement X)) (not (tptp.little_set Z)) (tptp.member Z X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.union X Y) (tptp.complement (tptp.intersection (tptp.complement X) (tptp.complement Y))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.domain_of X))) (tptp.ordered_pair_predicate (tptp.f8 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.domain_of X))) (tptp.member (tptp.f8 Z X) X))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.domain_of X))) (= Z (tptp.first (tptp.f8 Z X))))) (forall ((Z $$unsorted) (X $$unsorted) (Xp $$unsorted)) (or (tptp.member Z (tptp.domain_of X)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Xp)) (not (tptp.member Xp X)) (not (= Z (tptp.first Xp))))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (tptp.ordered_pair_predicate Z))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (tptp.member (tptp.first Z) X))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.cross_product X Y))) (tptp.member (tptp.second Z) Y))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member Z (tptp.cross_product X Y)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Z)) (not (tptp.member (tptp.first Z) X)) (not (tptp.member (tptp.second Z) Y)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.converse X))) (tptp.ordered_pair_predicate Z))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.converse X))) (tptp.member (tptp.ordered_pair (tptp.second Z) (tptp.first Z)) X))) (forall ((Z $$unsorted) (X $$unsorted)) (or (tptp.member Z (tptp.converse X)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Z)) (not (tptp.member (tptp.ordered_pair (tptp.second Z) (tptp.first Z)) X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.little_set (tptp.f9 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.little_set (tptp.f10 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.little_set (tptp.f11 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (= Z (tptp.ordered_pair (tptp.f9 Z X) (tptp.ordered_pair (tptp.f10 Z X) (tptp.f11 Z X)))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.rotate_right X))) (tptp.member (tptp.ordered_pair (tptp.f10 Z X) (tptp.ordered_pair (tptp.f11 Z X) (tptp.f9 Z X))) X))) (forall ((Z $$unsorted) (X $$unsorted) (U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (tptp.member Z (tptp.rotate_right X)) (not (tptp.little_set Z)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (tptp.little_set W)) (not (= Z (tptp.ordered_pair U (tptp.ordered_pair V W)))) (not (tptp.member (tptp.ordered_pair V (tptp.ordered_pair W U)) X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.little_set (tptp.f12 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.little_set (tptp.f13 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.little_set (tptp.f14 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (= Z (tptp.ordered_pair (tptp.f12 Z X) (tptp.ordered_pair (tptp.f13 Z X) (tptp.f14 Z X)))))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.flip_range_of X))) (tptp.member (tptp.ordered_pair (tptp.f12 Z X) (tptp.ordered_pair (tptp.f14 Z X) (tptp.f13 Z X))) X))) (forall ((Z $$unsorted) (X $$unsorted) (U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (tptp.member Z (tptp.flip_range_of X)) (not (tptp.little_set Z)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (tptp.little_set W)) (not (= Z (tptp.ordered_pair U (tptp.ordered_pair V W)))) (not (tptp.member (tptp.ordered_pair U (tptp.ordered_pair W V)) X)))) (forall ((X $$unsorted)) (= (tptp.successor X) (tptp.union X (tptp.singleton_set X)))) (forall ((Z $$unsorted)) (not (tptp.member Z tptp.empty_set))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.universal_set) (not (tptp.little_set Z)))) (tptp.little_set tptp.infinity) _let_5 (forall ((X $$unsorted)) (or (not (tptp.member X tptp.infinity)) (tptp.member (tptp.successor X) tptp.infinity))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.sigma X))) (tptp.member (tptp.f16 Z X) X))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.sigma X))) (tptp.member Z (tptp.f16 Z X)))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.member Z (tptp.sigma X)) (not (tptp.member Y X)) (not (tptp.member Z Y)))) (forall ((U $$unsorted)) (or (not (tptp.little_set U)) (tptp.little_set (tptp.sigma U)))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.subset X Y)) (not (tptp.member U X)) (tptp.member U Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (tptp.member (tptp.f17 X Y) X))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.subset X Y) (not (tptp.member (tptp.f17 X Y) Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.proper_subset X Y)) (tptp.subset X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.proper_subset X Y)) (not (= X Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.proper_subset X Y) (not (tptp.subset X Y)) (= X Y))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.powerset X))) (tptp.subset Z X))) (forall ((Z $$unsorted) (X $$unsorted)) (or (tptp.member Z (tptp.powerset X)) (not (tptp.little_set Z)) (not (tptp.subset Z X)))) (forall ((U $$unsorted)) (or (not (tptp.little_set U)) (tptp.little_set (tptp.powerset U)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.relation Z)) (not (tptp.member X Z)) (tptp.ordered_pair_predicate X))) (forall ((Z $$unsorted)) (or (tptp.relation Z) (tptp.member (tptp.f18 Z) Z))) (forall ((Z $$unsorted)) (or (tptp.relation Z) (not (tptp.ordered_pair_predicate (tptp.f18 Z))))) (forall ((X $$unsorted) (U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.single_valued_set X)) (not (tptp.little_set U)) (not (tptp.little_set V)) (not (tptp.little_set W)) (not (tptp.member (tptp.ordered_pair U V) X)) (not (tptp.member (tptp.ordered_pair U W) X)) (= V W))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.little_set (tptp.f19 X)))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.little_set (tptp.f20 X)))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.little_set (tptp.f21 X)))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.member (tptp.ordered_pair (tptp.f19 X) (tptp.f20 X)) X))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (tptp.member (tptp.ordered_pair (tptp.f19 X) (tptp.f21 X)) X))) (forall ((X $$unsorted)) (or (tptp.single_valued_set X) (not (= (tptp.f20 X) (tptp.f21 X))))) (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.relation Xf))) (forall ((Xf $$unsorted)) (or (not (tptp.function Xf)) (tptp.single_valued_set Xf))) (forall ((Xf $$unsorted)) (or (tptp.function Xf) (not (tptp.relation Xf)) (not (tptp.single_valued_set Xf)))) (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (tptp.ordered_pair_predicate (tptp.f22 Z X Xf)))) (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (tptp.member (tptp.f22 Z X Xf) Xf))) (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (tptp.member (tptp.first (tptp.f22 Z X Xf)) X))) (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted)) (or (not (tptp.member Z (tptp.image X Xf))) (= (tptp.second (tptp.f22 Z X Xf)) Z))) (forall ((Z $$unsorted) (X $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (tptp.member Z (tptp.image X Xf)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Y)) (not (tptp.member Y Xf)) (not (tptp.member (tptp.first Y) X)) (not (= (tptp.second Y) Z)))) (forall ((X $$unsorted) (Xf $$unsorted)) (or (not (tptp.little_set X)) (not (tptp.function Xf)) (tptp.little_set (tptp.image X Xf)))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) (or (not (tptp.disjoint X Y)) (not (tptp.member U X)) (not (tptp.member U Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.disjoint X Y) (tptp.member (tptp.f23 X Y) X))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.disjoint X Y) (tptp.member (tptp.f23 X Y) Y))) (forall ((X $$unsorted)) (or (= X tptp.empty_set) (tptp.member (tptp.f24 X) X))) (forall ((X $$unsorted)) (or (= X tptp.empty_set) (tptp.disjoint (tptp.f24 X) X))) (tptp.function tptp.f25) (forall ((X $$unsorted)) (or (not (tptp.little_set X)) (= X tptp.empty_set) (tptp.member (tptp.f26 X) X))) (forall ((X $$unsorted)) (or (not (tptp.little_set X)) (= X tptp.empty_set) (tptp.member (tptp.ordered_pair X (tptp.f26 X)) tptp.f25))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.range_of X))) (tptp.ordered_pair_predicate (tptp.f27 Z X)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.range_of X))) (tptp.member (tptp.f27 Z X) X))) (forall ((Z $$unsorted) (X $$unsorted)) (or (not (tptp.member Z (tptp.range_of X))) (= Z (tptp.second (tptp.f27 Z X))))) (forall ((Z $$unsorted) (X $$unsorted) (Xp $$unsorted)) (or (tptp.member Z (tptp.range_of X)) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Xp)) (not (tptp.member Xp X)) (not (= Z (tptp.second Xp))))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.identity_relation)) (tptp.ordered_pair_predicate Z))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.identity_relation)) (= (tptp.first Z) (tptp.second Z)))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.identity_relation) (not (tptp.little_set Z)) (not (tptp.ordered_pair_predicate Z)) (not (= (tptp.first Z) (tptp.second Z))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.restrict X Y) (tptp.intersection X (tptp.cross_product Y tptp.universal_set)))) (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one_function Xf)) (tptp.function Xf))) (forall ((Xf $$unsorted)) (or (not (tptp.one_to_one_function Xf)) (tptp.function (tptp.converse Xf)))) (forall ((Xf $$unsorted)) (or (tptp.one_to_one_function Xf) (not (tptp.function Xf)) (not (tptp.function (tptp.converse Xf))))) (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (tptp.ordered_pair_predicate (tptp.f28 Z Xf Y)))) (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (tptp.member (tptp.f28 Z Xf Y) Xf))) (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (= (tptp.first (tptp.f28 Z Xf Y)) Y))) (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted)) (or (not (tptp.member Z (tptp.apply Xf Y))) (tptp.member Z (tptp.second (tptp.f28 Z Xf Y))))) (forall ((Z $$unsorted) (Xf $$unsorted) (Y $$unsorted) (W $$unsorted)) (or (tptp.member Z (tptp.apply Xf Y)) (not (tptp.ordered_pair_predicate W)) (not (tptp.member W Xf)) (not (= (tptp.first W) Y)) (not (tptp.member Z (tptp.second W))))) (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (= (tptp.apply_to_two_arguments Xf X Y) (tptp.apply Xf (tptp.ordered_pair X Y)))) (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (tptp.function Xf))) (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (= (tptp.domain_of Xf) X))) (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.maps Xf X Y)) (tptp.subset (tptp.range_of Xf) Y))) (forall ((Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (tptp.maps Xf X Y) (not (tptp.function Xf)) (not (= (tptp.domain_of Xf) X)) (not (tptp.subset (tptp.range_of Xf) Y)))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.closed Xs Xf)) (tptp.little_set Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.closed Xs Xf)) (tptp.little_set Xf))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.closed Xs Xf)) (tptp.maps Xf (tptp.cross_product Xs Xs) Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (tptp.closed Xs Xf) (not (tptp.little_set Xs)) (not (tptp.little_set Xf)) (not (tptp.maps Xf (tptp.cross_product Xs Xs) Xs)))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.little_set (tptp.f29 Z Xf Xg)))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.little_set (tptp.f30 Z Xf Xg)))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.little_set (tptp.f31 Z Xf Xg)))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (= Z (tptp.ordered_pair (tptp.f29 Z Xf Xg) (tptp.f30 Z Xf Xg))))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.member (tptp.ordered_pair (tptp.f29 Z Xf Xg) (tptp.f31 Z Xf Xg)) Xf))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted)) (or (not (tptp.member Z (tptp.compose Xf Xg))) (tptp.member (tptp.ordered_pair (tptp.f31 Z Xf Xg) (tptp.f30 Z Xf Xg)) Xg))) (forall ((Z $$unsorted) (Xf $$unsorted) (Xg $$unsorted) (X $$unsorted) (Y $$unsorted) (W $$unsorted)) (or (tptp.member Z (tptp.compose Xf Xg)) (not (tptp.little_set Z)) (not (tptp.little_set X)) (not (tptp.little_set Y)) (not (tptp.little_set W)) (not (= Z (tptp.ordered_pair X Y))) (not (tptp.member (tptp.ordered_pair X W) Xf)) (not (tptp.member (tptp.ordered_pair W Y) Xg)))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (tptp.closed Xs1 Xf1))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (tptp.closed Xs2 Xf2))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (tptp.maps Xh Xs1 Xs2))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2)) (not (tptp.member X Xs1)) (not (tptp.member Y Xs1)) (= (tptp.apply Xh (tptp.apply_to_two_arguments Xf1 X Y)) (tptp.apply_to_two_arguments Xf2 (tptp.apply Xh X) (tptp.apply Xh Y))))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2) (not (tptp.closed Xs1 Xf1)) (not (tptp.closed Xs2 Xf2)) (not (tptp.maps Xh Xs1 Xs2)) (tptp.member (tptp.f32 Xh Xs1 Xf1 Xs2 Xf2) Xs1))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (or (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2) (not (tptp.closed Xs1 Xf1)) (not (tptp.closed Xs2 Xf2)) (not (tptp.maps Xh Xs1 Xs2)) (tptp.member (tptp.f33 Xh Xs1 Xf1 Xs2 Xf2) Xs1))) (forall ((Xh $$unsorted) (Xs1 $$unsorted) (Xf1 $$unsorted) (Xs2 $$unsorted) (Xf2 $$unsorted)) (let ((_let_1 (tptp.f33 Xh Xs1 Xf1 Xs2 Xf2))) (let ((_let_2 (tptp.f32 Xh Xs1 Xf1 Xs2 Xf2))) (or (tptp.homomorphism Xh Xs1 Xf1 Xs2 Xf2) (not (tptp.closed Xs1 Xf1)) (not (tptp.closed Xs2 Xf2)) (not (tptp.maps Xh Xs1 Xs2)) (not (= (tptp.apply Xh (tptp.apply_to_two_arguments Xf1 _let_2 _let_1)) (tptp.apply_to_two_arguments Xf2 (tptp.apply Xh _let_2) (tptp.apply Xh _let_1)))))))) (forall ((Xs $$unsorted) (Xf $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.associative Xs Xf)) (not (tptp.member X Xs)) (not (tptp.member Y Xs)) (not (tptp.member Z Xs)) (= (tptp.apply_to_two_arguments Xf (tptp.apply_to_two_arguments Xf X Y) Z) (tptp.apply_to_two_arguments Xf X (tptp.apply_to_two_arguments Xf Y Z))))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (tptp.associative Xs Xf) (tptp.member (tptp.f34 Xs Xf) Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (tptp.associative Xs Xf) (tptp.member (tptp.f35 Xs Xf) Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (tptp.associative Xs Xf) (tptp.member (tptp.f36 Xs Xf) Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (let ((_let_1 (tptp.f36 Xs Xf))) (let ((_let_2 (tptp.f35 Xs Xf))) (let ((_let_3 (tptp.f34 Xs Xf))) (or (tptp.associative Xs Xf) (not (= (tptp.apply_to_two_arguments Xf (tptp.apply_to_two_arguments Xf _let_3 _let_2) _let_1) (tptp.apply_to_two_arguments Xf _let_3 (tptp.apply_to_two_arguments Xf _let_2 _let_1))))))))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted)) (or (not (tptp.identity Xs Xf Xe)) (tptp.member Xe Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted) (X $$unsorted)) (or (not (tptp.identity Xs Xf Xe)) (not (tptp.member X Xs)) (= (tptp.apply_to_two_arguments Xf Xe X) X))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted) (X $$unsorted)) (or (not (tptp.identity Xs Xf Xe)) (not (tptp.member X Xs)) (= (tptp.apply_to_two_arguments Xf X Xe) X))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted)) (or (tptp.identity Xs Xf Xe) (not (tptp.member Xe Xs)) (tptp.member (tptp.f37 Xs Xf Xe) Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted)) (let ((_let_1 (tptp.f37 Xs Xf Xe))) (or (tptp.identity Xs Xf Xe) (not (tptp.member Xe Xs)) (not (= (tptp.apply_to_two_arguments Xf Xe _let_1) _let_1)) (not (= (tptp.apply_to_two_arguments Xf _let_1 Xe) _let_1))))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted) (Xg $$unsorted)) (or (not (tptp.inverse Xs Xf Xe Xg)) (tptp.maps Xg Xs Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted) (Xg $$unsorted) (X $$unsorted)) (or (not (tptp.inverse Xs Xf Xe Xg)) (not (tptp.member X Xs)) (= (tptp.apply_to_two_arguments Xf (tptp.apply Xg X) X) Xe))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted) (Xg $$unsorted) (X $$unsorted)) (or (not (tptp.inverse Xs Xf Xe Xg)) (not (tptp.member X Xs)) (= (tptp.apply_to_two_arguments Xf X (tptp.apply Xg X)) Xe))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted) (Xg $$unsorted)) (or (tptp.inverse Xs Xf Xe Xg) (not (tptp.maps Xg Xs Xs)) (tptp.member (tptp.f38 Xs Xf Xe Xg) Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted) (Xg $$unsorted)) (let ((_let_1 (tptp.f38 Xs Xf Xe Xg))) (let ((_let_2 (tptp.apply Xg _let_1))) (or (tptp.inverse Xs Xf Xe Xg) (not (tptp.maps Xg Xs Xs)) (not (= (tptp.apply_to_two_arguments Xf _let_2 _let_1) Xe)) (not (= (tptp.apply_to_two_arguments Xf _let_1 _let_2) Xe)))))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.group Xs Xf)) (tptp.closed Xs Xf))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.group Xs Xf)) (tptp.associative Xs Xf))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.group Xs Xf)) (tptp.identity Xs Xf (tptp.f39 Xs Xf)))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (not (tptp.group Xs Xf)) (tptp.inverse Xs Xf (tptp.f39 Xs Xf) (tptp.f40 Xs Xf)))) (forall ((Xs $$unsorted) (Xf $$unsorted) (Xe $$unsorted) (Xg $$unsorted)) (or (tptp.group Xs Xf) (not (tptp.closed Xs Xf)) (not (tptp.associative Xs Xf)) (not (tptp.identity Xs Xf Xe)) (not (tptp.inverse Xs Xf Xe Xg)))) (forall ((Xs $$unsorted) (Xf $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.commutes Xs Xf)) (not (tptp.member X Xs)) (not (tptp.member Y Xs)) (= (tptp.apply_to_two_arguments Xf X Y) (tptp.apply_to_two_arguments Xf Y X)))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (tptp.commutes Xs Xf) (tptp.member (tptp.f41 Xs Xf) Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (or (tptp.commutes Xs Xf) (tptp.member (tptp.f42 Xs Xf) Xs))) (forall ((Xs $$unsorted) (Xf $$unsorted)) (let ((_let_1 (tptp.f41 Xs Xf))) (let ((_let_2 (tptp.f42 Xs Xf))) (or (tptp.commutes Xs Xf) (not (= (tptp.apply_to_two_arguments Xf _let_1 _let_2) (tptp.apply_to_two_arguments Xf _let_2 _let_1))))))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.natural_numbers)) (not (tptp.little_set Xs)) (not (tptp.member tptp.empty_set Xs)) (tptp.member (tptp.f43 Z Xs) Xs) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.natural_numbers)) (not (tptp.little_set Xs)) (not (tptp.member tptp.empty_set Xs)) (not (tptp.member (tptp.successor (tptp.f43 Z Xs)) Xs)) (tptp.member Z Xs))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.natural_numbers) (not (tptp.little_set Z)) (tptp.little_set (tptp.f44 Z)))) _let_4 (forall ((Z $$unsorted) (Xk $$unsorted)) (let ((_let_1 (tptp.f44 Z))) (or (tptp.member Z tptp.natural_numbers) (not (tptp.little_set Z)) (not (tptp.member Xk _let_1)) (tptp.member (tptp.successor Xk) _let_1)))) _let_3 (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (tptp.member (tptp.f45 Z Xs) tptp.natural_numbers) (tptp.member (tptp.f46 Z Xs) tptp.natural_numbers) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (tptp.member (tptp.f45 Z Xs) tptp.natural_numbers) (tptp.member (tptp.f47 Z Xs) tptp.natural_numbers) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (tptp.member (tptp.f45 Z Xs) tptp.natural_numbers) (tptp.member (tptp.f48 Z Xs) tptp.natural_numbers) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (tptp.member (tptp.f45 Z Xs) tptp.natural_numbers) (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.f46 Z Xs) (tptp.f47 Z Xs)) (tptp.f48 Z Xs)) Xs) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (tptp.member (tptp.f45 Z Xs) tptp.natural_numbers) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.successor (tptp.f46 Z Xs)) (tptp.f47 Z Xs)) (tptp.successor (tptp.f48 Z Xs))) Xs)) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (let ((_let_1 (tptp.f45 Z Xs))) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set _let_1) _let_1) Xs)) (tptp.member (tptp.f46 Z Xs) tptp.natural_numbers) (tptp.member Z Xs)))) (forall ((Z $$unsorted) (Xs $$unsorted)) (let ((_let_1 (tptp.f45 Z Xs))) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set _let_1) _let_1) Xs)) (tptp.member (tptp.f47 Z Xs) tptp.natural_numbers) (tptp.member Z Xs)))) (forall ((Z $$unsorted) (Xs $$unsorted)) (let ((_let_1 (tptp.f45 Z Xs))) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set _let_1) _let_1) Xs)) (tptp.member (tptp.f48 Z Xs) tptp.natural_numbers) (tptp.member Z Xs)))) (forall ((Z $$unsorted) (Xs $$unsorted)) (let ((_let_1 (tptp.f45 Z Xs))) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set _let_1) _let_1) Xs)) (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.f46 Z Xs) (tptp.f47 Z Xs)) (tptp.f48 Z Xs)) Xs) (tptp.member Z Xs)))) (forall ((Z $$unsorted) (Xs $$unsorted)) (let ((_let_1 (tptp.f45 Z Xs))) (or (not (tptp.member Z tptp.plus)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set _let_1) _let_1) Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.successor (tptp.f46 Z Xs)) (tptp.f47 Z Xs)) (tptp.successor (tptp.f48 Z Xs))) Xs)) (tptp.member Z Xs)))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.plus) (not (tptp.little_set Z)) (tptp.little_set (tptp.f49 Z)))) (forall ((Z $$unsorted) (Xi $$unsorted)) (or (tptp.member Z tptp.plus) (not (tptp.little_set Z)) (not (tptp.member Xi tptp.natural_numbers)) (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set Xi) Xi) (tptp.f49 Z)))) (forall ((Z $$unsorted) (Uu1 $$unsorted) (Xj $$unsorted) (Xk $$unsorted)) (let ((_let_1 (tptp.f49 Z))) (or (tptp.member Z tptp.plus) (not (tptp.little_set Z)) (not (tptp.member Uu1 tptp.natural_numbers)) (not (tptp.member Xj tptp.natural_numbers)) (not (tptp.member Xk tptp.natural_numbers)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair Uu1 Xj) Xk) _let_1)) (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.successor Uu1) Xj) (tptp.successor Xk)) _let_1)))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.plus) (not (tptp.member Z (tptp.f49 Z))))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (tptp.member (tptp.f50 Z Xs) tptp.natural_numbers) (tptp.member (tptp.f51 Z Xs) tptp.natural_numbers) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (tptp.member (tptp.f50 Z Xs) tptp.natural_numbers) (tptp.member (tptp.f52 Z Xs) tptp.natural_numbers) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (tptp.member (tptp.f50 Z Xs) tptp.natural_numbers) (tptp.member (tptp.f53 Z Xs) tptp.natural_numbers) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (tptp.member (tptp.f50 Z Xs) tptp.natural_numbers) (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.f51 Z Xs) (tptp.f52 Z Xs)) (tptp.f53 Z Xs)) Xs) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (let ((_let_1 (tptp.f52 Z Xs))) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (tptp.member (tptp.f50 Z Xs) tptp.natural_numbers) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.successor (tptp.f51 Z Xs)) _let_1) (tptp.apply_to_two_arguments tptp.plus (tptp.f53 Z Xs) _let_1)) Xs)) (tptp.member Z Xs)))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set (tptp.f50 Z Xs)) tptp.empty_set) Xs)) (tptp.member (tptp.f51 Z Xs) tptp.natural_numbers) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set (tptp.f50 Z Xs)) tptp.empty_set) Xs)) (tptp.member (tptp.f52 Z Xs) tptp.natural_numbers) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set (tptp.f50 Z Xs)) tptp.empty_set) Xs)) (tptp.member (tptp.f53 Z Xs) tptp.natural_numbers) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set (tptp.f50 Z Xs)) tptp.empty_set) Xs)) (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.f51 Z Xs) (tptp.f52 Z Xs)) (tptp.f53 Z Xs)) Xs) (tptp.member Z Xs))) (forall ((Z $$unsorted) (Xs $$unsorted)) (let ((_let_1 (tptp.f52 Z Xs))) (or (not (tptp.member Z tptp.times)) (not (tptp.little_set Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set (tptp.f50 Z Xs)) tptp.empty_set) Xs)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.successor (tptp.f51 Z Xs)) _let_1) (tptp.apply_to_two_arguments tptp.plus (tptp.f53 Z Xs) _let_1)) Xs)) (tptp.member Z Xs)))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.times) (not (tptp.little_set Z)) (tptp.little_set (tptp.f54 Z)))) (forall ((Z $$unsorted) (Xi $$unsorted)) (or (tptp.member Z tptp.times) (not (tptp.little_set Z)) (not (tptp.member Xi tptp.natural_numbers)) (tptp.member (tptp.ordered_pair (tptp.ordered_pair tptp.empty_set Xi) tptp.empty_set) (tptp.f54 Z)))) (forall ((Z $$unsorted) (Uu2 $$unsorted) (Xj $$unsorted) (Xk $$unsorted)) (let ((_let_1 (tptp.f54 Z))) (or (tptp.member Z tptp.times) (not (tptp.little_set Z)) (not (tptp.member Uu2 tptp.natural_numbers)) (not (tptp.member Xj tptp.natural_numbers)) (not (tptp.member Xk tptp.natural_numbers)) (not (tptp.member (tptp.ordered_pair (tptp.ordered_pair Uu2 Xj) Xk) _let_1)) (tptp.member (tptp.ordered_pair (tptp.ordered_pair (tptp.successor Uu2) Xj) (tptp.apply_to_two_arguments tptp.plus Xk Xj)) _let_1)))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.times) (not (tptp.member Z (tptp.f54 Z))))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.prime_numbers)) (tptp.member Z tptp.natural_numbers))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.prime_numbers)) (not (= Z tptp.empty_set)))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.prime_numbers)) (not (= Z (tptp.successor tptp.empty_set))))) (forall ((Z $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.member Z tptp.prime_numbers)) (not (tptp.member U tptp.natural_numbers)) (not (tptp.member V tptp.natural_numbers)) (not (= (tptp.apply_to_two_arguments tptp.times U V) Z)) (tptp.member U (tptp.non_ordered_pair (tptp.successor tptp.empty_set) Z)))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.prime_numbers) (not (tptp.member Z tptp.natural_numbers)) (= Z tptp.empty_set) (= Z (tptp.successor tptp.empty_set)) (tptp.member (tptp.f55 Z) tptp.natural_numbers))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.prime_numbers) (not (tptp.member Z tptp.natural_numbers)) (= Z tptp.empty_set) (= Z (tptp.successor tptp.empty_set)) (tptp.member (tptp.f56 Z) tptp.natural_numbers))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.prime_numbers) (not (tptp.member Z tptp.natural_numbers)) (= Z tptp.empty_set) (= Z (tptp.successor tptp.empty_set)) (= (tptp.apply_to_two_arguments tptp.times (tptp.f55 Z) (tptp.f56 Z)) Z))) (forall ((Z $$unsorted)) (let ((_let_1 (tptp.successor tptp.empty_set))) (or (tptp.member Z tptp.prime_numbers) (not (tptp.member Z tptp.natural_numbers)) (= Z tptp.empty_set) (= Z _let_1) (not (tptp.member (tptp.f55 Z) (tptp.non_ordered_pair _let_1 Z)))))) (forall ((X $$unsorted)) (or (not (tptp.finite X)) (tptp.member (tptp.f57 X) tptp.natural_numbers))) (forall ((X $$unsorted)) (or (not (tptp.finite X)) (tptp.maps (tptp.f58 X) (tptp.f57 X) X))) (forall ((X $$unsorted)) (or (not (tptp.finite X)) (= (tptp.range_of (tptp.f58 X)) X))) (forall ((X $$unsorted)) (or (not (tptp.finite X)) (tptp.one_to_one_function (tptp.f58 X)))) (forall ((X $$unsorted) (Xn $$unsorted) (Xf $$unsorted)) (or (tptp.finite X) (not (tptp.member Xn tptp.natural_numbers)) (not (tptp.maps Xf Xn X)) (not (= (tptp.range_of Xf) X)) (not (tptp.one_to_one_function Xf)))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.twin_prime_numbers)) (tptp.member Z tptp.prime_numbers))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.twin_prime_numbers)) (tptp.member (tptp.successor (tptp.successor Z)) tptp.prime_numbers))) (forall ((Z $$unsorted)) (or (tptp.member Z tptp.twin_prime_numbers) (not (tptp.member Z tptp.prime_numbers)) (not (tptp.member (tptp.successor (tptp.successor Z)) tptp.prime_numbers)))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.even_numbers)) (tptp.member Z tptp.natural_numbers))) (forall ((Z $$unsorted)) (or (not (tptp.member Z tptp.even_numbers)) (tptp.member (tptp.f59 Z) tptp.natural_numbers))) (forall ((Z $$unsorted)) (let ((_let_1 (tptp.f59 Z))) (or (not (tptp.member Z tptp.even_numbers)) (= (tptp.apply_to_two_arguments tptp.plus _let_1 _let_1) Z)))) (forall ((Z $$unsorted) (X $$unsorted)) (or (tptp.member Z tptp.even_numbers) (not (tptp.member Z tptp.natural_numbers)) (not (tptp.member X tptp.natural_numbers)) (not (= (tptp.apply_to_two_arguments tptp.plus X X) Z)))) _let_2))))))))))))))))))))))))
% 0.22/0.69 )
% 0.22/0.69 % SZS output end Proof for NUM009-1
% 0.22/0.69 % cvc5---1.0.5 exiting
% 0.22/0.70 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------