TSTP Solution File: GRP167-5 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP167-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n020.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:25 EDT 2022
% Result : Unsatisfiable 14.21s 14.39s
% Output : Refutation 14.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP167-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jul 22 14:45:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 14.21/14.39 GeoParameters:
% 14.21/14.39
% 14.21/14.39 tptp_input = 1
% 14.21/14.39 tptp_output = 0
% 14.21/14.39 nonempty = 1
% 14.21/14.39 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.21/14.39 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 14.21/14.39
% 14.21/14.39
% 14.21/14.39 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.21/14.39 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.21/14.39
% 14.21/14.39 RuleSystem INPUT:
% 14.21/14.39
% 14.21/14.39 Initial Rules:
% 14.21/14.39 #0: input, references = 4, size of lhs = 3:
% 14.21/14.39 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #1: input, references = 5, size of lhs = 4:
% 14.21/14.39 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #2: input, references = 8, size of lhs = 6:
% 14.21/14.39 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
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #3: input, references = 4, size of lhs = 4:
% 14.21/14.39 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #4: input, references = 4, size of lhs = 4:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #5: input, references = 3, size of lhs = 6:
% 14.21/14.39 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
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #6: input, references = 3, size of lhs = 6:
% 14.21/14.39 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
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #7: input, references = 4, size of lhs = 3:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #8: input, references = 4, size of lhs = 3:
% 14.21/14.39 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #9: input, references = 4, size of lhs = 4:
% 14.21/14.39 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #10: input, references = 4, size of lhs = 4:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #11: input, references = 5, size of lhs = 7:
% 14.21/14.39 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
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #12: input, references = 4, size of lhs = 7:
% 14.21/14.39 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
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #13: input, references = 4, size of lhs = 7:
% 14.21/14.39 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
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #14: input, references = 4, size of lhs = 7:
% 14.21/14.39 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
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #15: input, references = 5, size of lhs = 7:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_inverse-{F}(V3,V4), P_inverse-{F}(V1,V5), P_inverse-{F}(V2,V6), P_greatest_lower_bound-{F}(V5,V6,V7), V4 == V7 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #16: input, references = 5, size of lhs = 4:
% 14.21/14.39 P_identity-{F}(V0), P_positive_part-{F}(V1,V2), P_least_upper_bound-{F}(V1,V0,V3), V2 == V3 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #17: input, references = 5, size of lhs = 4:
% 14.21/14.39 P_identity-{F}(V0), P_negative_part-{F}(V1,V2), P_greatest_lower_bound-{F}(V1,V0,V3), V2 == V3 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #18: input, references = 3, size of lhs = 7:
% 14.21/14.39 P_identity-{F}(V0), P_greatest_lower_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}(V1,V3,V7), P_greatest_lower_bound-{F}(V6,V7,V8), V5 == V8 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #19: input, references = 3, size of lhs = 7:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_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}(V1,V3,V7), P_least_upper_bound-{F}(V6,V7,V8), V5 == V8 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #20: input, references = 4, size of lhs = 5:
% 14.21/14.39 P_identity-{F}(V0), P_a-{F}(V4), P_positive_part-{F}(V4,V2), P_negative_part-{F}(V4,V3), P_multiply-{F}(V2,V3,V4) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #21: input, references = 10, size of lhs = 2:
% 14.21/14.39 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #22: input, references = 4, size of lhs = 0:
% 14.21/14.39 FALSE | EXISTS V0: P_identity-{T}(V0)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #23: input, references = 11, size of lhs = 1:
% 14.21/14.39 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #24: input, references = 6, size of lhs = 2:
% 14.21/14.39 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #25: input, references = 7, size of lhs = 2:
% 14.21/14.39 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #26: input, references = 8, size of lhs = 1:
% 14.21/14.39 #-{F} V0 | EXISTS V1: P_positive_part-{T}(V0,V1)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #27: input, references = 7, size of lhs = 1:
% 14.21/14.39 #-{F} V0 | EXISTS V1: P_negative_part-{T}(V0,V1)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #28: input, references = 4, size of lhs = 0:
% 14.21/14.39 FALSE | EXISTS V0: P_a-{T}(V0)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 number of initial rules = 29
% 14.21/14.39
% 14.21/14.39 Simplifiers:
% 14.21/14.39 #29: unsound, references = 3, size of lhs = 3:
% 14.21/14.39 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #30: unsound, references = 3, size of lhs = 3:
% 14.21/14.39 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #31: unsound, references = 3, size of lhs = 3:
% 14.21/14.39 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #32: unsound, references = 3, size of lhs = 3:
% 14.21/14.39 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #33: unsound, references = 3, size of lhs = 3:
% 14.21/14.39 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #34: unsound, references = 3, size of lhs = 3:
% 14.21/14.39 P_positive_part-{F}(V0,V1), P_positive_part-{F}(V0,V3), V1 == V3 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #35: unsound, references = 3, size of lhs = 3:
% 14.21/14.39 P_negative_part-{F}(V0,V1), P_negative_part-{F}(V0,V3), V1 == V3 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #36: unsound, references = 3, size of lhs = 3:
% 14.21/14.39 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 number of simplifiers = 8
% 14.21/14.39
% 14.21/14.39 Learnt:
% 14.21/14.39 #38: exists( #21, #1 ), references = 12, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #42: exists( #25, #7 ), references = 3, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #43: exists( #25, #9 ), references = 1, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #47: exists( #24, #8 ), references = 1, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #48: exists( #24, #10 ), references = 1, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #49: exists( #24, #15 ), references = 2, size of lhs = 5:
% 14.21/14.39 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_least_upper_bound-{F}(V1,V3,V4), P_inverse-{F}(V4,V5), P_inverse-{F}(V3,V6) | P_greatest_lower_bound-{T}(V2,V6,V5)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #52: exists( #21, #0 ), references = 8, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #53: exists( #21, #2 ), references = 8, size of lhs = 4:
% 14.21/14.39 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)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #55: exists( #26, #16 ), references = 1, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V0,V2) | P_positive_part-{T}(V1,V2)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #57: exists( #27, #17 ), references = 1, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V0,V2) | P_negative_part-{T}(V1,V2)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #60: exists( #21, #2 ), references = 11, size of lhs = 4:
% 14.21/14.39 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)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #62: exists( #24, #17 ), references = 4, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), P_negative_part-{F}(V1,V2) | P_greatest_lower_bound-{T}(V1,V0,V2)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #65: exists( #24, #3 ), references = 2, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #69: exists( #25, #16 ), references = 5, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), P_positive_part-{F}(V1,V2) | P_least_upper_bound-{T}(V1,V0,V2)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #83: mergings( V2 == V3, V3 == V4; #80 ), references = 1, size of lhs = 8:
% 14.21/14.39 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_least_upper_bound-{F}(V1,V3,V4), P_inverse-{F}(V4,V5), P_multiply-{F}(V5,V3,V6), P_multiply-{F}(V2,V3,V7), P_greatest_lower_bound-{F}(V7,V0,V8), V6 == V8 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #88: mergings( V2 == V3, V3 == V4; #85 ), references = 1, size of lhs = 6:
% 14.21/14.39 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_least_upper_bound-{F}(V1,V3,V4), P_inverse-{F}(V4,V5), P_multiply-{F}(V5,V3,V6), P_multiply-{F}(V2,V3,V7) | P_negative_part-{T}(V7,V6)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #104: exists( #25, #4 ), references = 8, size of lhs = 2:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #110: exists( #21, #11 ), references = 4, size of lhs = 5:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_multiply-{F}(V4,V1,V5), P_multiply-{F}(V4,V2,V6), P_least_upper_bound-{F}(V5,V6,V7) | P_multiply-{T}(V4,V3,V7)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #115: exists( #21, #13 ), references = 11, size of lhs = 5:
% 14.21/14.39 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V2,V4,V6), P_least_upper_bound-{F}(V5,V6,V7) | P_multiply-{T}(V3,V4,V7)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #132: mergings( V2 == V3; #130 ), references = 3, size of lhs = 4:
% 14.21/14.39 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #149: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #142 ), references = 1, size of lhs = 5:
% 14.21/14.39 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_multiply-{F}(V1,V0,V1), P_multiply-{F}(V0,V1,V1), P_multiply-{F}(V1,V1,V0) | P_positive_part-{T}(V1,V0)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #189: mergings( V2 == V0; #187 ), references = 1, size of lhs = 1:
% 14.21/14.39 P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #199: mergings( V2 == V3, V3 == V4; #196 ), references = 1, size of lhs = 6:
% 14.21/14.39 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
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #203: mergings( V3 == V4, V4 == V5; #200 ), references = 2, size of lhs = 4:
% 14.21/14.39 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)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #223: exists( #23, #15 ), references = 6, size of lhs = 5:
% 14.21/14.39 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_least_upper_bound-{F}(V1,V3,V4), P_inverse-{F}(V3,V5), P_greatest_lower_bound-{F}(V2,V5,V6) | P_inverse-{T}(V4,V6)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #261: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9; #252 ), references = 1, size of lhs = 13:
% 14.21/14.39 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V1,V3,V1), P_multiply-{F}(V4,V3,V4), P_inverse-{F}(V4,V5), P_greatest_lower_bound-{F}(V2,V5,V6), P_multiply-{F}(V7,V8,V3), P_multiply-{F}(V4,V7,V9), P_multiply-{F}(V1,V7,V10), P_least_upper_bound-{F}(V9,V10,V11), P_multiply-{F}(V6,V11,V12), P_multiply-{F}(V12,V8,V13), V13 == V0 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #269: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10; #253 ), references = 1, size of lhs = 15:
% 14.21/14.39 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V1,V3,V1), P_multiply-{F}(V4,V3,V4), P_inverse-{F}(V4,V5), P_greatest_lower_bound-{F}(V2,V5,V6), P_multiply-{F}(V7,V8,V6), P_multiply-{F}(V9,V10,V3), P_multiply-{F}(V4,V9,V11), P_multiply-{F}(V1,V9,V12), P_least_upper_bound-{F}(V11,V12,V13), P_multiply-{F}(V8,V13,V14), P_multiply-{F}(V14,V10,V15), P_multiply-{F}(V7,V15,V16), V0 == V16 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #278: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11; #254 ), references = 1, size of lhs = 14:
% 14.21/14.39 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V1,V3,V1), P_multiply-{F}(V4,V3,V4), P_inverse-{F}(V4,V5), P_greatest_lower_bound-{F}(V2,V5,V6), P_multiply-{F}(V7,V8,V3), P_multiply-{F}(V4,V7,V9), P_multiply-{F}(V1,V7,V10), P_least_upper_bound-{F}(V9,V10,V11), P_multiply-{F}(V6,V11,V12), P_multiply-{F}(V12,V8,V13), P_least_upper_bound-{F}(V0,V13,V14), V0 == V14 | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #292: exists( #21, #12 ), references = 2, size of lhs = 5:
% 14.21/14.39 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)
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #322: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #317 ), references = 2, size of lhs = 9:
% 14.21/14.39 P_identity-{F}(V0), P_a-{F}(V1), P_positive_part-{F}(V1,V2), P_negative_part-{F}(V1,V3), P_multiply-{F}(V4,V0,V1), P_multiply-{F}(V4,V5,V2), P_multiply-{F}(V0,V6,V5), P_multiply-{F}(V7,V6,V8), P_multiply-{F}(V8,V3,V7) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #341: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11, V11 == V12; #330 ), references = 1, size of lhs = 14:
% 14.21/14.39 P_identity-{F}(V0), P_a-{F}(V1), P_positive_part-{F}(V1,V2), P_negative_part-{F}(V1,V3), P_multiply-{F}(V4,V0,V1), P_multiply-{F}(V0,V3,V5), P_inverse-{F}(V0,V6), P_greatest_lower_bound-{F}(V6,V7,V5), P_inverse-{F}(V8,V7), P_multiply-{F}(V4,V9,V10), P_multiply-{F}(V9,V11,V0), P_multiply-{F}(V9,V12,V8), P_least_upper_bound-{F}(V11,V12,V13), P_multiply-{F}(V10,V13,V2) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #375: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #368 ), references = 1, size of lhs = 15:
% 14.21/14.39 P_identity-{F}(V0), P_a-{F}(V1), P_positive_part-{F}(V1,V2), P_negative_part-{F}(V1,V3), P_multiply-{F}(V4,V0,V1), P_inverse-{F}(V5,V0), P_multiply-{F}(V4,V6,V2), P_multiply-{F}(V0,V7,V6), P_inverse-{F}(V8,V9), P_least_upper_bound-{F}(V8,V5,V10), P_multiply-{F}(V10,V11,V7), P_multiply-{F}(V0,V11,V12), P_multiply-{F}(V12,V13,V0), P_greatest_lower_bound-{F}(V13,V14,V3), P_multiply-{F}(V12,V14,V9) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #398: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11, V11 == V12, V12 == V13, V13 == V14, V14 == V15; #384 ), references = 2, size of lhs = 23:
% 14.21/14.39 P_identity-{F}(V0), P_a-{F}(V1), P_positive_part-{F}(V1,V2), P_negative_part-{F}(V1,V3), P_multiply-{F}(V4,V0,V1), P_inverse-{F}(V5,V0), P_multiply-{F}(V0,V6,V0), P_multiply-{F}(V7,V6,V7), P_multiply-{F}(V4,V8,V9), P_multiply-{F}(V8,V10,V0), P_multiply-{F}(V8,V11,V7), P_least_upper_bound-{F}(V10,V11,V12), P_multiply-{F}(V9,V12,V2), P_inverse-{F}(V13,V14), P_least_upper_bound-{F}(V13,V5,V15), P_multiply-{F}(V0,V16,V17), P_multiply-{F}(V17,V18,V0), P_greatest_lower_bound-{F}(V18,V19,V3), P_multiply-{F}(V17,V19,V14), P_multiply-{F}(V20,V16,V6), P_multiply-{F}(V7,V20,V21), P_multiply-{F}(V0,V20,V22), P_least_upper_bound-{F}(V21,V22,V15) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #423: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #418 ), references = 1, size of lhs = 20:
% 14.21/14.39 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_positive_part-{F}(V1,V2), P_negative_part-{F}(V1,V3), P_inverse-{F}(V4,V0), P_multiply-{F}(V0,V1,V5), P_greatest_lower_bound-{F}(V6,V0,V3), P_multiply-{F}(V0,V7,V1), P_multiply-{F}(V0,V8,V2), P_least_upper_bound-{F}(V9,V0,V8), P_multiply-{F}(V0,V10,V10), P_multiply-{F}(V10,V6,V0), P_multiply-{F}(V10,V9,V0), P_multiply-{F}(V10,V7,V0), P_inverse-{F}(V11,V10), P_least_upper_bound-{F}(V11,V4,V12), P_multiply-{F}(V0,V13,V10), P_multiply-{F}(V10,V1,V14), P_least_upper_bound-{F}(V14,V5,V12) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #431: mergings( V6 == V17, V2 == V3, V3 == V4, V4 == V5, V5 == V17; #425 ), references = 1, size of lhs = 17:
% 14.21/14.39 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_positive_part-{F}(V1,V2), P_inverse-{F}(V3,V0), P_multiply-{F}(V0,V1,V4), P_multiply-{F}(V0,V5,V1), P_least_upper_bound-{F}(V0,V4,V6), P_least_upper_bound-{F}(V7,V3,V6), P_inverse-{F}(V7,V8), P_multiply-{F}(V0,V8,V8), P_multiply-{F}(V8,V5,V0), P_multiply-{F}(V8,V1,V0), P_multiply-{F}(V8,V9,V0), P_least_upper_bound-{F}(V9,V0,V10), P_multiply-{F}(V0,V10,V2), P_multiply-{F}(V0,V11,V8) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #441: mergings( V7 == V3, V2 == V4, V4 == V5, V5 == V6, V6 == V3; #435 ), references = 1, size of lhs = 11:
% 14.21/14.39 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_inverse-{F}(V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1), P_multiply-{F}(V0,V2,V1), P_inverse-{F}(V1,V3), P_multiply-{F}(V0,V3,V3), P_multiply-{F}(V3,V2,V0), P_multiply-{F}(V3,V1,V0), P_multiply-{F}(V0,V4,V3) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #448: mergings( V2 == V3, V3 == V4, V4 == V5; #444 ), references = 2, size of lhs = 5:
% 14.21/14.39 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_inverse-{F}(V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #451: exists( #28, #449 ), references = 1, size of lhs = 3:
% 14.21/14.39 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_inverse-{F}(V0,V0) | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 #455: exists( #22, #453 ), references = 1, size of lhs = 0:
% 14.21/14.39 FALSE | FALSE
% 14.21/14.39 (used 0 times, uses = {})
% 14.21/14.39
% 14.21/14.39 number of learnt formulas = 39
% 14.21/14.39
% 14.21/14.39
% 14.21/14.39 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.21/14.39
% 14.21/14.39 randbase = 1
%------------------------------------------------------------------------------