%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM533+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n013.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 06:23:19 EDT 2022
% Result : Theorem 0.72s 1.11s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM533+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Wed Jul 6 03:16:44 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.72/1.11 *** allocated 10000 integers for termspace/termends
% 0.72/1.11 *** allocated 10000 integers for clauses
% 0.72/1.11 *** allocated 10000 integers for justifications
% 0.72/1.11 Bliksem 1.12
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Automatic Strategy Selection
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Clauses:
% 0.72/1.11
% 0.72/1.11 { && }.
% 0.72/1.11 { && }.
% 0.72/1.11 { ! aSet0( X ), ! aElementOf0( Y, X ), aElement0( Y ) }.
% 0.72/1.11 { && }.
% 0.72/1.11 { ! X = slcrc0, aSet0( X ) }.
% 0.72/1.11 { ! X = slcrc0, ! aElementOf0( Y, X ) }.
% 0.72/1.11 { ! aSet0( X ), aElementOf0( skol1( X ), X ), X = slcrc0 }.
% 0.72/1.11 { isFinite0( slcrc0 ) }.
% 0.72/1.11 { && }.
% 0.72/1.11 { ! aSet0( X ), ! isCountable0( X ), ! isFinite0( X ) }.
% 0.72/1.11 { ! aSet0( X ), ! isCountable0( X ), ! X = slcrc0 }.
% 0.72/1.11 { ! aSet0( X ), ! aSubsetOf0( Y, X ), aSet0( Y ) }.
% 0.72/1.11 { ! aSet0( X ), ! aSubsetOf0( Y, X ), alpha1( X, Y ) }.
% 0.72/1.11 { ! aSet0( X ), ! aSet0( Y ), ! alpha1( X, Y ), aSubsetOf0( Y, X ) }.
% 0.72/1.11 { ! alpha1( X, Y ), ! aElementOf0( Z, Y ), aElementOf0( Z, X ) }.
% 0.72/1.11 { aElementOf0( skol2( Z, Y ), Y ), alpha1( X, Y ) }.
% 0.72/1.11 { ! aElementOf0( skol2( X, Y ), X ), alpha1( X, Y ) }.
% 0.72/1.11 { ! aSet0( X ), ! isFinite0( X ), ! aSubsetOf0( Y, X ), isFinite0( Y ) }.
% 0.72/1.11 { ! aSet0( X ), aSubsetOf0( X, X ) }.
% 0.72/1.11 { ! aSet0( X ), ! aSet0( Y ), ! aSubsetOf0( X, Y ), ! aSubsetOf0( Y, X ), X
% 0.72/1.11 = Y }.
% 0.72/1.11 { aSet0( xA ) }.
% 0.72/1.11 { aSet0( xB ) }.
% 0.72/1.11 { aSet0( xC ) }.
% 0.72/1.11 { ! aElementOf0( X, xA ), aElementOf0( X, xB ) }.
% 0.72/1.11 { aSubsetOf0( xA, xB ) }.
% 0.72/1.11 { ! aElementOf0( X, xB ), aElementOf0( X, xC ) }.
% 0.72/1.11 { aSubsetOf0( xB, xC ) }.
% 0.72/1.11 { aElementOf0( skol3, xA ) }.
% 0.72/1.11 { ! aElementOf0( skol3, xC ) }.
% 0.72/1.11 { ! aSubsetOf0( xA, xC ) }.
% 0.72/1.11
% 0.72/1.11 percentage equality = 0.086207, percentage horn = 0.925926
% 0.72/1.11 This is a problem with some equality
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Options Used:
% 0.72/1.11
% 0.72/1.11 useres = 1
% 0.72/1.11 useparamod = 1
% 0.72/1.11 useeqrefl = 1
% 0.72/1.11 useeqfact = 1
% 0.72/1.11 usefactor = 1
% 0.72/1.11 usesimpsplitting = 0
% 0.72/1.11 usesimpdemod = 5
% 0.72/1.11 usesimpres = 3
% 0.72/1.11
% 0.72/1.11 resimpinuse = 1000
% 0.72/1.11 resimpclauses = 20000
% 0.72/1.11 substype = eqrewr
% 0.72/1.11 backwardsubs = 1
% 0.72/1.11 selectoldest = 5
% 0.72/1.11
% 0.72/1.11 litorderings [0] = split
% 0.72/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.11
% 0.72/1.11 termordering = kbo
% 0.72/1.11
% 0.72/1.11 litapriori = 0
% 0.72/1.11 termapriori = 1
% 0.72/1.11 litaposteriori = 0
% 0.72/1.11 termaposteriori = 0
% 0.72/1.11 demodaposteriori = 0
% 0.72/1.11 ordereqreflfact = 0
% 0.72/1.11
% 0.72/1.11 litselect = negord
% 0.72/1.11
% 0.72/1.11 maxweight = 15
% 0.72/1.11 maxdepth = 30000
% 0.72/1.11 maxlength = 115
% 0.72/1.11 maxnrvars = 195
% 0.72/1.11 excuselevel = 1
% 0.72/1.11 increasemaxweight = 1
% 0.72/1.11
% 0.72/1.11 maxselected = 10000000
% 0.72/1.11 maxnrclauses = 10000000
% 0.72/1.11
% 0.72/1.11 showgenerated = 0
% 0.72/1.11 showkept = 0
% 0.72/1.11 showselected = 0
% 0.72/1.11 showdeleted = 0
% 0.72/1.11 showresimp = 1
% 0.72/1.11 showstatus = 2000
% 0.72/1.11
% 0.72/1.11 prologoutput = 0
% 0.72/1.11 nrgoals = 5000000
% 0.72/1.11 totalproof = 1
% 0.72/1.11
% 0.72/1.11 Symbols occurring in the translation:
% 0.72/1.11
% 0.72/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.11 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.72/1.11 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.72/1.11 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.72/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.11 aSet0 [36, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.72/1.11 aElement0 [37, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.72/1.11 aElementOf0 [39, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.72/1.11 isFinite0 [40, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.72/1.11 slcrc0 [41, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.72/1.11 isCountable0 [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.72/1.11 aSubsetOf0 [43, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.72/1.11 xA [45, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.72/1.11 xB [46, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.72/1.11 xC [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.72/1.11 alpha1 [48, 2] (w:1, o:50, a:1, s:1, b:1),
% 0.72/1.11 skol1 [49, 1] (w:1, o:23, a:1, s:1, b:1),
% 0.72/1.11 skol2 [50, 2] (w:1, o:51, a:1, s:1, b:1),
% 0.72/1.11 skol3 [51, 0] (w:1, o:8, a:1, s:1, b:1).
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Starting Search:
% 0.72/1.11
% 0.72/1.11 *** allocated 15000 integers for clauses
% 0.72/1.11 *** allocated 22500 integers for clauses
% 0.72/1.11
% 0.72/1.11 Bliksems!, er is een bewijs:
% 0.72/1.11 % SZS status Theorem
% 0.72/1.11 % SZS output start Refutation
% 0.72/1.11
% 0.72/1.11 (20) {G0,W6,D2,L2,V1,M2} I { ! aElementOf0( X, xA ), aElementOf0( X, xB )
% 0.72/1.11 }.
% 0.72/1.11 (22) {G0,W6,D2,L2,V1,M2} I { ! aElementOf0( X, xB ), aElementOf0( X, xC )
% 0.72/1.11 }.
% 0.72/1.11 (24) {G0,W3,D2,L1,V0,M1} I { aElementOf0( skol3, xA ) }.
% 0.72/1.11 (25) {G0,W3,D2,L1,V0,M1} I { ! aElementOf0( skol3, xC ) }.
% 0.72/1.11 (343) {G1,W3,D2,L1,V0,M1} R(20,24) { aElementOf0( skol3, xB ) }.
% 0.72/1.11 (367) {G2,W0,D0,L0,V0,M0} R(22,343);r(25) { }.
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 % SZS output end Refutation
% 0.72/1.11 found a proof!
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Unprocessed initial clauses:
% 0.72/1.11
% 0.72/1.11 (369) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.11 (370) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.11 (371) {G0,W7,D2,L3,V2,M3} { ! aSet0( X ), ! aElementOf0( Y, X ), aElement0
% 0.72/1.11 ( Y ) }.
% 0.72/1.11 (372) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.11 (373) {G0,W5,D2,L2,V1,M2} { ! X = slcrc0, aSet0( X ) }.
% 0.72/1.11 (374) {G0,W6,D2,L2,V2,M2} { ! X = slcrc0, ! aElementOf0( Y, X ) }.
% 0.72/1.11 (375) {G0,W9,D3,L3,V1,M3} { ! aSet0( X ), aElementOf0( skol1( X ), X ), X
% 0.72/1.11 = slcrc0 }.
% 0.72/1.11 (376) {G0,W2,D2,L1,V0,M1} { isFinite0( slcrc0 ) }.
% 0.72/1.11 (377) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.11 (378) {G0,W6,D2,L3,V1,M3} { ! aSet0( X ), ! isCountable0( X ), ! isFinite0
% 0.72/1.11 ( X ) }.
% 0.72/1.11 (379) {G0,W7,D2,L3,V1,M3} { ! aSet0( X ), ! isCountable0( X ), ! X =
% 0.72/1.11 slcrc0 }.
% 0.72/1.11 (380) {G0,W7,D2,L3,V2,M3} { ! aSet0( X ), ! aSubsetOf0( Y, X ), aSet0( Y )
% 0.72/1.11 }.
% 0.72/1.11 (381) {G0,W8,D2,L3,V2,M3} { ! aSet0( X ), ! aSubsetOf0( Y, X ), alpha1( X
% 0.72/1.11 , Y ) }.
% 0.72/1.11 (382) {G0,W10,D2,L4,V2,M4} { ! aSet0( X ), ! aSet0( Y ), ! alpha1( X, Y )
% 0.72/1.11 , aSubsetOf0( Y, X ) }.
% 0.72/1.11 (383) {G0,W9,D2,L3,V3,M3} { ! alpha1( X, Y ), ! aElementOf0( Z, Y ),
% 0.72/1.11 aElementOf0( Z, X ) }.
% 0.72/1.11 (384) {G0,W8,D3,L2,V3,M2} { aElementOf0( skol2( Z, Y ), Y ), alpha1( X, Y
% 0.72/1.11 ) }.
% 0.72/1.11 (385) {G0,W8,D3,L2,V2,M2} { ! aElementOf0( skol2( X, Y ), X ), alpha1( X,
% 0.72/1.11 Y ) }.
% 0.72/1.11 (386) {G0,W9,D2,L4,V2,M4} { ! aSet0( X ), ! isFinite0( X ), ! aSubsetOf0(
% 0.72/1.11 Y, X ), isFinite0( Y ) }.
% 0.72/1.11 (387) {G0,W5,D2,L2,V1,M2} { ! aSet0( X ), aSubsetOf0( X, X ) }.
% 0.72/1.11 (388) {G0,W13,D2,L5,V2,M5} { ! aSet0( X ), ! aSet0( Y ), ! aSubsetOf0( X,
% 0.72/1.11 Y ), ! aSubsetOf0( Y, X ), X = Y }.
% 0.72/1.11 (389) {G0,W2,D2,L1,V0,M1} { aSet0( xA ) }.
% 0.72/1.11 (390) {G0,W2,D2,L1,V0,M1} { aSet0( xB ) }.
% 0.72/1.11 (391) {G0,W2,D2,L1,V0,M1} { aSet0( xC ) }.
% 0.72/1.11 (392) {G0,W6,D2,L2,V1,M2} { ! aElementOf0( X, xA ), aElementOf0( X, xB )
% 0.72/1.11 }.
% 0.72/1.11 (393) {G0,W3,D2,L1,V0,M1} { aSubsetOf0( xA, xB ) }.
% 0.72/1.11 (394) {G0,W6,D2,L2,V1,M2} { ! aElementOf0( X, xB ), aElementOf0( X, xC )
% 0.72/1.11 }.
% 0.72/1.11 (395) {G0,W3,D2,L1,V0,M1} { aSubsetOf0( xB, xC ) }.
% 0.72/1.11 (396) {G0,W3,D2,L1,V0,M1} { aElementOf0( skol3, xA ) }.
% 0.72/1.11 (397) {G0,W3,D2,L1,V0,M1} { ! aElementOf0( skol3, xC ) }.
% 0.72/1.11 (398) {G0,W3,D2,L1,V0,M1} { ! aSubsetOf0( xA, xC ) }.
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Total Proof:
% 0.72/1.11
% 0.72/1.11 subsumption: (20) {G0,W6,D2,L2,V1,M2} I { ! aElementOf0( X, xA ),
% 0.72/1.11 aElementOf0( X, xB ) }.
% 0.72/1.11 parent0: (392) {G0,W6,D2,L2,V1,M2} { ! aElementOf0( X, xA ), aElementOf0(
% 0.72/1.11 X, xB ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (22) {G0,W6,D2,L2,V1,M2} I { ! aElementOf0( X, xB ),
% 0.72/1.11 aElementOf0( X, xC ) }.
% 0.72/1.11 parent0: (394) {G0,W6,D2,L2,V1,M2} { ! aElementOf0( X, xB ), aElementOf0(
% 0.72/1.11 X, xC ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (24) {G0,W3,D2,L1,V0,M1} I { aElementOf0( skol3, xA ) }.
% 0.72/1.11 parent0: (396) {G0,W3,D2,L1,V0,M1} { aElementOf0( skol3, xA ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (25) {G0,W3,D2,L1,V0,M1} I { ! aElementOf0( skol3, xC ) }.
% 0.72/1.11 parent0: (397) {G0,W3,D2,L1,V0,M1} { ! aElementOf0( skol3, xC ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (431) {G1,W3,D2,L1,V0,M1} { aElementOf0( skol3, xB ) }.
% 0.72/1.11 parent0[0]: (20) {G0,W6,D2,L2,V1,M2} I { ! aElementOf0( X, xA ),
% 0.72/1.11 aElementOf0( X, xB ) }.
% 0.72/1.11 parent1[0]: (24) {G0,W3,D2,L1,V0,M1} I { aElementOf0( skol3, xA ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol3
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (343) {G1,W3,D2,L1,V0,M1} R(20,24) { aElementOf0( skol3, xB )
% 0.72/1.11 }.
% 0.72/1.11 parent0: (431) {G1,W3,D2,L1,V0,M1} { aElementOf0( skol3, xB ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (432) {G1,W3,D2,L1,V0,M1} { aElementOf0( skol3, xC ) }.
% 0.72/1.11 parent0[0]: (22) {G0,W6,D2,L2,V1,M2} I { ! aElementOf0( X, xB ),
% 0.72/1.11 aElementOf0( X, xC ) }.
% 0.72/1.11 parent1[0]: (343) {G1,W3,D2,L1,V0,M1} R(20,24) { aElementOf0( skol3, xB )
% 0.72/1.11 }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol3
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (433) {G1,W0,D0,L0,V0,M0} { }.
% 0.72/1.11 parent0[0]: (25) {G0,W3,D2,L1,V0,M1} I { ! aElementOf0( skol3, xC ) }.
% 0.72/1.11 parent1[0]: (432) {G1,W3,D2,L1,V0,M1} { aElementOf0( skol3, xC ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (367) {G2,W0,D0,L0,V0,M0} R(22,343);r(25) { }.
% 0.72/1.11 parent0: (433) {G1,W0,D0,L0,V0,M0} { }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 Proof check complete!
% 0.72/1.11
% 0.72/1.11 Memory use:
% 0.72/1.11
% 0.72/1.11 space for terms: 4391
% 0.72/1.11 space for clauses: 15641
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 clauses generated: 866
% 0.72/1.11 clauses kept: 368
% 0.72/1.11 clauses selected: 80
% 0.72/1.11 clauses deleted: 1
% 0.72/1.11 clauses inuse deleted: 0
% 0.72/1.11
% 0.72/1.11 subsentry: 1151
% 0.72/1.11 literals s-matched: 977
% 0.72/1.11 literals matched: 809
% 0.72/1.11 full subsumption: 221
% 0.72/1.11
% 0.72/1.11 checksum: 1994123290
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Bliksem ended
%------------------------------------------------------------------------------