↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SYN727-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n016.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:54:15 EDT 2022

% Result   : Unsatisfiable 0.74s 1.15s
% Output   : Refutation 0.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : SYN727-1 : TPTP v8.1.0. Released v2.5.0.
% 0.13/0.15  % Command  : bliksem %s
% 0.15/0.37  % Computer : n016.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % DateTime : Tue Jul 12 08:59:29 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.74/1.15  *** allocated 10000 integers for termspace/termends
% 0.74/1.15  *** allocated 10000 integers for clauses
% 0.74/1.15  *** allocated 10000 integers for justifications
% 0.74/1.15  Bliksem 1.12
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  Automatic Strategy Selection
% 0.74/1.15  
% 0.74/1.15  Clauses:
% 0.74/1.15  [
% 0.74/1.15     [ likes( X, bruce ) ],
% 0.74/1.15     [ likes( lyle, X ), ~( likes( X, Y ) ) ],
% 0.74/1.15     [ ~( likes( X, sk1( X ) ) ) ]
% 0.74/1.15  ] .
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  percentage equality = 0.000000, percentage horn = 1.000000
% 0.74/1.15  This is a near-Horn, non-equality  problem
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  Options Used:
% 0.74/1.15  
% 0.74/1.15  useres =            1
% 0.74/1.15  useparamod =        0
% 0.74/1.15  useeqrefl =         0
% 0.74/1.15  useeqfact =         0
% 0.74/1.15  usefactor =         1
% 0.74/1.15  usesimpsplitting =  0
% 0.74/1.15  usesimpdemod =      0
% 0.74/1.15  usesimpres =        4
% 0.74/1.15  
% 0.74/1.15  resimpinuse      =  1000
% 0.74/1.15  resimpclauses =     20000
% 0.74/1.15  substype =          standard
% 0.74/1.15  backwardsubs =      1
% 0.74/1.15  selectoldest =      5
% 0.74/1.15  
% 0.74/1.15  litorderings [0] =  split
% 0.74/1.15  litorderings [1] =  liftord
% 0.74/1.15  
% 0.74/1.15  termordering =      none
% 0.74/1.15  
% 0.74/1.15  litapriori =        1
% 0.74/1.15  termapriori =       0
% 0.74/1.15  litaposteriori =    0
% 0.74/1.15  termaposteriori =   0
% 0.74/1.15  demodaposteriori =  0
% 0.74/1.15  ordereqreflfact =   0
% 0.74/1.15  
% 0.74/1.15  litselect =         negative
% 0.74/1.15  
% 0.74/1.15  maxweight =         30000
% 0.74/1.15  maxdepth =          30000
% 0.74/1.15  maxlength =         115
% 0.74/1.15  maxnrvars =         195
% 0.74/1.15  excuselevel =       0
% 0.74/1.15  increasemaxweight = 0
% 0.74/1.15  
% 0.74/1.15  maxselected =       10000000
% 0.74/1.15  maxnrclauses =      10000000
% 0.74/1.15  
% 0.74/1.15  showgenerated =    0
% 0.74/1.15  showkept =         0
% 0.74/1.15  showselected =     0
% 0.74/1.15  showdeleted =      0
% 0.74/1.15  showresimp =       1
% 0.74/1.15  showstatus =       2000
% 0.74/1.15  
% 0.74/1.15  prologoutput =     1
% 0.74/1.15  nrgoals =          5000000
% 0.74/1.15  totalproof =       1
% 0.74/1.15  
% 0.74/1.15  Symbols occurring in the translation:
% 0.74/1.15  
% 0.74/1.15  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.74/1.15  .  [1, 2]      (w:1, o:19, a:1, s:1, b:0), 
% 0.74/1.15  !  [4, 1]      (w:1, o:13, a:1, s:1, b:0), 
% 0.74/1.15  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.74/1.15  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.74/1.15  bruce  [40, 0]      (w:1, o:10, a:1, s:1, b:0), 
% 0.74/1.15  likes  [41, 2]      (w:1, o:44, a:1, s:1, b:0), 
% 0.74/1.15  lyle  [42, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 0.74/1.15  sk1  [44, 1]      (w:1, o:18, a:1, s:1, b:0).
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  Starting Search:
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  Bliksems!, er is een bewijs:
% 0.74/1.15  % SZS status Unsatisfiable
% 0.74/1.15  % SZS output start Refutation
% 0.74/1.15  
% 0.74/1.15  clause( 0, [ likes( X, bruce ) ] )
% 0.74/1.15  .
% 0.74/1.15  clause( 1, [ likes( lyle, X ), ~( likes( X, Y ) ) ] )
% 0.74/1.15  .
% 0.74/1.15  clause( 2, [ ~( likes( X, sk1( X ) ) ) ] )
% 0.74/1.15  .
% 0.74/1.15  clause( 3, [ likes( lyle, X ) ] )
% 0.74/1.15  .
% 0.74/1.15  clause( 4, [] )
% 0.74/1.15  .
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  % SZS output end Refutation
% 0.74/1.15  found a proof!
% 0.74/1.15  
% 0.74/1.15  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.15  
% 0.74/1.15  initialclauses(
% 0.74/1.15  [ clause( 6, [ likes( X, bruce ) ] )
% 0.74/1.15  , clause( 7, [ likes( lyle, X ), ~( likes( X, Y ) ) ] )
% 0.74/1.15  , clause( 8, [ ~( likes( X, sk1( X ) ) ) ] )
% 0.74/1.15  ] ).
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  subsumption(
% 0.74/1.15  clause( 0, [ likes( X, bruce ) ] )
% 0.74/1.15  , clause( 6, [ likes( X, bruce ) ] )
% 0.74/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  subsumption(
% 0.74/1.15  clause( 1, [ likes( lyle, X ), ~( likes( X, Y ) ) ] )
% 0.74/1.15  , clause( 7, [ likes( lyle, X ), ~( likes( X, Y ) ) ] )
% 0.74/1.15  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.15     ), ==>( 1, 1 )] ) ).
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  subsumption(
% 0.74/1.15  clause( 2, [ ~( likes( X, sk1( X ) ) ) ] )
% 0.74/1.15  , clause( 8, [ ~( likes( X, sk1( X ) ) ) ] )
% 0.74/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  resolution(
% 0.74/1.15  clause( 9, [ likes( lyle, X ) ] )
% 0.74/1.15  , clause( 1, [ likes( lyle, X ), ~( likes( X, Y ) ) ] )
% 0.74/1.15  , 1, clause( 0, [ likes( X, bruce ) ] )
% 0.74/1.15  , 0, substitution( 0, [ :=( X, X ), :=( Y, bruce )] ), substitution( 1, [ 
% 0.74/1.15    :=( X, X )] )).
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  subsumption(
% 0.74/1.15  clause( 3, [ likes( lyle, X ) ] )
% 0.74/1.15  , clause( 9, [ likes( lyle, X ) ] )
% 0.74/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  resolution(
% 0.74/1.15  clause( 10, [] )
% 0.74/1.15  , clause( 2, [ ~( likes( X, sk1( X ) ) ) ] )
% 0.74/1.15  , 0, clause( 3, [ likes( lyle, X ) ] )
% 0.74/1.15  , 0, substitution( 0, [ :=( X, lyle )] ), substitution( 1, [ :=( X, sk1( 
% 0.74/1.15    lyle ) )] )).
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  subsumption(
% 0.74/1.15  clause( 4, [] )
% 0.74/1.15  , clause( 10, [] )
% 0.74/1.15  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  end.
% 0.74/1.15  
% 0.74/1.15  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.15  
% 0.74/1.15  Memory use:
% 0.74/1.15  
% 0.74/1.15  space for terms:        69
% 0.74/1.15  space for clauses:      243
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  clauses generated:      6
% 0.74/1.15  clauses kept:           5
% 0.74/1.15  clauses selected:       4
% 0.74/1.15  clauses deleted:        0
% 0.74/1.15  clauses inuse deleted:  0
% 0.74/1.15  
% 0.74/1.15  subsentry:          1
% 0.74/1.15  literals s-matched: 1
% 0.74/1.15  literals matched:   1
% 0.74/1.15  full subsumption:   0
% 0.74/1.15  
% 0.74/1.15  checksum:           66247
% 0.74/1.15  
% 0.74/1.15  
% 0.74/1.15  Bliksem ended
%------------------------------------------------------------------------------