TSTP Solution File: NUM837+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM837+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n004.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:26:54 EDT 2022
% Result : Theorem 0.46s 1.10s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM837+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Thu Jul 7 15:08:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.10 *** allocated 10000 integers for termspace/termends
% 0.46/1.10 *** allocated 10000 integers for clauses
% 0.46/1.10 *** allocated 10000 integers for justifications
% 0.46/1.10 Bliksem 1.12
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Automatic Strategy Selection
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Clauses:
% 0.46/1.10
% 0.46/1.10 { ! vd269 = vplus( vd268, X ) }.
% 0.46/1.10 { less( vd269, vd271 ) }.
% 0.46/1.10 { less( vd268, vd269 ) }.
% 0.46/1.10 { ! leq( X, Y ), geq( Y, X ) }.
% 0.46/1.10 { ! geq( X, Y ), leq( Y, X ) }.
% 0.46/1.10 { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.46/1.10 { ! less( Y, X ), leq( Y, X ) }.
% 0.46/1.10 { ! Y = X, leq( Y, X ) }.
% 0.46/1.10 { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.46/1.10 { ! greater( Y, X ), geq( Y, X ) }.
% 0.46/1.10 { ! Y = X, geq( Y, X ) }.
% 0.46/1.10 { ! less( X, Y ), greater( Y, X ) }.
% 0.46/1.10 { ! greater( X, Y ), less( Y, X ) }.
% 0.46/1.10 { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.46/1.10 { ! X = Y, ! less( X, Y ) }.
% 0.46/1.10 { ! greater( X, Y ), ! less( X, Y ) }.
% 0.46/1.10 { ! X = Y, ! greater( X, Y ) }.
% 0.46/1.10 { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) ) }.
% 0.46/1.10 { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.46/1.10 { ! greater( Y, X ), Y = vplus( X, skol2( X, Y ) ) }.
% 0.46/1.10 { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.46/1.10 { X = Y, X = vplus( Y, skol3( X, Y ) ), Y = vplus( X, skol4( X, Y ) ) }.
% 0.46/1.10 { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.46/1.10 { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.46/1.10 { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.46/1.10 { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.46/1.10 { ! Y = vplus( X, Y ) }.
% 0.46/1.10 { vplus( Y, X ) = vplus( X, Y ) }.
% 0.46/1.10 { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y ) ) }.
% 0.46/1.10 { vplus( v1, X ) = vsucc( X ) }.
% 0.46/1.10 { vplus( vplus( X, Y ), Z ) = vplus( X, vplus( Y, Z ) ) }.
% 0.46/1.10 { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y ) ) }.
% 0.46/1.10 { vplus( X, v1 ) = vsucc( X ) }.
% 0.46/1.10 { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.46/1.10 { ! vsucc( X ) = X }.
% 0.46/1.10 { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.46/1.10 { ! vsucc( X ) = vsucc( Y ), X = Y }.
% 0.46/1.10 { ! vsucc( X ) = v1 }.
% 0.46/1.10
% 0.46/1.10 percentage equality = 0.545455, percentage horn = 0.864865
% 0.46/1.10 This is a problem with some equality
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Options Used:
% 0.46/1.10
% 0.46/1.10 useres = 1
% 0.46/1.10 useparamod = 1
% 0.46/1.10 useeqrefl = 1
% 0.46/1.10 useeqfact = 1
% 0.46/1.10 usefactor = 1
% 0.46/1.10 usesimpsplitting = 0
% 0.46/1.10 usesimpdemod = 5
% 0.46/1.10 usesimpres = 3
% 0.46/1.10
% 0.46/1.10 resimpinuse = 1000
% 0.46/1.10 resimpclauses = 20000
% 0.46/1.10 substype = eqrewr
% 0.46/1.10 backwardsubs = 1
% 0.46/1.10 selectoldest = 5
% 0.46/1.10
% 0.46/1.10 litorderings [0] = split
% 0.46/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.46/1.10
% 0.46/1.10 termordering = kbo
% 0.46/1.10
% 0.46/1.10 litapriori = 0
% 0.46/1.10 termapriori = 1
% 0.46/1.10 litaposteriori = 0
% 0.46/1.10 termaposteriori = 0
% 0.46/1.10 demodaposteriori = 0
% 0.46/1.10 ordereqreflfact = 0
% 0.46/1.10
% 0.46/1.10 litselect = negord
% 0.46/1.10
% 0.46/1.10 maxweight = 15
% 0.46/1.10 maxdepth = 30000
% 0.46/1.10 maxlength = 115
% 0.46/1.10 maxnrvars = 195
% 0.46/1.10 excuselevel = 1
% 0.46/1.10 increasemaxweight = 1
% 0.46/1.10
% 0.46/1.10 maxselected = 10000000
% 0.46/1.10 maxnrclauses = 10000000
% 0.46/1.10
% 0.46/1.10 showgenerated = 0
% 0.46/1.10 showkept = 0
% 0.46/1.10 showselected = 0
% 0.46/1.10 showdeleted = 0
% 0.46/1.10 showresimp = 1
% 0.46/1.10 showstatus = 2000
% 0.46/1.10
% 0.46/1.10 prologoutput = 0
% 0.46/1.10 nrgoals = 5000000
% 0.46/1.10 totalproof = 1
% 0.46/1.10
% 0.46/1.10 Symbols occurring in the translation:
% 0.46/1.10
% 0.46/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.10 . [1, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.46/1.10 ! [4, 1] (w:0, o:57, a:1, s:1, b:0),
% 0.46/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.10 vd269 [36, 0] (w:1, o:22, a:1, s:1, b:0),
% 0.46/1.10 vd268 [37, 0] (w:1, o:21, a:1, s:1, b:0),
% 0.46/1.10 vplus [38, 2] (w:1, o:88, a:1, s:1, b:0),
% 0.46/1.10 vd271 [39, 0] (w:1, o:23, a:1, s:1, b:0),
% 0.46/1.10 less [40, 2] (w:1, o:89, a:1, s:1, b:0),
% 0.46/1.10 leq [43, 2] (w:1, o:90, a:1, s:1, b:0),
% 0.46/1.10 geq [44, 2] (w:1, o:91, a:1, s:1, b:0),
% 0.46/1.10 greater [51, 2] (w:1, o:92, a:1, s:1, b:0),
% 0.46/1.10 vsucc [77, 1] (w:1, o:62, a:1, s:1, b:0),
% 0.46/1.10 v1 [79, 0] (w:1, o:56, a:1, s:1, b:0),
% 0.46/1.10 vskolem2 [86, 1] (w:1, o:63, a:1, s:1, b:0),
% 0.46/1.10 skol1 [93, 2] (w:1, o:93, a:1, s:1, b:1),
% 0.46/1.10 skol2 [94, 2] (w:1, o:94, a:1, s:1, b:1),
% 0.46/1.10 skol3 [95, 2] (w:1, o:95, a:1, s:1, b:1),
% 0.46/1.10 skol4 [96, 2] (w:1, o:96, a:1, s:1, b:1).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Starting Search:
% 0.46/1.10
% 0.46/1.10 *** allocated 15000 integers for clauses
% 0.46/1.10 *** allocated 22500 integers for clauses
% 0.46/1.10
% 0.46/1.10 Bliksems!, er is een bewijs:
% 0.46/1.10 % SZS status Theorem
% 0.46/1.10 % SZS output start Refutation
% 0.46/1.10
% 0.46/1.10 (0) {G0,W5,D3,L1,V1,M1} I { ! vplus( vd268, X ) ==> vd269 }.
% 0.46/1.10 (2) {G0,W3,D2,L1,V0,M1} I { less( vd268, vd269 ) }.
% 0.46/1.10 (17) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1( X, Y ) ) ==>
% 0.46/1.10 X }.
% 0.46/1.10 (416) {G1,W0,D0,L0,V0,M0} R(17,0);r(2) { }.
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 % SZS output end Refutation
% 0.46/1.10 found a proof!
% 0.46/1.10
% 0.46/1.10 *** allocated 33750 integers for clauses
% 0.46/1.10
% 0.46/1.10 Unprocessed initial clauses:
% 0.46/1.10
% 0.46/1.10 (418) {G0,W5,D3,L1,V1,M1} { ! vd269 = vplus( vd268, X ) }.
% 0.46/1.10 (419) {G0,W3,D2,L1,V0,M1} { less( vd269, vd271 ) }.
% 0.46/1.10 (420) {G0,W3,D2,L1,V0,M1} { less( vd268, vd269 ) }.
% 0.46/1.10 (421) {G0,W6,D2,L2,V2,M2} { ! leq( X, Y ), geq( Y, X ) }.
% 0.46/1.10 (422) {G0,W6,D2,L2,V2,M2} { ! geq( X, Y ), leq( Y, X ) }.
% 0.46/1.10 (423) {G0,W9,D2,L3,V2,M3} { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.46/1.10 (424) {G0,W6,D2,L2,V2,M2} { ! less( Y, X ), leq( Y, X ) }.
% 0.46/1.10 (425) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( Y, X ) }.
% 0.46/1.10 (426) {G0,W9,D2,L3,V2,M3} { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.46/1.10 (427) {G0,W6,D2,L2,V2,M2} { ! greater( Y, X ), geq( Y, X ) }.
% 0.46/1.10 (428) {G0,W6,D2,L2,V2,M2} { ! Y = X, geq( Y, X ) }.
% 0.46/1.10 (429) {G0,W6,D2,L2,V2,M2} { ! less( X, Y ), greater( Y, X ) }.
% 0.46/1.10 (430) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), less( Y, X ) }.
% 0.46/1.10 (431) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.46/1.10 (432) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! less( X, Y ) }.
% 0.46/1.10 (433) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! less( X, Y ) }.
% 0.46/1.10 (434) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.46/1.10 (435) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) )
% 0.46/1.10 }.
% 0.46/1.10 (436) {G0,W8,D3,L2,V3,M2} { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.46/1.10 (437) {G0,W10,D4,L2,V2,M2} { ! greater( Y, X ), Y = vplus( X, skol2( X, Y
% 0.46/1.10 ) ) }.
% 0.46/1.10 (438) {G0,W8,D3,L2,V3,M2} { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.46/1.10 (439) {G0,W17,D4,L3,V2,M3} { X = Y, X = vplus( Y, skol3( X, Y ) ), Y =
% 0.46/1.10 vplus( X, skol4( X, Y ) ) }.
% 0.46/1.10 (440) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.46/1.10 (441) {G0,W10,D3,L2,V4,M2} { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.46/1.10 (442) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.46/1.10 (443) {G0,W10,D3,L2,V3,M2} { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.46/1.10 (444) {G0,W5,D3,L1,V2,M1} { ! Y = vplus( X, Y ) }.
% 0.46/1.10 (445) {G0,W7,D3,L1,V2,M1} { vplus( Y, X ) = vplus( X, Y ) }.
% 0.46/1.10 (446) {G0,W9,D4,L1,V2,M1} { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y )
% 0.46/1.11 ) }.
% 0.46/1.11 (447) {G0,W6,D3,L1,V1,M1} { vplus( v1, X ) = vsucc( X ) }.
% 0.46/1.11 (448) {G0,W11,D4,L1,V3,M1} { vplus( vplus( X, Y ), Z ) = vplus( X, vplus(
% 0.46/1.11 Y, Z ) ) }.
% 0.46/1.11 (449) {G0,W9,D4,L1,V2,M1} { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y )
% 0.46/1.11 ) }.
% 0.46/1.11 (450) {G0,W6,D3,L1,V1,M1} { vplus( X, v1 ) = vsucc( X ) }.
% 0.46/1.11 (451) {G0,W8,D4,L2,V1,M2} { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.46/1.11 (452) {G0,W4,D3,L1,V1,M1} { ! vsucc( X ) = X }.
% 0.46/1.11 (453) {G0,W8,D3,L2,V2,M2} { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.46/1.11 (454) {G0,W8,D3,L2,V2,M2} { ! vsucc( X ) = vsucc( Y ), X = Y }.
% 0.46/1.11 (455) {G0,W4,D3,L1,V1,M1} { ! vsucc( X ) = v1 }.
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 Total Proof:
% 0.46/1.11
% 0.46/1.11 eqswap: (456) {G0,W5,D3,L1,V1,M1} { ! vplus( vd268, X ) = vd269 }.
% 0.46/1.11 parent0[0]: (418) {G0,W5,D3,L1,V1,M1} { ! vd269 = vplus( vd268, X ) }.
% 0.46/1.11 substitution0:
% 0.46/1.11 X := X
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 subsumption: (0) {G0,W5,D3,L1,V1,M1} I { ! vplus( vd268, X ) ==> vd269 }.
% 0.46/1.11 parent0: (456) {G0,W5,D3,L1,V1,M1} { ! vplus( vd268, X ) = vd269 }.
% 0.46/1.11 substitution0:
% 0.46/1.11 X := X
% 0.46/1.11 end
% 0.46/1.11 permutation0:
% 0.46/1.11 0 ==> 0
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 subsumption: (2) {G0,W3,D2,L1,V0,M1} I { less( vd268, vd269 ) }.
% 0.46/1.11 parent0: (420) {G0,W3,D2,L1,V0,M1} { less( vd268, vd269 ) }.
% 0.46/1.11 substitution0:
% 0.46/1.11 end
% 0.46/1.11 permutation0:
% 0.46/1.11 0 ==> 0
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 eqswap: (466) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol1( X, Y ) ) = X, ! less
% 0.46/1.11 ( Y, X ) }.
% 0.46/1.11 parent0[1]: (435) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y,
% 0.46/1.11 skol1( X, Y ) ) }.
% 0.46/1.11 substitution0:
% 0.46/1.11 X := X
% 0.46/1.11 Y := Y
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 subsumption: (17) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1
% 0.46/1.11 ( X, Y ) ) ==> X }.
% 0.46/1.11 parent0: (466) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol1( X, Y ) ) = X, !
% 0.46/1.11 less( Y, X ) }.
% 0.46/1.11 substitution0:
% 0.46/1.11 X := X
% 0.46/1.11 Y := Y
% 0.46/1.11 end
% 0.46/1.11 permutation0:
% 0.46/1.11 0 ==> 1
% 0.46/1.11 1 ==> 0
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 eqswap: (467) {G0,W10,D4,L2,V2,M2} { Y ==> vplus( X, skol1( Y, X ) ), !
% 0.46/1.11 less( X, Y ) }.
% 0.46/1.11 parent0[1]: (17) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1(
% 0.46/1.11 X, Y ) ) ==> X }.
% 0.46/1.11 substitution0:
% 0.46/1.11 X := Y
% 0.46/1.11 Y := X
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 eqswap: (468) {G0,W5,D3,L1,V1,M1} { ! vd269 ==> vplus( vd268, X ) }.
% 0.46/1.11 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { ! vplus( vd268, X ) ==> vd269 }.
% 0.46/1.11 substitution0:
% 0.46/1.11 X := X
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 resolution: (469) {G1,W3,D2,L1,V0,M1} { ! less( vd268, vd269 ) }.
% 0.46/1.11 parent0[0]: (468) {G0,W5,D3,L1,V1,M1} { ! vd269 ==> vplus( vd268, X ) }.
% 0.46/1.11 parent1[0]: (467) {G0,W10,D4,L2,V2,M2} { Y ==> vplus( X, skol1( Y, X ) ),
% 0.46/1.11 ! less( X, Y ) }.
% 0.46/1.11 substitution0:
% 0.46/1.11 X := skol1( vd269, vd268 )
% 0.46/1.11 end
% 0.46/1.11 substitution1:
% 0.46/1.11 X := vd268
% 0.46/1.11 Y := vd269
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 resolution: (470) {G1,W0,D0,L0,V0,M0} { }.
% 0.46/1.11 parent0[0]: (469) {G1,W3,D2,L1,V0,M1} { ! less( vd268, vd269 ) }.
% 0.46/1.11 parent1[0]: (2) {G0,W3,D2,L1,V0,M1} I { less( vd268, vd269 ) }.
% 0.46/1.11 substitution0:
% 0.46/1.11 end
% 0.46/1.11 substitution1:
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 subsumption: (416) {G1,W0,D0,L0,V0,M0} R(17,0);r(2) { }.
% 0.46/1.11 parent0: (470) {G1,W0,D0,L0,V0,M0} { }.
% 0.46/1.11 substitution0:
% 0.46/1.11 end
% 0.46/1.11 permutation0:
% 0.46/1.11 end
% 0.46/1.11
% 0.46/1.11 Proof check complete!
% 0.46/1.11
% 0.46/1.11 Memory use:
% 0.46/1.11
% 0.46/1.11 space for terms: 5045
% 0.46/1.11 space for clauses: 22283
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 clauses generated: 697
% 0.46/1.11 clauses kept: 417
% 0.46/1.11 clauses selected: 62
% 0.46/1.11 clauses deleted: 4
% 0.46/1.11 clauses inuse deleted: 0
% 0.46/1.11
% 0.46/1.11 subsentry: 888
% 0.46/1.11 literals s-matched: 646
% 0.46/1.11 literals matched: 646
% 0.46/1.11 full subsumption: 76
% 0.46/1.11
% 0.46/1.11 checksum: -2107836821
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 Bliksem ended
%------------------------------------------------------------------------------