TSTP Solution File: BOO017-2 by Geo-III---2018C

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : BOO017-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : geo -tptp_input -nonempty -inputfile %s

% Computer : n024.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  : 300s
% DateTime : Sat Jul 23 05:58:39 EDT 2022

% Result   : Unsatisfiable 0.61s 0.76s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : BOO017-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Fri Jul 22 08:42:56 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.61/0.76  GeoParameters:
% 0.61/0.76  
% 0.61/0.76  tptp_input =     1
% 0.61/0.76  tptp_output =    0
% 0.61/0.76  nonempty =       1
% 0.61/0.76  inputfile =      /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.76  includepath =    /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.61/0.76  
% 0.61/0.76  
% 0.61/0.76  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.76  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.76  
% 0.61/0.76  RuleSystem INPUT:
% 0.61/0.76  
% 0.61/0.76  Initial Rules:
% 0.61/0.76  #0: input, references = 3, size of lhs = 3:
% 0.61/0.76     P_add-{F}(V0,V1,V2), P_add-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #1: input, references = 4, size of lhs = 3:
% 0.61/0.76     P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #2: input, references = 3, size of lhs = 6:
% 0.61/0.76     P_multiply-{F}(V0,V1,V3), P_add-{F}(V3,V2,V4), P_add-{F}(V0,V2,V5), P_add-{F}(V1,V2,V6), P_multiply-{F}(V5,V6,V7), V4 == V7 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #3: input, references = 6, size of lhs = 6:
% 0.61/0.76     P_multiply-{F}(V1,V2,V3), P_add-{F}(V0,V3,V4), P_add-{F}(V0,V1,V5), P_add-{F}(V0,V2,V6), P_multiply-{F}(V5,V6,V7), V4 == V7 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #4: input, references = 4, size of lhs = 6:
% 0.61/0.76     P_add-{F}(V0,V1,V3), P_multiply-{F}(V3,V2,V4), P_multiply-{F}(V0,V2,V5), P_multiply-{F}(V1,V2,V6), P_add-{F}(V5,V6,V7), V4 == V7 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #5: input, references = 5, size of lhs = 6:
% 0.61/0.76     P_add-{F}(V1,V2,V3), P_multiply-{F}(V0,V3,V4), P_multiply-{F}(V0,V1,V5), P_multiply-{F}(V0,V2,V6), P_add-{F}(V5,V6,V7), V4 == V7 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #6: input, references = 4, size of lhs = 4:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_inverse-{F}(V1,V2), P_add-{F}(V1,V2,V3), V3 == V0 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #7: input, references = 4, size of lhs = 4:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_inverse-{F}(V1,V2), P_add-{F}(V2,V1,V3), V3 == V0 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #8: input, references = 4, size of lhs = 5:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_inverse-{F}(V2,V3), P_multiply-{F}(V2,V3,V4), V4 == V1 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #9: input, references = 4, size of lhs = 5:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_inverse-{F}(V2,V3), P_multiply-{F}(V3,V2,V4), V4 == V1 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #10: input, references = 4, size of lhs = 4:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V2,V0,V3), V3 == V2 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #11: input, references = 4, size of lhs = 4:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V0,V2,V3), V3 == V2 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #12: input, references = 5, size of lhs = 4:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_add-{F}(V2,V1,V3), V3 == V2 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #13: input, references = 3, size of lhs = 4:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_add-{F}(V1,V2,V3), V3 == V2 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #14: input, references = 5, size of lhs = 7:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3), P_add-{F}(V2,V3,V4), P_z-{F}(V5), V4 == V5 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #15: input, references = 5, size of lhs = 7:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3), P_add-{F}(V2,V3,V4), P_z-{F}(V5), P_multiply-{F}(V2,V5,V2) | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #16: input, references = 10, size of lhs = 2:
% 0.61/0.76     #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #17: input, references = 7, size of lhs = 2:
% 0.61/0.76     #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #18: input, references = 7, size of lhs = 1:
% 0.61/0.76     #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #19: input, references = 4, size of lhs = 0:
% 0.61/0.76     FALSE | EXISTS V0: P_multiplicative_identity-{T}(V0)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #20: input, references = 4, size of lhs = 0:
% 0.61/0.76     FALSE | EXISTS V0: P_additive_identity-{T}(V0)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #21: input, references = 4, size of lhs = 0:
% 0.61/0.76     FALSE | EXISTS V0: P_x-{T}(V0)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #22: input, references = 4, size of lhs = 0:
% 0.61/0.76     FALSE | EXISTS V0: P_y-{T}(V0)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #23: input, references = 6, size of lhs = 0:
% 0.61/0.76     FALSE | EXISTS V0: P_z-{T}(V0)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  number of initial rules = 24
% 0.61/0.76  
% 0.61/0.76  Simplifiers:
% 0.61/0.76  #24: unsound, references = 3, size of lhs = 3:
% 0.61/0.76     P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #25: unsound, references = 3, size of lhs = 3:
% 0.61/0.76     P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #26: unsound, references = 3, size of lhs = 3:
% 0.61/0.76     P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #27: unsound, references = 3, size of lhs = 3:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_multiplicative_identity-{F}(V1), V0 == V1 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #28: unsound, references = 3, size of lhs = 3:
% 0.61/0.76     P_additive_identity-{F}(V0), P_additive_identity-{F}(V1), V0 == V1 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #29: unsound, references = 3, size of lhs = 3:
% 0.61/0.76     P_x-{F}(V0), P_x-{F}(V1), V0 == V1 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #30: unsound, references = 3, size of lhs = 3:
% 0.61/0.76     P_y-{F}(V0), P_y-{F}(V1), V0 == V1 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #31: unsound, references = 3, size of lhs = 3:
% 0.61/0.76     P_z-{F}(V0), P_z-{F}(V1), V0 == V1 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  number of simplifiers = 8
% 0.61/0.76  
% 0.61/0.76  Learnt:
% 0.61/0.76  #34: exists( #16, #6 ), references = 5, size of lhs = 2:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_add-{T}(V1,V2,V0)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #35: exists( #16, #7 ), references = 2, size of lhs = 2:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_add-{T}(V2,V1,V0)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #42: mergings( V2 == V3; #39 ), references = 1, size of lhs = 2:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1) | P_inverse-{T}(V1,V0)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #49: exists( #17, #10 ), references = 5, size of lhs = 3:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), #-{F} V2 | P_multiply-{T}(V2,V0,V2)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #51: exists( #23, #14 ), references = 1, size of lhs = 5:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3), P_add-{F}(V2,V3,V4) | P_z-{T}(V4)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #57: exists( #16, #5 ), references = 1, size of lhs = 4:
% 0.61/0.76     P_add-{F}(V0,V1,V2), P_multiply-{F}(V3,V2,V4), P_multiply-{F}(V3,V0,V5), P_multiply-{F}(V3,V1,V6) | P_add-{T}(V5,V6,V4)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #60: exists( #16, #3 ), references = 1, size of lhs = 4:
% 0.61/0.76     P_multiply-{F}(V0,V1,V2), P_add-{F}(V3,V0,V4), P_add-{F}(V3,V1,V5), P_multiply-{F}(V4,V5,V6) | P_add-{T}(V3,V2,V6)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #63: exists( #16, #12 ), references = 4, size of lhs = 3:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), #-{F} V2 | P_add-{T}(V2,V1,V2)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #66: exists( #17, #3 ), references = 4, size of lhs = 4:
% 0.61/0.76     P_multiply-{F}(V0,V1,V2), P_add-{F}(V3,V2,V4), P_add-{F}(V3,V0,V5), P_add-{F}(V3,V1,V6) | P_multiply-{T}(V5,V6,V4)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #79: mergings( V2 == V3; #76 ), references = 1, size of lhs = 5:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_add-{F}(V2,V0,V3), P_multiply-{F}(V3,V0,V4), V4 == V0 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #82: mergings( V2 == V4, V3 == V5; #77 ), references = 2, size of lhs = 4:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_add-{F}(V2,V0,V3), V0 == V3 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #88: exists( #17, #8 ), references = 3, size of lhs = 3:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_inverse-{F}(V2,V3) | P_multiply-{T}(V2,V3,V1)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #89: exists( #17, #9 ), references = 1, size of lhs = 3:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_inverse-{F}(V2,V3) | P_multiply-{T}(V3,V2,V1)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #100: exists( #16, #15 ), references = 2, size of lhs = 6:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3), P_z-{F}(V4), P_multiply-{F}(V2,V4,V2) | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #102: exists( #16, #14 ), references = 3, size of lhs = 5:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3), P_z-{F}(V4) | P_add-{T}(V2,V3,V4)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #107: exists( #17, #103 ), references = 2, size of lhs = 5:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V2,V3,V1), P_add-{F}(V4,V3,V5), P_multiply-{F}(V2,V5,V6) | P_multiply-{T}(V2,V4,V6)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #108: exists( #17, #104 ), references = 1, size of lhs = 5:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V2,V3,V1), P_add-{F}(V4,V2,V5), P_multiply-{F}(V5,V3,V6) | P_multiply-{T}(V4,V3,V6)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #121: mergings( V2 == V3, V3 == V4, V4 == V6, V5 == V7; #115 ), references = 1, size of lhs = 6:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_x-{F}(V2), P_multiply-{F}(V2,V0,V2), P_z-{F}(V2), P_y-{F}(V3) | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #127: mergings( V2 == V3; #125 ), references = 2, size of lhs = 6:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_add-{F}(V2,V1,V3), P_add-{F}(V2,V2,V4), P_multiply-{F}(V4,V0,V5), V3 == V5 | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #135: mergings( V2 == V5, V1 == V3, V3 == V6; #131 ), references = 1, size of lhs = 5:
% 0.61/0.76     P_x-{F}(V0), P_y-{F}(V0), P_multiplicative_identity-{F}(V1), P_additive_identity-{F}(V2), P_add-{F}(V0,V2,V3) | P_z-{T}(V3)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #142: exists( #16, #82 ), references = 2, size of lhs = 3:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), #-{F} V2 | P_add-{T}(V2,V0,V0)
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #155: mergings( V1 == V3, V2 == V4; #151 ), references = 1, size of lhs = 7:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3), P_add-{F}(V2,V4,V2), P_multiply-{F}(V4,V3,V5), P_add-{F}(V2,V5,V2) | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #172: mergings( V4 == V11, V1 == V3, V3 == V5, V5 == V7, V2 == V11, V11 == V6, V6 == V8; #163 ), references = 2, size of lhs = 6:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_x-{F}(V2), P_add-{F}(V2,V1,V2), P_add-{F}(V2,V3,V2), P_multiply-{F}(V3,V0,V1) | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #184: mergings( V1 == V2; #182 ), references = 1, size of lhs = 3:
% 0.61/0.76     P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V1,V0,V1) | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #188: mergings( V1 == V2; #186 ), references = 1, size of lhs = 1:
% 0.61/0.76     P_multiplicative_identity-{F}(V0) | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  #190: exists( #19, #186 ), references = 1, size of lhs = 0:
% 0.61/0.76     FALSE | FALSE
% 0.61/0.76        (used 0 times, uses = {})
% 0.61/0.76  
% 0.61/0.76  number of learnt formulas = 26
% 0.61/0.76  
% 0.61/0.76  
% 0.61/0.76  % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.76  
% 0.61/0.76  randbase = 1
%------------------------------------------------------------------------------