TSTP Solution File: GRP193-2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n029.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:31 EDT 2022
% Result : Unsatisfiable 9.41s 9.64s
% Output : Refutation 9.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n029.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:41:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 9.41/9.64 GeoParameters:
% 9.41/9.64
% 9.41/9.64 tptp_input = 1
% 9.41/9.64 tptp_output = 0
% 9.41/9.64 nonempty = 1
% 9.41/9.64 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.41/9.64 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 9.41/9.64
% 9.41/9.64
% 9.41/9.64 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.41/9.64 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.41/9.64
% 9.41/9.64 RuleSystem INPUT:
% 9.41/9.64
% 9.41/9.64 Initial Rules:
% 9.41/9.64 #0: input, references = 4, size of lhs = 3:
% 9.41/9.64 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #1: input, references = 5, size of lhs = 4:
% 9.41/9.64 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #2: input, references = 7, size of lhs = 6:
% 9.41/9.64 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
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #3: input, references = 4, size of lhs = 4:
% 9.41/9.64 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #4: input, references = 4, size of lhs = 4:
% 9.41/9.64 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #5: input, references = 4, size of lhs = 6:
% 9.41/9.64 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
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #6: input, references = 3, size of lhs = 6:
% 9.41/9.64 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
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #7: input, references = 4, size of lhs = 3:
% 9.41/9.64 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #8: input, references = 4, size of lhs = 3:
% 9.41/9.64 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #9: input, references = 4, size of lhs = 4:
% 9.41/9.64 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #10: input, references = 4, size of lhs = 4:
% 9.41/9.64 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #11: input, references = 4, size of lhs = 7:
% 9.41/9.64 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
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #12: input, references = 5, size of lhs = 7:
% 9.41/9.64 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
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #13: input, references = 4, size of lhs = 7:
% 9.41/9.64 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
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #14: input, references = 5, size of lhs = 7:
% 9.41/9.64 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
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #15: input, references = 4, size of lhs = 4:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), V2 == V0 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #16: input, references = 6, size of lhs = 6:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), V4 == V0 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #17: input, references = 6, size of lhs = 8:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V6), V6 == V0 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #18: input, references = 5, size of lhs = 9:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), V7 == V0 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #19: input, references = 4, size of lhs = 14:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_multiply-{F}(V3,V5,V8), P_greatest_lower_bound-{F}(V1,V8,V9), P_greatest_lower_bound-{F}(V1,V5,V10), P_multiply-{F}(V7,V10,V11), P_greatest_lower_bound-{F}(V9,V11,V12), V12 == V9 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #20: input, references = 8, size of lhs = 13:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V6), P_greatest_lower_bound-{F}(V1,V3,V7), P_multiply-{F}(V3,V5,V8), P_greatest_lower_bound-{F}(V1,V8,V10), P_greatest_lower_bound-{F}(V1,V5,V10), P_multiply-{F}(V7,V10,V11), P_greatest_lower_bound-{F}(V10,V11,V12) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #21: input, references = 14, size of lhs = 2:
% 9.41/9.64 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #22: input, references = 4, size of lhs = 0:
% 9.41/9.64 FALSE | EXISTS V0: P_identity-{T}(V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #23: input, references = 13, size of lhs = 1:
% 9.41/9.64 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #24: input, references = 15, size of lhs = 2:
% 9.41/9.64 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #25: input, references = 6, size of lhs = 2:
% 9.41/9.64 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #26: input, references = 4, size of lhs = 0:
% 9.41/9.64 FALSE | EXISTS V0: P_a-{T}(V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #27: input, references = 5, size of lhs = 0:
% 9.41/9.64 FALSE | EXISTS V0: P_b-{T}(V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #28: input, references = 8, size of lhs = 0:
% 9.41/9.64 FALSE | EXISTS V0: P_c-{T}(V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 number of initial rules = 29
% 9.41/9.64
% 9.41/9.64 Simplifiers:
% 9.41/9.64 #29: unsound, references = 3, size of lhs = 3:
% 9.41/9.64 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #30: unsound, references = 3, size of lhs = 3:
% 9.41/9.64 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #31: unsound, references = 3, size of lhs = 3:
% 9.41/9.64 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #32: unsound, references = 3, size of lhs = 3:
% 9.41/9.64 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #33: unsound, references = 3, size of lhs = 3:
% 9.41/9.64 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #34: unsound, references = 3, size of lhs = 3:
% 9.41/9.64 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #35: unsound, references = 3, size of lhs = 3:
% 9.41/9.64 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #36: unsound, references = 3, size of lhs = 3:
% 9.41/9.64 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 number of simplifiers = 8
% 9.41/9.64
% 9.41/9.64 Learnt:
% 9.41/9.64 #38: exists( #21, #1 ), references = 15, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #40: exists( #21, #0 ), references = 13, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #42: exists( #24, #8 ), references = 3, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #45: exists( #25, #7 ), references = 1, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #46: exists( #25, #9 ), references = 2, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #49: exists( #21, #2 ), references = 11, size of lhs = 4:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #54: mergings( V2 == V3; #52 ), references = 3, size of lhs = 4:
% 9.41/9.64 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #58: exists( #24, #3 ), references = 7, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #60: exists( #21, #12 ), references = 1, size of lhs = 5:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #63: exists( #25, #11 ), references = 4, size of lhs = 5:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #64: exists( #25, #13 ), references = 6, size of lhs = 5:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #67: exists( #25, #4 ), references = 8, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #75: exists( #21, #14 ), references = 1, size of lhs = 5:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #81: mergings( V3 == V4, V4 == V5; #78 ), references = 1, size of lhs = 5:
% 9.41/9.64 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
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #92: mergings( V2 == V0; #89 ), references = 1, size of lhs = 1:
% 9.41/9.64 P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #112: exists( #24, #10 ), references = 8, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #129: exists( #24, #17 ), references = 5, size of lhs = 6:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5) | P_greatest_lower_bound-{T}(V0,V5,V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #140: mergings( V1 == V4, V7 == V8, V8 == V9, V2 == V4, V5 == V9, V4 == V3, V6 == V9; #132 ), references = 1, size of lhs = 6:
% 9.41/9.64 P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1), P_multiply-{F}(V1,V0,V2), P_greatest_lower_bound-{F}(V0,V2,V3) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #152: exists( #21, #2 ), references = 7, size of lhs = 4:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #209: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #200 ), references = 2, size of lhs = 10:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), V3 == V0, P_multiply-{F}(V4,V5,V3), P_least_upper_bound-{F}(V6,V4,V6), P_multiply-{F}(V0,V7,V6), P_multiply-{F}(V8,V7,V9), P_multiply-{F}(V9,V5,V8) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #216: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #201 ), references = 1, size of lhs = 12:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1), P_b-{F}(V2), V2 == V0, P_c-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_multiply-{F}(V5,V6,V2), P_least_upper_bound-{F}(V7,V5,V7), P_multiply-{F}(V0,V8,V7), P_multiply-{F}(V9,V8,V10), P_multiply-{F}(V10,V6,V9) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #225: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V13; #202 ), references = 1, size of lhs = 15:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1), P_b-{F}(V2), P_c-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V0), P_multiply-{F}(V2,V3,V4), P_greatest_lower_bound-{F}(V0,V4,V0), P_multiply-{F}(V5,V6,V2), P_multiply-{F}(V7,V6,V2), P_least_upper_bound-{F}(V8,V5,V8), P_multiply-{F}(V2,V8,V7), P_multiply-{F}(V0,V9,V8), P_multiply-{F}(V10,V9,V11), P_multiply-{F}(V11,V6,V10) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #251: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7; #244 ), references = 1, size of lhs = 13:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V0,V4,V5), V5 == V0, P_multiply-{F}(V0,V6,V7), P_least_upper_bound-{F}(V8,V7,V9), P_multiply-{F}(V9,V10,V3), P_multiply-{F}(V8,V10,V11), P_multiply-{F}(V12,V6,V13), P_multiply-{F}(V13,V10,V12) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #258: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V11 == V14; #245 ), references = 1, size of lhs = 17:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1), P_b-{F}(V2), P_c-{F}(V3), P_multiply-{F}(V2,V3,V4), P_greatest_lower_bound-{F}(V0,V4,V5), P_greatest_lower_bound-{F}(V0,V3,V6), P_multiply-{F}(V0,V6,V7), P_greatest_lower_bound-{F}(V5,V7,V8), V8 == V5, P_multiply-{F}(V0,V9,V10), P_least_upper_bound-{F}(V11,V10,V12), P_multiply-{F}(V12,V13,V2), P_multiply-{F}(V11,V13,V14), P_multiply-{F}(V15,V9,V16), P_multiply-{F}(V16,V13,V15) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #272: exists( #24, #16 ), references = 2, size of lhs = 4:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3) | P_greatest_lower_bound-{T}(V0,V3,V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #273: exists( #24, #17 ), references = 1, size of lhs = 7:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_c-{F}(V4), P_greatest_lower_bound-{F}(V0,V4,V5), V5 == V0 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #282: mergings( V2 == V3, V3 == V4; #279 ), references = 2, size of lhs = 6:
% 9.41/9.64 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
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #286: mergings( V3 == V4, V4 == V5; #283 ), references = 7, size of lhs = 4:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #288: exists( #24, #5 ), references = 2, size of lhs = 4:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #297: mergings( V2 == V3, V3 == V4, V11 == V12, V10 == V4; #292 ), references = 1, size of lhs = 13:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_multiply-{F}(V0,V4,V3), P_greatest_lower_bound-{F}(V0,V3,V5), P_c-{F}(V6), P_multiply-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V1,V3,V7), P_greatest_lower_bound-{F}(V1,V6,V7), P_multiply-{F}(V7,V7,V8), P_greatest_lower_bound-{F}(V7,V8,V9) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #303: exists( #24, #14 ), references = 2, size of lhs = 5:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #304: exists( #24, #12 ), references = 3, size of lhs = 5:
% 9.41/9.64 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)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #319: mergings( V3 == V4, V4 == V5, V5 == V6, V12 == V6; #314 ), references = 3, size of lhs = 18:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V0), P_greatest_lower_bound-{F}(V1,V3,V6), P_greatest_lower_bound-{F}(V1,V5,V7), P_multiply-{F}(V6,V7,V8), P_greatest_lower_bound-{F}(V7,V8,V9), P_multiply-{F}(V10,V11,V3), P_multiply-{F}(V11,V5,V12), P_greatest_lower_bound-{F}(V13,V10,V14), P_multiply-{F}(V14,V12,V15), P_multiply-{F}(V13,V12,V16), P_greatest_lower_bound-{F}(V17,V16,V1), P_greatest_lower_bound-{F}(V17,V15,V7) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #329: mergings( V2 == V3, V3 == V4; #326 ), references = 3, size of lhs = 19:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_multiply-{F}(V0,V4,V3), P_greatest_lower_bound-{F}(V0,V3,V5), P_c-{F}(V6), P_greatest_lower_bound-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V1,V3,V7), P_greatest_lower_bound-{F}(V1,V6,V8), P_multiply-{F}(V7,V8,V9), P_greatest_lower_bound-{F}(V8,V9,V10), P_multiply-{F}(V0,V11,V0), P_multiply-{F}(V11,V6,V12), P_greatest_lower_bound-{F}(V13,V3,V14), P_multiply-{F}(V14,V12,V15), P_multiply-{F}(V13,V12,V16), P_greatest_lower_bound-{F}(V17,V16,V1), P_greatest_lower_bound-{F}(V17,V15,V8) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #343: mergings( V1 == V4, V4 == V10, V10 == V11, V11 == V12, V7 == V13, V2 == V12, V5 == V13, V3 == V8, V6 == V12; #333 ), references = 1, size of lhs = 7:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V0), P_multiply-{F}(V0,V0,V0), P_b-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V0), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V0,V3) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #353: mergings( V3 == V7, V6 == V8, V1 == V2, V4 == V5, V2 == V7, V5 == V8; #346 ), references = 1, size of lhs = 4:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V0), P_multiply-{F}(V0,V0,V0), P_greatest_lower_bound-{F}(V0,V0,V1) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #368: mergings( V2 == V3, V3 == V4, V4 == V5; #363 ), references = 1, size of lhs = 10:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), V4 == V0, P_multiply-{F}(V1,V5,V0), P_multiply-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V5,V6,V7), P_multiply-{F}(V1,V7,V8) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #373: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #364 ), references = 1, size of lhs = 15:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_b-{F}(V3), V3 == V0, P_multiply-{F}(V1,V4,V0), P_multiply-{F}(V0,V5,V1), P_multiply-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V4,V6,V7), P_multiply-{F}(V1,V7,V8), P_least_upper_bound-{F}(V6,V9,V6), P_multiply-{F}(V1,V9,V10), P_multiply-{F}(V10,V11,V3), P_multiply-{F}(V12,V5,V13), P_multiply-{F}(V13,V11,V12) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #384: exists( #24, #15 ), references = 1, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1) | P_greatest_lower_bound-{T}(V0,V1,V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #391: mergings( V1 == V6, V4 == V7, V2 == V8, V5 == V9; #386 ), references = 2, size of lhs = 7:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4), P_greatest_lower_bound-{F}(V1,V3,V5), V5 == V0 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #448: mergings( V3 == V4, V4 == V5, V5 == V6, V10 == V6; #441 ), references = 2, size of lhs = 9:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V1,V3,V0), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_multiply-{F}(V3,V5,V5), P_greatest_lower_bound-{F}(V0,V5,V0) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #458: mergings( V1 == V4, V2 == V7, V5 == V8, V4 == V3, V6 == V9; #452 ), references = 1, size of lhs = 6:
% 9.41/9.64 P_b-{F}(V0), P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V0,V0), P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V0,V3) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #468: mergings( V2 == V3; #466 ), references = 2, size of lhs = 5:
% 9.41/9.64 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_multiply-{F}(V0,V2,V3), P_multiply-{F}(V3,V1,V4), V4 == V3 | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #485: mergings( V3 == V4, V4 == V5, V5 == V6; #481 ), references = 1, size of lhs = 6:
% 9.41/9.64 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_multiply-{F}(V0,V2,V3), P_multiply-{F}(V3,V4,V0), P_multiply-{F}(V4,V5,V6), P_multiply-{F}(V6,V7,V1) | P_multiply-{T}(V5,V7,V3)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #511: exists( #24, #391 ), references = 1, size of lhs = 5:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V0,V3,V4) | P_greatest_lower_bound-{T}(V1,V3,V0)
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #555: mergings( V3 == V4, V4 == V5, V5 == V6, V13 == V6; #549 ), references = 1, size of lhs = 19:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V1,V3,V0), P_multiply-{F}(V0,V4,V3), P_greatest_lower_bound-{F}(V0,V3,V5), P_c-{F}(V6), P_greatest_lower_bound-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V1,V6,V7), P_multiply-{F}(V0,V7,V8), P_greatest_lower_bound-{F}(V7,V8,V9), P_multiply-{F}(V0,V10,V0), P_multiply-{F}(V10,V6,V11), P_least_upper_bound-{F}(V11,V12,V11), P_multiply-{F}(V13,V12,V1), P_greatest_lower_bound-{F}(V13,V3,V14), P_multiply-{F}(V14,V11,V15), P_greatest_lower_bound-{F}(V1,V15,V7) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #560: mergings( V3 == V4, V4 == V5, V5 == V6, V12 == V6; #550 ), references = 1, size of lhs = 18:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_greatest_lower_bound-{F}(V1,V3,V0), P_greatest_lower_bound-{F}(V0,V3,V4), P_c-{F}(V5), P_greatest_lower_bound-{F}(V0,V5,V0), P_greatest_lower_bound-{F}(V1,V5,V6), P_multiply-{F}(V0,V6,V7), P_greatest_lower_bound-{F}(V6,V7,V8), P_greatest_lower_bound-{F}(V1,V9,V6), P_multiply-{F}(V10,V11,V1), P_least_upper_bound-{F}(V12,V11,V12), P_multiply-{F}(V13,V5,V12), P_multiply-{F}(V14,V13,V3), P_greatest_lower_bound-{F}(V10,V14,V15), P_multiply-{F}(V15,V12,V9) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #573: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V13 == V7; #565 ), references = 1, size of lhs = 19:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V1,V4,V0), P_greatest_lower_bound-{F}(V0,V4,V5), P_c-{F}(V6), P_greatest_lower_bound-{F}(V0,V6,V0), P_greatest_lower_bound-{F}(V1,V6,V7), P_multiply-{F}(V0,V7,V8), P_greatest_lower_bound-{F}(V7,V8,V9), P_multiply-{F}(V0,V10,V0), P_greatest_lower_bound-{F}(V1,V11,V7), P_least_upper_bound-{F}(V12,V10,V12), P_multiply-{F}(V13,V6,V12), P_multiply-{F}(V14,V13,V4), P_greatest_lower_bound-{F}(V1,V14,V15), P_multiply-{F}(V15,V12,V11) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #581: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V14 == V21, V21 == V7; #566 ), references = 2, size of lhs = 19:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V1,V4,V0), P_multiply-{F}(V0,V5,V4), P_greatest_lower_bound-{F}(V0,V4,V6), P_c-{F}(V7), P_greatest_lower_bound-{F}(V0,V7,V0), P_greatest_lower_bound-{F}(V1,V7,V8), P_multiply-{F}(V0,V8,V9), P_greatest_lower_bound-{F}(V8,V9,V10), P_multiply-{F}(V0,V11,V0), P_multiply-{F}(V11,V7,V12), P_least_upper_bound-{F}(V12,V13,V12), P_multiply-{F}(V0,V13,V0), P_multiply-{F}(V0,V12,V14), P_greatest_lower_bound-{F}(V1,V14,V8) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #621: mergings( V3 == V4, V4 == V5; #616 ), references = 2, size of lhs = 15:
% 9.41/9.64 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V1,V4,V0), P_multiply-{F}(V0,V5,V4), P_greatest_lower_bound-{F}(V0,V4,V6), P_c-{F}(V7), P_greatest_lower_bound-{F}(V0,V7,V0), P_multiply-{F}(V0,V8,V0), P_multiply-{F}(V8,V7,V9), P_multiply-{F}(V0,V9,V7), P_least_upper_bound-{F}(V9,V10,V9), P_multiply-{F}(V0,V10,V0) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #636: mergings( V3 == V4, V4 == V5, V1 == V8, V6 == V10, V2 == V11, V7 == V13; #629 ), references = 1, size of lhs = 9:
% 9.41/9.64 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_greatest_lower_bound-{F}(V1,V4,V0), P_multiply-{F}(V0,V5,V4), P_greatest_lower_bound-{F}(V0,V4,V6) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #648: mergings( V3 == V4, V4 == V5, V9 == V11, V1 == V2, V6 == V7, V2 == V8, V7 == V11; #640 ), references = 1, size of lhs = 5:
% 9.41/9.64 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_greatest_lower_bound-{F}(V0,V1,V3) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #654: mergings( V1 == V2, V2 == V3; #651 ), references = 1, size of lhs = 2:
% 9.41/9.64 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0) | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 #657: exists( #22, #655 ), references = 1, size of lhs = 0:
% 9.41/9.64 FALSE | FALSE
% 9.41/9.64 (used 0 times, uses = {})
% 9.41/9.64
% 9.41/9.64 number of learnt formulas = 54
% 9.41/9.64
% 9.41/9.64
% 9.41/9.64 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.41/9.64
% 9.41/9.64 randbase = 1
%------------------------------------------------------------------------------