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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SYN341+1 : TPTP v8.1.0. Released v2.0.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:49:49 EDT 2022

% Result   : Theorem 0.42s 0.84s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : -

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