TSTP Solution File: GRP174-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP174-1 : 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:27 EDT 2022
% Result : Unsatisfiable 29.02s 29.26s
% Output : Refutation 29.02s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP174-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/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:40:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 29.02/29.26 GeoParameters:
% 29.02/29.26
% 29.02/29.26 tptp_input = 1
% 29.02/29.26 tptp_output = 0
% 29.02/29.26 nonempty = 1
% 29.02/29.26 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.02/29.26 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 29.02/29.26
% 29.02/29.26
% 29.02/29.26 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.02/29.26 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.02/29.26
% 29.02/29.26 RuleSystem INPUT:
% 29.02/29.26
% 29.02/29.26 Initial Rules:
% 29.02/29.26 #0: input, references = 4, size of lhs = 3:
% 29.02/29.26 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #1: input, references = 5, size of lhs = 4:
% 29.02/29.26 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #2: input, references = 8, size of lhs = 6:
% 29.02/29.26 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
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #3: input, references = 4, size of lhs = 4:
% 29.02/29.26 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #4: input, references = 4, size of lhs = 4:
% 29.02/29.26 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #5: input, references = 4, size of lhs = 6:
% 29.02/29.26 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
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #6: input, references = 4, size of lhs = 6:
% 29.02/29.26 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
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #7: input, references = 4, size of lhs = 3:
% 29.02/29.26 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #8: input, references = 4, size of lhs = 3:
% 29.02/29.26 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #9: input, references = 4, size of lhs = 4:
% 29.02/29.26 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #10: input, references = 3, size of lhs = 4:
% 29.02/29.26 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #11: input, references = 5, size of lhs = 7:
% 29.02/29.26 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
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #12: input, references = 6, size of lhs = 7:
% 29.02/29.26 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
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #13: input, references = 4, size of lhs = 7:
% 29.02/29.26 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
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #14: input, references = 4, size of lhs = 7:
% 29.02/29.26 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
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #15: input, references = 4, size of lhs = 4:
% 29.02/29.26 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), V2 == V1 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #16: input, references = 4, size of lhs = 6:
% 29.02/29.26 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_inverse-{F}(V1,V3), P_greatest_lower_bound-{F}(V0,V3,V4), V4 == V3 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #17: input, references = 4, size of lhs = 5:
% 29.02/29.26 P_identity-{F}(V1), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V1,V2), P_inverse-{F}(V1,V3), P_greatest_lower_bound-{F}(V1,V3,V4) | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #18: input, references = 12, size of lhs = 2:
% 29.02/29.26 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #19: input, references = 4, size of lhs = 0:
% 29.02/29.26 FALSE | EXISTS V0: P_identity-{T}(V0)
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #20: input, references = 9, size of lhs = 1:
% 29.02/29.26 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #21: input, references = 9, size of lhs = 2:
% 29.02/29.26 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #22: input, references = 6, size of lhs = 2:
% 29.02/29.26 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #23: input, references = 4, size of lhs = 0:
% 29.02/29.26 FALSE | EXISTS V0: P_a-{T}(V0)
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 number of initial rules = 24
% 29.02/29.26
% 29.02/29.26 Simplifiers:
% 29.02/29.26 #24: unsound, references = 3, size of lhs = 3:
% 29.02/29.26 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #25: unsound, references = 3, size of lhs = 3:
% 29.02/29.26 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #26: unsound, references = 3, size of lhs = 3:
% 29.02/29.26 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #27: unsound, references = 3, size of lhs = 3:
% 29.02/29.26 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #28: unsound, references = 3, size of lhs = 3:
% 29.02/29.26 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 #29: unsound, references = 3, size of lhs = 3:
% 29.02/29.26 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.26
% 29.02/29.26 number of simplifiers = 6
% 29.02/29.26
% 29.02/29.26 Learnt:
% 29.02/29.26 #31: exists( #18, #1 ), references = 12, size of lhs = 2:
% 29.02/29.26 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 29.02/29.26 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #34: exists( #21, #8 ), references = 3, size of lhs = 2:
% 29.02/29.27 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #38: exists( #22, #7 ), references = 2, size of lhs = 2:
% 29.02/29.27 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #39: exists( #22, #9 ), references = 1, size of lhs = 2:
% 29.02/29.27 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #42: exists( #18, #0 ), references = 8, size of lhs = 2:
% 29.02/29.27 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #45: exists( #21, #3 ), references = 8, size of lhs = 2:
% 29.02/29.27 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #47: exists( #22, #13 ), references = 2, size of lhs = 5:
% 29.02/29.27 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)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #54: exists( #22, #4 ), references = 2, size of lhs = 2:
% 29.02/29.27 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #55: exists( #22, #6 ), references = 2, size of lhs = 4:
% 29.02/29.27 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V4,V3,V5), P_least_upper_bound-{F}(V4,V1,V6) | P_least_upper_bound-{T}(V6,V2,V5)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #76: exists( #18, #2 ), references = 8, size of lhs = 4:
% 29.02/29.27 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)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #97: mergings( V2 == V3; #95 ), references = 3, size of lhs = 4:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #104: mergings( V2 == V0, V0 == V3; #101 ), references = 1, size of lhs = 1:
% 29.02/29.27 P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #109: exists( #18, #12 ), references = 1, size of lhs = 5:
% 29.02/29.27 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)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #112: exists( #18, #14 ), references = 8, size of lhs = 5:
% 29.02/29.27 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)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #118: mergings( V3 == V4, V4 == V5; #115 ), references = 2, size of lhs = 5:
% 29.02/29.27 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
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #149: exists( #21, #15 ), references = 1, size of lhs = 2:
% 29.02/29.27 P_identity-{F}(V0), P_a-{F}(V1) | P_greatest_lower_bound-{T}(V0,V1,V1)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #177: mergings( V3 == V4, V4 == V5, V5 == V6; #173 ), references = 1, size of lhs = 10:
% 29.02/29.27 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_multiply-{F}(V3,V4,V5), P_multiply-{F}(V2,V4,V6), P_least_upper_bound-{F}(V7,V6,V8), P_least_upper_bound-{F}(V7,V5,V9), P_multiply-{F}(V1,V10,V8), P_least_upper_bound-{F}(V10,V4,V11), P_multiply-{F}(V1,V11,V12), V12 == V9 | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #181: exists( #21, #5 ), references = 11, size of lhs = 4:
% 29.02/29.27 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V4,V1,V5), P_greatest_lower_bound-{F}(V5,V2,V6) | P_greatest_lower_bound-{T}(V4,V3,V6)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #182: exists( #21, #12 ), references = 9, size of lhs = 5:
% 29.02/29.27 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)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #230: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #222 ), references = 1, size of lhs = 12:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V4), P_greatest_lower_bound-{F}(V3,V5,V6), P_multiply-{F}(V7,V8,V6), P_greatest_lower_bound-{F}(V8,V9,V10), P_multiply-{F}(V7,V9,V11), P_greatest_lower_bound-{F}(V5,V11,V12), P_multiply-{F}(V12,V1,V13), P_greatest_lower_bound-{F}(V4,V14,V11), P_greatest_lower_bound-{F}(V14,V6,V13) | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #236: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #223 ), references = 1, size of lhs = 12:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V4), P_greatest_lower_bound-{F}(V3,V5,V6), P_multiply-{F}(V7,V8,V6), P_greatest_lower_bound-{F}(V8,V9,V10), P_multiply-{F}(V7,V9,V11), P_greatest_lower_bound-{F}(V5,V11,V12), P_multiply-{F}(V12,V1,V13), P_greatest_lower_bound-{F}(V4,V14,V11), P_greatest_lower_bound-{F}(V14,V6,V13) | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #243: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9; #224 ), references = 1, size of lhs = 14:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V2,V4,V5), P_greatest_lower_bound-{F}(V6,V7,V5), P_multiply-{F}(V6,V8,V9), P_greatest_lower_bound-{F}(V4,V10,V11), P_multiply-{F}(V3,V11,V12), P_multiply-{F}(V12,V8,V13), V13 == V12, P_multiply-{F}(V2,V10,V14), P_greatest_lower_bound-{F}(V7,V14,V15), P_multiply-{F}(V15,V8,V16), P_greatest_lower_bound-{F}(V17,V5,V16), P_greatest_lower_bound-{F}(V9,V17,V14) | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #264: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11; #253 ), references = 2, size of lhs = 16:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V4,V1,V5), P_multiply-{F}(V6,V7,V4), P_greatest_lower_bound-{F}(V7,V8,V9), P_multiply-{F}(V6,V8,V10), P_multiply-{F}(V11,V1,V10), P_greatest_lower_bound-{F}(V3,V11,V12), P_greatest_lower_bound-{F}(V13,V9,V9), P_multiply-{F}(V6,V13,V14), P_greatest_lower_bound-{F}(V5,V14,V15), P_greatest_lower_bound-{F}(V10,V15,V12), P_multiply-{F}(V12,V16,V15), P_greatest_lower_bound-{F}(V1,V16,V17) | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #273: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11; #254 ), references = 2, size of lhs = 16:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V4,V1,V5), P_multiply-{F}(V6,V7,V4), P_greatest_lower_bound-{F}(V7,V8,V9), P_multiply-{F}(V6,V8,V10), P_multiply-{F}(V11,V1,V10), P_greatest_lower_bound-{F}(V3,V11,V12), P_greatest_lower_bound-{F}(V13,V9,V9), P_multiply-{F}(V6,V13,V14), P_greatest_lower_bound-{F}(V5,V14,V15), P_greatest_lower_bound-{F}(V10,V15,V12), P_multiply-{F}(V12,V16,V15), P_greatest_lower_bound-{F}(V1,V16,V17) | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #294: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #288 ), references = 1, size of lhs = 13:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V1,V1,V1), P_greatest_lower_bound-{F}(V2,V1,V1), P_multiply-{F}(V3,V1,V3), P_multiply-{F}(V0,V3,V4), V4 == V0, P_multiply-{F}(V3,V3,V5), P_multiply-{F}(V5,V3,V1), P_multiply-{F}(V1,V3,V6), P_greatest_lower_bound-{F}(V6,V3,V3), P_multiply-{F}(V7,V2,V3), P_multiply-{F}(V7,V3,V5), P_multiply-{F}(V7,V1,V6) | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #299: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #289 ), references = 1, size of lhs = 13:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V1,V1,V1), P_greatest_lower_bound-{F}(V2,V1,V1), P_multiply-{F}(V3,V1,V3), P_multiply-{F}(V0,V3,V4), V4 == V0, P_multiply-{F}(V3,V3,V5), P_multiply-{F}(V5,V3,V1), P_multiply-{F}(V1,V3,V6), P_greatest_lower_bound-{F}(V6,V3,V3), P_multiply-{F}(V7,V2,V3), P_multiply-{F}(V7,V3,V5), P_multiply-{F}(V7,V1,V6) | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #325: mergings( V2 == V3, V3 == V4; #322 ), references = 2, size of lhs = 6:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V3,V5,V4), P_multiply-{F}(V0,V5,V6), V6 == V2 | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #350: mergings( V3 == V4; #348 ), references = 4, size of lhs = 5:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V3,V5,V6), P_multiply-{F}(V6,V7,V4) | P_multiply-{T}(V5,V7,V2)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #381: mergings( V2 == V3, V3 == V4; #376 ), references = 2, size of lhs = 7:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_multiply-{F}(V0,V2,V3), P_multiply-{F}(V2,V4,V5), P_multiply-{F}(V4,V6,V1), P_multiply-{F}(V5,V6,V7), V7 == V3 | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #384: mergings( V2 == V3, V3 == V4; #377 ), references = 2, size of lhs = 7:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_least_upper_bound-{F}(V1,V1,V2), P_multiply-{F}(V0,V3,V4), P_least_upper_bound-{F}(V4,V4,V5), P_multiply-{F}(V3,V2,V6), V6 == V5 | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #387: mergings( V2 == V3, V3 == V4; #378 ), references = 2, size of lhs = 7:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_greatest_lower_bound-{F}(V1,V1,V2), P_multiply-{F}(V0,V3,V4), P_greatest_lower_bound-{F}(V4,V4,V5), P_multiply-{F}(V3,V2,V6), V6 == V5 | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #413: mergings( V2 == V3; #409 ), references = 2, size of lhs = 4:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_multiply-{F}(V2,V3,V1), P_multiply-{F}(V0,V3,V4) | P_inverse-{T}(V2,V4)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #417: mergings( V2 == V3, V3 == V4, V4 == V5; #410 ), references = 1, size of lhs = 5:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_least_upper_bound-{F}(V1,V1,V2), P_multiply-{F}(V3,V4,V2), P_multiply-{F}(V0,V4,V5) | P_inverse-{T}(V3,V5)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #421: mergings( V2 == V3, V3 == V4, V4 == V5; #411 ), references = 1, size of lhs = 5:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V0), P_greatest_lower_bound-{F}(V1,V1,V2), P_multiply-{F}(V3,V4,V2), P_multiply-{F}(V0,V4,V5) | P_inverse-{T}(V3,V5)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #448: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V0 == V8; #441 ), references = 1, size of lhs = 5:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1), P_greatest_lower_bound-{F}(V0,V1,V1) | P_inverse-{T}(V1,V0)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #457: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5; #452 ), references = 1, size of lhs = 2:
% 29.02/29.27 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0) | P_a-{T}(V0)
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 #463: exists( #19, #461 ), references = 1, size of lhs = 0:
% 29.02/29.27 FALSE | FALSE
% 29.02/29.27 (used 0 times, uses = {})
% 29.02/29.27
% 29.02/29.27 number of learnt formulas = 37
% 29.02/29.27
% 29.02/29.27
% 29.02/29.27 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.02/29.27
% 29.02/29.27 randbase = 1
%------------------------------------------------------------------------------