TSTP Solution File: GRP162-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP162-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:24 EDT 2022
% Result : Unsatisfiable 0.85s 1.08s
% Output : Refutation 0.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP162-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/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 13:36:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.85/1.08 GeoParameters:
% 0.85/1.08
% 0.85/1.08 tptp_input = 1
% 0.85/1.08 tptp_output = 0
% 0.85/1.08 nonempty = 1
% 0.85/1.08 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.08 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.85/1.08
% 0.85/1.08
% 0.85/1.08 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.08 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.08
% 0.85/1.08 RuleSystem INPUT:
% 0.85/1.08
% 0.85/1.08 Initial Rules:
% 0.85/1.08 #0: input, references = 4, size of lhs = 3:
% 0.85/1.08 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #1: input, references = 4, size of lhs = 4:
% 0.85/1.08 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #2: input, references = 5, size of lhs = 6:
% 0.85/1.08 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
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #3: input, references = 4, size of lhs = 4:
% 0.85/1.08 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #4: input, references = 4, size of lhs = 4:
% 0.85/1.08 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #5: input, references = 3, size of lhs = 6:
% 0.85/1.08 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
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #6: input, references = 4, size of lhs = 6:
% 0.85/1.08 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
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #7: input, references = 4, size of lhs = 3:
% 0.85/1.08 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #8: input, references = 4, size of lhs = 3:
% 0.85/1.08 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #9: input, references = 4, size of lhs = 4:
% 0.85/1.08 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #10: input, references = 3, size of lhs = 4:
% 0.85/1.08 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #11: input, references = 4, size of lhs = 7:
% 0.85/1.08 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
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #12: input, references = 3, size of lhs = 7:
% 0.85/1.08 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
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #13: input, references = 4, size of lhs = 7:
% 0.85/1.08 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
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #14: input, references = 3, size of lhs = 7:
% 0.85/1.08 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
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #15: input, references = 4, size of lhs = 5:
% 0.85/1.08 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_least_upper_bound-{F}(V1,V2,V3), V3 == V2 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #16: input, references = 4, size of lhs = 7:
% 0.85/1.08 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_least_upper_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_least_upper_bound-{F}(V2,V4,V5), V5 == V4 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #17: input, references = 5, size of lhs = 7:
% 0.85/1.08 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_least_upper_bound-{F}(V1,V2,V3), P_c-{F}(V4), P_least_upper_bound-{F}(V2,V4,V5), P_least_upper_bound-{F}(V1,V4,V4) | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #18: input, references = 6, size of lhs = 2:
% 0.85/1.08 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #19: input, references = 4, size of lhs = 0:
% 0.85/1.08 FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #20: input, references = 4, size of lhs = 1:
% 0.85/1.08 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #21: input, references = 5, size of lhs = 2:
% 0.85/1.08 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #22: input, references = 9, size of lhs = 2:
% 0.85/1.08 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #23: input, references = 4, size of lhs = 0:
% 0.85/1.08 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #24: input, references = 4, size of lhs = 0:
% 0.85/1.08 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #25: input, references = 5, size of lhs = 0:
% 0.85/1.08 FALSE | EXISTS V0: P_c-{T}(V0)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 number of initial rules = 26
% 0.85/1.08
% 0.85/1.08 Simplifiers:
% 0.85/1.08 #26: unsound, references = 3, size of lhs = 3:
% 0.85/1.08 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #27: unsound, references = 3, size of lhs = 3:
% 0.85/1.08 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #28: unsound, references = 3, size of lhs = 3:
% 0.85/1.08 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #29: unsound, references = 3, size of lhs = 3:
% 0.85/1.08 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #30: unsound, references = 3, size of lhs = 3:
% 0.85/1.08 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #31: unsound, references = 3, size of lhs = 3:
% 0.85/1.08 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #32: unsound, references = 3, size of lhs = 3:
% 0.85/1.08 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #33: unsound, references = 3, size of lhs = 3:
% 0.85/1.08 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 number of simplifiers = 8
% 0.85/1.08
% 0.85/1.08 Learnt:
% 0.85/1.08 #35: exists( #18, #1 ), references = 2, size of lhs = 2:
% 0.85/1.08 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #37: exists( #18, #0 ), references = 1, size of lhs = 2:
% 0.85/1.08 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #39: exists( #21, #8 ), references = 1, size of lhs = 2:
% 0.85/1.08 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #42: exists( #22, #7 ), references = 1, size of lhs = 2:
% 0.85/1.08 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #43: exists( #22, #9 ), references = 1, size of lhs = 2:
% 0.85/1.08 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #46: exists( #18, #2 ), references = 1, size of lhs = 4:
% 0.85/1.08 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)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #51: mergings( V2 == V3; #49 ), references = 1, size of lhs = 4:
% 0.85/1.08 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #55: exists( #21, #3 ), references = 1, size of lhs = 2:
% 0.85/1.08 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #64: exists( #22, #4 ), references = 4, size of lhs = 2:
% 0.85/1.08 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #65: exists( #22, #11 ), references = 1, size of lhs = 5:
% 0.85/1.08 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)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #81: exists( #22, #13 ), references = 1, size of lhs = 5:
% 0.85/1.08 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)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #105: exists( #22, #16 ), references = 2, size of lhs = 5:
% 0.85/1.08 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_least_upper_bound-{F}(V1,V2,V3), P_c-{F}(V4) | P_least_upper_bound-{T}(V2,V4,V4)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #111: mergings( V1 == V3, V2 == V4, V5 == V6; #107 ), references = 1, size of lhs = 4:
% 0.85/1.08 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V1), P_least_upper_bound-{F}(V1,V1,V2) | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #126: exists( #22, #15 ), references = 1, size of lhs = 3:
% 0.85/1.08 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | P_least_upper_bound-{T}(V1,V2,V2)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #129: exists( #22, #6 ), references = 1, size of lhs = 4:
% 0.85/1.08 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V4,V3,V5), P_least_upper_bound-{F}(V4,V1,V6) | P_least_upper_bound-{T}(V6,V2,V5)
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #141: mergings( V1 == V3, V3 == V4, V4 == V5, V5 == V6, V2 == V7, V9 == V10; #134 ), references = 1, size of lhs = 5:
% 0.85/1.08 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_least_upper_bound-{F}(V2,V1,V2), P_least_upper_bound-{F}(V1,V2,V3) | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #151: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7; #144 ), references = 1, size of lhs = 2:
% 0.85/1.08 P_identity-{F}(V0), P_a-{F}(V1) | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #159: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7; #152 ), references = 1, size of lhs = 1:
% 0.85/1.08 P_identity-{F}(V0) | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 #161: exists( #19, #152 ), references = 1, size of lhs = 0:
% 0.85/1.08 FALSE | FALSE
% 0.85/1.08 (used 0 times, uses = {})
% 0.85/1.08
% 0.85/1.08 number of learnt formulas = 19
% 0.85/1.08
% 0.85/1.08
% 0.85/1.08 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.08
% 0.85/1.08 randbase = 1
%------------------------------------------------------------------------------