TSTP Solution File: GRP189-2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP189-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n017.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 2.14s 2.32s
% Output : Refutation 2.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP189-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n017.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:49:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.14/2.32 GeoParameters:
% 2.14/2.32
% 2.14/2.32 tptp_input = 1
% 2.14/2.32 tptp_output = 0
% 2.14/2.32 nonempty = 1
% 2.14/2.32 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.14/2.32 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 2.14/2.32
% 2.14/2.32
% 2.14/2.32 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.14/2.32 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.14/2.32
% 2.14/2.32 RuleSystem INPUT:
% 2.14/2.32
% 2.14/2.32 Initial Rules:
% 2.14/2.32 #0: input, references = 4, size of lhs = 3:
% 2.14/2.32 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #1: input, references = 4, size of lhs = 4:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #2: input, references = 4, size of lhs = 6:
% 2.14/2.32 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.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #3: input, references = 4, size of lhs = 4:
% 2.14/2.32 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #4: input, references = 4, size of lhs = 4:
% 2.14/2.32 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #5: input, references = 3, size of lhs = 6:
% 2.14/2.32 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.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #6: input, references = 4, size of lhs = 6:
% 2.14/2.32 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.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #7: input, references = 3, size of lhs = 3:
% 2.14/2.32 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #8: input, references = 4, size of lhs = 3:
% 2.14/2.32 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #9: input, references = 4, size of lhs = 4:
% 2.14/2.32 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #10: input, references = 4, size of lhs = 4:
% 2.14/2.32 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #11: input, references = 4, size of lhs = 7:
% 2.14/2.32 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.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #12: input, references = 5, size of lhs = 7:
% 2.14/2.32 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.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #13: input, references = 3, size of lhs = 7:
% 2.14/2.32 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.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #14: input, references = 4, size of lhs = 7:
% 2.14/2.32 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.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #15: input, references = 4, size of lhs = 3:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), V1 == V0 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #16: input, references = 4, size of lhs = 5:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), P_inverse-{F}(V2,V3), P_inverse-{F}(V3,V4), V4 == V2 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #17: input, references = 4, size of lhs = 8:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), P_multiply-{F}(V2,V3,V4), P_inverse-{F}(V4,V5), P_inverse-{F}(V3,V6), P_inverse-{F}(V2,V7), P_multiply-{F}(V6,V7,V8), V5 == V8 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #18: input, references = 4, size of lhs = 6:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), P_b-{F}(V2), P_a-{F}(V3), P_least_upper_bound-{F}(V3,V2,V4), P_greatest_lower_bound-{F}(V2,V4,V2) | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #19: input, references = 7, size of lhs = 2:
% 2.14/2.32 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #20: input, references = 4, size of lhs = 0:
% 2.14/2.32 FALSE | EXISTS V0: P_identity-{T}(V0)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #21: input, references = 6, size of lhs = 1:
% 2.14/2.32 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #22: input, references = 7, size of lhs = 2:
% 2.14/2.32 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #23: input, references = 6, size of lhs = 2:
% 2.14/2.32 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #24: input, references = 4, size of lhs = 0:
% 2.14/2.32 FALSE | EXISTS V0: P_b-{T}(V0)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #25: input, references = 4, size of lhs = 0:
% 2.14/2.32 FALSE | EXISTS V0: P_a-{T}(V0)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 number of initial rules = 26
% 2.14/2.32
% 2.14/2.32 Simplifiers:
% 2.14/2.32 #26: unsound, references = 3, size of lhs = 3:
% 2.14/2.32 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #27: unsound, references = 3, size of lhs = 3:
% 2.14/2.32 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #28: unsound, references = 3, size of lhs = 3:
% 2.14/2.32 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #29: unsound, references = 3, size of lhs = 3:
% 2.14/2.32 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #30: unsound, references = 3, size of lhs = 3:
% 2.14/2.32 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #31: unsound, references = 3, size of lhs = 3:
% 2.14/2.32 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #32: unsound, references = 3, size of lhs = 3:
% 2.14/2.32 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 number of simplifiers = 7
% 2.14/2.32
% 2.14/2.32 Learnt:
% 2.14/2.32 #34: exists( #21, #15 ), references = 1, size of lhs = 1:
% 2.14/2.32 P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #36: exists( #23, #9 ), references = 2, size of lhs = 2:
% 2.14/2.32 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #40: exists( #22, #8 ), references = 1, size of lhs = 2:
% 2.14/2.32 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #41: exists( #22, #12 ), references = 1, size of lhs = 5:
% 2.14/2.32 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)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #42: exists( #22, #14 ), references = 3, size of lhs = 5:
% 2.14/2.32 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)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #46: exists( #22, #3 ), references = 2, size of lhs = 2:
% 2.14/2.32 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #48: exists( #21, #16 ), references = 2, size of lhs = 3:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), P_inverse-{F}(V2,V3) | P_inverse-{T}(V3,V2)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #52: exists( #19, #0 ), references = 2, size of lhs = 2:
% 2.14/2.32 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #53: exists( #19, #1 ), references = 2, size of lhs = 2:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #56: exists( #19, #2 ), references = 3, size of lhs = 4:
% 2.14/2.32 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.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #57: exists( #19, #17 ), references = 1, size of lhs = 6:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), P_inverse-{F}(V2,V3), P_multiply-{F}(V4,V2,V5), P_inverse-{F}(V5,V6), P_inverse-{F}(V4,V7) | P_multiply-{T}(V3,V7,V6)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #66: exists( #23, #4 ), references = 3, size of lhs = 2:
% 2.14/2.32 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #67: exists( #23, #11 ), references = 3, size of lhs = 5:
% 2.14/2.32 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.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #86: mergings( V3 == V4, V4 == V5, V5 == V6; #82 ), references = 2, size of lhs = 8:
% 2.14/2.32 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), V7 == V6 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #128: mergings( V2 == V3, V3 == V5, V5 == V6; #124 ), references = 1, size of lhs = 6:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), P_multiply-{F}(V2,V2,V0), P_multiply-{F}(V2,V0,V3), V3 == V0, P_greatest_lower_bound-{F}(V2,V0,V4) | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #133: mergings( V1 == V3, V3 == V5, V5 == V6; #129 ), references = 1, size of lhs = 5:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), P_multiply-{F}(V2,V2,V0), P_multiply-{F}(V2,V0,V3), V3 == V0 | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #164: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9; #157 ), references = 1, size of lhs = 11:
% 2.14/2.32 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V4,V5), P_multiply-{F}(V2,V6,V7), P_multiply-{F}(V1,V8,V7), P_multiply-{F}(V5,V9,V8), P_multiply-{F}(V3,V9,V10), P_multiply-{F}(V4,V9,V11), P_least_upper_bound-{F}(V6,V12,V9), P_multiply-{F}(V2,V12,V13), P_least_upper_bound-{F}(V13,V8,V10) | P_multiply-{T}(V2,V9,V10)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #172: exists( #22, #10 ), references = 2, size of lhs = 2:
% 2.14/2.32 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #203: mergings( V3 == V4, V4 == V5; #200 ), references = 1, size of lhs = 4:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), P_b-{F}(V2), P_a-{F}(V3) | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #207: mergings( V1 == V2, V2 == V3; #204 ), references = 1, size of lhs = 3:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1), P_b-{F}(V2) | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #211: mergings( V1 == V2, V2 == V3; #208 ), references = 1, size of lhs = 2:
% 2.14/2.32 P_identity-{F}(V0), P_inverse-{F}(V0,V1) | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 #214: exists( #20, #212 ), references = 1, size of lhs = 0:
% 2.14/2.32 FALSE | FALSE
% 2.14/2.32 (used 0 times, uses = {})
% 2.14/2.32
% 2.14/2.32 number of learnt formulas = 22
% 2.14/2.32
% 2.14/2.32
% 2.14/2.32 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.14/2.32
% 2.14/2.32 randbase = 1
%------------------------------------------------------------------------------