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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : GEO220+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n017.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 : Sat Jul 16 02:52:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GEO220+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n017.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 : Sat Jun 18 06:53:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.71/1.08  *** allocated 10000 integers for termspace/termends
% 0.71/1.08  *** allocated 10000 integers for clauses
% 0.71/1.08  *** allocated 10000 integers for justifications
% 0.71/1.08  Bliksem 1.12
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  Automatic Strategy Selection
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  Clauses:
% 0.71/1.08  
% 0.71/1.08  { ! distinct_points( X, X ) }.
% 0.71/1.08  { ! distinct_lines( X, X ) }.
% 0.71/1.08  { ! convergent_lines( X, X ) }.
% 0.71/1.08  { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.71/1.08     ) }.
% 0.71/1.08  { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.71/1.08     }.
% 0.71/1.08  { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.71/1.08    , Z ) }.
% 0.71/1.08  { ! distinct_points( X, Y ), ! apart_point_and_line( X, line_connecting( X
% 0.71/1.08    , Y ) ) }.
% 0.71/1.08  { ! distinct_points( X, Y ), ! apart_point_and_line( Y, line_connecting( X
% 0.71/1.08    , Y ) ) }.
% 0.71/1.08  { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.71/1.08    , Y ), X ) }.
% 0.71/1.08  { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.71/1.08    , Y ), Y ) }.
% 0.71/1.08  { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.71/1.08    ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ), 
% 0.71/1.08    apart_point_and_line( Y, T ) }.
% 0.71/1.08  { ! apart_point_and_line( X, Y ), distinct_points( X, Z ), 
% 0.71/1.08    apart_point_and_line( Z, Y ) }.
% 0.71/1.08  { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ), 
% 0.71/1.08    apart_point_and_line( X, Z ) }.
% 0.71/1.08  { ! convergent_lines( X, Y ), distinct_lines( Y, Z ), convergent_lines( X, 
% 0.71/1.08    Z ) }.
% 0.71/1.08  { convergent_lines( X, Y ), unorthogonal_lines( X, Y ) }.
% 0.71/1.08  { alpha1( X, Z ), convergent_lines( Z, Y ), ! convergent_lines( X, Y ), ! 
% 0.71/1.08    unorthogonal_lines( X, Y ) }.
% 0.71/1.08  { alpha1( X, Z ), unorthogonal_lines( Z, Y ), ! convergent_lines( X, Y ), !
% 0.71/1.08     unorthogonal_lines( X, Y ) }.
% 0.71/1.08  { ! alpha1( X, Y ), convergent_lines( Y, X ) }.
% 0.71/1.08  { ! alpha1( X, Y ), unorthogonal_lines( Y, X ) }.
% 0.71/1.08  { ! convergent_lines( Y, X ), ! unorthogonal_lines( Y, X ), alpha1( X, Y )
% 0.71/1.08     }.
% 0.71/1.08  { unorthogonal_lines( Z, X ), unorthogonal_lines( Z, Y ), ! 
% 0.71/1.08    convergent_lines( X, Y ) }.
% 0.71/1.08  { ! unorthogonal_lines( skol3, skol1 ) }.
% 0.71/1.08  { ! unorthogonal_lines( skol3, skol2 ) }.
% 0.71/1.08  { convergent_lines( skol1, skol2 ) }.
% 0.71/1.08  
% 0.71/1.08  percentage equality = 0.000000, percentage horn = 0.541667
% 0.71/1.08  This a non-horn, non-equality problem
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  Options Used:
% 0.71/1.08  
% 0.71/1.08  useres =            1
% 0.71/1.08  useparamod =        0
% 0.71/1.08  useeqrefl =         0
% 0.71/1.08  useeqfact =         0
% 0.71/1.08  usefactor =         1
% 0.71/1.08  usesimpsplitting =  0
% 0.71/1.08  usesimpdemod =      0
% 0.71/1.08  usesimpres =        3
% 0.71/1.08  
% 0.71/1.08  resimpinuse      =  1000
% 0.71/1.08  resimpclauses =     20000
% 0.71/1.08  substype =          standard
% 0.71/1.08  backwardsubs =      1
% 0.71/1.08  selectoldest =      5
% 0.71/1.08  
% 0.71/1.08  litorderings [0] =  split
% 0.71/1.08  litorderings [1] =  liftord
% 0.71/1.08  
% 0.71/1.08  termordering =      none
% 0.71/1.08  
% 0.71/1.08  litapriori =        1
% 0.71/1.08  termapriori =       0
% 0.71/1.08  litaposteriori =    0
% 0.71/1.08  termaposteriori =   0
% 0.71/1.08  demodaposteriori =  0
% 0.71/1.08  ordereqreflfact =   0
% 0.71/1.08  
% 0.71/1.08  litselect =         none
% 0.71/1.08  
% 0.71/1.08  maxweight =         15
% 0.71/1.08  maxdepth =          30000
% 0.71/1.08  maxlength =         115
% 0.71/1.08  maxnrvars =         195
% 0.71/1.08  excuselevel =       1
% 0.71/1.08  increasemaxweight = 1
% 0.71/1.08  
% 0.71/1.08  maxselected =       10000000
% 0.71/1.08  maxnrclauses =      10000000
% 0.71/1.08  
% 0.71/1.08  showgenerated =    0
% 0.71/1.08  showkept =         0
% 0.71/1.08  showselected =     0
% 0.71/1.08  showdeleted =      0
% 0.71/1.08  showresimp =       1
% 0.71/1.08  showstatus =       2000
% 0.71/1.08  
% 0.71/1.08  prologoutput =     0
% 0.71/1.08  nrgoals =          5000000
% 0.71/1.08  totalproof =       1
% 0.71/1.08  
% 0.71/1.08  Symbols occurring in the translation:
% 0.71/1.08  
% 0.71/1.08  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.71/1.08  .  [1, 2]      (w:1, o:22, a:1, s:1, b:0), 
% 0.71/1.08  !  [4, 1]      (w:0, o:17, a:1, s:1, b:0), 
% 0.71/1.08  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.08  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.71/1.08  distinct_points  [36, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.71/1.08  distinct_lines  [37, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.71/1.08  convergent_lines  [38, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.71/1.08  line_connecting  [41, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.71/1.08  apart_point_and_line  [42, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 0.71/1.08  intersection_point  [43, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 0.71/1.08  unorthogonal_lines  [48, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 0.71/1.08  alpha1  [50, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 0.71/1.08  skol1  [51, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.71/1.08  skol2  [52, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.71/1.08  skol3  [53, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  Starting Search:
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  Bliksems!, er is een bewijs:
% 0.71/1.08  % SZS status Theorem
% 0.71/1.08  % SZS output start Refutation
% 0.71/1.08  
% 0.71/1.08  (20) {G0,W9,D2,L3,V3,M2} I { ! convergent_lines( X, Y ), unorthogonal_lines
% 0.71/1.08    ( Z, X ), unorthogonal_lines( Z, Y ) }.
% 0.71/1.08  (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1 ) }.
% 0.71/1.08  (22) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol2 ) }.
% 0.71/1.08  (23) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 ) }.
% 0.71/1.08  (128) {G1,W6,D2,L2,V1,M1} R(20,21) { ! convergent_lines( skol1, X ), 
% 0.71/1.08    unorthogonal_lines( skol3, X ) }.
% 0.71/1.08  (132) {G2,W0,D0,L0,V0,M0} R(128,22);r(23) {  }.
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  % SZS output end Refutation
% 0.71/1.08  found a proof!
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  Unprocessed initial clauses:
% 0.71/1.08  
% 0.71/1.08  (134) {G0,W3,D2,L1,V1,M1}  { ! distinct_points( X, X ) }.
% 0.71/1.08  (135) {G0,W3,D2,L1,V1,M1}  { ! distinct_lines( X, X ) }.
% 0.71/1.08  (136) {G0,W3,D2,L1,V1,M1}  { ! convergent_lines( X, X ) }.
% 0.71/1.08  (137) {G0,W9,D2,L3,V3,M3}  { ! distinct_points( X, Y ), distinct_points( X
% 0.71/1.08    , Z ), distinct_points( Y, Z ) }.
% 0.71/1.08  (138) {G0,W9,D2,L3,V3,M3}  { ! distinct_lines( X, Y ), distinct_lines( X, Z
% 0.71/1.08     ), distinct_lines( Y, Z ) }.
% 0.71/1.08  (139) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), convergent_lines( 
% 0.71/1.08    X, Z ), convergent_lines( Y, Z ) }.
% 0.71/1.08  (140) {G0,W8,D3,L2,V2,M2}  { ! distinct_points( X, Y ), ! 
% 0.71/1.08    apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.71/1.08  (141) {G0,W8,D3,L2,V2,M2}  { ! distinct_points( X, Y ), ! 
% 0.71/1.08    apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.71/1.08  (142) {G0,W8,D3,L2,V2,M2}  { ! convergent_lines( X, Y ), ! 
% 0.71/1.08    apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.71/1.08  (143) {G0,W8,D3,L2,V2,M2}  { ! convergent_lines( X, Y ), ! 
% 0.71/1.08    apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.71/1.08  (144) {G0,W18,D2,L6,V4,M6}  { ! distinct_points( X, Y ), ! distinct_lines( 
% 0.71/1.08    Z, T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ), 
% 0.71/1.08    apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.71/1.08  (145) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), 
% 0.71/1.08    distinct_points( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.71/1.08  (146) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), distinct_lines
% 0.71/1.08    ( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.71/1.08  (147) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), distinct_lines( Y
% 0.71/1.08    , Z ), convergent_lines( X, Z ) }.
% 0.71/1.08  (148) {G0,W6,D2,L2,V2,M2}  { convergent_lines( X, Y ), unorthogonal_lines( 
% 0.71/1.08    X, Y ) }.
% 0.71/1.08  (149) {G0,W12,D2,L4,V3,M4}  { alpha1( X, Z ), convergent_lines( Z, Y ), ! 
% 0.71/1.08    convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 0.71/1.08  (150) {G0,W12,D2,L4,V3,M4}  { alpha1( X, Z ), unorthogonal_lines( Z, Y ), !
% 0.71/1.08     convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 0.71/1.08  (151) {G0,W6,D2,L2,V2,M2}  { ! alpha1( X, Y ), convergent_lines( Y, X ) }.
% 0.71/1.08  (152) {G0,W6,D2,L2,V2,M2}  { ! alpha1( X, Y ), unorthogonal_lines( Y, X )
% 0.71/1.08     }.
% 0.71/1.08  (153) {G0,W9,D2,L3,V2,M3}  { ! convergent_lines( Y, X ), ! 
% 0.71/1.08    unorthogonal_lines( Y, X ), alpha1( X, Y ) }.
% 0.71/1.08  (154) {G0,W9,D2,L3,V3,M3}  { unorthogonal_lines( Z, X ), unorthogonal_lines
% 0.71/1.08    ( Z, Y ), ! convergent_lines( X, Y ) }.
% 0.71/1.08  (155) {G0,W3,D2,L1,V0,M1}  { ! unorthogonal_lines( skol3, skol1 ) }.
% 0.71/1.08  (156) {G0,W3,D2,L1,V0,M1}  { ! unorthogonal_lines( skol3, skol2 ) }.
% 0.71/1.08  (157) {G0,W3,D2,L1,V0,M1}  { convergent_lines( skol1, skol2 ) }.
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  Total Proof:
% 0.71/1.08  
% 0.71/1.08  subsumption: (20) {G0,W9,D2,L3,V3,M2} I { ! convergent_lines( X, Y ), 
% 0.71/1.08    unorthogonal_lines( Z, X ), unorthogonal_lines( Z, Y ) }.
% 0.71/1.08  parent0: (154) {G0,W9,D2,L3,V3,M3}  { unorthogonal_lines( Z, X ), 
% 0.71/1.08    unorthogonal_lines( Z, Y ), ! convergent_lines( X, Y ) }.
% 0.71/1.08  substitution0:
% 0.71/1.08     X := X
% 0.71/1.08     Y := Y
% 0.71/1.08     Z := Z
% 0.71/1.08  end
% 0.71/1.08  permutation0:
% 0.71/1.08     0 ==> 1
% 0.71/1.08     1 ==> 2
% 0.71/1.08     2 ==> 0
% 0.71/1.08  end
% 0.71/1.08  
% 0.71/1.08  subsumption: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, 
% 0.71/1.08    skol1 ) }.
% 0.71/1.08  parent0: (155) {G0,W3,D2,L1,V0,M1}  { ! unorthogonal_lines( skol3, skol1 )
% 0.71/1.08     }.
% 0.71/1.08  substitution0:
% 0.71/1.08  end
% 0.71/1.08  permutation0:
% 0.71/1.08     0 ==> 0
% 0.71/1.08  end
% 0.71/1.08  
% 0.71/1.08  subsumption: (22) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, 
% 0.71/1.08    skol2 ) }.
% 0.71/1.08  parent0: (156) {G0,W3,D2,L1,V0,M1}  { ! unorthogonal_lines( skol3, skol2 )
% 0.71/1.08     }.
% 0.71/1.08  substitution0:
% 0.71/1.08  end
% 0.71/1.08  permutation0:
% 0.71/1.08     0 ==> 0
% 0.71/1.08  end
% 0.71/1.08  
% 0.71/1.08  subsumption: (23) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.71/1.08     }.
% 0.71/1.08  parent0: (157) {G0,W3,D2,L1,V0,M1}  { convergent_lines( skol1, skol2 ) }.
% 0.71/1.08  substitution0:
% 0.71/1.08  end
% 0.71/1.08  permutation0:
% 0.71/1.08     0 ==> 0
% 0.71/1.08  end
% 0.71/1.08  
% 0.71/1.08  resolution: (198) {G1,W6,D2,L2,V1,M2}  { ! convergent_lines( skol1, X ), 
% 0.71/1.08    unorthogonal_lines( skol3, X ) }.
% 0.71/1.08  parent0[0]: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1
% 0.71/1.08     ) }.
% 0.71/1.08  parent1[1]: (20) {G0,W9,D2,L3,V3,M2} I { ! convergent_lines( X, Y ), 
% 0.71/1.08    unorthogonal_lines( Z, X ), unorthogonal_lines( Z, Y ) }.
% 0.71/1.08  substitution0:
% 0.71/1.08  end
% 0.71/1.08  substitution1:
% 0.71/1.08     X := skol1
% 0.71/1.08     Y := X
% 0.71/1.08     Z := skol3
% 0.71/1.08  end
% 0.71/1.08  
% 0.71/1.08  subsumption: (128) {G1,W6,D2,L2,V1,M1} R(20,21) { ! convergent_lines( skol1
% 0.71/1.08    , X ), unorthogonal_lines( skol3, X ) }.
% 0.71/1.08  parent0: (198) {G1,W6,D2,L2,V1,M2}  { ! convergent_lines( skol1, X ), 
% 0.71/1.08    unorthogonal_lines( skol3, X ) }.
% 0.71/1.08  substitution0:
% 0.71/1.08     X := X
% 0.71/1.08  end
% 0.71/1.08  permutation0:
% 0.71/1.08     0 ==> 0
% 0.71/1.08     1 ==> 1
% 0.71/1.08  end
% 0.71/1.08  
% 0.71/1.08  resolution: (200) {G1,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol2 )
% 0.71/1.08     }.
% 0.71/1.08  parent0[0]: (22) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol2
% 0.71/1.08     ) }.
% 0.71/1.08  parent1[1]: (128) {G1,W6,D2,L2,V1,M1} R(20,21) { ! convergent_lines( skol1
% 0.71/1.08    , X ), unorthogonal_lines( skol3, X ) }.
% 0.71/1.08  substitution0:
% 0.71/1.08  end
% 0.71/1.08  substitution1:
% 0.71/1.08     X := skol2
% 0.71/1.08  end
% 0.71/1.08  
% 0.71/1.08  resolution: (201) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.71/1.08  parent0[0]: (200) {G1,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol2 )
% 0.71/1.08     }.
% 0.71/1.08  parent1[0]: (23) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.71/1.08     }.
% 0.71/1.08  substitution0:
% 0.71/1.08  end
% 0.71/1.08  substitution1:
% 0.71/1.08  end
% 0.71/1.08  
% 0.71/1.08  subsumption: (132) {G2,W0,D0,L0,V0,M0} R(128,22);r(23) {  }.
% 0.71/1.08  parent0: (201) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.71/1.08  substitution0:
% 0.71/1.08  end
% 0.71/1.08  permutation0:
% 0.71/1.08  end
% 0.71/1.08  
% 0.71/1.08  Proof check complete!
% 0.71/1.08  
% 0.71/1.08  Memory use:
% 0.71/1.08  
% 0.71/1.08  space for terms:        2147
% 0.71/1.08  space for clauses:      5432
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  clauses generated:      619
% 0.71/1.08  clauses kept:           133
% 0.71/1.08  clauses selected:       49
% 0.71/1.08  clauses deleted:        0
% 0.71/1.08  clauses inuse deleted:  0
% 0.71/1.08  
% 0.71/1.08  subsentry:          2105
% 0.71/1.08  literals s-matched: 1705
% 0.71/1.08  literals matched:   1685
% 0.71/1.08  full subsumption:   1264
% 0.71/1.08  
% 0.71/1.08  checksum:           1314216
% 0.71/1.08  
% 0.71/1.08  
% 0.71/1.08  Bliksem ended
%------------------------------------------------------------------------------