TSTP Solution File: SYN339+1 by Bliksem---1.12

View Problem - Process Solution

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

% Computer : n011.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:49:48 EDT 2022

% Result   : Theorem 0.45s 1.17s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN339+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.14/0.34  % Computer : n011.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % DateTime : Mon Jul 11 14:16:27 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.45/1.17  *** allocated 10000 integers for termspace/termends
% 0.45/1.17  *** allocated 10000 integers for clauses
% 0.45/1.17  *** allocated 10000 integers for justifications
% 0.45/1.17  Bliksem 1.12
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  Automatic Strategy Selection
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  Clauses:
% 0.45/1.17  
% 0.45/1.17  { big_f( X, skol1( X ), Y ) }.
% 0.45/1.17  { ! big_f( skol1( X ), Y, Y ) }.
% 0.45/1.17  
% 0.45/1.17  percentage equality = 0.000000, percentage horn = 1.000000
% 0.45/1.17  This is a near-Horn, non-equality  problem
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  Options Used:
% 0.45/1.17  
% 0.45/1.17  useres =            1
% 0.45/1.17  useparamod =        0
% 0.45/1.17  useeqrefl =         0
% 0.45/1.17  useeqfact =         0
% 0.45/1.17  usefactor =         1
% 0.45/1.17  usesimpsplitting =  0
% 0.45/1.17  usesimpdemod =      0
% 0.45/1.17  usesimpres =        4
% 0.45/1.17  
% 0.45/1.17  resimpinuse      =  1000
% 0.45/1.17  resimpclauses =     20000
% 0.45/1.17  substype =          standard
% 0.45/1.17  backwardsubs =      1
% 0.45/1.17  selectoldest =      5
% 0.45/1.17  
% 0.45/1.17  litorderings [0] =  split
% 0.45/1.17  litorderings [1] =  liftord
% 0.45/1.17  
% 0.45/1.17  termordering =      none
% 0.45/1.17  
% 0.45/1.17  litapriori =        1
% 0.45/1.17  termapriori =       0
% 0.45/1.17  litaposteriori =    0
% 0.45/1.17  termaposteriori =   0
% 0.45/1.17  demodaposteriori =  0
% 0.45/1.17  ordereqreflfact =   0
% 0.45/1.17  
% 0.45/1.17  litselect =         negative
% 0.45/1.17  
% 0.45/1.17  maxweight =         30000
% 0.45/1.17  maxdepth =          30000
% 0.45/1.17  maxlength =         115
% 0.45/1.17  maxnrvars =         195
% 0.45/1.17  excuselevel =       0
% 0.45/1.17  increasemaxweight = 0
% 0.45/1.17  
% 0.45/1.17  maxselected =       10000000
% 0.45/1.17  maxnrclauses =      10000000
% 0.45/1.17  
% 0.45/1.17  showgenerated =    0
% 0.45/1.17  showkept =         0
% 0.45/1.17  showselected =     0
% 0.45/1.17  showdeleted =      0
% 0.45/1.17  showresimp =       1
% 0.45/1.17  showstatus =       2000
% 0.45/1.17  
% 0.45/1.17  prologoutput =     0
% 0.45/1.17  nrgoals =          5000000
% 0.45/1.17  totalproof =       1
% 0.45/1.17  
% 0.45/1.17  Symbols occurring in the translation:
% 0.45/1.17  
% 0.45/1.17  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.45/1.17  .  [1, 2]      (w:1, o:15, a:1, s:1, b:0), 
% 0.45/1.17  !  [4, 1]      (w:1, o:9, a:1, s:1, b:0), 
% 0.45/1.17  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.45/1.17  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.45/1.17  big_f  [38, 3]      (w:1, o:39, a:1, s:1, b:0), 
% 0.45/1.17  skol1  [39, 1]      (w:1, o:14, a:1, s:1, b:0).
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  Starting Search:
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  Bliksems!, er is een bewijs:
% 0.45/1.17  % SZS status Theorem
% 0.45/1.17  % SZS output start Refutation
% 0.45/1.17  
% 0.45/1.17  (0) {G0,W5,D3,L1,V2,M1} I { big_f( X, skol1( X ), Y ) }.
% 0.45/1.17  (1) {G0,W6,D3,L1,V2,M1} I { ! big_f( skol1( X ), Y, Y ) }.
% 0.45/1.17  (2) {G1,W0,D0,L0,V0,M0} R(1,0) {  }.
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  % SZS output end Refutation
% 0.45/1.17  found a proof!
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  Unprocessed initial clauses:
% 0.45/1.17  
% 0.45/1.17  (4) {G0,W5,D3,L1,V2,M1}  { big_f( X, skol1( X ), Y ) }.
% 0.45/1.17  (5) {G0,W6,D3,L1,V2,M1}  { ! big_f( skol1( X ), Y, Y ) }.
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  Total Proof:
% 0.45/1.17  
% 0.45/1.17  subsumption: (0) {G0,W5,D3,L1,V2,M1} I { big_f( X, skol1( X ), Y ) }.
% 0.45/1.17  parent0: (4) {G0,W5,D3,L1,V2,M1}  { big_f( X, skol1( X ), Y ) }.
% 0.45/1.17  substitution0:
% 0.45/1.17     X := X
% 0.45/1.17     Y := Y
% 0.45/1.17  end
% 0.45/1.17  permutation0:
% 0.45/1.17     0 ==> 0
% 0.45/1.17  end
% 0.45/1.17  
% 0.45/1.17  subsumption: (1) {G0,W6,D3,L1,V2,M1} I { ! big_f( skol1( X ), Y, Y ) }.
% 0.45/1.17  parent0: (5) {G0,W6,D3,L1,V2,M1}  { ! big_f( skol1( X ), Y, Y ) }.
% 0.45/1.17  substitution0:
% 0.45/1.17     X := X
% 0.45/1.17     Y := Y
% 0.45/1.17  end
% 0.45/1.17  permutation0:
% 0.45/1.17     0 ==> 0
% 0.45/1.17  end
% 0.45/1.17  
% 0.45/1.17  resolution: (6) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.45/1.17  parent0[0]: (1) {G0,W6,D3,L1,V2,M1} I { ! big_f( skol1( X ), Y, Y ) }.
% 0.45/1.17  parent1[0]: (0) {G0,W5,D3,L1,V2,M1} I { big_f( X, skol1( X ), Y ) }.
% 0.45/1.17  substitution0:
% 0.45/1.17     X := X
% 0.45/1.17     Y := skol1( skol1( X ) )
% 0.45/1.17  end
% 0.45/1.17  substitution1:
% 0.45/1.17     X := skol1( X )
% 0.45/1.17     Y := skol1( skol1( X ) )
% 0.45/1.17  end
% 0.45/1.17  
% 0.45/1.17  subsumption: (2) {G1,W0,D0,L0,V0,M0} R(1,0) {  }.
% 0.45/1.17  parent0: (6) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.45/1.17  substitution0:
% 0.45/1.17  end
% 0.45/1.17  permutation0:
% 0.45/1.17  end
% 0.45/1.17  
% 0.45/1.17  Proof check complete!
% 0.45/1.17  
% 0.45/1.17  Memory use:
% 0.45/1.17  
% 0.45/1.17  space for terms:        43
% 0.45/1.17  space for clauses:      176
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  clauses generated:      3
% 0.45/1.17  clauses kept:           3
% 0.45/1.17  clauses selected:       2
% 0.45/1.17  clauses deleted:        0
% 0.45/1.17  clauses inuse deleted:  0
% 0.45/1.17  
% 0.45/1.17  subsentry:          0
% 0.45/1.17  literals s-matched: 0
% 0.45/1.17  literals matched:   0
% 0.45/1.17  full subsumption:   0
% 0.45/1.17  
% 0.45/1.17  checksum:           -268436644
% 0.45/1.17  
% 0.45/1.17  
% 0.45/1.17  Bliksem ended
%------------------------------------------------------------------------------