TSTP Solution File: CAT019-10 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CAT019-10 : TPTP v8.1.0. Released v7.3.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:15 EDT 2022
% Result : Timeout 300.04s 300.43s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT019-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n025.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 22:08:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 236.23/236.70 *** allocated 10000 integers for termspace/termends
% 236.23/236.70 *** allocated 10000 integers for clauses
% 236.23/236.70 *** allocated 10000 integers for justifications
% 236.23/236.70 Bliksem 1.12
% 236.23/236.70
% 236.23/236.70
% 236.23/236.70 Automatic Strategy Selection
% 236.23/236.70
% 236.23/236.70 Clauses:
% 236.23/236.70 [
% 236.23/236.70 [ =( ifeq4( X, X, Y, Z ), Y ) ],
% 236.23/236.70 [ =( ifeq3( X, X, Y, Z ), Y ) ],
% 236.23/236.70 [ =( ifeq2( X, X, Y, Z ), Y ) ],
% 236.23/236.70 [ =( ifeq( X, X, Y, Z ), Y ) ],
% 236.23/236.70 [ =( ifeq( equivalent( X, Y ), true, 'there_exists'( X ), true ), true )
% 236.23/236.70 ],
% 236.23/236.70 [ =( ifeq2( equivalent( X, Y ), true, X, Y ), Y ) ],
% 236.23/236.70 [ =( ifeq( 'there_exists'( X ), true, equivalent( X, X ), true ), true )
% 236.23/236.70 ],
% 236.23/236.70 [ =( ifeq( 'there_exists'( domain( X ) ), true, 'there_exists'( X ),
% 236.23/236.70 true ), true ) ],
% 236.23/236.70 [ =( ifeq( 'there_exists'( codomain( X ) ), true, 'there_exists'( X ),
% 236.23/236.70 true ), true ) ],
% 236.23/236.70 [ =( ifeq( 'there_exists'( compose( X, Y ) ), true, 'there_exists'(
% 236.23/236.70 domain( X ) ), true ), true ) ],
% 236.23/236.70 [ =( ifeq2( 'there_exists'( compose( X, Y ) ), true, domain( X ),
% 236.23/236.70 codomain( Y ) ), codomain( Y ) ) ],
% 236.23/236.70 [ =( ifeq( 'there_exists'( domain( X ) ), true, ifeq3( domain( X ),
% 236.23/236.70 codomain( Y ), 'there_exists'( compose( X, Y ) ), true ), true ), true )
% 236.23/236.70 ],
% 236.23/236.70 [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 236.23/236.70 ,
% 236.23/236.70 [ =( compose( X, domain( X ) ), X ) ],
% 236.23/236.70 [ =( compose( codomain( X ), X ), X ) ],
% 236.23/236.70 [ =( ifeq2( 'there_exists'( X ), true, ifeq4( a, X, b, X ), X ), X ) ]
% 236.23/236.70 ,
% 236.23/236.70 [ =( ifeq2( 'there_exists'( X ), true, ifeq4( b, X, a, X ), X ), X ) ]
% 236.23/236.70 ,
% 236.23/236.70 [ ~( =( a, b ) ) ]
% 236.23/236.70 ] .
% 236.23/236.70
% 236.23/236.70
% 236.23/236.70 percentage equality = 1.000000, percentage horn = 1.000000
% 236.23/236.70 This is a pure equality problem
% 236.23/236.70
% 236.23/236.70
% 236.23/236.70
% 236.23/236.70 Options Used:
% 236.23/236.70
% 236.23/236.70 useres = 1
% 236.23/236.70 useparamod = 1
% 236.23/236.70 useeqrefl = 1
% 236.23/236.70 useeqfact = 1
% 236.23/236.70 usefactor = 1
% 236.23/236.70 usesimpsplitting = 0
% 236.23/236.70 usesimpdemod = 5
% 236.23/236.70 usesimpres = 3
% 236.23/236.70
% 236.23/236.70 resimpinuse = 1000
% 236.23/236.70 resimpclauses = 20000
% 236.23/236.70 substype = eqrewr
% 236.23/236.70 backwardsubs = 1
% 236.23/236.70 selectoldest = 5
% 236.23/236.70
% 236.23/236.70 litorderings [0] = split
% 236.23/236.70 litorderings [1] = extend the termordering, first sorting on arguments
% 236.23/236.70
% 236.23/236.70 termordering = kbo
% 236.23/236.70
% 236.23/236.70 litapriori = 0
% 236.23/236.70 termapriori = 1
% 236.23/236.70 litaposteriori = 0
% 236.23/236.70 termaposteriori = 0
% 236.23/236.70 demodaposteriori = 0
% 236.23/236.70 ordereqreflfact = 0
% 236.23/236.70
% 236.23/236.70 litselect = negord
% 236.23/236.70
% 236.23/236.70 maxweight = 15
% 236.23/236.70 maxdepth = 30000
% 236.23/236.70 maxlength = 115
% 236.23/236.70 maxnrvars = 195
% 236.23/236.70 excuselevel = 1
% 236.23/236.70 increasemaxweight = 1
% 236.23/236.70
% 236.23/236.70 maxselected = 10000000
% 236.23/236.70 maxnrclauses = 10000000
% 236.23/236.70
% 236.23/236.70 showgenerated = 0
% 236.23/236.70 showkept = 0
% 236.23/236.70 showselected = 0
% 236.23/236.70 showdeleted = 0
% 236.23/236.70 showresimp = 1
% 236.23/236.70 showstatus = 2000
% 236.23/236.70
% 236.23/236.70 prologoutput = 1
% 236.23/236.70 nrgoals = 5000000
% 236.23/236.70 totalproof = 1
% 236.23/236.70
% 236.23/236.70 Symbols occurring in the translation:
% 236.23/236.70
% 236.23/236.70 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 236.23/236.70 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 236.23/236.70 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 236.23/236.70 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 236.23/236.70 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 236.23/236.70 ifeq4 [42, 4] (w:1, o:55, a:1, s:1, b:0),
% 236.23/236.70 ifeq3 [43, 4] (w:1, o:54, a:1, s:1, b:0),
% 236.23/236.70 ifeq2 [44, 4] (w:1, o:53, a:1, s:1, b:0),
% 236.23/236.70 ifeq [45, 4] (w:1, o:56, a:1, s:1, b:0),
% 236.23/236.70 equivalent [48, 2] (w:1, o:51, a:1, s:1, b:0),
% 236.23/236.70 true [49, 0] (w:1, o:14, a:1, s:1, b:0),
% 236.23/236.70 'there_exists' [50, 1] (w:1, o:23, a:1, s:1, b:0),
% 236.23/236.70 domain [51, 1] (w:1, o:25, a:1, s:1, b:0),
% 236.23/236.70 codomain [52, 1] (w:1, o:24, a:1, s:1, b:0),
% 236.23/236.70 compose [53, 2] (w:1, o:52, a:1, s:1, b:0),
% 236.23/236.70 a [55, 0] (w:1, o:16, a:1, s:1, b:0),
% 236.23/236.70 b [56, 0] (w:1, o:17, a:1, s:1, b:0).
% 236.23/236.70
% 236.23/236.70
% 236.23/236.70 Starting Search:
% 236.23/236.70
% 236.23/236.70 Resimplifying inuse:
% 236.23/236.70 Done
% 236.23/236.70
% 236.23/236.70 Failed to find proof!
% 236.23/236.70 maxweight = 15
% 236.23/236.70 maxnrclauses = 10000000
% 236.23/236.70 Generated: 7839
% 236.23/236.70 Kept: 207
% 236.23/236.70
% 236.23/236.70
% 236.23/236.70 The strategy used was not complete!
% 236.23/236.70
% 236.23/236.70 Increased maxweight to 16
% 236.23/236.70
% 236.23/236.70 Starting Search:
% 236.23/236.70
% 236.23/236.70 Resimplifying inuse:
% 236.23/236.70 Done
% 236.23/236.70
% 236.23/236.70 Failed to find proof!
% 236.23/236.70 maxweight = 16
% 236.23/236.70 maxnrclauses = 10000000
% 236.23/236.70 Generated: 76755
% 236.23/236.70 Kept: 752
% 236.23/236.70
% 236.23/236.70
% 236.23/236.70 The strategy used was not complete!
% 236.23/236.70
% 236.23/236.70 Increased maxweight to 17
% 236.23/236.70
% 236.23/236.70 Starting Search:
% 236.23/236.70
% 236.23/236.70 Resimplifying inuse:
% 236.23/236.70 Done
% 236.23/236.70
% 236.23/236.70 Resimplifying inuse:
% 236.23/236.70 Done
% 236.23/236.70
% 236.23/236.70 Failed to find proof!
% 236.23/236.70 maxweight = 17
% 236.23/236.70 maxnrclauses = 10000000
% 236.23/236.70 Generated: 313055
% 236.23/236.70 Kept: 1536
% 236.23/236.70
% 236.23/236.70
% 236.23/236.70 The strategy used was not complete!
% 236.23/236.70
% 236.23/236.70 Increased maxweight to 18
% 236.23/236.70
% 236.23/236.70 Starting Search:
% 236.23/236.70
% 236.23/236.70 Resimplifying inuse:
% 236.23/236.70 Done
% 236.23/236.70
% 236.23/236.70
% 236.23/236.70 ICputime limit exceeded (core dumped)
%------------------------------------------------------------------------------