TSTP Solution File: SWV007-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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:08 EDT 2022
% Result : Unsatisfiable 0.71s 1.14s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Wed Jun 15 09:58:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.14 *** allocated 10000 integers for termspace/termends
% 0.71/1.14 *** allocated 10000 integers for clauses
% 0.71/1.14 *** allocated 10000 integers for justifications
% 0.71/1.14 Bliksem 1.12
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 Automatic Strategy Selection
% 0.71/1.14
% 0.71/1.14 Clauses:
% 0.71/1.14 [
% 0.71/1.14 [ =( predecessor( successor( X ) ), X ) ],
% 0.71/1.14 [ =( successor( predecessor( X ) ), X ) ],
% 0.71/1.14 [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ],
% 0.71/1.14 [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ],
% 0.71/1.14 [ 'less_than'( predecessor( X ), X ) ],
% 0.71/1.14 [ 'less_than'( X, successor( X ) ) ],
% 0.71/1.14 [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'( Z, Y )
% 0.71/1.14 ) ],
% 0.71/1.14 [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ],
% 0.71/1.14 [ ~( 'less_than'( X, X ) ) ],
% 0.71/1.14 [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ],
% 0.71/1.14 [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y ) ) ],
% 0.71/1.14 [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z ) ) ],
% 0.71/1.14 [ ~( 'less_than'( n, k ) ) ],
% 0.71/1.14 [ ~( 'less_than'( k, i ) ) ],
% 0.71/1.14 [ 'less_than'( i, n ) ],
% 0.71/1.14 [ ~( 'less_than'( n, m ) ) ],
% 0.71/1.14 [ 'less_than'( i, m ) ],
% 0.71/1.14 [ ~( 'less_than'( i, one ) ) ],
% 0.71/1.14 [ ~( =( k, m ) ) ],
% 0.71/1.14 [ 'less_than'( a( m ), a( k ) ) ],
% 0.71/1.14 [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, i ) ), ~( 'less_than'(
% 0.71/1.14 a( X ), a( predecessor( X ) ) ) ) ],
% 0.71/1.14 [ 'less_than'( X, i ), 'less_than'( n, X ), ~( 'less_than'( one, X ) ),
% 0.71/1.14 ~( 'less_than'( a( X ), a( predecessor( i ) ) ) ) ],
% 0.71/1.14 [ 'less_than'( X, i ), ~( 'less_than'( X, successor( n ) ) ), ~(
% 0.71/1.14 'less_than'( a( X ), a( k ) ) ) ]
% 0.71/1.14 ] .
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 percentage equality = 0.243902, percentage horn = 0.913043
% 0.71/1.14 This is a problem with some equality
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 Options Used:
% 0.71/1.14
% 0.71/1.14 useres = 1
% 0.71/1.14 useparamod = 1
% 0.71/1.14 useeqrefl = 1
% 0.71/1.14 useeqfact = 1
% 0.71/1.14 usefactor = 1
% 0.71/1.14 usesimpsplitting = 0
% 0.71/1.14 usesimpdemod = 5
% 0.71/1.14 usesimpres = 3
% 0.71/1.14
% 0.71/1.14 resimpinuse = 1000
% 0.71/1.14 resimpclauses = 20000
% 0.71/1.14 substype = eqrewr
% 0.71/1.14 backwardsubs = 1
% 0.71/1.14 selectoldest = 5
% 0.71/1.14
% 0.71/1.14 litorderings [0] = split
% 0.71/1.14 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.14
% 0.71/1.14 termordering = kbo
% 0.71/1.14
% 0.71/1.14 litapriori = 0
% 0.71/1.14 termapriori = 1
% 0.71/1.14 litaposteriori = 0
% 0.71/1.14 termaposteriori = 0
% 0.71/1.14 demodaposteriori = 0
% 0.71/1.14 ordereqreflfact = 0
% 0.71/1.14
% 0.71/1.14 litselect = negord
% 0.71/1.14
% 0.71/1.14 maxweight = 15
% 0.71/1.14 maxdepth = 30000
% 0.71/1.14 maxlength = 115
% 0.71/1.14 maxnrvars = 195
% 0.71/1.14 excuselevel = 1
% 0.71/1.14 increasemaxweight = 1
% 0.71/1.14
% 0.71/1.14 maxselected = 10000000
% 0.71/1.14 maxnrclauses = 10000000
% 0.71/1.14
% 0.71/1.14 showgenerated = 0
% 0.71/1.14 showkept = 0
% 0.71/1.14 showselected = 0
% 0.71/1.14 showdeleted = 0
% 0.71/1.14 showresimp = 1
% 0.71/1.14 showstatus = 2000
% 0.71/1.14
% 0.71/1.14 prologoutput = 1
% 0.71/1.14 nrgoals = 5000000
% 0.71/1.14 totalproof = 1
% 0.71/1.14
% 0.71/1.14 Symbols occurring in the translation:
% 0.71/1.14
% 0.71/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.14 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.71/1.14 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.71/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.14 successor [40, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.14 predecessor [41, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.71/1.14 'less_than' [43, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.14 n [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.71/1.14 k [46, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.14 i [47, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.71/1.14 m [48, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.14 one [49, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.71/1.14 a [50, 1] (w:1, o:24, a:1, s:1, b:0).
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 Starting Search:
% 0.71/1.14
% 0.71/1.14 Resimplifying inuse:
% 0.71/1.14 Done
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 Bliksems!, er is een bewijs:
% 0.71/1.14 % SZS status Unsatisfiable
% 0.71/1.14 % SZS output start Refutation
% 0.71/1.14
% 0.71/1.14 clause( 1, [ =( successor( predecessor( X ) ), X ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 3, [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 4, [ 'less_than'( predecessor( X ), X ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 5, [ 'less_than'( X, successor( X ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 6, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'(
% 0.71/1.14 Z, Y ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 7, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 9, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 10, [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y ) )
% 0.71/1.14 ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 11, [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z ) )
% 0.71/1.14 ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 15, [ ~( 'less_than'( n, m ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 16, [ 'less_than'( i, m ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 19, [ 'less_than'( a( m ), a( k ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 22, [ 'less_than'( X, i ), ~( 'less_than'( X, successor( n ) ) ),
% 0.71/1.14 ~( 'less_than'( a( X ), a( k ) ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 24, [ ~( 'less_than'( X, predecessor( X ) ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 25, [ ~( 'less_than'( successor( X ), X ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 27, [ ~( 'less_than'( m, i ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 68, [ ~( 'less_than'( X, Y ) ), ~( =( X, successor( Y ) ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 91, [ ~( 'less_than'( n, X ) ), ~( =( successor( m ), successor( X
% 0.71/1.14 ) ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 144, [ ~( 'less_than'( n, X ) ), ~( 'less_than'( X, m ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 202, [ ~( 'less_than'( X, m ) ), 'less_than'( X, n ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 293, [ ~( =( X, i ) ), ~( 'less_than'( m, X ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 299, [ ~( =( X, m ) ), ~( 'less_than'( n, X ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 503, [ ~( 'less_than'( m, successor( n ) ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 543, [ ~( =( X, m ) ), ~( 'less_than'( X, successor( n ) ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 714, [ ~( =( successor( n ), m ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 727, [ ~( =( X, m ) ), 'less_than'( successor( n ), X ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 734, [ 'less_than'( successor( n ), m ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 927, [ ~( =( successor( n ), successor( m ) ) ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 966, [ ~( =( successor( X ), successor( m ) ) ), 'less_than'( X, n
% 0.71/1.14 ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 973, [ 'less_than'( m, n ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 988, [ 'less_than'( X, n ), 'less_than'( m, X ) ] )
% 0.71/1.14 .
% 0.71/1.14 clause( 1086, [] )
% 0.71/1.14 .
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 % SZS output end Refutation
% 0.71/1.14 found a proof!
% 0.71/1.14
% 0.71/1.14 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.14
% 0.71/1.14 initialclauses(
% 0.71/1.14 [ clause( 1088, [ =( predecessor( successor( X ) ), X ) ] )
% 0.71/1.14 , clause( 1089, [ =( successor( predecessor( X ) ), X ) ] )
% 0.71/1.14 , clause( 1090, [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ]
% 0.71/1.14 )
% 0.71/1.14 , clause( 1091, [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ] )
% 0.71/1.14 , clause( 1092, [ 'less_than'( predecessor( X ), X ) ] )
% 0.71/1.14 , clause( 1093, [ 'less_than'( X, successor( X ) ) ] )
% 0.71/1.14 , clause( 1094, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~(
% 0.71/1.14 'less_than'( Z, Y ) ) ] )
% 0.71/1.14 , clause( 1095, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.71/1.14 , clause( 1096, [ ~( 'less_than'( X, X ) ) ] )
% 0.71/1.14 , clause( 1097, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.71/1.14 , clause( 1098, [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y
% 0.71/1.14 ) ) ] )
% 0.71/1.14 , clause( 1099, [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z
% 0.71/1.14 ) ) ] )
% 0.71/1.14 , clause( 1100, [ ~( 'less_than'( n, k ) ) ] )
% 0.71/1.14 , clause( 1101, [ ~( 'less_than'( k, i ) ) ] )
% 0.71/1.14 , clause( 1102, [ 'less_than'( i, n ) ] )
% 0.71/1.14 , clause( 1103, [ ~( 'less_than'( n, m ) ) ] )
% 0.71/1.14 , clause( 1104, [ 'less_than'( i, m ) ] )
% 0.71/1.14 , clause( 1105, [ ~( 'less_than'( i, one ) ) ] )
% 0.71/1.14 , clause( 1106, [ ~( =( k, m ) ) ] )
% 0.71/1.14 , clause( 1107, [ 'less_than'( a( m ), a( k ) ) ] )
% 0.71/1.14 , clause( 1108, [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, i ) ), ~(
% 0.71/1.14 'less_than'( a( X ), a( predecessor( X ) ) ) ) ] )
% 0.71/1.14 , clause( 1109, [ 'less_than'( X, i ), 'less_than'( n, X ), ~( 'less_than'(
% 0.71/1.14 one, X ) ), ~( 'less_than'( a( X ), a( predecessor( i ) ) ) ) ] )
% 0.71/1.14 , clause( 1110, [ 'less_than'( X, i ), ~( 'less_than'( X, successor( n ) )
% 0.71/1.14 ), ~( 'less_than'( a( X ), a( k ) ) ) ] )
% 0.71/1.14 ] ).
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 subsumption(
% 0.71/1.14 clause( 1, [ =( successor( predecessor( X ) ), X ) ] )
% 0.71/1.14 , clause( 1089, [ =( successor( predecessor( X ) ), X ) ] )
% 0.71/1.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 subsumption(
% 0.71/1.14 clause( 3, [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ] )
% 0.71/1.14 , clause( 1091, [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ] )
% 0.71/1.14 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.14 ), ==>( 1, 1 )] ) ).
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 subsumption(
% 0.71/1.14 clause( 4, [ 'less_than'( predecessor( X ), X ) ] )
% 0.71/1.14 , clause( 1092, [ 'less_than'( predecessor( X ), X ) ] )
% 0.71/1.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 subsumption(
% 0.71/1.14 clause( 5, [ 'less_than'( X, successor( X ) ) ] )
% 0.71/1.14 , clause( 1093, [ 'less_than'( X, successor( X ) ) ] )
% 0.71/1.14 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 subsumption(
% 0.71/1.14 clause( 6, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'(
% 0.71/1.14 Z, Y ) ) ] )
% 0.71/1.14 , clause( 1094, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------