TSTP Solution File: LCL304-10 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL304-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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 : Sun Jul 17 07:52:37 EDT 2022
% Result : Timeout 300.06s 300.54s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL304-10 : TPTP v8.1.0. Released v7.5.0.
% 0.10/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n026.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 Jul 3 09:58:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 276.70/277.19 *** allocated 10000 integers for termspace/termends
% 276.70/277.19 *** allocated 10000 integers for clauses
% 276.70/277.19 *** allocated 10000 integers for justifications
% 276.70/277.19 Bliksem 1.12
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Automatic Strategy Selection
% 276.70/277.19
% 276.70/277.19 Clauses:
% 276.70/277.19 [
% 276.70/277.19 [ =( ifeq( X, X, Y, Z ), Y ) ],
% 276.70/277.19 [ =( axiom( implies( or( X, X ), X ) ), true ) ],
% 276.70/277.19 [ =( axiom( implies( X, or( Y, X ) ) ), true ) ],
% 276.70/277.19 [ =( axiom( implies( or( X, Y ), or( Y, X ) ) ), true ) ],
% 276.70/277.19 [ =( axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ), true
% 276.70/277.19 ) ],
% 276.70/277.19 [ =( axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) )
% 276.70/277.19 ) ), true ) ],
% 276.70/277.19 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 276.70/277.19 [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ],
% 276.70/277.19 [ =( ifeq( theorem( implies( X, Y ) ), true, ifeq( theorem( X ), true,
% 276.70/277.19 theorem( Y ), true ), true ), true ) ],
% 276.70/277.19 [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 276.70/277.19 [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y, X ) ) ) ]
% 276.70/277.19 ,
% 276.70/277.19 [ ~( =( theorem( equivalent( implies( p, q ), equivalent( q, or( p, q )
% 276.70/277.19 ) ) ), true ) ) ]
% 276.70/277.19 ] .
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 percentage equality = 1.000000, percentage horn = 1.000000
% 276.70/277.19 This is a pure equality problem
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Options Used:
% 276.70/277.19
% 276.70/277.19 useres = 1
% 276.70/277.19 useparamod = 1
% 276.70/277.19 useeqrefl = 1
% 276.70/277.19 useeqfact = 1
% 276.70/277.19 usefactor = 1
% 276.70/277.19 usesimpsplitting = 0
% 276.70/277.19 usesimpdemod = 5
% 276.70/277.19 usesimpres = 3
% 276.70/277.19
% 276.70/277.19 resimpinuse = 1000
% 276.70/277.19 resimpclauses = 20000
% 276.70/277.19 substype = eqrewr
% 276.70/277.19 backwardsubs = 1
% 276.70/277.19 selectoldest = 5
% 276.70/277.19
% 276.70/277.19 litorderings [0] = split
% 276.70/277.19 litorderings [1] = extend the termordering, first sorting on arguments
% 276.70/277.19
% 276.70/277.19 termordering = kbo
% 276.70/277.19
% 276.70/277.19 litapriori = 0
% 276.70/277.19 termapriori = 1
% 276.70/277.19 litaposteriori = 0
% 276.70/277.19 termaposteriori = 0
% 276.70/277.19 demodaposteriori = 0
% 276.70/277.19 ordereqreflfact = 0
% 276.70/277.19
% 276.70/277.19 litselect = negord
% 276.70/277.19
% 276.70/277.19 maxweight = 15
% 276.70/277.19 maxdepth = 30000
% 276.70/277.19 maxlength = 115
% 276.70/277.19 maxnrvars = 195
% 276.70/277.19 excuselevel = 1
% 276.70/277.19 increasemaxweight = 1
% 276.70/277.19
% 276.70/277.19 maxselected = 10000000
% 276.70/277.19 maxnrclauses = 10000000
% 276.70/277.19
% 276.70/277.19 showgenerated = 0
% 276.70/277.19 showkept = 0
% 276.70/277.19 showselected = 0
% 276.70/277.19 showdeleted = 0
% 276.70/277.19 showresimp = 1
% 276.70/277.19 showstatus = 2000
% 276.70/277.19
% 276.70/277.19 prologoutput = 1
% 276.70/277.19 nrgoals = 5000000
% 276.70/277.19 totalproof = 1
% 276.70/277.19
% 276.70/277.19 Symbols occurring in the translation:
% 276.70/277.19
% 276.70/277.19 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 276.70/277.19 . [1, 2] (w:1, o:27, a:1, s:1, b:0),
% 276.70/277.19 ! [4, 1] (w:0, o:19, a:1, s:1, b:0),
% 276.70/277.19 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 276.70/277.19 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 276.70/277.19 ifeq [42, 4] (w:1, o:56, a:1, s:1, b:0),
% 276.70/277.19 or [43, 2] (w:1, o:52, a:1, s:1, b:0),
% 276.70/277.19 implies [44, 2] (w:1, o:53, a:1, s:1, b:0),
% 276.70/277.19 axiom [45, 1] (w:1, o:24, a:1, s:1, b:0),
% 276.70/277.19 true [46, 0] (w:1, o:12, a:1, s:1, b:0),
% 276.70/277.19 not [49, 1] (w:1, o:25, a:1, s:1, b:0),
% 276.70/277.19 theorem [50, 1] (w:1, o:26, a:1, s:1, b:0),
% 276.70/277.19 and [53, 2] (w:1, o:54, a:1, s:1, b:0),
% 276.70/277.19 equivalent [54, 2] (w:1, o:55, a:1, s:1, b:0),
% 276.70/277.19 p [55, 0] (w:1, o:17, a:1, s:1, b:0),
% 276.70/277.19 q [56, 0] (w:1, o:18, a:1, s:1, b:0).
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Starting Search:
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Intermediate Status:
% 276.70/277.19 Generated: 42414
% 276.70/277.19 Kept: 2000
% 276.70/277.19 Inuse: 549
% 276.70/277.19 Deleted: 56
% 276.70/277.19 Deletedinuse: 15
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Intermediate Status:
% 276.70/277.19 Generated: 105169
% 276.70/277.19 Kept: 4001
% 276.70/277.19 Inuse: 950
% 276.70/277.19 Deleted: 107
% 276.70/277.19 Deletedinuse: 39
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Intermediate Status:
% 276.70/277.19 Generated: 139235
% 276.70/277.19 Kept: 6004
% 276.70/277.19 Inuse: 1152
% 276.70/277.19 Deleted: 139
% 276.70/277.19 Deletedinuse: 48
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Intermediate Status:
% 276.70/277.19 Generated: 239712
% 276.70/277.19 Kept: 8005
% 276.70/277.19 Inuse: 1515
% 276.70/277.19 Deleted: 220
% 276.70/277.19 Deletedinuse: 70
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Intermediate Status:
% 276.70/277.19 Generated: 356503
% 276.70/277.19 Kept: 10006
% 276.70/277.19 Inuse: 1947
% 276.70/277.19 Deleted: 278
% 276.70/277.19 Deletedinuse: 83
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Intermediate Status:
% 276.70/277.19 Generated: 622660
% 276.70/277.19 Kept: 12006
% 276.70/277.19 Inuse: 2451
% 276.70/277.19 Deleted: 310
% 276.70/277.19 Deletedinuse: 89
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19 Resimplifying inuse:
% 276.70/277.19 Done
% 276.70/277.19
% 276.70/277.19
% 276.70/277.19 Intermediate Status:
% 276.70/277.19 Generated: 965728
% 276.70/277.19 Kept: 14006
% 276.70/277.19 Inuse: 3263
% 276.70/277.19 Deleted: 40Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------