TSTP Solution File: NUM837+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM837+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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.73s 1.09s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM837+2 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n010.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 13:10:32 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.73/1.09 *** allocated 10000 integers for termspace/termends
% 0.73/1.09 *** allocated 10000 integers for clauses
% 0.73/1.09 *** allocated 10000 integers for justifications
% 0.73/1.09 Bliksem 1.12
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Automatic Strategy Selection
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Clauses:
% 0.73/1.09
% 0.73/1.09 { ! vd269 = vplus( vd268, X ) }.
% 0.73/1.09 { less( vd269, vd271 ) }.
% 0.73/1.09 { less( vd268, vd269 ) }.
% 0.73/1.09 { ! leq( X, Y ), geq( Y, X ) }.
% 0.73/1.09 { ! geq( X, Y ), leq( Y, X ) }.
% 0.73/1.09 { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.73/1.09 { ! less( Y, X ), leq( Y, X ) }.
% 0.73/1.09 { ! Y = X, leq( Y, X ) }.
% 0.73/1.09 { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.73/1.09 { ! greater( Y, X ), geq( Y, X ) }.
% 0.73/1.09 { ! Y = X, geq( Y, X ) }.
% 0.73/1.09 { ! less( X, Y ), greater( Y, X ) }.
% 0.73/1.09 { ! greater( X, Y ), less( Y, X ) }.
% 0.73/1.09 { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.73/1.09 { ! X = Y, ! less( X, Y ) }.
% 0.73/1.09 { ! greater( X, Y ), ! less( X, Y ) }.
% 0.73/1.09 { ! X = Y, ! greater( X, Y ) }.
% 0.73/1.09 { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) ) }.
% 0.73/1.09 { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.73/1.09 { ! greater( Y, X ), Y = vplus( X, skol2( X, Y ) ) }.
% 0.73/1.09 { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.73/1.09 { X = Y, X = vplus( Y, skol3( X, Y ) ), Y = vplus( X, skol4( X, Y ) ) }.
% 0.73/1.09 { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.73/1.09 { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.73/1.09 { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.73/1.09 { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.73/1.09 { vplus( vplus( X, Y ), Z ) = vplus( X, vplus( Y, Z ) ) }.
% 0.73/1.09 { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y ) ) }.
% 0.73/1.09 { vplus( X, v1 ) = vsucc( X ) }.
% 0.73/1.09
% 0.73/1.09 percentage equality = 0.464286, percentage horn = 0.862069
% 0.73/1.09 This is a problem with some equality
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Options Used:
% 0.73/1.09
% 0.73/1.09 useres = 1
% 0.73/1.09 useparamod = 1
% 0.73/1.09 useeqrefl = 1
% 0.73/1.09 useeqfact = 1
% 0.73/1.09 usefactor = 1
% 0.73/1.09 usesimpsplitting = 0
% 0.73/1.09 usesimpdemod = 5
% 0.73/1.09 usesimpres = 3
% 0.73/1.09
% 0.73/1.09 resimpinuse = 1000
% 0.73/1.09 resimpclauses = 20000
% 0.73/1.09 substype = eqrewr
% 0.73/1.09 backwardsubs = 1
% 0.73/1.09 selectoldest = 5
% 0.73/1.09
% 0.73/1.09 litorderings [0] = split
% 0.73/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.73/1.09
% 0.73/1.09 termordering = kbo
% 0.73/1.09
% 0.73/1.09 litapriori = 0
% 0.73/1.09 termapriori = 1
% 0.73/1.09 litaposteriori = 0
% 0.73/1.09 termaposteriori = 0
% 0.73/1.09 demodaposteriori = 0
% 0.73/1.09 ordereqreflfact = 0
% 0.73/1.09
% 0.73/1.09 litselect = negord
% 0.73/1.09
% 0.73/1.09 maxweight = 15
% 0.73/1.09 maxdepth = 30000
% 0.73/1.09 maxlength = 115
% 0.73/1.09 maxnrvars = 195
% 0.73/1.09 excuselevel = 1
% 0.73/1.09 increasemaxweight = 1
% 0.73/1.09
% 0.73/1.09 maxselected = 10000000
% 0.73/1.09 maxnrclauses = 10000000
% 0.73/1.09
% 0.73/1.09 showgenerated = 0
% 0.73/1.09 showkept = 0
% 0.73/1.09 showselected = 0
% 0.73/1.09 showdeleted = 0
% 0.73/1.09 showresimp = 1
% 0.73/1.09 showstatus = 2000
% 0.73/1.09
% 0.73/1.09 prologoutput = 0
% 0.73/1.09 nrgoals = 5000000
% 0.73/1.09 totalproof = 1
% 0.73/1.09
% 0.73/1.09 Symbols occurring in the translation:
% 0.73/1.09
% 0.73/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.09 . [1, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.73/1.09 ! [4, 1] (w:0, o:43, a:1, s:1, b:0),
% 0.73/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.09 vd269 [36, 0] (w:1, o:20, a:1, s:1, b:0),
% 0.73/1.09 vd268 [37, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.73/1.09 vplus [38, 2] (w:1, o:73, a:1, s:1, b:0),
% 0.73/1.09 vd271 [39, 0] (w:1, o:21, a:1, s:1, b:0),
% 0.73/1.09 less [40, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.73/1.09 leq [43, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.73/1.09 geq [44, 2] (w:1, o:76, a:1, s:1, b:0),
% 0.73/1.09 greater [51, 2] (w:1, o:77, a:1, s:1, b:0),
% 0.73/1.09 vsucc [76, 1] (w:1, o:48, a:1, s:1, b:0),
% 0.73/1.09 v1 [77, 0] (w:1, o:42, a:1, s:1, b:0),
% 0.73/1.09 skol1 [78, 2] (w:1, o:78, a:1, s:1, b:1),
% 0.73/1.09 skol2 [79, 2] (w:1, o:79, a:1, s:1, b:1),
% 0.73/1.09 skol3 [80, 2] (w:1, o:80, a:1, s:1, b:1),
% 0.73/1.09 skol4 [81, 2] (w:1, o:81, a:1, s:1, b:1).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Starting Search:
% 0.73/1.09
% 0.73/1.09 *** allocated 15000 integers for clauses
% 0.73/1.09 *** allocated 22500 integers for clauses
% 0.73/1.09
% 0.73/1.09 Bliksems!, er is een bewijs:
% 0.73/1.09 % SZS status Theorem
% 0.73/1.09 % SZS output start Refutation
% 0.73/1.09
% 0.73/1.09 (0) {G0,W5,D3,L1,V1,M1} I { ! vplus( vd268, X ) ==> vd269 }.
% 0.73/1.09 (2) {G0,W3,D2,L1,V0,M1} I { less( vd268, vd269 ) }.
% 0.73/1.09 (17) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1( X, Y ) ) ==>
% 0.73/1.09 X }.
% 0.73/1.09 (373) {G1,W0,D0,L0,V0,M0} R(17,0);r(2) { }.
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 % SZS output end Refutation
% 0.73/1.09 found a proof!
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Unprocessed initial clauses:
% 0.73/1.09
% 0.73/1.09 (375) {G0,W5,D3,L1,V1,M1} { ! vd269 = vplus( vd268, X ) }.
% 0.73/1.09 (376) {G0,W3,D2,L1,V0,M1} { less( vd269, vd271 ) }.
% 0.73/1.09 (377) {G0,W3,D2,L1,V0,M1} { less( vd268, vd269 ) }.
% 0.73/1.09 (378) {G0,W6,D2,L2,V2,M2} { ! leq( X, Y ), geq( Y, X ) }.
% 0.73/1.09 (379) {G0,W6,D2,L2,V2,M2} { ! geq( X, Y ), leq( Y, X ) }.
% 0.73/1.09 (380) {G0,W9,D2,L3,V2,M3} { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.73/1.09 (381) {G0,W6,D2,L2,V2,M2} { ! less( Y, X ), leq( Y, X ) }.
% 0.73/1.09 (382) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( Y, X ) }.
% 0.73/1.09 (383) {G0,W9,D2,L3,V2,M3} { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.73/1.09 (384) {G0,W6,D2,L2,V2,M2} { ! greater( Y, X ), geq( Y, X ) }.
% 0.73/1.09 (385) {G0,W6,D2,L2,V2,M2} { ! Y = X, geq( Y, X ) }.
% 0.73/1.09 (386) {G0,W6,D2,L2,V2,M2} { ! less( X, Y ), greater( Y, X ) }.
% 0.73/1.09 (387) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), less( Y, X ) }.
% 0.73/1.09 (388) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.73/1.09 (389) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! less( X, Y ) }.
% 0.73/1.09 (390) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! less( X, Y ) }.
% 0.73/1.09 (391) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.73/1.09 (392) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) )
% 0.73/1.09 }.
% 0.73/1.09 (393) {G0,W8,D3,L2,V3,M2} { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.73/1.09 (394) {G0,W10,D4,L2,V2,M2} { ! greater( Y, X ), Y = vplus( X, skol2( X, Y
% 0.73/1.09 ) ) }.
% 0.73/1.09 (395) {G0,W8,D3,L2,V3,M2} { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.73/1.09 (396) {G0,W17,D4,L3,V2,M3} { X = Y, X = vplus( Y, skol3( X, Y ) ), Y =
% 0.73/1.09 vplus( X, skol4( X, Y ) ) }.
% 0.73/1.09 (397) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.73/1.09 (398) {G0,W10,D3,L2,V4,M2} { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.73/1.09 (399) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.73/1.09 (400) {G0,W10,D3,L2,V3,M2} { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.73/1.09 (401) {G0,W11,D4,L1,V3,M1} { vplus( vplus( X, Y ), Z ) = vplus( X, vplus(
% 0.73/1.09 Y, Z ) ) }.
% 0.73/1.09 (402) {G0,W9,D4,L1,V2,M1} { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y )
% 0.73/1.09 ) }.
% 0.73/1.09 (403) {G0,W6,D3,L1,V1,M1} { vplus( X, v1 ) = vsucc( X ) }.
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Total Proof:
% 0.73/1.09
% 0.73/1.09 eqswap: (404) {G0,W5,D3,L1,V1,M1} { ! vplus( vd268, X ) = vd269 }.
% 0.73/1.09 parent0[0]: (375) {G0,W5,D3,L1,V1,M1} { ! vd269 = vplus( vd268, X ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (0) {G0,W5,D3,L1,V1,M1} I { ! vplus( vd268, X ) ==> vd269 }.
% 0.73/1.09 parent0: (404) {G0,W5,D3,L1,V1,M1} { ! vplus( vd268, X ) = vd269 }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (2) {G0,W3,D2,L1,V0,M1} I { less( vd268, vd269 ) }.
% 0.73/1.09 parent0: (377) {G0,W3,D2,L1,V0,M1} { less( vd268, vd269 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 eqswap: (414) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol1( X, Y ) ) = X, ! less
% 0.73/1.09 ( Y, X ) }.
% 0.73/1.09 parent0[1]: (392) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y,
% 0.73/1.09 skol1( X, Y ) ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (17) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1
% 0.73/1.09 ( X, Y ) ) ==> X }.
% 0.73/1.09 parent0: (414) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol1( X, Y ) ) = X, !
% 0.73/1.09 less( Y, X ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 1
% 0.73/1.09 1 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 eqswap: (415) {G0,W10,D4,L2,V2,M2} { Y ==> vplus( X, skol1( Y, X ) ), !
% 0.73/1.09 less( X, Y ) }.
% 0.73/1.09 parent0[1]: (17) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1(
% 0.73/1.09 X, Y ) ) ==> X }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := Y
% 0.73/1.09 Y := X
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 eqswap: (416) {G0,W5,D3,L1,V1,M1} { ! vd269 ==> vplus( vd268, X ) }.
% 0.73/1.09 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { ! vplus( vd268, X ) ==> vd269 }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 resolution: (417) {G1,W3,D2,L1,V0,M1} { ! less( vd268, vd269 ) }.
% 0.73/1.09 parent0[0]: (416) {G0,W5,D3,L1,V1,M1} { ! vd269 ==> vplus( vd268, X ) }.
% 0.73/1.09 parent1[0]: (415) {G0,W10,D4,L2,V2,M2} { Y ==> vplus( X, skol1( Y, X ) ),
% 0.73/1.09 ! less( X, Y ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := skol1( vd269, vd268 )
% 0.73/1.09 end
% 0.73/1.09 substitution1:
% 0.73/1.09 X := vd268
% 0.73/1.09 Y := vd269
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 resolution: (418) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.09 parent0[0]: (417) {G1,W3,D2,L1,V0,M1} { ! less( vd268, vd269 ) }.
% 0.73/1.09 parent1[0]: (2) {G0,W3,D2,L1,V0,M1} I { less( vd268, vd269 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 substitution1:
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (373) {G1,W0,D0,L0,V0,M0} R(17,0);r(2) { }.
% 0.73/1.09 parent0: (418) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 Proof check complete!
% 0.73/1.09
% 0.73/1.09 Memory use:
% 0.73/1.09
% 0.73/1.09 space for terms: 4412
% 0.73/1.09 space for clauses: 19767
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 clauses generated: 651
% 0.73/1.09 clauses kept: 374
% 0.73/1.09 clauses selected: 59
% 0.73/1.09 clauses deleted: 2
% 0.73/1.09 clauses inuse deleted: 0
% 0.73/1.09
% 0.73/1.09 subsentry: 809
% 0.73/1.09 literals s-matched: 589
% 0.73/1.09 literals matched: 589
% 0.73/1.09 full subsumption: 60
% 0.73/1.09
% 0.73/1.09 checksum: -1175398802
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Bliksem ended
%------------------------------------------------------------------------------