TSTP Solution File: NUM531+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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:18 EDT 2022
% Result : Theorem 0.71s 1.06s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n012.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 : Thu Jul 7 04:14:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.06 *** allocated 10000 integers for termspace/termends
% 0.71/1.06 *** allocated 10000 integers for clauses
% 0.71/1.06 *** allocated 10000 integers for justifications
% 0.71/1.06 Bliksem 1.12
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Automatic Strategy Selection
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Clauses:
% 0.71/1.06
% 0.71/1.06 { && }.
% 0.71/1.06 { && }.
% 0.71/1.06 { ! aSet0( X ), ! aElementOf0( Y, X ), aElement0( Y ) }.
% 0.71/1.06 { && }.
% 0.71/1.06 { ! X = slcrc0, aSet0( X ) }.
% 0.71/1.06 { ! X = slcrc0, ! aElementOf0( Y, X ) }.
% 0.71/1.06 { ! aSet0( X ), aElementOf0( skol1( X ), X ), X = slcrc0 }.
% 0.71/1.06 { isFinite0( slcrc0 ) }.
% 0.71/1.06 { && }.
% 0.71/1.06 { ! aSet0( X ), ! isCountable0( X ), ! isFinite0( X ) }.
% 0.71/1.06 { aSet0( skol2 ) }.
% 0.71/1.06 { isCountable0( skol2 ) }.
% 0.71/1.06 { ! aElementOf0( X, skol2 ) }.
% 0.71/1.06 { skol2 = slcrc0 }.
% 0.71/1.06
% 0.71/1.06 percentage equality = 0.210526, percentage horn = 0.909091
% 0.71/1.06 This is a problem with some equality
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Options Used:
% 0.71/1.06
% 0.71/1.06 useres = 1
% 0.71/1.06 useparamod = 1
% 0.71/1.06 useeqrefl = 1
% 0.71/1.06 useeqfact = 1
% 0.71/1.06 usefactor = 1
% 0.71/1.06 usesimpsplitting = 0
% 0.71/1.06 usesimpdemod = 5
% 0.71/1.06 usesimpres = 3
% 0.71/1.06
% 0.71/1.06 resimpinuse = 1000
% 0.71/1.06 resimpclauses = 20000
% 0.71/1.06 substype = eqrewr
% 0.71/1.06 backwardsubs = 1
% 0.71/1.06 selectoldest = 5
% 0.71/1.06
% 0.71/1.06 litorderings [0] = split
% 0.71/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.06
% 0.71/1.06 termordering = kbo
% 0.71/1.06
% 0.71/1.06 litapriori = 0
% 0.71/1.06 termapriori = 1
% 0.71/1.06 litaposteriori = 0
% 0.71/1.06 termaposteriori = 0
% 0.71/1.06 demodaposteriori = 0
% 0.71/1.06 ordereqreflfact = 0
% 0.71/1.06
% 0.71/1.06 litselect = negord
% 0.71/1.06
% 0.71/1.06 maxweight = 15
% 0.71/1.06 maxdepth = 30000
% 0.71/1.06 maxlength = 115
% 0.71/1.06 maxnrvars = 195
% 0.71/1.06 excuselevel = 1
% 0.71/1.06 increasemaxweight = 1
% 0.71/1.06
% 0.71/1.06 maxselected = 10000000
% 0.71/1.06 maxnrclauses = 10000000
% 0.71/1.06
% 0.71/1.06 showgenerated = 0
% 0.71/1.06 showkept = 0
% 0.71/1.06 showselected = 0
% 0.71/1.06 showdeleted = 0
% 0.71/1.06 showresimp = 1
% 0.71/1.06 showstatus = 2000
% 0.71/1.06
% 0.71/1.06 prologoutput = 0
% 0.71/1.06 nrgoals = 5000000
% 0.71/1.06 totalproof = 1
% 0.71/1.06
% 0.71/1.06 Symbols occurring in the translation:
% 0.71/1.06
% 0.71/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.06 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.06 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.71/1.06 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.71/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.06 aSet0 [36, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.06 aElement0 [37, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.71/1.06 aElementOf0 [39, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.71/1.06 isFinite0 [40, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.71/1.06 slcrc0 [41, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.06 isCountable0 [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.06 skol1 [43, 1] (w:1, o:19, a:1, s:1, b:1),
% 0.71/1.06 skol2 [44, 0] (w:1, o:8, a:1, s:1, b:1).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Starting Search:
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Bliksems!, er is een bewijs:
% 0.71/1.06 % SZS status Theorem
% 0.71/1.06 % SZS output start Refutation
% 0.71/1.06
% 0.71/1.06 (5) {G0,W2,D2,L1,V0,M1} I { isFinite0( slcrc0 ) }.
% 0.71/1.06 (6) {G0,W6,D2,L3,V1,M3} I { ! aSet0( X ), ! isCountable0( X ), ! isFinite0
% 0.71/1.06 ( X ) }.
% 0.71/1.06 (7) {G0,W2,D2,L1,V0,M1} I { aSet0( skol2 ) }.
% 0.71/1.06 (8) {G0,W2,D2,L1,V0,M1} I { isCountable0( skol2 ) }.
% 0.71/1.06 (10) {G0,W3,D2,L1,V0,M1} I { slcrc0 ==> skol2 }.
% 0.71/1.06 (11) {G1,W2,D2,L1,V0,M1} S(5);d(10) { isFinite0( skol2 ) }.
% 0.71/1.06 (16) {G2,W2,D2,L1,V0,M1} R(6,11);r(7) { ! isCountable0( skol2 ) }.
% 0.71/1.06 (18) {G3,W0,D0,L0,V0,M0} S(16);r(8) { }.
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 % SZS output end Refutation
% 0.71/1.06 found a proof!
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Unprocessed initial clauses:
% 0.71/1.06
% 0.71/1.06 (20) {G0,W1,D1,L1,V0,M1} { && }.
% 0.71/1.06 (21) {G0,W1,D1,L1,V0,M1} { && }.
% 0.71/1.06 (22) {G0,W7,D2,L3,V2,M3} { ! aSet0( X ), ! aElementOf0( Y, X ), aElement0
% 0.71/1.06 ( Y ) }.
% 0.71/1.06 (23) {G0,W1,D1,L1,V0,M1} { && }.
% 0.71/1.06 (24) {G0,W5,D2,L2,V1,M2} { ! X = slcrc0, aSet0( X ) }.
% 0.71/1.06 (25) {G0,W6,D2,L2,V2,M2} { ! X = slcrc0, ! aElementOf0( Y, X ) }.
% 0.71/1.06 (26) {G0,W9,D3,L3,V1,M3} { ! aSet0( X ), aElementOf0( skol1( X ), X ), X =
% 0.71/1.06 slcrc0 }.
% 0.71/1.06 (27) {G0,W2,D2,L1,V0,M1} { isFinite0( slcrc0 ) }.
% 0.71/1.06 (28) {G0,W1,D1,L1,V0,M1} { && }.
% 0.71/1.06 (29) {G0,W6,D2,L3,V1,M3} { ! aSet0( X ), ! isCountable0( X ), ! isFinite0
% 0.71/1.06 ( X ) }.
% 0.71/1.06 (30) {G0,W2,D2,L1,V0,M1} { aSet0( skol2 ) }.
% 0.71/1.06 (31) {G0,W2,D2,L1,V0,M1} { isCountable0( skol2 ) }.
% 0.71/1.06 (32) {G0,W3,D2,L1,V1,M1} { ! aElementOf0( X, skol2 ) }.
% 0.71/1.06 (33) {G0,W3,D2,L1,V0,M1} { skol2 = slcrc0 }.
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Total Proof:
% 0.71/1.06
% 0.71/1.06 subsumption: (5) {G0,W2,D2,L1,V0,M1} I { isFinite0( slcrc0 ) }.
% 0.71/1.06 parent0: (27) {G0,W2,D2,L1,V0,M1} { isFinite0( slcrc0 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 0 ==> 0
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 subsumption: (6) {G0,W6,D2,L3,V1,M3} I { ! aSet0( X ), ! isCountable0( X )
% 0.71/1.06 , ! isFinite0( X ) }.
% 0.71/1.06 parent0: (29) {G0,W6,D2,L3,V1,M3} { ! aSet0( X ), ! isCountable0( X ), !
% 0.71/1.06 isFinite0( X ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 X := X
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 0 ==> 0
% 0.71/1.06 1 ==> 1
% 0.71/1.06 2 ==> 2
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 subsumption: (7) {G0,W2,D2,L1,V0,M1} I { aSet0( skol2 ) }.
% 0.71/1.06 parent0: (30) {G0,W2,D2,L1,V0,M1} { aSet0( skol2 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 0 ==> 0
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 subsumption: (8) {G0,W2,D2,L1,V0,M1} I { isCountable0( skol2 ) }.
% 0.71/1.06 parent0: (31) {G0,W2,D2,L1,V0,M1} { isCountable0( skol2 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 0 ==> 0
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 eqswap: (49) {G0,W3,D2,L1,V0,M1} { slcrc0 = skol2 }.
% 0.71/1.06 parent0[0]: (33) {G0,W3,D2,L1,V0,M1} { skol2 = slcrc0 }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 subsumption: (10) {G0,W3,D2,L1,V0,M1} I { slcrc0 ==> skol2 }.
% 0.71/1.06 parent0: (49) {G0,W3,D2,L1,V0,M1} { slcrc0 = skol2 }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 0 ==> 0
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 paramod: (51) {G1,W2,D2,L1,V0,M1} { isFinite0( skol2 ) }.
% 0.71/1.06 parent0[0]: (10) {G0,W3,D2,L1,V0,M1} I { slcrc0 ==> skol2 }.
% 0.71/1.06 parent1[0; 1]: (5) {G0,W2,D2,L1,V0,M1} I { isFinite0( slcrc0 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 substitution1:
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 subsumption: (11) {G1,W2,D2,L1,V0,M1} S(5);d(10) { isFinite0( skol2 ) }.
% 0.71/1.06 parent0: (51) {G1,W2,D2,L1,V0,M1} { isFinite0( skol2 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 0 ==> 0
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 resolution: (52) {G1,W4,D2,L2,V0,M2} { ! aSet0( skol2 ), ! isCountable0(
% 0.71/1.06 skol2 ) }.
% 0.71/1.06 parent0[2]: (6) {G0,W6,D2,L3,V1,M3} I { ! aSet0( X ), ! isCountable0( X ),
% 0.71/1.06 ! isFinite0( X ) }.
% 0.71/1.06 parent1[0]: (11) {G1,W2,D2,L1,V0,M1} S(5);d(10) { isFinite0( skol2 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 X := skol2
% 0.71/1.06 end
% 0.71/1.06 substitution1:
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 resolution: (53) {G1,W2,D2,L1,V0,M1} { ! isCountable0( skol2 ) }.
% 0.71/1.06 parent0[0]: (52) {G1,W4,D2,L2,V0,M2} { ! aSet0( skol2 ), ! isCountable0(
% 0.71/1.06 skol2 ) }.
% 0.71/1.06 parent1[0]: (7) {G0,W2,D2,L1,V0,M1} I { aSet0( skol2 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 substitution1:
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 subsumption: (16) {G2,W2,D2,L1,V0,M1} R(6,11);r(7) { ! isCountable0( skol2
% 0.71/1.06 ) }.
% 0.71/1.06 parent0: (53) {G1,W2,D2,L1,V0,M1} { ! isCountable0( skol2 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 0 ==> 0
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 resolution: (54) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.06 parent0[0]: (16) {G2,W2,D2,L1,V0,M1} R(6,11);r(7) { ! isCountable0( skol2 )
% 0.71/1.06 }.
% 0.71/1.06 parent1[0]: (8) {G0,W2,D2,L1,V0,M1} I { isCountable0( skol2 ) }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 substitution1:
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 subsumption: (18) {G3,W0,D0,L0,V0,M0} S(16);r(8) { }.
% 0.71/1.06 parent0: (54) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.06 substitution0:
% 0.71/1.06 end
% 0.71/1.06 permutation0:
% 0.71/1.06 end
% 0.71/1.06
% 0.71/1.06 Proof check complete!
% 0.71/1.06
% 0.71/1.06 Memory use:
% 0.71/1.06
% 0.71/1.06 space for terms: 285
% 0.71/1.06 space for clauses: 978
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 clauses generated: 32
% 0.71/1.06 clauses kept: 19
% 0.71/1.06 clauses selected: 10
% 0.71/1.06 clauses deleted: 4
% 0.71/1.06 clauses inuse deleted: 0
% 0.71/1.06
% 0.71/1.06 subsentry: 110
% 0.71/1.06 literals s-matched: 60
% 0.71/1.06 literals matched: 60
% 0.71/1.06 full subsumption: 0
% 0.71/1.06
% 0.71/1.06 checksum: 1158764554
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Bliksem ended
%------------------------------------------------------------------------------