TSTP Solution File: CAT011-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CAT011-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.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.69s 1.11s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT011-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Sun May 29 15:31:21 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.69/1.11 *** allocated 10000 integers for termspace/termends
% 0.69/1.11 *** allocated 10000 integers for clauses
% 0.69/1.11 *** allocated 10000 integers for justifications
% 0.69/1.11 Bliksem 1.12
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Automatic Strategy Selection
% 0.69/1.11
% 0.69/1.11 Clauses:
% 0.69/1.11 [
% 0.69/1.11 [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ],
% 0.69/1.11 [ ~( equivalent( X, Y ) ), =( X, Y ) ],
% 0.69/1.11 [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ],
% 0.69/1.11 [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ],
% 0.69/1.11 [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ],
% 0.69/1.11 [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( X ) )
% 0.69/1.11 ],
% 0.69/1.11 [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), codomain( Y )
% 0.69/1.11 ) ],
% 0.69/1.11 [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), codomain( Y ) )
% 0.69/1.11 ), 'there_exists'( compose( X, Y ) ) ],
% 0.69/1.11 [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.69/1.11 ,
% 0.69/1.11 [ =( compose( X, domain( X ) ), X ) ],
% 0.69/1.11 [ =( compose( codomain( X ), X ), X ) ],
% 0.69/1.11 [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ],
% 0.69/1.11 [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~( =( X, Y ) ),
% 0.69/1.11 equivalent( X, Y ) ],
% 0.69/1.11 [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( codomain( X )
% 0.69/1.11 ) ],
% 0.69/1.11 [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ],
% 0.69/1.11 [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ],
% 0.69/1.11 [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y ) ],
% 0.69/1.11 [ 'there_exists'( domain( a ) ) ],
% 0.69/1.11 [ ~( =( domain( domain( a ) ), domain( a ) ) ) ]
% 0.69/1.11 ] .
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 percentage equality = 0.428571, percentage horn = 0.888889
% 0.69/1.11 This is a problem with some equality
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Options Used:
% 0.69/1.11
% 0.69/1.11 useres = 1
% 0.69/1.11 useparamod = 1
% 0.69/1.11 useeqrefl = 1
% 0.69/1.11 useeqfact = 1
% 0.69/1.11 usefactor = 1
% 0.69/1.11 usesimpsplitting = 0
% 0.69/1.11 usesimpdemod = 5
% 0.69/1.11 usesimpres = 3
% 0.69/1.11
% 0.69/1.11 resimpinuse = 1000
% 0.69/1.11 resimpclauses = 20000
% 0.69/1.11 substype = eqrewr
% 0.69/1.11 backwardsubs = 1
% 0.69/1.11 selectoldest = 5
% 0.69/1.11
% 0.69/1.11 litorderings [0] = split
% 0.69/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.11
% 0.69/1.11 termordering = kbo
% 0.69/1.11
% 0.69/1.11 litapriori = 0
% 0.69/1.11 termapriori = 1
% 0.69/1.11 litaposteriori = 0
% 0.69/1.11 termaposteriori = 0
% 0.69/1.11 demodaposteriori = 0
% 0.69/1.11 ordereqreflfact = 0
% 0.69/1.11
% 0.69/1.11 litselect = negord
% 0.69/1.11
% 0.69/1.11 maxweight = 15
% 0.69/1.11 maxdepth = 30000
% 0.69/1.11 maxlength = 115
% 0.69/1.11 maxnrvars = 195
% 0.69/1.11 excuselevel = 1
% 0.69/1.11 increasemaxweight = 1
% 0.69/1.11
% 0.69/1.11 maxselected = 10000000
% 0.69/1.11 maxnrclauses = 10000000
% 0.69/1.11
% 0.69/1.11 showgenerated = 0
% 0.69/1.11 showkept = 0
% 0.69/1.11 showselected = 0
% 0.69/1.11 showdeleted = 0
% 0.69/1.11 showresimp = 1
% 0.69/1.11 showstatus = 2000
% 0.69/1.11
% 0.69/1.11 prologoutput = 1
% 0.69/1.11 nrgoals = 5000000
% 0.69/1.11 totalproof = 1
% 0.69/1.11
% 0.69/1.11 Symbols occurring in the translation:
% 0.69/1.11
% 0.69/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.11 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.11 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.69/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.11 'there_exists' [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.69/1.11 domain [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.11 codomain [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.69/1.11 compose [45, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.69/1.11 f1 [47, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.69/1.11 a [48, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Starting Search:
% 0.69/1.11
% 0.69/1.11 Resimplifying inuse:
% 0.69/1.11 Done
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksems!, er is een bewijs:
% 0.69/1.11 % SZS status Unsatisfiable
% 0.69/1.11 % SZS output start Refutation
% 0.69/1.11
% 0.69/1.11 clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 4, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.69/1.11 codomain( Y ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 13, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 14, [ =( f1( X, Y ), X ), =( f1( X, Y ), Y ), =( X, Y ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 15, [ ~( =( f1( X, Y ), X ) ), ~( =( f1( X, Y ), Y ) ), =( X, Y ) ]
% 0.69/1.11 )
% 0.69/1.11 .
% 0.69/1.11 clause( 16, [ 'there_exists'( domain( a ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 17, [ ~( =( domain( domain( a ) ), domain( a ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 19, [ ~( =( X, Y ) ), =( f1( Y, X ), Y ), =( Y, X ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 37, [ 'there_exists'( a ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 549, [ 'there_exists'( X ), =( X, Y ), =( f1( X, Y ), Y ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 612, [ 'there_exists'( X ), =( f1( X, domain( a ) ), X ), =( f1( X
% 0.69/1.11 , domain( a ) ), domain( a ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 614, [ 'there_exists'( X ), =( f1( X, domain( a ) ), domain( a ) )
% 0.69/1.11 ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 757, [ ~( =( Z, X ) ), ~( =( Z, Y ) ), =( X, Y ), ~( =( f1( Z, f1(
% 0.69/1.11 X, Y ) ), Z ) ), ~( =( f1( Z, f1( X, Y ) ), f1( X, Y ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 834, [ 'there_exists'( X ), ~( =( domain( a ), X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 836, [ ~( =( X, Y ) ), =( Y, X ), ~( =( X, Y ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 837, [ ~( =( X, Y ) ), =( Y, X ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 891, [ =( compose( Y, X ), X ), ~( =( Y, codomain( X ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 974, [ ~( =( codomain( X ), domain( a ) ) ), ~( 'there_exists'( X )
% 0.69/1.11 ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 995, [ ~( =( domain( a ), codomain( X ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 1009, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 1056, [] )
% 0.69/1.11 .
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 % SZS output end Refutation
% 0.69/1.11 found a proof!
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 initialclauses(
% 0.69/1.11 [ clause( 1058, [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ] )
% 0.69/1.11 , clause( 1059, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 0.69/1.11 , clause( 1060, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X,
% 0.69/1.11 Y ) ] )
% 0.69/1.11 , clause( 1061, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 1062, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.69/1.11 ] )
% 0.69/1.11 , clause( 1063, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'(
% 0.69/1.11 domain( X ) ) ] )
% 0.69/1.11 , clause( 1064, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.69/1.11 codomain( Y ) ) ] )
% 0.69/1.11 , clause( 1065, [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ),
% 0.69/1.11 codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 0.69/1.11 , clause( 1066, [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y
% 0.69/1.11 ), Z ) ) ] )
% 0.69/1.11 , clause( 1067, [ =( compose( X, domain( X ) ), X ) ] )
% 0.69/1.11 , clause( 1068, [ =( compose( codomain( X ), X ), X ) ] )
% 0.69/1.11 , clause( 1069, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.69/1.11 , clause( 1070, [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~(
% 0.69/1.11 =( X, Y ) ), equivalent( X, Y ) ] )
% 0.69/1.11 , clause( 1071, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'(
% 0.69/1.11 codomain( X ) ) ] )
% 0.69/1.11 , clause( 1072, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.69/1.11 , clause( 1073, [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ] )
% 0.69/1.11 , clause( 1074, [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y
% 0.69/1.11 ) ] )
% 0.69/1.11 , clause( 1075, [ 'there_exists'( domain( a ) ) ] )
% 0.69/1.11 , clause( 1076, [ ~( =( domain( domain( a ) ), domain( a ) ) ) ] )
% 0.69/1.11 ] ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 3, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ] )
% 0.69/1.11 , clause( 1061, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.69/1.11 )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.11 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 4, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ] )
% 0.69/1.11 , clause( 1062, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.69/1.11 ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.11 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 6, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.69/1.11 codomain( Y ) ) ] )
% 0.69/1.11 , clause( 1064, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.69/1.11 codomain( Y ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.11 ), ==>( 1, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.69/1.11 , clause( 1067, [ =( compose( X, domain( X ) ), X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 10, [ =( compose( codomain( X ), X ), X ) ] )
% 0.69/1.11 , clause( 1068, [ =( compose( codomain( X ), X ), X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 13, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.69/1.11 , clause( 1072, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.11 ), ==>( 1, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 1119, [ =( Y, X ), =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ) ] )
% 0.69/1.11 , clause( 1073, [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ] )
% 0.69/1.11 , Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------