%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP178-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n028.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 42.15s 42.38s
% Output : Refutation 42.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GRP178-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.09/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jul 22 13:45:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 42.15/42.38 GeoParameters:
% 42.15/42.38
% 42.15/42.38 tptp_input = 1
% 42.15/42.38 tptp_output = 0
% 42.15/42.38 nonempty = 1
% 42.15/42.38 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 42.15/42.38 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 42.15/42.38
% 42.15/42.38
% 42.15/42.38 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 42.15/42.38 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 42.15/42.38
% 42.15/42.38 RuleSystem INPUT:
% 42.15/42.38
% 42.15/42.38 Initial Rules:
% 42.15/42.38 #0: input, references = 4, size of lhs = 3:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #1: input, references = 4, size of lhs = 4:
% 42.15/42.38 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #2: input, references = 7, size of lhs = 6:
% 42.15/42.38 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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #3: input, references = 4, size of lhs = 4:
% 42.15/42.38 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #4: input, references = 4, size of lhs = 4:
% 42.15/42.38 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #5: input, references = 4, size of lhs = 6:
% 42.15/42.38 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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #6: input, references = 3, size of lhs = 6:
% 42.15/42.38 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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #7: input, references = 4, size of lhs = 3:
% 42.15/42.38 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #8: input, references = 4, size of lhs = 3:
% 42.15/42.38 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #9: input, references = 4, size of lhs = 4:
% 42.15/42.38 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #10: input, references = 4, size of lhs = 4:
% 42.15/42.38 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #11: input, references = 5, size of lhs = 7:
% 42.15/42.38 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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #12: input, references = 5, size of lhs = 7:
% 42.15/42.38 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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #13: input, references = 5, size of lhs = 7:
% 42.15/42.38 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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #14: input, references = 5, size of lhs = 7:
% 42.15/42.38 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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #15: input, references = 4, size of lhs = 4:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), V2 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #16: input, references = 4, size of lhs = 6:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), V4 == V3 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #17: input, references = 4, size of lhs = 8:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_least_upper_bound-{F}(V0,V5,V6), V6 == V5 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #18: input, references = 4, size of lhs = 9:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), V7 == V0 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #19: input, references = 12, size of lhs = 11:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_least_upper_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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #20: input, references = 20, size of lhs = 2:
% 42.15/42.38 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #21: input, references = 4, size of lhs = 0:
% 42.15/42.38 FALSE | EXISTS V0: P_identity-{T}(V0)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #22: input, references = 9, size of lhs = 1:
% 42.15/42.38 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #23: input, references = 13, size of lhs = 2:
% 42.15/42.38 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #24: input, references = 10, size of lhs = 2:
% 42.15/42.38 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #25: input, references = 4, size of lhs = 0:
% 42.15/42.38 FALSE | EXISTS V0: P_a-{T}(V0)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #26: input, references = 5, size of lhs = 0:
% 42.15/42.38 FALSE | EXISTS V0: P_b-{T}(V0)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #27: input, references = 7, size of lhs = 0:
% 42.15/42.38 FALSE | EXISTS V0: P_c-{T}(V0)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 number of initial rules = 28
% 42.15/42.38
% 42.15/42.38 Simplifiers:
% 42.15/42.38 #28: unsound, references = 3, size of lhs = 3:
% 42.15/42.38 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #29: unsound, references = 3, size of lhs = 3:
% 42.15/42.38 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #30: unsound, references = 3, size of lhs = 3:
% 42.15/42.38 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #31: unsound, references = 3, size of lhs = 3:
% 42.15/42.38 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #32: unsound, references = 3, size of lhs = 3:
% 42.15/42.38 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #33: unsound, references = 3, size of lhs = 3:
% 42.15/42.38 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #34: unsound, references = 3, size of lhs = 3:
% 42.15/42.38 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #35: unsound, references = 3, size of lhs = 3:
% 42.15/42.38 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 number of simplifiers = 8
% 42.15/42.38
% 42.15/42.38 Learnt:
% 42.15/42.38 #37: exists( #20, #1 ), references = 9, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #39: exists( #20, #0 ), references = 10, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #41: exists( #23, #8 ), references = 2, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #44: exists( #24, #7 ), references = 1, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #45: exists( #24, #9 ), references = 1, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #48: exists( #20, #2 ), references = 8, size of lhs = 4:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #53: mergings( V2 == V3; #51 ), references = 3, size of lhs = 4:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #57: exists( #23, #3 ), references = 8, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #66: exists( #24, #4 ), references = 2, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #67: exists( #24, #11 ), references = 1, size of lhs = 5:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #83: exists( #24, #13 ), references = 6, size of lhs = 5:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #86: exists( #23, #10 ), references = 11, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #105: exists( #24, #17 ), references = 5, size of lhs = 6:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5) | P_least_upper_bound-{T}(V0,V5,V5)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #117: mergings( V1 == V4, V4 == V5, V8 == V9, V2 == V5, V6 == V9, V5 == V3, V7 == V9; #109 ), references = 1, size of lhs = 5:
% 42.15/42.38 P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V0), P_least_upper_bound-{F}(V0,V0,V1), P_greatest_lower_bound-{F}(V0,V0,V2) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #153: exists( #24, #16 ), references = 3, size of lhs = 4:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3) | P_least_upper_bound-{T}(V0,V3,V3)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #164: exists( #20, #11 ), references = 1, size of lhs = 5:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #166: exists( #20, #13 ), references = 1, size of lhs = 5:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #172: mergings( V3 == V4, V4 == V5; #169 ), references = 1, size of lhs = 5:
% 42.15/42.38 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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #175: exists( #23, #5 ), references = 7, size of lhs = 4:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #188: exists( #20, #2 ), references = 5, size of lhs = 4:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #203: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #198 ), references = 3, size of lhs = 15:
% 42.15/42.38 P_c-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_least_upper_bound-{F}(V0,V0,V5), P_greatest_lower_bound-{F}(V1,V3,V6), P_greatest_lower_bound-{F}(V1,V0,V7), P_greatest_lower_bound-{F}(V1,V8,V7), P_multiply-{F}(V0,V9,V10), P_multiply-{F}(V3,V10,V11), P_multiply-{F}(V11,V12,V8), P_multiply-{F}(V13,V9,V14), P_multiply-{F}(V14,V12,V13) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #218: mergings( V2 == V0; #215 ), references = 1, size of lhs = 1:
% 42.15/42.38 P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #254: mergings( V3 == V4, V4 == V5; #250 ), references = 2, size of lhs = 11:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V1,V5,V1), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_multiply-{F}(V8,V5,V1), P_least_upper_bound-{F}(V8,V3,V3) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #259: mergings( V3 == V4, V4 == V5, V5 == V6, V1 == V6; #251 ), references = 1, size of lhs = 12:
% 42.15/42.38 P_c-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V0,V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_least_upper_bound-{F}(V0,V0,V5), P_greatest_lower_bound-{F}(V1,V3,V6), P_least_upper_bound-{F}(V7,V3,V3), P_multiply-{F}(V7,V0,V1), P_multiply-{F}(V0,V8,V0) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #291: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V15 == V8; #285 ), references = 2, size of lhs = 14:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V1,V5,V1), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_multiply-{F}(V8,V5,V9), P_multiply-{F}(V10,V8,V3), P_least_upper_bound-{F}(V11,V10,V10), P_multiply-{F}(V11,V9,V12), P_greatest_lower_bound-{F}(V13,V12,V1) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #321: mergings( V3 == V4, V4 == V5, V5 == V6, V12 == V7; #315 ), references = 3, size of lhs = 12:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V1,V5,V1), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_least_upper_bound-{F}(V8,V3,V3), P_multiply-{F}(V8,V5,V9), P_greatest_lower_bound-{F}(V10,V9,V1) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #327: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V8 == V18; #316 ), references = 2, size of lhs = 14:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V1,V5,V1), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_least_upper_bound-{F}(V0,V8,V8), P_multiply-{F}(V8,V9,V3), P_least_upper_bound-{F}(V10,V9,V9), P_multiply-{F}(V10,V5,V11), P_greatest_lower_bound-{F}(V12,V11,V1) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #347: mergings( V1 == V4, V4 == V5, V9 == V10, V2 == V5, V6 == V8, V3 == V10, V7 == V10; #338 ), references = 1, size of lhs = 6:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V0), P_least_upper_bound-{F}(V0,V0,V1), P_b-{F}(V2), P_least_upper_bound-{F}(V0,V2,V2), P_greatest_lower_bound-{F}(V0,V2,V3) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #354: mergings( V1 == V4, V4 == V5, V2 == V5, V6 == V8, V3 == V9, V7 == V10; #339 ), references = 1, size of lhs = 9:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V0), P_least_upper_bound-{F}(V0,V0,V1), P_b-{F}(V2), P_least_upper_bound-{F}(V0,V2,V3), P_greatest_lower_bound-{F}(V0,V2,V4), P_least_upper_bound-{F}(V0,V5,V5), P_least_upper_bound-{F}(V0,V6,V6), P_multiply-{F}(V5,V6,V2) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #368: mergings( V2 == V4, V4 == V5, V1 == V3, V6 == V7, V3 == V5, V7 == V8; #360 ), references = 1, size of lhs = 3:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V0), P_least_upper_bound-{F}(V0,V0,V1) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #432: mergings( V3 == V4; #430 ), references = 1, size of lhs = 7:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V2,V4,V5), P_greatest_lower_bound-{F}(V6,V7,V3), P_multiply-{F}(V6,V4,V8), P_multiply-{F}(V7,V4,V9), P_greatest_lower_bound-{F}(V8,V9,V10) | P_multiply-{T}(V1,V5,V10)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #503: exists( #24, #15 ), references = 1, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1) | P_least_upper_bound-{T}(V0,V1,V1)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #507: exists( #23, #14 ), references = 4, size of lhs = 5:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #511: exists( #23, #12 ), references = 4, size of lhs = 5:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #524: mergings( V3 == V4; #522 ), references = 2, size of lhs = 9:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_multiply-{F}(V3,V5,V5), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #534: mergings( V1 == V4, V2 == V7, V5 == V8, V4 == V3, V6 == V9; #528 ), references = 1, size of lhs = 6:
% 42.15/42.38 P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V0,V3), P_greatest_lower_bound-{F}(V1,V0,V4) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #562: mergings( V3 == V4; #559 ), references = 1, size of lhs = 10:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V1,V5,V1), P_least_upper_bound-{F}(V0,V5,V6), P_multiply-{F}(V7,V5,V1), P_least_upper_bound-{F}(V7,V3,V3) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #564: mergings( V3 == V4; #560 ), references = 1, size of lhs = 11:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V1,V5,V1), P_least_upper_bound-{F}(V0,V5,V6), P_least_upper_bound-{F}(V7,V3,V3), P_multiply-{F}(V7,V5,V8), P_greatest_lower_bound-{F}(V9,V8,V1) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #585: mergings( V3 == V4; #583 ), references = 2, size of lhs = 7:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_least_upper_bound-{F}(V0,V5,V6) | P_greatest_lower_bound-{T}(V3,V1,V0)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #598: mergings( V3 == V4, V4 == V5; #595 ), references = 1, size of lhs = 10:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V3,V4,V5), P_greatest_lower_bound-{F}(V6,V2,V7), P_multiply-{F}(V7,V4,V8), P_multiply-{F}(V6,V4,V9), P_multiply-{F}(V1,V8,V10), P_multiply-{F}(V1,V9,V11), P_greatest_lower_bound-{F}(V11,V5,V12), V10 == V12 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #604: mergings( V3 == V4, V4 == V5, V5 == V6; #600 ), references = 2, size of lhs = 12:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V3,V4,V5), P_multiply-{F}(V2,V4,V6), P_multiply-{F}(V1,V7,V8), P_multiply-{F}(V8,V9,V10), P_multiply-{F}(V11,V9,V6), P_greatest_lower_bound-{F}(V11,V7,V12), P_multiply-{F}(V12,V9,V13), P_multiply-{F}(V1,V13,V14), P_greatest_lower_bound-{F}(V5,V10,V15), V14 == V15 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #681: mergings( V2 == V3, V3 == V4; #677 ), references = 1, size of lhs = 6:
% 42.15/42.38 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
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #684: mergings( V2 == V3, V3 == V4; #678 ), references = 1, size of lhs = 11:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V2,V5,V6), P_multiply-{F}(V4,V5,V7), P_multiply-{F}(V2,V8,V9), P_multiply-{F}(V10,V8,V7), P_greatest_lower_bound-{F}(V10,V4,V11), P_multiply-{F}(V11,V8,V4), P_greatest_lower_bound-{F}(V6,V9,V12), V2 == V12 | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #690: mergings( V3 == V4, V4 == V5; #686 ), references = 2, size of lhs = 4:
% 42.15/42.38 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)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #694: mergings( V3 == V4, V4 == V5, V5 == V6; #687 ), references = 1, size of lhs = 7:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V4,V5,V6), P_multiply-{F}(V7,V5,V6), P_greatest_lower_bound-{F}(V7,V4,V8), P_multiply-{F}(V8,V5,V4) | P_multiply-{T}(V2,V5,V2)
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #706: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V13 == V14; #699 ), references = 1, size of lhs = 11:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_multiply-{F}(V0,V4,V3), P_least_upper_bound-{F}(V0,V3,V5), P_c-{F}(V6), P_multiply-{F}(V0,V6,V0), P_least_upper_bound-{F}(V0,V6,V7), P_greatest_lower_bound-{F}(V1,V3,V8), P_greatest_lower_bound-{F}(V1,V6,V8) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #713: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V14 == V6, V12 == V13; #700 ), references = 1, size of lhs = 11:
% 42.15/42.38 P_c-{F}(V0), P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_multiply-{F}(V0,V4,V3), P_least_upper_bound-{F}(V0,V3,V5), P_least_upper_bound-{F}(V0,V0,V6), P_greatest_lower_bound-{F}(V1,V0,V7), P_greatest_lower_bound-{F}(V1,V3,V7) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #753: mergings( V3 == V4, V4 == V5; #750 ), references = 1, size of lhs = 14:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_greatest_lower_bound-{F}(V1,V5,V8), P_greatest_lower_bound-{F}(V9,V5,V10), P_multiply-{F}(V3,V10,V11), P_multiply-{F}(V3,V9,V12), P_greatest_lower_bound-{F}(V13,V11,V8), P_greatest_lower_bound-{F}(V13,V12,V1) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #767: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10; #759 ), references = 1, size of lhs = 17:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_multiply-{F}(V3,V8,V5), P_greatest_lower_bound-{F}(V8,V1,V9), P_multiply-{F}(V3,V9,V10), P_multiply-{F}(V11,V1,V1), P_greatest_lower_bound-{F}(V3,V12,V11), P_multiply-{F}(V12,V1,V13), P_greatest_lower_bound-{F}(V13,V10,V14), P_multiply-{F}(V3,V14,V15), P_greatest_lower_bound-{F}(V13,V15,V14) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #860: mergings( V3 == V4; #858 ), references = 1, size of lhs = 11:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_multiply-{F}(V3,V5,V8), P_greatest_lower_bound-{F}(V9,V8,V5), P_greatest_lower_bound-{F}(V1,V9,V1) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #867: mergings( V3 == V4, V4 == V5, V5 == V6; #863 ), references = 1, size of lhs = 15:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_multiply-{F}(V3,V5,V8), P_multiply-{F}(V9,V10,V1), P_multiply-{F}(V9,V11,V1), P_greatest_lower_bound-{F}(V10,V12,V11), P_multiply-{F}(V13,V12,V8), P_greatest_lower_bound-{F}(V9,V13,V14), P_multiply-{F}(V14,V12,V5) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #872: mergings( V3 == V4, V4 == V5, V5 == V6; #868 ), references = 1, size of lhs = 13:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_least_upper_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_multiply-{F}(V8,V5,V5), P_greatest_lower_bound-{F}(V9,V3,V8), P_multiply-{F}(V9,V10,V1), P_greatest_lower_bound-{F}(V10,V5,V11), P_multiply-{F}(V9,V11,V1) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #882: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V14 == V15; #875 ), references = 1, size of lhs = 12:
% 42.15/42.38 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_least_upper_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_least_upper_bound-{F}(V0,V4,V5), P_c-{F}(V6), P_least_upper_bound-{F}(V0,V6,V7), P_greatest_lower_bound-{F}(V1,V4,V8), P_multiply-{F}(V8,V6,V6), P_greatest_lower_bound-{F}(V9,V6,V9), P_multiply-{F}(V0,V9,V0) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #902: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V14 == V16, V18 == V19, V1 == V13, V11 == V16, V2 == V17, V12 == V19; #888 ), references = 1, size of lhs = 7:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_least_upper_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_least_upper_bound-{F}(V0,V4,V5) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #917: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V14 == V16, V1 == V2, V11 == V12, V2 == V13, V12 == V16; #904 ), references = 1, size of lhs = 5:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_least_upper_bound-{F}(V0,V1,V3) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #928: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #920 ), references = 1, size of lhs = 2:
% 42.15/42.38 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0) | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 #931: exists( #21, #929 ), references = 1, size of lhs = 0:
% 42.15/42.38 FALSE | FALSE
% 42.15/42.38 (used 0 times, uses = {})
% 42.15/42.38
% 42.15/42.38 number of learnt formulas = 57
% 42.15/42.38
% 42.15/42.38
% 42.15/42.38 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 42.15/42.38
% 42.15/42.38 randbase = 1
%------------------------------------------------------------------------------