%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN986+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n016.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 : Thu Jul 21 02:58:36 EDT 2022
% Result : Theorem 0.41s 1.06s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN986+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Mon Jul 11 23:40:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.41/1.06 *** allocated 10000 integers for termspace/termends
% 0.41/1.06 *** allocated 10000 integers for clauses
% 0.41/1.06 *** allocated 10000 integers for justifications
% 0.41/1.06 Bliksem 1.12
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Automatic Strategy Selection
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Clauses:
% 0.41/1.06
% 0.41/1.06 { r( X, zero, succ( X ) ) }.
% 0.41/1.06 { ! r( X, Y, Z ), ! r( Z, Y, T ), r( X, succ( Y ), T ) }.
% 0.41/1.06 { ! r( zero, zero, X ), ! r( zero, X, Y ) }.
% 0.41/1.06
% 0.41/1.06 percentage equality = 0.000000, percentage horn = 1.000000
% 0.41/1.06 This is a near-Horn, non-equality problem
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Options Used:
% 0.41/1.06
% 0.41/1.06 useres = 1
% 0.41/1.06 useparamod = 0
% 0.41/1.06 useeqrefl = 0
% 0.41/1.06 useeqfact = 0
% 0.41/1.06 usefactor = 1
% 0.41/1.06 usesimpsplitting = 0
% 0.41/1.06 usesimpdemod = 0
% 0.41/1.06 usesimpres = 4
% 0.41/1.06
% 0.41/1.06 resimpinuse = 1000
% 0.41/1.06 resimpclauses = 20000
% 0.41/1.06 substype = standard
% 0.41/1.06 backwardsubs = 1
% 0.41/1.06 selectoldest = 5
% 0.41/1.06
% 0.41/1.06 litorderings [0] = split
% 0.41/1.06 litorderings [1] = liftord
% 0.41/1.06
% 0.41/1.06 termordering = none
% 0.41/1.06
% 0.41/1.06 litapriori = 1
% 0.41/1.06 termapriori = 0
% 0.41/1.06 litaposteriori = 0
% 0.41/1.06 termaposteriori = 0
% 0.41/1.06 demodaposteriori = 0
% 0.41/1.06 ordereqreflfact = 0
% 0.41/1.06
% 0.41/1.06 litselect = negative
% 0.41/1.06
% 0.41/1.06 maxweight = 30000
% 0.41/1.06 maxdepth = 30000
% 0.41/1.06 maxlength = 115
% 0.41/1.06 maxnrvars = 195
% 0.41/1.06 excuselevel = 0
% 0.41/1.06 increasemaxweight = 0
% 0.41/1.06
% 0.41/1.06 maxselected = 10000000
% 0.41/1.06 maxnrclauses = 10000000
% 0.41/1.06
% 0.41/1.06 showgenerated = 0
% 0.41/1.06 showkept = 0
% 0.41/1.06 showselected = 0
% 0.41/1.06 showdeleted = 0
% 0.41/1.06 showresimp = 1
% 0.41/1.06 showstatus = 2000
% 0.41/1.06
% 0.41/1.06 prologoutput = 0
% 0.41/1.06 nrgoals = 5000000
% 0.41/1.06 totalproof = 1
% 0.41/1.06
% 0.41/1.06 Symbols occurring in the translation:
% 0.41/1.06
% 0.41/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.06 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.41/1.06 ! [4, 1] (w:1, o:12, a:1, s:1, b:0),
% 0.41/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.06 zero [36, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.41/1.06 succ [37, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.41/1.06 r [38, 3] (w:1, o:42, a:1, s:1, b:0).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Starting Search:
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Bliksems!, er is een bewijs:
% 0.41/1.06 % SZS status Theorem
% 0.41/1.06 % SZS output start Refutation
% 0.41/1.06
% 0.41/1.06 (0) {G0,W5,D3,L1,V1,M1} I { r( X, zero, succ( X ) ) }.
% 0.41/1.06 (1) {G0,W15,D3,L3,V4,M1} I { ! r( X, Y, Z ), r( X, succ( Y ), T ), ! r( Z,
% 0.41/1.06 Y, T ) }.
% 0.41/1.06 (2) {G0,W10,D2,L2,V2,M1} I { ! r( zero, zero, X ), ! r( zero, X, Y ) }.
% 0.41/1.06 (5) {G1,W11,D3,L2,V2,M1} R(1,0) { r( X, succ( zero ), succ( Y ) ), ! r( X,
% 0.41/1.06 zero, Y ) }.
% 0.41/1.06 (6) {G2,W7,D4,L1,V1,M1} R(5,0) { r( X, succ( zero ), succ( succ( X ) ) )
% 0.41/1.06 }.
% 0.41/1.06 (8) {G3,W0,D0,L0,V0,M0} R(6,2);r(0) { }.
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 % SZS output end Refutation
% 0.41/1.06 found a proof!
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Unprocessed initial clauses:
% 0.41/1.06
% 0.41/1.06 (10) {G0,W5,D3,L1,V1,M1} { r( X, zero, succ( X ) ) }.
% 0.41/1.06 (11) {G0,W15,D3,L3,V4,M3} { ! r( X, Y, Z ), ! r( Z, Y, T ), r( X, succ( Y
% 0.41/1.06 ), T ) }.
% 0.41/1.06 (12) {G0,W10,D2,L2,V2,M2} { ! r( zero, zero, X ), ! r( zero, X, Y ) }.
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Total Proof:
% 0.41/1.06
% 0.41/1.06 subsumption: (0) {G0,W5,D3,L1,V1,M1} I { r( X, zero, succ( X ) ) }.
% 0.41/1.06 parent0: (10) {G0,W5,D3,L1,V1,M1} { r( X, zero, succ( X ) ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 0 ==> 0
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 subsumption: (1) {G0,W15,D3,L3,V4,M1} I { ! r( X, Y, Z ), r( X, succ( Y ),
% 0.41/1.06 T ), ! r( Z, Y, T ) }.
% 0.41/1.06 parent0: (11) {G0,W15,D3,L3,V4,M3} { ! r( X, Y, Z ), ! r( Z, Y, T ), r( X
% 0.41/1.06 , succ( Y ), T ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 Y := Y
% 0.41/1.06 Z := Z
% 0.41/1.06 T := T
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 0 ==> 0
% 0.41/1.06 1 ==> 2
% 0.41/1.06 2 ==> 1
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 subsumption: (2) {G0,W10,D2,L2,V2,M1} I { ! r( zero, zero, X ), ! r( zero,
% 0.41/1.06 X, Y ) }.
% 0.41/1.06 parent0: (12) {G0,W10,D2,L2,V2,M2} { ! r( zero, zero, X ), ! r( zero, X, Y
% 0.41/1.06 ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 Y := Y
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 0 ==> 0
% 0.41/1.06 1 ==> 1
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 resolution: (17) {G1,W11,D3,L2,V2,M2} { ! r( X, zero, Y ), r( X, succ(
% 0.41/1.06 zero ), succ( Y ) ) }.
% 0.41/1.06 parent0[2]: (1) {G0,W15,D3,L3,V4,M1} I { ! r( X, Y, Z ), r( X, succ( Y ), T
% 0.41/1.06 ), ! r( Z, Y, T ) }.
% 0.41/1.06 parent1[0]: (0) {G0,W5,D3,L1,V1,M1} I { r( X, zero, succ( X ) ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 Y := zero
% 0.41/1.06 Z := Y
% 0.41/1.06 T := succ( Y )
% 0.41/1.06 end
% 0.41/1.06 substitution1:
% 0.41/1.06 X := Y
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 subsumption: (5) {G1,W11,D3,L2,V2,M1} R(1,0) { r( X, succ( zero ), succ( Y
% 0.41/1.06 ) ), ! r( X, zero, Y ) }.
% 0.41/1.06 parent0: (17) {G1,W11,D3,L2,V2,M2} { ! r( X, zero, Y ), r( X, succ( zero )
% 0.41/1.06 , succ( Y ) ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 Y := Y
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 0 ==> 1
% 0.41/1.06 1 ==> 0
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 resolution: (18) {G1,W7,D4,L1,V1,M1} { r( X, succ( zero ), succ( succ( X )
% 0.41/1.06 ) ) }.
% 0.41/1.06 parent0[1]: (5) {G1,W11,D3,L2,V2,M1} R(1,0) { r( X, succ( zero ), succ( Y )
% 0.41/1.06 ), ! r( X, zero, Y ) }.
% 0.41/1.06 parent1[0]: (0) {G0,W5,D3,L1,V1,M1} I { r( X, zero, succ( X ) ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 Y := succ( X )
% 0.41/1.06 end
% 0.41/1.06 substitution1:
% 0.41/1.06 X := X
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 subsumption: (6) {G2,W7,D4,L1,V1,M1} R(5,0) { r( X, succ( zero ), succ(
% 0.41/1.06 succ( X ) ) ) }.
% 0.41/1.06 parent0: (18) {G1,W7,D4,L1,V1,M1} { r( X, succ( zero ), succ( succ( X ) )
% 0.41/1.06 ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := X
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 0 ==> 0
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 resolution: (19) {G1,W6,D3,L1,V0,M1} { ! r( zero, zero, succ( zero ) ) }.
% 0.41/1.06 parent0[1]: (2) {G0,W10,D2,L2,V2,M1} I { ! r( zero, zero, X ), ! r( zero, X
% 0.41/1.06 , Y ) }.
% 0.41/1.06 parent1[0]: (6) {G2,W7,D4,L1,V1,M1} R(5,0) { r( X, succ( zero ), succ( succ
% 0.41/1.06 ( X ) ) ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 X := succ( zero )
% 0.41/1.06 Y := succ( succ( zero ) )
% 0.41/1.06 end
% 0.41/1.06 substitution1:
% 0.41/1.06 X := zero
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 resolution: (20) {G1,W0,D0,L0,V0,M0} { }.
% 0.41/1.06 parent0[0]: (19) {G1,W6,D3,L1,V0,M1} { ! r( zero, zero, succ( zero ) ) }.
% 0.41/1.06 parent1[0]: (0) {G0,W5,D3,L1,V1,M1} I { r( X, zero, succ( X ) ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 end
% 0.41/1.06 substitution1:
% 0.41/1.06 X := zero
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 subsumption: (8) {G3,W0,D0,L0,V0,M0} R(6,2);r(0) { }.
% 0.41/1.06 parent0: (20) {G1,W0,D0,L0,V0,M0} { }.
% 0.41/1.06 substitution0:
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 Proof check complete!
% 0.41/1.06
% 0.41/1.06 Memory use:
% 0.41/1.06
% 0.41/1.06 space for terms: 161
% 0.41/1.06 space for clauses: 560
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 clauses generated: 10
% 0.41/1.06 clauses kept: 9
% 0.41/1.06 clauses selected: 7
% 0.41/1.06 clauses deleted: 0
% 0.41/1.06 clauses inuse deleted: 0
% 0.41/1.06
% 0.41/1.06 subsentry: 10
% 0.41/1.06 literals s-matched: 1
% 0.41/1.06 literals matched: 1
% 0.41/1.06 full subsumption: 0
% 0.41/1.06
% 0.41/1.06 checksum: 2114224419
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Bliksem ended
%------------------------------------------------------------------------------