TSTP Solution File: GRP191-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP191-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n011.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:30 EDT 2022
% Result : Unsatisfiable 45.36s 45.51s
% Output : Refutation 45.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP191-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n011.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:07:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 45.36/45.51 GeoParameters:
% 45.36/45.51
% 45.36/45.51 tptp_input = 1
% 45.36/45.51 tptp_output = 0
% 45.36/45.51 nonempty = 1
% 45.36/45.51 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 45.36/45.51 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 45.36/45.51
% 45.36/45.51
% 45.36/45.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 45.36/45.51 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 45.36/45.51
% 45.36/45.51 RuleSystem INPUT:
% 45.36/45.51
% 45.36/45.51 Initial Rules:
% 45.36/45.51 #0: input, references = 4, size of lhs = 3:
% 45.36/45.51 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #1: input, references = 4, size of lhs = 4:
% 45.36/45.51 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #2: input, references = 7, size of lhs = 6:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #3: input, references = 4, size of lhs = 4:
% 45.36/45.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #4: input, references = 4, size of lhs = 4:
% 45.36/45.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #5: input, references = 4, size of lhs = 6:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #6: input, references = 5, size of lhs = 6:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #7: input, references = 4, size of lhs = 3:
% 45.36/45.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #8: input, references = 4, size of lhs = 3:
% 45.36/45.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #9: input, references = 4, size of lhs = 4:
% 45.36/45.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #10: input, references = 4, size of lhs = 4:
% 45.36/45.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #11: input, references = 5, size of lhs = 7:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #12: input, references = 4, size of lhs = 7:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #13: input, references = 5, size of lhs = 7:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #14: input, references = 4, size of lhs = 7:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #15: input, references = 4, size of lhs = 5:
% 45.36/45.51 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), V3 == V2 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #16: input, references = 7, size of lhs = 7:
% 45.36/45.51 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_inverse-{F}(V1,V4), P_inverse-{F}(V2,V5), P_greatest_lower_bound-{F}(V4,V5,V4) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #17: input, references = 14, size of lhs = 2:
% 45.36/45.51 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #18: input, references = 4, size of lhs = 0:
% 45.36/45.51 FALSE | EXISTS V0: P_identity-{T}(V0)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #19: input, references = 14, size of lhs = 1:
% 45.36/45.51 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #20: input, references = 9, size of lhs = 2:
% 45.36/45.51 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #21: input, references = 8, size of lhs = 2:
% 45.36/45.51 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #22: input, references = 4, size of lhs = 0:
% 45.36/45.51 FALSE | EXISTS V0: P_a-{T}(V0)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #23: input, references = 5, size of lhs = 0:
% 45.36/45.51 FALSE | EXISTS V0: P_b-{T}(V0)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 number of initial rules = 24
% 45.36/45.51
% 45.36/45.51 Simplifiers:
% 45.36/45.51 #24: unsound, references = 3, size of lhs = 3:
% 45.36/45.51 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #25: unsound, references = 3, size of lhs = 3:
% 45.36/45.51 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #26: unsound, references = 3, size of lhs = 3:
% 45.36/45.51 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #27: unsound, references = 3, size of lhs = 3:
% 45.36/45.51 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #28: unsound, references = 3, size of lhs = 3:
% 45.36/45.51 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #29: unsound, references = 3, size of lhs = 3:
% 45.36/45.51 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #30: unsound, references = 3, size of lhs = 3:
% 45.36/45.51 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 number of simplifiers = 7
% 45.36/45.51
% 45.36/45.51 Learnt:
% 45.36/45.51 #32: exists( #17, #1 ), references = 16, size of lhs = 2:
% 45.36/45.51 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #35: exists( #20, #8 ), references = 2, size of lhs = 2:
% 45.36/45.51 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #38: exists( #21, #7 ), references = 1, size of lhs = 2:
% 45.36/45.51 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #39: exists( #21, #9 ), references = 4, size of lhs = 2:
% 45.36/45.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #41: exists( #17, #0 ), references = 12, size of lhs = 2:
% 45.36/45.51 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #45: mergings( V2 == V3; #43 ), references = 1, size of lhs = 4:
% 45.36/45.51 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V1), P_greatest_lower_bound-{F}(V1,V1,V2) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #49: exists( #17, #2 ), references = 10, size of lhs = 4:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #54: mergings( V2 == V3; #52 ), references = 3, size of lhs = 4:
% 45.36/45.51 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #58: exists( #20, #3 ), references = 2, size of lhs = 2:
% 45.36/45.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #60: exists( #17, #12 ), references = 1, size of lhs = 5:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #63: exists( #21, #11 ), references = 4, size of lhs = 5:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #64: exists( #21, #13 ), references = 7, size of lhs = 5:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #67: exists( #21, #4 ), references = 7, size of lhs = 2:
% 45.36/45.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #75: exists( #17, #14 ), references = 1, size of lhs = 5:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #81: mergings( V3 == V4, V4 == V5; #78 ), references = 1, size of lhs = 5:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #93: mergings( V2 == V0; #90 ), references = 1, size of lhs = 1:
% 45.36/45.51 P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #113: exists( #20, #10 ), references = 5, size of lhs = 2:
% 45.36/45.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #130: exists( #20, #15 ), references = 2, size of lhs = 3:
% 45.36/45.51 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | P_greatest_lower_bound-{T}(V1,V2,V2)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #136: exists( #17, #2 ), references = 3, size of lhs = 4:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #140: exists( #20, #5 ), references = 1, size of lhs = 4:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #149: mergings( V2 == V3, V3 == V4; #146 ), references = 2, size of lhs = 6:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #153: mergings( V3 == V4, V4 == V5; #150 ), references = 1, size of lhs = 4:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #158: mergings( V2 == V3; #156 ), references = 1, size of lhs = 5:
% 45.36/45.51 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
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #166: mergings( V2 == V3, V3 == V4, V4 == V5; #162 ), references = 6, size of lhs = 4:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #195: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9; #187 ), references = 1, size of lhs = 8:
% 45.36/45.51 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_inverse-{F}(V1,V0), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_multiply-{F}(V0,V2,V4), P_least_upper_bound-{F}(V0,V4,V0) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #209: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10; #199 ), references = 1, size of lhs = 4:
% 45.36/45.51 P_a-{F}(V0), P_multiply-{F}(V0,V0,V0), P_inverse-{F}(V0,V0), P_identity-{F}(V0) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #233: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9; #225 ), references = 1, size of lhs = 8:
% 45.36/45.51 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_b-{F}(V2), P_inverse-{F}(V2,V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_multiply-{F}(V0,V1,V4), P_least_upper_bound-{F}(V4,V0,V4) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #259: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #253 ), references = 1, size of lhs = 10:
% 45.36/45.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V1), P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V1,V5,V6), P_multiply-{F}(V3,V7,V6), P_multiply-{F}(V2,V8,V7), P_multiply-{F}(V4,V8,V9), P_least_upper_bound-{F}(V5,V10,V8), P_multiply-{F}(V1,V10,V11), P_least_upper_bound-{F}(V11,V7,V9) | P_multiply-{T}(V1,V8,V9)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #272: exists( #17, #13 ), references = 4, size of lhs = 5:
% 45.36/45.51 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)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #305: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11, V11 == V12, V12 == V13; #294 ), references = 2, size of lhs = 15:
% 45.36/45.51 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_inverse-{F}(V1,V4), P_inverse-{F}(V2,V5), P_multiply-{F}(V6,V7,V4), P_multiply-{F}(V7,V8,V7), P_multiply-{F}(V9,V8,V9), P_multiply-{F}(V10,V11,V8), P_multiply-{F}(V7,V10,V12), P_multiply-{F}(V9,V10,V13), P_least_upper_bound-{F}(V12,V13,V14), P_multiply-{F}(V6,V14,V15), P_multiply-{F}(V15,V11,V5) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #326: 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, V15 == V16; #311 ), references = 1, size of lhs = 14:
% 45.36/45.51 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_inverse-{F}(V2,V4), P_multiply-{F}(V0,V5,V4), P_multiply-{F}(V0,V6,V0), P_multiply-{F}(V7,V6,V7), P_multiply-{F}(V8,V5,V6), P_multiply-{F}(V0,V8,V9), P_multiply-{F}(V7,V8,V10), P_least_upper_bound-{F}(V9,V10,V1) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #375: mergings( V3 == V4; #373 ), references = 1, size of lhs = 6:
% 45.36/45.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V2), P_multiply-{F}(V1,V3,V4), P_multiply-{F}(V2,V5,V4), P_least_upper_bound-{F}(V5,V3,V6), P_multiply-{F}(V2,V6,V7) | P_multiply-{T}(V2,V3,V7)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #435: mergings( V3 == V4, V4 == V5, V5 == V6; #431 ), references = 1, size of lhs = 8:
% 45.36/45.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V1), P_least_upper_bound-{F}(V3,V4,V1), P_multiply-{F}(V3,V5,V6), P_multiply-{F}(V4,V5,V7), P_multiply-{F}(V2,V5,V8), P_least_upper_bound-{F}(V6,V8,V9), P_least_upper_bound-{F}(V7,V9,V10) | P_least_upper_bound-{T}(V6,V7,V10)
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #488: mergings( V14 == V16, V3 == V4, V4 == V5, V5 == V6; #483 ), references = 1, size of lhs = 15:
% 45.36/45.51 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_inverse-{F}(V1,V4), P_inverse-{F}(V2,V5), P_multiply-{F}(V6,V7,V6), P_multiply-{F}(V8,V6,V8), P_multiply-{F}(V9,V6,V9), P_multiply-{F}(V10,V9,V4), P_multiply-{F}(V11,V8,V9), P_least_upper_bound-{F}(V11,V12,V12), P_multiply-{F}(V10,V12,V13), P_multiply-{F}(V13,V8,V14), P_multiply-{F}(V14,V7,V5) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #503: mergings( V4 == V17, V2 == V3, V3 == V17, V17 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9; #494 ), references = 1, size of lhs = 14:
% 45.36/45.51 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_inverse-{F}(V2,V4), P_least_upper_bound-{F}(V5,V1,V1), P_multiply-{F}(V0,V6,V0), P_multiply-{F}(V6,V7,V6), P_multiply-{F}(V8,V6,V8), P_multiply-{F}(V5,V8,V0), P_multiply-{F}(V0,V8,V9), P_multiply-{F}(V9,V7,V4) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #520: mergings( V7 == V3, V2 == V4, V4 == V5, V5 == V6, V6 == V3, V3 == V8, V8 == V9, V9 == V10, V10 == V11, V11 == V12; #509 ), references = 2, size of lhs = 8:
% 45.36/45.51 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1), P_b-{F}(V2), P_multiply-{F}(V0,V2,V2), P_least_upper_bound-{F}(V2,V1,V1), P_greatest_lower_bound-{F}(V1,V2,V3) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #532: mergings( V1 == V2, V2 == V3, V3 == V4; #528 ), references = 1, size of lhs = 4:
% 45.36/45.51 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #538: mergings( V1 == V2, V2 == V3, V3 == V4; #534 ), references = 1, size of lhs = 2:
% 45.36/45.51 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0) | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 #541: exists( #18, #539 ), references = 1, size of lhs = 0:
% 45.36/45.51 FALSE | FALSE
% 45.36/45.51 (used 0 times, uses = {})
% 45.36/45.51
% 45.36/45.51 number of learnt formulas = 39
% 45.36/45.51
% 45.36/45.51
% 45.36/45.51 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 45.36/45.51
% 45.36/45.51 randbase = 1
%------------------------------------------------------------------------------