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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SYN729-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n015.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:16 EDT 2022

% Result   : Unsatisfiable 0.46s 1.13s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN729-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n015.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.34  % CPULimit : 300
% 0.13/0.34  % DateTime : Tue Jul 12 05:02:25 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.46/1.13  *** allocated 10000 integers for termspace/termends
% 0.46/1.13  *** allocated 10000 integers for clauses
% 0.46/1.13  *** allocated 10000 integers for justifications
% 0.46/1.13  Bliksem 1.12
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  Automatic Strategy Selection
% 0.46/1.13  
% 0.46/1.13  Clauses:
% 0.46/1.13  [
% 0.46/1.13     [ l( X, g( h( sk1( X ) ) ) ), ~( p( X ) ) ],
% 0.46/1.13     [ p( sk1( X ) ), ~( p( X ) ) ],
% 0.46/1.13     [ p( g( X ) ), ~( p( X ) ) ],
% 0.46/1.13     [ p( h( X ) ), ~( p( X ) ) ],
% 0.46/1.13     [ p( sk2 ) ],
% 0.46/1.13     [ ~( p( X ) ), ~( l( sk2, X ) ) ]
% 0.46/1.13  ] .
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  percentage equality = 0.000000, percentage horn = 1.000000
% 0.46/1.13  This is a near-Horn, non-equality  problem
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  Options Used:
% 0.46/1.13  
% 0.46/1.13  useres =            1
% 0.46/1.13  useparamod =        0
% 0.46/1.13  useeqrefl =         0
% 0.46/1.13  useeqfact =         0
% 0.46/1.13  usefactor =         1
% 0.46/1.13  usesimpsplitting =  0
% 0.46/1.13  usesimpdemod =      0
% 0.46/1.13  usesimpres =        4
% 0.46/1.13  
% 0.46/1.13  resimpinuse      =  1000
% 0.46/1.13  resimpclauses =     20000
% 0.46/1.13  substype =          standard
% 0.46/1.13  backwardsubs =      1
% 0.46/1.13  selectoldest =      5
% 0.46/1.13  
% 0.46/1.13  litorderings [0] =  split
% 0.46/1.13  litorderings [1] =  liftord
% 0.46/1.13  
% 0.46/1.13  termordering =      none
% 0.46/1.13  
% 0.46/1.13  litapriori =        1
% 0.46/1.13  termapriori =       0
% 0.46/1.13  litaposteriori =    0
% 0.46/1.13  termaposteriori =   0
% 0.46/1.13  demodaposteriori =  0
% 0.46/1.13  ordereqreflfact =   0
% 0.46/1.13  
% 0.46/1.13  litselect =         negative
% 0.46/1.13  
% 0.46/1.13  maxweight =         30000
% 0.46/1.13  maxdepth =          30000
% 0.46/1.13  maxlength =         115
% 0.46/1.13  maxnrvars =         195
% 0.46/1.13  excuselevel =       0
% 0.46/1.13  increasemaxweight = 0
% 0.46/1.13  
% 0.46/1.13  maxselected =       10000000
% 0.46/1.13  maxnrclauses =      10000000
% 0.46/1.13  
% 0.46/1.13  showgenerated =    0
% 0.46/1.13  showkept =         0
% 0.46/1.13  showselected =     0
% 0.46/1.13  showdeleted =      0
% 0.46/1.13  showresimp =       1
% 0.46/1.13  showstatus =       2000
% 0.46/1.13  
% 0.46/1.13  prologoutput =     1
% 0.46/1.13  nrgoals =          5000000
% 0.46/1.13  totalproof =       1
% 0.46/1.13  
% 0.46/1.13  Symbols occurring in the translation:
% 0.46/1.13  
% 0.46/1.13  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.46/1.13  .  [1, 2]      (w:1, o:20, a:1, s:1, b:0), 
% 0.46/1.13  !  [4, 1]      (w:1, o:11, a:1, s:1, b:0), 
% 0.46/1.13  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.46/1.13  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.46/1.13  sk1  [40, 1]      (w:1, o:16, a:1, s:1, b:0), 
% 0.46/1.13  h  [41, 1]      (w:1, o:18, a:1, s:1, b:0), 
% 0.46/1.13  g  [42, 1]      (w:1, o:17, a:1, s:1, b:0), 
% 0.46/1.13  l  [43, 2]      (w:1, o:45, a:1, s:1, b:0), 
% 0.46/1.13  p  [44, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.46/1.13  sk2  [45, 0]      (w:1, o:5, a:1, s:1, b:0).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  Starting Search:
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  Bliksems!, er is een bewijs:
% 0.46/1.13  % SZS status Unsatisfiable
% 0.46/1.13  % SZS output start Refutation
% 0.46/1.13  
% 0.46/1.13  clause( 0, [ l( X, g( h( sk1( X ) ) ) ), ~( p( X ) ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 1, [ p( sk1( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 2, [ p( g( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 3, [ p( h( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 4, [ p( sk2 ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 5, [ ~( p( X ) ), ~( l( sk2, X ) ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 13, [ l( sk2, g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 33, [ p( sk1( sk2 ) ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 37, [ p( h( sk1( sk2 ) ) ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 47, [ p( g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  .
% 0.46/1.13  clause( 134, [] )
% 0.46/1.13  .
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  % SZS output end Refutation
% 0.46/1.13  found a proof!
% 0.46/1.13  
% 0.46/1.13  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.13  
% 0.46/1.13  initialclauses(
% 0.46/1.13  [ clause( 136, [ l( X, g( h( sk1( X ) ) ) ), ~( p( X ) ) ] )
% 0.46/1.13  , clause( 137, [ p( sk1( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , clause( 138, [ p( g( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , clause( 139, [ p( h( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , clause( 140, [ p( sk2 ) ] )
% 0.46/1.13  , clause( 141, [ ~( p( X ) ), ~( l( sk2, X ) ) ] )
% 0.46/1.13  ] ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 0, [ l( X, g( h( sk1( X ) ) ) ), ~( p( X ) ) ] )
% 0.46/1.13  , clause( 136, [ l( X, g( h( sk1( X ) ) ) ), ~( p( X ) ) ] )
% 0.46/1.13  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.46/1.13    1 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 1, [ p( sk1( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , clause( 137, [ p( sk1( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.46/1.13    1 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 2, [ p( g( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , clause( 138, [ p( g( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.46/1.13    1 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 3, [ p( h( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , clause( 139, [ p( h( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.46/1.13    1 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 4, [ p( sk2 ) ] )
% 0.46/1.13  , clause( 140, [ p( sk2 ) ] )
% 0.46/1.13  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 5, [ ~( p( X ) ), ~( l( sk2, X ) ) ] )
% 0.46/1.13  , clause( 141, [ ~( p( X ) ), ~( l( sk2, X ) ) ] )
% 0.46/1.13  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.46/1.13    1 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  resolution(
% 0.46/1.13  clause( 142, [ l( sk2, g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  , clause( 0, [ l( X, g( h( sk1( X ) ) ) ), ~( p( X ) ) ] )
% 0.46/1.13  , 1, clause( 4, [ p( sk2 ) ] )
% 0.46/1.13  , 0, substitution( 0, [ :=( X, sk2 )] ), substitution( 1, [] )).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 13, [ l( sk2, g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  , clause( 142, [ l( sk2, g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  resolution(
% 0.46/1.13  clause( 143, [ p( sk1( sk2 ) ) ] )
% 0.46/1.13  , clause( 1, [ p( sk1( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , 1, clause( 4, [ p( sk2 ) ] )
% 0.46/1.13  , 0, substitution( 0, [ :=( X, sk2 )] ), substitution( 1, [] )).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 33, [ p( sk1( sk2 ) ) ] )
% 0.46/1.13  , clause( 143, [ p( sk1( sk2 ) ) ] )
% 0.46/1.13  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  resolution(
% 0.46/1.13  clause( 144, [ p( h( sk1( sk2 ) ) ) ] )
% 0.46/1.13  , clause( 3, [ p( h( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , 1, clause( 33, [ p( sk1( sk2 ) ) ] )
% 0.46/1.13  , 0, substitution( 0, [ :=( X, sk1( sk2 ) )] ), substitution( 1, [] )).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 37, [ p( h( sk1( sk2 ) ) ) ] )
% 0.46/1.13  , clause( 144, [ p( h( sk1( sk2 ) ) ) ] )
% 0.46/1.13  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  resolution(
% 0.46/1.13  clause( 145, [ p( g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  , clause( 2, [ p( g( X ) ), ~( p( X ) ) ] )
% 0.46/1.13  , 1, clause( 37, [ p( h( sk1( sk2 ) ) ) ] )
% 0.46/1.13  , 0, substitution( 0, [ :=( X, h( sk1( sk2 ) ) )] ), substitution( 1, [] )
% 0.46/1.13    ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 47, [ p( g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  , clause( 145, [ p( g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  resolution(
% 0.46/1.13  clause( 146, [ ~( p( g( h( sk1( sk2 ) ) ) ) ) ] )
% 0.46/1.13  , clause( 5, [ ~( p( X ) ), ~( l( sk2, X ) ) ] )
% 0.46/1.13  , 1, clause( 13, [ l( sk2, g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  , 0, substitution( 0, [ :=( X, g( h( sk1( sk2 ) ) ) )] ), substitution( 1
% 0.46/1.13    , [] )).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  resolution(
% 0.46/1.13  clause( 147, [] )
% 0.46/1.13  , clause( 146, [ ~( p( g( h( sk1( sk2 ) ) ) ) ) ] )
% 0.46/1.13  , 0, clause( 47, [ p( g( h( sk1( sk2 ) ) ) ) ] )
% 0.46/1.13  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  subsumption(
% 0.46/1.13  clause( 134, [] )
% 0.46/1.13  , clause( 147, [] )
% 0.46/1.13  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  end.
% 0.46/1.13  
% 0.46/1.13  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.13  
% 0.46/1.13  Memory use:
% 0.46/1.13  
% 0.46/1.13  space for terms:        1024
% 0.46/1.13  space for clauses:      8299
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  clauses generated:      135
% 0.46/1.13  clauses kept:           135
% 0.46/1.13  clauses selected:       41
% 0.46/1.13  clauses deleted:        0
% 0.46/1.13  clauses inuse deleted:  0
% 0.46/1.13  
% 0.46/1.13  subsentry:          0
% 0.46/1.13  literals s-matched: 0
% 0.46/1.13  literals matched:   0
% 0.46/1.13  full subsumption:   0
% 0.46/1.13  
% 0.46/1.13  checksum:           994349763
% 0.46/1.13  
% 0.46/1.13  
% 0.46/1.13  Bliksem ended
%------------------------------------------------------------------------------