TSTP Solution File: CAT016-4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CAT016-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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 14 23:54:14 EDT 2022
% Result : Unsatisfiable 0.74s 1.09s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CAT016-4 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Sun May 29 23:16:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.09 *** allocated 10000 integers for termspace/termends
% 0.74/1.09 *** allocated 10000 integers for clauses
% 0.74/1.09 *** allocated 10000 integers for justifications
% 0.74/1.09 Bliksem 1.12
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Automatic Strategy Selection
% 0.74/1.09
% 0.74/1.09 Clauses:
% 0.74/1.09 [
% 0.74/1.09 [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ],
% 0.74/1.09 [ ~( equivalent( X, Y ) ), =( X, Y ) ],
% 0.74/1.09 [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ],
% 0.74/1.09 [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ],
% 0.74/1.09 [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ],
% 0.74/1.09 [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( X ) )
% 0.74/1.09 ],
% 0.74/1.09 [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), codomain( Y )
% 0.74/1.09 ) ],
% 0.74/1.09 [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), codomain( Y ) )
% 0.74/1.09 ), 'there_exists'( compose( X, Y ) ) ],
% 0.74/1.09 [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.74/1.09 ,
% 0.74/1.09 [ =( compose( X, domain( X ) ), X ) ],
% 0.74/1.09 [ =( compose( codomain( X ), X ), X ) ],
% 0.74/1.09 [ 'there_exists'( a ) ],
% 0.74/1.09 [ ~( 'there_exists'( domain( a ) ) ) ]
% 0.74/1.09 ] .
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 percentage equality = 0.304348, percentage horn = 1.000000
% 0.74/1.09 This is a problem with some equality
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Options Used:
% 0.74/1.09
% 0.74/1.09 useres = 1
% 0.74/1.09 useparamod = 1
% 0.74/1.09 useeqrefl = 1
% 0.74/1.09 useeqfact = 1
% 0.74/1.09 usefactor = 1
% 0.74/1.09 usesimpsplitting = 0
% 0.74/1.09 usesimpdemod = 5
% 0.74/1.09 usesimpres = 3
% 0.74/1.09
% 0.74/1.09 resimpinuse = 1000
% 0.74/1.09 resimpclauses = 20000
% 0.74/1.09 substype = eqrewr
% 0.74/1.09 backwardsubs = 1
% 0.74/1.09 selectoldest = 5
% 0.74/1.09
% 0.74/1.09 litorderings [0] = split
% 0.74/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.09
% 0.74/1.09 termordering = kbo
% 0.74/1.09
% 0.74/1.09 litapriori = 0
% 0.74/1.09 termapriori = 1
% 0.74/1.09 litaposteriori = 0
% 0.74/1.09 termaposteriori = 0
% 0.74/1.09 demodaposteriori = 0
% 0.74/1.09 ordereqreflfact = 0
% 0.74/1.09
% 0.74/1.09 litselect = negord
% 0.74/1.09
% 0.74/1.09 maxweight = 15
% 0.74/1.09 maxdepth = 30000
% 0.74/1.09 maxlength = 115
% 0.74/1.09 maxnrvars = 195
% 0.74/1.09 excuselevel = 1
% 0.74/1.09 increasemaxweight = 1
% 0.74/1.09
% 0.74/1.09 maxselected = 10000000
% 0.74/1.09 maxnrclauses = 10000000
% 0.74/1.09
% 0.74/1.09 showgenerated = 0
% 0.74/1.09 showkept = 0
% 0.74/1.09 showselected = 0
% 0.74/1.09 showdeleted = 0
% 0.74/1.09 showresimp = 1
% 0.74/1.09 showstatus = 2000
% 0.74/1.09
% 0.74/1.09 prologoutput = 1
% 0.74/1.09 nrgoals = 5000000
% 0.74/1.09 totalproof = 1
% 0.74/1.09
% 0.74/1.09 Symbols occurring in the translation:
% 0.74/1.09
% 0.74/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.09 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.74/1.09 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.74/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.09 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.74/1.09 'there_exists' [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.74/1.09 domain [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.74/1.09 codomain [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.74/1.09 compose [45, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.74/1.09 a [47, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Starting Search:
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 Bliksems!, er is een bewijs:
% 0.74/1.09 % SZS status Unsatisfiable
% 0.74/1.09 % SZS output start Refutation
% 0.74/1.09
% 0.74/1.09 clause( 1, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 0.74/1.09 .
% 0.74/1.09 clause( 2, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ]
% 0.74/1.09 )
% 0.74/1.09 .
% 0.74/1.09 clause( 5, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain(
% 0.74/1.09 X ) ) ] )
% 0.74/1.09 .
% 0.74/1.09 clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.74/1.09 .
% 0.74/1.09 clause( 11, [ 'there_exists'( a ) ] )
% 0.74/1.09 .
% 0.74/1.09 clause( 12, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 0.74/1.09 .
% 0.74/1.09 clause( 23, [ 'there_exists'( X ), ~( equivalent( a, X ) ) ] )
% 0.74/1.09 .
% 0.74/1.09 clause( 38, [ ~( =( a, X ) ), 'there_exists'( X ) ] )
% 0.74/1.09 .
% 0.74/1.09 clause( 76, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 0.74/1.09 .
% 0.74/1.09 clause( 80, [ ~( =( compose( a, X ), a ) ) ] )
% 0.74/1.09 .
% 0.74/1.09 clause( 199, [] )
% 0.74/1.09 .
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 % SZS output end Refutation
% 0.74/1.09 found a proof!
% 0.74/1.09
% 0.74/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.09
% 0.74/1.09 initialclauses(
% 0.74/1.09 [ clause( 201, [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ] )
% 0.74/1.09 , clause( 202, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 0.74/1.09 , clause( 203, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y
% 0.74/1.09 ) ] )
% 0.74/1.09 , clause( 204, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.74/1.09 )
% 0.74/1.09 , clause( 205, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.74/1.09 ] )
% 0.74/1.09 , clause( 206, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'(
% 0.74/1.09 domain( X ) ) ] )
% 0.74/1.09 , clause( 207, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.74/1.09 codomain( Y ) ) ] )
% 0.74/1.09 , clause( 208, [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ),
% 3.33/3.69 codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 3.33/3.69 , clause( 209, [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y )
% 3.33/3.69 , Z ) ) ] )
% 3.33/3.69 , clause( 210, [ =( compose( X, domain( X ) ), X ) ] )
% 3.33/3.69 , clause( 211, [ =( compose( codomain( X ), X ), X ) ] )
% 3.33/3.69 , clause( 212, [ 'there_exists'( a ) ] )
% 3.33/3.69 , clause( 213, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 3.33/3.69 ] ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 1, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 3.33/3.69 , clause( 202, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 3.33/3.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.33/3.69 ), ==>( 1, 1 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 2, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ]
% 3.33/3.69 )
% 3.33/3.69 , clause( 203, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y
% 3.33/3.69 ) ] )
% 3.33/3.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.33/3.69 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 5, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain(
% 3.33/3.69 X ) ) ] )
% 3.33/3.69 , clause( 206, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'(
% 3.33/3.69 domain( X ) ) ] )
% 3.33/3.69 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 3.33/3.69 ), ==>( 1, 1 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 3.33/3.69 , clause( 210, [ =( compose( X, domain( X ) ), X ) ] )
% 3.33/3.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 11, [ 'there_exists'( a ) ] )
% 3.33/3.69 , clause( 212, [ 'there_exists'( a ) ] )
% 3.33/3.69 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 12, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 3.33/3.69 , clause( 213, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 3.33/3.69 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 paramod(
% 3.33/3.69 clause( 694, [ 'there_exists'( X ), ~( equivalent( a, X ) ) ] )
% 3.33/3.69 , clause( 1, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 3.33/3.69 , 1, clause( 11, [ 'there_exists'( a ) ] )
% 3.33/3.69 , 0, 1, substitution( 0, [ :=( X, a ), :=( Y, X )] ), substitution( 1, [] )
% 3.33/3.69 ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 23, [ 'there_exists'( X ), ~( equivalent( a, X ) ) ] )
% 3.33/3.69 , clause( 694, [ 'there_exists'( X ), ~( equivalent( a, X ) ) ] )
% 3.33/3.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 3.33/3.69 1 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 eqswap(
% 3.33/3.69 clause( 1148, [ ~( =( Y, X ) ), ~( 'there_exists'( X ) ), equivalent( X, Y
% 3.33/3.69 ) ] )
% 3.33/3.69 , clause( 2, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y )
% 3.33/3.69 ] )
% 3.33/3.69 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 resolution(
% 3.33/3.69 clause( 1150, [ 'there_exists'( X ), ~( =( X, a ) ), ~( 'there_exists'( a )
% 3.33/3.69 ) ] )
% 3.33/3.69 , clause( 23, [ 'there_exists'( X ), ~( equivalent( a, X ) ) ] )
% 3.33/3.69 , 1, clause( 1148, [ ~( =( Y, X ) ), ~( 'there_exists'( X ) ), equivalent(
% 3.33/3.69 X, Y ) ] )
% 3.33/3.69 , 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, a ), :=( Y
% 3.33/3.69 , X )] )).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 resolution(
% 3.33/3.69 clause( 1151, [ 'there_exists'( X ), ~( =( X, a ) ) ] )
% 3.33/3.69 , clause( 1150, [ 'there_exists'( X ), ~( =( X, a ) ), ~( 'there_exists'( a
% 3.33/3.69 ) ) ] )
% 3.33/3.69 , 2, clause( 11, [ 'there_exists'( a ) ] )
% 3.33/3.69 , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [] )).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 eqswap(
% 3.33/3.69 clause( 1152, [ ~( =( a, X ) ), 'there_exists'( X ) ] )
% 3.33/3.69 , clause( 1151, [ 'there_exists'( X ), ~( =( X, a ) ) ] )
% 3.33/3.69 , 1, substitution( 0, [ :=( X, X )] )).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 38, [ ~( =( a, X ) ), 'there_exists'( X ) ] )
% 3.33/3.69 , clause( 1152, [ ~( =( a, X ) ), 'there_exists'( X ) ] )
% 3.33/3.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 3.33/3.69 1 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 resolution(
% 3.33/3.69 clause( 1153, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 3.33/3.69 , clause( 12, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 3.33/3.69 , 0, clause( 5, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'(
% 3.33/3.69 domain( X ) ) ] )
% 3.33/3.69 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, X )] )
% 3.33/3.69 ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 76, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 3.33/3.69 , clause( 1153, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 3.33/3.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 eqswap(
% 3.33/3.69 clause( 1154, [ ~( =( X, a ) ), 'there_exists'( X ) ] )
% 3.33/3.69 , clause( 38, [ ~( =( a, X ) ), 'there_exists'( X ) ] )
% 3.33/3.69 , 0, substitution( 0, [ :=( X, X )] )).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 resolution(
% 3.33/3.69 clause( 1155, [ ~( =( compose( a, X ), a ) ) ] )
% 3.33/3.69 , clause( 76, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 3.33/3.69 , 0, clause( 1154, [ ~( =( X, a ) ), 'there_exists'( X ) ] )
% 3.33/3.69 , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, compose( a
% 3.33/3.69 , X ) )] )).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 80, [ ~( =( compose( a, X ), a ) ) ] )
% 3.33/3.69 , clause( 1155, [ ~( =( compose( a, X ), a ) ) ] )
% 3.33/3.69 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 eqswap(
% 3.33/3.69 clause( 1157, [ =( X, compose( X, domain( X ) ) ) ] )
% 3.33/3.69 , clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 3.33/3.69 , 0, substitution( 0, [ :=( X, X )] )).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 eqswap(
% 3.33/3.69 clause( 1158, [ ~( =( a, compose( a, X ) ) ) ] )
% 3.33/3.69 , clause( 80, [ ~( =( compose( a, X ), a ) ) ] )
% 3.33/3.69 , 0, substitution( 0, [ :=( X, X )] )).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 resolution(
% 3.33/3.69 clause( 1159, [] )
% 3.33/3.69 , clause( 1158, [ ~( =( a, compose( a, X ) ) ) ] )
% 3.33/3.69 , 0, clause( 1157, [ =( X, compose( X, domain( X ) ) ) ] )
% 3.33/3.69 , 0, substitution( 0, [ :=( X, domain( a ) )] ), substitution( 1, [ :=( X,
% 3.33/3.69 a )] )).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 subsumption(
% 3.33/3.69 clause( 199, [] )
% 3.33/3.69 , clause( 1159, [] )
% 3.33/3.69 , substitution( 0, [] ), permutation( 0, [] ) ).
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 end.
% 3.33/3.69
% 3.33/3.69 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 3.33/3.69
% 3.33/3.69 Memory use:
% 3.33/3.69
% 3.33/3.69 space for terms: 2159
% 3.33/3.69 space for clauses: 10207
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 clauses generated: 346
% 3.33/3.69 clauses kept: 200
% 3.33/3.69 clauses selected: 34
% 3.33/3.69 clauses deleted: 2
% 3.33/3.69 clauses inuse deleted: 0
% 3.33/3.69
% 3.33/3.69 subsentry: 639586
% 3.33/3.69 literals s-matched: 527934
% 3.33/3.69 literals matched: 527921
% 3.33/3.69 full subsumption: 527093
% 3.33/3.69
% 3.33/3.69 checksum: 51620084
% 3.33/3.69
% 3.33/3.69
% 3.33/3.69 Bliksem ended
%------------------------------------------------------------------------------