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

View Problem - Process Solution

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

% Computer : n008.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:50:12 EDT 2022

% Result   : Theorem 0.70s 1.09s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : -

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