TSTP Solution File: SET196+3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SET196+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n012.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:15:59 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET196+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n012.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 : Sat Jul 23 02:44:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.43 GeoParameters:
% 0.20/0.43
% 0.20/0.43 tptp_input = 1
% 0.20/0.43 tptp_output = 0
% 0.20/0.43 nonempty = 1
% 0.20/0.43 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.43 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.43 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.43
% 0.20/0.43 RuleSystem INPUT:
% 0.20/0.43
% 0.20/0.43 Initial Rules:
% 0.20/0.43 #0: input, references = 5, size of lhs = 2:
% 0.20/0.43 P_intersection-{F}(V0,V1,V3), member-{F}(V2,V3) | pppp0-{T}(V2,V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #1: input, references = 3, size of lhs = 2:
% 0.20/0.43 P_intersection-{F}(V0,V1,V3), pppp0-{F}(V2,V0,V1) | member-{T}(V2,V3)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #2: input, references = 4, size of lhs = 1:
% 0.20/0.43 pppp0-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #3: input, references = 4, size of lhs = 1:
% 0.20/0.43 pppp0-{F}(V0,V1,V2) | member-{T}(V0,V2)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #4: input, references = 3, size of lhs = 2:
% 0.20/0.43 member-{F}(V0,V1), member-{F}(V0,V2) | pppp0-{T}(V0,V1,V2)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #5: input, references = 3, size of lhs = 1:
% 0.20/0.43 subset-{F}(V0,V1) | pppp1-{T}(V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #6: input, references = 4, size of lhs = 1:
% 0.20/0.43 pppp1-{F}(V0,V1) | subset-{T}(V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #7: input, references = 5, size of lhs = 2:
% 0.20/0.43 pppp1-{F}(V0,V1), member-{F}(V2,V0) | member-{T}(V2,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #8: input, references = 6, size of lhs = 2:
% 0.20/0.43 #-{F} V0, #-{F} V1 | pppp1-{T}(V0,V1), pppp7-{T}(V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #9: input, references = 4, size of lhs = 1:
% 0.20/0.43 pppp7-{F}(V0,V1) | EXISTS V2: pppp3-{T}(V2,V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #10: input, references = 4, size of lhs = 2:
% 0.20/0.43 pppp3-{F}(V0,V1,V2), member-{F}(V0,V2) | FALSE
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #11: input, references = 4, size of lhs = 1:
% 0.20/0.43 pppp3-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #12: input, references = 4, size of lhs = 3:
% 0.20/0.43 P_intersection-{F}(V0,V1,V2), P_intersection-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #13: input, references = 3, size of lhs = 1:
% 0.20/0.43 #-{F} V0 | subset-{T}(V0,V0)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #14: input, references = 3, size of lhs = 1:
% 0.20/0.43 #-{F} V1 | pppp2-{T}(V1,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #15: input, references = 3, size of lhs = 2:
% 0.20/0.43 pppp2-{F}(V0,V1), V0 == V1 | FALSE
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #16: input, references = 3, size of lhs = 2:
% 0.20/0.43 pppp2-{F}(V0,V1), member-{F}(V2,V0) | member-{T}(V2,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #17: input, references = 3, size of lhs = 2:
% 0.20/0.43 pppp2-{F}(V0,V1), member-{F}(V2,V1) | member-{T}(V2,V0)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #18: input, references = 4, size of lhs = 2:
% 0.20/0.43 #-{F} V0, #-{F} V1 | pppp2-{T}(V0,V1), pppp8-{T}(V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #19: input, references = 3, size of lhs = 1:
% 0.20/0.43 pppp8-{F}(V0,V1) | EXISTS V2: pppp4-{T}(V2,V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #20: input, references = 7, size of lhs = 3:
% 0.20/0.43 pppp4-{F}(V0,V1,V2), member-{F}(V0,V2), member-{F}(V0,V1) | FALSE
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #21: input, references = 5, size of lhs = 1:
% 0.20/0.43 pppp4-{F}(V0,V1,V2) | member-{T}(V0,V1), member-{T}(V0,V2)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #22: input, references = 4, size of lhs = 0:
% 0.20/0.43 FALSE | EXISTS V0: pppp6-{T}(V0)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #23: input, references = 4, size of lhs = 1:
% 0.20/0.43 pppp6-{F}(V0) | EXISTS V1: pppp5-{T}(V0,V1)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #24: input, references = 4, size of lhs = 3:
% 0.20/0.43 pppp5-{F}(V0,V1), P_intersection-{F}(V0,V1,V2), subset-{F}(V2,V0) | FALSE
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #25: input, references = 5, size of lhs = 2:
% 0.20/0.43 #-{F} V0, #-{F} V1 | EXISTS V2: P_intersection-{T}(V0,V1,V2)
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 number of initial rules = 26
% 0.20/0.43
% 0.20/0.43 Simplifiers:
% 0.20/0.43 #26: unsound, references = 3, size of lhs = 3:
% 0.20/0.43 P_intersection-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.43 (used 0 times, uses = {})
% 0.20/0.43
% 0.20/0.43 #27: unsound, references = 3, size of lhs = 3:
% 0.20/0.43 pppp3-{F}(V0,V1,V2), pppp3-{F}(V3,V1,V2), V0 == V3 | FALSE
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #28: unsound, references = 3, size of lhs = 3:
% 0.20/0.44 pppp4-{F}(V0,V1,V2), pppp4-{F}(V3,V1,V2), V0 == V3 | FALSE
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #29: unsound, references = 3, size of lhs = 3:
% 0.20/0.44 pppp5-{F}(V0,V1), pppp5-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #30: unsound, references = 3, size of lhs = 3:
% 0.20/0.44 pppp5-{F}(V0,V1), pppp5-{F}(V2,V3), V0 == V2 | FALSE
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #31: unsound, references = 3, size of lhs = 3:
% 0.20/0.44 pppp6-{F}(V0), pppp6-{F}(V1), V0 == V1 | FALSE
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 number of simplifiers = 6
% 0.20/0.44
% 0.20/0.44 Learnt:
% 0.20/0.44 #33: disj( #18, input ), references = 1, size of lhs = 3:
% 0.20/0.44 #-{F} V0, #-{F} V1, V0 == V1 | pppp8-{T}(V0,V1)
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #35: exists( #25, #12 ), references = 1, size of lhs = 1:
% 0.20/0.44 P_intersection-{F}(V0,V1,V2) | P_intersection-{T}(V1,V0,V2)
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #40: exists( #9, #38 ), references = 1, size of lhs = 2:
% 0.20/0.44 pppp7-{F}(V0,V1), P_intersection-{F}(V1,V2,V0) | FALSE
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #44: disj( #21, #7+#20 ), references = 3, size of lhs = 3:
% 0.20/0.44 pppp1-{F}(V0,V1), pppp4-{F}(V2,V1,V0), pppp4-{F}(V2,V3,V0) | member-{T}(V2,V3)
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #47: disj( #21, #7+#20 ), references = 1, size of lhs = 3:
% 0.20/0.44 pppp1-{F}(V0,V1), pppp4-{F}(V2,V0,V1), pppp4-{F}(V2,V0,V3) | member-{T}(V2,V3)
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #50: disj( #8, #44+#20 ), references = 1, size of lhs = 4:
% 0.20/0.44 member-{F}(V0,V1), pppp4-{F}(V0,V2,V1), pppp4-{F}(V0,V2,V3), pppp4-{F}(V0,V4,V3) | pppp7-{T}(V3,V4)
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #55: disj( #8, #44+#0+#3+#20 ), references = 1, size of lhs = 4:
% 0.20/0.44 pppp4-{F}(V0,V1,V2), pppp4-{F}(V0,V3,V2), pppp4-{F}(V0,V3,V4), P_intersection-{F}(V5,V4,V3) | pppp7-{T}(V2,V1)
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #57: disj( #8, exists( #9, #38 ) ), references = 2, size of lhs = 1:
% 0.20/0.44 P_intersection-{F}(V0,V1,V2) | pppp1-{T}(V2,V0)
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #61: exists( #25, #59 ), references = 1, size of lhs = 1:
% 0.20/0.44 pppp5-{F}(V0,V1) | FALSE
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #63: exists( #23, #60 ), references = 1, size of lhs = 1:
% 0.20/0.44 pppp6-{F}(V0) | FALSE
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 #65: exists( #22, #62 ), references = 1, size of lhs = 0:
% 0.20/0.44 FALSE | FALSE
% 0.20/0.44 (used 0 times, uses = {})
% 0.20/0.44
% 0.20/0.44 number of learnt formulas = 11
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44
% 0.20/0.44 randbase = 1
%------------------------------------------------------------------------------