TSTP Solution File: GRP170-2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP170-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:26 EDT 2022
% Result : Unsatisfiable 11.47s 11.66s
% Output : Refutation 11.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP170-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : geo -tptp_input -nonempty -inputfile %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 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jul 22 14:16:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 11.47/11.66 GeoParameters:
% 11.47/11.66
% 11.47/11.66 tptp_input = 1
% 11.47/11.66 tptp_output = 0
% 11.47/11.66 nonempty = 1
% 11.47/11.66 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.47/11.66 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 11.47/11.66
% 11.47/11.66
% 11.47/11.66 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.47/11.66 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.47/11.66
% 11.47/11.66 RuleSystem INPUT:
% 11.47/11.66
% 11.47/11.66 Initial Rules:
% 11.47/11.66 #0: input, references = 4, size of lhs = 3:
% 11.47/11.66 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #1: input, references = 4, size of lhs = 4:
% 11.47/11.66 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #2: input, references = 5, size of lhs = 6:
% 11.47/11.66 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
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #3: input, references = 4, size of lhs = 4:
% 11.47/11.66 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #4: input, references = 4, size of lhs = 4:
% 11.47/11.66 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #5: input, references = 4, size of lhs = 6:
% 11.47/11.66 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
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #6: input, references = 3, size of lhs = 6:
% 11.47/11.66 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
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #7: input, references = 4, size of lhs = 3:
% 11.47/11.66 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #8: input, references = 4, size of lhs = 3:
% 11.47/11.66 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #9: input, references = 4, size of lhs = 4:
% 11.47/11.66 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #10: input, references = 3, size of lhs = 4:
% 11.47/11.66 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #11: input, references = 3, size of lhs = 7:
% 11.47/11.66 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
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #12: input, references = 6, size of lhs = 7:
% 11.47/11.66 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
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #13: input, references = 3, size of lhs = 7:
% 11.47/11.66 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
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #14: input, references = 6, size of lhs = 7:
% 11.47/11.66 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
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #15: input, references = 4, size of lhs = 5:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), V3 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #16: input, references = 4, size of lhs = 8:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), V6 == V4 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #17: input, references = 11, size of lhs = 10:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V1,V4,V7), P_multiply-{F}(V2,V5,V8), P_greatest_lower_bound-{F}(V7,V8,V7) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #18: input, references = 23, size of lhs = 2:
% 11.47/11.66 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #19: input, references = 4, size of lhs = 0:
% 11.47/11.66 FALSE | EXISTS V0: P_identity-{T}(V0)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #20: input, references = 4, size of lhs = 1:
% 11.47/11.66 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #21: input, references = 9, size of lhs = 2:
% 11.47/11.66 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #22: input, references = 5, size of lhs = 2:
% 11.47/11.66 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #23: input, references = 4, size of lhs = 0:
% 11.47/11.66 FALSE | EXISTS V0: P_a-{T}(V0)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #24: input, references = 5, size of lhs = 0:
% 11.47/11.66 FALSE | EXISTS V0: P_b-{T}(V0)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #25: input, references = 8, size of lhs = 0:
% 11.47/11.66 FALSE | EXISTS V0: P_c-{T}(V0)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #26: input, references = 8, size of lhs = 0:
% 11.47/11.66 FALSE | EXISTS V0: P_d-{T}(V0)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 number of initial rules = 27
% 11.47/11.66
% 11.47/11.66 Simplifiers:
% 11.47/11.66 #27: unsound, references = 3, size of lhs = 3:
% 11.47/11.66 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #28: unsound, references = 3, size of lhs = 3:
% 11.47/11.66 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #29: unsound, references = 3, size of lhs = 3:
% 11.47/11.66 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #30: unsound, references = 3, size of lhs = 3:
% 11.47/11.66 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #31: unsound, references = 3, size of lhs = 3:
% 11.47/11.66 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #32: unsound, references = 3, size of lhs = 3:
% 11.47/11.66 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #33: unsound, references = 3, size of lhs = 3:
% 11.47/11.66 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #34: unsound, references = 3, size of lhs = 3:
% 11.47/11.66 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #35: unsound, references = 3, size of lhs = 3:
% 11.47/11.66 P_d-{F}(V0), P_d-{F}(V1), V0 == V1 | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 number of simplifiers = 9
% 11.47/11.66
% 11.47/11.66 Learnt:
% 11.47/11.66 #37: exists( #18, #1 ), references = 2, size of lhs = 2:
% 11.47/11.66 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #39: exists( #21, #8 ), references = 2, size of lhs = 2:
% 11.47/11.66 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #43: exists( #22, #7 ), references = 1, size of lhs = 2:
% 11.47/11.66 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #44: exists( #22, #9 ), references = 1, size of lhs = 2:
% 11.47/11.66 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #49: exists( #18, #0 ), references = 19, size of lhs = 2:
% 11.47/11.66 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #50: exists( #18, #2 ), references = 8, size of lhs = 4:
% 11.47/11.66 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)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #53: exists( #21, #3 ), references = 12, size of lhs = 2:
% 11.47/11.66 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #55: exists( #18, #2 ), references = 14, size of lhs = 4:
% 11.47/11.66 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)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #59: exists( #21, #14 ), references = 24, size of lhs = 5:
% 11.47/11.66 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)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #60: exists( #21, #12 ), references = 11, size of lhs = 5:
% 11.47/11.66 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)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #70: exists( #22, #4 ), references = 1, size of lhs = 2:
% 11.47/11.66 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #81: exists( #21, #16 ), references = 9, size of lhs = 6:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5) | P_greatest_lower_bound-{T}(V4,V5,V4)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #90: mergings( V1 == V2, V2 == V6, V3 == V7, V6 == V4, V5 == V8; #84 ), references = 2, size of lhs = 6:
% 11.47/11.66 P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V0,V2), P_c-{F}(V3), P_multiply-{F}(V1,V3,V3) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #94: mergings( V1 == V2; #92 ), references = 1, size of lhs = 4:
% 11.47/11.66 P_a-{F}(V0), P_b-{F}(V0), P_identity-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #112: exists( #21, #15 ), references = 2, size of lhs = 3:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | P_greatest_lower_bound-{T}(V1,V2,V1)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #115: exists( #21, #5 ), references = 13, size of lhs = 4:
% 11.47/11.66 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)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #136: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #131 ), references = 4, size of lhs = 14:
% 11.47/11.66 P_d-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V4,V0,V5), P_multiply-{F}(V1,V4,V6), P_greatest_lower_bound-{F}(V6,V7,V6), P_multiply-{F}(V0,V8,V9), P_multiply-{F}(V2,V9,V10), P_multiply-{F}(V10,V11,V7), P_multiply-{F}(V12,V8,V13), P_multiply-{F}(V13,V11,V12) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #166: mergings( V3 == V4; #163 ), references = 1, size of lhs = 11:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V1,V4,V7), P_multiply-{F}(V8,V5,V7), P_greatest_lower_bound-{F}(V8,V2,V9), P_multiply-{F}(V9,V5,V7) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #169: mergings( V3 == V4, V4 == V5; #164 ), references = 1, size of lhs = 15:
% 11.47/11.66 P_d-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V4,V0,V5), P_multiply-{F}(V1,V4,V6), P_greatest_lower_bound-{F}(V7,V2,V8), P_multiply-{F}(V7,V9,V6), P_multiply-{F}(V8,V9,V6), P_multiply-{F}(V0,V10,V9), P_multiply-{F}(V9,V11,V9), P_multiply-{F}(V12,V10,V13), P_multiply-{F}(V13,V11,V12) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #199: mergings( V3 == V4, V4 == V5, V5 == V6; #195 ), references = 4, size of lhs = 15:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V1,V4,V7), P_multiply-{F}(V8,V9,V2), 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,V13,V7), P_greatest_lower_bound-{F}(V15,V14,V7) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #233: mergings( V3 == V4, V4 == V5; #229 ), references = 7, size of lhs = 13:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V1,V4,V7), P_greatest_lower_bound-{F}(V8,V2,V9), P_multiply-{F}(V9,V5,V10), P_multiply-{F}(V8,V5,V11), P_greatest_lower_bound-{F}(V12,V10,V7), P_greatest_lower_bound-{F}(V12,V11,V7) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #237: mergings( V3 == V4, V4 == V5, V5 == V6; #230 ), references = 3, size of lhs = 15:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V1,V4,V7), P_greatest_lower_bound-{F}(V0,V8,V0), P_multiply-{F}(V8,V9,V2), P_greatest_lower_bound-{F}(V10,V9,V11), P_multiply-{F}(V11,V5,V12), P_multiply-{F}(V10,V5,V13), P_greatest_lower_bound-{F}(V14,V12,V7), P_greatest_lower_bound-{F}(V14,V13,V15) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #251: mergings( V1 == V2, V2 == V6, V3 == V7, V4 == V8, V5 == V9; #244 ), references = 2, size of lhs = 7:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V0,V2,V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_multiply-{F}(V1,V4,V4) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #257: mergings( V1 == V2, V2 == V6, V3 == V7, V4 == V8, V5 == V9; #245 ), references = 2, size of lhs = 9:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_multiply-{F}(V1,V4,V4), P_greatest_lower_bound-{F}(V0,V5,V0), P_multiply-{F}(V5,V6,V2), P_greatest_lower_bound-{F}(V0,V6,V0) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #264: mergings( V1 == V2, V2 == V4; #260 ), references = 1, size of lhs = 4:
% 11.47/11.66 P_a-{F}(V0), P_identity-{F}(V0), P_b-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V0) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #266: mergings( V1 == V2; #261 ), references = 1, size of lhs = 7:
% 11.47/11.66 P_a-{F}(V0), P_identity-{F}(V0), P_b-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V3,V0), P_multiply-{F}(V3,V4,V1), P_greatest_lower_bound-{F}(V0,V4,V0) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #273: mergings( V1 == V2; #270 ), references = 1, size of lhs = 2:
% 11.47/11.66 P_a-{F}(V0), P_identity-{F}(V0) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #276: exists( #18, #12 ), references = 1, size of lhs = 5:
% 11.47/11.66 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)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #278: exists( #18, #14 ), references = 1, size of lhs = 5:
% 11.47/11.66 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)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #313: mergings( V3 == V4; #311 ), references = 2, size of lhs = 10:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V7,V5,V4), P_multiply-{F}(V8,V7,V2), P_greatest_lower_bound-{F}(V1,V8,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #350: mergings( V3 == V4, V4 == V5; #345 ), references = 1, size of lhs = 11:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V1,V4,V7), P_multiply-{F}(V2,V8,V7), P_greatest_lower_bound-{F}(V5,V8,V9), P_multiply-{F}(V2,V9,V7) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #353: mergings( V3 == V4, V4 == V5; #346 ), references = 1, size of lhs = 14:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V1,V4,V7), P_greatest_lower_bound-{F}(V8,V2,V9), P_multiply-{F}(V8,V5,V10), P_greatest_lower_bound-{F}(V11,V10,V7), P_multiply-{F}(V9,V12,V11), P_greatest_lower_bound-{F}(V5,V12,V13), P_multiply-{F}(V9,V13,V7) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #357: mergings( V3 == V4, V4 == V5, V5 == V6; #347 ), references = 1, size of lhs = 15:
% 11.47/11.66 P_d-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V4,V0,V5), P_multiply-{F}(V1,V4,V6), P_multiply-{F}(V2,V7,V6), P_multiply-{F}(V2,V8,V6), P_greatest_lower_bound-{F}(V9,V7,V8), P_multiply-{F}(V0,V10,V9), P_multiply-{F}(V9,V11,V9), P_multiply-{F}(V12,V10,V13), P_multiply-{F}(V13,V11,V12) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #365: mergings( V3 == V4, V4 == V5; #360 ), references = 1, size of lhs = 8:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V1), P_greatest_lower_bound-{F}(V1,V1,V2), P_c-{F}(V3), P_d-{F}(V4), P_greatest_lower_bound-{F}(V4,V3,V3), P_greatest_lower_bound-{F}(V3,V4,V5) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #369: mergings( V3 == V4, V4 == V5, V5 == V6; #361 ), references = 1, size of lhs = 12:
% 11.47/11.66 P_d-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V1), P_greatest_lower_bound-{F}(V1,V1,V2), P_c-{F}(V3), P_greatest_lower_bound-{F}(V3,V0,V4), P_greatest_lower_bound-{F}(V5,V3,V3), P_multiply-{F}(V0,V6,V5), P_multiply-{F}(V5,V7,V5), P_multiply-{F}(V8,V6,V9), P_multiply-{F}(V9,V7,V8) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #374: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #362 ), references = 2, size of lhs = 13:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V5,V4,V4), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V7,V2,V1), P_multiply-{F}(V7,V5,V8), P_greatest_lower_bound-{F}(V1,V9,V1), P_multiply-{F}(V9,V4,V10), P_greatest_lower_bound-{F}(V10,V8,V10) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #389: mergings( V1 == V5, V5 == V6, V6 == V7, V7 == V8, V2 == V9, V3 == V9, V4 == V10; #381 ), references = 1, size of lhs = 5:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V1), P_greatest_lower_bound-{F}(V1,V1,V2), P_c-{F}(V3) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #398: mergings( V1 == V5, V5 == V6, V6 == V7, V7 == V8, V2 == V9, V3 == V9, V4 == V10; #390 ), references = 1, size of lhs = 4:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V1), P_greatest_lower_bound-{F}(V1,V1,V2) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #430: mergings( V3 == V4, V4 == V5, V5 == V6; #424 ), references = 2, size of lhs = 13:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V2,V5,V7), P_greatest_lower_bound-{F}(V8,V7,V8), P_greatest_lower_bound-{F}(V9,V10,V9), P_multiply-{F}(V9,V11,V1), P_multiply-{F}(V11,V4,V12), P_multiply-{F}(V10,V12,V8) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #434: mergings( V3 == V4, V4 == V5, V5 == V6; #425 ), references = 1, size of lhs = 15:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V7,V4,V8), P_multiply-{F}(V9,V7,V1), P_greatest_lower_bound-{F}(V9,V10,V9), P_multiply-{F}(V10,V8,V11), P_greatest_lower_bound-{F}(V11,V12,V11), P_multiply-{F}(V13,V5,V12), P_greatest_lower_bound-{F}(V13,V2,V14), P_multiply-{F}(V14,V5,V12) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #438: mergings( V3 == V4, V4 == V5, V5 == V6; #426 ), references = 1, size of lhs = 17:
% 11.47/11.66 P_d-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V4,V0,V5), P_multiply-{F}(V6,V4,V7), P_multiply-{F}(V8,V6,V1), P_greatest_lower_bound-{F}(V8,V9,V8), P_multiply-{F}(V9,V7,V10), P_greatest_lower_bound-{F}(V10,V11,V10), P_multiply-{F}(V0,V12,V13), P_multiply-{F}(V2,V13,V14), P_multiply-{F}(V14,V15,V11), P_multiply-{F}(V16,V12,V17), P_multiply-{F}(V17,V15,V16) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #466: mergings( V3 == V4; #462 ), references = 2, size of lhs = 12:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V1,V7,V1), P_multiply-{F}(V7,V4,V8), P_multiply-{F}(V9,V5,V8), P_greatest_lower_bound-{F}(V9,V2,V10), P_multiply-{F}(V10,V5,V8) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #468: mergings( V3 == V4; #463 ), references = 1, size of lhs = 14:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V1,V7,V1), P_multiply-{F}(V7,V4,V8), P_multiply-{F}(V9,V10,V2), P_multiply-{F}(V10,V5,V11), P_multiply-{F}(V12,V11,V8), P_greatest_lower_bound-{F}(V12,V9,V13), P_multiply-{F}(V13,V11,V8) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #470: mergings( V3 == V4; #464 ), references = 1, size of lhs = 14:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V0,V7,V0), P_multiply-{F}(V7,V8,V2), P_greatest_lower_bound-{F}(V1,V9,V1), P_multiply-{F}(V9,V4,V10), P_multiply-{F}(V11,V5,V10), P_greatest_lower_bound-{F}(V11,V8,V12), P_multiply-{F}(V12,V5,V10) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #497: mergings( V3 == V4, V4 == V5; #492 ), references = 4, size of lhs = 11:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V2,V5,V7), P_greatest_lower_bound-{F}(V1,V8,V1), P_multiply-{F}(V8,V4,V9), P_greatest_lower_bound-{F}(V9,V7,V9) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #500: mergings( V3 == V4, V4 == V5; #493 ), references = 4, size of lhs = 13:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V1,V7,V1), P_multiply-{F}(V7,V4,V8), P_greatest_lower_bound-{F}(V8,V9,V8), P_multiply-{F}(V10,V5,V9), P_greatest_lower_bound-{F}(V10,V2,V11), P_multiply-{F}(V11,V5,V9) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #504: mergings( V3 == V4, V4 == V5, V5 == V6; #494 ), references = 3, size of lhs = 13:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V2,V5,V7), P_greatest_lower_bound-{F}(V8,V0,V8), P_multiply-{F}(V8,V9,V1), P_greatest_lower_bound-{F}(V9,V10,V9), P_multiply-{F}(V10,V4,V11), P_greatest_lower_bound-{F}(V11,V7,V11) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #522: mergings( V1 == V2, V2 == V6, V3 == V7, V6 == V4, V5 == V8; #514 ), references = 2, size of lhs = 7:
% 11.47/11.66 P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V0,V2), P_c-{F}(V3), P_greatest_lower_bound-{F}(V1,V4,V1), P_multiply-{F}(V4,V3,V3) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #528: mergings( V1 == V2, V2 == V6, V3 == V7, V4 == V8, V5 == V9; #515 ), references = 2, size of lhs = 8:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V0,V2,V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V1,V5,V1), P_multiply-{F}(V5,V4,V4) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #534: mergings( V1 == V2, V2 == V6, V3 == V7, V6 == V4, V5 == V8; #516 ), references = 2, size of lhs = 9:
% 11.47/11.66 P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V0,V2), P_c-{F}(V3), P_greatest_lower_bound-{F}(V4,V0,V4), P_multiply-{F}(V5,V3,V3), P_greatest_lower_bound-{F}(V6,V5,V6), P_multiply-{F}(V4,V6,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #543: mergings( V1 == V2, V3 == V4; #538 ), references = 1, size of lhs = 4:
% 11.47/11.66 P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V0,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #545: mergings( V1 == V2; #539 ), references = 1, size of lhs = 6:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V0,V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V0,V2,V0), P_greatest_lower_bound-{F}(V1,V2,V3) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #547: mergings( V1 == V2; #540 ), references = 1, size of lhs = 7:
% 11.47/11.66 P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V0,V2), P_greatest_lower_bound-{F}(V3,V0,V3), P_greatest_lower_bound-{F}(V4,V0,V4), P_multiply-{F}(V3,V4,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #615: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9; #608 ), references = 1, size of lhs = 9:
% 11.47/11.66 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_greatest_lower_bound-{F}(V3,V1,V3), P_multiply-{F}(V1,V3,V4), P_multiply-{F}(V5,V6,V3), P_multiply-{F}(V7,V6,V2), P_greatest_lower_bound-{F}(V5,V8,V7), P_multiply-{F}(V1,V8,V9), P_multiply-{F}(V9,V6,V3) | P_multiply-{T}(V8,V6,V2)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #640: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #634 ), references = 1, size of lhs = 6:
% 11.47/11.66 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V1), P_multiply-{F}(V1,V1,V3), P_multiply-{F}(V3,V4,V4), P_multiply-{F}(V2,V4,V5), P_greatest_lower_bound-{F}(V5,V4,V5) | P_multiply-{T}(V1,V4,V4)
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #674: mergings( V3 == V4, V4 == V5, V5 == V6; #668 ), references = 1, size of lhs = 14:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V7,V5,V4), P_multiply-{F}(V8,V7,V2), P_greatest_lower_bound-{F}(V9,V10,V9), P_multiply-{F}(V10,V11,V12), P_multiply-{F}(V13,V12,V8), P_multiply-{F}(V13,V9,V14), P_multiply-{F}(V14,V11,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #678: mergings( V3 == V4, V4 == V5, V5 == V6; #669 ), references = 1, size of lhs = 15:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V2,V5,V7), P_greatest_lower_bound-{F}(V8,V7,V8), P_multiply-{F}(V9,V4,V8), P_greatest_lower_bound-{F}(V10,V11,V10), P_multiply-{F}(V11,V12,V13), P_multiply-{F}(V14,V13,V9), P_multiply-{F}(V14,V10,V15), P_multiply-{F}(V15,V12,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #682: mergings( V3 == V4, V4 == V5, V5 == V6; #670 ), references = 1, size of lhs = 16:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V7,V5,V8), P_greatest_lower_bound-{F}(V7,V2,V9), P_multiply-{F}(V9,V5,V8), P_multiply-{F}(V10,V4,V8), P_greatest_lower_bound-{F}(V11,V12,V11), P_multiply-{F}(V12,V13,V14), P_multiply-{F}(V15,V14,V10), P_multiply-{F}(V15,V11,V16), P_multiply-{F}(V16,V13,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #714: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #707 ), references = 1, size of lhs = 14:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V2,V5,V7), P_greatest_lower_bound-{F}(V1,V8,V1), P_multiply-{F}(V8,V9,V0), P_multiply-{F}(V10,V11,V7), P_greatest_lower_bound-{F}(V12,V10,V12), P_multiply-{F}(V9,V12,V13), P_multiply-{F}(V13,V11,V4) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #719: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #708 ), references = 1, size of lhs = 16:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V1,V7,V1), P_multiply-{F}(V7,V8,V0), P_greatest_lower_bound-{F}(V9,V10,V9), P_multiply-{F}(V8,V9,V11), P_multiply-{F}(V11,V12,V4), P_multiply-{F}(V10,V12,V13), P_multiply-{F}(V14,V5,V13), P_greatest_lower_bound-{F}(V14,V2,V15), P_multiply-{F}(V15,V5,V13) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #724: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #709 ), references = 1, size of lhs = 16:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_multiply-{F}(V2,V5,V7), P_greatest_lower_bound-{F}(V8,V0,V8), P_multiply-{F}(V8,V9,V1), P_greatest_lower_bound-{F}(V9,V10,V9), P_multiply-{F}(V10,V11,V0), P_multiply-{F}(V12,V13,V7), P_greatest_lower_bound-{F}(V14,V12,V14), P_multiply-{F}(V11,V14,V15), P_multiply-{F}(V15,V13,V4) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #760: mergings( V3 == V4, V4 == V5; #755 ), references = 1, size of lhs = 12:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V7,V4,V4), P_multiply-{F}(V1,V7,V8), P_multiply-{F}(V9,V5,V8), P_greatest_lower_bound-{F}(V9,V2,V10), P_multiply-{F}(V10,V5,V8) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #763: mergings( V3 == V4, V4 == V5; #756 ), references = 1, size of lhs = 13:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V5,V4,V4), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V7,V2,V1), P_multiply-{F}(V7,V5,V8), P_greatest_lower_bound-{F}(V1,V9,V1), P_multiply-{F}(V9,V10,V8), P_greatest_lower_bound-{F}(V10,V4,V4) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #766: mergings( V3 == V4, V4 == V5; #757 ), references = 1, size of lhs = 13:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V1,V7,V1), P_greatest_lower_bound-{F}(V8,V4,V4), P_multiply-{F}(V7,V8,V9), P_multiply-{F}(V10,V5,V9), P_greatest_lower_bound-{F}(V10,V2,V11), P_multiply-{F}(V11,V5,V9) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #773: mergings( V3 == V4, V4 == V5, V0 == V7; #768 ), references = 1, size of lhs = 8:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V1), P_c-{F}(V3), P_d-{F}(V4), P_greatest_lower_bound-{F}(V4,V3,V3), P_greatest_lower_bound-{F}(V3,V4,V5) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #776: mergings( V3 == V4, V4 == V5; #769 ), references = 1, size of lhs = 10:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_d-{F}(V5), P_greatest_lower_bound-{F}(V5,V4,V4), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V7,V2,V1), P_greatest_lower_bound-{F}(V1,V7,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #791: mergings( V1 == V5, V5 == V6, V6 == V7, V7 == V8, V9 == V11, V2 == V11, V3 == V10, V4 == V11; #781 ), references = 1, size of lhs = 5:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V1), P_c-{F}(V3) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #799: mergings( V1 == V5, V5 == V6, V6 == V7, V7 == V8, V2 == V9, V3 == V10, V4 == V11; #782 ), references = 1, size of lhs = 7:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V5,V2,V1), P_greatest_lower_bound-{F}(V1,V5,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #810: mergings( V1 == V5, V5 == V6, V6 == V7, V7 == V8, V9 == V11, V2 == V11, V3 == V10, V4 == V11; #800 ), references = 1, size of lhs = 4:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #818: mergings( V1 == V5, V5 == V6, V6 == V7, V7 == V8, V2 == V9, V3 == V10, V4 == V11; #801 ), references = 1, size of lhs = 6:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V4,V2,V1), P_greatest_lower_bound-{F}(V1,V4,V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #828: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6; #821 ), references = 1, size of lhs = 2:
% 11.47/11.66 P_identity-{F}(V0), P_a-{F}(V1) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #837: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6; #830 ), references = 1, size of lhs = 1:
% 11.47/11.66 P_identity-{F}(V0) | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 #840: exists( #19, #830 ), references = 1, size of lhs = 0:
% 11.47/11.66 FALSE | FALSE
% 11.47/11.66 (used 0 times, uses = {})
% 11.47/11.66
% 11.47/11.66 number of learnt formulas = 73
% 11.47/11.66
% 11.47/11.66
% 11.47/11.66 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.47/11.66
% 11.47/11.66 randbase = 1
%------------------------------------------------------------------------------