TSTP Solution File: GRP012-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP012-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n027.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:02:57 EDT 2022
% Result : Unsatisfiable 0.47s 0.63s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP012-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jul 22 14:37:31 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.47/0.63 GeoParameters:
% 0.47/0.63
% 0.47/0.63 tptp_input = 1
% 0.47/0.63 tptp_output = 0
% 0.47/0.63 nonempty = 1
% 0.47/0.63 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.63 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.63 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.63
% 0.47/0.63 RuleSystem INPUT:
% 0.47/0.63
% 0.47/0.63 Initial Rules:
% 0.47/0.63 #0: input, references = 6, size of lhs = 2:
% 0.47/0.63 P_identity-{F}(V0), #-{F} V1 | product-{T}(V0,V1,V1)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #1: input, references = 6, size of lhs = 2:
% 0.47/0.63 P_identity-{F}(V0), #-{F} V1 | product-{T}(V1,V0,V1)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #2: input, references = 5, size of lhs = 2:
% 0.47/0.63 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | product-{T}(V2,V1,V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #3: input, references = 10, size of lhs = 2:
% 0.47/0.63 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | product-{T}(V1,V2,V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #4: input, references = 7, size of lhs = 2:
% 0.47/0.63 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3) | product-{T}(V1,V2,V3)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #5: input, references = 11, size of lhs = 4:
% 0.47/0.63 P_identity-{F}(V0), product-{F}(V4,V3,V1), product-{F}(V4,V3,V2), V1 == V2 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #6: input, references = 7, size of lhs = 4:
% 0.47/0.63 P_identity-{F}(V0), product-{F}(V3,V1,V2), product-{F}(V5,V1,V4), product-{F}(V6,V5,V3) | product-{T}(V6,V4,V2)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #7: input, references = 6, size of lhs = 4:
% 0.47/0.63 P_identity-{F}(V0), product-{F}(V5,V1,V4), product-{F}(V6,V5,V3), product-{F}(V6,V4,V2) | product-{T}(V3,V1,V2)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #8: input, references = 5, size of lhs = 4:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3) | product-{T}(V1,V2,V3)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #9: input, references = 5, size of lhs = 7:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_inverse-{F}(V2,V4), P_inverse-{F}(V1,V5), P_d-{F}(V6) | product-{T}(V4,V5,V6)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #10: input, references = 6, size of lhs = 8:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_inverse-{F}(V2,V4), P_inverse-{F}(V1,V5), P_d-{F}(V6), product-{F}(V3,V6,V0) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #11: input, references = 4, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #12: input, references = 11, size of lhs = 1:
% 0.47/0.63 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #13: input, references = 5, size of lhs = 2:
% 0.47/0.63 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #14: input, references = 4, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #15: input, references = 5, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #16: input, references = 5, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_c-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #17: input, references = 5, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_d-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 number of initial rules = 18
% 0.47/0.63
% 0.47/0.63 Simplifiers:
% 0.47/0.63 #18: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #19: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #20: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #21: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #22: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #23: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #24: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_d-{F}(V0), P_d-{F}(V1), V0 == V1 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 number of simplifiers = 7
% 0.47/0.63
% 0.47/0.63 Learnt:
% 0.47/0.63 #26: exists( #12, #10 ), references = 3, size of lhs = 7:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_inverse-{F}(V2,V4), P_d-{F}(V5), product-{F}(V3,V5,V0) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #36: mergings( V0 == V2, V2 == V3; #33 ), references = 1, size of lhs = 1:
% 0.47/0.63 P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #40: mergings( V1 == V7; #38 ), references = 3, size of lhs = 7:
% 0.47/0.63 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_inverse-{F}(V1,V3), P_inverse-{F}(V0,V4), P_identity-{F}(V5), product-{F}(V3,V4,V6) | P_d-{T}(V6)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #46: mergings( V1 == V4; #44 ), references = 2, size of lhs = 4:
% 0.47/0.63 P_a-{F}(V0), P_b-{F}(V1), P_identity-{F}(V2), product-{F}(V0,V1,V3) | P_c-{T}(V3)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #55: mergings( V3 == V4; #53 ), references = 1, size of lhs = 2:
% 0.47/0.63 P_identity-{F}(V0), product-{F}(V1,V2,V3) | P_multiply-{T}(V1,V2,V3)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #80: mergings( V2 == V5, V5 == V6, V3 == V7, V4 == V0; #74 ), references = 1, size of lhs = 5:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_inverse-{F}(V1,V0), P_b-{F}(V2), P_c-{F}(V2) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #93: mergings( V1 == V2, V2 == V3, V3 == V5, V5 == V6, V6 == V4, V4 == V7; #85 ), references = 1, size of lhs = 3:
% 0.47/0.63 P_identity-{F}(V0), P_inverse-{F}(V0,V0), P_a-{F}(V0) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #119: mergings( V2 == V5, V5 == V6, V3 == V7, V6 == V8, V4 == V0; #113 ), references = 1, size of lhs = 5:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_c-{F}(V1), P_b-{F}(V2), P_inverse-{F}(V2,V0) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #132: mergings( V2 == V3, V3 == V4, V4 == V5; #128 ), references = 1, size of lhs = 3:
% 0.47/0.63 P_identity-{F}(V0), product-{F}(V1,V2,V0), product-{F}(V0,V2,V3) | P_inverse-{T}(V1,V3)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #149: mergings( V2 == V3, V3 == V4; #146 ), references = 1, size of lhs = 4:
% 0.47/0.63 P_identity-{F}(V0), product-{F}(V1,V2,V2), product-{F}(V1,V0,V3), V3 == V0 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #162: mergings( V2 == V3, V3 == V8, V8 == V9; #158 ), references = 4, size of lhs = 8:
% 0.47/0.63 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_inverse-{F}(V1,V3), P_d-{F}(V4), P_identity-{F}(V5), product-{F}(V6,V3,V5), product-{F}(V6,V4,V7) | P_inverse-{T}(V0,V7)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #205: mergings( V3 == V7, V7 == V8, V8 == V9, V4 == V11, V6 == V13, V5 == V12; #196 ), references = 1, size of lhs = 8:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), product-{F}(V1,V4,V3), P_inverse-{F}(V2,V5), product-{F}(V4,V5,V0), P_d-{F}(V6) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #213: mergings( V3 == V8, V8 == V9, V9 == V10, V4 == V11, V5 == V12, V7 == V14, V6 == V13; #197 ), references = 1, size of lhs = 8:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), product-{F}(V1,V4,V3), P_inverse-{F}(V2,V5), product-{F}(V4,V5,V0), P_d-{F}(V6) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #219: mergings( V3 == V4, V4 == V9, V9 == V10, V10 == V11, V11 == V12; #198 ), references = 1, size of lhs = 12:
% 0.47/0.63 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_inverse-{F}(V1,V3), P_d-{F}(V4), P_identity-{F}(V5), product-{F}(V6,V3,V5), product-{F}(V4,V7,V8), product-{F}(V6,V8,V9), product-{F}(V5,V7,V10), product-{F}(V0,V9,V11), V11 == V10 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #231: mergings( V2 == V4, V4 == V5, V5 == V6, V3 == V8; #224 ), references = 1, size of lhs = 6:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), product-{F}(V1,V2,V3), P_d-{F}(V4) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #238: mergings( V1 == V3, V3 == V4, V4 == V5, V2 == V8; #232 ), references = 1, size of lhs = 5:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), product-{F}(V1,V2,V3) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #247: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5; #241 ), references = 1, size of lhs = 3:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #254: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5; #248 ), references = 1, size of lhs = 2:
% 0.47/0.63 P_identity-{F}(V0), P_a-{F}(V1) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #261: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5; #255 ), references = 1, size of lhs = 1:
% 0.47/0.63 P_identity-{F}(V0) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #264: exists( #11, #255 ), references = 1, size of lhs = 0:
% 0.47/0.63 FALSE | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 number of learnt formulas = 20
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.63
% 0.47/0.63 randbase = 1
%------------------------------------------------------------------------------