TSTP Solution File: PUZ133+3 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : PUZ133+3 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n021.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 17:58:34 EDT 2022

% Result   : Timeout 300.06s 300.44s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ133+3 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % DateTime : Sun May 29 01:27:57 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 56.20/56.55  *** allocated 10000 integers for termspace/termends
% 56.20/56.55  *** allocated 10000 integers for clauses
% 56.20/56.55  *** allocated 10000 integers for justifications
% 56.20/56.55  Bliksem 1.12
% 56.20/56.55  
% 56.20/56.55  
% 56.20/56.55  Automatic Strategy Selection
% 56.20/56.55  
% 56.20/56.55  
% 56.20/56.55  Clauses:
% 56.20/56.55  
% 56.20/56.55  { ! queens_p, ! le( s( n0 ), X ), ! le( X, n ), ! le( s( X ), Y ), ! le( Y
% 56.20/56.55    , n ), ! p( X ) = p( Y ) }.
% 56.20/56.55  { ! queens_p, ! le( s( n0 ), X ), ! le( X, n ), ! le( s( X ), Y ), ! le( Y
% 56.20/56.55    , n ), ! plus( p( X ), X ) = plus( p( Y ), Y ) }.
% 56.20/56.55  { ! queens_p, ! le( s( n0 ), X ), ! le( X, n ), ! le( s( X ), Y ), ! le( Y
% 56.20/56.55    , n ), ! minus( p( X ), X ) = minus( p( Y ), Y ) }.
% 56.20/56.55  { perm( X ) = minus( s( n ), X ) }.
% 56.20/56.55  { alpha2( skol1, skol2 ), queens_q }.
% 56.20/56.55  { q( skol1 ) = q( skol2 ), plus( q( skol1 ), skol1 ) = plus( q( skol2 ), 
% 56.20/56.55    skol2 ), minus( q( skol1 ), skol1 ) = minus( q( skol2 ), skol2 ), 
% 56.20/56.55    queens_q }.
% 56.20/56.55  { ! alpha2( X, Y ), alpha1( X ) }.
% 56.20/56.55  { ! alpha2( X, Y ), le( s( X ), Y ) }.
% 56.20/56.55  { ! alpha2( X, Y ), le( Y, n ) }.
% 56.20/56.55  { ! alpha1( X ), ! le( s( X ), Y ), ! le( Y, n ), alpha2( X, Y ) }.
% 56.20/56.55  { ! alpha1( X ), le( s( n0 ), X ) }.
% 56.20/56.55  { ! alpha1( X ), le( X, n ) }.
% 56.20/56.55  { ! le( s( n0 ), X ), ! le( X, n ), alpha1( X ) }.
% 56.20/56.55  { queens_p }.
% 56.20/56.55  { q( X ) = p( perm( X ) ) }.
% 56.20/56.55  { ! queens_q }.
% 56.20/56.55  { ! le( s( n0 ), X ), ! le( X, n ), le( s( n0 ), perm( X ) ) }.
% 56.20/56.55  { ! le( s( n0 ), X ), ! le( X, n ), le( perm( X ), n ) }.
% 56.20/56.55  { ! lt( X, Y ), lt( perm( Y ), perm( X ) ) }.
% 56.20/56.55  { ! lt( perm( Y ), perm( X ) ), lt( X, Y ) }.
% 56.20/56.55  { minus( Y, X ) = minus( perm( X ), perm( Y ) ) }.
% 56.20/56.55  { ! le( X, Z ), ! le( Z, Y ), le( X, Y ) }.
% 56.20/56.55  { le( X, s( X ) ) }.
% 56.20/56.55  { ! plus( X, Y ) = plus( Z, T ), minus( X, Z ) = minus( T, Y ) }.
% 56.20/56.55  { ! minus( X, Z ) = minus( T, Y ), plus( X, Y ) = plus( Z, T ) }.
% 56.20/56.55  { ! minus( X, Y ) = minus( Z, T ), minus( X, Z ) = minus( Y, T ) }.
% 56.20/56.55  { ! minus( X, Z ) = minus( Y, T ), minus( X, Y ) = minus( Z, T ) }.
% 56.20/56.55  
% 56.20/56.55  percentage equality = 0.227273, percentage horn = 0.923077
% 56.20/56.55  This is a problem with some equality
% 56.20/56.55  
% 56.20/56.55  
% 56.20/56.55  
% 56.20/56.55  Options Used:
% 56.20/56.55  
% 56.20/56.55  useres =            1
% 56.20/56.55  useparamod =        1
% 56.20/56.55  useeqrefl =         1
% 56.20/56.55  useeqfact =         1
% 56.20/56.55  usefactor =         1
% 56.20/56.55  usesimpsplitting =  0
% 56.20/56.55  usesimpdemod =      5
% 56.20/56.55  usesimpres =        3
% 56.20/56.55  
% 56.20/56.55  resimpinuse      =  1000
% 56.20/56.55  resimpclauses =     20000
% 56.20/56.55  substype =          eqrewr
% 56.20/56.55  backwardsubs =      1
% 56.20/56.55  selectoldest =      5
% 56.20/56.55  
% 56.20/56.55  litorderings [0] =  split
% 56.20/56.55  litorderings [1] =  extend the termordering, first sorting on arguments
% 56.20/56.55  
% 56.20/56.55  termordering =      kbo
% 56.20/56.55  
% 56.20/56.55  litapriori =        0
% 56.20/56.55  termapriori =       1
% 56.20/56.55  litaposteriori =    0
% 56.20/56.55  termaposteriori =   0
% 56.20/56.55  demodaposteriori =  0
% 56.20/56.55  ordereqreflfact =   0
% 56.20/56.55  
% 56.20/56.55  litselect =         negord
% 56.20/56.55  
% 56.20/56.55  maxweight =         15
% 56.20/56.55  maxdepth =          30000
% 56.20/56.55  maxlength =         115
% 56.20/56.55  maxnrvars =         195
% 56.20/56.55  excuselevel =       1
% 56.20/56.55  increasemaxweight = 1
% 56.20/56.55  
% 56.20/56.55  maxselected =       10000000
% 56.20/56.55  maxnrclauses =      10000000
% 56.20/56.55  
% 56.20/56.55  showgenerated =    0
% 56.20/56.55  showkept =         0
% 56.20/56.55  showselected =     0
% 56.20/56.55  showdeleted =      0
% 56.20/56.55  showresimp =       1
% 56.20/56.55  showstatus =       2000
% 56.20/56.55  
% 56.20/56.55  prologoutput =     0
% 56.20/56.55  nrgoals =          5000000
% 56.20/56.55  totalproof =       1
% 56.20/56.55  
% 56.20/56.55  Symbols occurring in the translation:
% 56.20/56.55  
% 56.20/56.55  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 56.20/56.55  .  [1, 2]      (w:1, o:29, a:1, s:1, b:0), 
% 56.20/56.55  !  [4, 1]      (w:0, o:19, a:1, s:1, b:0), 
% 56.20/56.55  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 56.20/56.55  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 56.20/56.55  queens_p  [35, 0]      (w:1, o:6, a:1, s:1, b:0), 
% 56.20/56.55  n0  [38, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 56.20/56.55  s  [39, 1]      (w:1, o:24, a:1, s:1, b:0), 
% 56.20/56.55  le  [40, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 56.20/56.55  n  [41, 0]      (w:1, o:10, a:1, s:1, b:0), 
% 56.20/56.55  p  [42, 1]      (w:1, o:25, a:1, s:1, b:0), 
% 56.20/56.55  plus  [43, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 56.20/56.55  minus  [44, 2]      (w:1, o:56, a:1, s:1, b:0), 
% 56.20/56.55  perm  [45, 1]      (w:1, o:26, a:1, s:1, b:0), 
% 56.20/56.55  q  [46, 1]      (w:1, o:27, a:1, s:1, b:0), 
% 56.20/56.55  queens_q  [47, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 56.20/56.55  lt  [48, 2]      (w:1, o:55, a:1, s:1, b:0), 
% 56.20/56.55  alpha1  [54, 1]      (w:1, o:28, a:1, s:1, b:1), 
% 56.20/56.55  alpha2  [55, 2]      (w:1, o:57, a:1, s:1, b:1), 
% 56.20/56.55  skol1  [56, 0]      (w:1, o:17, a:1, s:1, b:1), 
% 56.20/56.55  skol2  [57, 0]      (w:1, o:18, a:1, s:1, b:1).
% 56.20/56.55  
% 56.20/56.55  
% 56.20/56.55  Starting Search:
% 56.20/56.55  
% 56.20/56.55  *** allocated 15000 integers for clauses
% 56.20/56.55  *** allocated 22500 integers for clauses
% 56.20/56.55  *** allocated 33750 integers for clauses
% 56.20/56.55  *** allocated 50625 integers for clauses
% 56.20/56.55  *** allocated 15000 integers for termspace/termCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------