TSTP Solution File: SET636+3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SET636+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n007.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:16:31 EDT 2022
% Result : Theorem 1.39s 1.62s
% Output : Refutation 1.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET636+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n007.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 : Sat Jul 23 02:27:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.39/1.62 GeoParameters:
% 1.39/1.62
% 1.39/1.62 tptp_input = 1
% 1.39/1.62 tptp_output = 0
% 1.39/1.62 nonempty = 1
% 1.39/1.62 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.39/1.62 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 1.39/1.62
% 1.39/1.62
% 1.39/1.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.39/1.62 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.39/1.62
% 1.39/1.62 RuleSystem INPUT:
% 1.39/1.62
% 1.39/1.62 Initial Rules:
% 1.39/1.62 #0: input, references = 7, size of lhs = 2:
% 1.39/1.62 P_intersection-{F}(V0,V1,V3), member-{F}(V2,V3) | pppp0-{T}(V2,V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #1: input, references = 12, size of lhs = 2:
% 1.39/1.62 P_intersection-{F}(V0,V1,V3), pppp0-{F}(V2,V0,V1) | member-{T}(V2,V3)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #2: input, references = 7, size of lhs = 1:
% 1.39/1.62 pppp0-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #3: input, references = 4, size of lhs = 1:
% 1.39/1.62 pppp0-{F}(V0,V1,V2) | member-{T}(V0,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #4: input, references = 12, size of lhs = 2:
% 1.39/1.62 member-{F}(V0,V1), member-{F}(V0,V2) | pppp0-{T}(V0,V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #5: input, references = 7, size of lhs = 1:
% 1.39/1.62 intersect-{F}(V0,V1) | pppp1-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #6: input, references = 4, size of lhs = 1:
% 1.39/1.62 pppp1-{F}(V0,V1) | intersect-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #7: input, references = 5, size of lhs = 1:
% 1.39/1.62 pppp1-{F}(V0,V1) | EXISTS V2: pppp6-{T}(V2,V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #8: input, references = 4, size of lhs = 2:
% 1.39/1.62 member-{F}(V2,V0), member-{F}(V2,V1) | pppp1-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #9: input, references = 6, size of lhs = 1:
% 1.39/1.62 pppp6-{F}(V0,V1,V2) | member-{T}(V0,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #10: input, references = 5, size of lhs = 1:
% 1.39/1.62 pppp6-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #11: input, references = 10, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), member-{F}(V1,V0) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #12: input, references = 6, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), disjoint-{F}(V1,V2), intersect-{F}(V1,V2) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #13: input, references = 6, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | disjoint-{T}(V1,V2), intersect-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #14: input, references = 3, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V2 | pppp2-{T}(V2,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #15: input, references = 4, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp2-{F}(V1,V2), V1 == V2 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #16: input, references = 3, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp2-{F}(V1,V2) | subset-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #17: input, references = 3, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp2-{F}(V1,V2) | subset-{T}(V2,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #18: input, references = 4, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), subset-{F}(V1,V2), subset-{F}(V2,V1) | pppp2-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #19: input, references = 5, size of lhs = 4:
% 1.39/1.62 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3), P_intersection-{F}(V2,V1,V4), V3 == V4 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #20: input, references = 4, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), intersect-{F}(V1,V2) | intersect-{T}(V2,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #21: input, references = 3, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), subset-{F}(V1,V2) | pppp3-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #22: input, references = 4, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp3-{F}(V1,V2) | subset-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #23: input, references = 9, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp3-{F}(V1,V2), member-{F}(V3,V1) | member-{T}(V3,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #24: input, references = 7, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp3-{T}(V1,V2), pppp12-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #25: input, references = 4, size of lhs = 1:
% 1.39/1.62 pppp12-{F}(V0,V1) | EXISTS V2: pppp7-{T}(V2,V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #26: input, references = 3, size of lhs = 2:
% 1.39/1.62 pppp7-{F}(V0,V1,V2), member-{F}(V0,V2) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #27: input, references = 5, size of lhs = 1:
% 1.39/1.62 pppp7-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #28: input, references = 3, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V1,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #29: input, references = 3, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), empty-{F}(V1) | pppp4-{T}(V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #30: input, references = 3, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1) | empty-{T}(V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #31: input, references = 9, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), member-{F}(V2,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #32: input, references = 9, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V1 | pppp4-{T}(V1), pppp13-{T}(V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #33: input, references = 5, size of lhs = 1:
% 1.39/1.62 pppp13-{F}(V0) | EXISTS V1: pppp8-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #34: input, references = 5, size of lhs = 1:
% 1.39/1.62 pppp8-{F}(V0,V1) | member-{T}(V1,V0)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #35: input, references = 3, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V2 | pppp5-{T}(V2,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #36: input, references = 3, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp5-{F}(V1,V2), V1 == V2 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #37: input, references = 3, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp5-{F}(V1,V2), member-{F}(V3,V1) | member-{T}(V3,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #38: input, references = 3, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp5-{F}(V1,V2), member-{F}(V3,V2) | member-{T}(V3,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #39: input, references = 4, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp5-{T}(V1,V2), pppp14-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #40: input, references = 6, size of lhs = 1:
% 1.39/1.62 pppp14-{F}(V0,V1) | EXISTS V2: pppp9-{T}(V2,V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #41: input, references = 10, size of lhs = 3:
% 1.39/1.62 pppp9-{F}(V0,V1,V2), member-{F}(V0,V2), member-{F}(V0,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #42: input, references = 8, size of lhs = 1:
% 1.39/1.62 pppp9-{F}(V0,V1,V2) | member-{T}(V0,V1), member-{T}(V0,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #43: input, references = 4, size of lhs = 1:
% 1.39/1.62 P_empty_set-{F}(V0) | EXISTS V1: pppp11-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #44: input, references = 5, size of lhs = 1:
% 1.39/1.62 pppp11-{F}(V0,V1) | EXISTS V2: pppp10-{T}(V1,V2,V0)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #45: input, references = 5, size of lhs = 3:
% 1.39/1.62 pppp10-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V2), disjoint-{F}(V0,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #46: input, references = 5, size of lhs = 3:
% 1.39/1.62 pppp10-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V3), V3 == V2 | disjoint-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #47: input, references = 9, size of lhs = 2:
% 1.39/1.62 #-{F} V0, #-{F} V1 | EXISTS V2: P_intersection-{T}(V0,V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #48: input, references = 4, size of lhs = 0:
% 1.39/1.62 FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 number of initial rules = 49
% 1.39/1.62
% 1.39/1.62 Simplifiers:
% 1.39/1.62 #49: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 P_intersection-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #50: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #51: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 pppp6-{F}(V0,V1,V2), pppp6-{F}(V3,V1,V2), V0 == V3 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #52: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 pppp7-{F}(V0,V1,V2), pppp7-{F}(V3,V1,V2), V0 == V3 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #53: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 pppp8-{F}(V0,V1), pppp8-{F}(V0,V3), V1 == V3 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #54: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 pppp9-{F}(V0,V1,V2), pppp9-{F}(V3,V1,V2), V0 == V3 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #55: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 pppp10-{F}(V0,V1,V2), pppp10-{F}(V0,V4,V2), V1 == V4 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #56: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 pppp10-{F}(V0,V1,V2), pppp10-{F}(V3,V4,V2), V0 == V3 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #57: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 pppp10-{F}(V0,V1,V2), pppp10-{F}(V3,V4,V5), V2 == V5 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #58: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 pppp11-{F}(V0,V1), pppp11-{F}(V0,V3), V1 == V3 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #59: unsound, references = 3, size of lhs = 3:
% 1.39/1.62 pppp11-{F}(V0,V1), pppp11-{F}(V2,V3), V0 == V2 | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 number of simplifiers = 11
% 1.39/1.62
% 1.39/1.62 Learnt:
% 1.39/1.62 #63: exists( #7, #61 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), pppp1-{F}(V2,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #67: mergings( V0 == V3; #65 ), references = 2, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), #-{F} V2 | disjoint-{T}(V2,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #69: exists( #47, #19 ), references = 4, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3) | P_intersection-{T}(V2,V1,V3)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #74: mergings( V0 == V3, V3 == V4; #71 ), references = 4, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | disjoint-{T}(V2,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #77: mergings( V0 == V3; #75 ), references = 5, size of lhs = 4:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, V1 == V2 | pppp14-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #79: disj( #42, input ), references = 3, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), pppp9-{F}(V2,V1,V3) | member-{T}(V2,V3)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #84: mergings( V0 == V2, V2 == V3; #81 ), references = 1, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp9-{F}(V1,V2,V0) | pppp13-{T}(V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #99: mergings( V0 == V2, V2 == V3; #94 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V0), pppp9-{F}(V2,V3,V1) | pppp13-{T}(V3)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #101: mergings( V0 == V2; #95 ), references = 1, size of lhs = 4:
% 1.39/1.62 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V2), pppp9-{F}(V3,V2,V1), pppp9-{F}(V3,V4,V1) | pppp13-{T}(V4)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #103: disj( #42, input ), references = 1, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp9-{F}(V1,V2,V0) | member-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #112: exists( #40, #109 ), references = 2, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp14-{F}(V1,V0), P_intersection-{F}(V1,V1,V0) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #128: disj( #42, input ), references = 3, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp9-{F}(V1,V0,V2) | member-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #137: mergings( V0 == V3, V3 == V2; #132 ), references = 1, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), member-{F}(V1,V2) | pppp12-{T}(V2,V0)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #139: mergings( V0 == V3; #133 ), references = 1, size of lhs = 4:
% 1.39/1.62 P_empty_set-{F}(V0), member-{F}(V1,V2), member-{F}(V1,V3), pppp9-{F}(V1,V3,V4) | pppp12-{T}(V2,V4)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #142: mergings( V0 == V3, V3 == V4; #134 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), member-{F}(V2,V3) | pppp12-{T}(V3,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #161: mergings( V0 == V3, V3 == V4, V4 == V5; #157 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), subset-{F}(V1,V2), V2 == V1 | pppp12-{T}(V2,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #174: exists( #40, #169 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp14-{F}(V0,V1), P_intersection-{F}(V0,V2,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #177: mergings( V0 == V3; #173 ), references = 1, size of lhs = 4:
% 1.39/1.62 P_empty_set-{F}(V0), pppp14-{F}(V0,V1), pppp4-{F}(V2), P_intersection-{F}(V2,V3,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #185: mergings( V3 == V0; #181 ), references = 2, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V1 | P_intersection-{T}(V0,V1,V0)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #190: mergings( V3 == V4, V4 == V5; #183 ), references = 2, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), #-{F} V2 | P_intersection-{T}(V1,V2,V0)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #193: mergings( V0 == V2; #191 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp14-{F}(V0,V1), P_intersection-{F}(V2,V3,V1) | pppp13-{T}(V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #208: exists( #33, #204 ), references = 1, size of lhs = 2:
% 1.39/1.62 pppp13-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #211: mergings( V0 == V1; #209 ), references = 1, size of lhs = 1:
% 1.39/1.62 P_empty_set-{F}(V0) | pppp4-{T}(V0)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #218: mergings( V0 == V2, V2 == V3; #215 ), references = 1, size of lhs = 3:
% 1.39/1.62 pppp4-{F}(V0), pppp11-{F}(V0,V0), P_empty_set-{F}(V0) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #226: mergings( V3 == V4; #224 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), intersect-{F}(V1,V2), pppp10-{F}(V1,V2,V3) | P_intersection-{T}(V2,V1,V3)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #262: mergings( V0 == V3, V3 == V4; #257 ), references = 1, size of lhs = 4:
% 1.39/1.62 P_empty_set-{F}(V0), member-{F}(V1,V2), member-{F}(V1,V3), P_intersection-{F}(V3,V4,V0) | pppp12-{T}(V2,V4)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #265: mergings( V0 == V3, V3 == V4; #258 ), references = 1, size of lhs = 5:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), member-{F}(V2,V3), member-{F}(V2,V4), P_intersection-{F}(V4,V5,V1) | pppp12-{T}(V3,V5)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #267: mergings( V0 == V3; #259 ), references = 1, size of lhs = 6:
% 1.39/1.62 P_empty_set-{F}(V0), member-{F}(V1,V2), member-{F}(V1,V3), member-{F}(V1,V4), pppp9-{F}(V1,V4,V5), P_intersection-{F}(V3,V6,V5) | pppp12-{T}(V2,V6)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #282: mergings( V0 == V2; #279 ), references = 1, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), member-{F}(V1,V2) | pppp13-{T}(V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #284: mergings( V0 == V2; #280 ), references = 1, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp1-{F}(V1,V2) | pppp13-{T}(V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #288: mergings( V0 == V3; #286 ), references = 4, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp10-{F}(V1,V2,V3), P_intersection-{F}(V1,V2,V3) | intersect-{T}(V2,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #303: mergings( V0 == V2; #301 ), references = 2, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp14-{F}(V1,V0) | pppp13-{T}(V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #340: disj( #42, input ), references = 1, size of lhs = 2:
% 1.39/1.62 pppp9-{F}(V0,V1,V2), pppp7-{F}(V0,V3,V2) | member-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #364: exists( #7, #360 ), references = 3, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp1-{F}(V1,V2), P_intersection-{F}(V2,V1,V0) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #365: exists( #7, #361 ), references = 2, size of lhs = 4:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), pppp1-{F}(V2,V3), P_intersection-{F}(V3,V2,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #406: exists( #33, #404 ), references = 1, size of lhs = 4:
% 1.39/1.62 pppp13-{F}(V0), P_empty_set-{F}(V1), disjoint-{F}(V2,V3), P_intersection-{F}(V2,V3,V0) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #417: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #412 ), references = 2, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp10-{F}(V1,V2,V3) | P_intersection-{T}(V2,V1,V3), P_intersection-{T}(V2,V1,V0)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #436: exists( #25, #432 ), references = 1, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp12-{F}(V0,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #437: exists( #25, #433 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), pppp12-{F}(V1,V2) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #441: mergings( V0 == V1; #438 ), references = 1, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V1 | pppp3-{T}(V0,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #443: mergings( V0 == V3; #439 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), #-{F} V2 | pppp3-{T}(V1,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #469: disj( #42, #0+#2+#41 ), references = 1, size of lhs = 3:
% 1.39/1.62 pppp9-{F}(V0,V1,V2), pppp9-{F}(V0,V1,V3), P_intersection-{F}(V3,V4,V1) | member-{T}(V0,V2)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #474: exists( #40, #472 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_intersection-{F}(V0,V0,V1), pppp14-{F}(V1,V0), P_intersection-{F}(V0,V2,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #477: exists( #47, #475 ), references = 1, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), #-{F} V1 | P_intersection-{T}(V1,V1,V1)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #509: mergings( V0 == V4, V4 == V5, V5 == V6; #502 ), references = 1, size of lhs = 3:
% 1.39/1.62 P_empty_set-{F}(V0), pppp4-{F}(V1), pppp10-{F}(V2,V3,V1) | P_intersection-{T}(V3,V2,V0)
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #524: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V0; #518 ), references = 1, size of lhs = 2:
% 1.39/1.62 P_empty_set-{F}(V0), pppp11-{F}(V0,V1) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #531: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V0; #525 ), references = 1, size of lhs = 1:
% 1.39/1.62 P_empty_set-{F}(V0) | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 #535: exists( #48, #525 ), references = 1, size of lhs = 0:
% 1.39/1.62 FALSE | FALSE
% 1.39/1.62 (used 0 times, uses = {})
% 1.39/1.62
% 1.39/1.62 number of learnt formulas = 48
% 1.39/1.62
% 1.39/1.62
% 1.39/1.62 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.39/1.62
% 1.39/1.62 randbase = 1
%------------------------------------------------------------------------------