TSTP Solution File: SET108+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n016.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:47:11 EDT 2022
% Result : Theorem 1.26s 1.64s
% Output : Refutation 1.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Mon Jul 11 10:00:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.11 *** allocated 10000 integers for termspace/termends
% 0.71/1.11 *** allocated 10000 integers for clauses
% 0.71/1.11 *** allocated 10000 integers for justifications
% 0.71/1.11 Bliksem 1.12
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Automatic Strategy Selection
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Clauses:
% 0.71/1.11
% 0.71/1.11 { ! subclass( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.71/1.11 { ! member( skol1( Z, Y ), Y ), subclass( X, Y ) }.
% 0.71/1.11 { member( skol1( X, Y ), X ), subclass( X, Y ) }.
% 0.71/1.11 { subclass( X, universal_class ) }.
% 0.71/1.11 { ! X = Y, subclass( X, Y ) }.
% 0.71/1.11 { ! X = Y, subclass( Y, X ) }.
% 0.71/1.11 { ! subclass( X, Y ), ! subclass( Y, X ), X = Y }.
% 0.71/1.11 { ! member( X, unordered_pair( Y, Z ) ), member( X, universal_class ) }.
% 0.71/1.11 { ! member( X, unordered_pair( Y, Z ) ), alpha1( X, Y, Z ) }.
% 0.71/1.11 { ! member( X, universal_class ), ! alpha1( X, Y, Z ), member( X,
% 0.71/1.11 unordered_pair( Y, Z ) ) }.
% 0.71/1.11 { ! alpha1( X, Y, Z ), X = Y, X = Z }.
% 0.71/1.11 { ! X = Y, alpha1( X, Y, Z ) }.
% 0.71/1.11 { ! X = Z, alpha1( X, Y, Z ) }.
% 0.71/1.11 { member( unordered_pair( X, Y ), universal_class ) }.
% 0.71/1.11 { singleton( X ) = unordered_pair( X, X ) }.
% 0.71/1.11 { ordered_pair( X, Y ) = unordered_pair( singleton( X ), unordered_pair( X
% 0.71/1.11 , singleton( Y ) ) ) }.
% 0.71/1.11 { ! member( ordered_pair( X, Y ), cross_product( Z, T ) ), member( X, Z ) }
% 0.71/1.11 .
% 0.71/1.11 { ! member( ordered_pair( X, Y ), cross_product( Z, T ) ), member( Y, T ) }
% 0.71/1.11 .
% 0.71/1.11 { ! member( X, Z ), ! member( Y, T ), member( ordered_pair( X, Y ),
% 0.71/1.11 cross_product( Z, T ) ) }.
% 0.71/1.11 { ! member( X, universal_class ), ! member( Y, universal_class ), first(
% 0.71/1.11 ordered_pair( X, Y ) ) = X }.
% 0.71/1.11 { ! member( X, universal_class ), ! member( Y, universal_class ), second(
% 0.71/1.11 ordered_pair( X, Y ) ) = Y }.
% 0.71/1.11 { ! member( X, cross_product( Y, Z ) ), X = ordered_pair( first( X ),
% 0.71/1.11 second( X ) ) }.
% 0.71/1.11 { ! member( ordered_pair( X, Y ), element_relation ), member( Y,
% 0.71/1.11 universal_class ) }.
% 0.71/1.11 { ! member( ordered_pair( X, Y ), element_relation ), member( X, Y ) }.
% 0.71/1.11 { ! member( Y, universal_class ), ! member( X, Y ), member( ordered_pair( X
% 0.71/1.11 , Y ), element_relation ) }.
% 0.71/1.11 { subclass( element_relation, cross_product( universal_class,
% 0.71/1.11 universal_class ) ) }.
% 0.71/1.11 { ! member( Z, intersection( X, Y ) ), member( Z, X ) }.
% 0.71/1.11 { ! member( Z, intersection( X, Y ) ), member( Z, Y ) }.
% 0.71/1.11 { ! member( Z, X ), ! member( Z, Y ), member( Z, intersection( X, Y ) ) }.
% 0.71/1.11 { ! member( Y, complement( X ) ), member( Y, universal_class ) }.
% 0.71/1.11 { ! member( Y, complement( X ) ), ! member( Y, X ) }.
% 0.71/1.11 { ! member( Y, universal_class ), member( Y, X ), member( Y, complement( X
% 0.71/1.11 ) ) }.
% 0.71/1.11 { restrict( Y, X, Z ) = intersection( Y, cross_product( X, Z ) ) }.
% 0.71/1.11 { ! member( X, null_class ) }.
% 0.71/1.11 { ! member( Y, domain_of( X ) ), member( Y, universal_class ) }.
% 0.71/1.11 { ! member( Y, domain_of( X ) ), ! restrict( X, singleton( Y ),
% 0.71/1.11 universal_class ) = null_class }.
% 0.71/1.11 { ! member( Y, universal_class ), restrict( X, singleton( Y ),
% 0.71/1.11 universal_class ) = null_class, member( Y, domain_of( X ) ) }.
% 0.71/1.11 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ), member
% 0.71/1.11 ( ordered_pair( ordered_pair( Y, Z ), T ), cross_product( cross_product(
% 0.71/1.11 universal_class, universal_class ), universal_class ) ) }.
% 0.71/1.11 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ), member
% 0.71/1.11 ( ordered_pair( ordered_pair( Z, T ), Y ), X ) }.
% 0.71/1.11 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), cross_product(
% 0.71/1.11 cross_product( universal_class, universal_class ), universal_class ) ), !
% 0.71/1.11 member( ordered_pair( ordered_pair( Z, T ), Y ), X ), member(
% 0.71/1.11 ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ) }.
% 0.71/1.11 { subclass( rotate( X ), cross_product( cross_product( universal_class,
% 0.71/1.11 universal_class ), universal_class ) ) }.
% 0.71/1.11 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ), member(
% 0.71/1.11 ordered_pair( ordered_pair( X, Y ), Z ), cross_product( cross_product(
% 0.71/1.11 universal_class, universal_class ), universal_class ) ) }.
% 0.71/1.11 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ), member(
% 0.71/1.11 ordered_pair( ordered_pair( Y, X ), Z ), T ) }.
% 0.71/1.11 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), cross_product(
% 0.71/1.11 cross_product( universal_class, universal_class ), universal_class ) ), !
% 0.71/1.11 member( ordered_pair( ordered_pair( Y, X ), Z ), T ), member(
% 0.71/1.11 ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ) }.
% 0.71/1.11 { subclass( flip( X ), cross_product( cross_product( universal_class,
% 0.75/1.26 universal_class ), universal_class ) ) }.
% 0.75/1.26 { ! member( Z, union( X, Y ) ), member( Z, X ), member( Z, Y ) }.
% 0.75/1.26 { ! member( Z, X ), member( Z, union( X, Y ) ) }.
% 0.75/1.26 { ! member( Z, Y ), member( Z, union( X, Y ) ) }.
% 0.75/1.26 { successor( X ) = union( X, singleton( X ) ) }.
% 0.75/1.26 { subclass( successor_relation, cross_product( universal_class,
% 0.75/1.26 universal_class ) ) }.
% 0.75/1.26 { ! member( ordered_pair( X, Y ), successor_relation ), member( X,
% 0.75/1.26 universal_class ) }.
% 0.75/1.26 { ! member( ordered_pair( X, Y ), successor_relation ), alpha2( X, Y ) }.
% 0.75/1.26 { ! member( X, universal_class ), ! alpha2( X, Y ), member( ordered_pair( X
% 0.75/1.26 , Y ), successor_relation ) }.
% 0.75/1.26 { ! alpha2( X, Y ), member( Y, universal_class ) }.
% 0.75/1.26 { ! alpha2( X, Y ), successor( X ) = Y }.
% 0.75/1.26 { ! member( Y, universal_class ), ! successor( X ) = Y, alpha2( X, Y ) }.
% 0.75/1.26 { inverse( X ) = domain_of( flip( cross_product( X, universal_class ) ) ) }
% 0.75/1.26 .
% 0.75/1.26 { range_of( X ) = domain_of( inverse( X ) ) }.
% 0.75/1.26 { image( Y, X ) = range_of( restrict( Y, X, universal_class ) ) }.
% 0.75/1.26 { ! inductive( X ), member( null_class, X ) }.
% 0.75/1.26 { ! inductive( X ), subclass( image( successor_relation, X ), X ) }.
% 0.75/1.26 { ! member( null_class, X ), ! subclass( image( successor_relation, X ), X
% 0.75/1.26 ), inductive( X ) }.
% 0.75/1.26 { member( skol2, universal_class ) }.
% 0.75/1.26 { inductive( skol2 ) }.
% 0.75/1.26 { ! inductive( X ), subclass( skol2, X ) }.
% 0.75/1.26 { ! member( X, sum_class( Y ) ), member( skol3( Z, Y ), Y ) }.
% 0.75/1.26 { ! member( X, sum_class( Y ) ), member( X, skol3( X, Y ) ) }.
% 0.75/1.26 { ! member( X, Z ), ! member( Z, Y ), member( X, sum_class( Y ) ) }.
% 0.75/1.26 { ! member( X, universal_class ), member( sum_class( X ), universal_class )
% 0.75/1.26 }.
% 0.75/1.26 { ! member( X, power_class( Y ) ), member( X, universal_class ) }.
% 0.75/1.26 { ! member( X, power_class( Y ) ), subclass( X, Y ) }.
% 0.75/1.26 { ! member( X, universal_class ), ! subclass( X, Y ), member( X,
% 0.75/1.26 power_class( Y ) ) }.
% 0.75/1.26 { ! member( X, universal_class ), member( power_class( X ), universal_class
% 0.75/1.26 ) }.
% 0.75/1.26 { subclass( compose( Y, X ), cross_product( universal_class,
% 0.75/1.26 universal_class ) ) }.
% 0.75/1.26 { ! member( ordered_pair( Z, T ), compose( Y, X ) ), member( Z,
% 0.75/1.26 universal_class ) }.
% 0.75/1.26 { ! member( ordered_pair( Z, T ), compose( Y, X ) ), member( T, image( Y,
% 0.75/1.26 image( X, singleton( Z ) ) ) ) }.
% 0.75/1.26 { ! member( Z, universal_class ), ! member( T, image( Y, image( X,
% 0.75/1.26 singleton( Z ) ) ) ), member( ordered_pair( Z, T ), compose( Y, X ) ) }.
% 0.75/1.26 { ! member( X, identity_relation ), member( skol4( Y ), universal_class ) }
% 0.75/1.26 .
% 0.75/1.26 { ! member( X, identity_relation ), X = ordered_pair( skol4( X ), skol4( X
% 0.75/1.26 ) ) }.
% 0.75/1.26 { ! member( Y, universal_class ), ! X = ordered_pair( Y, Y ), member( X,
% 0.75/1.26 identity_relation ) }.
% 0.75/1.26 { ! function( X ), subclass( X, cross_product( universal_class,
% 0.75/1.26 universal_class ) ) }.
% 0.75/1.26 { ! function( X ), subclass( compose( X, inverse( X ) ), identity_relation
% 0.75/1.26 ) }.
% 0.75/1.26 { ! subclass( X, cross_product( universal_class, universal_class ) ), !
% 0.75/1.26 subclass( compose( X, inverse( X ) ), identity_relation ), function( X )
% 0.75/1.26 }.
% 0.75/1.26 { ! member( X, universal_class ), ! function( Y ), member( image( Y, X ),
% 0.75/1.26 universal_class ) }.
% 0.75/1.26 { ! disjoint( X, Y ), ! member( Z, X ), ! member( Z, Y ) }.
% 0.75/1.26 { member( skol5( Z, Y ), Y ), disjoint( X, Y ) }.
% 0.75/1.26 { member( skol5( X, Y ), X ), disjoint( X, Y ) }.
% 0.75/1.26 { X = null_class, member( skol6( Y ), universal_class ) }.
% 0.75/1.26 { X = null_class, member( skol6( X ), X ) }.
% 0.75/1.26 { X = null_class, disjoint( skol6( X ), X ) }.
% 0.75/1.26 { apply( X, Y ) = sum_class( image( X, singleton( Y ) ) ) }.
% 0.75/1.26 { function( skol7 ) }.
% 0.75/1.26 { ! member( X, universal_class ), X = null_class, member( apply( skol7, X )
% 0.75/1.26 , X ) }.
% 0.75/1.26 { ! member( X, universal_class ), ! member( Y, universal_class ), ! skol8 =
% 0.75/1.26 ordered_pair( X, Y ) }.
% 0.75/1.26 { member( skol9, universal_class ), ! X = skol8, ! Y = skol8 }.
% 0.75/1.26 { member( skol10, universal_class ), ! X = skol8, ! Y = skol8 }.
% 0.75/1.26 { skol8 = ordered_pair( skol9, skol10 ), ! X = skol8, ! Y = skol8 }.
% 0.75/1.26
% 0.75/1.26 percentage equality = 0.176471, percentage horn = 0.886598
% 0.75/1.26 This is a problem with some equality
% 0.75/1.26
% 0.75/1.26
% 0.75/1.26
% 0.75/1.26 Options Used:
% 0.75/1.26
% 0.75/1.26 useres = 1
% 0.75/1.26 useparamod = 1
% 0.75/1.26 useeqrefl = 1
% 0.75/1.26 useeqfact = 1
% 0.75/1.26 usefactor = 1
% 0.75/1.26 usesimpsplitting = 0
% 0.75/1.26 usesimpdemod = 5
% 1.26/1.64 usesimpres = 3
% 1.26/1.64
% 1.26/1.64 resimpinuse = 1000
% 1.26/1.64 resimpclauses = 20000
% 1.26/1.64 substype = eqrewr
% 1.26/1.64 backwardsubs = 1
% 1.26/1.64 selectoldest = 5
% 1.26/1.64
% 1.26/1.64 litorderings [0] = split
% 1.26/1.64 litorderings [1] = extend the termordering, first sorting on arguments
% 1.26/1.64
% 1.26/1.64 termordering = kbo
% 1.26/1.64
% 1.26/1.64 litapriori = 0
% 1.26/1.64 termapriori = 1
% 1.26/1.64 litaposteriori = 0
% 1.26/1.64 termaposteriori = 0
% 1.26/1.64 demodaposteriori = 0
% 1.26/1.64 ordereqreflfact = 0
% 1.26/1.64
% 1.26/1.64 litselect = negord
% 1.26/1.64
% 1.26/1.64 maxweight = 15
% 1.26/1.64 maxdepth = 30000
% 1.26/1.64 maxlength = 115
% 1.26/1.64 maxnrvars = 195
% 1.26/1.64 excuselevel = 1
% 1.26/1.64 increasemaxweight = 1
% 1.26/1.64
% 1.26/1.64 maxselected = 10000000
% 1.26/1.64 maxnrclauses = 10000000
% 1.26/1.64
% 1.26/1.64 showgenerated = 0
% 1.26/1.64 showkept = 0
% 1.26/1.64 showselected = 0
% 1.26/1.64 showdeleted = 0
% 1.26/1.64 showresimp = 1
% 1.26/1.64 showstatus = 2000
% 1.26/1.64
% 1.26/1.64 prologoutput = 0
% 1.26/1.64 nrgoals = 5000000
% 1.26/1.64 totalproof = 1
% 1.26/1.64
% 1.26/1.64 Symbols occurring in the translation:
% 1.26/1.64
% 1.26/1.64 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.26/1.64 . [1, 2] (w:1, o:46, a:1, s:1, b:0),
% 1.26/1.64 ! [4, 1] (w:0, o:25, a:1, s:1, b:0),
% 1.26/1.64 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.26/1.64 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.26/1.64 subclass [37, 2] (w:1, o:70, a:1, s:1, b:0),
% 1.26/1.64 member [39, 2] (w:1, o:71, a:1, s:1, b:0),
% 1.26/1.64 universal_class [40, 0] (w:1, o:12, a:1, s:1, b:0),
% 1.26/1.64 unordered_pair [41, 2] (w:1, o:72, a:1, s:1, b:0),
% 1.26/1.64 singleton [42, 1] (w:1, o:32, a:1, s:1, b:0),
% 1.26/1.64 ordered_pair [43, 2] (w:1, o:73, a:1, s:1, b:0),
% 1.26/1.64 cross_product [45, 2] (w:1, o:74, a:1, s:1, b:0),
% 1.26/1.64 first [46, 1] (w:1, o:33, a:1, s:1, b:0),
% 1.26/1.64 second [47, 1] (w:1, o:34, a:1, s:1, b:0),
% 1.26/1.64 element_relation [49, 0] (w:1, o:16, a:1, s:1, b:0),
% 1.26/1.64 intersection [50, 2] (w:1, o:76, a:1, s:1, b:0),
% 1.26/1.64 complement [51, 1] (w:1, o:35, a:1, s:1, b:0),
% 1.26/1.64 restrict [53, 3] (w:1, o:85, a:1, s:1, b:0),
% 1.26/1.64 null_class [54, 0] (w:1, o:17, a:1, s:1, b:0),
% 1.26/1.64 domain_of [55, 1] (w:1, o:36, a:1, s:1, b:0),
% 1.26/1.64 rotate [57, 1] (w:1, o:30, a:1, s:1, b:0),
% 1.26/1.64 flip [58, 1] (w:1, o:37, a:1, s:1, b:0),
% 1.26/1.64 union [59, 2] (w:1, o:77, a:1, s:1, b:0),
% 1.26/1.64 successor [60, 1] (w:1, o:38, a:1, s:1, b:0),
% 1.26/1.64 successor_relation [61, 0] (w:1, o:18, a:1, s:1, b:0),
% 1.26/1.64 inverse [62, 1] (w:1, o:39, a:1, s:1, b:0),
% 1.26/1.64 range_of [63, 1] (w:1, o:31, a:1, s:1, b:0),
% 1.26/1.64 image [64, 2] (w:1, o:75, a:1, s:1, b:0),
% 1.26/1.64 inductive [65, 1] (w:1, o:40, a:1, s:1, b:0),
% 1.26/1.64 sum_class [66, 1] (w:1, o:41, a:1, s:1, b:0),
% 1.26/1.64 power_class [67, 1] (w:1, o:42, a:1, s:1, b:0),
% 1.26/1.64 compose [69, 2] (w:1, o:78, a:1, s:1, b:0),
% 1.26/1.64 identity_relation [70, 0] (w:1, o:19, a:1, s:1, b:0),
% 1.26/1.64 function [72, 1] (w:1, o:43, a:1, s:1, b:0),
% 1.26/1.64 disjoint [73, 2] (w:1, o:79, a:1, s:1, b:0),
% 1.26/1.64 apply [74, 2] (w:1, o:80, a:1, s:1, b:0),
% 1.26/1.64 alpha1 [75, 3] (w:1, o:86, a:1, s:1, b:1),
% 1.26/1.64 alpha2 [76, 2] (w:1, o:81, a:1, s:1, b:1),
% 1.26/1.64 skol1 [77, 2] (w:1, o:82, a:1, s:1, b:1),
% 1.26/1.64 skol2 [78, 0] (w:1, o:21, a:1, s:1, b:1),
% 1.26/1.64 skol3 [79, 2] (w:1, o:83, a:1, s:1, b:1),
% 1.26/1.64 skol4 [80, 1] (w:1, o:44, a:1, s:1, b:1),
% 1.26/1.64 skol5 [81, 2] (w:1, o:84, a:1, s:1, b:1),
% 1.26/1.64 skol6 [82, 1] (w:1, o:45, a:1, s:1, b:1),
% 1.26/1.64 skol7 [83, 0] (w:1, o:22, a:1, s:1, b:1),
% 1.26/1.64 skol8 [84, 0] (w:1, o:23, a:1, s:1, b:1),
% 1.26/1.64 skol9 [85, 0] (w:1, o:24, a:1, s:1, b:1),
% 1.26/1.64 skol10 [86, 0] (w:1, o:20, a:1, s:1, b:1).
% 1.26/1.64
% 1.26/1.64
% 1.26/1.64 Starting Search:
% 1.26/1.64
% 1.26/1.64 *** allocated 15000 integers for clauses
% 1.26/1.64 *** allocated 22500 integers for clauses
% 1.26/1.64 *** allocated 33750 integers for clauses
% 1.26/1.64 *** allocated 15000 integers for termspace/termends
% 1.26/1.64 *** allocated 50625 integers for clauses
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64 *** allocated 22500 integers for termspace/termends
% 1.26/1.64 *** allocated 75937 integers for clauses
% 1.26/1.64 *** allocated 33750 integers for termspace/termends
% 1.26/1.64 *** allocated 113905 integers for clauses
% 1.26/1.64
% 1.26/1.64 Intermediate Status:
% 1.26/1.64 Generated: 5325
% 1.26/1.64 Kept: 2117
% 1.26/1.64 Inuse: 125
% 1.26/1.64 Deleted: 2
% 1.26/1.64 Deletedinuse: 1
% 1.26/1.64
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64 *** allocated 170857 integers for clauses
% 1.26/1.64 *** allocated 50625 integers for termspace/termends
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64 *** allocated 75937 integers for termspace/termends
% 1.26/1.64 *** allocated 256285 integers for clauses
% 1.26/1.64
% 1.26/1.64 Intermediate Status:
% 1.26/1.64 Generated: 10095
% 1.26/1.64 Kept: 4126
% 1.26/1.64 Inuse: 195
% 1.26/1.64 Deleted: 44
% 1.26/1.64 Deletedinuse: 18
% 1.26/1.64
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64 *** allocated 113905 integers for termspace/termends
% 1.26/1.64 *** allocated 384427 integers for clauses
% 1.26/1.64
% 1.26/1.64 Intermediate Status:
% 1.26/1.64 Generated: 14083
% 1.26/1.64 Kept: 6296
% 1.26/1.64 Inuse: 255
% 1.26/1.64 Deleted: 52
% 1.26/1.64 Deletedinuse: 21
% 1.26/1.64
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64 *** allocated 576640 integers for clauses
% 1.26/1.64
% 1.26/1.64 Intermediate Status:
% 1.26/1.64 Generated: 17900
% 1.26/1.64 Kept: 8325
% 1.26/1.64 Inuse: 314
% 1.26/1.64 Deleted: 70
% 1.26/1.64 Deletedinuse: 28
% 1.26/1.64
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64 *** allocated 170857 integers for termspace/termends
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64
% 1.26/1.64 Intermediate Status:
% 1.26/1.64 Generated: 24989
% 1.26/1.64 Kept: 10639
% 1.26/1.64 Inuse: 360
% 1.26/1.64 Deleted: 78
% 1.26/1.64 Deletedinuse: 32
% 1.26/1.64
% 1.26/1.64 Resimplifying inuse:
% 1.26/1.64 Done
% 1.26/1.64
% 1.26/1.64
% 1.26/1.64 Bliksems!, er is een bewijs:
% 1.26/1.64 % SZS status Theorem
% 1.26/1.64 % SZS output start Refutation
% 1.26/1.64
% 1.26/1.64 (92) {G0,W11,D3,L3,V2,M3} I { ! member( X, universal_class ), ! member( Y,
% 1.26/1.64 universal_class ), ! ordered_pair( X, Y ) ==> skol8 }.
% 1.26/1.64 (93) {G0,W9,D2,L3,V2,M3} I { member( skol9, universal_class ), ! X = skol8
% 1.26/1.64 , ! Y = skol8 }.
% 1.26/1.64 (94) {G0,W9,D2,L3,V2,M3} I { member( skol10, universal_class ), ! X = skol8
% 1.26/1.64 , ! Y = skol8 }.
% 1.26/1.64 (95) {G0,W11,D3,L3,V2,M3} I { ordered_pair( skol9, skol10 ) ==> skol8, ! X
% 1.26/1.64 = skol8, ! Y = skol8 }.
% 1.26/1.64 (115) {G1,W6,D2,L2,V1,M2} F(93) { member( skol9, universal_class ), ! X =
% 1.26/1.64 skol8 }.
% 1.26/1.64 (116) {G2,W3,D2,L1,V0,M1} Q(115) { member( skol9, universal_class ) }.
% 1.26/1.64 (117) {G1,W6,D2,L2,V1,M2} F(94) { member( skol10, universal_class ), ! X =
% 1.26/1.64 skol8 }.
% 1.26/1.64 (118) {G2,W3,D2,L1,V0,M1} Q(117) { member( skol10, universal_class ) }.
% 1.26/1.64 (119) {G1,W8,D3,L2,V1,M2} F(95) { ordered_pair( skol9, skol10 ) ==> skol8,
% 1.26/1.64 ! X = skol8 }.
% 1.26/1.64 (120) {G2,W5,D3,L1,V0,M1} Q(119) { ordered_pair( skol9, skol10 ) ==> skol8
% 1.26/1.64 }.
% 1.26/1.64 (10898) {G3,W3,D2,L1,V0,M1} R(92,120);r(116) { ! member( skol10,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 (10992) {G4,W0,D0,L0,V0,M0} S(10898);r(118) { }.
% 1.26/1.64
% 1.26/1.64
% 1.26/1.64 % SZS output end Refutation
% 1.26/1.64 found a proof!
% 1.26/1.64
% 1.26/1.64
% 1.26/1.64 Unprocessed initial clauses:
% 1.26/1.64
% 1.26/1.64 (10994) {G0,W9,D2,L3,V3,M3} { ! subclass( X, Y ), ! member( Z, X ), member
% 1.26/1.64 ( Z, Y ) }.
% 1.26/1.64 (10995) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subclass( X, Y
% 1.26/1.64 ) }.
% 1.26/1.64 (10996) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subclass( X, Y )
% 1.26/1.64 }.
% 1.26/1.64 (10997) {G0,W3,D2,L1,V1,M1} { subclass( X, universal_class ) }.
% 1.26/1.64 (10998) {G0,W6,D2,L2,V2,M2} { ! X = Y, subclass( X, Y ) }.
% 1.26/1.64 (10999) {G0,W6,D2,L2,V2,M2} { ! X = Y, subclass( Y, X ) }.
% 1.26/1.64 (11000) {G0,W9,D2,L3,V2,M3} { ! subclass( X, Y ), ! subclass( Y, X ), X =
% 1.26/1.64 Y }.
% 1.26/1.64 (11001) {G0,W8,D3,L2,V3,M2} { ! member( X, unordered_pair( Y, Z ) ),
% 1.26/1.64 member( X, universal_class ) }.
% 1.26/1.64 (11002) {G0,W9,D3,L2,V3,M2} { ! member( X, unordered_pair( Y, Z ) ),
% 1.26/1.64 alpha1( X, Y, Z ) }.
% 1.26/1.64 (11003) {G0,W12,D3,L3,V3,M3} { ! member( X, universal_class ), ! alpha1( X
% 1.26/1.64 , Y, Z ), member( X, unordered_pair( Y, Z ) ) }.
% 1.26/1.64 (11004) {G0,W10,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), X = Y, X = Z }.
% 1.26/1.64 (11005) {G0,W7,D2,L2,V3,M2} { ! X = Y, alpha1( X, Y, Z ) }.
% 1.26/1.64 (11006) {G0,W7,D2,L2,V3,M2} { ! X = Z, alpha1( X, Y, Z ) }.
% 1.26/1.64 (11007) {G0,W5,D3,L1,V2,M1} { member( unordered_pair( X, Y ),
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 (11008) {G0,W6,D3,L1,V1,M1} { singleton( X ) = unordered_pair( X, X ) }.
% 1.26/1.64 (11009) {G0,W11,D5,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 1.26/1.64 singleton( X ), unordered_pair( X, singleton( Y ) ) ) }.
% 1.26/1.64 (11010) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( X, Y ),
% 1.26/1.64 cross_product( Z, T ) ), member( X, Z ) }.
% 1.26/1.64 (11011) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( X, Y ),
% 1.26/1.64 cross_product( Z, T ) ), member( Y, T ) }.
% 1.26/1.64 (11012) {G0,W13,D3,L3,V4,M3} { ! member( X, Z ), ! member( Y, T ), member
% 1.26/1.64 ( ordered_pair( X, Y ), cross_product( Z, T ) ) }.
% 1.26/1.64 (11013) {G0,W12,D4,L3,V2,M3} { ! member( X, universal_class ), ! member( Y
% 1.26/1.64 , universal_class ), first( ordered_pair( X, Y ) ) = X }.
% 1.26/1.64 (11014) {G0,W12,D4,L3,V2,M3} { ! member( X, universal_class ), ! member( Y
% 1.26/1.64 , universal_class ), second( ordered_pair( X, Y ) ) = Y }.
% 1.26/1.64 (11015) {G0,W12,D4,L2,V3,M2} { ! member( X, cross_product( Y, Z ) ), X =
% 1.26/1.64 ordered_pair( first( X ), second( X ) ) }.
% 1.26/1.64 (11016) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 1.26/1.64 element_relation ), member( Y, universal_class ) }.
% 1.26/1.64 (11017) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 1.26/1.64 element_relation ), member( X, Y ) }.
% 1.26/1.64 (11018) {G0,W11,D3,L3,V2,M3} { ! member( Y, universal_class ), ! member( X
% 1.26/1.64 , Y ), member( ordered_pair( X, Y ), element_relation ) }.
% 1.26/1.64 (11019) {G0,W5,D3,L1,V0,M1} { subclass( element_relation, cross_product(
% 1.26/1.64 universal_class, universal_class ) ) }.
% 1.26/1.64 (11020) {G0,W8,D3,L2,V3,M2} { ! member( Z, intersection( X, Y ) ), member
% 1.26/1.64 ( Z, X ) }.
% 1.26/1.64 (11021) {G0,W8,D3,L2,V3,M2} { ! member( Z, intersection( X, Y ) ), member
% 1.26/1.64 ( Z, Y ) }.
% 1.26/1.64 (11022) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ), member
% 1.26/1.64 ( Z, intersection( X, Y ) ) }.
% 1.26/1.64 (11023) {G0,W7,D3,L2,V2,M2} { ! member( Y, complement( X ) ), member( Y,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 (11024) {G0,W7,D3,L2,V2,M2} { ! member( Y, complement( X ) ), ! member( Y
% 1.26/1.64 , X ) }.
% 1.26/1.64 (11025) {G0,W10,D3,L3,V2,M3} { ! member( Y, universal_class ), member( Y,
% 1.26/1.64 X ), member( Y, complement( X ) ) }.
% 1.26/1.64 (11026) {G0,W10,D4,L1,V3,M1} { restrict( Y, X, Z ) = intersection( Y,
% 1.26/1.64 cross_product( X, Z ) ) }.
% 1.26/1.64 (11027) {G0,W3,D2,L1,V1,M1} { ! member( X, null_class ) }.
% 1.26/1.64 (11028) {G0,W7,D3,L2,V2,M2} { ! member( Y, domain_of( X ) ), member( Y,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 (11029) {G0,W11,D4,L2,V2,M2} { ! member( Y, domain_of( X ) ), ! restrict(
% 1.26/1.64 X, singleton( Y ), universal_class ) = null_class }.
% 1.26/1.64 (11030) {G0,W14,D4,L3,V2,M3} { ! member( Y, universal_class ), restrict( X
% 1.26/1.64 , singleton( Y ), universal_class ) = null_class, member( Y, domain_of( X
% 1.26/1.64 ) ) }.
% 1.26/1.64 (11031) {G0,W19,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( Y, Z
% 1.26/1.64 ), T ), rotate( X ) ), member( ordered_pair( ordered_pair( Y, Z ), T ),
% 1.26/1.64 cross_product( cross_product( universal_class, universal_class ),
% 1.26/1.64 universal_class ) ) }.
% 1.26/1.64 (11032) {G0,W15,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( Y, Z
% 1.26/1.64 ), T ), rotate( X ) ), member( ordered_pair( ordered_pair( Z, T ), Y ),
% 1.26/1.64 X ) }.
% 1.26/1.64 (11033) {G0,W26,D4,L3,V4,M3} { ! member( ordered_pair( ordered_pair( Y, Z
% 1.26/1.64 ), T ), cross_product( cross_product( universal_class, universal_class )
% 1.26/1.64 , universal_class ) ), ! member( ordered_pair( ordered_pair( Z, T ), Y )
% 1.26/1.64 , X ), member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ) }.
% 1.26/1.64 (11034) {G0,W8,D4,L1,V1,M1} { subclass( rotate( X ), cross_product(
% 1.26/1.64 cross_product( universal_class, universal_class ), universal_class ) )
% 1.26/1.64 }.
% 1.26/1.64 (11035) {G0,W19,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( X, Y
% 1.26/1.64 ), Z ), flip( T ) ), member( ordered_pair( ordered_pair( X, Y ), Z ),
% 1.26/1.64 cross_product( cross_product( universal_class, universal_class ),
% 1.26/1.64 universal_class ) ) }.
% 1.26/1.64 (11036) {G0,W15,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( X, Y
% 1.26/1.64 ), Z ), flip( T ) ), member( ordered_pair( ordered_pair( Y, X ), Z ), T
% 1.26/1.64 ) }.
% 1.26/1.64 (11037) {G0,W26,D4,L3,V4,M3} { ! member( ordered_pair( ordered_pair( X, Y
% 1.26/1.64 ), Z ), cross_product( cross_product( universal_class, universal_class )
% 1.26/1.64 , universal_class ) ), ! member( ordered_pair( ordered_pair( Y, X ), Z )
% 1.26/1.64 , T ), member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ) }.
% 1.26/1.64 (11038) {G0,W8,D4,L1,V1,M1} { subclass( flip( X ), cross_product(
% 1.26/1.64 cross_product( universal_class, universal_class ), universal_class ) )
% 1.26/1.64 }.
% 1.26/1.64 (11039) {G0,W11,D3,L3,V3,M3} { ! member( Z, union( X, Y ) ), member( Z, X
% 1.26/1.64 ), member( Z, Y ) }.
% 1.26/1.64 (11040) {G0,W8,D3,L2,V3,M2} { ! member( Z, X ), member( Z, union( X, Y ) )
% 1.26/1.64 }.
% 1.26/1.64 (11041) {G0,W8,D3,L2,V3,M2} { ! member( Z, Y ), member( Z, union( X, Y ) )
% 1.26/1.64 }.
% 1.26/1.64 (11042) {G0,W7,D4,L1,V1,M1} { successor( X ) = union( X, singleton( X ) )
% 1.26/1.64 }.
% 1.26/1.64 (11043) {G0,W5,D3,L1,V0,M1} { subclass( successor_relation, cross_product
% 1.26/1.64 ( universal_class, universal_class ) ) }.
% 1.26/1.64 (11044) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 1.26/1.64 successor_relation ), member( X, universal_class ) }.
% 1.26/1.64 (11045) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 1.26/1.64 successor_relation ), alpha2( X, Y ) }.
% 1.26/1.64 (11046) {G0,W11,D3,L3,V2,M3} { ! member( X, universal_class ), ! alpha2( X
% 1.26/1.64 , Y ), member( ordered_pair( X, Y ), successor_relation ) }.
% 1.26/1.64 (11047) {G0,W6,D2,L2,V2,M2} { ! alpha2( X, Y ), member( Y, universal_class
% 1.26/1.64 ) }.
% 1.26/1.64 (11048) {G0,W7,D3,L2,V2,M2} { ! alpha2( X, Y ), successor( X ) = Y }.
% 1.26/1.64 (11049) {G0,W10,D3,L3,V2,M3} { ! member( Y, universal_class ), ! successor
% 1.26/1.64 ( X ) = Y, alpha2( X, Y ) }.
% 1.26/1.64 (11050) {G0,W8,D5,L1,V1,M1} { inverse( X ) = domain_of( flip(
% 1.26/1.64 cross_product( X, universal_class ) ) ) }.
% 1.26/1.64 (11051) {G0,W6,D4,L1,V1,M1} { range_of( X ) = domain_of( inverse( X ) )
% 1.26/1.64 }.
% 1.26/1.64 (11052) {G0,W9,D4,L1,V2,M1} { image( Y, X ) = range_of( restrict( Y, X,
% 1.26/1.64 universal_class ) ) }.
% 1.26/1.64 (11053) {G0,W5,D2,L2,V1,M2} { ! inductive( X ), member( null_class, X )
% 1.26/1.64 }.
% 1.26/1.64 (11054) {G0,W7,D3,L2,V1,M2} { ! inductive( X ), subclass( image(
% 1.26/1.64 successor_relation, X ), X ) }.
% 1.26/1.64 (11055) {G0,W10,D3,L3,V1,M3} { ! member( null_class, X ), ! subclass(
% 1.26/1.64 image( successor_relation, X ), X ), inductive( X ) }.
% 1.26/1.64 (11056) {G0,W3,D2,L1,V0,M1} { member( skol2, universal_class ) }.
% 1.26/1.64 (11057) {G0,W2,D2,L1,V0,M1} { inductive( skol2 ) }.
% 1.26/1.64 (11058) {G0,W5,D2,L2,V1,M2} { ! inductive( X ), subclass( skol2, X ) }.
% 1.26/1.64 (11059) {G0,W9,D3,L2,V3,M2} { ! member( X, sum_class( Y ) ), member( skol3
% 1.26/1.64 ( Z, Y ), Y ) }.
% 1.26/1.64 (11060) {G0,W9,D3,L2,V2,M2} { ! member( X, sum_class( Y ) ), member( X,
% 1.26/1.64 skol3( X, Y ) ) }.
% 1.26/1.64 (11061) {G0,W10,D3,L3,V3,M3} { ! member( X, Z ), ! member( Z, Y ), member
% 1.26/1.64 ( X, sum_class( Y ) ) }.
% 1.26/1.64 (11062) {G0,W7,D3,L2,V1,M2} { ! member( X, universal_class ), member(
% 1.26/1.64 sum_class( X ), universal_class ) }.
% 1.26/1.64 (11063) {G0,W7,D3,L2,V2,M2} { ! member( X, power_class( Y ) ), member( X,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 (11064) {G0,W7,D3,L2,V2,M2} { ! member( X, power_class( Y ) ), subclass( X
% 1.26/1.64 , Y ) }.
% 1.26/1.64 (11065) {G0,W10,D3,L3,V2,M3} { ! member( X, universal_class ), ! subclass
% 1.26/1.64 ( X, Y ), member( X, power_class( Y ) ) }.
% 1.26/1.64 (11066) {G0,W7,D3,L2,V1,M2} { ! member( X, universal_class ), member(
% 1.26/1.64 power_class( X ), universal_class ) }.
% 1.26/1.64 (11067) {G0,W7,D3,L1,V2,M1} { subclass( compose( Y, X ), cross_product(
% 1.26/1.64 universal_class, universal_class ) ) }.
% 1.26/1.64 (11068) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( Z, T ), compose( Y
% 1.26/1.64 , X ) ), member( Z, universal_class ) }.
% 1.26/1.64 (11069) {G0,W15,D5,L2,V4,M2} { ! member( ordered_pair( Z, T ), compose( Y
% 1.26/1.64 , X ) ), member( T, image( Y, image( X, singleton( Z ) ) ) ) }.
% 1.26/1.64 (11070) {G0,W18,D5,L3,V4,M3} { ! member( Z, universal_class ), ! member( T
% 1.26/1.64 , image( Y, image( X, singleton( Z ) ) ) ), member( ordered_pair( Z, T )
% 1.26/1.64 , compose( Y, X ) ) }.
% 1.26/1.64 (11071) {G0,W7,D3,L2,V2,M2} { ! member( X, identity_relation ), member(
% 1.26/1.64 skol4( Y ), universal_class ) }.
% 1.26/1.64 (11072) {G0,W10,D4,L2,V1,M2} { ! member( X, identity_relation ), X =
% 1.26/1.64 ordered_pair( skol4( X ), skol4( X ) ) }.
% 1.26/1.64 (11073) {G0,W11,D3,L3,V2,M3} { ! member( Y, universal_class ), ! X =
% 1.26/1.64 ordered_pair( Y, Y ), member( X, identity_relation ) }.
% 1.26/1.64 (11074) {G0,W7,D3,L2,V1,M2} { ! function( X ), subclass( X, cross_product
% 1.26/1.64 ( universal_class, universal_class ) ) }.
% 1.26/1.64 (11075) {G0,W8,D4,L2,V1,M2} { ! function( X ), subclass( compose( X,
% 1.26/1.64 inverse( X ) ), identity_relation ) }.
% 1.26/1.64 (11076) {G0,W13,D4,L3,V1,M3} { ! subclass( X, cross_product(
% 1.26/1.64 universal_class, universal_class ) ), ! subclass( compose( X, inverse( X
% 1.26/1.64 ) ), identity_relation ), function( X ) }.
% 1.26/1.64 (11077) {G0,W10,D3,L3,V2,M3} { ! member( X, universal_class ), ! function
% 1.26/1.64 ( Y ), member( image( Y, X ), universal_class ) }.
% 1.26/1.64 (11078) {G0,W9,D2,L3,V3,M3} { ! disjoint( X, Y ), ! member( Z, X ), !
% 1.26/1.64 member( Z, Y ) }.
% 1.26/1.64 (11079) {G0,W8,D3,L2,V3,M2} { member( skol5( Z, Y ), Y ), disjoint( X, Y )
% 1.26/1.64 }.
% 1.26/1.64 (11080) {G0,W8,D3,L2,V2,M2} { member( skol5( X, Y ), X ), disjoint( X, Y )
% 1.26/1.64 }.
% 1.26/1.64 (11081) {G0,W7,D3,L2,V2,M2} { X = null_class, member( skol6( Y ),
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 (11082) {G0,W7,D3,L2,V1,M2} { X = null_class, member( skol6( X ), X ) }.
% 1.26/1.64 (11083) {G0,W7,D3,L2,V1,M2} { X = null_class, disjoint( skol6( X ), X )
% 1.26/1.64 }.
% 1.26/1.64 (11084) {G0,W9,D5,L1,V2,M1} { apply( X, Y ) = sum_class( image( X,
% 1.26/1.64 singleton( Y ) ) ) }.
% 1.26/1.64 (11085) {G0,W2,D2,L1,V0,M1} { function( skol7 ) }.
% 1.26/1.64 (11086) {G0,W11,D3,L3,V1,M3} { ! member( X, universal_class ), X =
% 1.26/1.64 null_class, member( apply( skol7, X ), X ) }.
% 1.26/1.64 (11087) {G0,W11,D3,L3,V2,M3} { ! member( X, universal_class ), ! member( Y
% 1.26/1.64 , universal_class ), ! skol8 = ordered_pair( X, Y ) }.
% 1.26/1.64 (11088) {G0,W9,D2,L3,V2,M3} { member( skol9, universal_class ), ! X =
% 1.26/1.64 skol8, ! Y = skol8 }.
% 1.26/1.64 (11089) {G0,W9,D2,L3,V2,M3} { member( skol10, universal_class ), ! X =
% 1.26/1.64 skol8, ! Y = skol8 }.
% 1.26/1.64 (11090) {G0,W11,D3,L3,V2,M3} { skol8 = ordered_pair( skol9, skol10 ), ! X
% 1.26/1.64 = skol8, ! Y = skol8 }.
% 1.26/1.64
% 1.26/1.64
% 1.26/1.64 Total Proof:
% 1.26/1.64
% 1.26/1.64 eqswap: (11134) {G0,W11,D3,L3,V2,M3} { ! ordered_pair( X, Y ) = skol8, !
% 1.26/1.64 member( X, universal_class ), ! member( Y, universal_class ) }.
% 1.26/1.64 parent0[2]: (11087) {G0,W11,D3,L3,V2,M3} { ! member( X, universal_class )
% 1.26/1.64 , ! member( Y, universal_class ), ! skol8 = ordered_pair( X, Y ) }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := Y
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (92) {G0,W11,D3,L3,V2,M3} I { ! member( X, universal_class ),
% 1.26/1.64 ! member( Y, universal_class ), ! ordered_pair( X, Y ) ==> skol8 }.
% 1.26/1.64 parent0: (11134) {G0,W11,D3,L3,V2,M3} { ! ordered_pair( X, Y ) = skol8, !
% 1.26/1.64 member( X, universal_class ), ! member( Y, universal_class ) }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := Y
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 2
% 1.26/1.64 1 ==> 0
% 1.26/1.64 2 ==> 1
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (93) {G0,W9,D2,L3,V2,M3} I { member( skol9, universal_class )
% 1.26/1.64 , ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 parent0: (11088) {G0,W9,D2,L3,V2,M3} { member( skol9, universal_class ), !
% 1.26/1.64 X = skol8, ! Y = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := X
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 1 ==> 1
% 1.26/1.64 2 ==> 1
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (94) {G0,W9,D2,L3,V2,M3} I { member( skol10, universal_class )
% 1.26/1.64 , ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 parent0: (11089) {G0,W9,D2,L3,V2,M3} { member( skol10, universal_class ),
% 1.26/1.64 ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := X
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 1 ==> 1
% 1.26/1.64 2 ==> 1
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqswap: (11280) {G0,W11,D3,L3,V2,M3} { ordered_pair( skol9, skol10 ) =
% 1.26/1.64 skol8, ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 parent0[0]: (11090) {G0,W11,D3,L3,V2,M3} { skol8 = ordered_pair( skol9,
% 1.26/1.64 skol10 ), ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := Y
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (95) {G0,W11,D3,L3,V2,M3} I { ordered_pair( skol9, skol10 )
% 1.26/1.64 ==> skol8, ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 parent0: (11280) {G0,W11,D3,L3,V2,M3} { ordered_pair( skol9, skol10 ) =
% 1.26/1.64 skol8, ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := X
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 1 ==> 1
% 1.26/1.64 2 ==> 1
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 factor: (11283) {G0,W6,D2,L2,V1,M2} { member( skol9, universal_class ), !
% 1.26/1.64 X = skol8 }.
% 1.26/1.64 parent0[1, 2]: (93) {G0,W9,D2,L3,V2,M3} I { member( skol9, universal_class
% 1.26/1.64 ), ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := X
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (115) {G1,W6,D2,L2,V1,M2} F(93) { member( skol9,
% 1.26/1.64 universal_class ), ! X = skol8 }.
% 1.26/1.64 parent0: (11283) {G0,W6,D2,L2,V1,M2} { member( skol9, universal_class ), !
% 1.26/1.64 X = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 1 ==> 1
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqswap: (11284) {G1,W6,D2,L2,V1,M2} { ! skol8 = X, member( skol9,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 parent0[1]: (115) {G1,W6,D2,L2,V1,M2} F(93) { member( skol9,
% 1.26/1.64 universal_class ), ! X = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqrefl: (11285) {G0,W3,D2,L1,V0,M1} { member( skol9, universal_class ) }.
% 1.26/1.64 parent0[0]: (11284) {G1,W6,D2,L2,V1,M2} { ! skol8 = X, member( skol9,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := skol8
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (116) {G2,W3,D2,L1,V0,M1} Q(115) { member( skol9,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 parent0: (11285) {G0,W3,D2,L1,V0,M1} { member( skol9, universal_class )
% 1.26/1.64 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 factor: (11286) {G0,W6,D2,L2,V1,M2} { member( skol10, universal_class ), !
% 1.26/1.64 X = skol8 }.
% 1.26/1.64 parent0[1, 2]: (94) {G0,W9,D2,L3,V2,M3} I { member( skol10, universal_class
% 1.26/1.64 ), ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := X
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (117) {G1,W6,D2,L2,V1,M2} F(94) { member( skol10,
% 1.26/1.64 universal_class ), ! X = skol8 }.
% 1.26/1.64 parent0: (11286) {G0,W6,D2,L2,V1,M2} { member( skol10, universal_class ),
% 1.26/1.64 ! X = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 1 ==> 1
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqswap: (11287) {G1,W6,D2,L2,V1,M2} { ! skol8 = X, member( skol10,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 parent0[1]: (117) {G1,W6,D2,L2,V1,M2} F(94) { member( skol10,
% 1.26/1.64 universal_class ), ! X = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqrefl: (11288) {G0,W3,D2,L1,V0,M1} { member( skol10, universal_class )
% 1.26/1.64 }.
% 1.26/1.64 parent0[0]: (11287) {G1,W6,D2,L2,V1,M2} { ! skol8 = X, member( skol10,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := skol8
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (118) {G2,W3,D2,L1,V0,M1} Q(117) { member( skol10,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 parent0: (11288) {G0,W3,D2,L1,V0,M1} { member( skol10, universal_class )
% 1.26/1.64 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 factor: (11290) {G0,W8,D3,L2,V1,M2} { ordered_pair( skol9, skol10 ) ==>
% 1.26/1.64 skol8, ! X = skol8 }.
% 1.26/1.64 parent0[1, 2]: (95) {G0,W11,D3,L3,V2,M3} I { ordered_pair( skol9, skol10 )
% 1.26/1.64 ==> skol8, ! X = skol8, ! Y = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := X
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (119) {G1,W8,D3,L2,V1,M2} F(95) { ordered_pair( skol9, skol10
% 1.26/1.64 ) ==> skol8, ! X = skol8 }.
% 1.26/1.64 parent0: (11290) {G0,W8,D3,L2,V1,M2} { ordered_pair( skol9, skol10 ) ==>
% 1.26/1.64 skol8, ! X = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 1 ==> 1
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqswap: (11292) {G1,W8,D3,L2,V1,M2} { skol8 ==> ordered_pair( skol9,
% 1.26/1.64 skol10 ), ! X = skol8 }.
% 1.26/1.64 parent0[0]: (119) {G1,W8,D3,L2,V1,M2} F(95) { ordered_pair( skol9, skol10 )
% 1.26/1.64 ==> skol8, ! X = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqrefl: (11295) {G0,W5,D3,L1,V0,M1} { skol8 ==> ordered_pair( skol9,
% 1.26/1.64 skol10 ) }.
% 1.26/1.64 parent0[1]: (11292) {G1,W8,D3,L2,V1,M2} { skol8 ==> ordered_pair( skol9,
% 1.26/1.64 skol10 ), ! X = skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := skol8
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqswap: (11296) {G0,W5,D3,L1,V0,M1} { ordered_pair( skol9, skol10 ) ==>
% 1.26/1.64 skol8 }.
% 1.26/1.64 parent0[0]: (11295) {G0,W5,D3,L1,V0,M1} { skol8 ==> ordered_pair( skol9,
% 1.26/1.64 skol10 ) }.
% 1.26/1.64 substitution0:
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (120) {G2,W5,D3,L1,V0,M1} Q(119) { ordered_pair( skol9, skol10
% 1.26/1.64 ) ==> skol8 }.
% 1.26/1.64 parent0: (11296) {G0,W5,D3,L1,V0,M1} { ordered_pair( skol9, skol10 ) ==>
% 1.26/1.64 skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqswap: (11297) {G0,W11,D3,L3,V2,M3} { ! skol8 ==> ordered_pair( X, Y ), !
% 1.26/1.64 member( X, universal_class ), ! member( Y, universal_class ) }.
% 1.26/1.64 parent0[2]: (92) {G0,W11,D3,L3,V2,M3} I { ! member( X, universal_class ), !
% 1.26/1.64 member( Y, universal_class ), ! ordered_pair( X, Y ) ==> skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := X
% 1.26/1.64 Y := Y
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 eqswap: (11298) {G2,W5,D3,L1,V0,M1} { skol8 ==> ordered_pair( skol9,
% 1.26/1.64 skol10 ) }.
% 1.26/1.64 parent0[0]: (120) {G2,W5,D3,L1,V0,M1} Q(119) { ordered_pair( skol9, skol10
% 1.26/1.64 ) ==> skol8 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 resolution: (11299) {G1,W6,D2,L2,V0,M2} { ! member( skol9, universal_class
% 1.26/1.64 ), ! member( skol10, universal_class ) }.
% 1.26/1.64 parent0[0]: (11297) {G0,W11,D3,L3,V2,M3} { ! skol8 ==> ordered_pair( X, Y
% 1.26/1.64 ), ! member( X, universal_class ), ! member( Y, universal_class ) }.
% 1.26/1.64 parent1[0]: (11298) {G2,W5,D3,L1,V0,M1} { skol8 ==> ordered_pair( skol9,
% 1.26/1.64 skol10 ) }.
% 1.26/1.64 substitution0:
% 1.26/1.64 X := skol9
% 1.26/1.64 Y := skol10
% 1.26/1.64 end
% 1.26/1.64 substitution1:
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 resolution: (11300) {G2,W3,D2,L1,V0,M1} { ! member( skol10,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 parent0[0]: (11299) {G1,W6,D2,L2,V0,M2} { ! member( skol9, universal_class
% 1.26/1.64 ), ! member( skol10, universal_class ) }.
% 1.26/1.64 parent1[0]: (116) {G2,W3,D2,L1,V0,M1} Q(115) { member( skol9,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 substitution0:
% 1.26/1.64 end
% 1.26/1.64 substitution1:
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (10898) {G3,W3,D2,L1,V0,M1} R(92,120);r(116) { ! member(
% 1.26/1.64 skol10, universal_class ) }.
% 1.26/1.64 parent0: (11300) {G2,W3,D2,L1,V0,M1} { ! member( skol10, universal_class )
% 1.26/1.64 }.
% 1.26/1.64 substitution0:
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 0 ==> 0
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 resolution: (11301) {G3,W0,D0,L0,V0,M0} { }.
% 1.26/1.64 parent0[0]: (10898) {G3,W3,D2,L1,V0,M1} R(92,120);r(116) { ! member( skol10
% 1.26/1.64 , universal_class ) }.
% 1.26/1.64 parent1[0]: (118) {G2,W3,D2,L1,V0,M1} Q(117) { member( skol10,
% 1.26/1.64 universal_class ) }.
% 1.26/1.64 substitution0:
% 1.26/1.64 end
% 1.26/1.64 substitution1:
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 subsumption: (10992) {G4,W0,D0,L0,V0,M0} S(10898);r(118) { }.
% 1.26/1.64 parent0: (11301) {G3,W0,D0,L0,V0,M0} { }.
% 1.26/1.64 substitution0:
% 1.26/1.64 end
% 1.26/1.64 permutation0:
% 1.26/1.64 end
% 1.26/1.64
% 1.26/1.64 Proof check complete!
% 1.26/1.64
% 1.26/1.64 Memory use:
% 1.26/1.64
% 1.26/1.64 space for terms: 147030
% 1.26/1.64 space for clauses: 526401
% 1.26/1.64
% 1.26/1.64
% 1.26/1.64 clauses generated: 25587
% 1.26/1.64 clauses kept: 10993
% 1.26/1.64 clauses selected: 368
% 1.26/1.64 clauses deleted: 82
% 1.26/1.64 clauses inuse deleted: 35
% 1.26/1.64
% 1.26/1.64 subsentry: 57729
% 1.26/1.64 literals s-matched: 41761
% 1.26/1.64 literals matched: 41572
% 1.26/1.64 full subsumption: 15846
% 1.26/1.64
% 1.26/1.64 checksum: 599825828
% 1.26/1.64
% 1.26/1.64
% 1.26/1.64 Bliksem ended
%------------------------------------------------------------------------------