%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV006-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:07 EDT 2022
% Result : Unsatisfiable 0.73s 1.18s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Tue Jun 14 19:36:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.18 *** allocated 10000 integers for termspace/termends
% 0.73/1.18 *** allocated 10000 integers for clauses
% 0.73/1.18 *** allocated 10000 integers for justifications
% 0.73/1.18 Bliksem 1.12
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 Automatic Strategy Selection
% 0.73/1.18
% 0.73/1.18 Clauses:
% 0.73/1.18 [
% 0.73/1.18 [ =( predecessor( successor( X ) ), X ) ],
% 0.73/1.18 [ =( successor( predecessor( X ) ), X ) ],
% 0.73/1.18 [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ],
% 0.73/1.18 [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ],
% 0.73/1.18 [ 'less_than'( predecessor( X ), X ) ],
% 0.73/1.18 [ 'less_than'( X, successor( X ) ) ],
% 0.73/1.18 [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'( Z, Y )
% 0.73/1.18 ) ],
% 0.73/1.18 [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ],
% 0.73/1.18 [ ~( 'less_than'( X, X ) ) ],
% 0.73/1.18 [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ],
% 0.73/1.18 [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y ) ) ],
% 0.73/1.18 [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z ) ) ],
% 0.73/1.18 [ ~( 'less_than'( n, m ) ) ],
% 0.73/1.18 [ 'less_than'( i, m ) ],
% 0.73/1.18 [ 'less_than'( i, n ) ],
% 0.73/1.18 [ ~( 'less_than'( i, one ) ) ],
% 0.73/1.18 [ 'less_than'( a( i ), a( m ) ) ],
% 0.73/1.18 [ 'less_than'( X, i ), ~( 'less_than'( X, successor( n ) ) ), ~(
% 0.73/1.18 'less_than'( a( X ), a( m ) ) ) ],
% 0.73/1.18 [ 'less_than'( X, i ), 'less_than'( n, X ), ~( 'less_than'( one, i ) ),
% 0.73/1.18 ~( 'less_than'( a( X ), a( predecessor( i ) ) ) ) ],
% 0.73/1.18 [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, i ) ), ~( 'less_than'(
% 0.73/1.18 a( X ), a( predecessor( X ) ) ) ) ]
% 0.73/1.18 ] .
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 percentage equality = 0.236842, percentage horn = 0.900000
% 0.73/1.18 This is a problem with some equality
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 Options Used:
% 0.73/1.18
% 0.73/1.18 useres = 1
% 0.73/1.18 useparamod = 1
% 0.73/1.18 useeqrefl = 1
% 0.73/1.18 useeqfact = 1
% 0.73/1.18 usefactor = 1
% 0.73/1.18 usesimpsplitting = 0
% 0.73/1.18 usesimpdemod = 5
% 0.73/1.18 usesimpres = 3
% 0.73/1.18
% 0.73/1.18 resimpinuse = 1000
% 0.73/1.18 resimpclauses = 20000
% 0.73/1.18 substype = eqrewr
% 0.73/1.18 backwardsubs = 1
% 0.73/1.18 selectoldest = 5
% 0.73/1.18
% 0.73/1.18 litorderings [0] = split
% 0.73/1.18 litorderings [1] = extend the termordering, first sorting on arguments
% 0.73/1.18
% 0.73/1.18 termordering = kbo
% 0.73/1.18
% 0.73/1.18 litapriori = 0
% 0.73/1.18 termapriori = 1
% 0.73/1.18 litaposteriori = 0
% 0.73/1.18 termaposteriori = 0
% 0.73/1.18 demodaposteriori = 0
% 0.73/1.18 ordereqreflfact = 0
% 0.73/1.18
% 0.73/1.18 litselect = negord
% 0.73/1.18
% 0.73/1.18 maxweight = 15
% 0.73/1.18 maxdepth = 30000
% 0.73/1.18 maxlength = 115
% 0.73/1.18 maxnrvars = 195
% 0.73/1.18 excuselevel = 1
% 0.73/1.18 increasemaxweight = 1
% 0.73/1.18
% 0.73/1.18 maxselected = 10000000
% 0.73/1.18 maxnrclauses = 10000000
% 0.73/1.18
% 0.73/1.18 showgenerated = 0
% 0.73/1.18 showkept = 0
% 0.73/1.18 showselected = 0
% 0.73/1.18 showdeleted = 0
% 0.73/1.18 showresimp = 1
% 0.73/1.18 showstatus = 2000
% 0.73/1.18
% 0.73/1.18 prologoutput = 1
% 0.73/1.18 nrgoals = 5000000
% 0.73/1.18 totalproof = 1
% 0.73/1.18
% 0.73/1.18 Symbols occurring in the translation:
% 0.73/1.18
% 0.73/1.18 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.18 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.73/1.18 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.73/1.18 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.18 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.18 successor [40, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.73/1.18 predecessor [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.73/1.18 'less_than' [43, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.73/1.18 n [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.73/1.18 m [46, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.73/1.18 i [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.73/1.18 one [48, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.73/1.18 a [49, 1] (w:1, o:23, a:1, s:1, b:0).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 Starting Search:
% 0.73/1.18
% 0.73/1.18 Resimplifying inuse:
% 0.73/1.18 Done
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 Bliksems!, er is een bewijs:
% 0.73/1.18 % SZS status Unsatisfiable
% 0.73/1.18 % SZS output start Refutation
% 0.73/1.18
% 0.73/1.18 clause( 5, [ 'less_than'( X, successor( X ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 6, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'(
% 0.73/1.18 Z, Y ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 7, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 8, [ ~( 'less_than'( X, X ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 9, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 12, [ ~( 'less_than'( n, m ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 13, [ 'less_than'( i, m ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 16, [ 'less_than'( a( i ), a( m ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 17, [ 'less_than'( X, i ), ~( 'less_than'( X, successor( n ) ) ),
% 0.73/1.18 ~( 'less_than'( a( X ), a( m ) ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 42, [ ~( 'less_than'( successor( X ), X ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 115, [ ~( 'less_than'( n, X ) ), ~( 'less_than'( X, m ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 117, [ 'less_than'( X, m ), ~( 'less_than'( X, i ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 164, [ ~( 'less_than'( X, m ) ), 'less_than'( X, n ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 166, [ 'less_than'( X, m ), 'less_than'( i, X ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 301, [ ~( 'less_than'( i, successor( n ) ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 1150, [ ~( 'less_than'( successor( n ), m ) ) ] )
% 0.73/1.18 .
% 0.73/1.18 clause( 1373, [] )
% 0.73/1.18 .
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 % SZS output end Refutation
% 0.73/1.18 found a proof!
% 0.73/1.18
% 0.73/1.18 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.18
% 0.73/1.18 initialclauses(
% 0.73/1.18 [ clause( 1375, [ =( predecessor( successor( X ) ), X ) ] )
% 0.73/1.18 , clause( 1376, [ =( successor( predecessor( X ) ), X ) ] )
% 0.73/1.18 , clause( 1377, [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ]
% 0.73/1.18 )
% 0.73/1.18 , clause( 1378, [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ] )
% 0.73/1.18 , clause( 1379, [ 'less_than'( predecessor( X ), X ) ] )
% 0.73/1.18 , clause( 1380, [ 'less_than'( X, successor( X ) ) ] )
% 0.73/1.18 , clause( 1381, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~(
% 0.73/1.18 'less_than'( Z, Y ) ) ] )
% 0.73/1.18 , clause( 1382, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.73/1.18 , clause( 1383, [ ~( 'less_than'( X, X ) ) ] )
% 0.73/1.18 , clause( 1384, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.73/1.18 , clause( 1385, [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y
% 0.73/1.18 ) ) ] )
% 0.73/1.18 , clause( 1386, [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z
% 0.73/1.18 ) ) ] )
% 0.73/1.18 , clause( 1387, [ ~( 'less_than'( n, m ) ) ] )
% 0.73/1.18 , clause( 1388, [ 'less_than'( i, m ) ] )
% 0.73/1.18 , clause( 1389, [ 'less_than'( i, n ) ] )
% 0.73/1.18 , clause( 1390, [ ~( 'less_than'( i, one ) ) ] )
% 0.73/1.18 , clause( 1391, [ 'less_than'( a( i ), a( m ) ) ] )
% 0.73/1.18 , clause( 1392, [ 'less_than'( X, i ), ~( 'less_than'( X, successor( n ) )
% 0.73/1.18 ), ~( 'less_than'( a( X ), a( m ) ) ) ] )
% 0.73/1.18 , clause( 1393, [ 'less_than'( X, i ), 'less_than'( n, X ), ~( 'less_than'(
% 0.73/1.18 one, i ) ), ~( 'less_than'( a( X ), a( predecessor( i ) ) ) ) ] )
% 0.73/1.18 , clause( 1394, [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, i ) ), ~(
% 0.73/1.18 'less_than'( a( X ), a( predecessor( X ) ) ) ) ] )
% 0.73/1.18 ] ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 subsumption(
% 0.73/1.18 clause( 5, [ 'less_than'( X, successor( X ) ) ] )
% 0.73/1.18 , clause( 1380, [ 'less_than'( X, successor( X ) ) ] )
% 0.73/1.18 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 subsumption(
% 0.73/1.18 clause( 6, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'(
% 0.73/1.18 Z, Y ) ) ] )
% 0.73/1.18 , clause( 1381, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~(
% 0.73/1.18 'less_than'( Z, Y ) ) ] )
% 0.73/1.18 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.18 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 subsumption(
% 0.73/1.18 clause( 7, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.73/1.18 , clause( 1382, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.73/1.18 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.18 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 subsumption(
% 0.73/1.18 clause( 8, [ ~( 'less_than'( X, X ) ) ] )
% 0.73/1.18 , clause( 1383, [ ~( 'less_than'( X, X ) ) ] )
% 0.73/1.18 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 subsumption(
% 0.73/1.18 clause( 9, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.73/1.18 , clause( 1384, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.73/1.18 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.18 ), ==>( 1, 1 )] ) ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 subsumption(
% 0.73/1.18 clause( 12, [ ~( 'less_than'( n, m ) ) ] )
% 0.73/1.18 , clause( 1387, [ ~( 'less_than'( n, m ) ) ] )
% 0.73/1.18 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 subsumption(
% 0.73/1.18 clause( 13, [ 'less_than'( i, m ) ] )
% 0.73/1.18 , clause( 1388, [ 'less_than'( i, m ) ] )
% 0.73/1.18 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 subsumption(
% 0.73/1.18 clause( 16, [ 'less_than'( a( i ), a( m ) ) ] )
% 0.73/1.18 , clause( 1391, [ 'less_than'( a( i ), a( m ) ) ] )
% 0.73/1.18 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 subsumption(
% 0.73/1.18 clause( 17, [ 'less_than'( X, i ), ~( 'less_than'( X, successor( n ) ) ),
% 0.73/1.18 ~( 'less_than'( a( X ), a( m ) ) ) ] )
% 0.73/1.18 , clause( 1392, [ 'less_than'( X, i ), ~( 'less_than'( X, successor( n ) )
% 0.73/1.18 ), ~( 'less_than'( a( X ), a( m ) ) ) ] )
% 0.73/1.18 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.73/1.18 1 ), ==>( 2, 2 )] ) ).
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 resolution(
% 0.73/1.18 clause( 1459, [ ~( 'less_than'( successor( X ), X ) ) ] )
% 0.73/1.18 , clause( 9, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.73/1.18 , 0, clause( 5, [ 'less_than'( X, successor( X ) ) ] )
% 0.73/1.18 , 0, substitution( 0Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------