TSTP Solution File: NUM840+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM840+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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:56 EDT 2022
% Result : Theorem 0.70s 1.15s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM840+2 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.13 % Command : bliksem %s
% 0.12/0.35 % Computer : n011.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % DateTime : Tue Jul 5 05:48:37 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.70/1.15 *** allocated 10000 integers for termspace/termends
% 0.70/1.15 *** allocated 10000 integers for clauses
% 0.70/1.15 *** allocated 10000 integers for justifications
% 0.70/1.15 Bliksem 1.12
% 0.70/1.15
% 0.70/1.15
% 0.70/1.15 Automatic Strategy Selection
% 0.70/1.15
% 0.70/1.15
% 0.70/1.15 Clauses:
% 0.70/1.15
% 0.70/1.15 { ! less( vd328, vd329 ) }.
% 0.70/1.15 { less( vplus( vd328, vd330 ), vplus( vd329, vd330 ) ) }.
% 0.70/1.15 { ! vplus( vd328, vd330 ) = vplus( vd329, vd330 ), vd328 = vd329 }.
% 0.70/1.15 { ! greater( vplus( vd328, vd330 ), vplus( vd329, vd330 ) ), greater( vd328
% 0.70/1.15 , vd329 ) }.
% 0.70/1.15 { ! less( X, Y ), less( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.70/1.15 { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.70/1.15 { ! greater( X, Y ), greater( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.70/1.15 { ! less( X, Y ), greater( Y, X ) }.
% 0.70/1.15 { ! greater( X, Y ), less( Y, X ) }.
% 0.70/1.15 { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.70/1.15 { ! X = Y, ! less( X, Y ) }.
% 0.70/1.15 { ! greater( X, Y ), ! less( X, Y ) }.
% 0.70/1.15 { ! X = Y, ! greater( X, Y ) }.
% 0.70/1.15 { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) ) }.
% 0.70/1.15 { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.70/1.15 { ! greater( Y, X ), Y = vplus( X, skol2( X, Y ) ) }.
% 0.70/1.15 { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.70/1.15 { X = Y, X = vplus( Y, skol3( X, Y ) ), Y = vplus( X, skol4( X, Y ) ) }.
% 0.70/1.15 { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.70/1.15 { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.70/1.15 { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.70/1.15 { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.70/1.15 { ! Y = vplus( X, Y ) }.
% 0.70/1.15 { vplus( Y, X ) = vplus( X, Y ) }.
% 0.70/1.15 { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y ) ) }.
% 0.70/1.15 { vplus( v1, X ) = vsucc( X ) }.
% 0.70/1.15 { vplus( vplus( X, Y ), Z ) = vplus( X, vplus( Y, Z ) ) }.
% 0.70/1.15 { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y ) ) }.
% 0.70/1.15 { vplus( X, v1 ) = vsucc( X ) }.
% 0.70/1.15
% 0.70/1.15 percentage equality = 0.568627, percentage horn = 0.931034
% 0.70/1.15 This is a problem with some equality
% 0.70/1.15
% 0.70/1.15
% 0.70/1.15
% 0.70/1.15 Options Used:
% 0.70/1.15
% 0.70/1.15 useres = 1
% 0.70/1.15 useparamod = 1
% 0.70/1.15 useeqrefl = 1
% 0.70/1.15 useeqfact = 1
% 0.70/1.15 usefactor = 1
% 0.70/1.15 usesimpsplitting = 0
% 0.70/1.15 usesimpdemod = 5
% 0.70/1.15 usesimpres = 3
% 0.70/1.15
% 0.70/1.15 resimpinuse = 1000
% 0.70/1.15 resimpclauses = 20000
% 0.70/1.15 substype = eqrewr
% 0.70/1.15 backwardsubs = 1
% 0.70/1.15 selectoldest = 5
% 0.70/1.15
% 0.70/1.15 litorderings [0] = split
% 0.70/1.15 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.15
% 0.70/1.15 termordering = kbo
% 0.70/1.15
% 0.70/1.15 litapriori = 0
% 0.70/1.15 termapriori = 1
% 0.70/1.15 litaposteriori = 0
% 0.70/1.15 termaposteriori = 0
% 0.70/1.15 demodaposteriori = 0
% 0.70/1.15 ordereqreflfact = 0
% 0.70/1.15
% 0.70/1.15 litselect = negord
% 0.70/1.15
% 0.70/1.15 maxweight = 15
% 0.70/1.15 maxdepth = 30000
% 0.70/1.15 maxlength = 115
% 0.70/1.15 maxnrvars = 195
% 0.70/1.15 excuselevel = 1
% 0.70/1.15 increasemaxweight = 1
% 0.70/1.15
% 0.70/1.15 maxselected = 10000000
% 0.70/1.15 maxnrclauses = 10000000
% 0.70/1.15
% 0.70/1.15 showgenerated = 0
% 0.70/1.15 showkept = 0
% 0.70/1.15 showselected = 0
% 0.70/1.15 showdeleted = 0
% 0.70/1.15 showresimp = 1
% 0.70/1.15 showstatus = 2000
% 0.70/1.15
% 0.70/1.15 prologoutput = 0
% 0.70/1.15 nrgoals = 5000000
% 0.70/1.15 totalproof = 1
% 0.70/1.15
% 0.70/1.15 Symbols occurring in the translation:
% 0.70/1.15
% 0.70/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.15 . [1, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.70/1.15 ! [4, 1] (w:0, o:44, a:1, s:1, b:0),
% 0.70/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.15 vd328 [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.70/1.15 vd329 [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.70/1.15 less [37, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.70/1.15 vd330 [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.70/1.15 vplus [39, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.70/1.15 greater [40, 2] (w:1, o:76, a:1, s:1, b:0),
% 0.70/1.15 vsucc [69, 1] (w:1, o:49, a:1, s:1, b:0),
% 0.70/1.15 v1 [71, 0] (w:1, o:43, a:1, s:1, b:0),
% 0.70/1.15 skol1 [77, 2] (w:1, o:77, a:1, s:1, b:1),
% 0.70/1.15 skol2 [78, 2] (w:1, o:78, a:1, s:1, b:1),
% 0.70/1.15 skol3 [79, 2] (w:1, o:79, a:1, s:1, b:1),
% 0.70/1.15 skol4 [80, 2] (w:1, o:80, a:1, s:1, b:1).
% 0.70/1.15
% 0.70/1.15
% 0.70/1.15 Starting Search:
% 0.70/1.15
% 0.70/1.15 *** allocated 15000 integers for clauses
% 0.70/1.15 *** allocated 22500 integers for clauses
% 0.70/1.15 *** allocated 33750 integers for clauses
% 0.70/1.15 *** allocated 50625 integers for clauses
% 0.70/1.15 *** allocated 15000 integers for termspace/termends
% 0.70/1.15
% 0.70/1.15 Bliksems!, er is een bewijs:
% 0.70/1.15 % SZS status Theorem
% 0.70/1.15 % SZS output start Refutation
% 0.70/1.15
% 0.70/1.15 (0) {G0,W3,D2,L1,V0,M1} I { ! less( vd328, vd329 ) }.
% 0.70/1.15 (1) {G0,W7,D3,L1,V0,M1} I { less( vplus( vd328, vd330 ), vplus( vd329,
% 0.70/1.15 vd330 ) ) }.
% 0.70/1.15 (2) {G0,W10,D3,L2,V0,M2} I { ! vplus( vd329, vd330 ) ==> vplus( vd328,
% 0.70/1.15 vd330 ), vd329 ==> vd328 }.
% 0.70/1.15 (5) {G0,W10,D3,L2,V3,M2} I { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.70/1.15 (6) {G0,W10,D3,L2,V3,M2} I { ! greater( X, Y ), greater( vplus( X, Z ),
% 0.70/1.15 vplus( Y, Z ) ) }.
% 0.70/1.15 (9) {G0,W9,D2,L3,V2,M3} I { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.70/1.15 (10) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! less( X, Y ) }.
% 0.70/1.15 (11) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), ! less( X, Y ) }.
% 0.70/1.15 (20) {G0,W10,D3,L2,V3,M2} I { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.70/1.15 (28) {G1,W3,D2,L1,V1,M1} Q(10) { ! less( X, X ) }.
% 0.70/1.15 (67) {G1,W13,D3,L3,V1,M3} P(5,2) { ! vplus( X, vd330 ) = vplus( vd328,
% 0.70/1.15 vd330 ), vd329 ==> vd328, ! vd329 = X }.
% 0.70/1.15 (72) {G2,W6,D2,L2,V0,M2} Q(67) { vd329 ==> vd328, ! vd329 ==> vd328 }.
% 0.70/1.15 (73) {G3,W3,D2,L1,V0,M1} P(72,1);r(28) { ! vd329 ==> vd328 }.
% 0.70/1.15 (97) {G1,W6,D2,L2,V0,M2} R(9,0) { vd329 ==> vd328, greater( vd328, vd329 )
% 0.70/1.15 }.
% 0.70/1.15 (109) {G4,W9,D2,L3,V1,M3} P(9,73) { ! X = vd328, greater( X, vd329 ), less
% 0.70/1.15 ( X, vd329 ) }.
% 0.70/1.15 (170) {G5,W3,D2,L1,V0,M1} Q(109);d(97);r(28) { greater( vd328, vd329 ) }.
% 0.70/1.15 (177) {G6,W7,D3,L1,V1,M1} R(170,6) { greater( vplus( vd328, X ), vplus(
% 0.70/1.15 vd329, X ) ) }.
% 0.70/1.15 (471) {G7,W7,D3,L1,V1,M1} R(177,11) { ! less( vplus( vd328, X ), vplus(
% 0.70/1.15 vd329, X ) ) }.
% 0.70/1.15 (784) {G1,W14,D3,L2,V2,M2} P(20,1) { less( vplus( vd328, vd330 ), vplus( X
% 0.70/1.15 , vd330 ) ), ! vplus( Y, vd329 ) = vplus( Y, X ) }.
% 0.70/1.15 (788) {G8,W0,D0,L0,V0,M0} Q(784);r(471) { }.
% 0.70/1.15
% 0.70/1.15
% 0.70/1.15 % SZS output end Refutation
% 0.70/1.15 found a proof!
% 0.70/1.15
% 0.70/1.15
% 0.70/1.15 Unprocessed initial clauses:
% 0.70/1.15
% 0.70/1.15 (790) {G0,W3,D2,L1,V0,M1} { ! less( vd328, vd329 ) }.
% 0.70/1.15 (791) {G0,W7,D3,L1,V0,M1} { less( vplus( vd328, vd330 ), vplus( vd329,
% 0.70/1.15 vd330 ) ) }.
% 0.70/1.15 (792) {G0,W10,D3,L2,V0,M2} { ! vplus( vd328, vd330 ) = vplus( vd329, vd330
% 0.70/1.15 ), vd328 = vd329 }.
% 0.70/1.15 (793) {G0,W10,D3,L2,V0,M2} { ! greater( vplus( vd328, vd330 ), vplus(
% 0.70/1.15 vd329, vd330 ) ), greater( vd328, vd329 ) }.
% 0.70/1.15 (794) {G0,W10,D3,L2,V3,M2} { ! less( X, Y ), less( vplus( X, Z ), vplus( Y
% 0.70/1.15 , Z ) ) }.
% 0.70/1.15 (795) {G0,W10,D3,L2,V3,M2} { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.70/1.15 (796) {G0,W10,D3,L2,V3,M2} { ! greater( X, Y ), greater( vplus( X, Z ),
% 0.70/1.15 vplus( Y, Z ) ) }.
% 0.70/1.15 (797) {G0,W6,D2,L2,V2,M2} { ! less( X, Y ), greater( Y, X ) }.
% 0.70/1.15 (798) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), less( Y, X ) }.
% 0.70/1.15 (799) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.70/1.15 (800) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! less( X, Y ) }.
% 0.70/1.15 (801) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! less( X, Y ) }.
% 0.70/1.15 (802) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.70/1.15 (803) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) )
% 0.70/1.15 }.
% 0.70/1.15 (804) {G0,W8,D3,L2,V3,M2} { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.70/1.15 (805) {G0,W10,D4,L2,V2,M2} { ! greater( Y, X ), Y = vplus( X, skol2( X, Y
% 0.70/1.15 ) ) }.
% 0.70/1.15 (806) {G0,W8,D3,L2,V3,M2} { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.70/1.15 (807) {G0,W17,D4,L3,V2,M3} { X = Y, X = vplus( Y, skol3( X, Y ) ), Y =
% 0.70/1.15 vplus( X, skol4( X, Y ) ) }.
% 0.70/1.15 (808) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.70/1.15 (809) {G0,W10,D3,L2,V4,M2} { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.70/1.15 (810) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.70/1.15 (811) {G0,W10,D3,L2,V3,M2} { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.70/1.15 (812) {G0,W5,D3,L1,V2,M1} { ! Y = vplus( X, Y ) }.
% 0.70/1.15 (813) {G0,W7,D3,L1,V2,M1} { vplus( Y, X ) = vplus( X, Y ) }.
% 0.70/1.15 (814) {G0,W9,D4,L1,V2,M1} { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y )
% 0.70/1.15 ) }.
% 0.70/1.15 (815) {G0,W6,D3,L1,V1,M1} { vplus( v1, X ) = vsucc( X ) }.
% 0.70/1.15 (816) {G0,W11,D4,L1,V3,M1} { vplus( vplus( X, Y ), Z ) = vplus( X, vplus(
% 0.70/1.15 Y, Z ) ) }.
% 0.70/1.15 (817) {G0,W9,D4,L1,V2,M1} { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y )
% 0.70/1.15 ) }.
% 0.70/1.15 (818) {G0,W6,D3,L1,V1,M1} { vplus( X, v1 ) = vsucc( X ) }.
% 0.70/1.15
% 0.70/1.15
% 0.70/1.15 Total Proof:
% 0.70/1.15
% 0.70/1.15 subsumption: (0) {G0,W3,D2,L1,V0,M1} I { ! less( vd328, vd329 ) }.
% 0.70/1.15 parent0: (790) {G0,W3,D2,L1,V0,M1} { ! less( vd328, vd329 ) }.
% 0.70/1.15 substitution0:
% 0.70/1.15 end
% 0.70/1.15 permutation0:
% 0.70/1.15 0 ==> 0
% 0.70/1.15 end
% 0.70/1.15
% 0.70/1.15 subsumption: (1) {G0,W7,D3,L1,V0,M1} I { less( vplus( vd328, vd330 ), vplus
% 0.70/1.15 ( vd329, vd330 ) ) }.
% 0.70/1.15 parent0: (791) {G0,W7,D3,L1,V0,M1} { less( vplus( vd328, vd330 ), vplus(
% 0.70/1.15 vd329, vd330 ) ) }.
% 0.70/1.15 substitution0:
% 0.70/1.15 end
% 0.70/1.15 permutation0:
% 0.70/1.15 0 ==> 0
% 0.70/1.15 end
% 0.70/1.15
% 0.70/1.15 eqswap: (820) {G0,W10,D3,L2,V0,M2} { vd329 = vd328, ! vplus( vd328, vd330
% 0.70/1.15 ) = vplus( vd329, vd330 ) }.
% 0.70/1.15 parent0[1]: (792) {G0,W10,D3,L2,V0,M2} Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------