TSTP Solution File: SET175+3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SET175+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n010.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:57 EDT 2022
% Result : Theorem 1.16s 1.35s
% Output : Refutation 1.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET175+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n010.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 01:57:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.16/1.35 GeoParameters:
% 1.16/1.35
% 1.16/1.35 tptp_input = 1
% 1.16/1.35 tptp_output = 0
% 1.16/1.35 nonempty = 1
% 1.16/1.35 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.16/1.35 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 1.16/1.35
% 1.16/1.35
% 1.16/1.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.16/1.35 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.16/1.35
% 1.16/1.35 RuleSystem INPUT:
% 1.16/1.35
% 1.16/1.35 Initial Rules:
% 1.16/1.35 #0: input, references = 5, size of lhs = 2:
% 1.16/1.35 P_union-{F}(V0,V1,V3), member-{F}(V2,V3) | pppp0-{T}(V2,V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #1: input, references = 5, size of lhs = 2:
% 1.16/1.35 P_union-{F}(V0,V1,V3), pppp0-{F}(V2,V0,V1) | member-{T}(V2,V3)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #2: input, references = 4, size of lhs = 1:
% 1.16/1.35 pppp0-{F}(V0,V1,V2) | member-{T}(V0,V1), member-{T}(V0,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #3: input, references = 5, size of lhs = 2:
% 1.16/1.35 #-{F} V2, member-{F}(V0,V1) | pppp0-{T}(V0,V1,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #4: input, references = 3, size of lhs = 2:
% 1.16/1.35 #-{F} V1, member-{F}(V0,V2) | pppp0-{T}(V0,V1,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #5: input, references = 6, size of lhs = 2:
% 1.16/1.35 P_intersection-{F}(V0,V1,V3), member-{F}(V2,V3) | pppp1-{T}(V2,V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #6: input, references = 3, size of lhs = 2:
% 1.16/1.35 P_intersection-{F}(V0,V1,V3), pppp1-{F}(V2,V0,V1) | member-{T}(V2,V3)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #7: input, references = 6, size of lhs = 1:
% 1.16/1.35 pppp1-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #8: input, references = 3, size of lhs = 1:
% 1.16/1.35 pppp1-{F}(V0,V1,V2) | member-{T}(V0,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #9: input, references = 3, size of lhs = 2:
% 1.16/1.35 member-{F}(V0,V1), member-{F}(V0,V2) | pppp1-{T}(V0,V1,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #10: input, references = 3, size of lhs = 1:
% 1.16/1.35 #-{F} V1 | pppp2-{T}(V1,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #11: input, references = 4, size of lhs = 2:
% 1.16/1.35 pppp2-{F}(V0,V1), V0 == V1 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #12: input, references = 3, size of lhs = 1:
% 1.16/1.35 pppp2-{F}(V0,V1) | subset-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #13: input, references = 3, size of lhs = 1:
% 1.16/1.35 pppp2-{F}(V0,V1) | subset-{T}(V1,V0)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #14: input, references = 4, size of lhs = 2:
% 1.16/1.35 subset-{F}(V0,V1), subset-{F}(V1,V0) | pppp2-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #15: input, references = 4, size of lhs = 3:
% 1.16/1.35 P_union-{F}(V0,V1,V2), P_union-{F}(V1,V0,V3), V2 == V3 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #16: input, references = 4, size of lhs = 3:
% 1.16/1.35 P_intersection-{F}(V0,V1,V2), P_intersection-{F}(V1,V0,V3), V2 == V3 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #17: input, references = 3, size of lhs = 1:
% 1.16/1.35 subset-{F}(V0,V1) | pppp3-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #18: input, references = 4, size of lhs = 1:
% 1.16/1.35 pppp3-{F}(V0,V1) | subset-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #19: input, references = 6, size of lhs = 2:
% 1.16/1.35 pppp3-{F}(V0,V1), member-{F}(V2,V0) | member-{T}(V2,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #20: input, references = 8, size of lhs = 2:
% 1.16/1.35 #-{F} V0, #-{F} V1 | pppp3-{T}(V0,V1), pppp9-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #21: input, references = 5, size of lhs = 1:
% 1.16/1.35 pppp9-{F}(V0,V1) | EXISTS V2: pppp5-{T}(V2,V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #22: input, references = 5, size of lhs = 2:
% 1.16/1.35 pppp5-{F}(V0,V1,V2), member-{F}(V0,V2) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #23: input, references = 5, size of lhs = 1:
% 1.16/1.35 pppp5-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #24: input, references = 3, size of lhs = 1:
% 1.16/1.35 #-{F} V0 | subset-{T}(V0,V0)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #25: input, references = 3, size of lhs = 1:
% 1.16/1.35 #-{F} V1 | pppp4-{T}(V1,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #26: input, references = 3, size of lhs = 2:
% 1.16/1.35 pppp4-{F}(V0,V1), V0 == V1 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #27: input, references = 3, size of lhs = 2:
% 1.16/1.35 pppp4-{F}(V0,V1), member-{F}(V2,V0) | member-{T}(V2,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #28: input, references = 3, size of lhs = 2:
% 1.16/1.35 pppp4-{F}(V0,V1), member-{F}(V2,V1) | member-{T}(V2,V0)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #29: input, references = 4, size of lhs = 2:
% 1.16/1.35 #-{F} V0, #-{F} V1 | pppp4-{T}(V0,V1), pppp10-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #30: input, references = 6, size of lhs = 1:
% 1.16/1.35 pppp10-{F}(V0,V1) | EXISTS V2: pppp6-{T}(V2,V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #31: input, references = 10, size of lhs = 3:
% 1.16/1.35 pppp6-{F}(V0,V1,V2), member-{F}(V0,V2), member-{F}(V0,V1) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #32: input, references = 6, size of lhs = 1:
% 1.16/1.35 pppp6-{F}(V0,V1,V2) | member-{T}(V0,V1), member-{T}(V0,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #33: input, references = 4, size of lhs = 0:
% 1.16/1.35 FALSE | EXISTS V0: pppp8-{T}(V0)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #34: input, references = 4, size of lhs = 1:
% 1.16/1.35 pppp8-{F}(V0) | EXISTS V1: pppp7-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #35: input, references = 4, size of lhs = 3:
% 1.16/1.35 pppp7-{F}(V0,V1), P_intersection-{F}(V0,V1,V2), P_union-{F}(V0,V2,V0) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #36: input, references = 6, size of lhs = 2:
% 1.16/1.35 #-{F} V0, #-{F} V1 | EXISTS V2: P_union-{T}(V0,V1,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #37: input, references = 5, size of lhs = 2:
% 1.16/1.35 #-{F} V0, #-{F} V1 | EXISTS V2: P_intersection-{T}(V0,V1,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 number of initial rules = 38
% 1.16/1.35
% 1.16/1.35 Simplifiers:
% 1.16/1.35 #38: unsound, references = 3, size of lhs = 3:
% 1.16/1.35 P_union-{F}(V0,V1,V2), P_union-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #39: unsound, references = 3, size of lhs = 3:
% 1.16/1.35 P_intersection-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #40: unsound, references = 3, size of lhs = 3:
% 1.16/1.35 pppp5-{F}(V0,V1,V2), pppp5-{F}(V3,V1,V2), V0 == V3 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #41: unsound, references = 3, size of lhs = 3:
% 1.16/1.35 pppp6-{F}(V0,V1,V2), pppp6-{F}(V3,V1,V2), V0 == V3 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #42: unsound, references = 3, size of lhs = 3:
% 1.16/1.35 pppp7-{F}(V0,V1), pppp7-{F}(V0,V3), V1 == V3 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #43: unsound, references = 3, size of lhs = 3:
% 1.16/1.35 pppp7-{F}(V0,V1), pppp7-{F}(V2,V3), V0 == V2 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #44: unsound, references = 3, size of lhs = 3:
% 1.16/1.35 pppp8-{F}(V0), pppp8-{F}(V1), V0 == V1 | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 number of simplifiers = 7
% 1.16/1.35
% 1.16/1.35 Learnt:
% 1.16/1.35 #46: disj( #29, input ), references = 3, size of lhs = 3:
% 1.16/1.35 #-{F} V0, #-{F} V1, V0 == V1 | pppp10-{T}(V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #50: disj( #32, #3+#1+#31 ), references = 3, size of lhs = 3:
% 1.16/1.35 pppp6-{F}(V0,V1,V2), pppp6-{F}(V0,V1,V3), P_union-{F}(V1,V4,V3) | member-{T}(V0,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #55: exists( #30, #53 ), references = 1, size of lhs = 3:
% 1.16/1.35 pppp10-{F}(V0,V1), P_union-{F}(V0,V2,V1), P_intersection-{F}(V0,V3,V1) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #58: exists( #36, #15 ), references = 1, size of lhs = 1:
% 1.16/1.35 P_union-{F}(V0,V1,V2) | P_union-{T}(V1,V0,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #66: exists( #37, #16 ), references = 2, size of lhs = 1:
% 1.16/1.35 P_intersection-{F}(V0,V1,V2) | P_intersection-{T}(V1,V0,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #72: disj( #2, input ), references = 2, size of lhs = 3:
% 1.16/1.35 member-{F}(V0,V1), pppp6-{F}(V0,V2,V1), pppp0-{F}(V0,V2,V3) | member-{T}(V0,V3)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #77: exists( #30, #75 ), references = 2, size of lhs = 3:
% 1.16/1.35 pppp10-{F}(V0,V1), P_union-{F}(V0,V0,V1), P_union-{F}(V0,V2,V1) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #80: exists( #36, #78 ), references = 1, size of lhs = 1:
% 1.16/1.35 #-{F} V0 | P_union-{T}(V0,V0,V0)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #83: disj( #20, #19+#31 ), references = 1, size of lhs = 3:
% 1.16/1.35 member-{F}(V0,V1), member-{F}(V0,V2), pppp6-{F}(V0,V3,V2) | pppp9-{T}(V1,V3)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #92: exists( #21, #90 ), references = 1, size of lhs = 2:
% 1.16/1.35 pppp9-{F}(V0,V1), P_union-{F}(V0,V2,V1) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #97: disj( #32, #5+#7+#31 ), references = 1, size of lhs = 3:
% 1.16/1.35 pppp6-{F}(V0,V1,V2), pppp6-{F}(V0,V1,V3), P_intersection-{F}(V3,V4,V1) | member-{T}(V0,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #103: exists( #21, #101 ), references = 1, size of lhs = 2:
% 1.16/1.35 pppp9-{F}(V0,V1), P_intersection-{F}(V1,V2,V0) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #106: disj( #20, exists( #21, #90 ) ), references = 1, size of lhs = 1:
% 1.16/1.35 P_union-{F}(V0,V1,V2) | pppp3-{T}(V0,V2)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #114: disj( #20, exists( #21, #101 ) ), references = 2, size of lhs = 1:
% 1.16/1.35 P_intersection-{F}(V0,V1,V2) | pppp3-{T}(V2,V0)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #118: disj( #20, #18+#14+#11 ), references = 1, size of lhs = 2:
% 1.16/1.35 subset-{F}(V0,V1), V1 == V0 | pppp9-{T}(V1,V0)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #122: disj( #32, #19+#31 ), references = 1, size of lhs = 3:
% 1.16/1.35 pppp3-{F}(V0,V1), pppp6-{F}(V2,V1,V0), pppp6-{F}(V2,V3,V0) | member-{T}(V2,V3)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #131: exists( #30, #129 ), references = 2, size of lhs = 4:
% 1.16/1.35 pppp3-{F}(V0,V1), pppp10-{F}(V1,V2), P_union-{F}(V1,V0,V2), P_union-{F}(V1,V3,V2) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #133: disj( #20, exists( #30, #129 ) ), references = 1, size of lhs = 3:
% 1.16/1.35 pppp10-{F}(V0,V1), P_union-{F}(V0,V2,V1), P_union-{F}(V0,V3,V1) | pppp9-{T}(V2,V0)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #156: exists( #36, #154 ), references = 1, size of lhs = 1:
% 1.16/1.35 pppp3-{F}(V0,V1) | P_union-{T}(V1,V0,V1)
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #161: exists( #37, #159 ), references = 1, size of lhs = 1:
% 1.16/1.35 pppp7-{F}(V0,V1) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #163: exists( #34, #160 ), references = 1, size of lhs = 1:
% 1.16/1.35 pppp8-{F}(V0) | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 #165: exists( #33, #162 ), references = 1, size of lhs = 0:
% 1.16/1.35 FALSE | FALSE
% 1.16/1.35 (used 0 times, uses = {})
% 1.16/1.35
% 1.16/1.35 number of learnt formulas = 22
% 1.16/1.35
% 1.16/1.35
% 1.16/1.35 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.16/1.35
% 1.16/1.35 randbase = 1
%------------------------------------------------------------------------------