TSTP Solution File: SYN337-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN337-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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 21 02:49:46 EDT 2022
% Result : Satisfiable 0.69s 1.09s
% Output : Saturation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN337-1 : TPTP v8.1.0. Released v1.2.0.
% 0.13/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n009.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.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Tue Jul 12 00:24:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.69/1.09 *** allocated 10000 integers for termspace/termends
% 0.69/1.09 *** allocated 10000 integers for clauses
% 0.69/1.09 *** allocated 10000 integers for justifications
% 0.69/1.09 Bliksem 1.12
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Automatic Strategy Selection
% 0.69/1.09
% 0.69/1.09 Clauses:
% 0.69/1.09 [
% 0.69/1.09 [ f( a, X ) ],
% 0.69/1.09 [ f( z( X ), a ) ],
% 0.69/1.09 [ f( z( X ), X ) ],
% 0.69/1.09 [ ~( f( b, X ) ) ],
% 0.69/1.09 [ ~( f( b, z( X ) ) ) ]
% 0.69/1.09 ] .
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.69/1.09 This is a near-Horn, non-equality problem
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Options Used:
% 0.69/1.09
% 0.69/1.09 useres = 1
% 0.69/1.09 useparamod = 0
% 0.69/1.09 useeqrefl = 0
% 0.69/1.09 useeqfact = 0
% 0.69/1.09 usefactor = 1
% 0.69/1.09 usesimpsplitting = 0
% 0.69/1.09 usesimpdemod = 0
% 0.69/1.09 usesimpres = 4
% 0.69/1.09
% 0.69/1.09 resimpinuse = 1000
% 0.69/1.09 resimpclauses = 20000
% 0.69/1.09 substype = standard
% 0.69/1.09 backwardsubs = 1
% 0.69/1.09 selectoldest = 5
% 0.69/1.09
% 0.69/1.09 litorderings [0] = split
% 0.69/1.09 litorderings [1] = liftord
% 0.69/1.09
% 0.69/1.09 termordering = none
% 0.69/1.09
% 0.69/1.09 litapriori = 1
% 0.69/1.09 termapriori = 0
% 0.69/1.09 litaposteriori = 0
% 0.69/1.09 termaposteriori = 0
% 0.69/1.09 demodaposteriori = 0
% 0.69/1.09 ordereqreflfact = 0
% 0.69/1.09
% 0.69/1.09 litselect = negative
% 0.69/1.09
% 0.69/1.09 maxweight = 30000
% 0.69/1.09 maxdepth = 30000
% 0.69/1.09 maxlength = 115
% 0.69/1.09 maxnrvars = 195
% 0.69/1.09 excuselevel = 0
% 0.69/1.09 increasemaxweight = 0
% 0.69/1.09
% 0.69/1.09 maxselected = 10000000
% 0.69/1.09 maxnrclauses = 10000000
% 0.69/1.09
% 0.69/1.09 showgenerated = 0
% 0.69/1.09 showkept = 0
% 0.69/1.09 showselected = 0
% 0.69/1.09 showdeleted = 0
% 0.69/1.09 showresimp = 1
% 0.69/1.09 showstatus = 2000
% 0.69/1.09
% 0.69/1.09 prologoutput = 1
% 0.69/1.09 nrgoals = 5000000
% 0.69/1.09 totalproof = 1
% 0.69/1.09
% 0.69/1.09 Symbols occurring in the translation:
% 0.69/1.09
% 0.69/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.09 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.69/1.09 ! [4, 1] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 a [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.69/1.09 f [41, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.69/1.09 z [42, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.69/1.09 b [43, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Starting Search:
% 0.69/1.09
% 0.69/1.09 Resimplifying inuse:
% 0.69/1.09 Done
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 found a saturation!
% 0.69/1.09 % SZS status Satisfiable
% 0.69/1.09 % SZS output start Saturation
% 0.69/1.09
% 0.69/1.09 clause( 1, [ f( z( X ), a ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 2, [ f( z( X ), X ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 3, [ ~( f( b, X ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 0, [ f( a, X ) ] )
% 0.69/1.09 .
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 % SZS output end Saturation
% 0.69/1.09 end of saturation!
% 0.69/1.09
% 0.69/1.09 Memory use:
% 0.69/1.09
% 0.69/1.09 space for terms: 82
% 0.69/1.09 space for clauses: 216
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 clauses generated: 5
% 0.69/1.09 clauses kept: 4
% 0.69/1.09 clauses selected: 4
% 0.69/1.09 clauses deleted: 0
% 0.69/1.09 clauses inuse deleted: 0
% 0.69/1.09
% 0.69/1.09 subsentry: 1
% 0.69/1.09 literals s-matched: 1
% 0.69/1.09 literals matched: 1
% 0.69/1.09 full subsumption: 0
% 0.69/1.09
% 0.69/1.09 checksum: -74610
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksem ended
%------------------------------------------------------------------------------