↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : COL074-3 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n026.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 : Fri Jul 15 00:12:36 EDT 2022

% Result   : Unsatisfiable 0.71s 1.09s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : COL074-3 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n026.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 : Tue May 31 06:39:56 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.71/1.09  *** allocated 10000 integers for termspace/termends
% 0.71/1.09  *** allocated 10000 integers for clauses
% 0.71/1.09  *** allocated 10000 integers for justifications
% 0.71/1.09  Bliksem 1.12
% 0.71/1.09  
% 0.71/1.09  
% 0.71/1.09  Automatic Strategy Selection
% 0.71/1.09  
% 0.71/1.09  Clauses:
% 0.71/1.09  [
% 0.71/1.09     [ =( apply( apply( k, X ), Y ), X ) ],
% 0.71/1.09     [ =( apply( projection1, pair( X, Y ) ), X ) ],
% 0.71/1.09     [ =( apply( projection2, pair( X, Y ) ), Y ) ],
% 0.71/1.09     [ =( pair( apply( projection1, X ), apply( projection2, X ) ), X ) ]
% 0.71/1.09    ,
% 0.71/1.09     [ =( apply( pair( X, Y ), Z ), pair( apply( X, Z ), apply( Y, Z ) ) ) ]
% 0.71/1.09    ,
% 0.71/1.09     [ =( apply( apply( apply( abstraction, X ), Y ), Z ), apply( apply( X, 
% 0.71/1.09    apply( k, Z ) ), apply( Y, Z ) ) ) ],
% 0.71/1.09     [ =( apply( eq, pair( X, X ) ), projection1 ) ],
% 0.71/1.09     [ =( X, Y ), =( apply( eq, pair( X, Y ) ), projection2 ) ],
% 0.71/1.09     [ =( X, Y ), ~( =( apply( X, n( X, Y ) ), apply( Y, n( X, Y ) ) ) ) ]
% 0.71/1.09    ,
% 0.71/1.09     [ ~( =( projection1, projection2 ) ) ],
% 0.71/1.09     [ =( apply( k, projection1 ), 'k_projection1' ) ],
% 0.71/1.09     [ =( apply( k, projection2 ), 'k_projection2' ) ],
% 0.71/1.09     [ =( s, apply( eq, pair( apply( k, s ), apply( k, projection2 ) ) ) ) ]
% 0.71/1.09    
% 0.71/1.09  ] .
% 0.71/1.09  
% 0.71/1.09  
% 0.71/1.09  percentage equality = 1.000000, percentage horn = 0.923077
% 0.71/1.09  This is a pure equality problem
% 0.71/1.09  
% 0.71/1.09  
% 0.71/1.09  
% 0.71/1.09  Options Used:
% 0.71/1.09  
% 0.71/1.09  useres =            1
% 0.71/1.09  useparamod =        1
% 0.71/1.09  useeqrefl =         1
% 0.71/1.09  useeqfact =         1
% 0.71/1.09  usefactor =         1
% 0.71/1.09  usesimpsplitting =  0
% 0.71/1.09  usesimpdemod =      5
% 0.71/1.09  usesimpres =        3
% 0.71/1.09  
% 0.71/1.09  resimpinuse      =  1000
% 0.71/1.09  resimpclauses =     20000
% 0.71/1.09  substype =          eqrewr
% 0.71/1.09  backwardsubs =      1
% 0.71/1.09  selectoldest =      5
% 0.71/1.09  
% 0.71/1.09  litorderings [0] =  split
% 0.71/1.09  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.71/1.09  
% 0.71/1.09  termordering =      kbo
% 0.71/1.09  
% 0.71/1.09  litapriori =        0
% 0.71/1.09  termapriori =       1
% 0.71/1.09  litaposteriori =    0
% 0.71/1.09  termaposteriori =   0
% 0.71/1.09  demodaposteriori =  0
% 0.71/1.09  ordereqreflfact =   0
% 0.71/1.09  
% 0.71/1.09  litselect =         negord
% 0.71/1.09  
% 0.71/1.09  maxweight =         15
% 0.71/1.09  maxdepth =          30000
% 0.71/1.09  maxlength =         115
% 0.71/1.09  maxnrvars =         195
% 0.71/1.09  excuselevel =       1
% 0.71/1.09  increasemaxweight = 1
% 0.71/1.09  
% 0.71/1.09  maxselected =       10000000
% 0.71/1.09  maxnrclauses =      10000000
% 0.71/1.09  
% 0.71/1.09  showgenerated =    0
% 0.71/1.09  showkept =         0
% 0.71/1.09  showselected =     0
% 0.71/1.09  showdeleted =      0
% 0.71/1.09  showresimp =       1
% 0.71/1.09  showstatus =       2000
% 0.71/1.09  
% 0.71/1.09  prologoutput =     1
% 0.71/1.09  nrgoals =          5000000
% 0.71/1.09  totalproof =       1
% 0.71/1.09  
% 0.71/1.09  Symbols occurring in the translation:
% 0.71/1.09  
% 0.71/1.09  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.71/1.09  .  [1, 2]      (w:1, o:25, a:1, s:1, b:0), 
% 0.71/1.09  !  [4, 1]      (w:0, o:20, a:1, s:1, b:0), 
% 0.71/1.09  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.09  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.09  k  [39, 0]      (w:1, o:10, a:1, s:1, b:0), 
% 0.71/1.09  apply  [41, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 0.71/1.09  projection1  [43, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.71/1.09  pair  [44, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 0.71/1.09  projection2  [45, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.71/1.09  abstraction  [47, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 0.71/1.09  eq  [48, 0]      (w:1, o:17, a:1, s:1, b:0), 
% 0.71/1.09  n  [49, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 0.71/1.09  'k_projection1'  [50, 0]      (w:1, o:18, a:1, s:1, b:0), 
% 0.71/1.09  'k_projection2'  [51, 0]      (w:1, o:19, a:1, s:1, b:0), 
% 0.71/1.09  s  [52, 0]      (w:1, o:5, a:1, s:1, b:0).
% 0.71/1.09  
% 0.71/1.09  
% 0.71/1.09  Starting Search:
% 0.71/1.09  
% 0.71/1.09  
% 0.71/1.09  Bliksems!, er is een bewijs:
% 0.71/1.09  % SZS status Unsatisfiable
% 0.71/1.09  % SZS output start Refutation
% 0.71/1.09  
% 0.71/1.09  clause( 0, [ =( apply( apply( k, X ), Y ), X ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 6, [ =( apply( eq, pair( X, X ) ), projection1 ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 7, [ =( X, Y ), =( apply( eq, pair( X, Y ) ), projection2 ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 9, [ ~( =( projection2, projection1 ) ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 11, [ =( apply( k, projection2 ), 'k_projection2' ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 12, [ =( apply( eq, pair( apply( k, s ), 'k_projection2' ) ), s ) ]
% 0.71/1.09     )
% 0.71/1.09  .
% 0.71/1.09  clause( 14, [ =( apply( 'k_projection2', X ), projection2 ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 42, [ =( projection2, s ), =( apply( k, s ), 'k_projection2' ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 265, [ =( projection2, s ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 267, [ =( apply( k, s ), 'k_projection2' ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 274, [ ~( =( projection1, s ) ) ] )
% 0.71/1.09  .
% 0.71/1.09  clause( 290, [] )
% 0.71/1.09  .
% 0.71/1.09  
% 0.71/1.09  
% 0.71/1.09  % SZS output end Refutation
% 0.71/1.09  found a proof!
% 0.71/1.09  
% 0.71/1.09  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.09  
% 0.71/1.09  initialclauses(
% 0.71/1.09  [ clause( 292, [ =( apply( apply( k, X ), Y ), X ) ] )
% 0.71/1.09  , clause( 293, [ =( apply( projection1, pair( X, Y ) ), X ) ] )
% 0.71/1.09  , clause( 294, [ =( apply( projection2, pair( X, Y ) ), Y ) ] )
% 0.71/1.09  , clause( 295, [ =( pair( apply( projection1, X ), apply( prCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------