TSTP Solution File: SWV005-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n006.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 : Wed Jul 20 16:22:07 EDT 2022
% Result : Unsatisfiable 0.76s 1.15s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Thu Jun 16 06:13:11 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.76/1.15 *** allocated 10000 integers for termspace/termends
% 0.76/1.15 *** allocated 10000 integers for clauses
% 0.76/1.15 *** allocated 10000 integers for justifications
% 0.76/1.15 Bliksem 1.12
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Automatic Strategy Selection
% 0.76/1.15
% 0.76/1.15 Clauses:
% 0.76/1.15 [
% 0.76/1.15 [ =( predecessor( successor( X ) ), X ) ],
% 0.76/1.15 [ =( successor( predecessor( X ) ), X ) ],
% 0.76/1.15 [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ],
% 0.76/1.15 [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ],
% 0.76/1.15 [ 'less_than'( predecessor( X ), X ) ],
% 0.76/1.15 [ 'less_than'( X, successor( X ) ) ],
% 0.76/1.15 [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'( Z, Y )
% 0.76/1.15 ) ],
% 0.76/1.15 [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ],
% 0.76/1.15 [ ~( 'less_than'( X, X ) ) ],
% 0.76/1.15 [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ],
% 0.76/1.15 [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y ) ) ],
% 0.76/1.15 [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z ) ) ],
% 0.76/1.15 [ ~( 'less_than'( n, k ) ) ],
% 0.76/1.15 [ ~( 'less_than'( k, l ) ) ],
% 0.76/1.15 [ ~( 'less_than'( k, i ) ) ],
% 0.76/1.15 [ 'less_than'( l, n ) ],
% 0.76/1.15 [ 'less_than'( one, l ) ],
% 0.76/1.15 [ 'less_than'( a( k ), a( predecessor( l ) ) ) ],
% 0.76/1.15 [ 'less_than'( X, l ), ~( 'less_than'( X, successor( n ) ) ), ~(
% 0.76/1.15 'less_than'( a( X ), a( k ) ) ) ],
% 0.76/1.15 [ 'less_than'( X, l ), 'less_than'( n, X ), ~( 'less_than'( one, l ) ),
% 0.76/1.15 ~( 'less_than'( a( X ), a( predecessor( l ) ) ) ) ],
% 0.76/1.15 [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, l ) ), ~( 'less_than'(
% 0.76/1.15 a( X ), a( predecessor( X ) ) ) ) ]
% 0.76/1.15 ] .
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 percentage equality = 0.230769, percentage horn = 0.904762
% 0.76/1.15 This is a problem with some equality
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Options Used:
% 0.76/1.15
% 0.76/1.15 useres = 1
% 0.76/1.15 useparamod = 1
% 0.76/1.15 useeqrefl = 1
% 0.76/1.15 useeqfact = 1
% 0.76/1.15 usefactor = 1
% 0.76/1.15 usesimpsplitting = 0
% 0.76/1.15 usesimpdemod = 5
% 0.76/1.15 usesimpres = 3
% 0.76/1.15
% 0.76/1.15 resimpinuse = 1000
% 0.76/1.15 resimpclauses = 20000
% 0.76/1.15 substype = eqrewr
% 0.76/1.15 backwardsubs = 1
% 0.76/1.15 selectoldest = 5
% 0.76/1.15
% 0.76/1.15 litorderings [0] = split
% 0.76/1.15 litorderings [1] = extend the termordering, first sorting on arguments
% 0.76/1.15
% 0.76/1.15 termordering = kbo
% 0.76/1.15
% 0.76/1.15 litapriori = 0
% 0.76/1.15 termapriori = 1
% 0.76/1.15 litaposteriori = 0
% 0.76/1.15 termaposteriori = 0
% 0.76/1.15 demodaposteriori = 0
% 0.76/1.15 ordereqreflfact = 0
% 0.76/1.15
% 0.76/1.15 litselect = negord
% 0.76/1.15
% 0.76/1.15 maxweight = 15
% 0.76/1.15 maxdepth = 30000
% 0.76/1.15 maxlength = 115
% 0.76/1.15 maxnrvars = 195
% 0.76/1.15 excuselevel = 1
% 0.76/1.15 increasemaxweight = 1
% 0.76/1.15
% 0.76/1.15 maxselected = 10000000
% 0.76/1.15 maxnrclauses = 10000000
% 0.76/1.15
% 0.76/1.15 showgenerated = 0
% 0.76/1.15 showkept = 0
% 0.76/1.15 showselected = 0
% 0.76/1.15 showdeleted = 0
% 0.76/1.15 showresimp = 1
% 0.76/1.15 showstatus = 2000
% 0.76/1.15
% 0.76/1.15 prologoutput = 1
% 0.76/1.15 nrgoals = 5000000
% 0.76/1.15 totalproof = 1
% 0.76/1.15
% 0.76/1.15 Symbols occurring in the translation:
% 0.76/1.15
% 0.76/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.76/1.15 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.76/1.15 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.76/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.76/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.76/1.15 successor [40, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.76/1.15 predecessor [41, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.76/1.15 'less_than' [43, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.76/1.15 n [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.76/1.15 k [46, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.76/1.15 l [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.76/1.15 i [48, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.76/1.15 one [49, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.76/1.15 a [50, 1] (w:1, o:24, a:1, s:1, b:0).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Starting Search:
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Bliksems!, er is een bewijs:
% 0.76/1.15 % SZS status Unsatisfiable
% 0.76/1.15 % SZS output start Refutation
% 0.76/1.15
% 0.76/1.15 clause( 12, [ ~( 'less_than'( n, k ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 13, [ ~( 'less_than'( k, l ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 16, [ 'less_than'( one, l ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 17, [ 'less_than'( a( k ), a( predecessor( l ) ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 19, [ 'less_than'( X, l ), 'less_than'( n, X ), ~( 'less_than'( a(
% 0.76/1.15 X ), a( predecessor( l ) ) ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 403, [ 'less_than'( n, k ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 414, [] )
% 0.76/1.15 .
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 % SZS output end Refutation
% 0.76/1.15 found a proof!
% 0.76/1.15
% 0.76/1.15 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.76/1.15
% 0.76/1.15 initialclauses(
% 0.76/1.15 [ clause( 416, [ =( predecessor( successor( X ) ), X ) ] )
% 0.76/1.15 , clause( 417, [ =( successor( predecessor( X ) ), X ) ] )
% 0.76/1.15 , clause( 418, [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ]
% 0.76/1.15 )
% 0.76/1.15 , clause( 419, [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ] )
% 0.76/1.15 , clause( 420, [ 'less_than'( predecessor( X ), X ) ] )
% 0.76/1.15 , clause( 421, [ 'less_than'( X, successor( X ) ) ] )
% 0.76/1.15 , clause( 422, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~(
% 0.76/1.15 'less_than'( Z, Y ) ) ] )
% 0.76/1.15 , clause( 423, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.76/1.15 , clause( 424, [ ~( 'less_than'( X, X ) ) ] )
% 0.76/1.15 , clause( 425, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.76/1.15 , clause( 426, [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y
% 0.76/1.15 ) ) ] )
% 0.76/1.15 , clause( 427, [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z
% 0.76/1.15 ) ) ] )
% 0.76/1.15 , clause( 428, [ ~( 'less_than'( n, k ) ) ] )
% 0.76/1.15 , clause( 429, [ ~( 'less_than'( k, l ) ) ] )
% 0.76/1.15 , clause( 430, [ ~( 'less_than'( k, i ) ) ] )
% 0.76/1.15 , clause( 431, [ 'less_than'( l, n ) ] )
% 0.76/1.15 , clause( 432, [ 'less_than'( one, l ) ] )
% 0.76/1.15 , clause( 433, [ 'less_than'( a( k ), a( predecessor( l ) ) ) ] )
% 0.76/1.15 , clause( 434, [ 'less_than'( X, l ), ~( 'less_than'( X, successor( n ) ) )
% 0.76/1.15 , ~( 'less_than'( a( X ), a( k ) ) ) ] )
% 0.76/1.15 , clause( 435, [ 'less_than'( X, l ), 'less_than'( n, X ), ~( 'less_than'(
% 0.76/1.15 one, l ) ), ~( 'less_than'( a( X ), a( predecessor( l ) ) ) ) ] )
% 0.76/1.15 , clause( 436, [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, l ) ), ~(
% 0.76/1.15 'less_than'( a( X ), a( predecessor( X ) ) ) ) ] )
% 0.76/1.15 ] ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 12, [ ~( 'less_than'( n, k ) ) ] )
% 0.76/1.15 , clause( 428, [ ~( 'less_than'( n, k ) ) ] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 13, [ ~( 'less_than'( k, l ) ) ] )
% 0.76/1.15 , clause( 429, [ ~( 'less_than'( k, l ) ) ] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 16, [ 'less_than'( one, l ) ] )
% 0.76/1.15 , clause( 432, [ 'less_than'( one, l ) ] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 17, [ 'less_than'( a( k ), a( predecessor( l ) ) ) ] )
% 0.76/1.15 , clause( 433, [ 'less_than'( a( k ), a( predecessor( l ) ) ) ] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 482, [ 'less_than'( X, l ), 'less_than'( n, X ), ~( 'less_than'( a(
% 0.76/1.15 X ), a( predecessor( l ) ) ) ) ] )
% 0.76/1.15 , clause( 435, [ 'less_than'( X, l ), 'less_than'( n, X ), ~( 'less_than'(
% 0.76/1.15 one, l ) ), ~( 'less_than'( a( X ), a( predecessor( l ) ) ) ) ] )
% 0.76/1.15 , 2, clause( 16, [ 'less_than'( one, l ) ] )
% 0.76/1.15 , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 19, [ 'less_than'( X, l ), 'less_than'( n, X ), ~( 'less_than'( a(
% 0.76/1.15 X ), a( predecessor( l ) ) ) ) ] )
% 0.76/1.15 , clause( 482, [ 'less_than'( X, l ), 'less_than'( n, X ), ~( 'less_than'(
% 0.76/1.15 a( X ), a( predecessor( l ) ) ) ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.76/1.15 1 ), ==>( 2, 2 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 483, [ 'less_than'( k, l ), 'less_than'( n, k ) ] )
% 0.76/1.15 , clause( 19, [ 'less_than'( X, l ), 'less_than'( n, X ), ~( 'less_than'( a(
% 0.76/1.15 X ), a( predecessor( l ) ) ) ) ] )
% 0.76/1.15 , 2, clause( 17, [ 'less_than'( a( k ), a( predecessor( l ) ) ) ] )
% 0.76/1.15 , 0, substitution( 0, [ :=( X, k )] ), substitution( 1, [] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 484, [ 'less_than'( n, k ) ] )
% 0.76/1.15 , clause( 13, [ ~( 'less_than'( k, l ) ) ] )
% 0.76/1.15 , 0, clause( 483, [ 'less_than'( k, l ), 'less_than'( n, k ) ] )
% 0.76/1.15 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 403, [ 'less_than'( n, k ) ] )
% 0.76/1.15 , clause( 484, [ 'less_than'( n, k ) ] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 485, [] )
% 0.76/1.15 , clause( 12, [ ~( 'less_than'( n, k ) ) ] )
% 0.76/1.15 , 0, clause( 403, [ 'less_than'( n, k ) ] )
% 0.76/1.15 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 414, [] )
% 0.76/1.15 , clause( 485, [] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 end.
% 0.76/1.15
% 0.76/1.15 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.76/1.15
% 0.76/1.15 Memory use:
% 0.76/1.15
% 0.76/1.15 space for terms: 5039
% 0.76/1.15 space for clauses: 19983
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 clauses generated: 1404
% 0.76/1.15 clauses kept: 415
% 0.76/1.15 clauses selected: 46
% 0.76/1.15 clauses deleted: 1
% 0.76/1.15 clauses inuse deleted: 0
% 0.76/1.15
% 0.76/1.15 subsentry: 6894
% 0.76/1.15 literals s-matched: 5223
% 0.76/1.15 literals matched: 5223
% 0.76/1.15 full subsumption: 3687
% 0.76/1.15
% 0.76/1.15 checksum: 325796881
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Bliksem ended
%------------------------------------------------------------------------------