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