TSTP Solution File: GRP171-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP171-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n015.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 2.29s 2.51s
% Output : Refutation 2.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : GRP171-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jul 22 14:20:51 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.29/2.51 GeoParameters:
% 2.29/2.51
% 2.29/2.51 tptp_input = 1
% 2.29/2.51 tptp_output = 0
% 2.29/2.51 nonempty = 1
% 2.29/2.51 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.29/2.51 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 2.29/2.51
% 2.29/2.51
% 2.29/2.51 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.29/2.51 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.29/2.51
% 2.29/2.51 RuleSystem INPUT:
% 2.29/2.51
% 2.29/2.51 Initial Rules:
% 2.29/2.51 #0: input, references = 4, size of lhs = 3:
% 2.29/2.51 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #1: input, references = 4, size of lhs = 4:
% 2.29/2.51 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #2: input, references = 6, size of lhs = 6:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #3: input, references = 4, size of lhs = 4:
% 2.29/2.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #4: input, references = 4, size of lhs = 4:
% 2.29/2.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #5: input, references = 4, size of lhs = 6:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #6: input, references = 3, size of lhs = 6:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #7: input, references = 4, size of lhs = 3:
% 2.29/2.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #8: input, references = 4, size of lhs = 3:
% 2.29/2.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #9: input, references = 4, size of lhs = 4:
% 2.29/2.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #10: input, references = 4, size of lhs = 4:
% 2.29/2.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #11: input, references = 3, size of lhs = 7:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #12: input, references = 4, size of lhs = 7:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #13: input, references = 3, size of lhs = 7:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #14: input, references = 4, size of lhs = 7:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #15: input, references = 4, size of lhs = 4:
% 2.29/2.51 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), V2 == V1 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #16: input, references = 4, size of lhs = 6:
% 2.29/2.51 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), V4 == V3 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #17: input, references = 5, size of lhs = 7:
% 2.29/2.51 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_multiply-{F}(V1,V3,V5), P_least_upper_bound-{F}(V0,V5,V5) | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #18: input, references = 9, size of lhs = 2:
% 2.29/2.51 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #19: input, references = 4, size of lhs = 0:
% 2.29/2.51 FALSE | EXISTS V0: P_identity-{T}(V0)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #20: input, references = 5, size of lhs = 1:
% 2.29/2.51 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #21: input, references = 7, size of lhs = 2:
% 2.29/2.51 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #22: input, references = 7, size of lhs = 2:
% 2.29/2.51 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #23: input, references = 4, size of lhs = 0:
% 2.29/2.51 FALSE | EXISTS V0: P_a-{T}(V0)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #24: input, references = 5, size of lhs = 0:
% 2.29/2.51 FALSE | EXISTS V0: P_b-{T}(V0)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 number of initial rules = 25
% 2.29/2.51
% 2.29/2.51 Simplifiers:
% 2.29/2.51 #25: unsound, references = 3, size of lhs = 3:
% 2.29/2.51 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #26: unsound, references = 3, size of lhs = 3:
% 2.29/2.51 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #27: unsound, references = 3, size of lhs = 3:
% 2.29/2.51 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #28: unsound, references = 3, size of lhs = 3:
% 2.29/2.51 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #29: unsound, references = 3, size of lhs = 3:
% 2.29/2.51 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #30: unsound, references = 3, size of lhs = 3:
% 2.29/2.51 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #31: unsound, references = 3, size of lhs = 3:
% 2.29/2.51 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 number of simplifiers = 7
% 2.29/2.51
% 2.29/2.51 Learnt:
% 2.29/2.51 #33: exists( #18, #1 ), references = 3, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #36: exists( #21, #8 ), references = 1, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #39: exists( #22, #7 ), references = 1, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #40: exists( #22, #9 ), references = 2, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #42: exists( #18, #0 ), references = 5, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #46: exists( #22, #4 ), references = 2, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #49: exists( #21, #3 ), references = 3, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #50: exists( #21, #10 ), references = 3, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #52: exists( #18, #2 ), references = 2, size of lhs = 4:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #61: exists( #21, #14 ), references = 2, size of lhs = 5:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #62: exists( #21, #12 ), references = 1, size of lhs = 5:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #79: exists( #22, #16 ), references = 2, size of lhs = 4:
% 2.29/2.51 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3) | P_least_upper_bound-{T}(V0,V3,V3)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #86: mergings( V1 == V3, V3 == V2, V4 == V5; #82 ), references = 1, size of lhs = 3:
% 2.29/2.51 P_a-{F}(V0), P_identity-{F}(V0), P_least_upper_bound-{F}(V0,V0,V1) | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #109: exists( #18, #2 ), references = 2, size of lhs = 4:
% 2.29/2.51 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.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #115: exists( #22, #15 ), references = 1, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), P_a-{F}(V1) | P_least_upper_bound-{T}(V0,V1,V1)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #147: mergings( V2 == V3, V3 == V4; #144 ), references = 1, size of lhs = 6:
% 2.29/2.51 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
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #151: mergings( V3 == V4, V4 == V5; #148 ), references = 2, size of lhs = 4:
% 2.29/2.51 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)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #165: exists( #21, #5 ), references = 2, size of lhs = 4:
% 2.29/2.51 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)
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #179: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9; #172 ), references = 2, size of lhs = 12:
% 2.29/2.51 P_identity-{F}(V0), P_a-{F}(V1), P_least_upper_bound-{F}(V0,V1,V2), P_b-{F}(V3), P_least_upper_bound-{F}(V0,V3,V4), P_multiply-{F}(V5,V6,V1), P_multiply-{F}(V6,V3,V7), P_greatest_lower_bound-{F}(V8,V5,V9), P_multiply-{F}(V9,V7,V10), P_multiply-{F}(V8,V7,V11), P_greatest_lower_bound-{F}(V10,V12,V0), P_greatest_lower_bound-{F}(V11,V12,V13) | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #192: mergings( V2 == V3, V3 == V4; #189 ), references = 2, size of lhs = 13:
% 2.29/2.51 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V0,V2,V1), P_least_upper_bound-{F}(V0,V1,V3), P_b-{F}(V4), P_least_upper_bound-{F}(V0,V4,V5), P_multiply-{F}(V0,V6,V0), P_multiply-{F}(V6,V4,V7), P_greatest_lower_bound-{F}(V8,V1,V9), P_multiply-{F}(V9,V7,V10), P_multiply-{F}(V8,V7,V11), P_greatest_lower_bound-{F}(V10,V12,V0), P_greatest_lower_bound-{F}(V11,V12,V13) | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #206: mergings( V1 == V3, V3 == V4, V4 == V5, V2 == V7, V6 == V9; #200 ), references = 1, size of lhs = 6:
% 2.29/2.51 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0), P_a-{F}(V1), P_greatest_lower_bound-{F}(V0,V1,V0), P_multiply-{F}(V0,V2,V1), P_least_upper_bound-{F}(V0,V1,V3) | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #214: mergings( V1 == V2, V2 == V3, V3 == V4; #210 ), references = 1, size of lhs = 2:
% 2.29/2.51 P_identity-{F}(V0), P_multiply-{F}(V0,V0,V0) | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 #217: exists( #19, #215 ), references = 1, size of lhs = 0:
% 2.29/2.51 FALSE | FALSE
% 2.29/2.51 (used 0 times, uses = {})
% 2.29/2.51
% 2.29/2.51 number of learnt formulas = 23
% 2.29/2.51
% 2.29/2.51
% 2.29/2.51 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.29/2.51
% 2.29/2.51 randbase = 1
%------------------------------------------------------------------------------