TSTP Solution File: CAT007-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CAT007-3 : 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:10 EDT 2022
% Result : Unsatisfiable 0.70s 1.09s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT007-3 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n029.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 16:13:28 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.70/1.09 *** allocated 10000 integers for termspace/termends
% 0.70/1.09 *** allocated 10000 integers for clauses
% 0.70/1.09 *** allocated 10000 integers for justifications
% 0.70/1.09 Bliksem 1.12
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Automatic Strategy Selection
% 0.70/1.09
% 0.70/1.09 Clauses:
% 0.70/1.09 [
% 0.70/1.09 [ equalish( X, X ) ],
% 0.70/1.09 [ ~( equalish( X, Y ) ), equalish( Y, X ) ],
% 0.70/1.09 [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X, Z ) ],
% 0.70/1.09 [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ],
% 0.70/1.09 [ ~( 'there_exists'( domain( X ) ) ), ~( equalish( domain( X ), codomain(
% 0.70/1.09 Y ) ) ), 'there_exists'( compose( X, Y ) ) ],
% 0.70/1.09 [ 'there_exists'( f1( X, Y ) ), equalish( X, Y ) ],
% 0.70/1.09 [ equalish( X, f1( X, Y ) ), equalish( Y, f1( X, Y ) ), equalish( X, Y )
% 0.70/1.09 ],
% 0.70/1.09 [ ~( equalish( X, f1( X, Y ) ) ), ~( equalish( Y, f1( X, Y ) ) ),
% 0.70/1.09 equalish( X, Y ) ],
% 0.70/1.09 [ 'there_exists'( domain( c2 ) ) ],
% 0.70/1.09 [ 'there_exists'( domain( c1 ) ) ],
% 0.70/1.09 [ equalish( domain( c2 ), codomain( c1 ) ) ],
% 0.70/1.09 [ ~( 'there_exists'( compose( c2, c1 ) ) ) ]
% 0.70/1.09 ] .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 percentage equality = 0.000000, percentage horn = 0.833333
% 0.70/1.09 This a non-horn, non-equality problem
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Options Used:
% 0.70/1.09
% 0.70/1.09 useres = 1
% 0.70/1.09 useparamod = 0
% 0.70/1.09 useeqrefl = 0
% 0.70/1.09 useeqfact = 0
% 0.70/1.09 usefactor = 1
% 0.70/1.09 usesimpsplitting = 0
% 0.70/1.09 usesimpdemod = 0
% 0.70/1.09 usesimpres = 3
% 0.70/1.09
% 0.70/1.09 resimpinuse = 1000
% 0.70/1.09 resimpclauses = 20000
% 0.70/1.09 substype = standard
% 0.70/1.09 backwardsubs = 1
% 0.70/1.09 selectoldest = 5
% 0.70/1.09
% 0.70/1.09 litorderings [0] = split
% 0.70/1.09 litorderings [1] = liftord
% 0.70/1.09
% 0.70/1.09 termordering = none
% 0.70/1.09
% 0.70/1.09 litapriori = 1
% 0.70/1.09 termapriori = 0
% 0.70/1.09 litaposteriori = 0
% 0.70/1.09 termaposteriori = 0
% 0.70/1.09 demodaposteriori = 0
% 0.70/1.09 ordereqreflfact = 0
% 0.70/1.09
% 0.70/1.09 litselect = none
% 0.70/1.09
% 0.70/1.09 maxweight = 15
% 0.70/1.09 maxdepth = 30000
% 0.70/1.09 maxlength = 115
% 0.70/1.09 maxnrvars = 195
% 0.70/1.09 excuselevel = 1
% 0.70/1.09 increasemaxweight = 1
% 0.70/1.09
% 0.70/1.09 maxselected = 10000000
% 0.70/1.09 maxnrclauses = 10000000
% 0.70/1.09
% 0.70/1.09 showgenerated = 0
% 0.70/1.09 showkept = 0
% 0.70/1.09 showselected = 0
% 0.70/1.09 showdeleted = 0
% 0.70/1.09 showresimp = 1
% 0.70/1.09 showstatus = 2000
% 0.70/1.09
% 0.70/1.09 prologoutput = 1
% 0.70/1.09 nrgoals = 5000000
% 0.70/1.09 totalproof = 1
% 0.70/1.09
% 0.70/1.09 Symbols occurring in the translation:
% 0.70/1.09
% 0.70/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.09 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.70/1.09 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.70/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 equalish [40, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.70/1.09 domain [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.70/1.09 'there_exists' [44, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.70/1.09 codomain [45, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.70/1.09 compose [46, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.70/1.09 f1 [47, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.70/1.09 c2 [48, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.70/1.09 c1 [49, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Starting Search:
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksems!, er is een bewijs:
% 0.70/1.09 % SZS status Unsatisfiable
% 0.70/1.09 % SZS output start Refutation
% 0.70/1.09
% 0.70/1.09 clause( 4, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( compose( X
% 0.70/1.09 , Y ) ), ~( equalish( domain( X ), codomain( Y ) ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 8, [ 'there_exists'( domain( c2 ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 10, [ equalish( domain( c2 ), codomain( c1 ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 11, [ ~( 'there_exists'( compose( c2, c1 ) ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 36, [ 'there_exists'( compose( c2, c1 ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 37, [] )
% 0.70/1.09 .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 % SZS output end Refutation
% 0.70/1.09 found a proof!
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 initialclauses(
% 0.70/1.09 [ clause( 39, [ equalish( X, X ) ] )
% 0.70/1.09 , clause( 40, [ ~( equalish( X, Y ) ), equalish( Y, X ) ] )
% 0.70/1.09 , clause( 41, [ ~( equalish( X, Y ) ), ~( equalish( Y, Z ) ), equalish( X,
% 0.70/1.09 Z ) ] )
% 0.70/1.09 , clause( 42, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.70/1.09 )
% 0.70/1.09 , clause( 43, [ ~( 'there_exists'( domain( X ) ) ), ~( equalish( domain( X
% 0.70/1.09 ), codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 0.70/1.09 , clause( 44, [ 'there_exists'( f1( X, Y ) ), equalish( X, Y ) ] )
% 0.70/1.09 , clause( 45, [ equalish( X, f1( X, Y ) ), equalish( Y, f1( X, Y ) ),
% 0.70/1.09 equalish( X, Y ) ] )
% 0.70/1.09 , clause( 46, [ ~( equalish( X, f1( X, Y ) ) ), ~( equalish( Y, f1( X, Y )
% 0.70/1.09 ) ), equalish( X, Y ) ] )
% 0.70/1.09 , clause( 47, [ 'there_exists'( domain( c2 ) ) ] )
% 0.70/1.09 , clause( 48, [ 'there_exists'( domain( c1 ) ) ] )
% 0.70/1.09 , clause( 49, [ equalish( domain( c2 ), codomain( c1 ) ) ] )
% 0.70/1.09 , clause( 50, [ ~( 'there_exists'( compose( c2, c1 ) ) ) ] )
% 0.70/1.09 ] ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 4, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( compose( X
% 0.70/1.09 , Y ) ), ~( equalish( domain( X ), codomain( Y ) ) ) ] )
% 0.70/1.09 , clause( 43, [ ~( 'there_exists'( domain( X ) ) ), ~( equalish( domain( X
% 0.70/1.09 ), codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 8, [ 'there_exists'( domain( c2 ) ) ] )
% 0.70/1.09 , clause( 47, [ 'there_exists'( domain( c2 ) ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 10, [ equalish( domain( c2 ), codomain( c1 ) ) ] )
% 0.70/1.09 , clause( 49, [ equalish( domain( c2 ), codomain( c1 ) ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 11, [ ~( 'there_exists'( compose( c2, c1 ) ) ) ] )
% 0.70/1.09 , clause( 50, [ ~( 'there_exists'( compose( c2, c1 ) ) ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 61, [ ~( 'there_exists'( domain( c2 ) ) ), 'there_exists'( compose(
% 0.70/1.09 c2, c1 ) ) ] )
% 0.70/1.09 , clause( 4, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( compose(
% 0.70/1.09 X, Y ) ), ~( equalish( domain( X ), codomain( Y ) ) ) ] )
% 0.70/1.09 , 2, clause( 10, [ equalish( domain( c2 ), codomain( c1 ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, c2 ), :=( Y, c1 )] ), substitution( 1, [] )
% 0.70/1.09 ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 62, [ 'there_exists'( compose( c2, c1 ) ) ] )
% 0.70/1.09 , clause( 61, [ ~( 'there_exists'( domain( c2 ) ) ), 'there_exists'(
% 0.70/1.09 compose( c2, c1 ) ) ] )
% 0.70/1.09 , 0, clause( 8, [ 'there_exists'( domain( c2 ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 36, [ 'there_exists'( compose( c2, c1 ) ) ] )
% 0.70/1.09 , clause( 62, [ 'there_exists'( compose( c2, c1 ) ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 63, [] )
% 0.70/1.09 , clause( 11, [ ~( 'there_exists'( compose( c2, c1 ) ) ) ] )
% 0.70/1.09 , 0, clause( 36, [ 'there_exists'( compose( c2, c1 ) ) ] )
% 0.70/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 37, [] )
% 0.70/1.09 , clause( 63, [] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 end.
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 Memory use:
% 0.70/1.09
% 0.70/1.09 space for terms: 579
% 0.70/1.09 space for clauses: 2077
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 clauses generated: 61
% 0.70/1.09 clauses kept: 38
% 0.70/1.09 clauses selected: 16
% 0.70/1.09 clauses deleted: 1
% 0.70/1.09 clauses inuse deleted: 0
% 0.70/1.09
% 0.70/1.09 subsentry: 125
% 0.70/1.09 literals s-matched: 88
% 0.70/1.09 literals matched: 88
% 0.70/1.09 full subsumption: 42
% 0.70/1.09
% 0.70/1.09 checksum: 2105689319
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksem ended
%------------------------------------------------------------------------------