TSTP Solution File: GRP001-4 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP001-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n024.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:55 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP001-4 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n024.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:28:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.41 GeoParameters:
% 0.20/0.41
% 0.20/0.41 tptp_input = 1
% 0.20/0.41 tptp_output = 0
% 0.20/0.41 nonempty = 1
% 0.20/0.41 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41
% 0.20/0.41 RuleSystem INPUT:
% 0.20/0.41
% 0.20/0.41 Initial Rules:
% 0.20/0.41 #0: input, references = 6, size of lhs = 5:
% 0.20/0.41 P_multiply-{F}(V0,V1,V3), P_multiply-{F}(V3,V2,V4), P_multiply-{F}(V1,V2,V5), P_multiply-{F}(V0,V5,V6), V4 == V6 | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #1: input, references = 4, size of lhs = 3:
% 0.20/0.41 P_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V1 | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #2: input, references = 4, size of lhs = 3:
% 0.20/0.41 P_identity-{F}(V0), P_multiply-{F}(V1,V1,V2), V2 == V0 | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #3: input, references = 5, size of lhs = 6:
% 0.20/0.41 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_multiply-{F}(V1,V2,V3), P_c-{F}(V4), V3 == V4 | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #4: input, references = 5, size of lhs = 6:
% 0.20/0.41 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_multiply-{F}(V1,V2,V3), P_c-{F}(V4), P_multiply-{F}(V2,V1,V4) | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #5: input, references = 8, size of lhs = 2:
% 0.20/0.41 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #6: input, references = 4, size of lhs = 0:
% 0.20/0.41 FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #7: input, references = 4, size of lhs = 0:
% 0.20/0.41 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #8: input, references = 5, size of lhs = 0:
% 0.20/0.41 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #9: input, references = 6, size of lhs = 0:
% 0.20/0.41 FALSE | EXISTS V0: P_c-{T}(V0)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 number of initial rules = 10
% 0.20/0.41
% 0.20/0.41 Simplifiers:
% 0.20/0.41 #10: unsound, references = 3, size of lhs = 3:
% 0.20/0.41 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #11: unsound, references = 3, size of lhs = 3:
% 0.20/0.41 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #12: unsound, references = 3, size of lhs = 3:
% 0.20/0.41 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #13: unsound, references = 3, size of lhs = 3:
% 0.20/0.41 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #14: unsound, references = 3, size of lhs = 3:
% 0.20/0.41 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 number of simplifiers = 5
% 0.20/0.41
% 0.20/0.41 Learnt:
% 0.20/0.41 #16: exists( #5, #2 ), references = 6, size of lhs = 2:
% 0.20/0.41 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V1,V1,V0)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #18: exists( #9, #3 ), references = 2, size of lhs = 4:
% 0.20/0.41 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_multiply-{F}(V1,V2,V3) | P_c-{T}(V3)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #22: exists( #5, #1 ), references = 4, size of lhs = 2:
% 0.20/0.41 P_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V1)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #23: exists( #5, #0 ), references = 5, size of lhs = 3:
% 0.20/0.41 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V1,V3,V4), P_multiply-{F}(V0,V4,V5) | P_multiply-{T}(V2,V3,V5)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #25: exists( #5, #4 ), references = 3, size of lhs = 5:
% 0.20/0.41 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_multiply-{F}(V2,V1,V3) | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #27: exists( #5, #3 ), references = 3, size of lhs = 4:
% 0.20/0.41 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3) | P_multiply-{T}(V1,V2,V3)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #30: exists( #9, #28 ), references = 1, size of lhs = 6:
% 0.20/0.41 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_multiply-{F}(V1,V3,V4), P_multiply-{F}(V3,V5,V2), P_multiply-{F}(V4,V5,V6) | P_c-{T}(V6)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #33: exists( #5, #0 ), references = 7, size of lhs = 3:
% 0.20/0.41 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V2,V3,V4), P_multiply-{F}(V1,V3,V5) | P_multiply-{T}(V0,V5,V4)
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #49: mergings( V1 == V2, V2 == V3; #45 ), references = 1, size of lhs = 2:
% 0.20/0.41 P_a-{F}(V0), P_identity-{F}(V0) | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #68: mergings( V1 == V2, V2 == V3; #64 ), references = 2, size of lhs = 8:
% 0.20/0.41 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_multiply-{F}(V1,V1,V3), P_multiply-{F}(V3,V2,V2), P_multiply-{F}(V0,V4,V2), P_multiply-{F}(V2,V4,V5), P_multiply-{F}(V1,V5,V1) | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #73: mergings( V1 == V2, V2 == V5, V3 == V6, V4 == V7; #65 ), references = 1, size of lhs = 8:
% 0.20/0.41 P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_multiply-{F}(V1,V1,V3), P_multiply-{F}(V3,V2,V2), P_multiply-{F}(V0,V4,V2), P_multiply-{F}(V2,V4,V5), P_multiply-{F}(V1,V5,V1) | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #81: mergings( V1 == V2; #78 ), references = 1, size of lhs = 4:
% 0.20/0.41 P_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V1,V1,V0), P_multiply-{F}(V1,V0,V1) | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #91: exists( #7, #87 ), references = 1, size of lhs = 1:
% 0.20/0.41 P_identity-{F}(V0) | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 #94: exists( #6, #89 ), references = 1, size of lhs = 0:
% 0.20/0.41 FALSE | FALSE
% 0.20/0.41 (used 0 times, uses = {})
% 0.20/0.41
% 0.20/0.41 number of learnt formulas = 14
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41
% 0.20/0.41 randbase = 1
%------------------------------------------------------------------------------