TSTP Solution File: GRP166-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP166-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n018.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:25 EDT 2022
% Result : Unsatisfiable 3.57s 3.79s
% Output : Refutation 3.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP166-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n018.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:33:26 EDT 2022
% 0.18/0.33 % CPUTime :
% 3.57/3.79 GeoParameters:
% 3.57/3.79
% 3.57/3.79 tptp_input = 1
% 3.57/3.79 tptp_output = 0
% 3.57/3.79 nonempty = 1
% 3.57/3.79 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.57/3.79 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 3.57/3.79
% 3.57/3.79
% 3.57/3.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.57/3.79 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.57/3.79
% 3.57/3.79 RuleSystem INPUT:
% 3.57/3.79
% 3.57/3.79 Initial Rules:
% 3.57/3.79 #0: input, references = 4, size of lhs = 3:
% 3.57/3.79 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #1: input, references = 4, size of lhs = 4:
% 3.57/3.79 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #2: input, references = 7, size of lhs = 6:
% 3.57/3.79 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
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #3: input, references = 5, size of lhs = 4:
% 3.57/3.79 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #4: input, references = 4, size of lhs = 4:
% 3.57/3.79 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #5: input, references = 4, size of lhs = 6:
% 3.57/3.79 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
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #6: input, references = 3, size of lhs = 6:
% 3.57/3.79 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
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #7: input, references = 4, size of lhs = 3:
% 3.57/3.79 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #8: input, references = 4, size of lhs = 3:
% 3.57/3.79 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #9: input, references = 4, size of lhs = 4:
% 3.57/3.79 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #10: input, references = 4, size of lhs = 4:
% 3.57/3.79 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #11: input, references = 3, size of lhs = 7:
% 3.57/3.79 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
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #12: input, references = 5, size of lhs = 7:
% 3.57/3.79 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
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #13: input, references = 3, size of lhs = 7:
% 3.57/3.79 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
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #14: input, references = 5, size of lhs = 7:
% 3.57/3.79 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
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #15: input, references = 4, size of lhs = 4:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V1,V0,V2), V2 == V1 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #16: input, references = 4, size of lhs = 6:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V1,V0,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V3,V0,V4), V4 == V3 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #17: input, references = 7, size of lhs = 7:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V1,V0,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V3,V0,V4), P_multiply-{F}(V1,V3,V5), P_least_upper_bound-{F}(V1,V5,V5) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #18: input, references = 12, size of lhs = 2:
% 3.57/3.79 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #19: input, references = 4, size of lhs = 0:
% 3.57/3.79 FALSE | EXISTS V0: P_identity-{T}(V0)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #20: input, references = 8, size of lhs = 1:
% 3.57/3.79 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #21: input, references = 6, size of lhs = 2:
% 3.57/3.79 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #22: input, references = 7, size of lhs = 2:
% 3.57/3.79 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #23: input, references = 4, size of lhs = 0:
% 3.57/3.79 FALSE | EXISTS V0: P_a-{T}(V0)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #24: input, references = 5, size of lhs = 0:
% 3.57/3.79 FALSE | EXISTS V0: P_b-{T}(V0)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 number of initial rules = 25
% 3.57/3.79
% 3.57/3.79 Simplifiers:
% 3.57/3.79 #25: unsound, references = 3, size of lhs = 3:
% 3.57/3.79 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #26: unsound, references = 3, size of lhs = 3:
% 3.57/3.79 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #27: unsound, references = 3, size of lhs = 3:
% 3.57/3.79 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #28: unsound, references = 3, size of lhs = 3:
% 3.57/3.79 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #29: unsound, references = 3, size of lhs = 3:
% 3.57/3.79 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #30: unsound, references = 3, size of lhs = 3:
% 3.57/3.79 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #31: unsound, references = 3, size of lhs = 3:
% 3.57/3.79 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 number of simplifiers = 7
% 3.57/3.79
% 3.57/3.79 Learnt:
% 3.57/3.79 #33: exists( #18, #1 ), references = 7, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #36: exists( #21, #8 ), references = 1, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #39: exists( #22, #7 ), references = 1, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #40: exists( #22, #9 ), references = 3, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #42: exists( #22, #16 ), references = 3, size of lhs = 4:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V1,V0,V2), P_b-{F}(V3) | P_least_upper_bound-{T}(V3,V0,V3)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #46: exists( #22, #4 ), references = 7, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #50: exists( #18, #0 ), references = 4, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #58: mergings( V2 == V3, V1 == V3, V4 == V5; #54 ), references = 1, size of lhs = 3:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V0), P_least_upper_bound-{F}(V0,V0,V1) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #60: exists( #18, #2 ), references = 7, size of lhs = 4:
% 3.57/3.79 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)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #68: exists( #21, #12 ), references = 5, size of lhs = 5:
% 3.57/3.79 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)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #69: exists( #21, #14 ), references = 7, size of lhs = 5:
% 3.57/3.79 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)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #90: mergings( V3 == V4, V4 == V5, V5 == V6; #84 ), references = 1, size of lhs = 8:
% 3.57/3.79 P_identity-{F}(V0), P_multiply-{F}(V1,V1,V2), P_multiply-{F}(V2,V3,V3), P_multiply-{F}(V4,V3,V3), P_greatest_lower_bound-{F}(V1,V4,V5), P_multiply-{F}(V5,V3,V6), P_multiply-{F}(V1,V6,V7), V6 == V7 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #94: mergings( V3 == V4, V4 == V5, V5 == V6; #85 ), references = 1, size of lhs = 11:
% 3.57/3.79 P_identity-{F}(V0), P_multiply-{F}(V1,V1,V2), P_greatest_lower_bound-{F}(V1,V3,V4), P_multiply-{F}(V3,V5,V5), P_multiply-{F}(V2,V5,V6), P_multiply-{F}(V4,V5,V7), P_multiply-{F}(V1,V7,V8), P_multiply-{F}(V9,V5,V6), P_greatest_lower_bound-{F}(V9,V1,V10), P_multiply-{F}(V10,V5,V11), V8 == V11 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #98: mergings( V3 == V4, V4 == V5, V5 == V6; #86 ), references = 1, size of lhs = 11:
% 3.57/3.79 P_identity-{F}(V0), P_multiply-{F}(V1,V1,V2), P_greatest_lower_bound-{F}(V1,V3,V4), P_multiply-{F}(V3,V5,V5), P_multiply-{F}(V2,V5,V6), P_multiply-{F}(V4,V5,V7), P_multiply-{F}(V1,V7,V8), P_multiply-{F}(V9,V5,V6), P_greatest_lower_bound-{F}(V9,V1,V10), P_multiply-{F}(V10,V5,V11), V11 == V8 | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #121: mergings( V3 == V0; #119 ), references = 2, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1) | P_least_upper_bound-{T}(V0,V1,V1)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #129: exists( #18, #2 ), references = 1, size of lhs = 4:
% 3.57/3.79 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)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #139: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #134 ), references = 2, size of lhs = 10:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V1,V0,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V3,V0,V4), P_multiply-{F}(V5,V6,V1), P_multiply-{F}(V6,V3,V7), P_multiply-{F}(V8,V7,V1), P_greatest_lower_bound-{F}(V5,V9,V8), P_multiply-{F}(V9,V7,V10) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #145: exists( #21, #10 ), references = 2, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #146: exists( #21, #3 ), references = 3, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #160: mergings( V2 == V3; #158 ), references = 2, size of lhs = 4:
% 3.57/3.79 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #183: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V11 == V13; #177 ), references = 1, size of lhs = 7:
% 3.57/3.79 P_identity-{F}(V0), P_multiply-{F}(V1,V1,V2), P_greatest_lower_bound-{F}(V3,V1,V4), P_multiply-{F}(V4,V5,V5), P_multiply-{F}(V3,V5,V5), P_multiply-{F}(V2,V5,V6), P_greatest_lower_bound-{F}(V7,V5,V6) | P_multiply-{T}(V1,V5,V6)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #203: mergings( V2 == V3, V3 == V4; #200 ), references = 1, size of lhs = 6:
% 3.57/3.79 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
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #207: mergings( V3 == V4, V4 == V5; #204 ), references = 4, size of lhs = 4:
% 3.57/3.79 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)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #216: mergings( V2 == V0; #214 ), references = 1, size of lhs = 1:
% 3.57/3.79 P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #225: mergings( V2 == V3, V3 == V4; #221 ), references = 1, size of lhs = 8:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V1,V1,V1), P_multiply-{F}(V0,V2,V1), P_least_upper_bound-{F}(V1,V0,V3), P_b-{F}(V4), P_multiply-{F}(V0,V4,V0), P_least_upper_bound-{F}(V4,V0,V5) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #228: mergings( V2 == V3, V3 == V4; #222 ), references = 1, size of lhs = 9:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V1,V1,V1), P_multiply-{F}(V0,V2,V1), P_least_upper_bound-{F}(V1,V0,V3), P_b-{F}(V4), P_least_upper_bound-{F}(V4,V0,V5), P_multiply-{F}(V6,V4,V6), P_multiply-{F}(V0,V6,V0) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #244: mergings( V3 == V4, V4 == V5, V5 == V6; #240 ), references = 1, size of lhs = 8:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V1,V0,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V3,V0,V4), P_multiply-{F}(V1,V5,V1), P_greatest_lower_bound-{F}(V3,V6,V5), P_multiply-{F}(V1,V6,V7) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #253: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7; #247 ), references = 1, size of lhs = 8:
% 3.57/3.79 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_least_upper_bound-{F}(V1,V0,V3), P_b-{F}(V4), P_least_upper_bound-{F}(V4,V0,V5), P_greatest_lower_bound-{F}(V4,V6,V6), P_multiply-{F}(V0,V6,V0) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #269: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V1 == V12, V11 == V14; #258 ), references = 2, size of lhs = 5:
% 3.57/3.79 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_least_upper_bound-{F}(V1,V0,V3) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #277: mergings( V1 == V2; #275 ), references = 1, size of lhs = 2:
% 3.57/3.79 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0) | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 #280: exists( #19, #278 ), references = 1, size of lhs = 0:
% 3.57/3.79 FALSE | FALSE
% 3.57/3.79 (used 0 times, uses = {})
% 3.57/3.79
% 3.57/3.79 number of learnt formulas = 31
% 3.57/3.79
% 3.57/3.79
% 3.57/3.79 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.57/3.79
% 3.57/3.79 randbase = 1
%------------------------------------------------------------------------------