TSTP Solution File: GRP169-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP169-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n004.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:26 EDT 2022
% Result : Unsatisfiable 27.22s 27.42s
% Output : Refutation 27.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP169-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jul 22 13:51:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 27.22/27.42 GeoParameters:
% 27.22/27.42
% 27.22/27.42 tptp_input = 1
% 27.22/27.42 tptp_output = 0
% 27.22/27.42 nonempty = 1
% 27.22/27.42 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.22/27.42 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 27.22/27.42
% 27.22/27.42
% 27.22/27.42 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.22/27.42 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.22/27.42
% 27.22/27.42 RuleSystem INPUT:
% 27.22/27.42
% 27.22/27.42 Initial Rules:
% 27.22/27.42 #0: input, references = 4, size of lhs = 3:
% 27.22/27.42 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #1: input, references = 4, size of lhs = 4:
% 27.22/27.42 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #2: input, references = 7, size of lhs = 6:
% 27.22/27.42 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
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #3: input, references = 5, size of lhs = 4:
% 27.22/27.42 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #4: input, references = 4, size of lhs = 4:
% 27.22/27.42 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #5: input, references = 4, size of lhs = 6:
% 27.22/27.42 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
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #6: input, references = 3, size of lhs = 6:
% 27.22/27.42 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
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #7: input, references = 4, size of lhs = 3:
% 27.22/27.42 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #8: input, references = 4, size of lhs = 3:
% 27.22/27.42 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #9: input, references = 4, size of lhs = 4:
% 27.22/27.42 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #10: input, references = 4, size of lhs = 4:
% 27.22/27.42 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #11: input, references = 4, size of lhs = 7:
% 27.22/27.42 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
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #12: input, references = 4, size of lhs = 7:
% 27.22/27.42 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
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #13: input, references = 7, size of lhs = 7:
% 27.22/27.42 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
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #14: input, references = 5, size of lhs = 7:
% 27.22/27.42 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
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #15: input, references = 4, size of lhs = 7:
% 27.22/27.42 P_identity-{F}(V0), P_a-{F}(V1), P_inverse-{F}(V1,V2), P_b-{F}(V3), P_inverse-{F}(V3,V4), P_least_upper_bound-{F}(V2,V4,V5), V5 == V4 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #16: input, references = 6, size of lhs = 7:
% 27.22/27.42 P_identity-{F}(V0), P_a-{F}(V1), P_inverse-{F}(V1,V2), P_b-{F}(V3), P_inverse-{F}(V3,V4), P_least_upper_bound-{F}(V2,V4,V5), P_least_upper_bound-{F}(V1,V3,V1) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #17: input, references = 11, size of lhs = 2:
% 27.22/27.42 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #18: input, references = 4, size of lhs = 0:
% 27.22/27.42 FALSE | EXISTS V0: P_identity-{T}(V0)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #19: input, references = 12, size of lhs = 1:
% 27.22/27.42 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #20: input, references = 13, size of lhs = 2:
% 27.22/27.42 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #21: input, references = 8, size of lhs = 2:
% 27.22/27.42 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #22: input, references = 4, size of lhs = 0:
% 27.22/27.42 FALSE | EXISTS V0: P_a-{T}(V0)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #23: input, references = 4, size of lhs = 0:
% 27.22/27.42 FALSE | EXISTS V0: P_b-{T}(V0)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 number of initial rules = 24
% 27.22/27.42
% 27.22/27.42 Simplifiers:
% 27.22/27.42 #24: unsound, references = 3, size of lhs = 3:
% 27.22/27.42 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #25: unsound, references = 3, size of lhs = 3:
% 27.22/27.42 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #26: unsound, references = 3, size of lhs = 3:
% 27.22/27.42 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #27: unsound, references = 3, size of lhs = 3:
% 27.22/27.42 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #28: unsound, references = 3, size of lhs = 3:
% 27.22/27.42 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #29: unsound, references = 3, size of lhs = 3:
% 27.22/27.42 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #30: unsound, references = 3, size of lhs = 3:
% 27.22/27.42 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 number of simplifiers = 7
% 27.22/27.42
% 27.22/27.42 Learnt:
% 27.22/27.42 #32: exists( #17, #1 ), references = 10, size of lhs = 2:
% 27.22/27.42 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #35: exists( #20, #8 ), references = 1, size of lhs = 2:
% 27.22/27.42 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #38: exists( #21, #7 ), references = 2, size of lhs = 2:
% 27.22/27.42 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #39: exists( #21, #9 ), references = 2, size of lhs = 2:
% 27.22/27.42 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #41: exists( #17, #0 ), references = 10, size of lhs = 2:
% 27.22/27.42 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #45: mergings( V2 == V3; #43 ), references = 1, size of lhs = 4:
% 27.22/27.42 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V1), P_least_upper_bound-{F}(V1,V1,V1) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #49: exists( #17, #2 ), references = 5, size of lhs = 4:
% 27.22/27.42 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)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #54: mergings( V2 == V3; #52 ), references = 4, size of lhs = 4:
% 27.22/27.42 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #58: exists( #20, #3 ), references = 8, size of lhs = 2:
% 27.22/27.42 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #62: exists( #21, #4 ), references = 8, size of lhs = 2:
% 27.22/27.42 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #63: exists( #21, #11 ), references = 5, size of lhs = 5:
% 27.22/27.42 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)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #64: exists( #21, #13 ), references = 1, size of lhs = 5:
% 27.22/27.42 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)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #76: exists( #17, #12 ), references = 4, size of lhs = 5:
% 27.22/27.42 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)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #84: exists( #17, #14 ), references = 12, size of lhs = 5:
% 27.22/27.42 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)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #90: mergings( V3 == V4, V4 == V5; #87 ), references = 3, size of lhs = 5:
% 27.22/27.42 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
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #131: exists( #20, #5 ), references = 7, size of lhs = 4:
% 27.22/27.42 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)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #170: mergings( V3 == V4, V4 == V5, V5 == V6; #165 ), references = 1, size of lhs = 7:
% 27.22/27.42 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V4), P_greatest_lower_bound-{F}(V4,V5,V6), P_greatest_lower_bound-{F}(V5,V3,V7), P_multiply-{F}(V6,V1,V7) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #182: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #175 ), references = 1, size of lhs = 8:
% 27.22/27.42 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_greatest_lower_bound-{F}(V3,V6,V7), P_multiply-{F}(V6,V1,V8), P_greatest_lower_bound-{F}(V5,V8,V7) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #188: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #176 ), references = 1, size of lhs = 8:
% 27.22/27.42 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_greatest_lower_bound-{F}(V3,V6,V7), P_multiply-{F}(V6,V1,V8), P_greatest_lower_bound-{F}(V5,V8,V7) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #199: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9; #191 ), references = 2, size of lhs = 6:
% 27.22/27.42 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}(V5,V1,V3) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #204: exists( #17, #2 ), references = 7, size of lhs = 4:
% 27.22/27.42 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)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #221: exists( #20, #10 ), references = 2, size of lhs = 2:
% 27.22/27.42 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #222: exists( #20, #14 ), references = 1, size of lhs = 5:
% 27.22/27.42 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)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #240: mergings( V2 == V3, V3 == V4, V4 == V5; #236 ), references = 1, size of lhs = 8:
% 27.22/27.42 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V3,V2,V4), P_multiply-{F}(V3,V0,V5), P_multiply-{F}(V4,V6,V7), V7 == V5, P_multiply-{F}(V8,V1,V9), P_multiply-{F}(V9,V6,V8) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #250: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7; #244 ), references = 3, size of lhs = 4:
% 27.22/27.42 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V1), P_multiply-{F}(V1,V2,V0), P_multiply-{F}(V0,V2,V3) | P_inverse-{T}(V1,V3)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #289: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #281 ), references = 2, size of lhs = 12:
% 27.22/27.42 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V4,V5,V3), P_multiply-{F}(V4,V6,V7), P_multiply-{F}(V5,V6,V8), P_greatest_lower_bound-{F}(V7,V8,V9), P_multiply-{F}(V6,V10,V11), P_multiply-{F}(V2,V11,V10), P_multiply-{F}(V1,V11,V12), P_multiply-{F}(V9,V12,V13), P_greatest_lower_bound-{F}(V13,V12,V14), P_greatest_lower_bound-{F}(V14,V10,V9) | P_greatest_lower_bound-{T}(V12,V10,V0)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #295: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #282 ), references = 1, size of lhs = 12:
% 27.22/27.42 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V4,V5,V3), P_multiply-{F}(V4,V6,V7), P_multiply-{F}(V5,V6,V8), P_greatest_lower_bound-{F}(V7,V8,V9), P_multiply-{F}(V6,V10,V11), P_multiply-{F}(V2,V11,V10), P_multiply-{F}(V1,V11,V12), P_multiply-{F}(V9,V12,V13), P_greatest_lower_bound-{F}(V13,V12,V14), P_greatest_lower_bound-{F}(V14,V10,V9) | P_greatest_lower_bound-{T}(V12,V10,V0)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #301: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #283 ), references = 1, size of lhs = 12:
% 27.22/27.42 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V4,V5,V3), P_multiply-{F}(V4,V6,V7), P_multiply-{F}(V5,V6,V8), P_greatest_lower_bound-{F}(V7,V8,V9), P_multiply-{F}(V6,V10,V11), P_multiply-{F}(V2,V11,V10), P_multiply-{F}(V1,V11,V12), P_multiply-{F}(V9,V12,V13), P_greatest_lower_bound-{F}(V13,V12,V14), P_greatest_lower_bound-{F}(V14,V10,V9) | P_greatest_lower_bound-{T}(V12,V10,V0)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #357: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11; #348 ), references = 1, size of lhs = 11:
% 27.22/27.42 P_identity-{F}(V0), P_multiply-{F}(V1,V1,V1), P_multiply-{F}(V1,V2,V1), P_multiply-{F}(V3,V1,V3), P_multiply-{F}(V3,V2,V3), P_greatest_lower_bound-{F}(V4,V3,V3), P_multiply-{F}(V2,V4,V5), P_multiply-{F}(V1,V5,V4), P_multiply-{F}(V3,V5,V1), P_greatest_lower_bound-{F}(V4,V1,V6), V6 == V0 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #399: mergings( V3 == V4; #397 ), references = 4, size of lhs = 5:
% 27.22/27.42 P_identity-{F}(V0), P_a-{F}(V1), P_inverse-{F}(V1,V2), P_b-{F}(V3), P_inverse-{F}(V3,V4) | P_least_upper_bound-{T}(V4,V2,V4)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #418: mergings( V2 == V3, V0 == V7, V3 == V4, V4 == V5, V5 == V6, V6 == V9, V9 == V10, V10 == V11, V11 == V8; #408 ), references = 1, size of lhs = 5:
% 27.22/27.42 P_b-{F}(V0), P_inverse-{F}(V0,V0), P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #428: mergings( V2 == V3, V3 == V6; #425 ), references = 2, size of lhs = 7:
% 27.22/27.42 P_a-{F}(V0), P_inverse-{F}(V0,V1), P_b-{F}(V2), P_identity-{F}(V3), P_multiply-{F}(V1,V2,V4), P_least_upper_bound-{F}(V3,V4,V5), V3 == V5 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #437: mergings( V2 == V5, V5 == V6, V3 == V7; #433 ), references = 2, size of lhs = 5:
% 27.22/27.42 P_identity-{F}(V0), P_a-{F}(V1), P_inverse-{F}(V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V1,V3,V1) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #446: mergings( V3 == V1; #444 ), references = 1, size of lhs = 5:
% 27.22/27.42 P_a-{F}(V0), P_inverse-{F}(V0,V1), P_b-{F}(V2), P_identity-{F}(V3), P_multiply-{F}(V1,V2,V4) | P_least_upper_bound-{T}(V4,V3,V3)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #508: mergings( V3 == V4; #506 ), references = 2, size of lhs = 8:
% 27.22/27.42 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}(V7,V2,V6), P_least_upper_bound-{F}(V7,V4,V8), P_multiply-{F}(V8,V2,V9), V9 == V5 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #518: mergings( V3 == V4, V4 == V5; #514 ), references = 1, size of lhs = 10:
% 27.22/27.42 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}(V2,V7,V8), P_multiply-{F}(V4,V8,V9), P_multiply-{F}(V5,V7,V10), P_multiply-{F}(V6,V7,V11), P_least_upper_bound-{F}(V11,V9,V12), V10 == V12 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #522: mergings( V3 == V4, V4 == V5, V5 == V6; #515 ), references = 1, size of lhs = 11:
% 27.22/27.42 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}(V2,V7,V8), P_multiply-{F}(V4,V8,V9), P_multiply-{F}(V6,V10,V9), P_least_upper_bound-{F}(V10,V7,V11), P_multiply-{F}(V6,V11,V12), P_multiply-{F}(V5,V7,V13), V13 == V12 | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #529: mergings( V3 == V4, V4 == V5; #525 ), references = 1, size of lhs = 8:
% 27.22/27.42 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}(V2,V7,V8), P_multiply-{F}(V4,V8,V9), P_multiply-{F}(V5,V7,V10), P_multiply-{F}(V6,V7,V11) | P_least_upper_bound-{T}(V11,V9,V10)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #535: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #526 ), references = 1, size of lhs = 8:
% 27.22/27.42 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_least_upper_bound-{F}(V2,V3,V4), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V3,V6,V7), P_multiply-{F}(V1,V7,V8), P_multiply-{F}(V0,V9,V8), P_multiply-{F}(V5,V6,V10) | P_least_upper_bound-{T}(V6,V9,V10)
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #564: mergings( V2 == V5, V5 == V6, V14 == V16, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11, V3 == V12, V4 == V13, V0 == V16; #551 ), references = 1, size of lhs = 7:
% 27.22/27.42 P_identity-{F}(V0), P_a-{F}(V1), P_inverse-{F}(V1,V2), P_b-{F}(V3), P_multiply-{F}(V0,V3,V3), P_multiply-{F}(V0,V4,V1), P_multiply-{F}(V2,V4,V0) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #581: mergings( V2 == V4, V4 == V5, V11 == V12, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V3 == V12; #570 ), references = 1, size of lhs = 5:
% 27.22/27.42 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1), P_b-{F}(V2), P_multiply-{F}(V0,V2,V2) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #592: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7; #584 ), references = 2, size of lhs = 3:
% 27.22/27.42 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V1,V1) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #595: exists( #22, #593 ), references = 1, size of lhs = 1:
% 27.22/27.42 P_identity-{F}(V0) | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 #597: exists( #18, #594 ), references = 1, size of lhs = 0:
% 27.22/27.42 FALSE | FALSE
% 27.22/27.42 (used 0 times, uses = {})
% 27.22/27.42
% 27.22/27.42 number of learnt formulas = 44
% 27.22/27.42
% 27.22/27.42
% 27.22/27.42 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.22/27.42
% 27.22/27.42 randbase = 1
%------------------------------------------------------------------------------