TSTP Solution File: LCL331-10 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL331-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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:48 EDT 2022
% Result : Timeout 300.03s 300.51s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL331-10 : TPTP v8.1.0. Released v7.5.0.
% 0.08/0.14 % Command : bliksem %s
% 0.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % DateTime : Sun Jul 3 01:05:35 EDT 2022
% 0.14/0.36 % CPUTime :
% 235.50/235.96 *** allocated 10000 integers for termspace/termends
% 235.50/235.96 *** allocated 10000 integers for clauses
% 235.50/235.96 *** allocated 10000 integers for justifications
% 235.50/235.96 Bliksem 1.12
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Automatic Strategy Selection
% 235.50/235.96
% 235.50/235.96 Clauses:
% 235.50/235.96 [
% 235.50/235.96 [ =( ifeq( X, X, Y, Z ), Y ) ],
% 235.50/235.96 [ =( axiom( implies( or( X, X ), X ) ), true ) ],
% 235.50/235.96 [ =( axiom( implies( X, or( Y, X ) ) ), true ) ],
% 235.50/235.96 [ =( axiom( implies( or( X, Y ), or( Y, X ) ) ), true ) ],
% 235.50/235.96 [ =( axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ), true
% 235.50/235.96 ) ],
% 235.50/235.96 [ =( axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) )
% 235.50/235.96 ) ), true ) ],
% 235.50/235.96 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 235.50/235.96 [ =( ifeq( axiom( X ), true, theorem( X ), true ), true ) ],
% 235.50/235.96 [ =( ifeq( theorem( implies( X, Y ) ), true, ifeq( theorem( X ), true,
% 235.50/235.96 theorem( Y ), true ), true ), true ) ],
% 235.50/235.96 [ =( and( X, Y ), not( or( not( X ), not( Y ) ) ) ) ],
% 235.50/235.96 [ =( equivalent( X, Y ), and( implies( X, Y ), implies( Y, X ) ) ) ]
% 235.50/235.96 ,
% 235.50/235.96 [ ~( =( theorem( equivalent( implies( and( p, q ), r ), implies( and( p
% 235.50/235.96 , q ), and( p, r ) ) ) ), true ) ) ]
% 235.50/235.96 ] .
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 percentage equality = 1.000000, percentage horn = 1.000000
% 235.50/235.96 This is a pure equality problem
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Options Used:
% 235.50/235.96
% 235.50/235.96 useres = 1
% 235.50/235.96 useparamod = 1
% 235.50/235.96 useeqrefl = 1
% 235.50/235.96 useeqfact = 1
% 235.50/235.96 usefactor = 1
% 235.50/235.96 usesimpsplitting = 0
% 235.50/235.96 usesimpdemod = 5
% 235.50/235.96 usesimpres = 3
% 235.50/235.96
% 235.50/235.96 resimpinuse = 1000
% 235.50/235.96 resimpclauses = 20000
% 235.50/235.96 substype = eqrewr
% 235.50/235.96 backwardsubs = 1
% 235.50/235.96 selectoldest = 5
% 235.50/235.96
% 235.50/235.96 litorderings [0] = split
% 235.50/235.96 litorderings [1] = extend the termordering, first sorting on arguments
% 235.50/235.96
% 235.50/235.96 termordering = kbo
% 235.50/235.96
% 235.50/235.96 litapriori = 0
% 235.50/235.96 termapriori = 1
% 235.50/235.96 litaposteriori = 0
% 235.50/235.96 termaposteriori = 0
% 235.50/235.96 demodaposteriori = 0
% 235.50/235.96 ordereqreflfact = 0
% 235.50/235.96
% 235.50/235.96 litselect = negord
% 235.50/235.96
% 235.50/235.96 maxweight = 15
% 235.50/235.96 maxdepth = 30000
% 235.50/235.96 maxlength = 115
% 235.50/235.96 maxnrvars = 195
% 235.50/235.96 excuselevel = 1
% 235.50/235.96 increasemaxweight = 1
% 235.50/235.96
% 235.50/235.96 maxselected = 10000000
% 235.50/235.96 maxnrclauses = 10000000
% 235.50/235.96
% 235.50/235.96 showgenerated = 0
% 235.50/235.96 showkept = 0
% 235.50/235.96 showselected = 0
% 235.50/235.96 showdeleted = 0
% 235.50/235.96 showresimp = 1
% 235.50/235.96 showstatus = 2000
% 235.50/235.96
% 235.50/235.96 prologoutput = 1
% 235.50/235.96 nrgoals = 5000000
% 235.50/235.96 totalproof = 1
% 235.50/235.96
% 235.50/235.96 Symbols occurring in the translation:
% 235.50/235.96
% 235.50/235.96 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 235.50/235.96 . [1, 2] (w:1, o:28, a:1, s:1, b:0),
% 235.50/235.96 ! [4, 1] (w:0, o:20, a:1, s:1, b:0),
% 235.50/235.96 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 235.50/235.96 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 235.50/235.96 ifeq [42, 4] (w:1, o:57, a:1, s:1, b:0),
% 235.50/235.96 or [43, 2] (w:1, o:53, a:1, s:1, b:0),
% 235.50/235.96 implies [44, 2] (w:1, o:54, a:1, s:1, b:0),
% 235.50/235.96 axiom [45, 1] (w:1, o:25, a:1, s:1, b:0),
% 235.50/235.96 true [46, 0] (w:1, o:12, a:1, s:1, b:0),
% 235.50/235.96 not [49, 1] (w:1, o:26, a:1, s:1, b:0),
% 235.50/235.96 theorem [50, 1] (w:1, o:27, a:1, s:1, b:0),
% 235.50/235.96 and [53, 2] (w:1, o:55, a:1, s:1, b:0),
% 235.50/235.96 equivalent [54, 2] (w:1, o:56, a:1, s:1, b:0),
% 235.50/235.96 p [55, 0] (w:1, o:17, a:1, s:1, b:0),
% 235.50/235.96 q [56, 0] (w:1, o:18, a:1, s:1, b:0),
% 235.50/235.96 r [57, 0] (w:1, o:19, a:1, s:1, b:0).
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Starting Search:
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Intermediate Status:
% 235.50/235.96 Generated: 42414
% 235.50/235.96 Kept: 2000
% 235.50/235.96 Inuse: 549
% 235.50/235.96 Deleted: 56
% 235.50/235.96 Deletedinuse: 15
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Intermediate Status:
% 235.50/235.96 Generated: 105169
% 235.50/235.96 Kept: 4001
% 235.50/235.96 Inuse: 950
% 235.50/235.96 Deleted: 107
% 235.50/235.96 Deletedinuse: 39
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Intermediate Status:
% 235.50/235.96 Generated: 139235
% 235.50/235.96 Kept: 6004
% 235.50/235.96 Inuse: 1152
% 235.50/235.96 Deleted: 139
% 235.50/235.96 Deletedinuse: 48
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Intermediate Status:
% 235.50/235.96 Generated: 239712
% 235.50/235.96 Kept: 8005
% 235.50/235.96 Inuse: 1515
% 235.50/235.96 Deleted: 220
% 235.50/235.96 Deletedinuse: 70
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Intermediate Status:
% 235.50/235.96 Generated: 356503
% 235.50/235.96 Kept: 10006
% 235.50/235.96 Inuse: 1947
% 235.50/235.96 Deleted: 278
% 235.50/235.96 Deletedinuse: 83
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Intermediate Status:
% 235.50/235.96 Generated: 622660
% 235.50/235.96 Kept: 12006
% 235.50/235.96 Inuse: 2451
% 235.50/235.96 Deleted: 310
% 235.50/235.96 Deletedinuse: 89
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96 Resimplifying inuse:
% 235.50/235.96 Done
% 235.50/235.96
% 235.50/235.96
% 235.50/235.96 Intermediate Status:
% 235.50/235.96 Generated: Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------