TSTP Solution File: SWV003-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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.77s 1.13s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWV003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n019.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 14:18:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.77/1.13 *** allocated 10000 integers for termspace/termends
% 0.77/1.13 *** allocated 10000 integers for clauses
% 0.77/1.13 *** allocated 10000 integers for justifications
% 0.77/1.13 Bliksem 1.12
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 Automatic Strategy Selection
% 0.77/1.13
% 0.77/1.13 Clauses:
% 0.77/1.13 [
% 0.77/1.13 [ =( predecessor( successor( X ) ), X ) ],
% 0.77/1.13 [ =( successor( predecessor( X ) ), X ) ],
% 0.77/1.13 [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ],
% 0.77/1.13 [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ],
% 0.77/1.13 [ 'less_than'( predecessor( X ), X ) ],
% 0.77/1.13 [ 'less_than'( X, successor( X ) ) ],
% 0.77/1.13 [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'( Z, Y )
% 0.77/1.13 ) ],
% 0.77/1.13 [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ],
% 0.77/1.13 [ ~( 'less_than'( X, X ) ) ],
% 0.77/1.13 [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ],
% 0.77/1.13 [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y ) ) ],
% 0.77/1.13 [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z ) ) ],
% 0.77/1.13 [ ~( 'less_than'( n, j ) ) ],
% 0.77/1.13 [ 'less_than'( k, j ) ],
% 0.77/1.13 [ ~( 'less_than'( k, i ) ) ],
% 0.77/1.13 [ 'less_than'( i, n ) ],
% 0.77/1.13 [ 'less_than'( a( j ), a( k ) ) ],
% 0.77/1.13 [ 'less_than'( X, i ), ~( 'less_than'( X, j ) ), ~( 'less_than'( a( X )
% 0.77/1.13 , a( k ) ) ) ],
% 0.77/1.13 [ 'less_than'( X, i ), 'less_than'( n, X ), ~( 'less_than'( one, i ) ),
% 0.77/1.13 ~( 'less_than'( a( X ), a( predecessor( i ) ) ) ) ],
% 0.77/1.13 [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, i ) ), ~( 'less_than'(
% 0.77/1.13 a( X ), a( predecessor( X ) ) ) ) ],
% 0.77/1.13 [ 'less_than'( j, i ) ]
% 0.77/1.13 ] .
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 percentage equality = 0.230769, percentage horn = 0.904762
% 0.77/1.13 This is a problem with some equality
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 Options Used:
% 0.77/1.13
% 0.77/1.13 useres = 1
% 0.77/1.13 useparamod = 1
% 0.77/1.13 useeqrefl = 1
% 0.77/1.13 useeqfact = 1
% 0.77/1.13 usefactor = 1
% 0.77/1.13 usesimpsplitting = 0
% 0.77/1.13 usesimpdemod = 5
% 0.77/1.13 usesimpres = 3
% 0.77/1.13
% 0.77/1.13 resimpinuse = 1000
% 0.77/1.13 resimpclauses = 20000
% 0.77/1.13 substype = eqrewr
% 0.77/1.13 backwardsubs = 1
% 0.77/1.13 selectoldest = 5
% 0.77/1.13
% 0.77/1.13 litorderings [0] = split
% 0.77/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.77/1.13
% 0.77/1.13 termordering = kbo
% 0.77/1.13
% 0.77/1.13 litapriori = 0
% 0.77/1.13 termapriori = 1
% 0.77/1.13 litaposteriori = 0
% 0.77/1.13 termaposteriori = 0
% 0.77/1.13 demodaposteriori = 0
% 0.77/1.13 ordereqreflfact = 0
% 0.77/1.13
% 0.77/1.13 litselect = negord
% 0.77/1.13
% 0.77/1.13 maxweight = 15
% 0.77/1.13 maxdepth = 30000
% 0.77/1.13 maxlength = 115
% 0.77/1.13 maxnrvars = 195
% 0.77/1.13 excuselevel = 1
% 0.77/1.13 increasemaxweight = 1
% 0.77/1.13
% 0.77/1.13 maxselected = 10000000
% 0.77/1.13 maxnrclauses = 10000000
% 0.77/1.13
% 0.77/1.13 showgenerated = 0
% 0.77/1.13 showkept = 0
% 0.77/1.13 showselected = 0
% 0.77/1.13 showdeleted = 0
% 0.77/1.13 showresimp = 1
% 0.77/1.13 showstatus = 2000
% 0.77/1.13
% 0.77/1.13 prologoutput = 1
% 0.77/1.13 nrgoals = 5000000
% 0.77/1.13 totalproof = 1
% 0.77/1.13
% 0.77/1.13 Symbols occurring in the translation:
% 0.77/1.13
% 0.77/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.77/1.13 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.77/1.13 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.77/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.77/1.13 successor [40, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.77/1.13 predecessor [41, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.77/1.13 'less_than' [43, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.77/1.13 n [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.77/1.13 j [46, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.77/1.13 k [47, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.77/1.13 i [48, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.77/1.13 a [49, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.77/1.13 one [50, 0] (w:1, o:7, a:1, s:1, b:0).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 Starting Search:
% 0.77/1.13
% 0.77/1.13 Resimplifying inuse:
% 0.77/1.13 Done
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 Bliksems!, er is een bewijs:
% 0.77/1.13 % SZS status Unsatisfiable
% 0.77/1.13 % SZS output start Refutation
% 0.77/1.13
% 0.77/1.13 clause( 2, [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 6, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'(
% 0.77/1.13 Z, Y ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 7, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 9, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 13, [ 'less_than'( k, j ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 14, [ ~( 'less_than'( k, i ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 20, [ 'less_than'( j, i ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 24, [ ~( 'less_than'( j, k ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 26, [ ~( 'less_than'( i, j ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 29, [ ~( 'less_than'( X, j ) ), ~( =( predecessor( i ), predecessor(
% 0.77/1.13 X ) ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 49, [ ~( 'less_than'( k, X ) ), ~( =( predecessor( i ), predecessor(
% 0.77/1.13 X ) ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 146, [ ~( 'less_than'( k, X ) ), ~( 'less_than'( X, i ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 203, [ ~( 'less_than'( X, i ) ), 'less_than'( X, k ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 979, [ ~( =( predecessor( k ), predecessor( i ) ) ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 1004, [ ~( =( predecessor( X ), predecessor( i ) ) ), 'less_than'(
% 0.77/1.13 X, k ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 1011, [ 'less_than'( i, k ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 1026, [ 'less_than'( X, k ), 'less_than'( i, X ) ] )
% 0.77/1.13 .
% 0.77/1.13 clause( 1303, [] )
% 0.77/1.13 .
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 % SZS output end Refutation
% 0.77/1.13 found a proof!
% 0.77/1.13
% 0.77/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.77/1.13
% 0.77/1.13 initialclauses(
% 0.77/1.13 [ clause( 1305, [ =( predecessor( successor( X ) ), X ) ] )
% 0.77/1.13 , clause( 1306, [ =( successor( predecessor( X ) ), X ) ] )
% 0.77/1.13 , clause( 1307, [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ]
% 0.77/1.13 )
% 0.77/1.13 , clause( 1308, [ =( X, Y ), ~( =( successor( X ), successor( Y ) ) ) ] )
% 0.77/1.13 , clause( 1309, [ 'less_than'( predecessor( X ), X ) ] )
% 0.77/1.13 , clause( 1310, [ 'less_than'( X, successor( X ) ) ] )
% 0.77/1.13 , clause( 1311, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~(
% 0.77/1.13 'less_than'( Z, Y ) ) ] )
% 0.77/1.13 , clause( 1312, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.77/1.13 , clause( 1313, [ ~( 'less_than'( X, X ) ) ] )
% 0.77/1.13 , clause( 1314, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.77/1.13 , clause( 1315, [ 'less_than'( X, Y ), ~( =( Z, X ) ), ~( 'less_than'( Z, Y
% 0.77/1.13 ) ) ] )
% 0.77/1.13 , clause( 1316, [ 'less_than'( X, Y ), ~( =( Z, Y ) ), ~( 'less_than'( X, Z
% 0.77/1.13 ) ) ] )
% 0.77/1.13 , clause( 1317, [ ~( 'less_than'( n, j ) ) ] )
% 0.77/1.13 , clause( 1318, [ 'less_than'( k, j ) ] )
% 0.77/1.13 , clause( 1319, [ ~( 'less_than'( k, i ) ) ] )
% 0.77/1.13 , clause( 1320, [ 'less_than'( i, n ) ] )
% 0.77/1.13 , clause( 1321, [ 'less_than'( a( j ), a( k ) ) ] )
% 0.77/1.13 , clause( 1322, [ 'less_than'( X, i ), ~( 'less_than'( X, j ) ), ~(
% 0.77/1.13 'less_than'( a( X ), a( k ) ) ) ] )
% 0.77/1.13 , clause( 1323, [ 'less_than'( X, i ), 'less_than'( n, X ), ~( 'less_than'(
% 0.77/1.13 one, i ) ), ~( 'less_than'( a( X ), a( predecessor( i ) ) ) ) ] )
% 0.77/1.13 , clause( 1324, [ ~( 'less_than'( one, X ) ), ~( 'less_than'( X, i ) ), ~(
% 0.77/1.13 'less_than'( a( X ), a( predecessor( X ) ) ) ) ] )
% 0.77/1.13 , clause( 1325, [ 'less_than'( j, i ) ] )
% 0.77/1.13 ] ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 subsumption(
% 0.77/1.13 clause( 2, [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ] )
% 0.77/1.13 , clause( 1307, [ =( X, Y ), ~( =( predecessor( X ), predecessor( Y ) ) ) ]
% 0.77/1.13 )
% 0.77/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.77/1.13 ), ==>( 1, 1 )] ) ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 subsumption(
% 0.77/1.13 clause( 6, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~( 'less_than'(
% 0.77/1.13 Z, Y ) ) ] )
% 0.77/1.13 , clause( 1311, [ 'less_than'( X, Y ), ~( 'less_than'( X, Z ) ), ~(
% 0.77/1.13 'less_than'( Z, Y ) ) ] )
% 0.77/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.77/1.13 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 subsumption(
% 0.77/1.13 clause( 7, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.77/1.13 , clause( 1312, [ 'less_than'( X, Y ), 'less_than'( Y, X ), =( X, Y ) ] )
% 0.77/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.77/1.13 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 subsumption(
% 0.77/1.13 clause( 9, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.77/1.13 , clause( 1314, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.77/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.77/1.13 ), ==>( 1, 1 )] ) ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 subsumption(
% 0.77/1.13 clause( 13, [ 'less_than'( k, j ) ] )
% 0.77/1.13 , clause( 1318, [ 'less_than'( k, j ) ] )
% 0.77/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 subsumption(
% 0.77/1.13 clause( 14, [ ~( 'less_than'( k, i ) ) ] )
% 0.77/1.13 , clause( 1319, [ ~( 'less_than'( k, i ) ) ] )
% 0.77/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 subsumption(
% 0.77/1.13 clause( 20, [ 'less_than'( j, i ) ] )
% 0.77/1.13 , clause( 1325, [ 'less_than'( j, i ) ] )
% 0.77/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 resolution(
% 0.77/1.13 clause( 1374, [ ~( 'less_than'( j, k ) ) ] )
% 0.77/1.13 , clause( 9, [ ~( 'less_than'( X, Y ) ), ~( 'less_than'( Y, X ) ) ] )
% 0.77/1.13 , 0, clause( 13, [ 'less_than'( k, j ) ] )
% 0.77/1.13 , 0, substitution( 0, [ :=( X, k ), :=( Y, j )] ), substitution( 1, [] )
% 0.77/1.13 ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 subsumption(
% 0.77/1.13 clause( 24, [ ~( 'less_than'( j, k ) ) ] )
% 0.77/1.13 , clause( 1374, [ ~( 'less_than'( j, k ) ) ] )
% 0.77/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.13
% 0.77/1.13
% 0.77/1.13 resolution(
% 0.77/1.13 clause( 1375, [ ~( 'less_than'( i, j ) ) ] )
% 0.77/1.13 , clause( 9, [ ~( 'less_than'( X, Y ) ), ~(Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------