TSTP Solution File: SET008+3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SET008+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n011.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:31 EDT 2022
% Result : Theorem 1.24s 1.39s
% Output : Refutation 1.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET008+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n011.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:36:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.24/1.39 GeoParameters:
% 1.24/1.39
% 1.24/1.39 tptp_input = 1
% 1.24/1.39 tptp_output = 0
% 1.24/1.39 nonempty = 1
% 1.24/1.39 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.24/1.39 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 1.24/1.39
% 1.24/1.39
% 1.24/1.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.24/1.39 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.24/1.39
% 1.24/1.39 RuleSystem INPUT:
% 1.24/1.39
% 1.24/1.39 Initial Rules:
% 1.24/1.39 #0: input, references = 8, size of lhs = 2:
% 1.24/1.39 P_intersection-{F}(V0,V1,V3), member-{F}(V2,V3) | pppp0-{T}(V2,V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #1: input, references = 7, size of lhs = 2:
% 1.24/1.39 P_intersection-{F}(V0,V1,V3), pppp0-{F}(V2,V0,V1) | member-{T}(V2,V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #2: input, references = 8, size of lhs = 1:
% 1.24/1.39 pppp0-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #3: input, references = 4, size of lhs = 1:
% 1.24/1.39 pppp0-{F}(V0,V1,V2) | member-{T}(V0,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #4: input, references = 7, size of lhs = 2:
% 1.24/1.39 member-{F}(V0,V1), member-{F}(V0,V2) | pppp0-{T}(V0,V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #5: input, references = 8, size of lhs = 2:
% 1.24/1.39 P_difference-{F}(V0,V1,V3), member-{F}(V2,V3) | pppp1-{T}(V2,V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #6: input, references = 4, size of lhs = 2:
% 1.24/1.39 P_difference-{F}(V0,V1,V3), pppp1-{F}(V2,V0,V1) | member-{T}(V2,V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #7: input, references = 5, size of lhs = 1:
% 1.24/1.39 pppp1-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #8: input, references = 8, size of lhs = 2:
% 1.24/1.39 pppp1-{F}(V0,V1,V2), member-{F}(V0,V2) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #9: input, references = 5, size of lhs = 2:
% 1.24/1.39 #-{F} V2, member-{F}(V0,V1) | pppp1-{T}(V0,V1,V2), member-{T}(V0,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #10: input, references = 8, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), member-{F}(V1,V0) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #11: input, references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V2 | pppp2-{T}(V2,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #12: input, references = 4, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp2-{F}(V1,V2), V1 == V2 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #13: input, references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), pppp2-{F}(V1,V2) | subset-{T}(V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #14: input, references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), pppp2-{F}(V1,V2) | subset-{T}(V2,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #15: input, references = 4, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), subset-{F}(V1,V2), subset-{F}(V2,V1) | pppp2-{T}(V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #16: input, references = 4, size of lhs = 4:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3), P_intersection-{F}(V2,V1,V4), V3 == V4 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #17: input, references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), subset-{F}(V1,V2) | pppp3-{T}(V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #18: input, references = 7, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), pppp3-{F}(V1,V2) | subset-{T}(V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #19: input, references = 6, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp3-{F}(V1,V2), member-{F}(V3,V1) | member-{T}(V3,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #20: input, references = 8, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp3-{T}(V1,V2), pppp11-{T}(V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #21: input, references = 6, size of lhs = 1:
% 1.24/1.39 pppp11-{F}(V0,V1) | EXISTS V2: pppp6-{T}(V2,V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #22: input, references = 4, size of lhs = 2:
% 1.24/1.39 pppp6-{F}(V0,V1,V2), member-{F}(V0,V2) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #23: input, references = 8, size of lhs = 1:
% 1.24/1.39 pppp6-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #24: input, references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V1,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #25: input, references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), empty-{F}(V1) | pppp4-{T}(V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #26: input, references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), pppp4-{F}(V1) | empty-{T}(V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #27: input, references = 8, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp4-{F}(V1), member-{F}(V2,V1) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #28: input, references = 6, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V1 | pppp4-{T}(V1), pppp12-{T}(V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #29: input, references = 6, size of lhs = 1:
% 1.24/1.39 pppp12-{F}(V0) | EXISTS V1: pppp7-{T}(V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #30: input, references = 6, size of lhs = 1:
% 1.24/1.39 pppp7-{F}(V0,V1) | member-{T}(V1,V0)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #31: input, references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V2 | pppp5-{T}(V2,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #32: input, references = 3, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp5-{F}(V1,V2), V1 == V2 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #33: input, references = 3, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp5-{F}(V1,V2), member-{F}(V3,V1) | member-{T}(V3,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #34: input, references = 3, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp5-{F}(V1,V2), member-{F}(V3,V2) | member-{T}(V3,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #35: input, references = 4, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp5-{T}(V1,V2), pppp13-{T}(V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #36: input, references = 8, size of lhs = 1:
% 1.24/1.39 pppp13-{F}(V0,V1) | EXISTS V2: pppp8-{T}(V2,V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #37: input, references = 8, size of lhs = 3:
% 1.24/1.39 pppp8-{F}(V0,V1,V2), member-{F}(V0,V2), member-{F}(V0,V1) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #38: input, references = 6, size of lhs = 1:
% 1.24/1.39 pppp8-{F}(V0,V1,V2) | member-{T}(V0,V1), member-{T}(V0,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #39: input, references = 4, size of lhs = 1:
% 1.24/1.39 P_empty_set-{F}(V0) | EXISTS V1: pppp10-{T}(V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #40: input, references = 4, size of lhs = 1:
% 1.24/1.39 pppp10-{F}(V0,V1) | EXISTS V2: pppp9-{T}(V1,V0,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #41: input, references = 4, size of lhs = 3:
% 1.24/1.39 pppp9-{F}(V0,V1,V2), P_difference-{F}(V0,V2,V3), P_intersection-{F}(V3,V2,V1) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #42: input, references = 10, size of lhs = 2:
% 1.24/1.39 #-{F} V0, #-{F} V1 | EXISTS V2: P_intersection-{T}(V0,V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #43: input, references = 6, size of lhs = 2:
% 1.24/1.39 #-{F} V0, #-{F} V1 | EXISTS V2: P_difference-{T}(V0,V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #44: input, references = 4, size of lhs = 0:
% 1.24/1.39 FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 number of initial rules = 45
% 1.24/1.39
% 1.24/1.39 Simplifiers:
% 1.24/1.39 #45: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 P_intersection-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #46: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 P_difference-{F}(V0,V1,V2), P_difference-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #47: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #48: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 pppp6-{F}(V0,V1,V2), pppp6-{F}(V3,V1,V2), V0 == V3 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #49: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 pppp7-{F}(V0,V1), pppp7-{F}(V0,V3), V1 == V3 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #50: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 pppp8-{F}(V0,V1,V2), pppp8-{F}(V3,V1,V2), V0 == V3 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #51: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 pppp9-{F}(V0,V1,V2), pppp9-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #52: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 pppp9-{F}(V0,V1,V2), pppp9-{F}(V3,V1,V5), V0 == V3 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #53: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 pppp9-{F}(V0,V1,V2), pppp9-{F}(V3,V4,V5), V1 == V4 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #54: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 pppp10-{F}(V0,V1), pppp10-{F}(V0,V3), V1 == V3 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #55: unsound, references = 3, size of lhs = 3:
% 1.24/1.39 pppp10-{F}(V0,V1), pppp10-{F}(V2,V3), V0 == V2 | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 number of simplifiers = 11
% 1.24/1.39
% 1.24/1.39 Learnt:
% 1.24/1.39 #58: exists( #29, #56 ), references = 1, size of lhs = 2:
% 1.24/1.39 pppp12-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #61: mergings( V0 == V1; #59 ), references = 1, size of lhs = 1:
% 1.24/1.39 P_empty_set-{F}(V0) | pppp4-{T}(V0)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #68: mergings( V0 == V3, V3 == V4, V4 == V5; #64 ), references = 4, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), subset-{F}(V1,V2), V2 == V1 | pppp11-{T}(V2,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #70: exists( #42, #16 ), references = 4, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3) | P_intersection-{T}(V2,V1,V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #73: mergings( V0 == V3; #71 ), references = 5, size of lhs = 4:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, V1 == V2 | pppp13-{T}(V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #83: disj( #38, #4+#1+#10 ), references = 2, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V0), pppp8-{F}(V2,V1,V3) | member-{T}(V2,V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #84: disj( #38, #4+#1+#37 ), references = 3, size of lhs = 3:
% 1.24/1.39 P_intersection-{F}(V0,V0,V1), pppp8-{F}(V2,V0,V1), pppp8-{F}(V2,V0,V3) | member-{T}(V2,V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #85: disj( #38, #4+#1+#27 ), references = 1, size of lhs = 4:
% 1.24/1.39 P_empty_set-{F}(V0), pppp4-{F}(V1), P_intersection-{F}(V2,V2,V1), pppp8-{F}(V3,V2,V4) | member-{T}(V3,V4)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #91: mergings( V3 == V1; #88 ), references = 1, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V0), pppp13-{F}(V1,V0) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #93: mergings( V3 == V4; #89 ), references = 1, size of lhs = 4:
% 1.24/1.39 pppp4-{F}(V0), pppp13-{F}(V1,V0), P_intersection-{F}(V1,V1,V2), P_empty_set-{F}(V2) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #102: exists( #36, #99 ), references = 2, size of lhs = 5:
% 1.24/1.39 P_empty_set-{F}(V0), pppp4-{F}(V1), pppp13-{F}(V2,V3), P_intersection-{F}(V2,V2,V3), P_intersection-{F}(V1,V4,V3) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #106: mergings( V0 == V2; #104 ), references = 1, size of lhs = 4:
% 1.24/1.39 P_empty_set-{F}(V0), pppp13-{F}(V1,V2), P_intersection-{F}(V1,V1,V2), P_intersection-{F}(V3,V4,V2) | pppp12-{T}(V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #112: mergings( V2 == V3; #110 ), references = 1, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), pppp4-{F}(V1) | P_intersection-{T}(V1,V1,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #116: exists( #36, #114 ), references = 1, size of lhs = 4:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V0), pppp13-{F}(V1,V2), P_difference-{F}(V3,V2,V2) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #119: mergings( V0 == V3; #117 ), references = 2, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V0), pppp13-{F}(V1,V2) | pppp12-{T}(V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #125: exists( #29, #123 ), references = 1, size of lhs = 3:
% 1.24/1.39 pppp12-{F}(V0), P_intersection-{F}(V0,V0,V1), P_difference-{F}(V2,V0,V1) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #140: exists( #36, #138 ), references = 1, size of lhs = 3:
% 1.24/1.39 pppp13-{F}(V0,V1), P_intersection-{F}(V0,V0,V1), P_intersection-{F}(V0,V2,V1) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #144: exists( #42, #142 ), references = 1, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V1 | P_intersection-{T}(V1,V1,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #155: mergings( V0 == V3, V3 == V2; #151 ), references = 1, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), member-{F}(V1,V2) | pppp11-{T}(V2,V0)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #158: mergings( V0 == V3, V3 == V4; #152 ), references = 1, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp4-{F}(V1), member-{F}(V2,V3) | pppp11-{T}(V3,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #168: exists( #29, #166 ), references = 1, size of lhs = 2:
% 1.24/1.39 pppp12-{F}(V0), P_difference-{F}(V1,V1,V0) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #173: mergings( V2 == V3; #171 ), references = 1, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V0), #-{F} V2 | P_difference-{T}(V2,V2,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #178: exists( #21, #174 ), references = 1, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), pppp11-{F}(V0,V1) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #179: exists( #21, #175 ), references = 1, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp4-{F}(V1), pppp11-{F}(V1,V2) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #183: mergings( V0 == V1; #180 ), references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V1 | pppp3-{T}(V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #185: mergings( V0 == V3; #181 ), references = 1, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp4-{F}(V1), #-{F} V2 | pppp3-{T}(V1,V2)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #189: disj( #9, input ), references = 3, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), member-{F}(V1,V2) | pppp1-{T}(V1,V2,V0)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #190: disj( #9, input ), references = 1, size of lhs = 2:
% 1.24/1.39 member-{F}(V0,V1), pppp6-{F}(V0,V2,V3) | pppp1-{T}(V0,V1,V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #191: disj( #9, input ), references = 1, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), pppp4-{F}(V1), member-{F}(V2,V3) | pppp1-{T}(V2,V3,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #211: exists( #21, #207 ), references = 2, size of lhs = 2:
% 1.24/1.39 pppp11-{F}(V0,V1), P_intersection-{F}(V1,V2,V0) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #212: exists( #21, #205 ), references = 1, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V0,V1,V2), pppp11-{F}(V2,V3) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #231: mergings( V3 == V1, V1 == V4, V4 == V5; #225 ), references = 1, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V1 | P_intersection-{T}(V1,V0,V0)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #247: disj( #38, #189+#6+#37 ), references = 1, size of lhs = 4:
% 1.24/1.39 P_empty_set-{F}(V0), P_difference-{F}(V1,V0,V2), pppp8-{F}(V3,V2,V1), pppp8-{F}(V3,V4,V1) | member-{T}(V3,V4)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #252: exists( #36, #250 ), references = 1, size of lhs = 4:
% 1.24/1.39 P_empty_set-{F}(V0), P_difference-{F}(V1,V0,V2), pppp13-{F}(V2,V1), P_difference-{F}(V1,V3,V2) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #256: mergings( V3 == V1; #254 ), references = 1, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), #-{F} V1 | P_difference-{T}(V1,V0,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #266: mergings( V0 == V3, V3 == V4; #263 ), references = 1, size of lhs = 3:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3), V3 == V1 | pppp11-{T}(V1,V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #269: disj( #20, exists( #21, #207 ) ), references = 1, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3) | pppp3-{T}(V3,V1)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #273: disj( #38, #19+#37 ), references = 1, size of lhs = 4:
% 1.24/1.39 P_empty_set-{F}(V0), pppp3-{F}(V1,V2), pppp8-{F}(V3,V1,V2), pppp8-{F}(V3,V1,V4) | member-{T}(V3,V4)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #306: disj( #9, input ), references = 1, size of lhs = 3:
% 1.24/1.39 member-{F}(V0,V1), member-{F}(V0,V2), pppp8-{F}(V0,V3,V2) | pppp1-{T}(V0,V1,V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #307: disj( #9, input ), references = 1, size of lhs = 2:
% 1.24/1.39 member-{F}(V0,V1), pppp1-{F}(V0,V2,V3) | pppp1-{T}(V0,V1,V3)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #336: exists( #21, #334 ), references = 1, size of lhs = 3:
% 1.24/1.39 pppp11-{F}(V0,V1), P_intersection-{F}(V2,V3,V0), P_difference-{F}(V4,V3,V2) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #345: mergings( V3 == V4, V4 == V5, V5 == V6; #341 ), references = 2, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), P_difference-{F}(V1,V2,V3) | P_intersection-{T}(V2,V3,V0)
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #350: mergings( V3 == V4; #348 ), references = 1, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), pppp9-{F}(V1,V0,V2) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #353: mergings( V0 == V3; #351 ), references = 1, size of lhs = 2:
% 1.24/1.39 P_empty_set-{F}(V0), pppp10-{F}(V0,V1) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #356: mergings( V0 == V2; #354 ), references = 1, size of lhs = 1:
% 1.24/1.39 P_empty_set-{F}(V0) | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 #358: exists( #44, #354 ), references = 1, size of lhs = 0:
% 1.24/1.39 FALSE | FALSE
% 1.24/1.39 (used 0 times, uses = {})
% 1.24/1.39
% 1.24/1.39 number of learnt formulas = 46
% 1.24/1.39
% 1.24/1.39
% 1.24/1.39 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.24/1.39
% 1.24/1.39 randbase = 1
%------------------------------------------------------------------------------