TSTP Solution File: GRP155-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP155-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n024.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:23 EDT 2022
% Result : Unsatisfiable 2.47s 2.70s
% Output : Refutation 2.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP155-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jul 22 13:45:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.47/2.70 GeoParameters:
% 2.47/2.70
% 2.47/2.70 tptp_input = 1
% 2.47/2.70 tptp_output = 0
% 2.47/2.70 nonempty = 1
% 2.47/2.70 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/2.70 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 2.47/2.70
% 2.47/2.70
% 2.47/2.70 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/2.70 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/2.70
% 2.47/2.70 RuleSystem INPUT:
% 2.47/2.70
% 2.47/2.70 Initial Rules:
% 2.47/2.70 #0: input, references = 4, size of lhs = 3:
% 2.47/2.70 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #1: input, references = 4, size of lhs = 4:
% 2.47/2.70 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #2: input, references = 6, size of lhs = 6:
% 2.47/2.70 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
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #3: input, references = 4, size of lhs = 4:
% 2.47/2.70 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #4: input, references = 4, size of lhs = 4:
% 2.47/2.70 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #5: input, references = 3, size of lhs = 6:
% 2.47/2.70 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
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #6: input, references = 3, size of lhs = 6:
% 2.47/2.70 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
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #7: input, references = 4, size of lhs = 3:
% 2.47/2.70 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #8: input, references = 4, size of lhs = 3:
% 2.47/2.70 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #9: input, references = 4, size of lhs = 4:
% 2.47/2.70 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #10: input, references = 4, size of lhs = 4:
% 2.47/2.70 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #11: input, references = 4, size of lhs = 7:
% 2.47/2.70 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
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #12: input, references = 4, size of lhs = 7:
% 2.47/2.70 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
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #13: input, references = 4, size of lhs = 7:
% 2.47/2.70 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
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #14: input, references = 4, size of lhs = 7:
% 2.47/2.70 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
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #15: input, references = 4, size of lhs = 5:
% 2.47/2.70 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), V3 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #16: input, references = 5, size of lhs = 8:
% 2.47/2.70 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V2,V4,V6), P_greatest_lower_bound-{F}(V5,V6,V5) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #17: input, references = 13, size of lhs = 2:
% 2.47/2.70 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #18: input, references = 4, size of lhs = 0:
% 2.47/2.70 FALSE | EXISTS V0: P_identity-{T}(V0)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #19: input, references = 5, size of lhs = 1:
% 2.47/2.70 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #20: input, references = 8, size of lhs = 2:
% 2.47/2.70 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #21: input, references = 6, size of lhs = 2:
% 2.47/2.70 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #22: input, references = 4, size of lhs = 0:
% 2.47/2.70 FALSE | EXISTS V0: P_a-{T}(V0)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #23: input, references = 5, size of lhs = 0:
% 2.47/2.70 FALSE | EXISTS V0: P_b-{T}(V0)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #24: input, references = 6, size of lhs = 0:
% 2.47/2.70 FALSE | EXISTS V0: P_c-{T}(V0)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 number of initial rules = 25
% 2.47/2.70
% 2.47/2.70 Simplifiers:
% 2.47/2.70 #25: unsound, references = 3, size of lhs = 3:
% 2.47/2.70 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #26: unsound, references = 3, size of lhs = 3:
% 2.47/2.70 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #27: unsound, references = 3, size of lhs = 3:
% 2.47/2.70 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #28: unsound, references = 3, size of lhs = 3:
% 2.47/2.70 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #29: unsound, references = 3, size of lhs = 3:
% 2.47/2.70 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #30: unsound, references = 3, size of lhs = 3:
% 2.47/2.70 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #31: unsound, references = 3, size of lhs = 3:
% 2.47/2.70 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #32: unsound, references = 3, size of lhs = 3:
% 2.47/2.70 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 number of simplifiers = 8
% 2.47/2.70
% 2.47/2.70 Learnt:
% 2.47/2.70 #34: exists( #17, #1 ), references = 3, size of lhs = 2:
% 2.47/2.70 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #36: exists( #17, #0 ), references = 7, size of lhs = 2:
% 2.47/2.70 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #38: exists( #20, #8 ), references = 2, size of lhs = 2:
% 2.47/2.70 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #41: exists( #21, #7 ), references = 1, size of lhs = 2:
% 2.47/2.70 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #42: exists( #21, #9 ), references = 3, size of lhs = 2:
% 2.47/2.70 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #48: mergings( V1 == V2, V2 == V3; #45 ), references = 1, size of lhs = 4:
% 2.47/2.70 P_a-{F}(V0), P_b-{F}(V0), P_identity-{F}(V0), P_greatest_lower_bound-{F}(V0,V0,V1) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #50: exists( #17, #2 ), references = 2, size of lhs = 4:
% 2.47/2.70 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)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #55: mergings( V2 == V3; #53 ), references = 3, size of lhs = 4:
% 2.47/2.70 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #59: exists( #20, #3 ), references = 3, size of lhs = 2:
% 2.47/2.70 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #61: exists( #17, #12 ), references = 1, size of lhs = 5:
% 2.47/2.70 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)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #64: exists( #21, #11 ), references = 2, size of lhs = 5:
% 2.47/2.70 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)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #65: exists( #21, #13 ), references = 2, size of lhs = 5:
% 2.47/2.70 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)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #68: exists( #21, #4 ), references = 2, size of lhs = 2:
% 2.47/2.70 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #76: exists( #17, #14 ), references = 1, size of lhs = 5:
% 2.47/2.70 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)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #82: mergings( V3 == V4, V4 == V5; #79 ), references = 1, size of lhs = 5:
% 2.47/2.70 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
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #94: mergings( V2 == V0; #91 ), references = 1, size of lhs = 1:
% 2.47/2.70 P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #112: exists( #20, #10 ), references = 2, size of lhs = 2:
% 2.47/2.70 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #129: exists( #20, #15 ), references = 2, size of lhs = 3:
% 2.47/2.70 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | P_greatest_lower_bound-{T}(V1,V2,V1)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #169: exists( #17, #2 ), references = 2, size of lhs = 4:
% 2.47/2.70 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)
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #177: mergings( V3 == V4, V4 == V5, V5 == V6; #173 ), references = 2, size of lhs = 10:
% 2.47/2.70 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V6,V7,V5), P_multiply-{F}(V6,V8,V2), P_multiply-{F}(V8,V4,V9), P_least_upper_bound-{F}(V7,V9,V9) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #204: mergings( V3 == V4, V4 == V5, V5 == V6; #200 ), references = 2, size of lhs = 12:
% 2.47/2.70 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V6,V4,V7), P_multiply-{F}(V8,V6,V9), P_multiply-{F}(V10,V9,V2), P_least_upper_bound-{F}(V9,V11,V9), P_multiply-{F}(V11,V4,V12), P_multiply-{F}(V10,V12,V5) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #217: exists( #17, #204 ), references = 3, size of lhs = 11:
% 2.47/2.70 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V6,V4,V7), P_multiply-{F}(V8,V7,V5), P_least_upper_bound-{F}(V9,V6,V9), P_multiply-{F}(V8,V9,V2), P_multiply-{F}(V10,V11,V9) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #221: mergings( V1 == V2; #219 ), references = 1, size of lhs = 7:
% 2.47/2.70 P_a-{F}(V0), P_identity-{F}(V0), P_b-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V3,V0,V3), P_multiply-{F}(V0,V3,V1), P_multiply-{F}(V4,V5,V3) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #231: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5; #226 ), references = 1, size of lhs = 2:
% 2.47/2.70 P_a-{F}(V0), P_identity-{F}(V0) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #243: mergings( V3 == V4; #240 ), references = 1, size of lhs = 8:
% 2.47/2.70 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_least_upper_bound-{F}(V5,V1,V5), P_multiply-{F}(V0,V5,V2), P_multiply-{F}(V6,V7,V5) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #246: mergings( V1 == V2; #244 ), references = 2, size of lhs = 7:
% 2.47/2.70 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V4,V1,V4), P_multiply-{F}(V0,V4,V2), P_multiply-{F}(V5,V6,V4) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #258: mergings( V1 == V2, V2 == V3, V3 == V4; #254 ), references = 1, size of lhs = 2:
% 2.47/2.70 P_identity-{F}(V0), P_a-{F}(V1) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #263: mergings( V1 == V2, V2 == V3, V3 == V4; #259 ), references = 1, size of lhs = 1:
% 2.47/2.70 P_identity-{F}(V0) | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 #265: exists( #18, #259 ), references = 1, size of lhs = 0:
% 2.47/2.70 FALSE | FALSE
% 2.47/2.70 (used 0 times, uses = {})
% 2.47/2.70
% 2.47/2.70 number of learnt formulas = 29
% 2.47/2.70
% 2.47/2.70
% 2.47/2.70 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/2.70
% 2.47/2.70 randbase = 1
%------------------------------------------------------------------------------