TSTP Solution File: GRP152-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP152-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n006.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.99s 1.17s
% Output : Refutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP152-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n006.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:41:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.99/1.17 GeoParameters:
% 0.99/1.17
% 0.99/1.17 tptp_input = 1
% 0.99/1.17 tptp_output = 0
% 0.99/1.17 nonempty = 1
% 0.99/1.17 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.99/1.17 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.99/1.17
% 0.99/1.17
% 0.99/1.17 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.99/1.17 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.99/1.17
% 0.99/1.17 RuleSystem INPUT:
% 0.99/1.17
% 0.99/1.17 Initial Rules:
% 0.99/1.17 #0: input, references = 4, size of lhs = 3:
% 0.99/1.17 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #1: input, references = 5, size of lhs = 4:
% 0.99/1.17 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V3), V3 == V0 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #2: input, references = 6, size of lhs = 6:
% 0.99/1.17 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.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #3: input, references = 4, size of lhs = 4:
% 0.99/1.17 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #4: input, references = 4, size of lhs = 4:
% 0.99/1.17 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V2,V1,V4), V3 == V4 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #5: input, references = 3, size of lhs = 6:
% 0.99/1.17 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.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #6: input, references = 4, size of lhs = 6:
% 0.99/1.17 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.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #7: input, references = 4, size of lhs = 3:
% 0.99/1.17 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #8: input, references = 4, size of lhs = 3:
% 0.99/1.17 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #9: input, references = 4, size of lhs = 4:
% 0.99/1.17 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_least_upper_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #10: input, references = 5, size of lhs = 4:
% 0.99/1.17 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3), P_greatest_lower_bound-{F}(V1,V3,V4), V4 == V1 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #11: input, references = 4, size of lhs = 7:
% 0.99/1.17 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.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #12: input, references = 4, size of lhs = 7:
% 0.99/1.17 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.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #13: input, references = 4, size of lhs = 7:
% 0.99/1.17 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.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #14: input, references = 4, size of lhs = 7:
% 0.99/1.17 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.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #15: input, references = 4, size of lhs = 5:
% 0.99/1.17 P_identity-{F}(V0), P_b-{F}(V1), P_a-{F}(V2), P_least_upper_bound-{F}(V2,V1,V3), P_least_upper_bound-{F}(V1,V3,V3) | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #16: input, references = 9, size of lhs = 2:
% 0.99/1.17 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #17: input, references = 4, size of lhs = 0:
% 0.99/1.17 FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #18: input, references = 5, size of lhs = 1:
% 0.99/1.17 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #19: input, references = 7, size of lhs = 2:
% 0.99/1.17 #-{F} V0, #-{F} V1 | EXISTS V2: P_greatest_lower_bound-{T}(V0,V1,V2)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #20: input, references = 7, size of lhs = 2:
% 0.99/1.17 #-{F} V0, #-{F} V1 | EXISTS V2: P_least_upper_bound-{T}(V0,V1,V2)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #21: input, references = 4, size of lhs = 0:
% 0.99/1.17 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #22: input, references = 4, size of lhs = 0:
% 0.99/1.17 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 number of initial rules = 23
% 0.99/1.17
% 0.99/1.17 Simplifiers:
% 0.99/1.17 #23: unsound, references = 3, size of lhs = 3:
% 0.99/1.17 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #24: unsound, references = 3, size of lhs = 3:
% 0.99/1.17 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #25: unsound, references = 3, size of lhs = 3:
% 0.99/1.17 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #26: unsound, references = 3, size of lhs = 3:
% 0.99/1.17 P_greatest_lower_bound-{F}(V0,V1,V2), P_greatest_lower_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #27: unsound, references = 3, size of lhs = 3:
% 0.99/1.17 P_least_upper_bound-{F}(V0,V1,V2), P_least_upper_bound-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #28: unsound, references = 3, size of lhs = 3:
% 0.99/1.17 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #29: unsound, references = 3, size of lhs = 3:
% 0.99/1.17 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 number of simplifiers = 7
% 0.99/1.17
% 0.99/1.17 Learnt:
% 0.99/1.17 #31: exists( #16, #1 ), references = 4, size of lhs = 2:
% 0.99/1.17 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_multiply-{T}(V2,V1,V0)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #34: exists( #19, #8 ), references = 2, size of lhs = 2:
% 0.99/1.17 P_identity-{F}(V0), #-{F} V1 | P_greatest_lower_bound-{T}(V1,V1,V1)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #37: exists( #20, #7 ), references = 1, size of lhs = 2:
% 0.99/1.17 P_identity-{F}(V0), #-{F} V1 | P_least_upper_bound-{T}(V1,V1,V1)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #38: exists( #20, #9 ), references = 2, size of lhs = 2:
% 0.99/1.17 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V1,V3,V1)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #40: exists( #16, #2 ), references = 7, size of lhs = 4:
% 0.99/1.17 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.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #44: mergings( V3 == V4; #42 ), references = 13, size of lhs = 3:
% 0.99/1.17 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_multiply-{F}(V2,V3,V4) | P_multiply-{T}(V1,V4,V3)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #46: exists( #19, #3 ), references = 3, size of lhs = 2:
% 0.99/1.17 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V2,V1,V3)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #50: exists( #20, #4 ), references = 3, size of lhs = 2:
% 0.99/1.17 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_least_upper_bound-{T}(V2,V1,V3)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #55: exists( #16, #12 ), references = 2, size of lhs = 5:
% 0.99/1.17 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_multiply-{F}(V4,V1,V5), P_multiply-{F}(V4,V2,V6), P_greatest_lower_bound-{F}(V5,V6,V7) | P_multiply-{T}(V4,V3,V7)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #58: exists( #16, #14 ), references = 2, size of lhs = 5:
% 0.99/1.17 P_identity-{F}(V0), P_greatest_lower_bound-{F}(V1,V2,V3), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V2,V4,V6), P_greatest_lower_bound-{F}(V5,V6,V7) | P_multiply-{T}(V3,V4,V7)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #62: mergings( V2 == V3; #60 ), references = 1, size of lhs = 4:
% 0.99/1.17 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0, P_multiply-{F}(V3,V1,V3) | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #79: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11; #70 ), references = 1, size of lhs = 8:
% 0.99/1.17 P_identity-{F}(V0), P_multiply-{F}(V1,V1,V0), P_multiply-{F}(V2,V2,V2), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V1,V3,V2), P_multiply-{F}(V3,V3,V2), P_multiply-{F}(V2,V3,V3), P_multiply-{F}(V3,V2,V3) | P_greatest_lower_bound-{T}(V3,V2,V0)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #107: exists( #20, #13 ), references = 3, size of lhs = 5:
% 0.99/1.17 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.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #155: mergings( V3 == V4, V4 == V5; #150 ), references = 1, size of lhs = 4:
% 0.99/1.17 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_multiply-{F}(V3,V1,V0), P_inverse-{F}(V4,V3) | P_multiply-{T}(V2,V4,V0)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #160: mergings( V5 == V8, V3 == V4, V4 == V8, V8 == V6; #151 ), references = 1, size of lhs = 3:
% 0.99/1.17 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_multiply-{F}(V3,V1,V0) | P_multiply-{T}(V2,V1,V0)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #163: mergings( V3 == V4, V4 == V5; #152 ), references = 1, size of lhs = 7:
% 0.99/1.17 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_multiply-{F}(V3,V1,V0), P_multiply-{F}(V3,V4,V5), P_least_upper_bound-{F}(V4,V6,V7), P_multiply-{F}(V3,V6,V8), P_least_upper_bound-{F}(V5,V8,V9) | P_multiply-{T}(V2,V7,V9)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #190: mergings( V5 == V15, V2 == V3, V3 == V4, V4 == V15, V15 == V6, V6 == V7, V7 == V8, V8 == V9; #180 ), references = 1, size of lhs = 9:
% 0.99/1.17 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V0,V0), P_multiply-{F}(V2,V3,V0), P_least_upper_bound-{F}(V1,V3,V4), V4 == V3, P_multiply-{F}(V2,V5,V0), P_multiply-{F}(V6,V5,V0), P_least_upper_bound-{F}(V5,V0,V7), P_multiply-{F}(V2,V7,V5) | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #199: mergings( V5 == V14, V2 == V3, V3 == V4, V4 == V14, V14 == V6, V6 == V7, V7 == V8, V8 == V9; #181 ), references = 1, size of lhs = 8:
% 0.99/1.17 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_greatest_lower_bound-{F}(V0,V2,V3), V3 == V0, P_multiply-{F}(V1,V4,V0), P_multiply-{F}(V5,V4,V0), P_least_upper_bound-{F}(V4,V0,V6), P_multiply-{F}(V1,V6,V4) | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #217: mergings( V3 == V4; #215 ), references = 2, size of lhs = 2:
% 0.99/1.17 P_identity-{F}(V0), P_least_upper_bound-{F}(V1,V2,V3) | P_greatest_lower_bound-{T}(V3,V1,V1)
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #229: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #224 ), references = 1, size of lhs = 3:
% 0.99/1.17 P_identity-{F}(V0), P_b-{F}(V1), P_a-{F}(V2) | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #235: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5; #230 ), references = 1, size of lhs = 2:
% 0.99/1.17 P_identity-{F}(V0), P_b-{F}(V1) | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #241: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5; #236 ), references = 1, size of lhs = 1:
% 0.99/1.17 P_identity-{F}(V0) | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 #243: exists( #17, #236 ), references = 1, size of lhs = 0:
% 0.99/1.17 FALSE | FALSE
% 0.99/1.17 (used 0 times, uses = {})
% 0.99/1.17
% 0.99/1.17 number of learnt formulas = 23
% 0.99/1.17
% 0.99/1.17
% 0.99/1.17 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.99/1.17
% 0.99/1.17 randbase = 1
%------------------------------------------------------------------------------