%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CAT013-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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:13 EDT 2022
% Result : Unsatisfiable 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CAT013-4 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n029.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 19:55:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.10 *** allocated 10000 integers for termspace/termends
% 0.71/1.10 *** allocated 10000 integers for clauses
% 0.71/1.10 *** allocated 10000 integers for justifications
% 0.71/1.10 Bliksem 1.12
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Automatic Strategy Selection
% 0.71/1.10
% 0.71/1.10 Clauses:
% 0.71/1.10 [
% 0.71/1.10 [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ],
% 0.71/1.10 [ ~( equivalent( X, Y ) ), =( X, Y ) ],
% 0.71/1.10 [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ],
% 0.71/1.10 [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ],
% 0.71/1.10 [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ],
% 0.71/1.10 [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( X ) )
% 0.71/1.10 ],
% 0.71/1.10 [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), codomain( Y )
% 0.71/1.10 ) ],
% 0.71/1.10 [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), codomain( Y ) )
% 0.71/1.10 ), 'there_exists'( compose( X, Y ) ) ],
% 0.71/1.10 [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.71/1.10 ,
% 0.71/1.10 [ =( compose( X, domain( X ) ), X ) ],
% 0.71/1.10 [ =( compose( codomain( X ), X ), X ) ],
% 0.71/1.10 [ 'there_exists'( codomain( a ) ) ],
% 0.71/1.10 [ ~( =( domain( codomain( a ) ), codomain( a ) ) ) ]
% 0.71/1.10 ] .
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 percentage equality = 0.347826, percentage horn = 1.000000
% 0.71/1.10 This is a problem with some equality
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Options Used:
% 0.71/1.10
% 0.71/1.10 useres = 1
% 0.71/1.10 useparamod = 1
% 0.71/1.10 useeqrefl = 1
% 0.71/1.10 useeqfact = 1
% 0.71/1.10 usefactor = 1
% 0.71/1.10 usesimpsplitting = 0
% 0.71/1.10 usesimpdemod = 5
% 0.71/1.10 usesimpres = 3
% 0.71/1.10
% 0.71/1.10 resimpinuse = 1000
% 0.71/1.10 resimpclauses = 20000
% 0.71/1.10 substype = eqrewr
% 0.71/1.10 backwardsubs = 1
% 0.71/1.10 selectoldest = 5
% 0.71/1.10
% 0.71/1.10 litorderings [0] = split
% 0.71/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.10
% 0.71/1.10 termordering = kbo
% 0.71/1.10
% 0.71/1.10 litapriori = 0
% 0.71/1.10 termapriori = 1
% 0.71/1.10 litaposteriori = 0
% 0.71/1.10 termaposteriori = 0
% 0.71/1.10 demodaposteriori = 0
% 0.71/1.10 ordereqreflfact = 0
% 0.71/1.10
% 0.71/1.10 litselect = negord
% 0.71/1.10
% 0.71/1.10 maxweight = 15
% 0.71/1.10 maxdepth = 30000
% 0.71/1.10 maxlength = 115
% 0.71/1.10 maxnrvars = 195
% 0.71/1.10 excuselevel = 1
% 0.71/1.10 increasemaxweight = 1
% 0.71/1.10
% 0.71/1.10 maxselected = 10000000
% 0.71/1.10 maxnrclauses = 10000000
% 0.71/1.10
% 0.71/1.10 showgenerated = 0
% 0.71/1.10 showkept = 0
% 0.71/1.10 showselected = 0
% 0.71/1.10 showdeleted = 0
% 0.71/1.10 showresimp = 1
% 0.71/1.10 showstatus = 2000
% 0.71/1.10
% 0.71/1.10 prologoutput = 1
% 0.71/1.10 nrgoals = 5000000
% 0.71/1.10 totalproof = 1
% 0.71/1.10
% 0.71/1.10 Symbols occurring in the translation:
% 0.71/1.10
% 0.71/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.10 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.10 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.71/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.10 'there_exists' [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.10 domain [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.10 codomain [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.10 compose [45, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.10 a [47, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Starting Search:
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksems!, er is een bewijs:
% 0.71/1.10 % SZS status Unsatisfiable
% 0.71/1.10 % SZS output start Refutation
% 0.71/1.10
% 0.71/1.10 clause( 4, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.71/1.10 codomain( Y ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 11, [ 'there_exists'( codomain( a ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 12, [ ~( =( domain( codomain( a ) ), codomain( a ) ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 19, [ 'there_exists'( a ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 316, [ ~( =( codomain( X ), codomain( a ) ) ), ~( 'there_exists'(
% 0.71/1.10 compose( codomain( a ), X ) ) ) ] )
% 0.71/1.10 .
% 0.71/1.10 clause( 326, [] )
% 0.71/1.10 .
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 % SZS output end Refutation
% 0.71/1.10 found a proof!
% 0.71/1.10
% 0.71/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.10
% 0.71/1.10 initialclauses(
% 0.71/1.10 [ clause( 328, [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ] )
% 0.71/1.10 , clause( 329, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 0.71/1.10 , clause( 330, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y
% 0.71/1.10 ) ] )
% 0.71/1.10 , clause( 331, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.71/1.10 )
% 0.71/1.10 , clause( 332, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.71/1.10 ] )
% 0.71/1.10 , clause( 333, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'(
% 0.71/1.10 domain( X ) ) ] )
% 0.71/1.10 , clause( 334, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.71/1.10 codomain( Y ) ) ] )
% 0.71/1.10 , clause( 335, [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ),
% 0.71/1.10 codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 0.71/1.10 , clause( 336, [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y )
% 0.71/1.10 , Z ) ) ] )
% 0.71/1.10 , clause( 337, [ =( compose( X, domain( X ) ), X ) ] )
% 0.71/1.10 , clause( 338, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.10 , clause( 339, [ 'there_exists'( codomain( a ) ) ] )
% 0.71/1.10 , clause( 340, [ ~( =( domain( codomain( a ) ), codomain( a ) ) ) ] )
% 0.71/1.10 ] ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 4, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ] )
% 0.71/1.10 , clause( 332, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.71/1.10 ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.10 1 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.71/1.10 codomain( Y ) ) ] )
% 0.71/1.10 , clause( 334, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.71/1.10 codomain( Y ) ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.10 ), ==>( 1, 1 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.10 , clause( 338, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 11, [ 'there_exists'( codomain( a ) ) ] )
% 0.71/1.10 , clause( 339, [ 'there_exists'( codomain( a ) ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 12, [ ~( =( domain( codomain( a ) ), codomain( a ) ) ) ] )
% 0.71/1.10 , clause( 340, [ ~( =( domain( codomain( a ) ), codomain( a ) ) ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 368, [ 'there_exists'( a ) ] )
% 0.71/1.10 , clause( 4, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ]
% 0.71/1.10 )
% 0.71/1.10 , 0, clause( 11, [ 'there_exists'( codomain( a ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 19, [ 'there_exists'( a ) ] )
% 0.71/1.10 , clause( 368, [ 'there_exists'( a ) ] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 eqswap(
% 0.71/1.10 clause( 370, [ ~( =( codomain( a ), domain( codomain( a ) ) ) ) ] )
% 0.71/1.10 , clause( 12, [ ~( =( domain( codomain( a ) ), codomain( a ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 paramod(
% 0.71/1.10 clause( 387, [ ~( =( codomain( a ), codomain( X ) ) ), ~( 'there_exists'(
% 0.71/1.10 compose( codomain( a ), X ) ) ) ] )
% 0.71/1.10 , clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.71/1.10 codomain( Y ) ) ] )
% 0.71/1.10 , 1, clause( 370, [ ~( =( codomain( a ), domain( codomain( a ) ) ) ) ] )
% 0.71/1.10 , 0, 4, substitution( 0, [ :=( X, codomain( a ) ), :=( Y, X )] ),
% 0.71/1.10 substitution( 1, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 eqswap(
% 0.71/1.10 clause( 388, [ ~( =( codomain( X ), codomain( a ) ) ), ~( 'there_exists'(
% 0.71/1.10 compose( codomain( a ), X ) ) ) ] )
% 0.71/1.10 , clause( 387, [ ~( =( codomain( a ), codomain( X ) ) ), ~( 'there_exists'(
% 0.71/1.10 compose( codomain( a ), X ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, X )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 316, [ ~( =( codomain( X ), codomain( a ) ) ), ~( 'there_exists'(
% 0.71/1.10 compose( codomain( a ), X ) ) ) ] )
% 0.71/1.10 , clause( 388, [ ~( =( codomain( X ), codomain( a ) ) ), ~( 'there_exists'(
% 0.71/1.10 compose( codomain( a ), X ) ) ) ] )
% 0.71/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.10 1 )] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 eqswap(
% 0.71/1.10 clause( 389, [ ~( =( codomain( a ), codomain( X ) ) ), ~( 'there_exists'(
% 0.71/1.10 compose( codomain( a ), X ) ) ) ] )
% 0.71/1.10 , clause( 316, [ ~( =( codomain( X ), codomain( a ) ) ), ~( 'there_exists'(
% 0.71/1.10 compose( codomain( a ), X ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, X )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 eqrefl(
% 0.71/1.10 clause( 391, [ ~( 'there_exists'( compose( codomain( a ), a ) ) ) ] )
% 0.71/1.10 , clause( 389, [ ~( =( codomain( a ), codomain( X ) ) ), ~( 'there_exists'(
% 0.71/1.10 compose( codomain( a ), X ) ) ) ] )
% 0.71/1.10 , 0, substitution( 0, [ :=( X, a )] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 paramod(
% 0.71/1.10 clause( 392, [ ~( 'there_exists'( a ) ) ] )
% 0.71/1.10 , clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.10 , 0, clause( 391, [ ~( 'there_exists'( compose( codomain( a ), a ) ) ) ] )
% 0.71/1.10 , 0, 2, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 resolution(
% 0.71/1.10 clause( 393, [] )
% 0.71/1.10 , clause( 392, [ ~( 'there_exists'( a ) ) ] )
% 0.71/1.10 , 0, clause( 19, [ 'there_exists'( a ) ] )
% 0.71/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 subsumption(
% 0.71/1.10 clause( 326, [] )
% 0.71/1.10 , clause( 393, [] )
% 0.71/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 end.
% 0.71/1.10
% 0.71/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.10
% 0.71/1.10 Memory use:
% 0.71/1.10
% 0.71/1.10 space for terms: 3475
% 0.71/1.10 space for clauses: 16245
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 clauses generated: 659
% 0.71/1.10 clauses kept: 327
% 0.71/1.10 clauses selected: 44
% 0.71/1.10 clauses deleted: 2
% 0.71/1.10 clauses inuse deleted: 0
% 0.71/1.10
% 0.71/1.10 subsentry: 1448
% 0.71/1.10 literals s-matched: 1237
% 0.71/1.10 literals matched: 1197
% 0.71/1.10 full subsumption: 152
% 0.71/1.10
% 0.71/1.10 checksum: -1220034705
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------