TSTP Solution File: SEU090+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU090+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Tue Jul 19 07:10:34 EDT 2022
% Result : Theorem 1.72s 2.11s
% Output : Refutation 1.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU090+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Sun Jun 19 08:49:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10
% 0.69/1.10 { ! in( X, Y ), ! in( Y, X ) }.
% 0.69/1.10 { ! ordinal( X ), ! element( Y, X ), epsilon_transitive( Y ) }.
% 0.69/1.10 { ! ordinal( X ), ! element( Y, X ), epsilon_connected( Y ) }.
% 0.69/1.10 { ! ordinal( X ), ! element( Y, X ), ordinal( Y ) }.
% 0.69/1.10 { ! empty( X ), finite( X ) }.
% 0.69/1.10 { ! empty( X ), function( X ) }.
% 0.69/1.10 { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.69/1.10 { ! ordinal( X ), epsilon_connected( X ) }.
% 0.69/1.10 { ! empty( X ), relation( X ) }.
% 0.69/1.10 { ! element( X, powerset( cartesian_product2( Y, Z ) ) ), relation( X ) }.
% 0.69/1.10 { ! empty( X ), ! ordinal( X ), alpha1( X ) }.
% 0.69/1.10 { ! empty( X ), ! ordinal( X ), natural( X ) }.
% 0.69/1.10 { ! alpha1( X ), epsilon_transitive( X ) }.
% 0.69/1.10 { ! alpha1( X ), epsilon_connected( X ) }.
% 0.69/1.10 { ! alpha1( X ), ordinal( X ) }.
% 0.69/1.10 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ! ordinal( X ),
% 0.69/1.10 alpha1( X ) }.
% 0.69/1.10 { ! finite( X ), ! element( Y, powerset( X ) ), finite( Y ) }.
% 0.69/1.10 { ! relation( X ), ! empty( X ), ! function( X ), relation( X ) }.
% 0.69/1.10 { ! relation( X ), ! empty( X ), ! function( X ), function( X ) }.
% 0.69/1.10 { ! relation( X ), ! empty( X ), ! function( X ), one_to_one( X ) }.
% 0.69/1.10 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ordinal( X ) }.
% 0.69/1.10 { ! empty( X ), epsilon_transitive( X ) }.
% 0.69/1.10 { ! empty( X ), epsilon_connected( X ) }.
% 0.69/1.10 { ! empty( X ), ordinal( X ) }.
% 0.69/1.10 { ! element( X, positive_rationals ), ! ordinal( X ), alpha2( X ) }.
% 0.69/1.10 { ! element( X, positive_rationals ), ! ordinal( X ), natural( X ) }.
% 0.69/1.10 { ! alpha2( X ), epsilon_transitive( X ) }.
% 0.69/1.10 { ! alpha2( X ), epsilon_connected( X ) }.
% 0.69/1.10 { ! alpha2( X ), ordinal( X ) }.
% 0.69/1.10 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ! ordinal( X ),
% 0.69/1.10 alpha2( X ) }.
% 0.69/1.10 { cartesian_product4( X, Y, Z, T ) = cartesian_product2( cartesian_product3
% 0.69/1.10 ( X, Y, Z ), T ) }.
% 0.69/1.10 { element( skol1( X ), X ) }.
% 0.69/1.10 { empty( empty_set ) }.
% 0.69/1.10 { relation( empty_set ) }.
% 0.69/1.10 { relation_empty_yielding( empty_set ) }.
% 0.69/1.10 { ! finite( X ), ! finite( Y ), finite( cartesian_product2( X, Y ) ) }.
% 0.69/1.10 { ! finite( X ), ! finite( Y ), ! finite( Z ), finite( cartesian_product3(
% 0.69/1.10 X, Y, Z ) ) }.
% 0.69/1.10 { ! empty( powerset( X ) ) }.
% 0.69/1.10 { empty( empty_set ) }.
% 0.69/1.10 { relation( empty_set ) }.
% 0.69/1.10 { relation_empty_yielding( empty_set ) }.
% 0.69/1.10 { function( empty_set ) }.
% 0.69/1.10 { one_to_one( empty_set ) }.
% 0.69/1.10 { empty( empty_set ) }.
% 0.69/1.10 { epsilon_transitive( empty_set ) }.
% 0.69/1.10 { epsilon_connected( empty_set ) }.
% 0.69/1.10 { ordinal( empty_set ) }.
% 0.69/1.10 { empty( empty_set ) }.
% 0.69/1.10 { relation( empty_set ) }.
% 0.69/1.10 { empty( X ), empty( Y ), ! empty( cartesian_product2( X, Y ) ) }.
% 0.69/1.10 { empty( X ), empty( Y ), empty( Z ), ! empty( cartesian_product3( X, Y, Z
% 0.69/1.10 ) ) }.
% 0.69/1.10 { empty( X ), empty( Y ), empty( Z ), empty( T ), ! empty(
% 0.69/1.10 cartesian_product4( X, Y, Z, T ) ) }.
% 0.69/1.10 { ! empty( positive_rationals ) }.
% 0.69/1.10 { ! empty( skol2 ) }.
% 0.69/1.10 { epsilon_transitive( skol2 ) }.
% 0.69/1.10 { epsilon_connected( skol2 ) }.
% 0.69/1.10 { ordinal( skol2 ) }.
% 0.69/1.10 { natural( skol2 ) }.
% 0.69/1.10 { ! empty( skol3 ) }.
% 0.69/1.10 { finite( skol3 ) }.
% 0.69/1.10 { relation( skol4 ) }.
% 0.69/1.10 { function( skol4 ) }.
% 0.69/1.10 { function_yielding( skol4 ) }.
% 0.69/1.10 { relation( skol5 ) }.
% 0.69/1.10 { function( skol5 ) }.
% 0.69/1.10 { epsilon_transitive( skol6 ) }.
% 0.69/1.10 { epsilon_connected( skol6 ) }.
% 0.69/1.10 { ordinal( skol6 ) }.
% 0.69/1.10 { epsilon_transitive( skol7 ) }.
% 0.69/1.10 { epsilon_connected( skol7 ) }.
% 0.69/1.10 { ordinal( skol7 ) }.
% 0.69/1.10 { being_limit_ordinal( skol7 ) }.
% 0.69/1.10 { empty( skol8 ) }.
% 0.69/1.10 { relation( skol8 ) }.
% 0.69/1.10 { empty( X ), ! empty( skol9( Y ) ) }.
% 0.69/1.10 { empty( X ), element( skol9( X ), powerset( X ) ) }.
% 0.69/1.10 { empty( skol10 ) }.
% 0.69/1.10 { element( skol11, positive_rationals ) }.
% 0.69/1.10 { ! empty( skol11 ) }.
% 0.69/1.10 { epsilon_transitive( skol11 ) }.
% 0.69/1.10 { epsilon_connected( skol11 ) }.
% 0.69/1.10 { ordinal( skol11 ) }.
% 0.69/1.10 { empty( skol12( Y ) ) }.
% 0.69/1.10 { relation( skol12( Y ) ) }.
% 0.69/1.10 { function( skol12( Y ) ) }.
% 0.69/1.10 { one_to_one( skol12( Y ) ) }.
% 0.69/1.10 { epsilon_transitive( skol12( Y ) ) }.
% 0.69/1.10 { epsilon_connected( skol12( Y ) ) }.
% 0.69/1.10 { ordinal( skol12( Y ) ) }.
% 0.69/1.10 { natural( skol12( Y ) ) }.
% 0.69/1.10 { finite( skol12( Y ) ) }.
% 0.69/1.10 { element( skol12( X ), powerset( X ) ) }.
% 0.69/1.10 { relation( skol13 ) }.
% 0.69/1.10 { empty( skol13 ) }.
% 0.69/1.10 { function( skol13 ) }.
% 0.69/1.10 { relation( skol14 ) }.
% 0.69/1.10 { function( skol14 ) }.
% 0.69/1.10 { one_to_one( skol14 ) }.
% 0.69/1.10 { empty( skol14 ) }.
% 1.72/2.11 { epsilon_transitive( skol14 ) }.
% 1.72/2.11 { epsilon_connected( skol14 ) }.
% 1.72/2.11 { ordinal( skol14 ) }.
% 1.72/2.11 { relation( skol15 ) }.
% 1.72/2.11 { function( skol15 ) }.
% 1.72/2.11 { transfinite_sequence( skol15 ) }.
% 1.72/2.11 { ordinal_yielding( skol15 ) }.
% 1.72/2.11 { ! empty( skol16 ) }.
% 1.72/2.11 { relation( skol16 ) }.
% 1.72/2.11 { empty( skol17( Y ) ) }.
% 1.72/2.11 { element( skol17( X ), powerset( X ) ) }.
% 1.72/2.11 { ! empty( skol18 ) }.
% 1.72/2.11 { element( skol19, positive_rationals ) }.
% 1.72/2.11 { empty( skol19 ) }.
% 1.72/2.11 { epsilon_transitive( skol19 ) }.
% 1.72/2.11 { epsilon_connected( skol19 ) }.
% 1.72/2.11 { ordinal( skol19 ) }.
% 1.72/2.11 { natural( skol19 ) }.
% 1.72/2.11 { empty( X ), ! empty( skol20( Y ) ) }.
% 1.72/2.11 { empty( X ), finite( skol20( Y ) ) }.
% 1.72/2.11 { empty( X ), element( skol20( X ), powerset( X ) ) }.
% 1.72/2.11 { relation( skol21 ) }.
% 1.72/2.11 { function( skol21 ) }.
% 1.72/2.11 { one_to_one( skol21 ) }.
% 1.72/2.11 { ! empty( skol22 ) }.
% 1.72/2.11 { epsilon_transitive( skol22 ) }.
% 1.72/2.11 { epsilon_connected( skol22 ) }.
% 1.72/2.11 { ordinal( skol22 ) }.
% 1.72/2.11 { relation( skol23 ) }.
% 1.72/2.11 { relation_empty_yielding( skol23 ) }.
% 1.72/2.11 { relation( skol24 ) }.
% 1.72/2.11 { relation_empty_yielding( skol24 ) }.
% 1.72/2.11 { function( skol24 ) }.
% 1.72/2.11 { relation( skol25 ) }.
% 1.72/2.11 { function( skol25 ) }.
% 1.72/2.11 { transfinite_sequence( skol25 ) }.
% 1.72/2.11 { relation( skol26 ) }.
% 1.72/2.11 { relation_non_empty( skol26 ) }.
% 1.72/2.11 { function( skol26 ) }.
% 1.72/2.11 { subset( X, X ) }.
% 1.72/2.11 { ! finite( X ), ! finite( Y ), finite( cartesian_product2( X, Y ) ) }.
% 1.72/2.11 { ! in( X, Y ), element( X, Y ) }.
% 1.72/2.11 { ! finite( X ), ! finite( Y ), ! finite( Z ), finite( cartesian_product3(
% 1.72/2.11 X, Y, Z ) ) }.
% 1.72/2.11 { finite( skol27 ) }.
% 1.72/2.11 { finite( skol28 ) }.
% 1.72/2.11 { finite( skol29 ) }.
% 1.72/2.11 { finite( skol30 ) }.
% 1.72/2.11 { ! finite( cartesian_product4( skol27, skol28, skol29, skol30 ) ) }.
% 1.72/2.11 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 1.72/2.11 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 1.72/2.11 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 1.72/2.11 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 1.72/2.11 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 1.72/2.11 { ! empty( X ), X = empty_set }.
% 1.72/2.11 { ! in( X, Y ), ! empty( Y ) }.
% 1.72/2.11 { ! empty( X ), X = Y, ! empty( Y ) }.
% 1.72/2.11
% 1.72/2.11 percentage equality = 0.013636, percentage horn = 0.951724
% 1.72/2.11 This is a problem with some equality
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 Options Used:
% 1.72/2.11
% 1.72/2.11 useres = 1
% 1.72/2.11 useparamod = 1
% 1.72/2.11 useeqrefl = 1
% 1.72/2.11 useeqfact = 1
% 1.72/2.11 usefactor = 1
% 1.72/2.11 usesimpsplitting = 0
% 1.72/2.11 usesimpdemod = 5
% 1.72/2.11 usesimpres = 3
% 1.72/2.11
% 1.72/2.11 resimpinuse = 1000
% 1.72/2.11 resimpclauses = 20000
% 1.72/2.11 substype = eqrewr
% 1.72/2.11 backwardsubs = 1
% 1.72/2.11 selectoldest = 5
% 1.72/2.11
% 1.72/2.11 litorderings [0] = split
% 1.72/2.11 litorderings [1] = extend the termordering, first sorting on arguments
% 1.72/2.11
% 1.72/2.11 termordering = kbo
% 1.72/2.11
% 1.72/2.11 litapriori = 0
% 1.72/2.11 termapriori = 1
% 1.72/2.11 litaposteriori = 0
% 1.72/2.11 termaposteriori = 0
% 1.72/2.11 demodaposteriori = 0
% 1.72/2.11 ordereqreflfact = 0
% 1.72/2.11
% 1.72/2.11 litselect = negord
% 1.72/2.11
% 1.72/2.11 maxweight = 15
% 1.72/2.11 maxdepth = 30000
% 1.72/2.11 maxlength = 115
% 1.72/2.11 maxnrvars = 195
% 1.72/2.11 excuselevel = 1
% 1.72/2.11 increasemaxweight = 1
% 1.72/2.11
% 1.72/2.11 maxselected = 10000000
% 1.72/2.11 maxnrclauses = 10000000
% 1.72/2.11
% 1.72/2.11 showgenerated = 0
% 1.72/2.11 showkept = 0
% 1.72/2.11 showselected = 0
% 1.72/2.11 showdeleted = 0
% 1.72/2.11 showresimp = 1
% 1.72/2.11 showstatus = 2000
% 1.72/2.11
% 1.72/2.11 prologoutput = 0
% 1.72/2.11 nrgoals = 5000000
% 1.72/2.11 totalproof = 1
% 1.72/2.11
% 1.72/2.11 Symbols occurring in the translation:
% 1.72/2.11
% 1.72/2.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.72/2.11 . [1, 2] (w:1, o:65, a:1, s:1, b:0),
% 1.72/2.11 ! [4, 1] (w:0, o:37, a:1, s:1, b:0),
% 1.72/2.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.72/2.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.72/2.11 in [37, 2] (w:1, o:89, a:1, s:1, b:0),
% 1.72/2.11 ordinal [38, 1] (w:1, o:43, a:1, s:1, b:0),
% 1.72/2.11 element [39, 2] (w:1, o:90, a:1, s:1, b:0),
% 1.72/2.11 epsilon_transitive [40, 1] (w:1, o:44, a:1, s:1, b:0),
% 1.72/2.11 epsilon_connected [41, 1] (w:1, o:45, a:1, s:1, b:0),
% 1.72/2.11 empty [42, 1] (w:1, o:46, a:1, s:1, b:0),
% 1.72/2.11 finite [43, 1] (w:1, o:47, a:1, s:1, b:0),
% 1.72/2.11 function [44, 1] (w:1, o:48, a:1, s:1, b:0),
% 1.72/2.11 relation [45, 1] (w:1, o:49, a:1, s:1, b:0),
% 1.72/2.11 cartesian_product2 [47, 2] (w:1, o:91, a:1, s:1, b:0),
% 1.72/2.11 powerset [48, 1] (w:1, o:52, a:1, s:1, b:0),
% 1.72/2.11 natural [49, 1] (w:1, o:42, a:1, s:1, b:0),
% 1.72/2.11 one_to_one [50, 1] (w:1, o:50, a:1, s:1, b:0),
% 1.72/2.11 positive_rationals [51, 0] (w:1, o:9, a:1, s:1, b:0),
% 1.72/2.11 cartesian_product4 [53, 4] (w:1, o:94, a:1, s:1, b:0),
% 1.72/2.11 cartesian_product3 [54, 3] (w:1, o:93, a:1, s:1, b:0),
% 1.72/2.11 empty_set [55, 0] (w:1, o:11, a:1, s:1, b:0),
% 1.72/2.11 relation_empty_yielding [56, 1] (w:1, o:53, a:1, s:1, b:0),
% 1.72/2.11 function_yielding [57, 1] (w:1, o:54, a:1, s:1, b:0),
% 1.72/2.11 being_limit_ordinal [58, 1] (w:1, o:57, a:1, s:1, b:0),
% 1.72/2.11 transfinite_sequence [59, 1] (w:1, o:63, a:1, s:1, b:0),
% 1.72/2.11 ordinal_yielding [60, 1] (w:1, o:51, a:1, s:1, b:0),
% 1.72/2.11 relation_non_empty [61, 1] (w:1, o:64, a:1, s:1, b:0),
% 1.72/2.11 subset [62, 2] (w:1, o:92, a:1, s:1, b:0),
% 1.72/2.11 alpha1 [63, 1] (w:1, o:55, a:1, s:1, b:1),
% 1.72/2.11 alpha2 [64, 1] (w:1, o:56, a:1, s:1, b:1),
% 1.72/2.11 skol1 [65, 1] (w:1, o:58, a:1, s:1, b:1),
% 1.72/2.11 skol2 [66, 0] (w:1, o:20, a:1, s:1, b:1),
% 1.72/2.11 skol3 [67, 0] (w:1, o:30, a:1, s:1, b:1),
% 1.72/2.11 skol4 [68, 0] (w:1, o:32, a:1, s:1, b:1),
% 1.72/2.11 skol5 [69, 0] (w:1, o:33, a:1, s:1, b:1),
% 1.72/2.11 skol6 [70, 0] (w:1, o:34, a:1, s:1, b:1),
% 1.72/2.11 skol7 [71, 0] (w:1, o:35, a:1, s:1, b:1),
% 1.72/2.11 skol8 [72, 0] (w:1, o:36, a:1, s:1, b:1),
% 1.72/2.11 skol9 [73, 1] (w:1, o:59, a:1, s:1, b:1),
% 1.72/2.11 skol10 [74, 0] (w:1, o:12, a:1, s:1, b:1),
% 1.72/2.11 skol11 [75, 0] (w:1, o:13, a:1, s:1, b:1),
% 1.72/2.11 skol12 [76, 1] (w:1, o:60, a:1, s:1, b:1),
% 1.72/2.11 skol13 [77, 0] (w:1, o:14, a:1, s:1, b:1),
% 1.72/2.11 skol14 [78, 0] (w:1, o:15, a:1, s:1, b:1),
% 1.72/2.11 skol15 [79, 0] (w:1, o:16, a:1, s:1, b:1),
% 1.72/2.11 skol16 [80, 0] (w:1, o:17, a:1, s:1, b:1),
% 1.72/2.11 skol17 [81, 1] (w:1, o:61, a:1, s:1, b:1),
% 1.72/2.11 skol18 [82, 0] (w:1, o:18, a:1, s:1, b:1),
% 1.72/2.11 skol19 [83, 0] (w:1, o:19, a:1, s:1, b:1),
% 1.72/2.11 skol20 [84, 1] (w:1, o:62, a:1, s:1, b:1),
% 1.72/2.11 skol21 [85, 0] (w:1, o:21, a:1, s:1, b:1),
% 1.72/2.11 skol22 [86, 0] (w:1, o:22, a:1, s:1, b:1),
% 1.72/2.11 skol23 [87, 0] (w:1, o:23, a:1, s:1, b:1),
% 1.72/2.11 skol24 [88, 0] (w:1, o:24, a:1, s:1, b:1),
% 1.72/2.11 skol25 [89, 0] (w:1, o:25, a:1, s:1, b:1),
% 1.72/2.11 skol26 [90, 0] (w:1, o:26, a:1, s:1, b:1),
% 1.72/2.11 skol27 [91, 0] (w:1, o:27, a:1, s:1, b:1),
% 1.72/2.11 skol28 [92, 0] (w:1, o:28, a:1, s:1, b:1),
% 1.72/2.11 skol29 [93, 0] (w:1, o:29, a:1, s:1, b:1),
% 1.72/2.11 skol30 [94, 0] (w:1, o:31, a:1, s:1, b:1).
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 Starting Search:
% 1.72/2.11
% 1.72/2.11 *** allocated 15000 integers for clauses
% 1.72/2.11 *** allocated 22500 integers for clauses
% 1.72/2.11 *** allocated 33750 integers for clauses
% 1.72/2.11 *** allocated 50625 integers for clauses
% 1.72/2.11 *** allocated 15000 integers for termspace/termends
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11 *** allocated 75937 integers for clauses
% 1.72/2.11 *** allocated 22500 integers for termspace/termends
% 1.72/2.11 *** allocated 113905 integers for clauses
% 1.72/2.11 *** allocated 33750 integers for termspace/termends
% 1.72/2.11
% 1.72/2.11 Intermediate Status:
% 1.72/2.11 Generated: 4417
% 1.72/2.11 Kept: 2002
% 1.72/2.11 Inuse: 269
% 1.72/2.11 Deleted: 9
% 1.72/2.11 Deletedinuse: 1
% 1.72/2.11
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11 *** allocated 170857 integers for clauses
% 1.72/2.11 *** allocated 50625 integers for termspace/termends
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11 *** allocated 256285 integers for clauses
% 1.72/2.11
% 1.72/2.11 Intermediate Status:
% 1.72/2.11 Generated: 10038
% 1.72/2.11 Kept: 4015
% 1.72/2.11 Inuse: 403
% 1.72/2.11 Deleted: 117
% 1.72/2.11 Deletedinuse: 94
% 1.72/2.11
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11 *** allocated 75937 integers for termspace/termends
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11 *** allocated 384427 integers for clauses
% 1.72/2.11
% 1.72/2.11 Intermediate Status:
% 1.72/2.11 Generated: 15128
% 1.72/2.11 Kept: 6029
% 1.72/2.11 Inuse: 583
% 1.72/2.11 Deleted: 156
% 1.72/2.11 Deletedinuse: 94
% 1.72/2.11
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11 *** allocated 113905 integers for termspace/termends
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 Intermediate Status:
% 1.72/2.11 Generated: 18924
% 1.72/2.11 Kept: 8057
% 1.72/2.11 Inuse: 650
% 1.72/2.11 Deleted: 170
% 1.72/2.11 Deletedinuse: 98
% 1.72/2.11
% 1.72/2.11 *** allocated 576640 integers for clauses
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11 *** allocated 170857 integers for termspace/termends
% 1.72/2.11
% 1.72/2.11 Intermediate Status:
% 1.72/2.11 Generated: 23240
% 1.72/2.11 Kept: 10064
% 1.72/2.11 Inuse: 724
% 1.72/2.11 Deleted: 180
% 1.72/2.11 Deletedinuse: 98
% 1.72/2.11
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 Intermediate Status:
% 1.72/2.11 Generated: 25976
% 1.72/2.11 Kept: 12072
% 1.72/2.11 Inuse: 756
% 1.72/2.11 Deleted: 180
% 1.72/2.11 Deletedinuse: 98
% 1.72/2.11
% 1.72/2.11 *** allocated 864960 integers for clauses
% 1.72/2.11 Resimplifying inuse:
% 1.72/2.11 Done
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 Bliksems!, er is een bewijs:
% 1.72/2.11 % SZS status Theorem
% 1.72/2.11 % SZS output start Refutation
% 1.72/2.11
% 1.72/2.11 (28) {G0,W12,D4,L1,V4,M1} I { cartesian_product2( cartesian_product3( X, Y
% 1.72/2.11 , Z ), T ) ==> cartesian_product4( X, Y, Z, T ) }.
% 1.72/2.11 (33) {G0,W8,D3,L3,V2,M3} I { ! finite( X ), ! finite( Y ), finite(
% 1.72/2.11 cartesian_product2( X, Y ) ) }.
% 1.72/2.11 (34) {G0,W11,D3,L4,V3,M4} I { ! finite( X ), ! finite( Y ), ! finite( Z ),
% 1.72/2.11 finite( cartesian_product3( X, Y, Z ) ) }.
% 1.72/2.11 (132) {G0,W2,D2,L1,V0,M1} I { finite( skol27 ) }.
% 1.72/2.11 (133) {G0,W2,D2,L1,V0,M1} I { finite( skol28 ) }.
% 1.72/2.11 (134) {G0,W2,D2,L1,V0,M1} I { finite( skol29 ) }.
% 1.72/2.11 (135) {G0,W2,D2,L1,V0,M1} I { finite( skol30 ) }.
% 1.72/2.11 (136) {G0,W6,D3,L1,V0,M1} I { ! finite( cartesian_product4( skol27, skol28
% 1.72/2.11 , skol29, skol30 ) ) }.
% 1.72/2.11 (361) {G1,W13,D3,L3,V4,M3} P(28,33) { ! finite( cartesian_product3( X, Y, Z
% 1.72/2.11 ) ), ! finite( T ), finite( cartesian_product4( X, Y, Z, T ) ) }.
% 1.72/2.11 (13000) {G2,W5,D3,L1,V0,M1} R(361,136);r(135) { ! finite(
% 1.72/2.11 cartesian_product3( skol27, skol28, skol29 ) ) }.
% 1.72/2.11 (13024) {G3,W4,D2,L2,V0,M2} R(13000,34);r(132) { ! finite( skol28 ), !
% 1.72/2.11 finite( skol29 ) }.
% 1.72/2.11 (13037) {G4,W0,D0,L0,V0,M0} S(13024);r(133);r(134) { }.
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 % SZS output end Refutation
% 1.72/2.11 found a proof!
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 Unprocessed initial clauses:
% 1.72/2.11
% 1.72/2.11 (13039) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 1.72/2.11 (13040) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! element( Y, X ),
% 1.72/2.11 epsilon_transitive( Y ) }.
% 1.72/2.11 (13041) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! element( Y, X ),
% 1.72/2.11 epsilon_connected( Y ) }.
% 1.72/2.11 (13042) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! element( Y, X ), ordinal(
% 1.72/2.11 Y ) }.
% 1.72/2.11 (13043) {G0,W4,D2,L2,V1,M2} { ! empty( X ), finite( X ) }.
% 1.72/2.11 (13044) {G0,W4,D2,L2,V1,M2} { ! empty( X ), function( X ) }.
% 1.72/2.11 (13045) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_transitive( X ) }.
% 1.72/2.11 (13046) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_connected( X ) }.
% 1.72/2.11 (13047) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 1.72/2.11 (13048) {G0,W8,D4,L2,V3,M2} { ! element( X, powerset( cartesian_product2(
% 1.72/2.11 Y, Z ) ) ), relation( X ) }.
% 1.72/2.11 (13049) {G0,W6,D2,L3,V1,M3} { ! empty( X ), ! ordinal( X ), alpha1( X )
% 1.72/2.11 }.
% 1.72/2.11 (13050) {G0,W6,D2,L3,V1,M3} { ! empty( X ), ! ordinal( X ), natural( X )
% 1.72/2.11 }.
% 1.72/2.11 (13051) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), epsilon_transitive( X ) }.
% 1.72/2.11 (13052) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), epsilon_connected( X ) }.
% 1.72/2.11 (13053) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), ordinal( X ) }.
% 1.72/2.11 (13054) {G0,W8,D2,L4,V1,M4} { ! epsilon_transitive( X ), !
% 1.72/2.11 epsilon_connected( X ), ! ordinal( X ), alpha1( X ) }.
% 1.72/2.11 (13055) {G0,W8,D3,L3,V2,M3} { ! finite( X ), ! element( Y, powerset( X ) )
% 1.72/2.11 , finite( Y ) }.
% 1.72/2.11 (13056) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X
% 1.72/2.11 ), relation( X ) }.
% 1.72/2.11 (13057) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X
% 1.72/2.11 ), function( X ) }.
% 1.72/2.11 (13058) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X
% 1.72/2.11 ), one_to_one( X ) }.
% 1.72/2.11 (13059) {G0,W6,D2,L3,V1,M3} { ! epsilon_transitive( X ), !
% 1.72/2.11 epsilon_connected( X ), ordinal( X ) }.
% 1.72/2.11 (13060) {G0,W4,D2,L2,V1,M2} { ! empty( X ), epsilon_transitive( X ) }.
% 1.72/2.11 (13061) {G0,W4,D2,L2,V1,M2} { ! empty( X ), epsilon_connected( X ) }.
% 1.72/2.11 (13062) {G0,W4,D2,L2,V1,M2} { ! empty( X ), ordinal( X ) }.
% 1.72/2.11 (13063) {G0,W7,D2,L3,V1,M3} { ! element( X, positive_rationals ), !
% 1.72/2.11 ordinal( X ), alpha2( X ) }.
% 1.72/2.11 (13064) {G0,W7,D2,L3,V1,M3} { ! element( X, positive_rationals ), !
% 1.72/2.11 ordinal( X ), natural( X ) }.
% 1.72/2.11 (13065) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), epsilon_transitive( X ) }.
% 1.72/2.11 (13066) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), epsilon_connected( X ) }.
% 1.72/2.11 (13067) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), ordinal( X ) }.
% 1.72/2.11 (13068) {G0,W8,D2,L4,V1,M4} { ! epsilon_transitive( X ), !
% 1.72/2.11 epsilon_connected( X ), ! ordinal( X ), alpha2( X ) }.
% 1.72/2.11 (13069) {G0,W12,D4,L1,V4,M1} { cartesian_product4( X, Y, Z, T ) =
% 1.72/2.11 cartesian_product2( cartesian_product3( X, Y, Z ), T ) }.
% 1.72/2.11 (13070) {G0,W4,D3,L1,V1,M1} { element( skol1( X ), X ) }.
% 1.72/2.11 (13071) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 1.72/2.11 (13072) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 1.72/2.11 (13073) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 1.72/2.11 (13074) {G0,W8,D3,L3,V2,M3} { ! finite( X ), ! finite( Y ), finite(
% 1.72/2.11 cartesian_product2( X, Y ) ) }.
% 1.72/2.11 (13075) {G0,W11,D3,L4,V3,M4} { ! finite( X ), ! finite( Y ), ! finite( Z )
% 1.72/2.11 , finite( cartesian_product3( X, Y, Z ) ) }.
% 1.72/2.11 (13076) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 1.72/2.11 (13077) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 1.72/2.11 (13078) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 1.72/2.11 (13079) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 1.72/2.11 (13080) {G0,W2,D2,L1,V0,M1} { function( empty_set ) }.
% 1.72/2.11 (13081) {G0,W2,D2,L1,V0,M1} { one_to_one( empty_set ) }.
% 1.72/2.11 (13082) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 1.72/2.11 (13083) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( empty_set ) }.
% 1.72/2.11 (13084) {G0,W2,D2,L1,V0,M1} { epsilon_connected( empty_set ) }.
% 1.72/2.11 (13085) {G0,W2,D2,L1,V0,M1} { ordinal( empty_set ) }.
% 1.72/2.11 (13086) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 1.72/2.11 (13087) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 1.72/2.11 (13088) {G0,W8,D3,L3,V2,M3} { empty( X ), empty( Y ), ! empty(
% 1.72/2.11 cartesian_product2( X, Y ) ) }.
% 1.72/2.11 (13089) {G0,W11,D3,L4,V3,M4} { empty( X ), empty( Y ), empty( Z ), ! empty
% 1.72/2.11 ( cartesian_product3( X, Y, Z ) ) }.
% 1.72/2.11 (13090) {G0,W14,D3,L5,V4,M5} { empty( X ), empty( Y ), empty( Z ), empty(
% 1.72/2.11 T ), ! empty( cartesian_product4( X, Y, Z, T ) ) }.
% 1.72/2.11 (13091) {G0,W2,D2,L1,V0,M1} { ! empty( positive_rationals ) }.
% 1.72/2.11 (13092) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 1.72/2.11 (13093) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol2 ) }.
% 1.72/2.11 (13094) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol2 ) }.
% 1.72/2.11 (13095) {G0,W2,D2,L1,V0,M1} { ordinal( skol2 ) }.
% 1.72/2.11 (13096) {G0,W2,D2,L1,V0,M1} { natural( skol2 ) }.
% 1.72/2.11 (13097) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 1.72/2.11 (13098) {G0,W2,D2,L1,V0,M1} { finite( skol3 ) }.
% 1.72/2.11 (13099) {G0,W2,D2,L1,V0,M1} { relation( skol4 ) }.
% 1.72/2.11 (13100) {G0,W2,D2,L1,V0,M1} { function( skol4 ) }.
% 1.72/2.11 (13101) {G0,W2,D2,L1,V0,M1} { function_yielding( skol4 ) }.
% 1.72/2.11 (13102) {G0,W2,D2,L1,V0,M1} { relation( skol5 ) }.
% 1.72/2.11 (13103) {G0,W2,D2,L1,V0,M1} { function( skol5 ) }.
% 1.72/2.11 (13104) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol6 ) }.
% 1.72/2.11 (13105) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol6 ) }.
% 1.72/2.11 (13106) {G0,W2,D2,L1,V0,M1} { ordinal( skol6 ) }.
% 1.72/2.11 (13107) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol7 ) }.
% 1.72/2.11 (13108) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol7 ) }.
% 1.72/2.11 (13109) {G0,W2,D2,L1,V0,M1} { ordinal( skol7 ) }.
% 1.72/2.11 (13110) {G0,W2,D2,L1,V0,M1} { being_limit_ordinal( skol7 ) }.
% 1.72/2.11 (13111) {G0,W2,D2,L1,V0,M1} { empty( skol8 ) }.
% 1.72/2.11 (13112) {G0,W2,D2,L1,V0,M1} { relation( skol8 ) }.
% 1.72/2.11 (13113) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol9( Y ) ) }.
% 1.72/2.11 (13114) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol9( X ), powerset( X
% 1.72/2.11 ) ) }.
% 1.72/2.11 (13115) {G0,W2,D2,L1,V0,M1} { empty( skol10 ) }.
% 1.72/2.11 (13116) {G0,W3,D2,L1,V0,M1} { element( skol11, positive_rationals ) }.
% 1.72/2.11 (13117) {G0,W2,D2,L1,V0,M1} { ! empty( skol11 ) }.
% 1.72/2.11 (13118) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol11 ) }.
% 1.72/2.11 (13119) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol11 ) }.
% 1.72/2.11 (13120) {G0,W2,D2,L1,V0,M1} { ordinal( skol11 ) }.
% 1.72/2.11 (13121) {G0,W3,D3,L1,V1,M1} { empty( skol12( Y ) ) }.
% 1.72/2.11 (13122) {G0,W3,D3,L1,V1,M1} { relation( skol12( Y ) ) }.
% 1.72/2.11 (13123) {G0,W3,D3,L1,V1,M1} { function( skol12( Y ) ) }.
% 1.72/2.11 (13124) {G0,W3,D3,L1,V1,M1} { one_to_one( skol12( Y ) ) }.
% 1.72/2.11 (13125) {G0,W3,D3,L1,V1,M1} { epsilon_transitive( skol12( Y ) ) }.
% 1.72/2.11 (13126) {G0,W3,D3,L1,V1,M1} { epsilon_connected( skol12( Y ) ) }.
% 1.72/2.11 (13127) {G0,W3,D3,L1,V1,M1} { ordinal( skol12( Y ) ) }.
% 1.72/2.11 (13128) {G0,W3,D3,L1,V1,M1} { natural( skol12( Y ) ) }.
% 1.72/2.11 (13129) {G0,W3,D3,L1,V1,M1} { finite( skol12( Y ) ) }.
% 1.72/2.11 (13130) {G0,W5,D3,L1,V1,M1} { element( skol12( X ), powerset( X ) ) }.
% 1.72/2.11 (13131) {G0,W2,D2,L1,V0,M1} { relation( skol13 ) }.
% 1.72/2.11 (13132) {G0,W2,D2,L1,V0,M1} { empty( skol13 ) }.
% 1.72/2.11 (13133) {G0,W2,D2,L1,V0,M1} { function( skol13 ) }.
% 1.72/2.11 (13134) {G0,W2,D2,L1,V0,M1} { relation( skol14 ) }.
% 1.72/2.11 (13135) {G0,W2,D2,L1,V0,M1} { function( skol14 ) }.
% 1.72/2.11 (13136) {G0,W2,D2,L1,V0,M1} { one_to_one( skol14 ) }.
% 1.72/2.11 (13137) {G0,W2,D2,L1,V0,M1} { empty( skol14 ) }.
% 1.72/2.11 (13138) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol14 ) }.
% 1.72/2.11 (13139) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol14 ) }.
% 1.72/2.11 (13140) {G0,W2,D2,L1,V0,M1} { ordinal( skol14 ) }.
% 1.72/2.11 (13141) {G0,W2,D2,L1,V0,M1} { relation( skol15 ) }.
% 1.72/2.11 (13142) {G0,W2,D2,L1,V0,M1} { function( skol15 ) }.
% 1.72/2.11 (13143) {G0,W2,D2,L1,V0,M1} { transfinite_sequence( skol15 ) }.
% 1.72/2.11 (13144) {G0,W2,D2,L1,V0,M1} { ordinal_yielding( skol15 ) }.
% 1.72/2.11 (13145) {G0,W2,D2,L1,V0,M1} { ! empty( skol16 ) }.
% 1.72/2.11 (13146) {G0,W2,D2,L1,V0,M1} { relation( skol16 ) }.
% 1.72/2.11 (13147) {G0,W3,D3,L1,V1,M1} { empty( skol17( Y ) ) }.
% 1.72/2.11 (13148) {G0,W5,D3,L1,V1,M1} { element( skol17( X ), powerset( X ) ) }.
% 1.72/2.11 (13149) {G0,W2,D2,L1,V0,M1} { ! empty( skol18 ) }.
% 1.72/2.11 (13150) {G0,W3,D2,L1,V0,M1} { element( skol19, positive_rationals ) }.
% 1.72/2.11 (13151) {G0,W2,D2,L1,V0,M1} { empty( skol19 ) }.
% 1.72/2.11 (13152) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol19 ) }.
% 1.72/2.11 (13153) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol19 ) }.
% 1.72/2.11 (13154) {G0,W2,D2,L1,V0,M1} { ordinal( skol19 ) }.
% 1.72/2.11 (13155) {G0,W2,D2,L1,V0,M1} { natural( skol19 ) }.
% 1.72/2.11 (13156) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol20( Y ) ) }.
% 1.72/2.11 (13157) {G0,W5,D3,L2,V2,M2} { empty( X ), finite( skol20( Y ) ) }.
% 1.72/2.11 (13158) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol20( X ), powerset(
% 1.72/2.11 X ) ) }.
% 1.72/2.11 (13159) {G0,W2,D2,L1,V0,M1} { relation( skol21 ) }.
% 1.72/2.11 (13160) {G0,W2,D2,L1,V0,M1} { function( skol21 ) }.
% 1.72/2.11 (13161) {G0,W2,D2,L1,V0,M1} { one_to_one( skol21 ) }.
% 1.72/2.11 (13162) {G0,W2,D2,L1,V0,M1} { ! empty( skol22 ) }.
% 1.72/2.11 (13163) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol22 ) }.
% 1.72/2.11 (13164) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol22 ) }.
% 1.72/2.11 (13165) {G0,W2,D2,L1,V0,M1} { ordinal( skol22 ) }.
% 1.72/2.11 (13166) {G0,W2,D2,L1,V0,M1} { relation( skol23 ) }.
% 1.72/2.11 (13167) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol23 ) }.
% 1.72/2.11 (13168) {G0,W2,D2,L1,V0,M1} { relation( skol24 ) }.
% 1.72/2.11 (13169) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol24 ) }.
% 1.72/2.11 (13170) {G0,W2,D2,L1,V0,M1} { function( skol24 ) }.
% 1.72/2.11 (13171) {G0,W2,D2,L1,V0,M1} { relation( skol25 ) }.
% 1.72/2.11 (13172) {G0,W2,D2,L1,V0,M1} { function( skol25 ) }.
% 1.72/2.11 (13173) {G0,W2,D2,L1,V0,M1} { transfinite_sequence( skol25 ) }.
% 1.72/2.11 (13174) {G0,W2,D2,L1,V0,M1} { relation( skol26 ) }.
% 1.72/2.11 (13175) {G0,W2,D2,L1,V0,M1} { relation_non_empty( skol26 ) }.
% 1.72/2.11 (13176) {G0,W2,D2,L1,V0,M1} { function( skol26 ) }.
% 1.72/2.11 (13177) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 1.72/2.11 (13178) {G0,W8,D3,L3,V2,M3} { ! finite( X ), ! finite( Y ), finite(
% 1.72/2.11 cartesian_product2( X, Y ) ) }.
% 1.72/2.11 (13179) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 1.72/2.11 (13180) {G0,W11,D3,L4,V3,M4} { ! finite( X ), ! finite( Y ), ! finite( Z )
% 1.72/2.11 , finite( cartesian_product3( X, Y, Z ) ) }.
% 1.72/2.11 (13181) {G0,W2,D2,L1,V0,M1} { finite( skol27 ) }.
% 1.72/2.11 (13182) {G0,W2,D2,L1,V0,M1} { finite( skol28 ) }.
% 1.72/2.11 (13183) {G0,W2,D2,L1,V0,M1} { finite( skol29 ) }.
% 1.72/2.11 (13184) {G0,W2,D2,L1,V0,M1} { finite( skol30 ) }.
% 1.72/2.11 (13185) {G0,W6,D3,L1,V0,M1} { ! finite( cartesian_product4( skol27, skol28
% 1.72/2.11 , skol29, skol30 ) ) }.
% 1.72/2.11 (13186) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y )
% 1.72/2.11 }.
% 1.72/2.11 (13187) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y
% 1.72/2.11 ) }.
% 1.72/2.11 (13188) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y )
% 1.72/2.11 ) }.
% 1.72/2.11 (13189) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) )
% 1.72/2.11 , element( X, Y ) }.
% 1.72/2.11 (13190) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) )
% 1.72/2.11 , ! empty( Z ) }.
% 1.72/2.11 (13191) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 1.72/2.11 (13192) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 1.72/2.11 (13193) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 Total Proof:
% 1.72/2.11
% 1.72/2.11 eqswap: (13195) {G0,W12,D4,L1,V4,M1} { cartesian_product2(
% 1.72/2.11 cartesian_product3( X, Y, Z ), T ) = cartesian_product4( X, Y, Z, T ) }.
% 1.72/2.11 parent0[0]: (13069) {G0,W12,D4,L1,V4,M1} { cartesian_product4( X, Y, Z, T
% 1.72/2.11 ) = cartesian_product2( cartesian_product3( X, Y, Z ), T ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 X := X
% 1.72/2.11 Y := Y
% 1.72/2.11 Z := Z
% 1.72/2.11 T := T
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (28) {G0,W12,D4,L1,V4,M1} I { cartesian_product2(
% 1.72/2.11 cartesian_product3( X, Y, Z ), T ) ==> cartesian_product4( X, Y, Z, T )
% 1.72/2.11 }.
% 1.72/2.11 parent0: (13195) {G0,W12,D4,L1,V4,M1} { cartesian_product2(
% 1.72/2.11 cartesian_product3( X, Y, Z ), T ) = cartesian_product4( X, Y, Z, T ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 X := X
% 1.72/2.11 Y := Y
% 1.72/2.11 Z := Z
% 1.72/2.11 T := T
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (33) {G0,W8,D3,L3,V2,M3} I { ! finite( X ), ! finite( Y ),
% 1.72/2.11 finite( cartesian_product2( X, Y ) ) }.
% 1.72/2.11 parent0: (13074) {G0,W8,D3,L3,V2,M3} { ! finite( X ), ! finite( Y ),
% 1.72/2.11 finite( cartesian_product2( X, Y ) ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 X := X
% 1.72/2.11 Y := Y
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 1 ==> 1
% 1.72/2.11 2 ==> 2
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (34) {G0,W11,D3,L4,V3,M4} I { ! finite( X ), ! finite( Y ), !
% 1.72/2.11 finite( Z ), finite( cartesian_product3( X, Y, Z ) ) }.
% 1.72/2.11 parent0: (13075) {G0,W11,D3,L4,V3,M4} { ! finite( X ), ! finite( Y ), !
% 1.72/2.11 finite( Z ), finite( cartesian_product3( X, Y, Z ) ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 X := X
% 1.72/2.11 Y := Y
% 1.72/2.11 Z := Z
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 1 ==> 1
% 1.72/2.11 2 ==> 2
% 1.72/2.11 3 ==> 3
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (132) {G0,W2,D2,L1,V0,M1} I { finite( skol27 ) }.
% 1.72/2.11 parent0: (13181) {G0,W2,D2,L1,V0,M1} { finite( skol27 ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (133) {G0,W2,D2,L1,V0,M1} I { finite( skol28 ) }.
% 1.72/2.11 parent0: (13182) {G0,W2,D2,L1,V0,M1} { finite( skol28 ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (134) {G0,W2,D2,L1,V0,M1} I { finite( skol29 ) }.
% 1.72/2.11 parent0: (13183) {G0,W2,D2,L1,V0,M1} { finite( skol29 ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (135) {G0,W2,D2,L1,V0,M1} I { finite( skol30 ) }.
% 1.72/2.11 parent0: (13184) {G0,W2,D2,L1,V0,M1} { finite( skol30 ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (136) {G0,W6,D3,L1,V0,M1} I { ! finite( cartesian_product4(
% 1.72/2.11 skol27, skol28, skol29, skol30 ) ) }.
% 1.72/2.11 parent0: (13185) {G0,W6,D3,L1,V0,M1} { ! finite( cartesian_product4(
% 1.72/2.11 skol27, skol28, skol29, skol30 ) ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 paramod: (13362) {G1,W13,D3,L3,V4,M3} { finite( cartesian_product4( X, Y,
% 1.72/2.11 Z, T ) ), ! finite( cartesian_product3( X, Y, Z ) ), ! finite( T ) }.
% 1.72/2.11 parent0[0]: (28) {G0,W12,D4,L1,V4,M1} I { cartesian_product2(
% 1.72/2.11 cartesian_product3( X, Y, Z ), T ) ==> cartesian_product4( X, Y, Z, T )
% 1.72/2.11 }.
% 1.72/2.11 parent1[2; 1]: (33) {G0,W8,D3,L3,V2,M3} I { ! finite( X ), ! finite( Y ),
% 1.72/2.11 finite( cartesian_product2( X, Y ) ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 X := X
% 1.72/2.11 Y := Y
% 1.72/2.11 Z := Z
% 1.72/2.11 T := T
% 1.72/2.11 end
% 1.72/2.11 substitution1:
% 1.72/2.11 X := cartesian_product3( X, Y, Z )
% 1.72/2.11 Y := T
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (361) {G1,W13,D3,L3,V4,M3} P(28,33) { ! finite(
% 1.72/2.11 cartesian_product3( X, Y, Z ) ), ! finite( T ), finite(
% 1.72/2.11 cartesian_product4( X, Y, Z, T ) ) }.
% 1.72/2.11 parent0: (13362) {G1,W13,D3,L3,V4,M3} { finite( cartesian_product4( X, Y,
% 1.72/2.11 Z, T ) ), ! finite( cartesian_product3( X, Y, Z ) ), ! finite( T ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 X := X
% 1.72/2.11 Y := Y
% 1.72/2.11 Z := Z
% 1.72/2.11 T := T
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 2
% 1.72/2.11 1 ==> 0
% 1.72/2.11 2 ==> 1
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 resolution: (13364) {G1,W7,D3,L2,V0,M2} { ! finite( cartesian_product3(
% 1.72/2.11 skol27, skol28, skol29 ) ), ! finite( skol30 ) }.
% 1.72/2.11 parent0[0]: (136) {G0,W6,D3,L1,V0,M1} I { ! finite( cartesian_product4(
% 1.72/2.11 skol27, skol28, skol29, skol30 ) ) }.
% 1.72/2.11 parent1[2]: (361) {G1,W13,D3,L3,V4,M3} P(28,33) { ! finite(
% 1.72/2.11 cartesian_product3( X, Y, Z ) ), ! finite( T ), finite(
% 1.72/2.11 cartesian_product4( X, Y, Z, T ) ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 substitution1:
% 1.72/2.11 X := skol27
% 1.72/2.11 Y := skol28
% 1.72/2.11 Z := skol29
% 1.72/2.11 T := skol30
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 resolution: (13365) {G1,W5,D3,L1,V0,M1} { ! finite( cartesian_product3(
% 1.72/2.11 skol27, skol28, skol29 ) ) }.
% 1.72/2.11 parent0[1]: (13364) {G1,W7,D3,L2,V0,M2} { ! finite( cartesian_product3(
% 1.72/2.11 skol27, skol28, skol29 ) ), ! finite( skol30 ) }.
% 1.72/2.11 parent1[0]: (135) {G0,W2,D2,L1,V0,M1} I { finite( skol30 ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 substitution1:
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (13000) {G2,W5,D3,L1,V0,M1} R(361,136);r(135) { ! finite(
% 1.72/2.11 cartesian_product3( skol27, skol28, skol29 ) ) }.
% 1.72/2.11 parent0: (13365) {G1,W5,D3,L1,V0,M1} { ! finite( cartesian_product3(
% 1.72/2.11 skol27, skol28, skol29 ) ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 resolution: (13366) {G1,W6,D2,L3,V0,M3} { ! finite( skol27 ), ! finite(
% 1.72/2.11 skol28 ), ! finite( skol29 ) }.
% 1.72/2.11 parent0[0]: (13000) {G2,W5,D3,L1,V0,M1} R(361,136);r(135) { ! finite(
% 1.72/2.11 cartesian_product3( skol27, skol28, skol29 ) ) }.
% 1.72/2.11 parent1[3]: (34) {G0,W11,D3,L4,V3,M4} I { ! finite( X ), ! finite( Y ), !
% 1.72/2.11 finite( Z ), finite( cartesian_product3( X, Y, Z ) ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 substitution1:
% 1.72/2.11 X := skol27
% 1.72/2.11 Y := skol28
% 1.72/2.11 Z := skol29
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 resolution: (13367) {G1,W4,D2,L2,V0,M2} { ! finite( skol28 ), ! finite(
% 1.72/2.11 skol29 ) }.
% 1.72/2.11 parent0[0]: (13366) {G1,W6,D2,L3,V0,M3} { ! finite( skol27 ), ! finite(
% 1.72/2.11 skol28 ), ! finite( skol29 ) }.
% 1.72/2.11 parent1[0]: (132) {G0,W2,D2,L1,V0,M1} I { finite( skol27 ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 substitution1:
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (13024) {G3,W4,D2,L2,V0,M2} R(13000,34);r(132) { ! finite(
% 1.72/2.11 skol28 ), ! finite( skol29 ) }.
% 1.72/2.11 parent0: (13367) {G1,W4,D2,L2,V0,M2} { ! finite( skol28 ), ! finite(
% 1.72/2.11 skol29 ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 0 ==> 0
% 1.72/2.11 1 ==> 1
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 resolution: (13368) {G1,W2,D2,L1,V0,M1} { ! finite( skol29 ) }.
% 1.72/2.11 parent0[0]: (13024) {G3,W4,D2,L2,V0,M2} R(13000,34);r(132) { ! finite(
% 1.72/2.11 skol28 ), ! finite( skol29 ) }.
% 1.72/2.11 parent1[0]: (133) {G0,W2,D2,L1,V0,M1} I { finite( skol28 ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 substitution1:
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 resolution: (13369) {G1,W0,D0,L0,V0,M0} { }.
% 1.72/2.11 parent0[0]: (13368) {G1,W2,D2,L1,V0,M1} { ! finite( skol29 ) }.
% 1.72/2.11 parent1[0]: (134) {G0,W2,D2,L1,V0,M1} I { finite( skol29 ) }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 substitution1:
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 subsumption: (13037) {G4,W0,D0,L0,V0,M0} S(13024);r(133);r(134) { }.
% 1.72/2.11 parent0: (13369) {G1,W0,D0,L0,V0,M0} { }.
% 1.72/2.11 substitution0:
% 1.72/2.11 end
% 1.72/2.11 permutation0:
% 1.72/2.11 end
% 1.72/2.11
% 1.72/2.11 Proof check complete!
% 1.72/2.11
% 1.72/2.11 Memory use:
% 1.72/2.11
% 1.72/2.11 space for terms: 149854
% 1.72/2.11 space for clauses: 618181
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 clauses generated: 27333
% 1.72/2.11 clauses kept: 13038
% 1.72/2.11 clauses selected: 770
% 1.72/2.11 clauses deleted: 181
% 1.72/2.11 clauses inuse deleted: 98
% 1.72/2.11
% 1.72/2.11 subsentry: 151963
% 1.72/2.11 literals s-matched: 52116
% 1.72/2.11 literals matched: 46546
% 1.72/2.11 full subsumption: 13740
% 1.72/2.11
% 1.72/2.11 checksum: -727170524
% 1.72/2.11
% 1.72/2.11
% 1.72/2.11 Bliksem ended
%------------------------------------------------------------------------------