TSTP Solution File: COL016-1 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : COL016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n032.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:23 EDT 2022

% Result   : Unsatisfiable 0.44s 0.86s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : COL016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.08  % Command  : bliksem %s
% 0.07/0.27  % Computer : n032.cluster.edu
% 0.07/0.27  % Model    : x86_64 x86_64
% 0.07/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27  % Memory   : 8042.1875MB
% 0.07/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27  % CPULimit : 300
% 0.07/0.27  % DateTime : Tue May 31 14:06:28 EDT 2022
% 0.07/0.27  % CPUTime  : 
% 0.44/0.86  *** allocated 10000 integers for termspace/termends
% 0.44/0.86  *** allocated 10000 integers for clauses
% 0.44/0.86  *** allocated 10000 integers for justifications
% 0.44/0.86  Bliksem 1.12
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  Automatic Strategy Selection
% 0.44/0.86  
% 0.44/0.86  Clauses:
% 0.44/0.86  [
% 0.44/0.86     [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y, Z ) ) )
% 0.44/0.86     ],
% 0.44/0.86     [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ],
% 0.44/0.86     [ =( apply( m, X ), apply( X, X ) ) ],
% 0.44/0.86     [ ~( =( X, apply( combinator, X ) ) ) ]
% 0.44/0.86  ] .
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  percentage equality = 1.000000, percentage horn = 1.000000
% 0.44/0.86  This is a pure equality problem
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  Options Used:
% 0.44/0.86  
% 0.44/0.86  useres =            1
% 0.44/0.86  useparamod =        1
% 0.44/0.86  useeqrefl =         1
% 0.44/0.86  useeqfact =         1
% 0.44/0.86  usefactor =         1
% 0.44/0.86  usesimpsplitting =  0
% 0.44/0.86  usesimpdemod =      5
% 0.44/0.86  usesimpres =        3
% 0.44/0.86  
% 0.44/0.86  resimpinuse      =  1000
% 0.44/0.86  resimpclauses =     20000
% 0.44/0.86  substype =          eqrewr
% 0.44/0.86  backwardsubs =      1
% 0.44/0.86  selectoldest =      5
% 0.44/0.86  
% 0.44/0.86  litorderings [0] =  split
% 0.44/0.86  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.44/0.86  
% 0.44/0.86  termordering =      kbo
% 0.44/0.86  
% 0.44/0.86  litapriori =        0
% 0.44/0.86  termapriori =       1
% 0.44/0.86  litaposteriori =    0
% 0.44/0.86  termaposteriori =   0
% 0.44/0.86  demodaposteriori =  0
% 0.44/0.86  ordereqreflfact =   0
% 0.44/0.86  
% 0.44/0.86  litselect =         negord
% 0.44/0.86  
% 0.44/0.86  maxweight =         15
% 0.44/0.86  maxdepth =          30000
% 0.44/0.86  maxlength =         115
% 0.44/0.86  maxnrvars =         195
% 0.44/0.86  excuselevel =       1
% 0.44/0.86  increasemaxweight = 1
% 0.44/0.86  
% 0.44/0.86  maxselected =       10000000
% 0.44/0.86  maxnrclauses =      10000000
% 0.44/0.86  
% 0.44/0.86  showgenerated =    0
% 0.44/0.86  showkept =         0
% 0.44/0.86  showselected =     0
% 0.44/0.86  showdeleted =      0
% 0.44/0.86  showresimp =       1
% 0.44/0.86  showstatus =       2000
% 0.44/0.86  
% 0.44/0.86  prologoutput =     1
% 0.44/0.86  nrgoals =          5000000
% 0.44/0.86  totalproof =       1
% 0.44/0.86  
% 0.44/0.86  Symbols occurring in the translation:
% 0.44/0.86  
% 0.44/0.86  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.44/0.86  .  [1, 2]      (w:1, o:21, a:1, s:1, b:0), 
% 0.44/0.86  !  [4, 1]      (w:0, o:16, a:1, s:1, b:0), 
% 0.44/0.86  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.44/0.86  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.44/0.86  b  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.44/0.86  apply  [41, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.44/0.86  l  [44, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.44/0.86  m  [45, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.44/0.86  combinator  [46, 0]      (w:1, o:15, a:1, s:1, b:0).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  Starting Search:
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  Bliksems!, er is een bewijs:
% 0.44/0.86  % SZS status Unsatisfiable
% 0.44/0.86  % SZS output start Refutation
% 0.44/0.86  
% 0.44/0.86  clause( 1, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ] )
% 0.44/0.86  .
% 0.44/0.86  clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.44/0.86  .
% 0.44/0.86  clause( 15, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) ) ]
% 0.44/0.86     )
% 0.44/0.86  .
% 0.44/0.86  clause( 16, [] )
% 0.44/0.86  .
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  % SZS output end Refutation
% 0.44/0.86  found a proof!
% 0.44/0.86  
% 0.44/0.86  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/0.86  
% 0.44/0.86  initialclauses(
% 0.44/0.86  [ clause( 18, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( 
% 0.44/0.86    Y, Z ) ) ) ] )
% 0.44/0.86  , clause( 19, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ]
% 0.44/0.86     )
% 0.44/0.86  , clause( 20, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.44/0.86  , clause( 21, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.44/0.86  ] ).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  subsumption(
% 0.44/0.86  clause( 1, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ] )
% 0.44/0.86  , clause( 19, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ]
% 0.44/0.86     )
% 0.44/0.86  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/0.86     )] ) ).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  eqswap(
% 0.44/0.86  clause( 27, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.44/0.86  , clause( 21, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.44/0.86  , 0, substitution( 0, [ :=( X, X )] )).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  subsumption(
% 0.44/0.86  clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.44/0.86  , clause( 27, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.44/0.86  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  eqswap(
% 0.44/0.86  clause( 28, [ =( apply( X, apply( Y, Y ) ), apply( apply( l, X ), Y ) ) ]
% 0.44/0.86     )
% 0.44/0.86  , clause( 1, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ]
% 0.44/0.86     )
% 0.44/0.86  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  eqswap(
% 0.44/0.86  clause( 29, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.44/0.86  , clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.44/0.86  , 0, substitution( 0, [ :=( X, X )] )).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  paramod(
% 0.44/0.86  clause( 30, [ ~( =( apply( X, X ), apply( apply( l, combinator ), X ) ) ) ]
% 0.44/0.86     )
% 0.44/0.86  , clause( 28, [ =( apply( X, apply( Y, Y ) ), apply( apply( l, X ), Y ) ) ]
% 0.44/0.86     )
% 0.44/0.86  , 0, clause( 29, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.44/0.86  , 0, 5, substitution( 0, [ :=( X, combinator ), :=( Y, X )] ), 
% 0.44/0.86    substitution( 1, [ :=( X, apply( X, X ) )] )).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  eqswap(
% 0.44/0.86  clause( 31, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) ) ]
% 0.44/0.86     )
% 0.44/0.86  , clause( 30, [ ~( =( apply( X, X ), apply( apply( l, combinator ), X ) ) )
% 0.44/0.86     ] )
% 0.44/0.86  , 0, substitution( 0, [ :=( X, X )] )).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  subsumption(
% 0.44/0.86  clause( 15, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) ) ]
% 0.44/0.86     )
% 0.44/0.86  , clause( 31, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) )
% 0.44/0.86     ] )
% 0.44/0.86  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  eqswap(
% 0.44/0.86  clause( 32, [ ~( =( apply( X, X ), apply( apply( l, combinator ), X ) ) ) ]
% 0.44/0.86     )
% 0.44/0.86  , clause( 15, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) )
% 0.44/0.86     ] )
% 0.44/0.86  , 0, substitution( 0, [ :=( X, X )] )).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  eqrefl(
% 0.44/0.86  clause( 33, [] )
% 0.44/0.86  , clause( 32, [ ~( =( apply( X, X ), apply( apply( l, combinator ), X ) ) )
% 0.44/0.86     ] )
% 0.44/0.86  , 0, substitution( 0, [ :=( X, apply( l, combinator ) )] )).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  subsumption(
% 0.44/0.86  clause( 16, [] )
% 0.44/0.86  , clause( 33, [] )
% 0.44/0.86  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  end.
% 0.44/0.86  
% 0.44/0.86  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/0.86  
% 0.44/0.86  Memory use:
% 0.44/0.86  
% 0.44/0.86  space for terms:        294
% 0.44/0.86  space for clauses:      2055
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  clauses generated:      39
% 0.44/0.86  clauses kept:           17
% 0.44/0.86  clauses selected:       4
% 0.44/0.86  clauses deleted:        0
% 0.44/0.86  clauses inuse deleted:  0
% 0.44/0.86  
% 0.44/0.86  subsentry:          51
% 0.44/0.86  literals s-matched: 25
% 0.44/0.86  literals matched:   25
% 0.44/0.86  full subsumption:   0
% 0.44/0.86  
% 0.44/0.86  checksum:           1807487189
% 0.44/0.86  
% 0.44/0.86  
% 0.44/0.86  Bliksem ended
%------------------------------------------------------------------------------