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

View Problem - Process Solution

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

% Computer : n005.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:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN331+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n005.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 : Mon Jul 11 19:56:36 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.42/1.07  *** allocated 10000 integers for termspace/termends
% 0.42/1.07  *** allocated 10000 integers for clauses
% 0.42/1.07  *** allocated 10000 integers for justifications
% 0.42/1.07  Bliksem 1.12
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  Automatic Strategy Selection
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  Clauses:
% 0.42/1.07  
% 0.42/1.07  { big_f( Y, skol1( Z, Y ) ) }.
% 0.42/1.07  { ! big_f( skol1( Z, Y ), Y ) }.
% 0.42/1.07  { ! big_f( X, Y ), big_f( skol1( X, Y ), skol1( X, Y ) ) }.
% 0.42/1.07  { ! big_f( skol1( X, Y ), skol1( X, Y ) ), big_f( X, Y ) }.
% 0.42/1.07  { big_f( Y, X ), big_f( skol1( X, Y ), skol1( X, Y ) ) }.
% 0.42/1.07  { ! big_f( skol1( X, Y ), X ) }.
% 0.42/1.07  { big_f( X, skol1( X, Y ) ) }.
% 0.42/1.07  
% 0.42/1.07  percentage equality = 0.000000, percentage horn = 0.857143
% 0.42/1.07  This a non-horn, non-equality problem
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  Options Used:
% 0.42/1.07  
% 0.42/1.07  useres =            1
% 0.42/1.07  useparamod =        0
% 0.42/1.07  useeqrefl =         0
% 0.42/1.07  useeqfact =         0
% 0.42/1.07  usefactor =         1
% 0.42/1.07  usesimpsplitting =  0
% 0.42/1.07  usesimpdemod =      0
% 0.42/1.07  usesimpres =        3
% 0.42/1.07  
% 0.42/1.07  resimpinuse      =  1000
% 0.42/1.07  resimpclauses =     20000
% 0.42/1.07  substype =          standard
% 0.42/1.07  backwardsubs =      1
% 0.42/1.07  selectoldest =      5
% 0.42/1.07  
% 0.42/1.07  litorderings [0] =  split
% 0.42/1.07  litorderings [1] =  liftord
% 0.42/1.07  
% 0.42/1.07  termordering =      none
% 0.42/1.07  
% 0.42/1.07  litapriori =        1
% 0.42/1.07  termapriori =       0
% 0.42/1.07  litaposteriori =    0
% 0.42/1.07  termaposteriori =   0
% 0.42/1.07  demodaposteriori =  0
% 0.42/1.07  ordereqreflfact =   0
% 0.42/1.07  
% 0.42/1.07  litselect =         none
% 0.42/1.07  
% 0.42/1.07  maxweight =         15
% 0.42/1.07  maxdepth =          30000
% 0.42/1.07  maxlength =         115
% 0.42/1.07  maxnrvars =         195
% 0.42/1.07  excuselevel =       1
% 0.42/1.07  increasemaxweight = 1
% 0.42/1.07  
% 0.42/1.07  maxselected =       10000000
% 0.42/1.07  maxnrclauses =      10000000
% 0.42/1.07  
% 0.42/1.07  showgenerated =    0
% 0.42/1.07  showkept =         0
% 0.42/1.07  showselected =     0
% 0.42/1.07  showdeleted =      0
% 0.42/1.07  showresimp =       1
% 0.42/1.07  showstatus =       2000
% 0.42/1.07  
% 0.42/1.07  prologoutput =     0
% 0.42/1.07  nrgoals =          5000000
% 0.42/1.07  totalproof =       1
% 0.42/1.07  
% 0.42/1.07  Symbols occurring in the translation:
% 0.42/1.07  
% 0.42/1.07  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.42/1.07  .  [1, 2]      (w:1, o:14, a:1, s:1, b:0), 
% 0.42/1.07  !  [4, 1]      (w:0, o:9, a:1, s:1, b:0), 
% 0.42/1.07  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.42/1.07  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.42/1.07  big_f  [38, 2]      (w:1, o:38, a:1, s:1, b:0), 
% 0.42/1.07  skol1  [39, 2]      (w:1, o:39, a:1, s:1, b:0).
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  Starting Search:
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  Bliksems!, er is een bewijs:
% 0.42/1.07  % SZS status Theorem
% 0.42/1.07  % SZS output start Refutation
% 0.42/1.07  
% 0.42/1.07  (1) {G0,W5,D3,L1,V2,M1} I { ! big_f( skol1( Z, Y ), Y ) }.
% 0.42/1.07  (2) {G0,W10,D3,L2,V2,M2} I { big_f( skol1( X, Y ), skol1( X, Y ) ), ! big_f
% 0.42/1.07    ( X, Y ) }.
% 0.42/1.07  (3) {G0,W10,D3,L2,V2,M2} I { big_f( X, Y ), ! big_f( skol1( X, Y ), skol1( 
% 0.42/1.07    X, Y ) ) }.
% 0.42/1.07  (4) {G0,W10,D3,L2,V2,M2} I { big_f( skol1( X, Y ), skol1( X, Y ) ), big_f( 
% 0.42/1.07    Y, X ) }.
% 0.42/1.07  (11) {G1,W14,D3,L2,V2,M2} R(2,4) { big_f( skol1( Y, X ), skol1( Y, X ) ), 
% 0.42/1.07    big_f( skol1( X, Y ), skol1( X, Y ) ) }.
% 0.42/1.07  (12) {G2,W7,D3,L1,V1,M1} F(11) { big_f( skol1( X, X ), skol1( X, X ) ) }.
% 0.42/1.07  (13) {G3,W3,D2,L1,V2,M1} R(3,3);r(12) { big_f( X, Y ) }.
% 0.42/1.07  (14) {G4,W0,D0,L0,V0,M0} R(3,1);r(13) {  }.
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  % SZS output end Refutation
% 0.42/1.07  found a proof!
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  Unprocessed initial clauses:
% 0.42/1.07  
% 0.42/1.07  (16) {G0,W5,D3,L1,V2,M1}  { big_f( Y, skol1( Z, Y ) ) }.
% 0.42/1.07  (17) {G0,W5,D3,L1,V2,M1}  { ! big_f( skol1( Z, Y ), Y ) }.
% 0.42/1.07  (18) {G0,W10,D3,L2,V2,M2}  { ! big_f( X, Y ), big_f( skol1( X, Y ), skol1( 
% 0.42/1.07    X, Y ) ) }.
% 0.42/1.07  (19) {G0,W10,D3,L2,V2,M2}  { ! big_f( skol1( X, Y ), skol1( X, Y ) ), big_f
% 0.42/1.07    ( X, Y ) }.
% 0.42/1.07  (20) {G0,W10,D3,L2,V2,M2}  { big_f( Y, X ), big_f( skol1( X, Y ), skol1( X
% 0.42/1.07    , Y ) ) }.
% 0.42/1.07  (21) {G0,W5,D3,L1,V2,M1}  { ! big_f( skol1( X, Y ), X ) }.
% 0.42/1.07  (22) {G0,W5,D3,L1,V2,M1}  { big_f( X, skol1( X, Y ) ) }.
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  Total Proof:
% 0.42/1.07  
% 0.42/1.07  subsumption: (1) {G0,W5,D3,L1,V2,M1} I { ! big_f( skol1( Z, Y ), Y ) }.
% 0.42/1.07  parent0: (17) {G0,W5,D3,L1,V2,M1}  { ! big_f( skol1( Z, Y ), Y ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := T
% 0.42/1.07     Y := Y
% 0.42/1.07     Z := Z
% 0.42/1.07  end
% 0.42/1.07  permutation0:
% 0.42/1.07     0 ==> 0
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  subsumption: (2) {G0,W10,D3,L2,V2,M2} I { big_f( skol1( X, Y ), skol1( X, Y
% 0.42/1.07     ) ), ! big_f( X, Y ) }.
% 0.42/1.07  parent0: (18) {G0,W10,D3,L2,V2,M2}  { ! big_f( X, Y ), big_f( skol1( X, Y )
% 0.42/1.07    , skol1( X, Y ) ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07     Y := Y
% 0.42/1.07  end
% 0.42/1.07  permutation0:
% 0.42/1.07     0 ==> 1
% 0.42/1.07     1 ==> 0
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  subsumption: (3) {G0,W10,D3,L2,V2,M2} I { big_f( X, Y ), ! big_f( skol1( X
% 0.42/1.07    , Y ), skol1( X, Y ) ) }.
% 0.42/1.07  parent0: (19) {G0,W10,D3,L2,V2,M2}  { ! big_f( skol1( X, Y ), skol1( X, Y )
% 0.42/1.07     ), big_f( X, Y ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07     Y := Y
% 0.42/1.07  end
% 0.42/1.07  permutation0:
% 0.42/1.07     0 ==> 1
% 0.42/1.07     1 ==> 0
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  subsumption: (4) {G0,W10,D3,L2,V2,M2} I { big_f( skol1( X, Y ), skol1( X, Y
% 0.42/1.07     ) ), big_f( Y, X ) }.
% 0.42/1.07  parent0: (20) {G0,W10,D3,L2,V2,M2}  { big_f( Y, X ), big_f( skol1( X, Y ), 
% 0.42/1.07    skol1( X, Y ) ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07     Y := Y
% 0.42/1.07  end
% 0.42/1.07  permutation0:
% 0.42/1.07     0 ==> 1
% 0.42/1.07     1 ==> 0
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  resolution: (24) {G1,W14,D3,L2,V2,M2}  { big_f( skol1( X, Y ), skol1( X, Y
% 0.42/1.07     ) ), big_f( skol1( Y, X ), skol1( Y, X ) ) }.
% 0.42/1.07  parent0[1]: (2) {G0,W10,D3,L2,V2,M2} I { big_f( skol1( X, Y ), skol1( X, Y
% 0.42/1.07     ) ), ! big_f( X, Y ) }.
% 0.42/1.07  parent1[1]: (4) {G0,W10,D3,L2,V2,M2} I { big_f( skol1( X, Y ), skol1( X, Y
% 0.42/1.07     ) ), big_f( Y, X ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07     Y := Y
% 0.42/1.07  end
% 0.42/1.07  substitution1:
% 0.42/1.07     X := Y
% 0.42/1.07     Y := X
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  subsumption: (11) {G1,W14,D3,L2,V2,M2} R(2,4) { big_f( skol1( Y, X ), skol1
% 0.42/1.07    ( Y, X ) ), big_f( skol1( X, Y ), skol1( X, Y ) ) }.
% 0.42/1.07  parent0: (24) {G1,W14,D3,L2,V2,M2}  { big_f( skol1( X, Y ), skol1( X, Y ) )
% 0.42/1.07    , big_f( skol1( Y, X ), skol1( Y, X ) ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := Y
% 0.42/1.07     Y := X
% 0.42/1.07  end
% 0.42/1.07  permutation0:
% 0.42/1.07     0 ==> 0
% 0.42/1.07     1 ==> 1
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  factor: (26) {G1,W7,D3,L1,V1,M1}  { big_f( skol1( X, X ), skol1( X, X ) )
% 0.42/1.07     }.
% 0.42/1.07  parent0[0, 1]: (11) {G1,W14,D3,L2,V2,M2} R(2,4) { big_f( skol1( Y, X ), 
% 0.42/1.07    skol1( Y, X ) ), big_f( skol1( X, Y ), skol1( X, Y ) ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07     Y := X
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  subsumption: (12) {G2,W7,D3,L1,V1,M1} F(11) { big_f( skol1( X, X ), skol1( 
% 0.42/1.07    X, X ) ) }.
% 0.42/1.07  parent0: (26) {G1,W7,D3,L1,V1,M1}  { big_f( skol1( X, X ), skol1( X, X ) )
% 0.42/1.07     }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07  end
% 0.42/1.07  permutation0:
% 0.42/1.07     0 ==> 0
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  resolution: (27) {G1,W18,D4,L2,V2,M2}  { big_f( X, Y ), ! big_f( skol1( 
% 0.42/1.07    skol1( X, Y ), skol1( X, Y ) ), skol1( skol1( X, Y ), skol1( X, Y ) ) )
% 0.42/1.07     }.
% 0.42/1.07  parent0[1]: (3) {G0,W10,D3,L2,V2,M2} I { big_f( X, Y ), ! big_f( skol1( X, 
% 0.42/1.07    Y ), skol1( X, Y ) ) }.
% 0.42/1.07  parent1[0]: (3) {G0,W10,D3,L2,V2,M2} I { big_f( X, Y ), ! big_f( skol1( X, 
% 0.42/1.07    Y ), skol1( X, Y ) ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07     Y := Y
% 0.42/1.07  end
% 0.42/1.07  substitution1:
% 0.42/1.07     X := skol1( X, Y )
% 0.42/1.07     Y := skol1( X, Y )
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  resolution: (28) {G2,W3,D2,L1,V2,M1}  { big_f( X, Y ) }.
% 0.42/1.07  parent0[1]: (27) {G1,W18,D4,L2,V2,M2}  { big_f( X, Y ), ! big_f( skol1( 
% 0.42/1.07    skol1( X, Y ), skol1( X, Y ) ), skol1( skol1( X, Y ), skol1( X, Y ) ) )
% 0.42/1.07     }.
% 0.42/1.07  parent1[0]: (12) {G2,W7,D3,L1,V1,M1} F(11) { big_f( skol1( X, X ), skol1( X
% 0.42/1.07    , X ) ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07     Y := Y
% 0.42/1.07  end
% 0.42/1.07  substitution1:
% 0.42/1.07     X := skol1( X, Y )
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  subsumption: (13) {G3,W3,D2,L1,V2,M1} R(3,3);r(12) { big_f( X, Y ) }.
% 0.42/1.07  parent0: (28) {G2,W3,D2,L1,V2,M1}  { big_f( X, Y ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07     Y := Y
% 0.42/1.07  end
% 0.42/1.07  permutation0:
% 0.42/1.07     0 ==> 0
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  resolution: (29) {G1,W11,D4,L1,V2,M1}  { ! big_f( skol1( skol1( X, Y ), Y )
% 0.42/1.07    , skol1( skol1( X, Y ), Y ) ) }.
% 0.42/1.07  parent0[0]: (1) {G0,W5,D3,L1,V2,M1} I { ! big_f( skol1( Z, Y ), Y ) }.
% 0.42/1.07  parent1[0]: (3) {G0,W10,D3,L2,V2,M2} I { big_f( X, Y ), ! big_f( skol1( X, 
% 0.42/1.07    Y ), skol1( X, Y ) ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := Z
% 0.42/1.07     Y := Y
% 0.42/1.07     Z := X
% 0.42/1.07  end
% 0.42/1.07  substitution1:
% 0.42/1.07     X := skol1( X, Y )
% 0.42/1.07     Y := Y
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  resolution: (30) {G2,W0,D0,L0,V0,M0}  {  }.
% 0.42/1.07  parent0[0]: (29) {G1,W11,D4,L1,V2,M1}  { ! big_f( skol1( skol1( X, Y ), Y )
% 0.42/1.07    , skol1( skol1( X, Y ), Y ) ) }.
% 0.42/1.07  parent1[0]: (13) {G3,W3,D2,L1,V2,M1} R(3,3);r(12) { big_f( X, Y ) }.
% 0.42/1.07  substitution0:
% 0.42/1.07     X := X
% 0.42/1.07     Y := Y
% 0.42/1.07  end
% 0.42/1.07  substitution1:
% 0.42/1.07     X := skol1( skol1( X, Y ), Y )
% 0.42/1.07     Y := skol1( skol1( X, Y ), Y )
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  subsumption: (14) {G4,W0,D0,L0,V0,M0} R(3,1);r(13) {  }.
% 0.42/1.07  parent0: (30) {G2,W0,D0,L0,V0,M0}  {  }.
% 0.42/1.07  substitution0:
% 0.42/1.07  end
% 0.42/1.07  permutation0:
% 0.42/1.07  end
% 0.42/1.07  
% 0.42/1.07  Proof check complete!
% 0.42/1.07  
% 0.42/1.07  Memory use:
% 0.42/1.07  
% 0.42/1.07  space for terms:        247
% 0.42/1.07  space for clauses:      1027
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  clauses generated:      25
% 0.42/1.07  clauses kept:           15
% 0.42/1.07  clauses selected:       8
% 0.42/1.07  clauses deleted:        0
% 0.42/1.07  clauses inuse deleted:  0
% 0.42/1.07  
% 0.42/1.07  subsentry:          29
% 0.42/1.07  literals s-matched: 16
% 0.42/1.07  literals matched:   16
% 0.42/1.07  full subsumption:   3
% 0.42/1.07  
% 0.42/1.07  checksum:           6
% 0.42/1.07  
% 0.42/1.07  
% 0.42/1.07  Bliksem ended
%------------------------------------------------------------------------------