TSTP Solution File: SET081+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET081+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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:43 EDT 2022
% Result : Theorem 1.61s 2.01s
% Output : Refutation 1.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET081+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Mon Jul 11 05:57:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.10 *** allocated 10000 integers for termspace/termends
% 0.71/1.10 *** allocated 10000 integers for clauses
% 0.71/1.10 *** allocated 10000 integers for justifications
% 0.71/1.10 Bliksem 1.12
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Automatic Strategy Selection
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Clauses:
% 0.71/1.10
% 0.71/1.10 { ! subclass( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.71/1.10 { ! member( skol1( Z, Y ), Y ), subclass( X, Y ) }.
% 0.71/1.10 { member( skol1( X, Y ), X ), subclass( X, Y ) }.
% 0.71/1.10 { subclass( X, universal_class ) }.
% 0.71/1.10 { ! X = Y, subclass( X, Y ) }.
% 0.71/1.10 { ! X = Y, subclass( Y, X ) }.
% 0.71/1.10 { ! subclass( X, Y ), ! subclass( Y, X ), X = Y }.
% 0.71/1.10 { ! member( X, unordered_pair( Y, Z ) ), member( X, universal_class ) }.
% 0.71/1.10 { ! member( X, unordered_pair( Y, Z ) ), alpha1( X, Y, Z ) }.
% 0.71/1.10 { ! member( X, universal_class ), ! alpha1( X, Y, Z ), member( X,
% 0.71/1.10 unordered_pair( Y, Z ) ) }.
% 0.71/1.10 { ! alpha1( X, Y, Z ), X = Y, X = Z }.
% 0.71/1.10 { ! X = Y, alpha1( X, Y, Z ) }.
% 0.71/1.10 { ! X = Z, alpha1( X, Y, Z ) }.
% 0.71/1.10 { member( unordered_pair( X, Y ), universal_class ) }.
% 0.71/1.10 { singleton( X ) = unordered_pair( X, X ) }.
% 0.71/1.10 { ordered_pair( X, Y ) = unordered_pair( singleton( X ), unordered_pair( X
% 0.71/1.10 , singleton( Y ) ) ) }.
% 0.71/1.10 { ! member( ordered_pair( X, Y ), cross_product( Z, T ) ), member( X, Z ) }
% 0.71/1.10 .
% 0.71/1.10 { ! member( ordered_pair( X, Y ), cross_product( Z, T ) ), member( Y, T ) }
% 0.71/1.10 .
% 0.71/1.10 { ! member( X, Z ), ! member( Y, T ), member( ordered_pair( X, Y ),
% 0.71/1.10 cross_product( Z, T ) ) }.
% 0.71/1.10 { ! member( X, universal_class ), ! member( Y, universal_class ), first(
% 0.71/1.10 ordered_pair( X, Y ) ) = X }.
% 0.71/1.10 { ! member( X, universal_class ), ! member( Y, universal_class ), second(
% 0.71/1.10 ordered_pair( X, Y ) ) = Y }.
% 0.71/1.10 { ! member( X, cross_product( Y, Z ) ), X = ordered_pair( first( X ),
% 0.71/1.10 second( X ) ) }.
% 0.71/1.10 { ! member( ordered_pair( X, Y ), element_relation ), member( Y,
% 0.71/1.10 universal_class ) }.
% 0.71/1.10 { ! member( ordered_pair( X, Y ), element_relation ), member( X, Y ) }.
% 0.71/1.10 { ! member( Y, universal_class ), ! member( X, Y ), member( ordered_pair( X
% 0.71/1.10 , Y ), element_relation ) }.
% 0.71/1.10 { subclass( element_relation, cross_product( universal_class,
% 0.71/1.10 universal_class ) ) }.
% 0.71/1.10 { ! member( Z, intersection( X, Y ) ), member( Z, X ) }.
% 0.71/1.10 { ! member( Z, intersection( X, Y ) ), member( Z, Y ) }.
% 0.71/1.10 { ! member( Z, X ), ! member( Z, Y ), member( Z, intersection( X, Y ) ) }.
% 0.71/1.10 { ! member( Y, complement( X ) ), member( Y, universal_class ) }.
% 0.71/1.10 { ! member( Y, complement( X ) ), ! member( Y, X ) }.
% 0.71/1.10 { ! member( Y, universal_class ), member( Y, X ), member( Y, complement( X
% 0.71/1.10 ) ) }.
% 0.71/1.10 { restrict( Y, X, Z ) = intersection( Y, cross_product( X, Z ) ) }.
% 0.71/1.10 { ! member( X, null_class ) }.
% 0.71/1.10 { ! member( Y, domain_of( X ) ), member( Y, universal_class ) }.
% 0.71/1.10 { ! member( Y, domain_of( X ) ), ! restrict( X, singleton( Y ),
% 0.71/1.10 universal_class ) = null_class }.
% 0.71/1.10 { ! member( Y, universal_class ), restrict( X, singleton( Y ),
% 0.71/1.10 universal_class ) = null_class, member( Y, domain_of( X ) ) }.
% 0.71/1.10 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ), member
% 0.71/1.10 ( ordered_pair( ordered_pair( Y, Z ), T ), cross_product( cross_product(
% 0.71/1.10 universal_class, universal_class ), universal_class ) ) }.
% 0.71/1.10 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ), member
% 0.71/1.10 ( ordered_pair( ordered_pair( Z, T ), Y ), X ) }.
% 0.71/1.10 { ! member( ordered_pair( ordered_pair( Y, Z ), T ), cross_product(
% 0.71/1.10 cross_product( universal_class, universal_class ), universal_class ) ), !
% 0.71/1.10 member( ordered_pair( ordered_pair( Z, T ), Y ), X ), member(
% 0.71/1.10 ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ) }.
% 0.71/1.10 { subclass( rotate( X ), cross_product( cross_product( universal_class,
% 0.71/1.10 universal_class ), universal_class ) ) }.
% 0.71/1.10 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ), member(
% 0.71/1.10 ordered_pair( ordered_pair( X, Y ), Z ), cross_product( cross_product(
% 0.71/1.10 universal_class, universal_class ), universal_class ) ) }.
% 0.71/1.10 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ), member(
% 0.71/1.10 ordered_pair( ordered_pair( Y, X ), Z ), T ) }.
% 0.71/1.10 { ! member( ordered_pair( ordered_pair( X, Y ), Z ), cross_product(
% 0.71/1.10 cross_product( universal_class, universal_class ), universal_class ) ), !
% 0.71/1.10 member( ordered_pair( ordered_pair( Y, X ), Z ), T ), member(
% 0.71/1.10 ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ) }.
% 0.71/1.10 { subclass( flip( X ), cross_product( cross_product( universal_class,
% 0.74/1.33 universal_class ), universal_class ) ) }.
% 0.74/1.33 { ! member( Z, union( X, Y ) ), member( Z, X ), member( Z, Y ) }.
% 0.74/1.33 { ! member( Z, X ), member( Z, union( X, Y ) ) }.
% 0.74/1.33 { ! member( Z, Y ), member( Z, union( X, Y ) ) }.
% 0.74/1.33 { successor( X ) = union( X, singleton( X ) ) }.
% 0.74/1.33 { subclass( successor_relation, cross_product( universal_class,
% 0.74/1.33 universal_class ) ) }.
% 0.74/1.33 { ! member( ordered_pair( X, Y ), successor_relation ), member( X,
% 0.74/1.33 universal_class ) }.
% 0.74/1.33 { ! member( ordered_pair( X, Y ), successor_relation ), alpha2( X, Y ) }.
% 0.74/1.33 { ! member( X, universal_class ), ! alpha2( X, Y ), member( ordered_pair( X
% 0.74/1.33 , Y ), successor_relation ) }.
% 0.74/1.33 { ! alpha2( X, Y ), member( Y, universal_class ) }.
% 0.74/1.33 { ! alpha2( X, Y ), successor( X ) = Y }.
% 0.74/1.33 { ! member( Y, universal_class ), ! successor( X ) = Y, alpha2( X, Y ) }.
% 0.74/1.33 { inverse( X ) = domain_of( flip( cross_product( X, universal_class ) ) ) }
% 0.74/1.33 .
% 0.74/1.33 { range_of( X ) = domain_of( inverse( X ) ) }.
% 0.74/1.33 { image( Y, X ) = range_of( restrict( Y, X, universal_class ) ) }.
% 0.74/1.33 { ! inductive( X ), member( null_class, X ) }.
% 0.74/1.33 { ! inductive( X ), subclass( image( successor_relation, X ), X ) }.
% 0.74/1.33 { ! member( null_class, X ), ! subclass( image( successor_relation, X ), X
% 0.74/1.33 ), inductive( X ) }.
% 0.74/1.33 { member( skol2, universal_class ) }.
% 0.74/1.33 { inductive( skol2 ) }.
% 0.74/1.33 { ! inductive( X ), subclass( skol2, X ) }.
% 0.74/1.33 { ! member( X, sum_class( Y ) ), member( skol3( Z, Y ), Y ) }.
% 0.74/1.33 { ! member( X, sum_class( Y ) ), member( X, skol3( X, Y ) ) }.
% 0.74/1.33 { ! member( X, Z ), ! member( Z, Y ), member( X, sum_class( Y ) ) }.
% 0.74/1.33 { ! member( X, universal_class ), member( sum_class( X ), universal_class )
% 0.74/1.33 }.
% 0.74/1.33 { ! member( X, power_class( Y ) ), member( X, universal_class ) }.
% 0.74/1.33 { ! member( X, power_class( Y ) ), subclass( X, Y ) }.
% 0.74/1.33 { ! member( X, universal_class ), ! subclass( X, Y ), member( X,
% 0.74/1.33 power_class( Y ) ) }.
% 0.74/1.33 { ! member( X, universal_class ), member( power_class( X ), universal_class
% 0.74/1.33 ) }.
% 0.74/1.33 { subclass( compose( Y, X ), cross_product( universal_class,
% 0.74/1.33 universal_class ) ) }.
% 0.74/1.33 { ! member( ordered_pair( Z, T ), compose( Y, X ) ), member( Z,
% 0.74/1.33 universal_class ) }.
% 0.74/1.33 { ! member( ordered_pair( Z, T ), compose( Y, X ) ), member( T, image( Y,
% 0.74/1.33 image( X, singleton( Z ) ) ) ) }.
% 0.74/1.33 { ! member( Z, universal_class ), ! member( T, image( Y, image( X,
% 0.74/1.33 singleton( Z ) ) ) ), member( ordered_pair( Z, T ), compose( Y, X ) ) }.
% 0.74/1.33 { ! member( X, identity_relation ), member( skol4( Y ), universal_class ) }
% 0.74/1.33 .
% 0.74/1.33 { ! member( X, identity_relation ), X = ordered_pair( skol4( X ), skol4( X
% 0.74/1.33 ) ) }.
% 0.74/1.33 { ! member( Y, universal_class ), ! X = ordered_pair( Y, Y ), member( X,
% 0.74/1.33 identity_relation ) }.
% 0.74/1.33 { ! function( X ), subclass( X, cross_product( universal_class,
% 0.74/1.33 universal_class ) ) }.
% 0.74/1.33 { ! function( X ), subclass( compose( X, inverse( X ) ), identity_relation
% 0.74/1.33 ) }.
% 0.74/1.33 { ! subclass( X, cross_product( universal_class, universal_class ) ), !
% 0.74/1.33 subclass( compose( X, inverse( X ) ), identity_relation ), function( X )
% 0.74/1.33 }.
% 0.74/1.33 { ! member( X, universal_class ), ! function( Y ), member( image( Y, X ),
% 0.74/1.33 universal_class ) }.
% 0.74/1.33 { ! disjoint( X, Y ), ! member( Z, X ), ! member( Z, Y ) }.
% 0.74/1.33 { member( skol5( Z, Y ), Y ), disjoint( X, Y ) }.
% 0.74/1.33 { member( skol5( X, Y ), X ), disjoint( X, Y ) }.
% 0.74/1.33 { X = null_class, member( skol6( Y ), universal_class ) }.
% 0.74/1.33 { X = null_class, member( skol6( X ), X ) }.
% 0.74/1.33 { X = null_class, disjoint( skol6( X ), X ) }.
% 0.74/1.33 { apply( X, Y ) = sum_class( image( X, singleton( Y ) ) ) }.
% 0.74/1.33 { function( skol7 ) }.
% 0.74/1.33 { ! member( X, universal_class ), X = null_class, member( apply( skol7, X )
% 0.74/1.33 , X ) }.
% 0.74/1.33 { member( skol9, singleton( skol8 ) ) }.
% 0.74/1.33 { ! skol9 = skol8 }.
% 0.74/1.33
% 0.74/1.33 percentage equality = 0.149485, percentage horn = 0.884211
% 0.74/1.33 This is a problem with some equality
% 0.74/1.33
% 0.74/1.33
% 0.74/1.33
% 0.74/1.33 Options Used:
% 0.74/1.33
% 0.74/1.33 useres = 1
% 0.74/1.33 useparamod = 1
% 0.74/1.33 useeqrefl = 1
% 0.74/1.33 useeqfact = 1
% 0.74/1.33 usefactor = 1
% 0.74/1.33 usesimpsplitting = 0
% 0.74/1.33 usesimpdemod = 5
% 0.74/1.33 usesimpres = 3
% 0.74/1.33
% 0.74/1.33 resimpinuse = 1000
% 0.74/1.33 resimpclauses = 20000
% 0.74/1.33 substype = eqrewr
% 0.74/1.33 backwardsubs = 1
% 0.74/1.33 selectoldest = 5
% 0.74/1.33
% 0.74/1.33 litorderings [0] = split
% 0.74/1.33 litorderings [1] = extend the termordering, first sorting on arguments
% 1.61/2.01
% 1.61/2.01 termordering = kbo
% 1.61/2.01
% 1.61/2.01 litapriori = 0
% 1.61/2.01 termapriori = 1
% 1.61/2.01 litaposteriori = 0
% 1.61/2.01 termaposteriori = 0
% 1.61/2.01 demodaposteriori = 0
% 1.61/2.01 ordereqreflfact = 0
% 1.61/2.01
% 1.61/2.01 litselect = negord
% 1.61/2.01
% 1.61/2.01 maxweight = 15
% 1.61/2.01 maxdepth = 30000
% 1.61/2.01 maxlength = 115
% 1.61/2.01 maxnrvars = 195
% 1.61/2.01 excuselevel = 1
% 1.61/2.01 increasemaxweight = 1
% 1.61/2.01
% 1.61/2.01 maxselected = 10000000
% 1.61/2.01 maxnrclauses = 10000000
% 1.61/2.01
% 1.61/2.01 showgenerated = 0
% 1.61/2.01 showkept = 0
% 1.61/2.01 showselected = 0
% 1.61/2.01 showdeleted = 0
% 1.61/2.01 showresimp = 1
% 1.61/2.01 showstatus = 2000
% 1.61/2.01
% 1.61/2.01 prologoutput = 0
% 1.61/2.01 nrgoals = 5000000
% 1.61/2.01 totalproof = 1
% 1.61/2.01
% 1.61/2.01 Symbols occurring in the translation:
% 1.61/2.01
% 1.61/2.01 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.61/2.01 . [1, 2] (w:1, o:45, a:1, s:1, b:0),
% 1.61/2.01 ! [4, 1] (w:0, o:24, a:1, s:1, b:0),
% 1.61/2.01 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.61/2.01 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.61/2.01 subclass [37, 2] (w:1, o:69, a:1, s:1, b:0),
% 1.61/2.01 member [39, 2] (w:1, o:70, a:1, s:1, b:0),
% 1.61/2.01 universal_class [40, 0] (w:1, o:12, a:1, s:1, b:0),
% 1.61/2.01 unordered_pair [41, 2] (w:1, o:71, a:1, s:1, b:0),
% 1.61/2.01 singleton [42, 1] (w:1, o:31, a:1, s:1, b:0),
% 1.61/2.01 ordered_pair [43, 2] (w:1, o:72, a:1, s:1, b:0),
% 1.61/2.01 cross_product [45, 2] (w:1, o:73, a:1, s:1, b:0),
% 1.61/2.01 first [46, 1] (w:1, o:32, a:1, s:1, b:0),
% 1.61/2.01 second [47, 1] (w:1, o:33, a:1, s:1, b:0),
% 1.61/2.01 element_relation [49, 0] (w:1, o:16, a:1, s:1, b:0),
% 1.61/2.01 intersection [50, 2] (w:1, o:75, a:1, s:1, b:0),
% 1.61/2.01 complement [51, 1] (w:1, o:34, a:1, s:1, b:0),
% 1.61/2.01 restrict [53, 3] (w:1, o:84, a:1, s:1, b:0),
% 1.61/2.01 null_class [54, 0] (w:1, o:17, a:1, s:1, b:0),
% 1.61/2.01 domain_of [55, 1] (w:1, o:35, a:1, s:1, b:0),
% 1.61/2.01 rotate [57, 1] (w:1, o:29, a:1, s:1, b:0),
% 1.61/2.01 flip [58, 1] (w:1, o:36, a:1, s:1, b:0),
% 1.61/2.01 union [59, 2] (w:1, o:76, a:1, s:1, b:0),
% 1.61/2.01 successor [60, 1] (w:1, o:37, a:1, s:1, b:0),
% 1.61/2.01 successor_relation [61, 0] (w:1, o:18, a:1, s:1, b:0),
% 1.61/2.01 inverse [62, 1] (w:1, o:38, a:1, s:1, b:0),
% 1.61/2.01 range_of [63, 1] (w:1, o:30, a:1, s:1, b:0),
% 1.61/2.01 image [64, 2] (w:1, o:74, a:1, s:1, b:0),
% 1.61/2.01 inductive [65, 1] (w:1, o:39, a:1, s:1, b:0),
% 1.61/2.01 sum_class [66, 1] (w:1, o:40, a:1, s:1, b:0),
% 1.61/2.01 power_class [67, 1] (w:1, o:41, a:1, s:1, b:0),
% 1.61/2.01 compose [69, 2] (w:1, o:77, a:1, s:1, b:0),
% 1.61/2.01 identity_relation [70, 0] (w:1, o:19, a:1, s:1, b:0),
% 1.61/2.01 function [72, 1] (w:1, o:42, a:1, s:1, b:0),
% 1.61/2.01 disjoint [73, 2] (w:1, o:78, a:1, s:1, b:0),
% 1.61/2.01 apply [74, 2] (w:1, o:79, a:1, s:1, b:0),
% 1.61/2.01 alpha1 [75, 3] (w:1, o:85, a:1, s:1, b:1),
% 1.61/2.01 alpha2 [76, 2] (w:1, o:80, a:1, s:1, b:1),
% 1.61/2.01 skol1 [77, 2] (w:1, o:81, a:1, s:1, b:1),
% 1.61/2.01 skol2 [78, 0] (w:1, o:20, a:1, s:1, b:1),
% 1.61/2.01 skol3 [79, 2] (w:1, o:82, a:1, s:1, b:1),
% 1.61/2.01 skol4 [80, 1] (w:1, o:43, a:1, s:1, b:1),
% 1.61/2.01 skol5 [81, 2] (w:1, o:83, a:1, s:1, b:1),
% 1.61/2.01 skol6 [82, 1] (w:1, o:44, a:1, s:1, b:1),
% 1.61/2.01 skol7 [83, 0] (w:1, o:21, a:1, s:1, b:1),
% 1.61/2.01 skol8 [84, 0] (w:1, o:22, a:1, s:1, b:1),
% 1.61/2.01 skol9 [85, 0] (w:1, o:23, a:1, s:1, b:1).
% 1.61/2.01
% 1.61/2.01
% 1.61/2.01 Starting Search:
% 1.61/2.01
% 1.61/2.01 *** allocated 15000 integers for clauses
% 1.61/2.01 *** allocated 22500 integers for clauses
% 1.61/2.01 *** allocated 33750 integers for clauses
% 1.61/2.01 *** allocated 15000 integers for termspace/termends
% 1.61/2.01 *** allocated 50625 integers for clauses
% 1.61/2.01 *** allocated 22500 integers for termspace/termends
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 *** allocated 75937 integers for clauses
% 1.61/2.01 *** allocated 33750 integers for termspace/termends
% 1.61/2.01 *** allocated 113905 integers for clauses
% 1.61/2.01
% 1.61/2.01 Intermediate Status:
% 1.61/2.01 Generated: 5061
% 1.61/2.01 Kept: 2033
% 1.61/2.01 Inuse: 123
% 1.61/2.01 Deleted: 5
% 1.61/2.01 Deletedinuse: 2
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 *** allocated 170857 integers for clauses
% 1.61/2.01 *** allocated 50625 integers for termspace/termends
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 *** allocated 75937 integers for termspace/termends
% 1.61/2.01 *** allocated 256285 integers for clauses
% 1.61/2.01
% 1.61/2.01 Intermediate Status:
% 1.61/2.01 Generated: 9967
% 1.61/2.01 Kept: 4033
% 1.61/2.01 Inuse: 197
% 1.61/2.01 Deleted: 41
% 1.61/2.01 Deletedinuse: 19
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 *** allocated 113905 integers for termspace/termends
% 1.61/2.01 *** allocated 384427 integers for clauses
% 1.61/2.01
% 1.61/2.01 Intermediate Status:
% 1.61/2.01 Generated: 14007
% 1.61/2.01 Kept: 6197
% 1.61/2.01 Inuse: 259
% 1.61/2.01 Deleted: 49
% 1.61/2.01 Deletedinuse: 22
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 *** allocated 576640 integers for clauses
% 1.61/2.01
% 1.61/2.01 Intermediate Status:
% 1.61/2.01 Generated: 17789
% 1.61/2.01 Kept: 8221
% 1.61/2.01 Inuse: 317
% 1.61/2.01 Deleted: 65
% 1.61/2.01 Deletedinuse: 29
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 *** allocated 170857 integers for termspace/termends
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01
% 1.61/2.01 Intermediate Status:
% 1.61/2.01 Generated: 24819
% 1.61/2.01 Kept: 10371
% 1.61/2.01 Inuse: 365
% 1.61/2.01 Deleted: 74
% 1.61/2.01 Deletedinuse: 33
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 *** allocated 864960 integers for clauses
% 1.61/2.01 *** allocated 256285 integers for termspace/termends
% 1.61/2.01
% 1.61/2.01 Intermediate Status:
% 1.61/2.01 Generated: 30563
% 1.61/2.01 Kept: 13362
% 1.61/2.01 Inuse: 375
% 1.61/2.01 Deleted: 77
% 1.61/2.01 Deletedinuse: 36
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01 Resimplifying inuse:
% 1.61/2.01 Done
% 1.61/2.01
% 1.61/2.01
% 1.61/2.01 Bliksems!, er is een bewijs:
% 1.61/2.01 % SZS status Theorem
% 1.61/2.01 % SZS output start Refutation
% 1.61/2.01
% 1.61/2.01 (7) {G0,W9,D3,L2,V3,M2} I { ! member( X, unordered_pair( Y, Z ) ), alpha1(
% 1.61/2.01 X, Y, Z ) }.
% 1.61/2.01 (9) {G0,W10,D2,L3,V3,M3} I { ! alpha1( X, Y, Z ), X = Y, X = Z }.
% 1.61/2.01 (13) {G0,W6,D3,L1,V1,M1} I { unordered_pair( X, X ) ==> singleton( X ) }.
% 1.61/2.01 (92) {G0,W4,D3,L1,V0,M1} I { member( skol9, singleton( skol8 ) ) }.
% 1.61/2.01 (93) {G0,W3,D2,L1,V0,M1} I { ! skol9 ==> skol8 }.
% 1.61/2.01 (95) {G1,W7,D2,L2,V2,M2} F(9) { ! alpha1( X, Y, Y ), X = Y }.
% 1.61/2.01 (11830) {G2,W7,D2,L2,V1,M2} P(95,93) { ! X = skol8, ! alpha1( skol9, X, X )
% 1.61/2.01 }.
% 1.61/2.01 (11835) {G3,W4,D2,L1,V0,M1} Q(11830) { ! alpha1( skol9, skol8, skol8 ) }.
% 1.61/2.01 (14821) {G4,W0,D0,L0,V0,M0} R(11835,7);d(13);r(92) { }.
% 1.61/2.01
% 1.61/2.01
% 1.61/2.01 % SZS output end Refutation
% 1.61/2.01 found a proof!
% 1.61/2.01
% 1.61/2.01
% 1.61/2.01 Unprocessed initial clauses:
% 1.61/2.01
% 1.61/2.01 (14823) {G0,W9,D2,L3,V3,M3} { ! subclass( X, Y ), ! member( Z, X ), member
% 1.61/2.01 ( Z, Y ) }.
% 1.61/2.01 (14824) {G0,W8,D3,L2,V3,M2} { ! member( skol1( Z, Y ), Y ), subclass( X, Y
% 1.61/2.01 ) }.
% 1.61/2.01 (14825) {G0,W8,D3,L2,V2,M2} { member( skol1( X, Y ), X ), subclass( X, Y )
% 1.61/2.01 }.
% 1.61/2.01 (14826) {G0,W3,D2,L1,V1,M1} { subclass( X, universal_class ) }.
% 1.61/2.01 (14827) {G0,W6,D2,L2,V2,M2} { ! X = Y, subclass( X, Y ) }.
% 1.61/2.01 (14828) {G0,W6,D2,L2,V2,M2} { ! X = Y, subclass( Y, X ) }.
% 1.61/2.01 (14829) {G0,W9,D2,L3,V2,M3} { ! subclass( X, Y ), ! subclass( Y, X ), X =
% 1.61/2.01 Y }.
% 1.61/2.01 (14830) {G0,W8,D3,L2,V3,M2} { ! member( X, unordered_pair( Y, Z ) ),
% 1.61/2.01 member( X, universal_class ) }.
% 1.61/2.01 (14831) {G0,W9,D3,L2,V3,M2} { ! member( X, unordered_pair( Y, Z ) ),
% 1.61/2.01 alpha1( X, Y, Z ) }.
% 1.61/2.01 (14832) {G0,W12,D3,L3,V3,M3} { ! member( X, universal_class ), ! alpha1( X
% 1.61/2.01 , Y, Z ), member( X, unordered_pair( Y, Z ) ) }.
% 1.61/2.01 (14833) {G0,W10,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), X = Y, X = Z }.
% 1.61/2.01 (14834) {G0,W7,D2,L2,V3,M2} { ! X = Y, alpha1( X, Y, Z ) }.
% 1.61/2.01 (14835) {G0,W7,D2,L2,V3,M2} { ! X = Z, alpha1( X, Y, Z ) }.
% 1.61/2.01 (14836) {G0,W5,D3,L1,V2,M1} { member( unordered_pair( X, Y ),
% 1.61/2.01 universal_class ) }.
% 1.61/2.01 (14837) {G0,W6,D3,L1,V1,M1} { singleton( X ) = unordered_pair( X, X ) }.
% 1.61/2.01 (14838) {G0,W11,D5,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 1.61/2.01 singleton( X ), unordered_pair( X, singleton( Y ) ) ) }.
% 1.61/2.01 (14839) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( X, Y ),
% 1.61/2.01 cross_product( Z, T ) ), member( X, Z ) }.
% 1.61/2.01 (14840) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( X, Y ),
% 1.61/2.01 cross_product( Z, T ) ), member( Y, T ) }.
% 1.61/2.01 (14841) {G0,W13,D3,L3,V4,M3} { ! member( X, Z ), ! member( Y, T ), member
% 1.61/2.01 ( ordered_pair( X, Y ), cross_product( Z, T ) ) }.
% 1.61/2.01 (14842) {G0,W12,D4,L3,V2,M3} { ! member( X, universal_class ), ! member( Y
% 1.61/2.01 , universal_class ), first( ordered_pair( X, Y ) ) = X }.
% 1.61/2.01 (14843) {G0,W12,D4,L3,V2,M3} { ! member( X, universal_class ), ! member( Y
% 1.61/2.01 , universal_class ), second( ordered_pair( X, Y ) ) = Y }.
% 1.61/2.01 (14844) {G0,W12,D4,L2,V3,M2} { ! member( X, cross_product( Y, Z ) ), X =
% 1.61/2.01 ordered_pair( first( X ), second( X ) ) }.
% 1.61/2.01 (14845) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 1.61/2.01 element_relation ), member( Y, universal_class ) }.
% 1.61/2.01 (14846) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 1.61/2.01 element_relation ), member( X, Y ) }.
% 1.61/2.01 (14847) {G0,W11,D3,L3,V2,M3} { ! member( Y, universal_class ), ! member( X
% 1.61/2.01 , Y ), member( ordered_pair( X, Y ), element_relation ) }.
% 1.61/2.01 (14848) {G0,W5,D3,L1,V0,M1} { subclass( element_relation, cross_product(
% 1.61/2.01 universal_class, universal_class ) ) }.
% 1.61/2.01 (14849) {G0,W8,D3,L2,V3,M2} { ! member( Z, intersection( X, Y ) ), member
% 1.61/2.01 ( Z, X ) }.
% 1.61/2.01 (14850) {G0,W8,D3,L2,V3,M2} { ! member( Z, intersection( X, Y ) ), member
% 1.61/2.01 ( Z, Y ) }.
% 1.61/2.01 (14851) {G0,W11,D3,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ), member
% 1.61/2.01 ( Z, intersection( X, Y ) ) }.
% 1.61/2.01 (14852) {G0,W7,D3,L2,V2,M2} { ! member( Y, complement( X ) ), member( Y,
% 1.61/2.01 universal_class ) }.
% 1.61/2.01 (14853) {G0,W7,D3,L2,V2,M2} { ! member( Y, complement( X ) ), ! member( Y
% 1.61/2.01 , X ) }.
% 1.61/2.01 (14854) {G0,W10,D3,L3,V2,M3} { ! member( Y, universal_class ), member( Y,
% 1.61/2.01 X ), member( Y, complement( X ) ) }.
% 1.61/2.01 (14855) {G0,W10,D4,L1,V3,M1} { restrict( Y, X, Z ) = intersection( Y,
% 1.61/2.01 cross_product( X, Z ) ) }.
% 1.61/2.01 (14856) {G0,W3,D2,L1,V1,M1} { ! member( X, null_class ) }.
% 1.61/2.01 (14857) {G0,W7,D3,L2,V2,M2} { ! member( Y, domain_of( X ) ), member( Y,
% 1.61/2.01 universal_class ) }.
% 1.61/2.01 (14858) {G0,W11,D4,L2,V2,M2} { ! member( Y, domain_of( X ) ), ! restrict(
% 1.61/2.01 X, singleton( Y ), universal_class ) = null_class }.
% 1.61/2.01 (14859) {G0,W14,D4,L3,V2,M3} { ! member( Y, universal_class ), restrict( X
% 1.61/2.01 , singleton( Y ), universal_class ) = null_class, member( Y, domain_of( X
% 1.61/2.01 ) ) }.
% 1.61/2.01 (14860) {G0,W19,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( Y, Z
% 1.61/2.01 ), T ), rotate( X ) ), member( ordered_pair( ordered_pair( Y, Z ), T ),
% 1.61/2.01 cross_product( cross_product( universal_class, universal_class ),
% 1.61/2.01 universal_class ) ) }.
% 1.61/2.01 (14861) {G0,W15,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( Y, Z
% 1.61/2.01 ), T ), rotate( X ) ), member( ordered_pair( ordered_pair( Z, T ), Y ),
% 1.61/2.01 X ) }.
% 1.61/2.01 (14862) {G0,W26,D4,L3,V4,M3} { ! member( ordered_pair( ordered_pair( Y, Z
% 1.61/2.01 ), T ), cross_product( cross_product( universal_class, universal_class )
% 1.61/2.01 , universal_class ) ), ! member( ordered_pair( ordered_pair( Z, T ), Y )
% 1.61/2.01 , X ), member( ordered_pair( ordered_pair( Y, Z ), T ), rotate( X ) ) }.
% 1.61/2.01 (14863) {G0,W8,D4,L1,V1,M1} { subclass( rotate( X ), cross_product(
% 1.61/2.01 cross_product( universal_class, universal_class ), universal_class ) )
% 1.61/2.01 }.
% 1.61/2.01 (14864) {G0,W19,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( X, Y
% 1.61/2.01 ), Z ), flip( T ) ), member( ordered_pair( ordered_pair( X, Y ), Z ),
% 1.61/2.01 cross_product( cross_product( universal_class, universal_class ),
% 1.61/2.01 universal_class ) ) }.
% 1.61/2.01 (14865) {G0,W15,D4,L2,V4,M2} { ! member( ordered_pair( ordered_pair( X, Y
% 1.61/2.01 ), Z ), flip( T ) ), member( ordered_pair( ordered_pair( Y, X ), Z ), T
% 1.61/2.01 ) }.
% 1.61/2.01 (14866) {G0,W26,D4,L3,V4,M3} { ! member( ordered_pair( ordered_pair( X, Y
% 1.61/2.01 ), Z ), cross_product( cross_product( universal_class, universal_class )
% 1.61/2.01 , universal_class ) ), ! member( ordered_pair( ordered_pair( Y, X ), Z )
% 1.61/2.01 , T ), member( ordered_pair( ordered_pair( X, Y ), Z ), flip( T ) ) }.
% 1.61/2.01 (14867) {G0,W8,D4,L1,V1,M1} { subclass( flip( X ), cross_product(
% 1.61/2.01 cross_product( universal_class, universal_class ), universal_class ) )
% 1.61/2.01 }.
% 1.61/2.01 (14868) {G0,W11,D3,L3,V3,M3} { ! member( Z, union( X, Y ) ), member( Z, X
% 1.61/2.01 ), member( Z, Y ) }.
% 1.61/2.01 (14869) {G0,W8,D3,L2,V3,M2} { ! member( Z, X ), member( Z, union( X, Y ) )
% 1.61/2.01 }.
% 1.61/2.01 (14870) {G0,W8,D3,L2,V3,M2} { ! member( Z, Y ), member( Z, union( X, Y ) )
% 1.61/2.01 }.
% 1.61/2.01 (14871) {G0,W7,D4,L1,V1,M1} { successor( X ) = union( X, singleton( X ) )
% 1.61/2.01 }.
% 1.61/2.01 (14872) {G0,W5,D3,L1,V0,M1} { subclass( successor_relation, cross_product
% 1.61/2.01 ( universal_class, universal_class ) ) }.
% 1.61/2.01 (14873) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 1.61/2.01 successor_relation ), member( X, universal_class ) }.
% 1.61/2.01 (14874) {G0,W8,D3,L2,V2,M2} { ! member( ordered_pair( X, Y ),
% 1.61/2.01 successor_relation ), alpha2( X, Y ) }.
% 1.61/2.01 (14875) {G0,W11,D3,L3,V2,M3} { ! member( X, universal_class ), ! alpha2( X
% 1.61/2.01 , Y ), member( ordered_pair( X, Y ), successor_relation ) }.
% 1.61/2.01 (14876) {G0,W6,D2,L2,V2,M2} { ! alpha2( X, Y ), member( Y, universal_class
% 1.61/2.01 ) }.
% 1.61/2.01 (14877) {G0,W7,D3,L2,V2,M2} { ! alpha2( X, Y ), successor( X ) = Y }.
% 1.61/2.01 (14878) {G0,W10,D3,L3,V2,M3} { ! member( Y, universal_class ), ! successor
% 1.61/2.01 ( X ) = Y, alpha2( X, Y ) }.
% 1.61/2.01 (14879) {G0,W8,D5,L1,V1,M1} { inverse( X ) = domain_of( flip(
% 1.61/2.01 cross_product( X, universal_class ) ) ) }.
% 1.61/2.01 (14880) {G0,W6,D4,L1,V1,M1} { range_of( X ) = domain_of( inverse( X ) )
% 1.61/2.01 }.
% 1.61/2.01 (14881) {G0,W9,D4,L1,V2,M1} { image( Y, X ) = range_of( restrict( Y, X,
% 1.61/2.01 universal_class ) ) }.
% 1.61/2.01 (14882) {G0,W5,D2,L2,V1,M2} { ! inductive( X ), member( null_class, X )
% 1.61/2.01 }.
% 1.61/2.01 (14883) {G0,W7,D3,L2,V1,M2} { ! inductive( X ), subclass( image(
% 1.61/2.01 successor_relation, X ), X ) }.
% 1.61/2.01 (14884) {G0,W10,D3,L3,V1,M3} { ! member( null_class, X ), ! subclass(
% 1.61/2.01 image( successor_relation, X ), X ), inductive( X ) }.
% 1.61/2.01 (14885) {G0,W3,D2,L1,V0,M1} { member( skol2, universal_class ) }.
% 1.61/2.01 (14886) {G0,W2,D2,L1,V0,M1} { inductive( skol2 ) }.
% 1.61/2.01 (14887) {G0,W5,D2,L2,V1,M2} { ! inductive( X ), subclass( skol2, X ) }.
% 1.61/2.01 (14888) {G0,W9,D3,L2,V3,M2} { ! member( X, sum_class( Y ) ), member( skol3
% 1.61/2.01 ( Z, Y ), Y ) }.
% 1.61/2.01 (14889) {G0,W9,D3,L2,V2,M2} { ! member( X, sum_class( Y ) ), member( X,
% 1.61/2.01 skol3( X, Y ) ) }.
% 1.61/2.01 (14890) {G0,W10,D3,L3,V3,M3} { ! member( X, Z ), ! member( Z, Y ), member
% 1.61/2.01 ( X, sum_class( Y ) ) }.
% 1.61/2.01 (14891) {G0,W7,D3,L2,V1,M2} { ! member( X, universal_class ), member(
% 1.61/2.01 sum_class( X ), universal_class ) }.
% 1.61/2.01 (14892) {G0,W7,D3,L2,V2,M2} { ! member( X, power_class( Y ) ), member( X,
% 1.61/2.01 universal_class ) }.
% 1.61/2.01 (14893) {G0,W7,D3,L2,V2,M2} { ! member( X, power_class( Y ) ), subclass( X
% 1.61/2.01 , Y ) }.
% 1.61/2.01 (14894) {G0,W10,D3,L3,V2,M3} { ! member( X, universal_class ), ! subclass
% 1.61/2.01 ( X, Y ), member( X, power_class( Y ) ) }.
% 1.61/2.01 (14895) {G0,W7,D3,L2,V1,M2} { ! member( X, universal_class ), member(
% 1.61/2.01 power_class( X ), universal_class ) }.
% 1.61/2.01 (14896) {G0,W7,D3,L1,V2,M1} { subclass( compose( Y, X ), cross_product(
% 1.61/2.01 universal_class, universal_class ) ) }.
% 1.61/2.01 (14897) {G0,W10,D3,L2,V4,M2} { ! member( ordered_pair( Z, T ), compose( Y
% 1.61/2.01 , X ) ), member( Z, universal_class ) }.
% 1.61/2.01 (14898) {G0,W15,D5,L2,V4,M2} { ! member( ordered_pair( Z, T ), compose( Y
% 1.61/2.01 , X ) ), member( T, image( Y, image( X, singleton( Z ) ) ) ) }.
% 1.61/2.01 (14899) {G0,W18,D5,L3,V4,M3} { ! member( Z, universal_class ), ! member( T
% 1.61/2.01 , image( Y, image( X, singleton( Z ) ) ) ), member( ordered_pair( Z, T )
% 1.61/2.01 , compose( Y, X ) ) }.
% 1.61/2.01 (14900) {G0,W7,D3,L2,V2,M2} { ! member( X, identity_relation ), member(
% 1.61/2.01 skol4( Y ), universal_class ) }.
% 1.61/2.01 (14901) {G0,W10,D4,L2,V1,M2} { ! member( X, identity_relation ), X =
% 1.61/2.01 ordered_pair( skol4( X ), skol4( X ) ) }.
% 1.61/2.01 (14902) {G0,W11,D3,L3,V2,M3} { ! member( Y, universal_class ), ! X =
% 1.61/2.01 ordered_pair( Y, Y ), member( X, identity_relation ) }.
% 1.61/2.01 (14903) {G0,W7,D3,L2,V1,M2} { ! function( X ), subclass( X, cross_product
% 1.61/2.01 ( universal_class, universal_class ) ) }.
% 1.61/2.01 (14904) {G0,W8,D4,L2,V1,M2} { ! function( X ), subclass( compose( X,
% 1.61/2.01 inverse( X ) ), identity_relation ) }.
% 1.61/2.01 (14905) {G0,W13,D4,L3,V1,M3} { ! subclass( X, cross_product(
% 1.61/2.01 universal_class, universal_class ) ), ! subclass( compose( X, inverse( X
% 1.61/2.01 ) ), identity_relation ), function( X ) }.
% 1.61/2.01 (14906) {G0,W10,D3,L3,V2,M3} { ! member( X, universal_class ), ! function
% 1.61/2.01 ( Y ), member( image( Y, X ), universal_class ) }.
% 1.61/2.01 (14907) {G0,W9,D2,L3,V3,M3} { ! disjoint( X, Y ), ! member( Z, X ), !
% 1.61/2.01 member( Z, Y ) }.
% 1.61/2.01 (14908) {G0,W8,D3,L2,V3,M2} { member( skol5( Z, Y ), Y ), disjoint( X, Y )
% 1.61/2.01 }.
% 1.61/2.01 (14909) {G0,W8,D3,L2,V2,M2} { member( skol5( X, Y ), X ), disjoint( X, Y )
% 1.61/2.01 }.
% 1.61/2.01 (14910) {G0,W7,D3,L2,V2,M2} { X = null_class, member( skol6( Y ),
% 1.61/2.01 universal_class ) }.
% 1.61/2.01 (14911) {G0,W7,D3,L2,V1,M2} { X = null_class, member( skol6( X ), X ) }.
% 1.61/2.01 (14912) {G0,W7,D3,L2,V1,M2} { X = null_class, disjoint( skol6( X ), X )
% 1.61/2.01 }.
% 1.61/2.01 (14913) {G0,W9,D5,L1,V2,M1} { apply( X, Y ) = sum_class( image( X,
% 1.61/2.01 singleton( Y ) ) ) }.
% 1.61/2.01 (14914) {G0,W2,D2,L1,V0,M1} { function( skol7 ) }.
% 1.61/2.01 (14915) {G0,W11,D3,L3,V1,M3} { ! member( X, universal_class ), X =
% 1.61/2.01 null_class, member( apply( skol7, X ), X ) }.
% 1.61/2.01 (14916) {G0,W4,D3,L1,V0,M1} { member( skol9, singleton( skol8 ) ) }.
% 1.61/2.01 (14917) {G0,W3,D2,L1,V0,M1} { ! skol9 = skol8 }.
% 1.61/2.01
% 1.61/2.01
% 1.61/2.01 Total Proof:
% 1.61/2.01
% 1.61/2.01 subsumption: (7) {G0,W9,D3,L2,V3,M2} I { ! member( X, unordered_pair( Y, Z
% 1.61/2.01 ) ), alpha1( X, Y, Z ) }.
% 1.61/2.01 parent0: (14831) {G0,W9,D3,L2,V3,M2} { ! member( X, unordered_pair( Y, Z )
% 1.61/2.01 ), alpha1( X, Y, Z ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := X
% 260.05/260.50 Y := Y
% 260.05/260.50 Z := Z
% 260.05/260.50 end
% 260.05/260.50 permutation0:
% 260.05/260.50 0 ==> 0
% 260.05/260.50 1 ==> 1
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 subsumption: (9) {G0,W10,D2,L3,V3,M3} I { ! alpha1( X, Y, Z ), X = Y, X = Z
% 260.05/260.50 }.
% 260.05/260.50 parent0: (14833) {G0,W10,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), X = Y, X = Z
% 260.05/260.50 }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := X
% 260.05/260.50 Y := Y
% 260.05/260.50 Z := Z
% 260.05/260.50 end
% 260.05/260.50 permutation0:
% 260.05/260.50 0 ==> 0
% 260.05/260.50 1 ==> 1
% 260.05/260.50 2 ==> 2
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 eqswap: (14939) {G0,W6,D3,L1,V1,M1} { unordered_pair( X, X ) = singleton(
% 260.05/260.50 X ) }.
% 260.05/260.50 parent0[0]: (14837) {G0,W6,D3,L1,V1,M1} { singleton( X ) = unordered_pair
% 260.05/260.50 ( X, X ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := X
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 subsumption: (13) {G0,W6,D3,L1,V1,M1} I { unordered_pair( X, X ) ==>
% 260.05/260.50 singleton( X ) }.
% 260.05/260.50 parent0: (14939) {G0,W6,D3,L1,V1,M1} { unordered_pair( X, X ) = singleton
% 260.05/260.50 ( X ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := X
% 260.05/260.50 end
% 260.05/260.50 permutation0:
% 260.05/260.50 0 ==> 0
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 subsumption: (92) {G0,W4,D3,L1,V0,M1} I { member( skol9, singleton( skol8 )
% 260.05/260.50 ) }.
% 260.05/260.50 parent0: (14916) {G0,W4,D3,L1,V0,M1} { member( skol9, singleton( skol8 ) )
% 260.05/260.50 }.
% 260.05/260.50 substitution0:
% 260.05/260.50 end
% 260.05/260.50 permutation0:
% 260.05/260.50 0 ==> 0
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 subsumption: (93) {G0,W3,D2,L1,V0,M1} I { ! skol9 ==> skol8 }.
% 260.05/260.50 parent0: (14917) {G0,W3,D2,L1,V0,M1} { ! skol9 = skol8 }.
% 260.05/260.50 substitution0:
% 260.05/260.50 end
% 260.05/260.50 permutation0:
% 260.05/260.50 0 ==> 0
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 factor: (15030) {G0,W7,D2,L2,V2,M2} { ! alpha1( X, Y, Y ), X = Y }.
% 260.05/260.50 parent0[1, 2]: (9) {G0,W10,D2,L3,V3,M3} I { ! alpha1( X, Y, Z ), X = Y, X =
% 260.05/260.50 Z }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := X
% 260.05/260.50 Y := Y
% 260.05/260.50 Z := Y
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 subsumption: (95) {G1,W7,D2,L2,V2,M2} F(9) { ! alpha1( X, Y, Y ), X = Y }.
% 260.05/260.50 parent0: (15030) {G0,W7,D2,L2,V2,M2} { ! alpha1( X, Y, Y ), X = Y }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := X
% 260.05/260.50 Y := Y
% 260.05/260.50 end
% 260.05/260.50 permutation0:
% 260.05/260.50 0 ==> 0
% 260.05/260.50 1 ==> 1
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 *** allocated 15000 integers for justifications
% 260.05/260.50 *** allocated 22500 integers for justifications
% 260.05/260.50 *** allocated 33750 integers for justifications
% 260.05/260.50 *** allocated 50625 integers for justifications
% 260.05/260.50 *** allocated 384427 integers for termspace/termends
% 260.05/260.50 *** allocated 75937 integers for justifications
% 260.05/260.50 *** allocated 113905 integers for justifications
% 260.05/260.50 *** allocated 170857 integers for justifications
% 260.05/260.50 *** allocated 576640 integers for termspace/termends
% 260.05/260.50 *** allocated 256285 integers for justifications
% 260.05/260.50 *** allocated 1297440 integers for clauses
% 260.05/260.50 *** allocated 384427 integers for justifications
% 260.05/260.50 *** allocated 864960 integers for termspace/termends
% 260.05/260.50 *** allocated 576640 integers for justifications
% 260.05/260.50 *** allocated 1297440 integers for termspace/termends
% 260.05/260.50 *** allocated 864960 integers for justifications
% 260.05/260.50 *** allocated 1946160 integers for clauses
% 260.05/260.50 *** allocated 1297440 integers for justifications
% 260.05/260.50 *** allocated 1946160 integers for termspace/termends
% 260.05/260.50 eqswap: (15033) {G0,W3,D2,L1,V0,M1} { ! skol8 ==> skol9 }.
% 260.05/260.50 parent0[0]: (93) {G0,W3,D2,L1,V0,M1} I { ! skol9 ==> skol8 }.
% 260.05/260.50 substitution0:
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 paramod: (78781) {G1,W7,D2,L2,V1,M2} { ! skol8 ==> X, ! alpha1( skol9, X,
% 260.05/260.50 X ) }.
% 260.05/260.50 parent0[1]: (95) {G1,W7,D2,L2,V2,M2} F(9) { ! alpha1( X, Y, Y ), X = Y }.
% 260.05/260.50 parent1[0; 3]: (15033) {G0,W3,D2,L1,V0,M1} { ! skol8 ==> skol9 }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := skol9
% 260.05/260.50 Y := X
% 260.05/260.50 end
% 260.05/260.50 substitution1:
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 eqswap: (78823) {G1,W7,D2,L2,V1,M2} { ! X ==> skol8, ! alpha1( skol9, X, X
% 260.05/260.50 ) }.
% 260.05/260.50 parent0[0]: (78781) {G1,W7,D2,L2,V1,M2} { ! skol8 ==> X, ! alpha1( skol9,
% 260.05/260.50 X, X ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := X
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 subsumption: (11830) {G2,W7,D2,L2,V1,M2} P(95,93) { ! X = skol8, ! alpha1(
% 260.05/260.50 skol9, X, X ) }.
% 260.05/260.50 parent0: (78823) {G1,W7,D2,L2,V1,M2} { ! X ==> skol8, ! alpha1( skol9, X,
% 260.05/260.50 X ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := X
% 260.05/260.50 end
% 260.05/260.50 permutation0:
% 260.05/260.50 0 ==> 0
% 260.05/260.50 1 ==> 1
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 eqswap: (90640) {G2,W7,D2,L2,V1,M2} { ! skol8 = X, ! alpha1( skol9, X, X )
% 260.05/260.50 }.
% 260.05/260.50 parent0[0]: (11830) {G2,W7,D2,L2,V1,M2} P(95,93) { ! X = skol8, ! alpha1(
% 260.05/260.50 skol9, X, X ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := X
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 eqrefl: (90641) {G0,W4,D2,L1,V0,M1} { ! alpha1( skol9, skol8, skol8 ) }.
% 260.05/260.50 parent0[0]: (90640) {G2,W7,D2,L2,V1,M2} { ! skol8 = X, ! alpha1( skol9, X
% 260.05/260.50 , X ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := skol8
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 subsumption: (11835) {G3,W4,D2,L1,V0,M1} Q(11830) { ! alpha1( skol9, skol8
% 260.05/260.50 , skol8 ) }.
% 260.05/260.50 parent0: (90641) {G0,W4,D2,L1,V0,M1} { ! alpha1( skol9, skol8, skol8 ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 end
% 260.05/260.50 permutation0:
% 260.05/260.50 0 ==> 0
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 resolution: (90643) {G1,W5,D3,L1,V0,M1} { ! member( skol9, unordered_pair
% 260.05/260.50 ( skol8, skol8 ) ) }.
% 260.05/260.50 parent0[0]: (11835) {G3,W4,D2,L1,V0,M1} Q(11830) { ! alpha1( skol9, skol8,
% 260.05/260.50 skol8 ) }.
% 260.05/260.50 parent1[1]: (7) {G0,W9,D3,L2,V3,M2} I { ! member( X, unordered_pair( Y, Z )
% 260.05/260.50 ), alpha1( X, Y, Z ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 end
% 260.05/260.50 substitution1:
% 260.05/260.50 X := skol9
% 260.05/260.50 Y := skol8
% 260.05/260.50 Z := skol8
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 paramod: (90644) {G1,W4,D3,L1,V0,M1} { ! member( skol9, singleton( skol8 )
% 260.05/260.50 ) }.
% 260.05/260.50 parent0[0]: (13) {G0,W6,D3,L1,V1,M1} I { unordered_pair( X, X ) ==>
% 260.05/260.50 singleton( X ) }.
% 260.05/260.50 parent1[0; 3]: (90643) {G1,W5,D3,L1,V0,M1} { ! member( skol9,
% 260.05/260.50 unordered_pair( skol8, skol8 ) ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 X := skol8
% 260.05/260.50 end
% 260.05/260.50 substitution1:
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 resolution: (90645) {G1,W0,D0,L0,V0,M0} { }.
% 260.05/260.50 parent0[0]: (90644) {G1,W4,D3,L1,V0,M1} { ! member( skol9, singleton(
% 260.05/260.50 skol8 ) ) }.
% 260.05/260.50 parent1[0]: (92) {G0,W4,D3,L1,V0,M1} I { member( skol9, singleton( skol8 )
% 260.05/260.50 ) }.
% 260.05/260.50 substitution0:
% 260.05/260.50 end
% 260.05/260.50 substitution1:
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 subsumption: (14821) {G4,W0,D0,L0,V0,M0} R(11835,7);d(13);r(92) { }.
% 260.05/260.50 parent0: (90645) {G1,W0,D0,L0,V0,M0} { }.
% 260.05/260.50 substitution0:
% 260.05/260.50 end
% 260.05/260.50 permutation0:
% 260.05/260.50 end
% 260.05/260.50
% 260.05/260.50 Proof check complete!
% 260.05/260.50
% 260.05/260.50 Memory use:
% 260.05/260.50
% 260.05/260.50 space for terms: 199552
% 260.05/260.50 space for clauses: 673439
% 260.05/260.50
% 260.05/260.50
% 260.05/260.50 clauses generated: 34206
% 260.05/260.50 clauses kept: 14822
% 260.05/260.50 clauses selected: 387
% 260.05/260.50 clauses deleted: 77
% 260.05/260.50 clauses inuse deleted: 36
% 260.05/260.50
% 260.05/260.50 subsentry: 513990750
% 260.05/260.50 literals s-matched: 114805425
% 260.05/260.50 literals matched: 86662590
% 260.05/260.50 full subsumption: 86549507
% 260.05/260.50
% 260.05/260.50 checksum: 286813942
% 260.05/260.50
% 260.05/260.50
% 260.05/260.50 Bliksem ended
%------------------------------------------------------------------------------