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

View Problem - Process Solution

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

% Computer : n022.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:47 EDT 2022

% Result   : Theorem 0.71s 1.10s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : -

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