TSTP Solution File: GRP140-1 by Geo-III---2018C

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : GRP140-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : geo -tptp_input -nonempty -inputfile %s

% Computer : n011.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 06:03:22 EDT 2022

% Result   : Unsatisfiable 8.76s 9.01s
% Output   : Refutation 8.76s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GRP140-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.12  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n011.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  % WCLimit  : 300
% 0.12/0.33  % DateTime : Fri Jul 22 13:39:36 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 8.76/9.01  GeoParameters:
% 8.76/9.01  
% 8.76/9.01  tptp_input =     1
% 8.76/9.01  tptp_output =    0
% 8.76/9.01  nonempty =       1
% 8.76/9.01  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.76/9.01  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 8.76/9.01  
% 8.76/9.01  
% 8.76/9.01  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.76/9.01  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.76/9.01  
% 8.76/9.01  RuleSystem INPUT:
% 8.76/9.01  
% 8.76/9.01  Initial Rules:
% 8.76/9.01  #0: input, references = 4, size of lhs = 3:
% 8.76/9.01     P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #1: input, references = 4, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #2: input, references = 7, size of lhs = 6:
% 8.76/9.01     P_identity-{F}(V0), P_multiply-{F}(V1,V2,V4), P_multiply-{F}(V4,V3,V5), P_multiply-{F}(V2,V3,V6), P_multiply-{F}(V1,V6,V7), V5 == V7 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #3: input, references = 4, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #4: input, references = 4, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #5: input, references = 4, size of lhs = 6:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V2,V3,V4), P_greatest_lower_bound-{F}(V1,V4,V5), P_greatest_lower_bound-{F}(V1,V2,V6), P_greatest_lower_bound-{F}(V6,V3,V7), V5 == V7 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #6: input, references = 3, size of lhs = 6:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V2,V3,V4), P_least_upper_bound-{F}(V1,V4,V5), P_least_upper_bound-{F}(V1,V2,V6), P_least_upper_bound-{F}(V6,V3,V7), V5 == V7 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #7: input, references = 4, size of lhs = 3:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #8: input, references = 4, size of lhs = 3:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #9: input, references = 4, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #10: input, references = 4, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #11: input, references = 4, size of lhs = 7:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V2,V3,V4), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V1,V2,V6), P_multiply-{F}(V1,V3,V7), P_least_upper_bound-{F}(V6,V7,V8), V5 == V8 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #12: input, references = 4, size of lhs = 7:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V2,V3,V4), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V1,V2,V6), P_multiply-{F}(V1,V3,V7), P_greatest_lower_bound-{F}(V6,V7,V8), V5 == V8 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #13: input, references = 4, size of lhs = 7:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V2,V3,V4), P_multiply-{F}(V4,V1,V5), P_multiply-{F}(V2,V1,V6), P_multiply-{F}(V3,V1,V7), P_least_upper_bound-{F}(V6,V7,V8), V5 == V8 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #14: input, references = 5, size of lhs = 7:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V2,V3,V4), P_multiply-{F}(V4,V1,V5), P_multiply-{F}(V2,V1,V6), P_multiply-{F}(V3,V1,V7), P_greatest_lower_bound-{F}(V6,V7,V8), V5 == V8 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #15: input, references = 5, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), V3 == V2 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #16: input, references = 5, size of lhs = 7:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V4,V2,V5), V5 == V2 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #17: input, references = 6, size of lhs = 8:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V4,V2,V5), P_greatest_lower_bound-{F}(V1,V4,V6), P_least_upper_bound-{F}(V6,V2,V6) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #18: input, references = 10, size of lhs = 2:
% 8.76/9.01     #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #19: input, references = 4, size of lhs = 0:
% 8.76/9.01     FALSE | EXISTS V0: P_identity-{T}(V0)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #20: input, references = 9, size of lhs = 1:
% 8.76/9.01     #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #21: input, references = 13, size of lhs = 2:
% 8.76/9.01     #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #22: input, references = 6, size of lhs = 2:
% 8.76/9.01     #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #23: input, references = 4, size of lhs = 0:
% 8.76/9.01     FALSE | EXISTS V0: P_a-{T}(V0)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #24: input, references = 4, size of lhs = 0:
% 8.76/9.01     FALSE | EXISTS V0: P_c-{T}(V0)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #25: input, references = 5, size of lhs = 0:
% 8.76/9.01     FALSE | EXISTS V0: P_b-{T}(V0)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  number of initial rules = 26
% 8.76/9.01  
% 8.76/9.01  Simplifiers:
% 8.76/9.01  #26: unsound, references = 3, size of lhs = 3:
% 8.76/9.01     P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #27: unsound, references = 3, size of lhs = 3:
% 8.76/9.01     P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #28: unsound, references = 3, size of lhs = 3:
% 8.76/9.01     P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #29: unsound, references = 3, size of lhs = 3:
% 8.76/9.01     P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #30: unsound, references = 3, size of lhs = 3:
% 8.76/9.01     P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #31: unsound, references = 3, size of lhs = 3:
% 8.76/9.01     P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #32: unsound, references = 3, size of lhs = 3:
% 8.76/9.01     P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #33: unsound, references = 3, size of lhs = 3:
% 8.76/9.01     P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  number of simplifiers = 8
% 8.76/9.01  
% 8.76/9.01  Learnt:
% 8.76/9.01  #35: exists( #18, #1 ), references = 7, size of lhs = 2:
% 8.76/9.01     P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #37: exists( #18, #0 ), references = 2, size of lhs = 2:
% 8.76/9.01     P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #39: exists( #21, #8 ), references = 1, size of lhs = 2:
% 8.76/9.01     P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #42: exists( #22, #7 ), references = 1, size of lhs = 2:
% 8.76/9.01     P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #43: exists( #22, #9 ), references = 2, size of lhs = 2:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #46: exists( #18, #2 ), references = 5, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V3,V4,V5), P_multiply-{F}(V2,V4,V6) | P_multiply-{T}(V1,V6,V5)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #51: mergings( V2 == V3; #49 ), references = 3, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #55: exists( #21, #3 ), references = 7, size of lhs = 2:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #57: exists( #18, #12 ), references = 1, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_multiply-{F}(V4,V1,V5), P_multiply-{F}(V4,V2,V6), P_greatest_lower_bound-{F}(V5,V6,V7) | P_multiply-{T}(V4,V3,V7)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #60: exists( #22, #11 ), references = 1, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_multiply-{F}(V4,V3,V5), P_multiply-{F}(V4,V1,V6), P_multiply-{F}(V4,V2,V7) | P_least_upper_bound-{T}(V6,V7,V5)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #61: exists( #22, #13 ), references = 3, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_multiply-{F}(V3,V4,V5), P_multiply-{F}(V1,V4,V6), P_multiply-{F}(V2,V4,V7) | P_least_upper_bound-{T}(V6,V7,V5)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #64: exists( #22, #4 ), references = 3, size of lhs = 2:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #72: exists( #18, #14 ), references = 1, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V2,V4,V6), P_greatest_lower_bound-{F}(V5,V6,V7) | P_multiply-{T}(V3,V4,V7)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #78: mergings( V3 == V4, V4 == V5; #75 ), references = 1, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V4,V1,V3) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #89: mergings( V2 == V0; #86 ), references = 1, size of lhs = 1:
% 8.76/9.01     P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #109: exists( #21, #10 ), references = 3, size of lhs = 2:
% 8.76/9.01     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #128: mergings( V3 == V4; #126 ), references = 3, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_b-{F}(V4) | P_greatest_lower_bound-{T}(V2,V4,V2)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #137: mergings( V1 == V2, V2 == V4, V4 == V5, V3 == V6, V7 == V8; #131 ), references = 1, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V1), P_least_upper_bound-{F}(V1,V1,V1), P_greatest_lower_bound-{F}(V1,V1,V2) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #146: exists( #18, #2 ), references = 3, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V2,V4,V5), P_multiply-{F}(V1,V5,V6) | P_multiply-{T}(V3,V4,V6)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #182: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11; #172 ), references = 1, size of lhs = 10:
% 8.76/9.01     P_a-{F}(V0), P_identity-{F}(V0), P_c-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V0,V2,V0), P_multiply-{F}(V3,V4,V1), P_least_upper_bound-{F}(V5,V3,V5), P_multiply-{F}(V0,V6,V5), P_multiply-{F}(V7,V6,V8), P_multiply-{F}(V8,V4,V7) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #199: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #192 ), references = 1, size of lhs = 10:
% 8.76/9.01     P_a-{F}(V0), P_identity-{F}(V0), P_c-{F}(V1), V0 == V1, P_multiply-{F}(V0,V2,V3), P_least_upper_bound-{F}(V4,V3,V5), P_multiply-{F}(V5,V6,V1), P_multiply-{F}(V4,V6,V7), P_multiply-{F}(V8,V2,V9), P_multiply-{F}(V9,V6,V8) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #209: exists( #21, #16 ), references = 2, size of lhs = 6:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V3,V2,V4), V4 == V2 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #214: exists( #21, #209 ), references = 2, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V2), P_b-{F}(V3) | P_greatest_lower_bound-{T}(V3,V2,V2)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #232: exists( #21, #15 ), references = 1, size of lhs = 3:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V2) | P_greatest_lower_bound-{T}(V1,V2,V2)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #235: exists( #21, #5 ), references = 2, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V4,V1,V5), P_greatest_lower_bound-{F}(V5,V2,V6) | P_greatest_lower_bound-{T}(V4,V3,V6)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #236: exists( #21, #14 ), references = 1, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_multiply-{F}(V3,V4,V5), P_multiply-{F}(V1,V4,V6), P_multiply-{F}(V2,V4,V7) | P_greatest_lower_bound-{T}(V6,V7,V5)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #252: mergings( V2 == V3, V3 == V4; #249 ), references = 2, size of lhs = 6:
% 8.76/9.01     P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V4,V5,V4), P_multiply-{F}(V2,V5,V6), V6 == V2 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #256: mergings( V3 == V4, V4 == V5; #253 ), references = 1, size of lhs = 4:
% 8.76/9.01     P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V4,V5,V4) | P_multiply-{T}(V2,V5,V2)
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #266: mergings( V2 == V3; #264 ), references = 1, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_multiply-{F}(V0,V2,V3), P_multiply-{F}(V3,V1,V4), V4 == V3 | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #307: mergings( V3 == V4, V4 == V5, V5 == V6, V9 == V7; #302 ), references = 1, size of lhs = 8:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V4,V2,V2), P_greatest_lower_bound-{F}(V5,V4,V2), P_greatest_lower_bound-{F}(V6,V1,V5) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #319: mergings( V1 == V3, V3 == V5, V5 == V6, V6 == V7, V7 == V8, V2 == V4, V4 == V9, V11 == V12; #310 ), references = 1, size of lhs = 5:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V4,V1,V2) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #331: mergings( V1 == V2, V2 == V3, V3 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V4 == V10; #322 ), references = 1, size of lhs = 2:
% 8.76/9.01     P_identity-{F}(V0), P_a-{F}(V1) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #340: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #332 ), references = 1, size of lhs = 1:
% 8.76/9.01     P_identity-{F}(V0) | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  #342: exists( #19, #332 ), references = 1, size of lhs = 0:
% 8.76/9.01     FALSE | FALSE
% 8.76/9.01        (used 0 times, uses = {})
% 8.76/9.01  
% 8.76/9.01  number of learnt formulas = 34
% 8.76/9.01  
% 8.76/9.01  
% 8.76/9.01  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.76/9.01  
% 8.76/9.01  randbase = 1
%------------------------------------------------------------------------------