TSTP Solution File: GRP549-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP549-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n028.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:04:05 EDT 2022
% Result : Unsatisfiable 0.12s 0.38s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP549-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n028.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 14:44:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.38 GeoParameters:
% 0.12/0.38
% 0.12/0.38 tptp_input = 1
% 0.12/0.38 tptp_output = 0
% 0.12/0.38 nonempty = 1
% 0.12/0.38 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38
% 0.12/0.38 RuleSystem INPUT:
% 0.12/0.38
% 0.12/0.38 Initial Rules:
% 0.12/0.38 #0: input, references = 4, size of lhs = 7:
% 0.12/0.38 P_identity-{F}(V0), P_divide-{F}(V0,V1,V4), P_divide-{F}(V2,V1,V5), P_divide-{F}(V5,V3,V6), P_divide-{F}(V6,V2,V7), P_divide-{F}(V4,V7,V8), V8 == V3 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #1: input, references = 4, size of lhs = 5:
% 0.12/0.38 P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_divide-{F}(V0,V2,V4), P_divide-{F}(V1,V4,V5), V3 == V5 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #2: input, references = 5, size of lhs = 4:
% 0.12/0.38 P_identity-{F}(V0), P_inverse-{F}(V1,V2), P_divide-{F}(V0,V1,V3), V2 == V3 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #3: input, references = 4, size of lhs = 3:
% 0.12/0.38 P_identity-{F}(V0), P_divide-{F}(V1,V1,V2), V0 == V2 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #4: input, references = 5, size of lhs = 7:
% 0.12/0.38 P_identity-{F}(V0), P_a1-{F}(V1), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V6), P_b1-{F}(V4), P_inverse-{F}(V4,V5), P_multiply-{F}(V5,V4,V6) | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #5: input, references = 6, size of lhs = 2:
% 0.12/0.38 #-{F} V0, #-{F} V1 | EXISTS V2: P_divide-{T}(V0,V1,V2)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #6: input, references = 4, size of lhs = 0:
% 0.12/0.38 FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #7: input, references = 5, size of lhs = 2:
% 0.12/0.38 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #8: input, references = 7, size of lhs = 1:
% 0.12/0.38 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #9: input, references = 4, size of lhs = 0:
% 0.12/0.38 FALSE | EXISTS V0: P_a1-{T}(V0)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #10: input, references = 4, size of lhs = 0:
% 0.12/0.38 FALSE | EXISTS V0: P_b1-{T}(V0)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 number of initial rules = 11
% 0.12/0.38
% 0.12/0.38 Simplifiers:
% 0.12/0.38 #11: unsound, references = 3, size of lhs = 3:
% 0.12/0.38 P_divide-{F}(V0,V1,V2), P_divide-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #12: unsound, references = 3, size of lhs = 3:
% 0.12/0.38 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #13: unsound, references = 3, size of lhs = 3:
% 0.12/0.38 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #14: unsound, references = 3, size of lhs = 3:
% 0.12/0.38 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #15: unsound, references = 3, size of lhs = 3:
% 0.12/0.38 P_a1-{F}(V0), P_a1-{F}(V1), V0 == V1 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #16: unsound, references = 3, size of lhs = 3:
% 0.12/0.38 P_b1-{F}(V0), P_b1-{F}(V1), V0 == V1 | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 number of simplifiers = 6
% 0.12/0.38
% 0.12/0.38 Learnt:
% 0.12/0.38 #18: exists( #5, #3 ), references = 3, size of lhs = 2:
% 0.12/0.38 P_identity-{F}(V0), #-{F} V1 | P_divide-{T}(V1,V1,V0)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #20: exists( #7, #4 ), references = 1, size of lhs = 4:
% 0.12/0.38 P_identity-{F}(V0), P_a1-{F}(V1), P_b1-{F}(V1), P_inverse-{F}(V1,V2) | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #22: exists( #8, #19 ), references = 1, size of lhs = 3:
% 0.12/0.38 P_identity-{F}(V0), P_a1-{F}(V1), P_b1-{F}(V1) | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #24: exists( #8, #2 ), references = 1, size of lhs = 2:
% 0.12/0.38 P_identity-{F}(V0), P_divide-{F}(V0,V1,V2) | P_inverse-{T}(V1,V2)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #26: exists( #5, #2 ), references = 3, size of lhs = 2:
% 0.12/0.38 P_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_divide-{T}(V0,V1,V2)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #28: exists( #7, #1 ), references = 3, size of lhs = 3:
% 0.12/0.38 P_identity-{F}(V0), P_divide-{F}(V0,V1,V2), P_divide-{F}(V3,V2,V4) | P_multiply-{T}(V3,V1,V4)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #37: mergings( V2 == V3, V3 == V4; #34 ), references = 1, size of lhs = 5:
% 0.12/0.38 P_identity-{F}(V0), P_a1-{F}(V1), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V0), P_b1-{F}(V3) | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #41: mergings( V1 == V2, V2 == V3; #38 ), references = 2, size of lhs = 4:
% 0.12/0.38 P_identity-{F}(V0), P_a1-{F}(V1), P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V0) | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #44: exists( #5, #0 ), references = 1, size of lhs = 5:
% 0.12/0.38 P_identity-{F}(V0), P_divide-{F}(V0,V1,V2), P_divide-{F}(V3,V1,V4), P_divide-{F}(V4,V5,V6), P_divide-{F}(V6,V3,V7) | P_divide-{T}(V2,V7,V5)
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #65: mergings( V2 == V3; #61 ), references = 1, size of lhs = 2:
% 0.12/0.38 P_identity-{F}(V0), P_a1-{F}(V1) | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #68: mergings( V1 == V2; #66 ), references = 1, size of lhs = 1:
% 0.12/0.38 P_identity-{F}(V0) | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 #70: exists( #6, #66 ), references = 1, size of lhs = 0:
% 0.12/0.38 FALSE | FALSE
% 0.12/0.38 (used 0 times, uses = {})
% 0.12/0.38
% 0.12/0.38 number of learnt formulas = 12
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38
% 0.12/0.38 randbase = 1
%------------------------------------------------------------------------------