TSTP Solution File: GRP151-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP151-1 : 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:23 EDT 2022
% Result : Unsatisfiable 0.76s 0.96s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP151-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jul 22 13:55:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/0.96 GeoParameters:
% 0.76/0.96
% 0.76/0.96 tptp_input = 1
% 0.76/0.96 tptp_output = 0
% 0.76/0.96 nonempty = 1
% 0.76/0.96 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.76/0.96 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.76/0.96
% 0.76/0.96
% 0.76/0.96 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.76/0.96 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.76/0.96
% 0.76/0.96 RuleSystem INPUT:
% 0.76/0.96
% 0.76/0.96 Initial Rules:
% 0.76/0.96 #0: input, references = 4, size of lhs = 3:
% 0.76/0.96 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #1: input, references = 4, size of lhs = 4:
% 0.76/0.96 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #2: input, references = 4, size of lhs = 6:
% 0.76/0.96 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.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #3: input, references = 4, size of lhs = 4:
% 0.76/0.96 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #4: input, references = 4, size of lhs = 4:
% 0.76/0.96 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #5: input, references = 3, size of lhs = 6:
% 0.76/0.96 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.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #6: input, references = 3, size of lhs = 6:
% 0.76/0.96 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.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #7: input, references = 4, size of lhs = 3:
% 0.76/0.96 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #8: input, references = 4, size of lhs = 3:
% 0.76/0.96 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #9: input, references = 4, size of lhs = 4:
% 0.76/0.96 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #10: input, references = 4, size of lhs = 4:
% 0.76/0.96 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #11: input, references = 3, size of lhs = 7:
% 0.76/0.96 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.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #12: input, references = 4, size of lhs = 7:
% 0.76/0.96 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.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #13: input, references = 3, size of lhs = 7:
% 0.76/0.96 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.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #14: input, references = 4, size of lhs = 7:
% 0.76/0.96 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.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #15: input, references = 4, size of lhs = 5:
% 0.76/0.96 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V1) | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #16: input, references = 6, size of lhs = 2:
% 0.76/0.96 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #17: input, references = 4, size of lhs = 0:
% 0.76/0.96 FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #18: input, references = 3, size of lhs = 1:
% 0.76/0.96 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #19: input, references = 6, size of lhs = 2:
% 0.76/0.96 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #20: input, references = 6, size of lhs = 2:
% 0.76/0.96 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #21: input, references = 4, size of lhs = 0:
% 0.76/0.96 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #22: input, references = 4, size of lhs = 0:
% 0.76/0.96 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 number of initial rules = 23
% 0.76/0.96
% 0.76/0.96 Simplifiers:
% 0.76/0.96 #23: unsound, references = 3, size of lhs = 3:
% 0.76/0.96 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #24: unsound, references = 3, size of lhs = 3:
% 0.76/0.96 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #25: unsound, references = 3, size of lhs = 3:
% 0.76/0.96 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #26: unsound, references = 3, size of lhs = 3:
% 0.76/0.96 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #27: unsound, references = 3, size of lhs = 3:
% 0.76/0.96 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #28: unsound, references = 3, size of lhs = 3:
% 0.76/0.96 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #29: unsound, references = 3, size of lhs = 3:
% 0.76/0.96 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 number of simplifiers = 7
% 0.76/0.96
% 0.76/0.96 Learnt:
% 0.76/0.96 #31: exists( #16, #1 ), references = 1, size of lhs = 2:
% 0.76/0.96 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #34: exists( #19, #8 ), references = 1, size of lhs = 2:
% 0.76/0.96 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #37: exists( #20, #7 ), references = 1, size of lhs = 2:
% 0.76/0.96 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #38: exists( #20, #9 ), references = 1, size of lhs = 2:
% 0.76/0.96 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #40: exists( #16, #0 ), references = 1, size of lhs = 2:
% 0.76/0.96 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #44: exists( #20, #4 ), references = 1, size of lhs = 2:
% 0.76/0.96 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #47: exists( #19, #3 ), references = 1, size of lhs = 2:
% 0.76/0.96 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #48: exists( #19, #10 ), references = 2, size of lhs = 2:
% 0.76/0.96 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V1,V3,V1)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #50: exists( #16, #2 ), references = 1, size of lhs = 4:
% 0.76/0.96 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)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #59: exists( #19, #14 ), references = 1, size of lhs = 5:
% 0.76/0.96 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)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #60: exists( #19, #12 ), references = 1, size of lhs = 5:
% 0.76/0.96 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)
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #79: mergings( V3 == V4; #77 ), references = 1, size of lhs = 3:
% 0.76/0.96 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #82: mergings( V1 == V2; #80 ), references = 1, size of lhs = 2:
% 0.76/0.96 P_identity-{F}(V0), P_a-{F}(V1) | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #85: mergings( V1 == V2; #83 ), references = 1, size of lhs = 1:
% 0.76/0.96 P_identity-{F}(V0) | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 #87: exists( #17, #83 ), references = 1, size of lhs = 0:
% 0.76/0.96 FALSE | FALSE
% 0.76/0.96 (used 0 times, uses = {})
% 0.76/0.96
% 0.76/0.96 number of learnt formulas = 15
% 0.76/0.96
% 0.76/0.96
% 0.76/0.96 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.76/0.96
% 0.76/0.96 randbase = 1
%------------------------------------------------------------------------------