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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : GRP178-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : geo -tptp_input -nonempty -inputfile %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  : 300s
% DateTime : Sat Jul 23 06:03:28 EDT 2022

% Result   : Unsatisfiable 8.26s 8.50s
% Output   : Refutation 8.35s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem  : GRP178-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.11  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.11/0.32  % Computer : n005.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Fri Jul 22 13:39:06 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 8.26/8.50  GeoParameters:
% 8.26/8.50  
% 8.26/8.50  tptp_input =     1
% 8.26/8.50  tptp_output =    0
% 8.26/8.50  nonempty =       1
% 8.26/8.50  inputfile =      /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.26/8.50  includepath =    /export/starexec/sandbox2/solver/bin/../../benchmark/
% 8.26/8.50  
% 8.26/8.50  
% 8.26/8.50  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.26/8.50  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.26/8.50  
% 8.26/8.50  RuleSystem INPUT:
% 8.26/8.50  
% 8.26/8.50  Initial Rules:
% 8.26/8.50  #0: input, references = 4, size of lhs = 3:
% 8.26/8.50     P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #1: input, references = 5, size of lhs = 4:
% 8.26/8.50     P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #2: input, references = 7, size of lhs = 6:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #3: input, references = 4, size of lhs = 4:
% 8.26/8.50     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #4: input, references = 4, size of lhs = 4:
% 8.26/8.50     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #5: input, references = 4, size of lhs = 6:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #6: input, references = 3, size of lhs = 6:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #7: input, references = 4, size of lhs = 3:
% 8.26/8.50     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #8: input, references = 4, size of lhs = 3:
% 8.26/8.50     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #9: input, references = 4, size of lhs = 4:
% 8.26/8.50     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #10: input, references = 4, size of lhs = 4:
% 8.26/8.50     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #11: input, references = 4, size of lhs = 7:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #12: input, references = 5, size of lhs = 7:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #13: input, references = 4, size of lhs = 7:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #14: input, references = 5, size of lhs = 7:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #15: input, references = 4, size of lhs = 4:
% 8.26/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), V2 == V0 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #16: input, references = 6, size of lhs = 6:
% 8.26/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), V4 == V0 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #17: input, references = 6, size of lhs = 8:
% 8.26/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V6), V6 == V0 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #18: input, references = 5, size of lhs = 9:
% 8.26/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), V7 == V0 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #19: input, references = 8, size of lhs = 11:
% 8.26/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_multiply-{F}(V3,V5,V8), P_greatest_lower_bound-{F}(V1,V8,V10), P_greatest_lower_bound-{F}(V1,V5,V10) | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #20: input, references = 14, size of lhs = 2:
% 8.26/8.50     #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #21: input, references = 4, size of lhs = 0:
% 8.26/8.50     FALSE | EXISTS V0: P_identity-{T}(V0)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #22: input, references = 13, size of lhs = 1:
% 8.26/8.50     #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #23: input, references = 15, size of lhs = 2:
% 8.26/8.50     #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #24: input, references = 6, size of lhs = 2:
% 8.26/8.50     #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #25: input, references = 4, size of lhs = 0:
% 8.26/8.50     FALSE | EXISTS V0: P_a-{T}(V0)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #26: input, references = 5, size of lhs = 0:
% 8.26/8.50     FALSE | EXISTS V0: P_b-{T}(V0)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #27: input, references = 8, size of lhs = 0:
% 8.26/8.50     FALSE | EXISTS V0: P_c-{T}(V0)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  number of initial rules = 28
% 8.26/8.50  
% 8.26/8.50  Simplifiers:
% 8.26/8.50  #28: unsound, references = 3, size of lhs = 3:
% 8.26/8.50     P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #29: unsound, references = 3, size of lhs = 3:
% 8.26/8.50     P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #30: unsound, references = 3, size of lhs = 3:
% 8.26/8.50     P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #31: unsound, references = 3, size of lhs = 3:
% 8.26/8.50     P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #32: unsound, references = 3, size of lhs = 3:
% 8.26/8.50     P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #33: unsound, references = 3, size of lhs = 3:
% 8.26/8.50     P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #34: unsound, references = 3, size of lhs = 3:
% 8.26/8.50     P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #35: unsound, references = 3, size of lhs = 3:
% 8.26/8.50     P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  number of simplifiers = 8
% 8.26/8.50  
% 8.26/8.50  Learnt:
% 8.26/8.50  #37: exists( #20, #1 ), references = 14, size of lhs = 2:
% 8.26/8.50     P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #39: exists( #20, #0 ), references = 11, size of lhs = 2:
% 8.26/8.50     P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #41: exists( #23, #8 ), references = 1, size of lhs = 2:
% 8.26/8.50     P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #44: exists( #24, #7 ), references = 1, size of lhs = 2:
% 8.26/8.50     P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #45: exists( #24, #9 ), references = 2, size of lhs = 2:
% 8.26/8.50     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #48: exists( #20, #2 ), references = 9, size of lhs = 4:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #53: mergings( V2 == V3; #51 ), references = 3, size of lhs = 4:
% 8.26/8.50     P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #57: exists( #23, #3 ), references = 7, size of lhs = 2:
% 8.26/8.50     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #59: exists( #20, #12 ), references = 1, size of lhs = 5:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #62: exists( #24, #11 ), references = 4, size of lhs = 5:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #63: exists( #24, #13 ), references = 5, size of lhs = 5:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #66: exists( #24, #4 ), references = 7, size of lhs = 2:
% 8.26/8.50     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #74: exists( #20, #14 ), references = 1, size of lhs = 5:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #80: mergings( V3 == V4, V4 == V5; #77 ), references = 1, size of lhs = 5:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #91: mergings( V2 == V0; #88 ), references = 1, size of lhs = 1:
% 8.26/8.50     P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #111: exists( #23, #10 ), references = 7, size of lhs = 2:
% 8.26/8.50     P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #130: mergings( V5 == V6; #128 ), references = 1, size of lhs = 7:
% 8.26/8.50     P_identity-{F}(V0), P_a-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1), P_b-{F}(V2), P_c-{F}(V3), P_multiply-{F}(V2,V3,V3), P_greatest_lower_bound-{F}(V0,V2,V4) | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #131: exists( #23, #17 ), references = 5, size of lhs = 6:
% 8.26/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5) | P_greatest_lower_bound-{T}(V0,V5,V0)
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #137: mergings( V1 == V2, V3 == V4, V4 == V5; #133 ), references = 1, size of lhs = 4:
% 8.26/8.50     P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1) | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #146: exists( #20, #2 ), references = 6, size of lhs = 4:
% 8.26/8.50     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.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #201: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #192 ), references = 2, size of lhs = 10:
% 8.26/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), V3 == V0, P_multiply-{F}(V4,V5,V3), P_least_upper_bound-{F}(V6,V4,V6), P_multiply-{F}(V0,V7,V6), P_multiply-{F}(V8,V7,V9), P_multiply-{F}(V9,V5,V8) | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #208: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #193 ), references = 1, size of lhs = 12:
% 8.26/8.50     P_identity-{F}(V0), P_a-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1), P_b-{F}(V2), V2 == V0, P_c-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_multiply-{F}(V5,V6,V2), P_least_upper_bound-{F}(V7,V5,V7), P_multiply-{F}(V0,V8,V7), P_multiply-{F}(V9,V8,V10), P_multiply-{F}(V10,V6,V9) | FALSE
% 8.26/8.50        (used 0 times, uses = {})
% 8.26/8.50  
% 8.26/8.50  #216: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V12 == V14; #194 ), references = 1, size of lhs = 13:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1), P_b-{F}(V2), P_c-{F}(V3), P_multiply-{F}(V2,V3,V4), P_greatest_lower_bound-{F}(V0,V4,V5), P_greatest_lower_bound-{F}(V0,V3,V5), P_multiply-{F}(V6,V7,V2), P_least_upper_bound-{F}(V8,V6,V8), P_multiply-{F}(V0,V9,V8), P_multiply-{F}(V10,V9,V11), P_multiply-{F}(V11,V7,V10) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #235: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7; #229 ), references = 1, size of lhs = 13:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V0,V4,V5), V5 == V0, P_multiply-{F}(V0,V6,V7), P_least_upper_bound-{F}(V8,V7,V9), P_multiply-{F}(V9,V10,V3), P_multiply-{F}(V8,V10,V11), P_multiply-{F}(V12,V6,V13), P_multiply-{F}(V13,V10,V12) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #247: exists( #23, #16 ), references = 2, size of lhs = 4:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3) | P_greatest_lower_bound-{T}(V0,V3,V0)
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #248: exists( #23, #17 ), references = 1, size of lhs = 7:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V0,V4,V5), V5 == V0 | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #257: mergings( V2 == V3, V3 == V4; #254 ), references = 2, size of lhs = 6:
% 8.35/8.50     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.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #261: mergings( V3 == V4, V4 == V5; #258 ), references = 7, size of lhs = 4:
% 8.35/8.50     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.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #263: exists( #23, #5 ), references = 2, size of lhs = 4:
% 8.35/8.50     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V4,V3,V5), P_greatest_lower_bound-{F}(V4,V1,V6) | P_greatest_lower_bound-{T}(V6,V2,V5)
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #272: mergings( V2 == V3, V3 == V4, V11 == V12, V10 == V4; #267 ), references = 1, size of lhs = 11:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_multiply-{F}(V0,V4,V3), P_greatest_lower_bound-{F}(V0,V3,V5), P_c-{F}(V6), P_multiply-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V1,V3,V7), P_greatest_lower_bound-{F}(V1,V6,V7) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #278: exists( #23, #14 ), references = 2, size of lhs = 5:
% 8.35/8.50     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.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #279: exists( #23, #12 ), references = 3, size of lhs = 5:
% 8.35/8.50     P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_multiply-{F}(V4,V3,V5), P_multiply-{F}(V4,V1,V6), P_multiply-{F}(V4,V2,V7) | P_greatest_lower_bound-{T}(V6,V7,V5)
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #294: mergings( V3 == V4, V4 == V5, V5 == V6, V12 == V6; #289 ), references = 3, size of lhs = 16:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V0), P_greatest_lower_bound-{F}(V1,V3,V6), P_greatest_lower_bound-{F}(V1,V5,V7), P_multiply-{F}(V8,V9,V3), P_multiply-{F}(V9,V5,V10), P_greatest_lower_bound-{F}(V11,V8,V12), P_multiply-{F}(V12,V10,V13), P_multiply-{F}(V11,V10,V14), P_greatest_lower_bound-{F}(V15,V14,V1), P_greatest_lower_bound-{F}(V15,V13,V7) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #304: mergings( V2 == V3, V3 == V4; #301 ), references = 3, size of lhs = 17:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_multiply-{F}(V0,V4,V3), P_greatest_lower_bound-{F}(V0,V3,V5), P_c-{F}(V6), P_greatest_lower_bound-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V1,V3,V7), P_greatest_lower_bound-{F}(V1,V6,V8), P_multiply-{F}(V0,V9,V0), P_multiply-{F}(V9,V6,V10), P_greatest_lower_bound-{F}(V11,V3,V12), P_multiply-{F}(V12,V10,V13), P_multiply-{F}(V11,V10,V14), P_greatest_lower_bound-{F}(V15,V14,V1), P_greatest_lower_bound-{F}(V15,V13,V8) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #316: mergings( V1 == V4, V4 == V10, V10 == V11, V2 == V11, V5 == V7, V3 == V8, V6 == V11; #308 ), references = 1, size of lhs = 7:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V0), P_multiply-{F}(V0,V0,V0), P_greatest_lower_bound-{F}(V0,V0,V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V0,V2,V0), P_multiply-{F}(V0,V3,V2) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #324: mergings( V1 == V2, V4 == V5, V2 == V3, V5 == V6; #319 ), references = 1, size of lhs = 4:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V0), P_multiply-{F}(V0,V0,V0), P_greatest_lower_bound-{F}(V0,V0,V1) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #339: mergings( V2 == V3, V3 == V4, V4 == V5; #334 ), references = 1, size of lhs = 10:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), V4 == V0, P_multiply-{F}(V1,V5,V0), P_multiply-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V5,V6,V7), P_multiply-{F}(V1,V7,V8) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #344: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #335 ), references = 1, size of lhs = 15:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_b-{F}(V3), V3 == V0, P_multiply-{F}(V1,V4,V0), P_multiply-{F}(V0,V5,V1), P_multiply-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V4,V6,V7), P_multiply-{F}(V1,V7,V8), P_least_upper_bound-{F}(V6,V9,V6), P_multiply-{F}(V1,V9,V10), P_multiply-{F}(V10,V11,V3), P_multiply-{F}(V12,V5,V13), P_multiply-{F}(V13,V11,V12) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #355: exists( #23, #15 ), references = 1, size of lhs = 2:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1) | P_greatest_lower_bound-{T}(V0,V1,V0)
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #362: mergings( V1 == V6, V4 == V7, V2 == V8, V5 == V9; #357 ), references = 2, size of lhs = 7:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_greatest_lower_bound-{F}(V1,V3,V5), V5 == V0 | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #407: mergings( V3 == V4, V8 == V4, V9 == V4; #403 ), references = 2, size of lhs = 9:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V1,V3,V0), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_multiply-{F}(V3,V5,V5), P_greatest_lower_bound-{F}(V0,V5,V0) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #417: mergings( V1 == V4, V2 == V7, V5 == V8, V4 == V3, V6 == V9; #411 ), references = 1, size of lhs = 6:
% 8.35/8.50     P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V0,V0), P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V0,V3) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #427: mergings( V2 == V3; #425 ), references = 2, size of lhs = 5:
% 8.35/8.50     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.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #444: mergings( V3 == V4, V4 == V5, V5 == V6; #440 ), references = 1, size of lhs = 6:
% 8.35/8.50     P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_multiply-{F}(V0,V2,V3), P_multiply-{F}(V3,V4,V0), P_multiply-{F}(V4,V5,V6), P_multiply-{F}(V6,V7,V1) | P_multiply-{T}(V5,V7,V3)
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #470: exists( #23, #362 ), references = 1, size of lhs = 5:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4) | P_greatest_lower_bound-{T}(V1,V3,V0)
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #514: mergings( V3 == V4, V4 == V5, V5 == V6, V13 == V6; #508 ), references = 1, size of lhs = 17:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V1,V3,V0), P_multiply-{F}(V0,V4,V3), P_greatest_lower_bound-{F}(V0,V3,V5), P_c-{F}(V6), P_greatest_lower_bound-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V1,V6,V7), P_multiply-{F}(V0,V8,V0), P_multiply-{F}(V8,V6,V9), P_least_upper_bound-{F}(V9,V10,V9), P_multiply-{F}(V11,V10,V1), P_greatest_lower_bound-{F}(V11,V3,V12), P_multiply-{F}(V12,V9,V13), P_greatest_lower_bound-{F}(V1,V13,V7) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #519: mergings( V3 == V4, V4 == V5, V5 == V6, V12 == V6; #509 ), references = 1, size of lhs = 16:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V1,V3,V0), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V0), P_greatest_lower_bound-{F}(V1,V5,V6), P_greatest_lower_bound-{F}(V1,V7,V6), P_multiply-{F}(V8,V9,V1), P_least_upper_bound-{F}(V10,V9,V10), P_multiply-{F}(V11,V5,V10), P_multiply-{F}(V12,V11,V3), P_greatest_lower_bound-{F}(V8,V12,V13), P_multiply-{F}(V13,V10,V7) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #532: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V13 == V7; #524 ), references = 1, size of lhs = 17:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V1,V4,V0), P_greatest_lower_bound-{F}(V0,V4,V5), P_c-{F}(V6), P_greatest_lower_bound-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V1,V6,V7), P_multiply-{F}(V0,V8,V0), P_greatest_lower_bound-{F}(V1,V9,V7), P_least_upper_bound-{F}(V10,V8,V10), P_multiply-{F}(V11,V6,V10), P_multiply-{F}(V12,V11,V4), P_greatest_lower_bound-{F}(V1,V12,V13), P_multiply-{F}(V13,V10,V9) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #540: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V14 == V19, V19 == V7; #525 ), references = 2, size of lhs = 17:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V1,V4,V0), P_multiply-{F}(V0,V5,V4), P_greatest_lower_bound-{F}(V0,V4,V6), P_c-{F}(V7), P_greatest_lower_bound-{F}(V0,V7,V0), P_greatest_lower_bound-{F}(V1,V7,V8), P_multiply-{F}(V0,V9,V0), P_multiply-{F}(V9,V7,V10), P_least_upper_bound-{F}(V10,V11,V10), P_multiply-{F}(V0,V11,V0), P_multiply-{F}(V0,V10,V12), P_greatest_lower_bound-{F}(V1,V12,V8) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #569: mergings( V3 == V4; #566 ), references = 2, size of lhs = 15:
% 8.35/8.50     P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V1,V4,V0), P_multiply-{F}(V0,V5,V4), P_greatest_lower_bound-{F}(V0,V4,V6), P_c-{F}(V7), P_greatest_lower_bound-{F}(V0,V7,V0), P_multiply-{F}(V0,V8,V0), P_multiply-{F}(V8,V7,V9), P_multiply-{F}(V0,V9,V7), P_least_upper_bound-{F}(V9,V10,V9), P_multiply-{F}(V0,V10,V0) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #584: mergings( V3 == V4, V4 == V5, V1 == V8, V6 == V10, V2 == V11, V7 == V13; #577 ), references = 1, size of lhs = 9:
% 8.35/8.50     P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V1,V4,V0), P_multiply-{F}(V0,V5,V4), P_greatest_lower_bound-{F}(V0,V4,V6) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #596: mergings( V3 == V4, V4 == V5, V9 == V11, V1 == V2, V6 == V7, V2 == V8, V7 == V11; #588 ), references = 1, size of lhs = 5:
% 8.35/8.50     P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #602: mergings( V1 == V2, V2 == V3; #599 ), references = 1, size of lhs = 2:
% 8.35/8.50     P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0) | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  #605: exists( #21, #603 ), references = 1, size of lhs = 0:
% 8.35/8.50     FALSE | FALSE
% 8.35/8.50        (used 0 times, uses = {})
% 8.35/8.50  
% 8.35/8.50  number of learnt formulas = 54
% 8.35/8.50  
% 8.35/8.50  
% 8.35/8.50  % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.35/8.50  
% 8.35/8.50  randbase = 1
%------------------------------------------------------------------------------