TSTP Solution File: CAT012-4 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CAT012-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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:12 EDT 2022
% Result : Unsatisfiable 0.45s 1.11s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT012-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n025.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 : Sun May 29 20:38:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.11 *** allocated 10000 integers for termspace/termends
% 0.45/1.11 *** allocated 10000 integers for clauses
% 0.45/1.11 *** allocated 10000 integers for justifications
% 0.45/1.11 Bliksem 1.12
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Automatic Strategy Selection
% 0.45/1.11
% 0.45/1.11 Clauses:
% 0.45/1.11 [
% 0.45/1.11 [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ],
% 0.45/1.11 [ ~( equivalent( X, Y ) ), =( X, Y ) ],
% 0.45/1.11 [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ],
% 0.45/1.11 [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ],
% 0.45/1.11 [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ],
% 0.45/1.11 [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( X ) )
% 0.45/1.11 ],
% 0.45/1.11 [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), codomain( Y )
% 0.45/1.11 ) ],
% 0.45/1.11 [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), codomain( Y ) )
% 0.45/1.11 ), 'there_exists'( compose( X, Y ) ) ],
% 0.45/1.11 [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.45/1.11 ,
% 0.45/1.11 [ =( compose( X, domain( X ) ), X ) ],
% 0.45/1.11 [ =( compose( codomain( X ), X ), X ) ],
% 0.45/1.11 [ 'there_exists'( domain( a ) ) ],
% 0.45/1.11 [ ~( =( codomain( domain( a ) ), domain( a ) ) ) ]
% 0.45/1.11 ] .
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 percentage equality = 0.347826, percentage horn = 1.000000
% 0.45/1.11 This is a problem with some equality
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Options Used:
% 0.45/1.11
% 0.45/1.11 useres = 1
% 0.45/1.11 useparamod = 1
% 0.45/1.11 useeqrefl = 1
% 0.45/1.11 useeqfact = 1
% 0.45/1.11 usefactor = 1
% 0.45/1.11 usesimpsplitting = 0
% 0.45/1.11 usesimpdemod = 5
% 0.45/1.11 usesimpres = 3
% 0.45/1.11
% 0.45/1.11 resimpinuse = 1000
% 0.45/1.11 resimpclauses = 20000
% 0.45/1.11 substype = eqrewr
% 0.45/1.11 backwardsubs = 1
% 0.45/1.11 selectoldest = 5
% 0.45/1.11
% 0.45/1.11 litorderings [0] = split
% 0.45/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.11
% 0.45/1.11 termordering = kbo
% 0.45/1.11
% 0.45/1.11 litapriori = 0
% 0.45/1.11 termapriori = 1
% 0.45/1.11 litaposteriori = 0
% 0.45/1.11 termaposteriori = 0
% 0.45/1.11 demodaposteriori = 0
% 0.45/1.11 ordereqreflfact = 0
% 0.45/1.11
% 0.45/1.11 litselect = negord
% 0.45/1.11
% 0.45/1.11 maxweight = 15
% 0.45/1.11 maxdepth = 30000
% 0.45/1.11 maxlength = 115
% 0.45/1.11 maxnrvars = 195
% 0.45/1.11 excuselevel = 1
% 0.45/1.11 increasemaxweight = 1
% 0.45/1.11
% 0.45/1.11 maxselected = 10000000
% 0.45/1.11 maxnrclauses = 10000000
% 0.45/1.11
% 0.45/1.11 showgenerated = 0
% 0.45/1.11 showkept = 0
% 0.45/1.11 showselected = 0
% 0.45/1.11 showdeleted = 0
% 0.45/1.11 showresimp = 1
% 0.45/1.11 showstatus = 2000
% 0.45/1.11
% 0.45/1.11 prologoutput = 1
% 0.45/1.11 nrgoals = 5000000
% 0.45/1.11 totalproof = 1
% 0.45/1.11
% 0.45/1.11 Symbols occurring in the translation:
% 0.45/1.11
% 0.45/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.11 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.45/1.11 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.45/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.11 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.45/1.11 'there_exists' [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.45/1.11 domain [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.45/1.11 codomain [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.45/1.11 compose [45, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.45/1.11 a [47, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Starting Search:
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Bliksems!, er is een bewijs:
% 0.45/1.11 % SZS status Unsatisfiable
% 0.45/1.11 % SZS output start Refutation
% 0.45/1.11
% 0.45/1.11 clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.45/1.11 .
% 0.45/1.11 clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.45/1.11 codomain( Y ) ) ] )
% 0.45/1.11 .
% 0.45/1.11 clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.45/1.11 .
% 0.45/1.11 clause( 11, [ 'there_exists'( domain( a ) ) ] )
% 0.45/1.11 .
% 0.45/1.11 clause( 12, [ ~( =( codomain( domain( a ) ), domain( a ) ) ) ] )
% 0.45/1.11 .
% 0.45/1.11 clause( 31, [ 'there_exists'( a ) ] )
% 0.45/1.11 .
% 0.45/1.11 clause( 330, [ ~( =( domain( X ), domain( a ) ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, domain( a ) ) ) ) ] )
% 0.45/1.11 .
% 0.45/1.11 clause( 340, [] )
% 0.45/1.11 .
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 % SZS output end Refutation
% 0.45/1.11 found a proof!
% 0.45/1.11
% 0.45/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.11
% 0.45/1.11 initialclauses(
% 0.45/1.11 [ clause( 342, [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ] )
% 0.45/1.11 , clause( 343, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 0.45/1.11 , clause( 344, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y
% 0.45/1.11 ) ] )
% 0.45/1.11 , clause( 345, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.45/1.11 )
% 0.45/1.11 , clause( 346, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.45/1.11 ] )
% 0.45/1.11 , clause( 347, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'(
% 0.45/1.11 domain( X ) ) ] )
% 0.45/1.11 , clause( 348, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.45/1.11 codomain( Y ) ) ] )
% 0.45/1.11 , clause( 349, [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ),
% 0.45/1.11 codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 0.45/1.11 , clause( 350, [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y )
% 0.45/1.11 , Z ) ) ] )
% 0.45/1.11 , clause( 351, [ =( compose( X, domain( X ) ), X ) ] )
% 0.45/1.11 , clause( 352, [ =( compose( codomain( X ), X ), X ) ] )
% 0.45/1.11 , clause( 353, [ 'there_exists'( domain( a ) ) ] )
% 0.45/1.11 , clause( 354, [ ~( =( codomain( domain( a ) ), domain( a ) ) ) ] )
% 0.45/1.11 ] ).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 subsumption(
% 0.45/1.11 clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.45/1.11 , clause( 345, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.45/1.11 )
% 0.45/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.45/1.11 1 )] ) ).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 subsumption(
% 0.45/1.11 clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.45/1.11 codomain( Y ) ) ] )
% 0.45/1.11 , clause( 348, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.45/1.11 codomain( Y ) ) ] )
% 0.45/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.11 ), ==>( 1, 1 )] ) ).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 subsumption(
% 0.45/1.11 clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.45/1.11 , clause( 351, [ =( compose( X, domain( X ) ), X ) ] )
% 0.45/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 subsumption(
% 0.45/1.11 clause( 11, [ 'there_exists'( domain( a ) ) ] )
% 0.45/1.11 , clause( 353, [ 'there_exists'( domain( a ) ) ] )
% 0.45/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 subsumption(
% 0.45/1.11 clause( 12, [ ~( =( codomain( domain( a ) ), domain( a ) ) ) ] )
% 0.45/1.11 , clause( 354, [ ~( =( codomain( domain( a ) ), domain( a ) ) ) ] )
% 0.45/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 resolution(
% 0.45/1.11 clause( 381, [ 'there_exists'( a ) ] )
% 0.45/1.11 , clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.45/1.11 , 0, clause( 11, [ 'there_exists'( domain( a ) ) ] )
% 0.45/1.11 , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 subsumption(
% 0.45/1.11 clause( 31, [ 'there_exists'( a ) ] )
% 0.45/1.11 , clause( 381, [ 'there_exists'( a ) ] )
% 0.45/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 eqswap(
% 0.45/1.11 clause( 382, [ =( codomain( Y ), domain( X ) ), ~( 'there_exists'( compose(
% 0.45/1.11 X, Y ) ) ) ] )
% 0.45/1.11 , clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.45/1.11 codomain( Y ) ) ] )
% 0.45/1.11 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 eqswap(
% 0.45/1.11 clause( 383, [ ~( =( domain( a ), codomain( domain( a ) ) ) ) ] )
% 0.45/1.11 , clause( 12, [ ~( =( codomain( domain( a ) ), domain( a ) ) ) ] )
% 0.45/1.11 , 0, substitution( 0, [] )).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 paramod(
% 0.45/1.11 clause( 384, [ ~( =( domain( a ), domain( X ) ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, domain( a ) ) ) ) ] )
% 0.45/1.11 , clause( 382, [ =( codomain( Y ), domain( X ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, Y ) ) ) ] )
% 0.45/1.11 , 0, clause( 383, [ ~( =( domain( a ), codomain( domain( a ) ) ) ) ] )
% 0.45/1.11 , 0, 4, substitution( 0, [ :=( X, X ), :=( Y, domain( a ) )] ),
% 0.45/1.11 substitution( 1, [] )).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 eqswap(
% 0.45/1.11 clause( 385, [ ~( =( domain( X ), domain( a ) ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, domain( a ) ) ) ) ] )
% 0.45/1.11 , clause( 384, [ ~( =( domain( a ), domain( X ) ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, domain( a ) ) ) ) ] )
% 0.45/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 subsumption(
% 0.45/1.11 clause( 330, [ ~( =( domain( X ), domain( a ) ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, domain( a ) ) ) ) ] )
% 0.45/1.11 , clause( 385, [ ~( =( domain( X ), domain( a ) ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, domain( a ) ) ) ) ] )
% 0.45/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.45/1.11 1 )] ) ).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 eqswap(
% 0.45/1.11 clause( 386, [ ~( =( domain( a ), domain( X ) ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, domain( a ) ) ) ) ] )
% 0.45/1.11 , clause( 330, [ ~( =( domain( X ), domain( a ) ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, domain( a ) ) ) ) ] )
% 0.45/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 eqrefl(
% 0.45/1.11 clause( 388, [ ~( 'there_exists'( compose( a, domain( a ) ) ) ) ] )
% 0.45/1.11 , clause( 386, [ ~( =( domain( a ), domain( X ) ) ), ~( 'there_exists'(
% 0.45/1.11 compose( X, domain( a ) ) ) ) ] )
% 0.45/1.11 , 0, substitution( 0, [ :=( X, a )] )).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 paramod(
% 0.45/1.11 clause( 389, [ ~( 'there_exists'( a ) ) ] )
% 0.45/1.11 , clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.45/1.11 , 0, clause( 388, [ ~( 'there_exists'( compose( a, domain( a ) ) ) ) ] )
% 0.45/1.11 , 0, 2, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 resolution(
% 0.45/1.11 clause( 390, [] )
% 0.45/1.11 , clause( 389, [ ~( 'there_exists'( a ) ) ] )
% 0.45/1.11 , 0, clause( 31, [ 'there_exists'( a ) ] )
% 0.45/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 subsumption(
% 0.45/1.11 clause( 340, [] )
% 0.45/1.11 , clause( 390, [] )
% 0.45/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 end.
% 0.45/1.11
% 0.45/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.11
% 0.45/1.11 Memory use:
% 0.45/1.11
% 0.45/1.11 space for terms: 3643
% 0.45/1.11 space for clauses: 16868
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 clauses generated: 679
% 0.45/1.11 clauses kept: 341
% 0.45/1.11 clauses selected: 44
% 0.45/1.11 clauses deleted: 2
% 0.45/1.11 clauses inuse deleted: 0
% 0.45/1.11
% 0.45/1.11 subsentry: 1455
% 0.45/1.11 literals s-matched: 1273
% 0.45/1.11 literals matched: 1232
% 0.45/1.11 full subsumption: 155
% 0.45/1.11
% 0.45/1.11 checksum: 1969668165
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 Bliksem ended
%------------------------------------------------------------------------------