TSTP Solution File: SET054+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET054+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.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:46:09 EDT 2022
% Result : Theorem 0.66s 1.91s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.97 % Problem : SET054+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.06/0.97 % Command : bliksem %s
% 0.16/1.18 % Computer : n005.cluster.edu
% 0.16/1.18 % Model : x86_64 x86_64
% 0.16/1.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/1.18 % Memory : 8042.1875MB
% 0.16/1.18 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/1.18 % CPULimit : 300
% 0.16/1.18 % DateTime : Mon Jul 11 01:42:11 EDT 2022
% 0.16/1.18 % CPUTime :
% 0.66/1.91 *** allocated 10000 integers for termspace/termends
% 0.66/1.91 *** allocated 10000 integers for clauses
% 0.66/1.91 *** allocated 10000 integers for justifications
% 0.66/1.91 Bliksem 1.12
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 Automatic Strategy Selection
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 Clauses:
% 0.66/1.91
% 0.66/1.91 { ! subclass( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.66/1.91 { ! member( skol1( Z, Y ), Y ), subclass( X, Y ) }.
% 0.66/1.91 { member( skol1( X, Y ), X ), subclass( X, Y ) }.
% 0.66/1.91 { subclass( X, universal_class ) }.
% 0.66/1.91 { ! X = Y, subclass( X, Y ) }.
% 0.66/1.91 { ! X = Y, subclass( Y, X ) }.
% 0.66/1.91 { ! subclass( X, Y ), ! subclass( Y, X ), X = Y }.
% 0.66/1.91 { ! member( X, unordered_pair( Y, Z ) ), member( X, universal_class ) }.
% 0.66/1.91 { ! member( X, unordered_pair( Y, Z ) ), alpha1( X, Y, Z ) }.
% 0.66/1.91 { ! member( X, universal_class ), ! alpha1( X, Y, Z ), member( X,
% 0.66/1.91 unordered_pair( Y, Z ) ) }.
% 0.66/1.91 { ! alpha1( X, Y, Z ), X = Y, X = Z }.
% 0.66/1.91 { ! X = Y, alpha1( X, Y, Z ) }.
% 0.66/1.91 { ! X = Z, alpha1( X, Y, Z ) }.
% 0.66/1.91 { member( unordered_pair( X, Y ), universal_class ) }.
% 0.66/1.91 { singleton( X ) = unordered_pair( X, X ) }.
% 0.66/1.91 { ordered_pair( X, Y ) = unordered_pair( singleton( X ), unordered_pair( X
% 0.66/1.91 , singleton( Y ) ) ) }.
% 0.66/1.91 { ! member( ordered_pair( X, Y ), cross_product( Z, T ) ), member( X, Z ) }
% 0.66/1.91 .
% 0.66/1.91 { ! member( ordered_pair( X, Y ), cross_product( Z, T ) ), member( Y, T ) }
% 0.66/1.91 .
% 0.66/1.91 { ! member( X, Z ), ! member( Y, T ), member( ordered_pair( X, Y ),
% 0.66/1.91 cross_product( Z, T ) ) }.
% 0.66/1.91 { ! member( X, universal_class ), ! member( Y, universal_class ), first(
% 0.66/1.91 ordered_pair( X, Y ) ) = X }.
% 0.66/1.91 { ! member( X, universal_class ), ! member( Y, universal_class ), second(
% 0.66/1.91 ordered_pair( X, Y ) ) = Y }.
% 0.66/1.91 { ! member( X, cross_product( Y, Z ) ), X = ordered_pair( first( X ),
% 0.66/1.91 second( X ) ) }.
% 0.66/1.91 { ! member( ordered_pair( X, Y ), element_relation ), member( Y,
% 0.66/1.91 universal_class ) }.
% 0.66/1.91 { ! member( ordered_pair( X, Y ), element_relation ), member( X, Y ) }.
% 0.66/1.91 { ! member( Y, universal_class ), ! member( X, Y ), member( ordered_pair( X
% 0.66/1.91 , Y ), element_relation ) }.
% 0.66/1.91 { subclass( element_relation, cross_product( universal_class,
% 0.66/1.91 universal_class ) ) }.
% 0.66/1.91 { ! member( Z, intersection( X, Y ) ), member( Z, X ) }.
% 0.66/1.91 { ! member( Z, intersection( X, Y ) ), member( Z, Y ) }.
% 0.66/1.91 { ! member( Z, X ), ! member( Z, Y ), member( Z, intersection( X, Y ) ) }.
% 0.66/1.91 { ! member( Y, complement( X ) ), member( Y, universal_class ) }.
% 0.66/1.91 { ! member( Y, complement( X ) ), ! member( Y, X ) }.
% 0.66/1.91 { ! member( Y, universal_class ), member( Y, X ), member( Y, complement( X
% 0.66/1.91 ) ) }.
% 0.66/1.91 { restrict( Y, X, Z ) = intersection( Y, cross_product( X, Z ) ) }.
% 0.66/1.91 { ! member( X, null_class ) }.
% 0.66/1.91 { ! member( Y, domain_of( X ) ), member( Y, universal_class ) }.
% 0.66/1.91 { ! member( Y, domain_of( X ) ), ! restrict( X, singleton( Y ),
% 0.66/1.91 universal_class ) = null_class }.
% 0.66/1.91 { ! member( Y, universal_class ), restrict( X, singleton( Y ),
% 0.66/1.91 universal_class ) = null_class, member( Y, domain_of( X ) ) }.
% 0.66/1.91 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ), member
% 0.66/1.91 ( ordered_pair( ordered_pair( Y, Z ), T ), cross_product( cross_product(
% 0.66/1.91 universal_class, universal_class ), universal_class ) ) }.
% 0.66/1.91 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ), member
% 0.66/1.91 ( ordered_pair( ordered_pair( Z, T ), Y ), X ) }.
% 0.66/1.91 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), cross_product(
% 0.66/1.91 cross_product( universal_class, universal_class ), universal_class ) ), !
% 0.66/1.91 member( ordered_pair( ordered_pair( Z, T ), Y ), X ), member(
% 0.66/1.91 ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ) }.
% 0.66/1.91 { subclass( rotate( X ), cross_product( cross_product( universal_class,
% 0.66/1.91 universal_class ), universal_class ) ) }.
% 0.66/1.91 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ), member(
% 0.66/1.91 ordered_pair( ordered_pair( X, Y ), Z ), cross_product( cross_product(
% 0.66/1.91 universal_class, universal_class ), universal_class ) ) }.
% 0.66/1.91 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ), member(
% 0.66/1.91 ordered_pair( ordered_pair( Y, X ), Z ), T ) }.
% 0.66/1.91 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), cross_product(
% 0.66/1.91 cross_product( universal_class, universal_class ), universal_class ) ), !
% 0.66/1.91 member( ordered_pair( ordered_pair( Y, X ), Z ), T ), member(
% 0.66/1.91 ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ) }.
% 0.66/1.91 { subclass( flip( X ), cross_product( cross_product( universal_class,
% 0.66/1.91 universal_class ), universal_class ) ) }.
% 0.66/1.91 { ! member( Z, union( X, Y ) ), member( Z, X ), member( Z, Y ) }.
% 0.66/1.91 { ! member( Z, X ), member( Z, union( X, Y ) ) }.
% 0.66/1.91 { ! member( Z, Y ), member( Z, union( X, Y ) ) }.
% 0.66/1.91 { successor( X ) = union( X, singleton( X ) ) }.
% 0.66/1.91 { subclass( successor_relation, cross_product( universal_class,
% 0.66/1.91 universal_class ) ) }.
% 0.66/1.91 { ! member( ordered_pair( X, Y ), successor_relation ), member( X,
% 0.66/1.91 universal_class ) }.
% 0.66/1.91 { ! member( ordered_pair( X, Y ), successor_relation ), alpha2( X, Y ) }.
% 0.66/1.91 { ! member( X, universal_class ), ! alpha2( X, Y ), member( ordered_pair( X
% 0.66/1.91 , Y ), successor_relation ) }.
% 0.66/1.91 { ! alpha2( X, Y ), member( Y, universal_class ) }.
% 0.66/1.91 { ! alpha2( X, Y ), successor( X ) = Y }.
% 0.66/1.91 { ! member( Y, universal_class ), ! successor( X ) = Y, alpha2( X, Y ) }.
% 0.66/1.91 { inverse( X ) = domain_of( flip( cross_product( X, universal_class ) ) ) }
% 0.66/1.91 .
% 0.66/1.91 { range_of( X ) = domain_of( inverse( X ) ) }.
% 0.66/1.91 { image( Y, X ) = range_of( restrict( Y, X, universal_class ) ) }.
% 0.66/1.91 { ! inductive( X ), member( null_class, X ) }.
% 0.66/1.91 { ! inductive( X ), subclass( image( successor_relation, X ), X ) }.
% 0.66/1.91 { ! member( null_class, X ), ! subclass( image( successor_relation, X ), X
% 0.66/1.91 ), inductive( X ) }.
% 0.66/1.91 { member( skol2, universal_class ) }.
% 0.66/1.91 { inductive( skol2 ) }.
% 0.66/1.91 { ! inductive( X ), subclass( skol2, X ) }.
% 0.66/1.91 { ! member( X, sum_class( Y ) ), member( skol3( Z, Y ), Y ) }.
% 0.66/1.91 { ! member( X, sum_class( Y ) ), member( X, skol3( X, Y ) ) }.
% 0.66/1.91 { ! member( X, Z ), ! member( Z, Y ), member( X, sum_class( Y ) ) }.
% 0.66/1.91 { ! member( X, universal_class ), member( sum_class( X ), universal_class )
% 0.66/1.91 }.
% 0.66/1.91 { ! member( X, power_class( Y ) ), member( X, universal_class ) }.
% 0.66/1.91 { ! member( X, power_class( Y ) ), subclass( X, Y ) }.
% 0.66/1.91 { ! member( X, universal_class ), ! subclass( X, Y ), member( X,
% 0.66/1.91 power_class( Y ) ) }.
% 0.66/1.91 { ! member( X, universal_class ), member( power_class( X ), universal_class
% 0.66/1.91 ) }.
% 0.66/1.91 { subclass( compose( Y, X ), cross_product( universal_class,
% 0.66/1.91 universal_class ) ) }.
% 0.66/1.91 { ! member( ordered_pair( Z, T ), compose( Y, X ) ), member( Z,
% 0.66/1.91 universal_class ) }.
% 0.66/1.91 { ! member( ordered_pair( Z, T ), compose( Y, X ) ), member( T, image( Y,
% 0.66/1.91 image( X, singleton( Z ) ) ) ) }.
% 0.66/1.91 { ! member( Z, universal_class ), ! member( T, image( Y, image( X,
% 0.66/1.91 singleton( Z ) ) ) ), member( ordered_pair( Z, T ), compose( Y, X ) ) }.
% 0.66/1.91 { ! member( X, identity_relation ), member( skol4( Y ), universal_class ) }
% 0.66/1.91 .
% 0.66/1.91 { ! member( X, identity_relation ), X = ordered_pair( skol4( X ), skol4( X
% 0.66/1.91 ) ) }.
% 0.66/1.91 { ! member( Y, universal_class ), ! X = ordered_pair( Y, Y ), member( X,
% 0.66/1.91 identity_relation ) }.
% 0.66/1.91 { ! function( X ), subclass( X, cross_product( universal_class,
% 0.66/1.91 universal_class ) ) }.
% 0.66/1.91 { ! function( X ), subclass( compose( X, inverse( X ) ), identity_relation
% 0.66/1.91 ) }.
% 0.66/1.91 { ! subclass( X, cross_product( universal_class, universal_class ) ), !
% 0.66/1.91 subclass( compose( X, inverse( X ) ), identity_relation ), function( X )
% 0.66/1.91 }.
% 0.66/1.91 { ! member( X, universal_class ), ! function( Y ), member( image( Y, X ),
% 0.66/1.91 universal_class ) }.
% 0.66/1.91 { ! disjoint( X, Y ), ! member( Z, X ), ! member( Z, Y ) }.
% 0.66/1.91 { member( skol5( Z, Y ), Y ), disjoint( X, Y ) }.
% 0.66/1.91 { member( skol5( X, Y ), X ), disjoint( X, Y ) }.
% 0.66/1.91 { X = null_class, member( skol6( Y ), universal_class ) }.
% 0.66/1.91 { X = null_class, member( skol6( X ), X ) }.
% 0.66/1.91 { X = null_class, disjoint( skol6( X ), X ) }.
% 0.66/1.91 { apply( X, Y ) = sum_class( image( X, singleton( Y ) ) ) }.
% 0.66/1.91 { function( skol7 ) }.
% 0.66/1.91 { ! member( X, universal_class ), X = null_class, member( apply( skol7, X )
% 0.66/1.91 , X ) }.
% 0.66/1.91 { ! subclass( skol8, skol8 ) }.
% 0.66/1.91
% 0.66/1.91 percentage equality = 0.145078, percentage horn = 0.882979
% 0.66/1.91 This is a problem with some equality
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 Options Used:
% 0.66/1.91
% 0.66/1.91 useres = 1
% 0.66/1.91 useparamod = 1
% 0.66/1.91 useeqrefl = 1
% 0.66/1.91 useeqfact = 1
% 0.66/1.91 usefactor = 1
% 0.66/1.91 usesimpsplitting = 0
% 0.66/1.91 usesimpdemod = 5
% 0.66/1.91 usesimpres = 3
% 0.66/1.91
% 0.66/1.91 resimpinuse = 1000
% 0.66/1.91 resimpclauses = 20000
% 0.66/1.91 substype = eqrewr
% 0.66/1.91 backwardsubs = 1
% 0.66/1.91 selectoldest = 5
% 0.66/1.91
% 0.66/1.91 litorderings [0] = split
% 0.66/1.91 litorderings [1] = extend the termordering, first sorting on arguments
% 0.66/1.91
% 0.66/1.91 termordering = kbo
% 0.66/1.91
% 0.66/1.91 litapriori = 0
% 0.66/1.91 termapriori = 1
% 0.66/1.91 litaposteriori = 0
% 0.66/1.91 termaposteriori = 0
% 0.66/1.91 demodaposteriori = 0
% 0.66/1.91 ordereqreflfact = 0
% 0.66/1.91
% 0.66/1.91 litselect = negord
% 0.66/1.91
% 0.66/1.91 maxweight = 15
% 0.66/1.91 maxdepth = 30000
% 0.66/1.91 maxlength = 115
% 0.66/1.91 maxnrvars = 195
% 0.66/1.91 excuselevel = 1
% 0.66/1.91 increasemaxweight = 1
% 0.66/1.91
% 0.66/1.91 maxselected = 10000000
% 0.66/1.91 maxnrclauses = 10000000
% 0.66/1.91
% 0.66/1.91 showgenerated = 0
% 0.66/1.91 showkept = 0
% 0.66/1.91 showselected = 0
% 0.66/1.91 showdeleted = 0
% 0.66/1.91 showresimp = 1
% 0.66/1.91 showstatus = 2000
% 0.66/1.91
% 0.66/1.91 prologoutput = 0
% 0.66/1.91 nrgoals = 5000000
% 0.66/1.91 totalproof = 1
% 0.66/1.91
% 0.66/1.91 Symbols occurring in the translation:
% 0.66/1.91
% 0.66/1.91 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.66/1.91 . [1, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.66/1.91 ! [4, 1] (w:0, o:23, a:1, s:1, b:0),
% 0.66/1.91 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.66/1.91 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.66/1.91 subclass [37, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.66/1.91 member [39, 2] (w:1, o:69, a:1, s:1, b:0),
% 0.66/1.91 universal_class [40, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.66/1.91 unordered_pair [41, 2] (w:1, o:70, a:1, s:1, b:0),
% 0.66/1.91 singleton [42, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.66/1.91 ordered_pair [43, 2] (w:1, o:71, a:1, s:1, b:0),
% 0.66/1.91 cross_product [45, 2] (w:1, o:72, a:1, s:1, b:0),
% 0.66/1.91 first [46, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.66/1.91 second [47, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.66/1.91 element_relation [49, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.66/1.91 intersection [50, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.66/1.91 complement [51, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.66/1.91 restrict [53, 3] (w:1, o:83, a:1, s:1, b:0),
% 0.66/1.91 null_class [54, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.66/1.91 domain_of [55, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.66/1.91 rotate [57, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.66/1.91 flip [58, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.66/1.91 union [59, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.66/1.91 successor [60, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.66/1.91 successor_relation [61, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.66/1.91 inverse [62, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.66/1.91 range_of [63, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.66/1.91 image [64, 2] (w:1, o:73, a:1, s:1, b:0),
% 0.66/1.91 inductive [65, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.66/1.91 sum_class [66, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.66/1.91 power_class [67, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.66/1.91 compose [69, 2] (w:1, o:76, a:1, s:1, b:0),
% 0.66/1.91 identity_relation [70, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.66/1.91 function [72, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.66/1.91 disjoint [73, 2] (w:1, o:77, a:1, s:1, b:0),
% 0.66/1.91 apply [74, 2] (w:1, o:78, a:1, s:1, b:0),
% 0.66/1.91 alpha1 [75, 3] (w:1, o:84, a:1, s:1, b:1),
% 0.66/1.91 alpha2 [76, 2] (w:1, o:79, a:1, s:1, b:1),
% 0.66/1.91 skol1 [77, 2] (w:1, o:80, a:1, s:1, b:1),
% 0.66/1.91 skol2 [78, 0] (w:1, o:20, a:1, s:1, b:1),
% 0.66/1.91 skol3 [79, 2] (w:1, o:81, a:1, s:1, b:1),
% 0.66/1.91 skol4 [80, 1] (w:1, o:42, a:1, s:1, b:1),
% 0.66/1.91 skol5 [81, 2] (w:1, o:82, a:1, s:1, b:1),
% 0.66/1.91 skol6 [82, 1] (w:1, o:43, a:1, s:1, b:1),
% 0.66/1.91 skol7 [83, 0] (w:1, o:21, a:1, s:1, b:1),
% 0.66/1.91 skol8 [84, 0] (w:1, o:22, a:1, s:1, b:1).
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 Starting Search:
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 Bliksems!, er is een bewijs:
% 0.66/1.91 % SZS status Theorem
% 0.66/1.91 % SZS output start Refutation
% 0.66/1.91
% 0.66/1.91 (4) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subclass( X, Y ) }.
% 0.66/1.91 (92) {G0,W3,D2,L1,V0,M1} I { ! subclass( skol8, skol8 ) }.
% 0.66/1.91 (93) {G1,W3,D2,L1,V1,M1} Q(4) { subclass( X, X ) }.
% 0.66/1.91 (114) {G2,W0,D0,L0,V0,M0} S(92);r(93) { }.
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 % SZS output end Refutation
% 0.66/1.91 found a proof!
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 Unprocessed initial clauses:
% 0.66/1.91
% 0.66/1.91 (116) {G0,W9,D2,L3,V3,M3} { ! subclass( X, Y ), ! member( Z, X ), member(
% 0.66/1.91 Z, Y ) }.
% 0.66/1.91 (117) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subclass( X, Y )
% 0.66/1.91 }.
% 0.66/1.91 (118) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subclass( X, Y )
% 0.66/1.91 }.
% 0.66/1.91 (119) {G0,W3,D2,L1,V1,M1} { subclass( X, universal_class ) }.
% 0.66/1.91 (120) {G0,W6,D2,L2,V2,M2} { ! X = Y, subclass( X, Y ) }.
% 0.66/1.91 (121) {G0,W6,D2,L2,V2,M2} { ! X = Y, subclass( Y, X ) }.
% 0.66/1.91 (122) {G0,W9,D2,L3,V2,M3} { ! subclass( X, Y ), ! subclass( Y, X ), X = Y
% 0.66/1.91 }.
% 0.66/1.91 (123) {G0,W8,D3,L2,V3,M2} { ! member( X, unordered_pair( Y, Z ) ), member
% 0.66/1.91 ( X, universal_class ) }.
% 0.66/1.91 (124) {G0,W9,D3,L2,V3,M2} { ! member( X, unordered_pair( Y, Z ) ), alpha1
% 0.66/1.91 ( X, Y, Z ) }.
% 0.66/1.91 (125) {G0,W12,D3,L3,V3,M3} { ! member( X, universal_class ), ! alpha1( X,
% 0.66/1.91 Y, Z ), member( X, unordered_pair( Y, Z ) ) }.
% 0.66/1.91 (126) {G0,W10,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), X = Y, X = Z }.
% 0.66/1.91 (127) {G0,W7,D2,L2,V3,M2} { ! X = Y, alpha1( X, Y, Z ) }.
% 0.66/1.91 (128) {G0,W7,D2,L2,V3,M2} { ! X = Z, alpha1( X, Y, Z ) }.
% 0.66/1.91 (129) {G0,W5,D3,L1,V2,M1} { member( unordered_pair( X, Y ),
% 0.66/1.91 universal_class ) }.
% 0.66/1.91 (130) {G0,W6,D3,L1,V1,M1} { singleton( X ) = unordered_pair( X, X ) }.
% 0.66/1.91 (131) {G0,W11,D5,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 0.66/1.91 singleton( X ), unordered_pair( X, singleton( Y ) ) ) }.
% 0.66/1.91 (132) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( X, Y ), cross_product
% 0.66/1.91 ( Z, T ) ), member( X, Z ) }.
% 0.66/1.91 (133) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( X, Y ), cross_product
% 0.66/1.91 ( Z, T ) ), member( Y, T ) }.
% 0.66/1.91 (134) {G0,W13,D3,L3,V4,M3} { ! member( X, Z ), ! member( Y, T ), member(
% 0.66/1.91 ordered_pair( X, Y ), cross_product( Z, T ) ) }.
% 0.66/1.91 (135) {G0,W12,D4,L3,V2,M3} { ! member( X, universal_class ), ! member( Y,
% 0.66/1.91 universal_class ), first( ordered_pair( X, Y ) ) = X }.
% 0.66/1.91 (136) {G0,W12,D4,L3,V2,M3} { ! member( X, universal_class ), ! member( Y,
% 0.66/1.91 universal_class ), second( ordered_pair( X, Y ) ) = Y }.
% 0.66/1.91 (137) {G0,W12,D4,L2,V3,M2} { ! member( X, cross_product( Y, Z ) ), X =
% 0.66/1.91 ordered_pair( first( X ), second( X ) ) }.
% 0.66/1.91 (138) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 0.66/1.91 element_relation ), member( Y, universal_class ) }.
% 0.66/1.91 (139) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 0.66/1.91 element_relation ), member( X, Y ) }.
% 0.66/1.91 (140) {G0,W11,D3,L3,V2,M3} { ! member( Y, universal_class ), ! member( X,
% 0.66/1.91 Y ), member( ordered_pair( X, Y ), element_relation ) }.
% 0.66/1.91 (141) {G0,W5,D3,L1,V0,M1} { subclass( element_relation, cross_product(
% 0.66/1.91 universal_class, universal_class ) ) }.
% 0.66/1.91 (142) {G0,W8,D3,L2,V3,M2} { ! member( Z, intersection( X, Y ) ), member( Z
% 0.66/1.91 , X ) }.
% 0.66/1.91 (143) {G0,W8,D3,L2,V3,M2} { ! member( Z, intersection( X, Y ) ), member( Z
% 0.66/1.91 , Y ) }.
% 0.66/1.91 (144) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ), member( Z
% 0.66/1.91 , intersection( X, Y ) ) }.
% 0.66/1.91 (145) {G0,W7,D3,L2,V2,M2} { ! member( Y, complement( X ) ), member( Y,
% 0.66/1.91 universal_class ) }.
% 0.66/1.91 (146) {G0,W7,D3,L2,V2,M2} { ! member( Y, complement( X ) ), ! member( Y, X
% 0.66/1.91 ) }.
% 0.66/1.91 (147) {G0,W10,D3,L3,V2,M3} { ! member( Y, universal_class ), member( Y, X
% 0.66/1.91 ), member( Y, complement( X ) ) }.
% 0.66/1.91 (148) {G0,W10,D4,L1,V3,M1} { restrict( Y, X, Z ) = intersection( Y,
% 0.66/1.91 cross_product( X, Z ) ) }.
% 0.66/1.91 (149) {G0,W3,D2,L1,V1,M1} { ! member( X, null_class ) }.
% 0.66/1.91 (150) {G0,W7,D3,L2,V2,M2} { ! member( Y, domain_of( X ) ), member( Y,
% 0.66/1.91 universal_class ) }.
% 0.66/1.91 (151) {G0,W11,D4,L2,V2,M2} { ! member( Y, domain_of( X ) ), ! restrict( X
% 0.66/1.91 , singleton( Y ), universal_class ) = null_class }.
% 0.66/1.91 (152) {G0,W14,D4,L3,V2,M3} { ! member( Y, universal_class ), restrict( X,
% 0.66/1.91 singleton( Y ), universal_class ) = null_class, member( Y, domain_of( X )
% 0.66/1.91 ) }.
% 0.66/1.91 (153) {G0,W19,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( Y, Z )
% 0.66/1.91 , T ), rotate( X ) ), member( ordered_pair( ordered_pair( Y, Z ), T ),
% 0.66/1.91 cross_product( cross_product( universal_class, universal_class ),
% 0.66/1.91 universal_class ) ) }.
% 0.66/1.91 (154) {G0,W15,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( Y, Z )
% 0.66/1.91 , T ), rotate( X ) ), member( ordered_pair( ordered_pair( Z, T ), Y ), X
% 0.66/1.91 ) }.
% 0.66/1.91 (155) {G0,W26,D4,L3,V4,M3} { ! member( ordered_pair( ordered_pair( Y, Z )
% 0.66/1.91 , T ), cross_product( cross_product( universal_class, universal_class ),
% 0.66/1.91 universal_class ) ), ! member( ordered_pair( ordered_pair( Z, T ), Y ), X
% 0.66/1.91 ), member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ) }.
% 0.66/1.91 (156) {G0,W8,D4,L1,V1,M1} { subclass( rotate( X ), cross_product(
% 0.66/1.91 cross_product( universal_class, universal_class ), universal_class ) )
% 0.66/1.91 }.
% 0.66/1.91 (157) {G0,W19,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( X, Y )
% 0.66/1.91 , Z ), flip( T ) ), member( ordered_pair( ordered_pair( X, Y ), Z ),
% 0.66/1.91 cross_product( cross_product( universal_class, universal_class ),
% 0.66/1.91 universal_class ) ) }.
% 0.66/1.91 (158) {G0,W15,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( X, Y )
% 0.66/1.91 , Z ), flip( T ) ), member( ordered_pair( ordered_pair( Y, X ), Z ), T )
% 0.66/1.91 }.
% 0.66/1.91 (159) {G0,W26,D4,L3,V4,M3} { ! member( ordered_pair( ordered_pair( X, Y )
% 0.66/1.91 , Z ), cross_product( cross_product( universal_class, universal_class ),
% 0.66/1.91 universal_class ) ), ! member( ordered_pair( ordered_pair( Y, X ), Z ), T
% 0.66/1.91 ), member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ) }.
% 0.66/1.91 (160) {G0,W8,D4,L1,V1,M1} { subclass( flip( X ), cross_product(
% 0.66/1.91 cross_product( universal_class, universal_class ), universal_class ) )
% 0.66/1.91 }.
% 0.66/1.91 (161) {G0,W11,D3,L3,V3,M3} { ! member( Z, union( X, Y ) ), member( Z, X )
% 0.66/1.91 , member( Z, Y ) }.
% 0.66/1.91 (162) {G0,W8,D3,L2,V3,M2} { ! member( Z, X ), member( Z, union( X, Y ) )
% 0.66/1.91 }.
% 0.66/1.91 (163) {G0,W8,D3,L2,V3,M2} { ! member( Z, Y ), member( Z, union( X, Y ) )
% 0.66/1.91 }.
% 0.66/1.91 (164) {G0,W7,D4,L1,V1,M1} { successor( X ) = union( X, singleton( X ) )
% 0.66/1.91 }.
% 0.66/1.91 (165) {G0,W5,D3,L1,V0,M1} { subclass( successor_relation, cross_product(
% 0.66/1.91 universal_class, universal_class ) ) }.
% 0.66/1.91 (166) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 0.66/1.91 successor_relation ), member( X, universal_class ) }.
% 0.66/1.91 (167) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 0.66/1.91 successor_relation ), alpha2( X, Y ) }.
% 0.66/1.91 (168) {G0,W11,D3,L3,V2,M3} { ! member( X, universal_class ), ! alpha2( X,
% 0.66/1.91 Y ), member( ordered_pair( X, Y ), successor_relation ) }.
% 0.66/1.91 (169) {G0,W6,D2,L2,V2,M2} { ! alpha2( X, Y ), member( Y, universal_class )
% 0.66/1.91 }.
% 0.66/1.91 (170) {G0,W7,D3,L2,V2,M2} { ! alpha2( X, Y ), successor( X ) = Y }.
% 0.66/1.91 (171) {G0,W10,D3,L3,V2,M3} { ! member( Y, universal_class ), ! successor(
% 0.66/1.91 X ) = Y, alpha2( X, Y ) }.
% 0.66/1.91 (172) {G0,W8,D5,L1,V1,M1} { inverse( X ) = domain_of( flip( cross_product
% 0.66/1.91 ( X, universal_class ) ) ) }.
% 0.66/1.91 (173) {G0,W6,D4,L1,V1,M1} { range_of( X ) = domain_of( inverse( X ) ) }.
% 0.66/1.91 (174) {G0,W9,D4,L1,V2,M1} { image( Y, X ) = range_of( restrict( Y, X,
% 0.66/1.91 universal_class ) ) }.
% 0.66/1.91 (175) {G0,W5,D2,L2,V1,M2} { ! inductive( X ), member( null_class, X ) }.
% 0.66/1.91 (176) {G0,W7,D3,L2,V1,M2} { ! inductive( X ), subclass( image(
% 0.66/1.91 successor_relation, X ), X ) }.
% 0.66/1.91 (177) {G0,W10,D3,L3,V1,M3} { ! member( null_class, X ), ! subclass( image
% 0.66/1.91 ( successor_relation, X ), X ), inductive( X ) }.
% 0.66/1.91 (178) {G0,W3,D2,L1,V0,M1} { member( skol2, universal_class ) }.
% 0.66/1.91 (179) {G0,W2,D2,L1,V0,M1} { inductive( skol2 ) }.
% 0.66/1.91 (180) {G0,W5,D2,L2,V1,M2} { ! inductive( X ), subclass( skol2, X ) }.
% 0.66/1.91 (181) {G0,W9,D3,L2,V3,M2} { ! member( X, sum_class( Y ) ), member( skol3(
% 0.66/1.91 Z, Y ), Y ) }.
% 0.66/1.91 (182) {G0,W9,D3,L2,V2,M2} { ! member( X, sum_class( Y ) ), member( X,
% 0.66/1.91 skol3( X, Y ) ) }.
% 0.66/1.91 (183) {G0,W10,D3,L3,V3,M3} { ! member( X, Z ), ! member( Z, Y ), member( X
% 0.66/1.91 , sum_class( Y ) ) }.
% 0.66/1.91 (184) {G0,W7,D3,L2,V1,M2} { ! member( X, universal_class ), member(
% 0.66/1.91 sum_class( X ), universal_class ) }.
% 0.66/1.91 (185) {G0,W7,D3,L2,V2,M2} { ! member( X, power_class( Y ) ), member( X,
% 0.66/1.91 universal_class ) }.
% 0.66/1.91 (186) {G0,W7,D3,L2,V2,M2} { ! member( X, power_class( Y ) ), subclass( X,
% 0.66/1.91 Y ) }.
% 0.66/1.91 (187) {G0,W10,D3,L3,V2,M3} { ! member( X, universal_class ), ! subclass( X
% 0.66/1.91 , Y ), member( X, power_class( Y ) ) }.
% 0.66/1.91 (188) {G0,W7,D3,L2,V1,M2} { ! member( X, universal_class ), member(
% 0.66/1.91 power_class( X ), universal_class ) }.
% 0.66/1.91 (189) {G0,W7,D3,L1,V2,M1} { subclass( compose( Y, X ), cross_product(
% 0.66/1.91 universal_class, universal_class ) ) }.
% 0.66/1.91 (190) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( Z, T ), compose( Y, X
% 0.66/1.91 ) ), member( Z, universal_class ) }.
% 0.66/1.91 (191) {G0,W15,D5,L2,V4,M2} { ! member( ordered_pair( Z, T ), compose( Y, X
% 0.66/1.91 ) ), member( T, image( Y, image( X, singleton( Z ) ) ) ) }.
% 0.66/1.91 (192) {G0,W18,D5,L3,V4,M3} { ! member( Z, universal_class ), ! member( T,
% 0.66/1.91 image( Y, image( X, singleton( Z ) ) ) ), member( ordered_pair( Z, T ),
% 0.66/1.91 compose( Y, X ) ) }.
% 0.66/1.91 (193) {G0,W7,D3,L2,V2,M2} { ! member( X, identity_relation ), member(
% 0.66/1.91 skol4( Y ), universal_class ) }.
% 0.66/1.91 (194) {G0,W10,D4,L2,V1,M2} { ! member( X, identity_relation ), X =
% 0.66/1.91 ordered_pair( skol4( X ), skol4( X ) ) }.
% 0.66/1.91 (195) {G0,W11,D3,L3,V2,M3} { ! member( Y, universal_class ), ! X =
% 0.66/1.91 ordered_pair( Y, Y ), member( X, identity_relation ) }.
% 0.66/1.91 (196) {G0,W7,D3,L2,V1,M2} { ! function( X ), subclass( X, cross_product(
% 0.66/1.91 universal_class, universal_class ) ) }.
% 0.66/1.91 (197) {G0,W8,D4,L2,V1,M2} { ! function( X ), subclass( compose( X, inverse
% 0.66/1.91 ( X ) ), identity_relation ) }.
% 0.66/1.91 (198) {G0,W13,D4,L3,V1,M3} { ! subclass( X, cross_product( universal_class
% 0.66/1.91 , universal_class ) ), ! subclass( compose( X, inverse( X ) ),
% 0.66/1.91 identity_relation ), function( X ) }.
% 0.66/1.91 (199) {G0,W10,D3,L3,V2,M3} { ! member( X, universal_class ), ! function( Y
% 0.66/1.91 ), member( image( Y, X ), universal_class ) }.
% 0.66/1.91 (200) {G0,W9,D2,L3,V3,M3} { ! disjoint( X, Y ), ! member( Z, X ), ! member
% 0.66/1.91 ( Z, Y ) }.
% 0.66/1.91 (201) {G0,W8,D3,L2,V3,M2} { member( skol5( Z, Y ), Y ), disjoint( X, Y )
% 0.66/1.91 }.
% 0.66/1.91 (202) {G0,W8,D3,L2,V2,M2} { member( skol5( X, Y ), X ), disjoint( X, Y )
% 0.66/1.91 }.
% 0.66/1.91 (203) {G0,W7,D3,L2,V2,M2} { X = null_class, member( skol6( Y ),
% 0.66/1.91 universal_class ) }.
% 0.66/1.91 (204) {G0,W7,D3,L2,V1,M2} { X = null_class, member( skol6( X ), X ) }.
% 0.66/1.91 (205) {G0,W7,D3,L2,V1,M2} { X = null_class, disjoint( skol6( X ), X ) }.
% 0.66/1.91 (206) {G0,W9,D5,L1,V2,M1} { apply( X, Y ) = sum_class( image( X, singleton
% 0.66/1.91 ( Y ) ) ) }.
% 0.66/1.91 (207) {G0,W2,D2,L1,V0,M1} { function( skol7 ) }.
% 0.66/1.91 (208) {G0,W11,D3,L3,V1,M3} { ! member( X, universal_class ), X =
% 0.66/1.91 null_class, member( apply( skol7, X ), X ) }.
% 0.66/1.91 (209) {G0,W3,D2,L1,V0,M1} { ! subclass( skol8, skol8 ) }.
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 Total Proof:
% 0.66/1.91
% 0.66/1.91 subsumption: (4) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subclass( X, Y ) }.
% 0.66/1.91 parent0: (120) {G0,W6,D2,L2,V2,M2} { ! X = Y, subclass( X, Y ) }.
% 0.66/1.91 substitution0:
% 0.66/1.91 X := X
% 0.66/1.91 Y := Y
% 0.66/1.91 end
% 0.66/1.91 permutation0:
% 0.66/1.91 0 ==> 0
% 0.66/1.91 1 ==> 1
% 0.66/1.91 end
% 0.66/1.91
% 0.66/1.91 *** allocated 15000 integers for clauses
% 0.66/1.91 subsumption: (92) {G0,W3,D2,L1,V0,M1} I { ! subclass( skol8, skol8 ) }.
% 0.66/1.91 parent0: (209) {G0,W3,D2,L1,V0,M1} { ! subclass( skol8, skol8 ) }.
% 0.66/1.91 substitution0:
% 0.66/1.91 end
% 0.66/1.91 permutation0:
% 0.66/1.91 0 ==> 0
% 0.66/1.91 end
% 0.66/1.91
% 0.66/1.91 eqswap: (254) {G0,W6,D2,L2,V2,M2} { ! Y = X, subclass( X, Y ) }.
% 0.66/1.91 parent0[0]: (4) {G0,W6,D2,L2,V2,M2} I { ! X = Y, subclass( X, Y ) }.
% 0.66/1.91 substitution0:
% 0.66/1.91 X := X
% 0.66/1.91 Y := Y
% 0.66/1.91 end
% 0.66/1.91
% 0.66/1.91 eqrefl: (255) {G0,W3,D2,L1,V1,M1} { subclass( X, X ) }.
% 0.66/1.91 parent0[0]: (254) {G0,W6,D2,L2,V2,M2} { ! Y = X, subclass( X, Y ) }.
% 0.66/1.91 substitution0:
% 0.66/1.91 X := X
% 0.66/1.91 Y := X
% 0.66/1.91 end
% 0.66/1.91
% 0.66/1.91 subsumption: (93) {G1,W3,D2,L1,V1,M1} Q(4) { subclass( X, X ) }.
% 0.66/1.91 parent0: (255) {G0,W3,D2,L1,V1,M1} { subclass( X, X ) }.
% 0.66/1.91 substitution0:
% 0.66/1.91 X := X
% 0.66/1.91 end
% 0.66/1.91 permutation0:
% 0.66/1.91 0 ==> 0
% 0.66/1.91 end
% 0.66/1.91
% 0.66/1.91 resolution: (256) {G1,W0,D0,L0,V0,M0} { }.
% 0.66/1.91 parent0[0]: (92) {G0,W3,D2,L1,V0,M1} I { ! subclass( skol8, skol8 ) }.
% 0.66/1.91 parent1[0]: (93) {G1,W3,D2,L1,V1,M1} Q(4) { subclass( X, X ) }.
% 0.66/1.91 substitution0:
% 0.66/1.91 end
% 0.66/1.91 substitution1:
% 0.66/1.91 X := skol8
% 0.66/1.91 end
% 0.66/1.91
% 0.66/1.91 subsumption: (114) {G2,W0,D0,L0,V0,M0} S(92);r(93) { }.
% 0.66/1.91 parent0: (256) {G1,W0,D0,L0,V0,M0} { }.
% 0.66/1.91 substitution0:
% 0.66/1.91 end
% 0.66/1.91 permutation0:
% 0.66/1.91 end
% 0.66/1.91
% 0.66/1.91 Proof check complete!
% 0.66/1.91
% 0.66/1.91 Memory use:
% 0.66/1.91
% 0.66/1.91 space for terms: 3077
% 0.66/1.91 space for clauses: 7596
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 clauses generated: 128
% 0.66/1.91 clauses kept: 115
% 0.66/1.91 clauses selected: 6
% 0.66/1.91 clauses deleted: 1
% 0.66/1.91 clauses inuse deleted: 0
% 0.66/1.91
% 0.66/1.91 subsentry: 247
% 0.66/1.91 literals s-matched: 165
% 0.66/1.91 literals matched: 165
% 0.66/1.91 full subsumption: 56
% 0.66/1.91
% 0.66/1.91 checksum: -575818740
% 0.66/1.91
% 0.66/1.91
% 0.66/1.91 Bliksem ended
%------------------------------------------------------------------------------