TSTP Solution File: NUM288-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM288-1 : TPTP v8.1.0. Bugfixed v4.0.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 : Mon Jul 18 06:21:09 EDT 2022
% Result : Unknown 0.71s 1.55s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : NUM288-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.02/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Thu Jul 7 21:35:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.55 *** allocated 10000 integers for termspace/termends
% 0.71/1.55 *** allocated 10000 integers for clauses
% 0.71/1.55 *** allocated 10000 integers for justifications
% 0.71/1.55 Bliksem 1.12
% 0.71/1.55
% 0.71/1.55
% 0.71/1.55 Automatic Strategy Selection
% 0.71/1.55
% 0.71/1.55 Clauses:
% 0.71/1.55 [
% 0.71/1.55 [ equalish( add( X, n0 ), X ) ],
% 0.71/1.55 [ equalish( add( X, successor( Y ) ), successor( add( X, Y ) ) ) ],
% 0.71/1.55 [ equalish( multiply( X, n0 ), n0 ) ],
% 0.71/1.55 [ equalish( multiply( X, successor( Y ) ), add( multiply( X, Y ), X ) )
% 0.71/1.55 ],
% 0.71/1.55 [ ~( equalish( successor( X ), successor( Y ) ) ), equalish( X, Y ) ]
% 0.71/1.55 ,
% 0.71/1.55 [ ~( equalish( X, Y ) ), equalish( successor( X ), successor( Y ) ) ]
% 0.71/1.55 ,
% 0.71/1.55 [ ~( less( X, Y ) ), ~( less( Z, X ) ), less( Z, Y ) ],
% 0.71/1.55 [ ~( equalish( add( successor( X ), Y ), Z ) ), less( Y, Z ) ],
% 0.71/1.55 [ ~( less( X, Y ) ), equalish( add( successor(
% 0.71/1.55 'predecessor_of_1st_minus_2nd'( Y, X ) ), X ), Y ) ],
% 0.71/1.55 [ ~( divides( X, Y ) ), less( X, Y ), equalish( X, Y ) ],
% 0.71/1.55 [ ~( less( X, Y ) ), divides( X, Y ) ],
% 0.71/1.55 [ ~( equalish( X, Y ) ), divides( X, Y ) ]
% 0.71/1.55 ] .
% 0.71/1.55
% 0.71/1.55
% 0.71/1.55 percentage equality = 0.000000, percentage horn = 0.916667
% 0.71/1.55 This is a near-Horn, non-equality problem
% 0.71/1.55
% 0.71/1.55
% 0.71/1.55 Options Used:
% 0.71/1.55
% 0.71/1.55 useres = 1
% 0.71/1.55 useparamod = 0
% 0.71/1.55 useeqrefl = 0
% 0.71/1.55 useeqfact = 0
% 0.71/1.55 usefactor = 1
% 0.71/1.55 usesimpsplitting = 0
% 0.71/1.55 usesimpdemod = 0
% 0.71/1.55 usesimpres = 4
% 0.71/1.55
% 0.71/1.55 resimpinuse = 1000
% 0.71/1.55 resimpclauses = 20000
% 0.71/1.55 substype = standard
% 0.71/1.55 backwardsubs = 1
% 0.71/1.55 selectoldest = 5
% 0.71/1.55
% 0.71/1.55 litorderings [0] = split
% 0.71/1.55 litorderings [1] = liftord
% 0.71/1.55
% 0.71/1.55 termordering = none
% 0.71/1.55
% 0.71/1.55 litapriori = 1
% 0.71/1.55 termapriori = 0
% 0.71/1.55 litaposteriori = 0
% 0.71/1.55 termaposteriori = 0
% 0.71/1.55 demodaposteriori = 0
% 0.71/1.55 ordereqreflfact = 0
% 0.71/1.55
% 0.71/1.55 litselect = negative
% 0.71/1.55
% 0.71/1.55 maxweight = 30000
% 0.71/1.55 maxdepth = 30000
% 0.71/1.55 maxlength = 115
% 0.71/1.55 maxnrvars = 195
% 0.71/1.55 excuselevel = 0
% 0.71/1.55 increasemaxweight = 0
% 0.71/1.55
% 0.71/1.55 maxselected = 10000000
% 0.71/1.55 maxnrclauses = 10000000
% 0.71/1.55
% 0.71/1.55 showgenerated = 0
% 0.71/1.55 showkept = 0
% 0.71/1.55 showselected = 0
% 0.71/1.55 showdeleted = 0
% 0.71/1.55 showresimp = 1
% 0.71/1.55 showstatus = 2000
% 0.71/1.55
% 0.71/1.55 prologoutput = 1
% 0.71/1.55 nrgoals = 5000000
% 0.71/1.55 totalproof = 1
% 0.71/1.55
% 0.71/1.55 Symbols occurring in the translation:
% 0.71/1.55
% 0.71/1.55 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.55 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.55 ! [4, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.55 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.55 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.55 n0 [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.71/1.55 add [41, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.71/1.55 equalish [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.55 successor [44, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.55 multiply [45, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.55 less [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.55 'predecessor_of_1st_minus_2nd' [48, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.55 divides [49, 2] (w:1, o:45, a:1, s:1, b:0).
% 0.71/1.55
% 0.71/1.55
% 0.71/1.55 Starting Search:
% 0.71/1.55
% 0.71/1.55 Resimplifying inuse:
% 0.71/1.55 Done
% 0.71/1.55
% 0.71/1.55
% 0.71/1.55 Intermediate Status:
% 0.71/1.55 Generated: 8566
% 0.71/1.55 Kept: 2000
% 0.71/1.55 Inuse: 1740
% 0.71/1.55 Deleted: 0
% 0.71/1.55 Deletedinuse: 0
% 0.71/1.55
% 0.71/1.55 Resimplifying inuse:
% 0.71/1.55 Done
% 0.71/1.55
% 0.71/1.55 renaming is full
% 0.71/1.55
% 0.71/1.55 Memory use:
% 0.71/1.55
% 0.71/1.55 space for terms: 375600
% 0.71/1.55 space for clauses: 1374379
% 0.71/1.55
% 0.71/1.55
% 0.71/1.55 clauses generated: 13890
% 0.71/1.55 clauses kept: 2721
% 0.71/1.55 clauses selected: 2376
% 0.71/1.55 clauses deleted: 0
% 0.71/1.55 clauses inuse deleted: 0
% 0.71/1.55
% 0.71/1.55 subsentry: 24510
% 0.71/1.55 literals s-matched: 23146
% 0.71/1.55 literals matched: 23146
% 0.71/1.55 full subsumption: 0
% 0.71/1.55
% 0.71/1.55 checksum: -379556762
% 0.71/1.55
% 0.71/1.55
% 0.71/1.55 Bliksem ended
%------------------------------------------------------------------------------