TSTP Solution File: SET025+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET025+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% 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 : 0s
% DateTime : Mon Jul 18 22:45:40 EDT 2022
% Result : Theorem 0.47s 1.13s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET025+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.08/0.13 % Command : bliksem %s
% 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 % DateTime : Mon Jul 11 09:29:32 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.11 *** allocated 10000 integers for termspace/termends
% 0.47/1.11 *** allocated 10000 integers for clauses
% 0.47/1.11 *** allocated 10000 integers for justifications
% 0.47/1.11 Bliksem 1.12
% 0.47/1.11
% 0.47/1.11
% 0.47/1.11 Automatic Strategy Selection
% 0.47/1.11
% 0.47/1.11
% 0.47/1.11 Clauses:
% 0.47/1.11
% 0.47/1.11 { ! subclass( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.47/1.11 { ! member( skol1( Z, Y ), Y ), subclass( X, Y ) }.
% 0.47/1.11 { member( skol1( X, Y ), X ), subclass( X, Y ) }.
% 0.47/1.11 { subclass( X, universal_class ) }.
% 0.47/1.11 { ! X = Y, subclass( X, Y ) }.
% 0.47/1.11 { ! X = Y, subclass( Y, X ) }.
% 0.47/1.11 { ! subclass( X, Y ), ! subclass( Y, X ), X = Y }.
% 0.47/1.11 { ! member( X, unordered_pair( Y, Z ) ), member( X, universal_class ) }.
% 0.47/1.11 { ! member( X, unordered_pair( Y, Z ) ), alpha1( X, Y, Z ) }.
% 0.47/1.11 { ! member( X, universal_class ), ! alpha1( X, Y, Z ), member( X,
% 0.47/1.11 unordered_pair( Y, Z ) ) }.
% 0.47/1.11 { ! alpha1( X, Y, Z ), X = Y, X = Z }.
% 0.47/1.11 { ! X = Y, alpha1( X, Y, Z ) }.
% 0.47/1.11 { ! X = Z, alpha1( X, Y, Z ) }.
% 0.47/1.11 { member( unordered_pair( X, Y ), universal_class ) }.
% 0.47/1.11 { singleton( X ) = unordered_pair( X, X ) }.
% 0.47/1.11 { ordered_pair( X, Y ) = unordered_pair( singleton( X ), unordered_pair( X
% 0.47/1.11 , singleton( Y ) ) ) }.
% 0.47/1.11 { ! member( ordered_pair( X, Y ), cross_product( Z, T ) ), member( X, Z ) }
% 0.47/1.11 .
% 0.47/1.11 { ! member( ordered_pair( X, Y ), cross_product( Z, T ) ), member( Y, T ) }
% 0.47/1.11 .
% 0.47/1.11 { ! member( X, Z ), ! member( Y, T ), member( ordered_pair( X, Y ),
% 0.47/1.11 cross_product( Z, T ) ) }.
% 0.47/1.11 { ! member( X, universal_class ), ! member( Y, universal_class ), first(
% 0.47/1.11 ordered_pair( X, Y ) ) = X }.
% 0.47/1.11 { ! member( X, universal_class ), ! member( Y, universal_class ), second(
% 0.47/1.11 ordered_pair( X, Y ) ) = Y }.
% 0.47/1.11 { ! member( X, cross_product( Y, Z ) ), X = ordered_pair( first( X ),
% 0.47/1.11 second( X ) ) }.
% 0.47/1.11 { ! member( ordered_pair( X, Y ), element_relation ), member( Y,
% 0.47/1.11 universal_class ) }.
% 0.47/1.11 { ! member( ordered_pair( X, Y ), element_relation ), member( X, Y ) }.
% 0.47/1.11 { ! member( Y, universal_class ), ! member( X, Y ), member( ordered_pair( X
% 0.47/1.11 , Y ), element_relation ) }.
% 0.47/1.11 { subclass( element_relation, cross_product( universal_class,
% 0.47/1.11 universal_class ) ) }.
% 0.47/1.11 { ! member( Z, intersection( X, Y ) ), member( Z, X ) }.
% 0.47/1.11 { ! member( Z, intersection( X, Y ) ), member( Z, Y ) }.
% 0.47/1.11 { ! member( Z, X ), ! member( Z, Y ), member( Z, intersection( X, Y ) ) }.
% 0.47/1.11 { ! member( Y, complement( X ) ), member( Y, universal_class ) }.
% 0.47/1.11 { ! member( Y, complement( X ) ), ! member( Y, X ) }.
% 0.47/1.11 { ! member( Y, universal_class ), member( Y, X ), member( Y, complement( X
% 0.47/1.11 ) ) }.
% 0.47/1.11 { restrict( Y, X, Z ) = intersection( Y, cross_product( X, Z ) ) }.
% 0.47/1.11 { ! member( X, null_class ) }.
% 0.47/1.11 { ! member( Y, domain_of( X ) ), member( Y, universal_class ) }.
% 0.47/1.11 { ! member( Y, domain_of( X ) ), ! restrict( X, singleton( Y ),
% 0.47/1.11 universal_class ) = null_class }.
% 0.47/1.11 { ! member( Y, universal_class ), restrict( X, singleton( Y ),
% 0.47/1.11 universal_class ) = null_class, member( Y, domain_of( X ) ) }.
% 0.47/1.11 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ), member
% 0.47/1.11 ( ordered_pair( ordered_pair( Y, Z ), T ), cross_product( cross_product(
% 0.47/1.11 universal_class, universal_class ), universal_class ) ) }.
% 0.47/1.11 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ), member
% 0.47/1.11 ( ordered_pair( ordered_pair( Z, T ), Y ), X ) }.
% 0.47/1.11 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), cross_product(
% 0.47/1.11 cross_product( universal_class, universal_class ), universal_class ) ), !
% 0.47/1.11 member( ordered_pair( ordered_pair( Z, T ), Y ), X ), member(
% 0.47/1.11 ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ) }.
% 0.47/1.11 { subclass( rotate( X ), cross_product( cross_product( universal_class,
% 0.47/1.11 universal_class ), universal_class ) ) }.
% 0.47/1.11 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ), member(
% 0.47/1.11 ordered_pair( ordered_pair( X, Y ), Z ), cross_product( cross_product(
% 0.47/1.11 universal_class, universal_class ), universal_class ) ) }.
% 0.47/1.11 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ), member(
% 0.47/1.11 ordered_pair( ordered_pair( Y, X ), Z ), T ) }.
% 0.47/1.11 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), cross_product(
% 0.47/1.11 cross_product( universal_class, universal_class ), universal_class ) ), !
% 0.47/1.11 member( ordered_pair( ordered_pair( Y, X ), Z ), T ), member(
% 0.47/1.11 ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ) }.
% 0.47/1.11 { subclass( flip( X ), cross_product( cross_product( universal_class,
% 0.47/1.13 universal_class ), universal_class ) ) }.
% 0.47/1.13 { ! member( Z, union( X, Y ) ), member( Z, X ), member( Z, Y ) }.
% 0.47/1.13 { ! member( Z, X ), member( Z, union( X, Y ) ) }.
% 0.47/1.13 { ! member( Z, Y ), member( Z, union( X, Y ) ) }.
% 0.47/1.13 { successor( X ) = union( X, singleton( X ) ) }.
% 0.47/1.13 { subclass( successor_relation, cross_product( universal_class,
% 0.47/1.13 universal_class ) ) }.
% 0.47/1.13 { ! member( ordered_pair( X, Y ), successor_relation ), member( X,
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 { ! member( ordered_pair( X, Y ), successor_relation ), alpha2( X, Y ) }.
% 0.47/1.13 { ! member( X, universal_class ), ! alpha2( X, Y ), member( ordered_pair( X
% 0.47/1.13 , Y ), successor_relation ) }.
% 0.47/1.13 { ! alpha2( X, Y ), member( Y, universal_class ) }.
% 0.47/1.13 { ! alpha2( X, Y ), successor( X ) = Y }.
% 0.47/1.13 { ! member( Y, universal_class ), ! successor( X ) = Y, alpha2( X, Y ) }.
% 0.47/1.13 { inverse( X ) = domain_of( flip( cross_product( X, universal_class ) ) ) }
% 0.47/1.13 .
% 0.47/1.13 { range_of( X ) = domain_of( inverse( X ) ) }.
% 0.47/1.13 { image( Y, X ) = range_of( restrict( Y, X, universal_class ) ) }.
% 0.47/1.13 { ! inductive( X ), member( null_class, X ) }.
% 0.47/1.13 { ! inductive( X ), subclass( image( successor_relation, X ), X ) }.
% 0.47/1.13 { ! member( null_class, X ), ! subclass( image( successor_relation, X ), X
% 0.47/1.13 ), inductive( X ) }.
% 0.47/1.13 { member( skol2, universal_class ) }.
% 0.47/1.13 { inductive( skol2 ) }.
% 0.47/1.13 { ! inductive( X ), subclass( skol2, X ) }.
% 0.47/1.13 { ! member( X, sum_class( Y ) ), member( skol3( Z, Y ), Y ) }.
% 0.47/1.13 { ! member( X, sum_class( Y ) ), member( X, skol3( X, Y ) ) }.
% 0.47/1.13 { ! member( X, Z ), ! member( Z, Y ), member( X, sum_class( Y ) ) }.
% 0.47/1.13 { ! member( X, universal_class ), member( sum_class( X ), universal_class )
% 0.47/1.13 }.
% 0.47/1.13 { ! member( X, power_class( Y ) ), member( X, universal_class ) }.
% 0.47/1.13 { ! member( X, power_class( Y ) ), subclass( X, Y ) }.
% 0.47/1.13 { ! member( X, universal_class ), ! subclass( X, Y ), member( X,
% 0.47/1.13 power_class( Y ) ) }.
% 0.47/1.13 { ! member( X, universal_class ), member( power_class( X ), universal_class
% 0.47/1.13 ) }.
% 0.47/1.13 { subclass( compose( Y, X ), cross_product( universal_class,
% 0.47/1.13 universal_class ) ) }.
% 0.47/1.13 { ! member( ordered_pair( Z, T ), compose( Y, X ) ), member( Z,
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 { ! member( ordered_pair( Z, T ), compose( Y, X ) ), member( T, image( Y,
% 0.47/1.13 image( X, singleton( Z ) ) ) ) }.
% 0.47/1.13 { ! member( Z, universal_class ), ! member( T, image( Y, image( X,
% 0.47/1.13 singleton( Z ) ) ) ), member( ordered_pair( Z, T ), compose( Y, X ) ) }.
% 0.47/1.13 { ! member( X, identity_relation ), member( skol4( Y ), universal_class ) }
% 0.47/1.13 .
% 0.47/1.13 { ! member( X, identity_relation ), X = ordered_pair( skol4( X ), skol4( X
% 0.47/1.13 ) ) }.
% 0.47/1.13 { ! member( Y, universal_class ), ! X = ordered_pair( Y, Y ), member( X,
% 0.47/1.13 identity_relation ) }.
% 0.47/1.13 { ! function( X ), subclass( X, cross_product( universal_class,
% 0.47/1.13 universal_class ) ) }.
% 0.47/1.13 { ! function( X ), subclass( compose( X, inverse( X ) ), identity_relation
% 0.47/1.13 ) }.
% 0.47/1.13 { ! subclass( X, cross_product( universal_class, universal_class ) ), !
% 0.47/1.13 subclass( compose( X, inverse( X ) ), identity_relation ), function( X )
% 0.47/1.13 }.
% 0.47/1.13 { ! member( X, universal_class ), ! function( Y ), member( image( Y, X ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 { ! disjoint( X, Y ), ! member( Z, X ), ! member( Z, Y ) }.
% 0.47/1.13 { member( skol5( Z, Y ), Y ), disjoint( X, Y ) }.
% 0.47/1.13 { member( skol5( X, Y ), X ), disjoint( X, Y ) }.
% 0.47/1.13 { X = null_class, member( skol6( Y ), universal_class ) }.
% 0.47/1.13 { X = null_class, member( skol6( X ), X ) }.
% 0.47/1.13 { X = null_class, disjoint( skol6( X ), X ) }.
% 0.47/1.13 { apply( X, Y ) = sum_class( image( X, singleton( Y ) ) ) }.
% 0.47/1.13 { function( skol7 ) }.
% 0.47/1.13 { ! member( X, universal_class ), X = null_class, member( apply( skol7, X )
% 0.47/1.13 , X ) }.
% 0.47/1.13 { ! member( ordered_pair( skol8, skol9 ), universal_class ) }.
% 0.47/1.13
% 0.47/1.13 percentage equality = 0.145078, percentage horn = 0.882979
% 0.47/1.13 This is a problem with some equality
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Options Used:
% 0.47/1.13
% 0.47/1.13 useres = 1
% 0.47/1.13 useparamod = 1
% 0.47/1.13 useeqrefl = 1
% 0.47/1.13 useeqfact = 1
% 0.47/1.13 usefactor = 1
% 0.47/1.13 usesimpsplitting = 0
% 0.47/1.13 usesimpdemod = 5
% 0.47/1.13 usesimpres = 3
% 0.47/1.13
% 0.47/1.13 resimpinuse = 1000
% 0.47/1.13 resimpclauses = 20000
% 0.47/1.13 substype = eqrewr
% 0.47/1.13 backwardsubs = 1
% 0.47/1.13 selectoldest = 5
% 0.47/1.13
% 0.47/1.13 litorderings [0] = split
% 0.47/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.47/1.13
% 0.47/1.13 termordering = kbo
% 0.47/1.13
% 0.47/1.13 litapriori = 0
% 0.47/1.13 termapriori = 1
% 0.47/1.13 litaposteriori = 0
% 0.47/1.13 termaposteriori = 0
% 0.47/1.13 demodaposteriori = 0
% 0.47/1.13 ordereqreflfact = 0
% 0.47/1.13
% 0.47/1.13 litselect = negord
% 0.47/1.13
% 0.47/1.13 maxweight = 15
% 0.47/1.13 maxdepth = 30000
% 0.47/1.13 maxlength = 115
% 0.47/1.13 maxnrvars = 195
% 0.47/1.13 excuselevel = 1
% 0.47/1.13 increasemaxweight = 1
% 0.47/1.13
% 0.47/1.13 maxselected = 10000000
% 0.47/1.13 maxnrclauses = 10000000
% 0.47/1.13
% 0.47/1.13 showgenerated = 0
% 0.47/1.13 showkept = 0
% 0.47/1.13 showselected = 0
% 0.47/1.13 showdeleted = 0
% 0.47/1.13 showresimp = 1
% 0.47/1.13 showstatus = 2000
% 0.47/1.13
% 0.47/1.13 prologoutput = 0
% 0.47/1.13 nrgoals = 5000000
% 0.47/1.13 totalproof = 1
% 0.47/1.13
% 0.47/1.13 Symbols occurring in the translation:
% 0.47/1.13
% 0.47/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.47/1.13 . [1, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.47/1.13 ! [4, 1] (w:0, o:24, a:1, s:1, b:0),
% 0.47/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 subclass [37, 2] (w:1, o:69, a:1, s:1, b:0),
% 0.47/1.13 member [39, 2] (w:1, o:70, a:1, s:1, b:0),
% 0.47/1.13 universal_class [40, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.47/1.13 unordered_pair [41, 2] (w:1, o:71, a:1, s:1, b:0),
% 0.47/1.13 singleton [42, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.47/1.13 ordered_pair [43, 2] (w:1, o:72, a:1, s:1, b:0),
% 0.47/1.13 cross_product [45, 2] (w:1, o:73, a:1, s:1, b:0),
% 0.47/1.13 first [46, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.47/1.13 second [47, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.47/1.13 element_relation [49, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.47/1.13 intersection [50, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.47/1.13 complement [51, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.47/1.13 restrict [53, 3] (w:1, o:84, a:1, s:1, b:0),
% 0.47/1.13 null_class [54, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.47/1.13 domain_of [55, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.47/1.13 rotate [57, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.47/1.13 flip [58, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.47/1.13 union [59, 2] (w:1, o:76, a:1, s:1, b:0),
% 0.47/1.13 successor [60, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.47/1.13 successor_relation [61, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.47/1.13 inverse [62, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.47/1.13 range_of [63, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.47/1.13 image [64, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.47/1.13 inductive [65, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.47/1.13 sum_class [66, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.47/1.13 power_class [67, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.47/1.13 compose [69, 2] (w:1, o:77, a:1, s:1, b:0),
% 0.47/1.13 identity_relation [70, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.47/1.13 function [72, 1] (w:1, o:42, a:1, s:1, b:0),
% 0.47/1.13 disjoint [73, 2] (w:1, o:78, a:1, s:1, b:0),
% 0.47/1.13 apply [74, 2] (w:1, o:79, a:1, s:1, b:0),
% 0.47/1.13 alpha1 [75, 3] (w:1, o:85, a:1, s:1, b:1),
% 0.47/1.13 alpha2 [76, 2] (w:1, o:80, a:1, s:1, b:1),
% 0.47/1.13 skol1 [77, 2] (w:1, o:81, a:1, s:1, b:1),
% 0.47/1.13 skol2 [78, 0] (w:1, o:20, a:1, s:1, b:1),
% 0.47/1.13 skol3 [79, 2] (w:1, o:82, a:1, s:1, b:1),
% 0.47/1.13 skol4 [80, 1] (w:1, o:43, a:1, s:1, b:1),
% 0.47/1.13 skol5 [81, 2] (w:1, o:83, a:1, s:1, b:1),
% 0.47/1.13 skol6 [82, 1] (w:1, o:44, a:1, s:1, b:1),
% 0.47/1.13 skol7 [83, 0] (w:1, o:21, a:1, s:1, b:1),
% 0.47/1.13 skol8 [84, 0] (w:1, o:22, a:1, s:1, b:1),
% 0.47/1.13 skol9 [85, 0] (w:1, o:23, a:1, s:1, b:1).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Starting Search:
% 0.47/1.13
% 0.47/1.13 *** allocated 15000 integers for clauses
% 0.47/1.13 *** allocated 22500 integers for clauses
% 0.47/1.13 *** allocated 33750 integers for clauses
% 0.47/1.13
% 0.47/1.13 Bliksems!, er is een bewijs:
% 0.47/1.13 % SZS status Theorem
% 0.47/1.13 % SZS output start Refutation
% 0.47/1.13
% 0.47/1.13 (0) {G0,W9,D2,L3,V3,M3} I { ! subclass( X, Y ), ! member( Z, X ), member( Z
% 0.47/1.13 , Y ) }.
% 0.47/1.13 (3) {G0,W3,D2,L1,V1,M1} I { subclass( X, universal_class ) }.
% 0.47/1.13 (12) {G0,W5,D3,L1,V2,M1} I { member( unordered_pair( X, Y ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 (14) {G0,W11,D5,L1,V2,M1} I { unordered_pair( singleton( X ),
% 0.47/1.13 unordered_pair( X, singleton( Y ) ) ) ==> ordered_pair( X, Y ) }.
% 0.47/1.13 (92) {G0,W5,D3,L1,V0,M1} I { ! member( ordered_pair( skol8, skol9 ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 (126) {G1,W5,D3,L1,V1,M1} R(92,0);r(3) { ! member( ordered_pair( skol8,
% 0.47/1.13 skol9 ), X ) }.
% 0.47/1.13 (626) {G1,W5,D3,L1,V2,M1} P(14,12) { member( ordered_pair( X, Y ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 (628) {G2,W0,D0,L0,V0,M0} R(626,126) { }.
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 % SZS output end Refutation
% 0.47/1.13 found a proof!
% 0.47/1.13
% 0.47/1.13 *** allocated 15000 integers for termspace/termends
% 0.47/1.13
% 0.47/1.13 Unprocessed initial clauses:
% 0.47/1.13
% 0.47/1.13 (630) {G0,W9,D2,L3,V3,M3} { ! subclass( X, Y ), ! member( Z, X ), member(
% 0.47/1.13 Z, Y ) }.
% 0.47/1.13 (631) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subclass( X, Y )
% 0.47/1.13 }.
% 0.47/1.13 (632) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subclass( X, Y )
% 0.47/1.13 }.
% 0.47/1.13 (633) {G0,W3,D2,L1,V1,M1} { subclass( X, universal_class ) }.
% 0.47/1.13 (634) {G0,W6,D2,L2,V2,M2} { ! X = Y, subclass( X, Y ) }.
% 0.47/1.13 (635) {G0,W6,D2,L2,V2,M2} { ! X = Y, subclass( Y, X ) }.
% 0.47/1.13 (636) {G0,W9,D2,L3,V2,M3} { ! subclass( X, Y ), ! subclass( Y, X ), X = Y
% 0.47/1.13 }.
% 0.47/1.13 (637) {G0,W8,D3,L2,V3,M2} { ! member( X, unordered_pair( Y, Z ) ), member
% 0.47/1.13 ( X, universal_class ) }.
% 0.47/1.13 (638) {G0,W9,D3,L2,V3,M2} { ! member( X, unordered_pair( Y, Z ) ), alpha1
% 0.47/1.13 ( X, Y, Z ) }.
% 0.47/1.13 (639) {G0,W12,D3,L3,V3,M3} { ! member( X, universal_class ), ! alpha1( X,
% 0.47/1.13 Y, Z ), member( X, unordered_pair( Y, Z ) ) }.
% 0.47/1.13 (640) {G0,W10,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), X = Y, X = Z }.
% 0.47/1.13 (641) {G0,W7,D2,L2,V3,M2} { ! X = Y, alpha1( X, Y, Z ) }.
% 0.47/1.13 (642) {G0,W7,D2,L2,V3,M2} { ! X = Z, alpha1( X, Y, Z ) }.
% 0.47/1.13 (643) {G0,W5,D3,L1,V2,M1} { member( unordered_pair( X, Y ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 (644) {G0,W6,D3,L1,V1,M1} { singleton( X ) = unordered_pair( X, X ) }.
% 0.47/1.13 (645) {G0,W11,D5,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 0.47/1.13 singleton( X ), unordered_pair( X, singleton( Y ) ) ) }.
% 0.47/1.13 (646) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( X, Y ), cross_product
% 0.47/1.13 ( Z, T ) ), member( X, Z ) }.
% 0.47/1.13 (647) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( X, Y ), cross_product
% 0.47/1.13 ( Z, T ) ), member( Y, T ) }.
% 0.47/1.13 (648) {G0,W13,D3,L3,V4,M3} { ! member( X, Z ), ! member( Y, T ), member(
% 0.47/1.13 ordered_pair( X, Y ), cross_product( Z, T ) ) }.
% 0.47/1.13 (649) {G0,W12,D4,L3,V2,M3} { ! member( X, universal_class ), ! member( Y,
% 0.47/1.13 universal_class ), first( ordered_pair( X, Y ) ) = X }.
% 0.47/1.13 (650) {G0,W12,D4,L3,V2,M3} { ! member( X, universal_class ), ! member( Y,
% 0.47/1.13 universal_class ), second( ordered_pair( X, Y ) ) = Y }.
% 0.47/1.13 (651) {G0,W12,D4,L2,V3,M2} { ! member( X, cross_product( Y, Z ) ), X =
% 0.47/1.13 ordered_pair( first( X ), second( X ) ) }.
% 0.47/1.13 (652) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 0.47/1.13 element_relation ), member( Y, universal_class ) }.
% 0.47/1.13 (653) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 0.47/1.13 element_relation ), member( X, Y ) }.
% 0.47/1.13 (654) {G0,W11,D3,L3,V2,M3} { ! member( Y, universal_class ), ! member( X,
% 0.47/1.13 Y ), member( ordered_pair( X, Y ), element_relation ) }.
% 0.47/1.13 (655) {G0,W5,D3,L1,V0,M1} { subclass( element_relation, cross_product(
% 0.47/1.13 universal_class, universal_class ) ) }.
% 0.47/1.13 (656) {G0,W8,D3,L2,V3,M2} { ! member( Z, intersection( X, Y ) ), member( Z
% 0.47/1.13 , X ) }.
% 0.47/1.13 (657) {G0,W8,D3,L2,V3,M2} { ! member( Z, intersection( X, Y ) ), member( Z
% 0.47/1.13 , Y ) }.
% 0.47/1.13 (658) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ), member( Z
% 0.47/1.13 , intersection( X, Y ) ) }.
% 0.47/1.13 (659) {G0,W7,D3,L2,V2,M2} { ! member( Y, complement( X ) ), member( Y,
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 (660) {G0,W7,D3,L2,V2,M2} { ! member( Y, complement( X ) ), ! member( Y, X
% 0.47/1.13 ) }.
% 0.47/1.13 (661) {G0,W10,D3,L3,V2,M3} { ! member( Y, universal_class ), member( Y, X
% 0.47/1.13 ), member( Y, complement( X ) ) }.
% 0.47/1.13 (662) {G0,W10,D4,L1,V3,M1} { restrict( Y, X, Z ) = intersection( Y,
% 0.47/1.13 cross_product( X, Z ) ) }.
% 0.47/1.13 (663) {G0,W3,D2,L1,V1,M1} { ! member( X, null_class ) }.
% 0.47/1.13 (664) {G0,W7,D3,L2,V2,M2} { ! member( Y, domain_of( X ) ), member( Y,
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 (665) {G0,W11,D4,L2,V2,M2} { ! member( Y, domain_of( X ) ), ! restrict( X
% 0.47/1.13 , singleton( Y ), universal_class ) = null_class }.
% 0.47/1.13 (666) {G0,W14,D4,L3,V2,M3} { ! member( Y, universal_class ), restrict( X,
% 0.47/1.13 singleton( Y ), universal_class ) = null_class, member( Y, domain_of( X )
% 0.47/1.13 ) }.
% 0.47/1.13 (667) {G0,W19,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( Y, Z )
% 0.47/1.13 , T ), rotate( X ) ), member( ordered_pair( ordered_pair( Y, Z ), T ),
% 0.47/1.13 cross_product( cross_product( universal_class, universal_class ),
% 0.47/1.13 universal_class ) ) }.
% 0.47/1.13 (668) {G0,W15,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( Y, Z )
% 0.47/1.13 , T ), rotate( X ) ), member( ordered_pair( ordered_pair( Z, T ), Y ), X
% 0.47/1.13 ) }.
% 0.47/1.13 (669) {G0,W26,D4,L3,V4,M3} { ! member( ordered_pair( ordered_pair( Y, Z )
% 0.47/1.13 , T ), cross_product( cross_product( universal_class, universal_class ),
% 0.47/1.13 universal_class ) ), ! member( ordered_pair( ordered_pair( Z, T ), Y ), X
% 0.47/1.13 ), member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ) }.
% 0.47/1.13 (670) {G0,W8,D4,L1,V1,M1} { subclass( rotate( X ), cross_product(
% 0.47/1.13 cross_product( universal_class, universal_class ), universal_class ) )
% 0.47/1.13 }.
% 0.47/1.13 (671) {G0,W19,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( X, Y )
% 0.47/1.13 , Z ), flip( T ) ), member( ordered_pair( ordered_pair( X, Y ), Z ),
% 0.47/1.13 cross_product( cross_product( universal_class, universal_class ),
% 0.47/1.13 universal_class ) ) }.
% 0.47/1.13 (672) {G0,W15,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( X, Y )
% 0.47/1.13 , Z ), flip( T ) ), member( ordered_pair( ordered_pair( Y, X ), Z ), T )
% 0.47/1.13 }.
% 0.47/1.13 (673) {G0,W26,D4,L3,V4,M3} { ! member( ordered_pair( ordered_pair( X, Y )
% 0.47/1.13 , Z ), cross_product( cross_product( universal_class, universal_class ),
% 0.47/1.13 universal_class ) ), ! member( ordered_pair( ordered_pair( Y, X ), Z ), T
% 0.47/1.13 ), member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ) }.
% 0.47/1.13 (674) {G0,W8,D4,L1,V1,M1} { subclass( flip( X ), cross_product(
% 0.47/1.13 cross_product( universal_class, universal_class ), universal_class ) )
% 0.47/1.13 }.
% 0.47/1.13 (675) {G0,W11,D3,L3,V3,M3} { ! member( Z, union( X, Y ) ), member( Z, X )
% 0.47/1.13 , member( Z, Y ) }.
% 0.47/1.13 (676) {G0,W8,D3,L2,V3,M2} { ! member( Z, X ), member( Z, union( X, Y ) )
% 0.47/1.13 }.
% 0.47/1.13 (677) {G0,W8,D3,L2,V3,M2} { ! member( Z, Y ), member( Z, union( X, Y ) )
% 0.47/1.13 }.
% 0.47/1.13 (678) {G0,W7,D4,L1,V1,M1} { successor( X ) = union( X, singleton( X ) )
% 0.47/1.13 }.
% 0.47/1.13 (679) {G0,W5,D3,L1,V0,M1} { subclass( successor_relation, cross_product(
% 0.47/1.13 universal_class, universal_class ) ) }.
% 0.47/1.13 (680) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 0.47/1.13 successor_relation ), member( X, universal_class ) }.
% 0.47/1.13 (681) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 0.47/1.13 successor_relation ), alpha2( X, Y ) }.
% 0.47/1.13 (682) {G0,W11,D3,L3,V2,M3} { ! member( X, universal_class ), ! alpha2( X,
% 0.47/1.13 Y ), member( ordered_pair( X, Y ), successor_relation ) }.
% 0.47/1.13 (683) {G0,W6,D2,L2,V2,M2} { ! alpha2( X, Y ), member( Y, universal_class )
% 0.47/1.13 }.
% 0.47/1.13 (684) {G0,W7,D3,L2,V2,M2} { ! alpha2( X, Y ), successor( X ) = Y }.
% 0.47/1.13 (685) {G0,W10,D3,L3,V2,M3} { ! member( Y, universal_class ), ! successor(
% 0.47/1.13 X ) = Y, alpha2( X, Y ) }.
% 0.47/1.13 (686) {G0,W8,D5,L1,V1,M1} { inverse( X ) = domain_of( flip( cross_product
% 0.47/1.13 ( X, universal_class ) ) ) }.
% 0.47/1.13 (687) {G0,W6,D4,L1,V1,M1} { range_of( X ) = domain_of( inverse( X ) ) }.
% 0.47/1.13 (688) {G0,W9,D4,L1,V2,M1} { image( Y, X ) = range_of( restrict( Y, X,
% 0.47/1.13 universal_class ) ) }.
% 0.47/1.13 (689) {G0,W5,D2,L2,V1,M2} { ! inductive( X ), member( null_class, X ) }.
% 0.47/1.13 (690) {G0,W7,D3,L2,V1,M2} { ! inductive( X ), subclass( image(
% 0.47/1.13 successor_relation, X ), X ) }.
% 0.47/1.13 (691) {G0,W10,D3,L3,V1,M3} { ! member( null_class, X ), ! subclass( image
% 0.47/1.13 ( successor_relation, X ), X ), inductive( X ) }.
% 0.47/1.13 (692) {G0,W3,D2,L1,V0,M1} { member( skol2, universal_class ) }.
% 0.47/1.13 (693) {G0,W2,D2,L1,V0,M1} { inductive( skol2 ) }.
% 0.47/1.13 (694) {G0,W5,D2,L2,V1,M2} { ! inductive( X ), subclass( skol2, X ) }.
% 0.47/1.13 (695) {G0,W9,D3,L2,V3,M2} { ! member( X, sum_class( Y ) ), member( skol3(
% 0.47/1.13 Z, Y ), Y ) }.
% 0.47/1.13 (696) {G0,W9,D3,L2,V2,M2} { ! member( X, sum_class( Y ) ), member( X,
% 0.47/1.13 skol3( X, Y ) ) }.
% 0.47/1.13 (697) {G0,W10,D3,L3,V3,M3} { ! member( X, Z ), ! member( Z, Y ), member( X
% 0.47/1.13 , sum_class( Y ) ) }.
% 0.47/1.13 (698) {G0,W7,D3,L2,V1,M2} { ! member( X, universal_class ), member(
% 0.47/1.13 sum_class( X ), universal_class ) }.
% 0.47/1.13 (699) {G0,W7,D3,L2,V2,M2} { ! member( X, power_class( Y ) ), member( X,
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 (700) {G0,W7,D3,L2,V2,M2} { ! member( X, power_class( Y ) ), subclass( X,
% 0.47/1.13 Y ) }.
% 0.47/1.13 (701) {G0,W10,D3,L3,V2,M3} { ! member( X, universal_class ), ! subclass( X
% 0.47/1.13 , Y ), member( X, power_class( Y ) ) }.
% 0.47/1.13 (702) {G0,W7,D3,L2,V1,M2} { ! member( X, universal_class ), member(
% 0.47/1.13 power_class( X ), universal_class ) }.
% 0.47/1.13 (703) {G0,W7,D3,L1,V2,M1} { subclass( compose( Y, X ), cross_product(
% 0.47/1.13 universal_class, universal_class ) ) }.
% 0.47/1.13 (704) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( Z, T ), compose( Y, X
% 0.47/1.13 ) ), member( Z, universal_class ) }.
% 0.47/1.13 (705) {G0,W15,D5,L2,V4,M2} { ! member( ordered_pair( Z, T ), compose( Y, X
% 0.47/1.13 ) ), member( T, image( Y, image( X, singleton( Z ) ) ) ) }.
% 0.47/1.13 (706) {G0,W18,D5,L3,V4,M3} { ! member( Z, universal_class ), ! member( T,
% 0.47/1.13 image( Y, image( X, singleton( Z ) ) ) ), member( ordered_pair( Z, T ),
% 0.47/1.13 compose( Y, X ) ) }.
% 0.47/1.13 (707) {G0,W7,D3,L2,V2,M2} { ! member( X, identity_relation ), member(
% 0.47/1.13 skol4( Y ), universal_class ) }.
% 0.47/1.13 (708) {G0,W10,D4,L2,V1,M2} { ! member( X, identity_relation ), X =
% 0.47/1.13 ordered_pair( skol4( X ), skol4( X ) ) }.
% 0.47/1.13 (709) {G0,W11,D3,L3,V2,M3} { ! member( Y, universal_class ), ! X =
% 0.47/1.13 ordered_pair( Y, Y ), member( X, identity_relation ) }.
% 0.47/1.13 (710) {G0,W7,D3,L2,V1,M2} { ! function( X ), subclass( X, cross_product(
% 0.47/1.13 universal_class, universal_class ) ) }.
% 0.47/1.13 (711) {G0,W8,D4,L2,V1,M2} { ! function( X ), subclass( compose( X, inverse
% 0.47/1.13 ( X ) ), identity_relation ) }.
% 0.47/1.13 (712) {G0,W13,D4,L3,V1,M3} { ! subclass( X, cross_product( universal_class
% 0.47/1.13 , universal_class ) ), ! subclass( compose( X, inverse( X ) ),
% 0.47/1.13 identity_relation ), function( X ) }.
% 0.47/1.13 (713) {G0,W10,D3,L3,V2,M3} { ! member( X, universal_class ), ! function( Y
% 0.47/1.13 ), member( image( Y, X ), universal_class ) }.
% 0.47/1.13 (714) {G0,W9,D2,L3,V3,M3} { ! disjoint( X, Y ), ! member( Z, X ), ! member
% 0.47/1.13 ( Z, Y ) }.
% 0.47/1.13 (715) {G0,W8,D3,L2,V3,M2} { member( skol5( Z, Y ), Y ), disjoint( X, Y )
% 0.47/1.13 }.
% 0.47/1.13 (716) {G0,W8,D3,L2,V2,M2} { member( skol5( X, Y ), X ), disjoint( X, Y )
% 0.47/1.13 }.
% 0.47/1.13 (717) {G0,W7,D3,L2,V2,M2} { X = null_class, member( skol6( Y ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 (718) {G0,W7,D3,L2,V1,M2} { X = null_class, member( skol6( X ), X ) }.
% 0.47/1.13 (719) {G0,W7,D3,L2,V1,M2} { X = null_class, disjoint( skol6( X ), X ) }.
% 0.47/1.13 (720) {G0,W9,D5,L1,V2,M1} { apply( X, Y ) = sum_class( image( X, singleton
% 0.47/1.13 ( Y ) ) ) }.
% 0.47/1.13 (721) {G0,W2,D2,L1,V0,M1} { function( skol7 ) }.
% 0.47/1.13 (722) {G0,W11,D3,L3,V1,M3} { ! member( X, universal_class ), X =
% 0.47/1.13 null_class, member( apply( skol7, X ), X ) }.
% 0.47/1.13 (723) {G0,W5,D3,L1,V0,M1} { ! member( ordered_pair( skol8, skol9 ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Total Proof:
% 0.47/1.13
% 0.47/1.13 subsumption: (0) {G0,W9,D2,L3,V3,M3} I { ! subclass( X, Y ), ! member( Z, X
% 0.47/1.13 ), member( Z, Y ) }.
% 0.47/1.13 parent0: (630) {G0,W9,D2,L3,V3,M3} { ! subclass( X, Y ), ! member( Z, X )
% 0.47/1.13 , member( Z, Y ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 Y := Y
% 0.47/1.13 Z := Z
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 1 ==> 1
% 0.47/1.13 2 ==> 2
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (3) {G0,W3,D2,L1,V1,M1} I { subclass( X, universal_class ) }.
% 0.47/1.13 parent0: (633) {G0,W3,D2,L1,V1,M1} { subclass( X, universal_class ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (12) {G0,W5,D3,L1,V2,M1} I { member( unordered_pair( X, Y ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 parent0: (643) {G0,W5,D3,L1,V2,M1} { member( unordered_pair( X, Y ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 Y := Y
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 eqswap: (745) {G0,W11,D5,L1,V2,M1} { unordered_pair( singleton( X ),
% 0.47/1.13 unordered_pair( X, singleton( Y ) ) ) = ordered_pair( X, Y ) }.
% 0.47/1.13 parent0[0]: (645) {G0,W11,D5,L1,V2,M1} { ordered_pair( X, Y ) =
% 0.47/1.13 unordered_pair( singleton( X ), unordered_pair( X, singleton( Y ) ) ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 Y := Y
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (14) {G0,W11,D5,L1,V2,M1} I { unordered_pair( singleton( X ),
% 0.47/1.13 unordered_pair( X, singleton( Y ) ) ) ==> ordered_pair( X, Y ) }.
% 0.47/1.13 parent0: (745) {G0,W11,D5,L1,V2,M1} { unordered_pair( singleton( X ),
% 0.47/1.13 unordered_pair( X, singleton( Y ) ) ) = ordered_pair( X, Y ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 Y := Y
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (92) {G0,W5,D3,L1,V0,M1} I { ! member( ordered_pair( skol8,
% 0.47/1.13 skol9 ), universal_class ) }.
% 0.47/1.13 parent0: (723) {G0,W5,D3,L1,V0,M1} { ! member( ordered_pair( skol8, skol9
% 0.47/1.13 ), universal_class ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (789) {G1,W8,D3,L2,V1,M2} { ! subclass( X, universal_class ),
% 0.47/1.13 ! member( ordered_pair( skol8, skol9 ), X ) }.
% 0.47/1.13 parent0[0]: (92) {G0,W5,D3,L1,V0,M1} I { ! member( ordered_pair( skol8,
% 0.47/1.13 skol9 ), universal_class ) }.
% 0.47/1.13 parent1[2]: (0) {G0,W9,D2,L3,V3,M3} I { ! subclass( X, Y ), ! member( Z, X
% 0.47/1.13 ), member( Z, Y ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 X := X
% 0.47/1.13 Y := universal_class
% 0.47/1.13 Z := ordered_pair( skol8, skol9 )
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (790) {G1,W5,D3,L1,V1,M1} { ! member( ordered_pair( skol8,
% 0.47/1.13 skol9 ), X ) }.
% 0.47/1.13 parent0[0]: (789) {G1,W8,D3,L2,V1,M2} { ! subclass( X, universal_class ),
% 0.47/1.13 ! member( ordered_pair( skol8, skol9 ), X ) }.
% 0.47/1.13 parent1[0]: (3) {G0,W3,D2,L1,V1,M1} I { subclass( X, universal_class ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (126) {G1,W5,D3,L1,V1,M1} R(92,0);r(3) { ! member(
% 0.47/1.13 ordered_pair( skol8, skol9 ), X ) }.
% 0.47/1.13 parent0: (790) {G1,W5,D3,L1,V1,M1} { ! member( ordered_pair( skol8, skol9
% 0.47/1.13 ), X ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 paramod: (792) {G1,W5,D3,L1,V2,M1} { member( ordered_pair( X, Y ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 parent0[0]: (14) {G0,W11,D5,L1,V2,M1} I { unordered_pair( singleton( X ),
% 0.47/1.13 unordered_pair( X, singleton( Y ) ) ) ==> ordered_pair( X, Y ) }.
% 0.47/1.13 parent1[0; 1]: (12) {G0,W5,D3,L1,V2,M1} I { member( unordered_pair( X, Y )
% 0.47/1.13 , universal_class ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 Y := Y
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 X := singleton( X )
% 0.47/1.13 Y := unordered_pair( X, singleton( Y ) )
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (626) {G1,W5,D3,L1,V2,M1} P(14,12) { member( ordered_pair( X,
% 0.47/1.13 Y ), universal_class ) }.
% 0.47/1.13 parent0: (792) {G1,W5,D3,L1,V2,M1} { member( ordered_pair( X, Y ),
% 0.47/1.13 universal_class ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := X
% 0.47/1.13 Y := Y
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 0 ==> 0
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 resolution: (793) {G2,W0,D0,L0,V0,M0} { }.
% 0.47/1.13 parent0[0]: (126) {G1,W5,D3,L1,V1,M1} R(92,0);r(3) { ! member( ordered_pair
% 0.47/1.13 ( skol8, skol9 ), X ) }.
% 0.47/1.13 parent1[0]: (626) {G1,W5,D3,L1,V2,M1} P(14,12) { member( ordered_pair( X, Y
% 0.47/1.13 ), universal_class ) }.
% 0.47/1.13 substitution0:
% 0.47/1.13 X := universal_class
% 0.47/1.13 end
% 0.47/1.13 substitution1:
% 0.47/1.13 X := skol8
% 0.47/1.13 Y := skol9
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 subsumption: (628) {G2,W0,D0,L0,V0,M0} R(626,126) { }.
% 0.47/1.13 parent0: (793) {G2,W0,D0,L0,V0,M0} { }.
% 0.47/1.13 substitution0:
% 0.47/1.13 end
% 0.47/1.13 permutation0:
% 0.47/1.13 end
% 0.47/1.13
% 0.47/1.13 Proof check complete!
% 0.47/1.13
% 0.47/1.13 Memory use:
% 0.47/1.13
% 0.47/1.13 space for terms: 9494
% 0.47/1.13 space for clauses: 30038
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 clauses generated: 1433
% 0.47/1.13 clauses kept: 629
% 0.47/1.13 clauses selected: 66
% 0.47/1.13 clauses deleted: 1
% 0.47/1.13 clauses inuse deleted: 0
% 0.47/1.13
% 0.47/1.13 subsentry: 2923
% 0.47/1.13 literals s-matched: 2569
% 0.47/1.13 literals matched: 2569
% 0.47/1.13 full subsumption: 1453
% 0.47/1.13
% 0.47/1.13 checksum: -1211036788
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Bliksem ended
%------------------------------------------------------------------------------