TSTP Solution File: SYN014-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN014-2 : 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 : Thu Jul 21 02:46:46 EDT 2022
% Result : Unsatisfiable 0.68s 1.09s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN014-2 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n019.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 : Mon Jul 11 23:29:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.68/1.09 *** allocated 10000 integers for termspace/termends
% 0.68/1.09 *** allocated 10000 integers for clauses
% 0.68/1.09 *** allocated 10000 integers for justifications
% 0.68/1.09 Bliksem 1.12
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Automatic Strategy Selection
% 0.68/1.09
% 0.68/1.09 Clauses:
% 0.68/1.09 [
% 0.68/1.09 [ equalish( X, X ) ],
% 0.68/1.09 [ ~( equalish( X, Y ) ), equalish( Y, X ) ],
% 0.68/1.09 [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X, Z ) ],
% 0.68/1.09 [ ~( equalish( X, Y ) ), ~( element( Z, X ) ), element( Z, Y ) ],
% 0.68/1.09 [ ~( element( X, Y ) ), ~( equalish( X, Z ) ), element( Z, Y ) ],
% 0.68/1.09 [ ~( element( X, a ) ), equalish( X, k ), equalish( X, a ) ],
% 0.68/1.09 [ ~( equalish( X, k ) ), element( X, a ), equalish( X, a ) ],
% 0.68/1.09 [ ~( equalish( f( X ), m ) ), ~( element( X, m ) ), equalish( X, m ) ]
% 0.68/1.09 ,
% 0.68/1.09 [ ~( equalish( f( X ), X ) ), ~( element( X, m ) ), equalish( X, m ) ]
% 0.68/1.09 ,
% 0.68/1.09 [ element( X, f( X ) ), ~( element( X, m ) ), equalish( X, m ) ],
% 0.68/1.09 [ element( f( X ), X ), ~( element( X, m ) ), equalish( X, m ) ],
% 0.68/1.09 [ ~( element( X, Y ) ), ~( element( Y, X ) ), equalish( X, Y ), equalish(
% 0.68/1.09 X, m ), element( Y, m ), equalish( Y, m ) ],
% 0.68/1.09 [ ~( equalish( g( X ), n ) ), element( X, n ), equalish( X, n ) ],
% 0.68/1.09 [ ~( equalish( g( X ), X ) ), element( X, n ), equalish( X, n ) ],
% 0.68/1.09 [ element( X, g( X ) ), element( X, n ), equalish( X, n ) ],
% 0.68/1.09 [ element( g( X ), X ), element( X, n ), equalish( X, n ) ],
% 0.68/1.09 [ ~( element( X, Y ) ), ~( element( Y, X ) ), equalish( X, Y ), equalish(
% 0.68/1.09 X, n ), ~( element( Y, n ) ), equalish( Y, n ) ],
% 0.68/1.09 [ ~( equalish( X, m ) ), element( X, k ), equalish( X, k ) ],
% 0.68/1.09 [ ~( equalish( X, n ) ), element( X, k ), equalish( X, k ) ],
% 0.68/1.09 [ ~( element( X, k ) ), equalish( X, n ), equalish( X, m ), equalish( X
% 0.68/1.09 , k ) ],
% 0.68/1.09 [ ~( equalish( n, a ) ) ],
% 0.68/1.09 [ ~( equalish( m, n ) ) ],
% 0.68/1.09 [ equalish( n, k ) ],
% 0.68/1.09 [ ~( equalish( m, a ) ) ],
% 0.68/1.09 [ ~( equalish( k, a ) ) ],
% 0.68/1.09 [ equalish( m, k ) ]
% 0.68/1.09 ] .
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 percentage equality = 0.000000, percentage horn = 0.500000
% 0.68/1.09 This a non-horn, non-equality problem
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Options Used:
% 0.68/1.09
% 0.68/1.09 useres = 1
% 0.68/1.09 useparamod = 0
% 0.68/1.09 useeqrefl = 0
% 0.68/1.09 useeqfact = 0
% 0.68/1.09 usefactor = 1
% 0.68/1.09 usesimpsplitting = 0
% 0.68/1.09 usesimpdemod = 0
% 0.68/1.09 usesimpres = 3
% 0.68/1.09
% 0.68/1.09 resimpinuse = 1000
% 0.68/1.09 resimpclauses = 20000
% 0.68/1.09 substype = standard
% 0.68/1.09 backwardsubs = 1
% 0.68/1.09 selectoldest = 5
% 0.68/1.09
% 0.68/1.09 litorderings [0] = split
% 0.68/1.09 litorderings [1] = liftord
% 0.68/1.09
% 0.68/1.09 termordering = none
% 0.68/1.09
% 0.68/1.09 litapriori = 1
% 0.68/1.09 termapriori = 0
% 0.68/1.09 litaposteriori = 0
% 0.68/1.09 termaposteriori = 0
% 0.68/1.09 demodaposteriori = 0
% 0.68/1.09 ordereqreflfact = 0
% 0.68/1.09
% 0.68/1.09 litselect = none
% 0.68/1.09
% 0.68/1.09 maxweight = 15
% 0.68/1.09 maxdepth = 30000
% 0.68/1.09 maxlength = 115
% 0.68/1.09 maxnrvars = 195
% 0.68/1.09 excuselevel = 1
% 0.68/1.09 increasemaxweight = 1
% 0.68/1.09
% 0.68/1.09 maxselected = 10000000
% 0.68/1.09 maxnrclauses = 10000000
% 0.68/1.09
% 0.68/1.09 showgenerated = 0
% 0.68/1.09 showkept = 0
% 0.68/1.09 showselected = 0
% 0.68/1.09 showdeleted = 0
% 0.68/1.09 showresimp = 1
% 0.68/1.09 showstatus = 2000
% 0.68/1.09
% 0.68/1.09 prologoutput = 1
% 0.68/1.09 nrgoals = 5000000
% 0.68/1.09 totalproof = 1
% 0.68/1.09
% 0.68/1.09 Symbols occurring in the translation:
% 0.68/1.09
% 0.68/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.09 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.68/1.09 ! [4, 1] (w:0, o:19, a:1, s:1, b:0),
% 0.68/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 equalish [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.68/1.09 element [46, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.68/1.09 a [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.68/1.09 k [48, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.68/1.09 f [49, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.68/1.09 m [50, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.68/1.09 g [51, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.68/1.09 n [52, 0] (w:1, o:18, a:1, s:1, b:0).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Starting Search:
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Bliksems!, er is een bewijs:
% 0.68/1.09 % SZS status Unsatisfiable
% 0.68/1.09 % SZS output start Refutation
% 0.68/1.09
% 0.68/1.09 clause( 1, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 2, [ ~( equalish( Y, Z ) ), equalish( X, Z ), ~( equalish( X, Y ) )
% 0.68/1.09 ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 21, [ ~( equalish( m, n ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 22, [ equalish( n, k ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 25, [ equalish( m, k ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 29, [ equalish( k, m ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 47, [ ~( equalish( n, m ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 48, [ ~( equalish( n, X ) ), ~( equalish( X, m ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 63, [] )
% 0.68/1.09 .
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 % SZS output end Refutation
% 0.68/1.09 found a proof!
% 0.68/1.09
% 0.68/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.09
% 0.68/1.09 initialclauses(
% 0.68/1.09 [ clause( 65, [ equalish( X, X ) ] )
% 0.68/1.09 , clause( 66, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.68/1.09 , clause( 67, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X,
% 0.68/1.09 Z ) ] )
% 0.68/1.09 , clause( 68, [ ~( equalish( X, Y ) ), ~( element( Z, X ) ), element( Z, Y
% 0.68/1.09 ) ] )
% 0.68/1.09 , clause( 69, [ ~( element( X, Y ) ), ~( equalish( X, Z ) ), element( Z, Y
% 0.68/1.09 ) ] )
% 0.68/1.09 , clause( 70, [ ~( element( X, a ) ), equalish( X, k ), equalish( X, a ) ]
% 0.68/1.09 )
% 0.68/1.09 , clause( 71, [ ~( equalish( X, k ) ), element( X, a ), equalish( X, a ) ]
% 0.68/1.09 )
% 0.68/1.09 , clause( 72, [ ~( equalish( f( X ), m ) ), ~( element( X, m ) ), equalish(
% 0.68/1.09 X, m ) ] )
% 0.68/1.09 , clause( 73, [ ~( equalish( f( X ), X ) ), ~( element( X, m ) ), equalish(
% 0.68/1.09 X, m ) ] )
% 0.68/1.09 , clause( 74, [ element( X, f( X ) ), ~( element( X, m ) ), equalish( X, m
% 0.68/1.09 ) ] )
% 0.68/1.09 , clause( 75, [ element( f( X ), X ), ~( element( X, m ) ), equalish( X, m
% 0.68/1.09 ) ] )
% 0.68/1.09 , clause( 76, [ ~( element( X, Y ) ), ~( element( Y, X ) ), equalish( X, Y
% 0.68/1.09 ), equalish( X, m ), element( Y, m ), equalish( Y, m ) ] )
% 0.68/1.09 , clause( 77, [ ~( equalish( g( X ), n ) ), element( X, n ), equalish( X, n
% 0.68/1.09 ) ] )
% 0.68/1.09 , clause( 78, [ ~( equalish( g( X ), X ) ), element( X, n ), equalish( X, n
% 0.68/1.09 ) ] )
% 0.68/1.09 , clause( 79, [ element( X, g( X ) ), element( X, n ), equalish( X, n ) ]
% 0.68/1.09 )
% 0.68/1.09 , clause( 80, [ element( g( X ), X ), element( X, n ), equalish( X, n ) ]
% 0.68/1.09 )
% 0.68/1.09 , clause( 81, [ ~( element( X, Y ) ), ~( element( Y, X ) ), equalish( X, Y
% 0.68/1.09 ), equalish( X, n ), ~( element( Y, n ) ), equalish( Y, n ) ] )
% 0.68/1.09 , clause( 82, [ ~( equalish( X, m ) ), element( X, k ), equalish( X, k ) ]
% 0.68/1.09 )
% 0.68/1.09 , clause( 83, [ ~( equalish( X, n ) ), element( X, k ), equalish( X, k ) ]
% 0.68/1.09 )
% 0.68/1.09 , clause( 84, [ ~( element( X, k ) ), equalish( X, n ), equalish( X, m ),
% 0.68/1.09 equalish( X, k ) ] )
% 0.68/1.09 , clause( 85, [ ~( equalish( n, a ) ) ] )
% 0.68/1.09 , clause( 86, [ ~( equalish( m, n ) ) ] )
% 0.68/1.09 , clause( 87, [ equalish( n, k ) ] )
% 0.68/1.09 , clause( 88, [ ~( equalish( m, a ) ) ] )
% 0.68/1.09 , clause( 89, [ ~( equalish( k, a ) ) ] )
% 0.68/1.09 , clause( 90, [ equalish( m, k ) ] )
% 0.68/1.09 ] ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 1, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.68/1.09 , clause( 66, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.68/1.09 ), ==>( 1, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 2, [ ~( equalish( Y, Z ) ), equalish( X, Z ), ~( equalish( X, Y ) )
% 0.68/1.09 ] )
% 0.68/1.09 , clause( 67, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X,
% 0.68/1.09 Z ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.09 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 21, [ ~( equalish( m, n ) ) ] )
% 0.68/1.09 , clause( 86, [ ~( equalish( m, n ) ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 22, [ equalish( n, k ) ] )
% 0.68/1.09 , clause( 87, [ equalish( n, k ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 25, [ equalish( m, k ) ] )
% 0.68/1.09 , clause( 90, [ equalish( m, k ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 128, [ equalish( k, m ) ] )
% 0.68/1.09 , clause( 1, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.68/1.09 , 1, clause( 25, [ equalish( m, k ) ] )
% 0.68/1.09 , 0, substitution( 0, [ :=( X, m ), :=( Y, k )] ), substitution( 1, [] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 29, [ equalish( k, m ) ] )
% 0.68/1.09 , clause( 128, [ equalish( k, m ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 129, [ ~( equalish( n, m ) ) ] )
% 0.68/1.09 , clause( 21, [ ~( equalish( m, n ) ) ] )
% 0.68/1.09 , 0, clause( 1, [ equalish( Y, X ), ~( equalish( X, Y ) ) ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, n ), :=( Y, m )] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 47, [ ~( equalish( n, m ) ) ] )
% 0.68/1.09 , clause( 129, [ ~( equalish( n, m ) ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 130, [ ~( equalish( X, m ) ), ~( equalish( n, X ) ) ] )
% 0.68/1.09 , clause( 47, [ ~( equalish( n, m ) ) ] )
% 0.68/1.09 , 0, clause( 2, [ ~( equalish( Y, Z ) ), equalish( X, Z ), ~( equalish( X,
% 0.68/1.09 Y ) ) ] )
% 0.68/1.09 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, n ), :=( Y, X ), :=(
% 0.68/1.09 Z, m )] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 48, [ ~( equalish( n, X ) ), ~( equalish( X, m ) ) ] )
% 0.68/1.09 , clause( 130, [ ~( equalish( X, m ) ), ~( equalish( n, X ) ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.68/1.09 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 131, [ ~( equalish( n, k ) ) ] )
% 0.68/1.09 , clause( 48, [ ~( equalish( n, X ) ), ~( equalish( X, m ) ) ] )
% 0.68/1.09 , 1, clause( 29, [ equalish( k, m ) ] )
% 0.68/1.09 , 0, substitution( 0, [ :=( X, k )] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 132, [] )
% 0.68/1.09 , clause( 131, [ ~( equalish( n, k ) ) ] )
% 0.68/1.09 , 0, clause( 22, [ equalish( n, k ) ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 63, [] )
% 0.68/1.09 , clause( 132, [] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 end.
% 0.68/1.09
% 0.68/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.09
% 0.68/1.09 Memory use:
% 0.68/1.09
% 0.68/1.09 space for terms: 1262
% 0.68/1.09 space for clauses: 2956
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 clauses generated: 127
% 0.68/1.09 clauses kept: 64
% 0.68/1.09 clauses selected: 22
% 0.68/1.09 clauses deleted: 0
% 0.68/1.09 clauses inuse deleted: 0
% 0.68/1.09
% 0.68/1.09 subsentry: 290
% 0.68/1.09 literals s-matched: 217
% 0.68/1.09 literals matched: 211
% 0.68/1.09 full subsumption: 73
% 0.68/1.09
% 0.68/1.09 checksum: -1142970423
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Bliksem ended
%------------------------------------------------------------------------------