TSTP Solution File: GRP047-2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP047-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n023.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:04 EDT 2022
% Result : Unsatisfiable 0.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP047-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.31 % Computer : n023.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Fri Jul 22 14:09:35 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.47/0.65 GeoParameters:
% 0.47/0.65
% 0.47/0.65 tptp_input = 1
% 0.47/0.65 tptp_output = 0
% 0.47/0.65 nonempty = 1
% 0.47/0.65 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65
% 0.47/0.65 RuleSystem INPUT:
% 0.47/0.65
% 0.47/0.65 Initial Rules:
% 0.47/0.65 #0: input, references = 11, size of lhs = 2:
% 0.47/0.65 P_identity-{F}(V0), #-{F} V1 | product-{T}(V0,V1,V1)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #1: input, references = 3, size of lhs = 2:
% 0.47/0.65 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | product-{T}(V2,V1,V0)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #2: input, references = 8, size of lhs = 2:
% 0.47/0.65 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3) | product-{T}(V1,V2,V3)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #3: input, references = 4, size of lhs = 3:
% 0.47/0.65 P_identity-{F}(V0), product-{F}(V4,V3,V1), product-{F}(V4,V3,V2) | equalish-{T}(V1,V2)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #4: input, references = 10, size of lhs = 4:
% 0.47/0.65 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.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #5: input, references = 8, size of lhs = 4:
% 0.47/0.65 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.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #6: input, references = 6, size of lhs = 3:
% 0.47/0.65 P_identity-{F}(V0), equalish-{F}(V4,V1), product-{F}(V3,V2,V4) | product-{T}(V3,V2,V1)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #7: input, references = 5, size of lhs = 3:
% 0.47/0.65 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | equalish-{T}(V1,V2)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #8: input, references = 4, size of lhs = 7:
% 0.47/0.65 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_multiply-{F}(V3,V1,V4), P_multiply-{F}(V3,V2,V5), equalish-{F}(V4,V5) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #9: input, references = 4, size of lhs = 0:
% 0.47/0.65 FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #10: input, references = 3, size of lhs = 1:
% 0.47/0.65 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #11: input, references = 8, size of lhs = 2:
% 0.47/0.65 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #12: input, references = 4, size of lhs = 0:
% 0.47/0.65 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #13: input, references = 5, size of lhs = 0:
% 0.47/0.65 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #14: input, references = 5, size of lhs = 0:
% 0.47/0.65 FALSE | EXISTS V0: P_c-{T}(V0)
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 number of initial rules = 15
% 0.47/0.65
% 0.47/0.65 Simplifiers:
% 0.47/0.65 #15: unsound, references = 3, size of lhs = 3:
% 0.47/0.65 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #16: unsound, references = 3, size of lhs = 3:
% 0.47/0.65 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #17: unsound, references = 3, size of lhs = 3:
% 0.47/0.65 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #18: unsound, references = 3, size of lhs = 3:
% 0.47/0.65 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #19: unsound, references = 3, size of lhs = 3:
% 0.47/0.65 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #20: unsound, references = 3, size of lhs = 3:
% 0.47/0.65 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 number of simplifiers = 6
% 0.47/0.65
% 0.47/0.65 Learnt:
% 0.47/0.65 #32: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #26 ), references = 4, size of lhs = 9:
% 0.47/0.65 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_multiply-{F}(V3,V2,V4), product-{F}(V0,V5,V6), product-{F}(V5,V7,V3), product-{F}(V7,V1,V8), product-{F}(V6,V8,V4) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #36: mergings( V3 == V4; #34 ), references = 1, size of lhs = 7:
% 0.47/0.65 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), product-{F}(V0,V4,V3), product-{F}(V4,V5,V3), product-{F}(V5,V1,V2) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #76: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #70 ), references = 1, size of lhs = 9:
% 0.47/0.65 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), product-{F}(V4,V3,V3), product-{F}(V0,V4,V5), product-{F}(V5,V0,V0), product-{F}(V2,V6,V2), product-{F}(V2,V6,V1) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #87: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #79 ), references = 2, size of lhs = 8:
% 0.47/0.65 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), product-{F}(V2,V3,V2), product-{F}(V2,V3,V1), product-{F}(V4,V0,V0), product-{F}(V0,V4,V5), product-{F}(V5,V0,V0) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #106: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6; #100 ), references = 1, size of lhs = 5:
% 0.47/0.65 P_identity-{F}(V0), P_a-{F}(V0), product-{F}(V0,V0,V0), product-{F}(V0,V0,V1), product-{F}(V1,V0,V0) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #163: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #157 ), references = 1, size of lhs = 13:
% 0.47/0.65 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_multiply-{F}(V3,V2,V4), product-{F}(V5,V6,V5), product-{F}(V5,V7,V1), product-{F}(V6,V7,V8), product-{F}(V5,V8,V9), product-{F}(V10,V11,V3), product-{F}(V0,V10,V12), product-{F}(V11,V9,V13), product-{F}(V12,V13,V4) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #174: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10; #166 ), references = 2, size of lhs = 10:
% 0.47/0.65 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), product-{F}(V0,V4,V0), product-{F}(V4,V3,V3), product-{F}(V5,V6,V5), product-{F}(V5,V7,V1), product-{F}(V6,V7,V8), product-{F}(V5,V8,V2) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #178: mergings( V1 == V2; #176 ), references = 2, size of lhs = 8:
% 0.47/0.65 P_identity-{F}(V0), product-{F}(V0,V0,V0), P_a-{F}(V1), P_b-{F}(V2), product-{F}(V3,V4,V3), product-{F}(V3,V5,V1), product-{F}(V4,V5,V6), product-{F}(V3,V6,V2) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #190: mergings( V1 == V2, V2 == V4, V4 == V5, V3 == V6; #185 ), references = 1, size of lhs = 6:
% 0.47/0.65 P_identity-{F}(V0), product-{F}(V0,V0,V0), P_a-{F}(V1), product-{F}(V0,V2,V0), product-{F}(V0,V3,V1), product-{F}(V2,V3,V1) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #196: mergings( V1 == V2, V2 == V3, V3 == V4; #192 ), references = 1, size of lhs = 2:
% 0.47/0.65 P_identity-{F}(V0), product-{F}(V0,V0,V0) | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 #199: exists( #9, #197 ), references = 1, size of lhs = 0:
% 0.47/0.65 FALSE | FALSE
% 0.47/0.65 (used 0 times, uses = {})
% 0.47/0.65
% 0.47/0.65 number of learnt formulas = 11
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65
% 0.47/0.65 randbase = 1
%------------------------------------------------------------------------------