TSTP Solution File: SET596+3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SET596+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n018.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:24 EDT 2022
% Result : Theorem 0.67s 0.89s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET596+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n018.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:26:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/0.89 GeoParameters:
% 0.67/0.89
% 0.67/0.89 tptp_input = 1
% 0.67/0.89 tptp_output = 0
% 0.67/0.89 nonempty = 1
% 0.67/0.89 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.67/0.89 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.67/0.89
% 0.67/0.89
% 0.67/0.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.67/0.89 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.67/0.89
% 0.67/0.89 RuleSystem INPUT:
% 0.67/0.89
% 0.67/0.89 Initial Rules:
% 0.67/0.89 #0: input, references = 5, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), subset-{F}(V1,V0), V1 == V0 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #1: input, references = 4, size of lhs = 4:
% 0.67/0.89 P_empty_set-{F}(V0), subset-{F}(V1,V2), P_intersection-{F}(V1,V3,V4), P_intersection-{F}(V2,V3,V5) | subset-{T}(V4,V5)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #2: input, references = 6, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), member-{F}(V1,V0) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #3: input, references = 4, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V4), member-{F}(V3,V4) | pppp0-{T}(V1,V2,V3)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #4: input, references = 6, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V4), pppp0-{F}(V1,V2,V3) | member-{T}(V3,V4)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #5: input, references = 4, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), pppp0-{F}(V1,V2,V3) | member-{T}(V3,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #6: input, references = 3, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), pppp0-{F}(V1,V2,V3) | member-{T}(V3,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #7: input, references = 6, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), member-{F}(V3,V1), member-{F}(V3,V2) | pppp0-{T}(V1,V2,V3)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #8: input, references = 3, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), subset-{F}(V1,V2) | pppp1-{T}(V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #9: input, references = 6, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), pppp1-{F}(V1,V2) | subset-{T}(V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #10: input, references = 5, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp1-{F}(V1,V2), member-{F}(V3,V1) | member-{T}(V3,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #11: input, references = 8, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp1-{T}(V1,V2), pppp11-{T}(V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #12: input, references = 5, size of lhs = 1:
% 0.67/0.89 pppp11-{F}(V0,V1) | EXISTS V2: pppp5-{T}(V0,V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #13: input, references = 5, size of lhs = 2:
% 0.67/0.89 pppp5-{F}(V0,V1,V2), member-{F}(V2,V1) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #14: input, references = 7, size of lhs = 1:
% 0.67/0.89 pppp5-{F}(V0,V1,V2) | member-{T}(V2,V0)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #15: input, references = 3, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), #-{F} V2 | pppp2-{T}(V2,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #16: input, references = 4, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp2-{F}(V1,V2), V1 == V2 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #17: input, references = 3, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), pppp2-{F}(V1,V2) | subset-{T}(V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #18: input, references = 3, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), pppp2-{F}(V1,V2) | subset-{T}(V2,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #19: input, references = 4, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), subset-{F}(V1,V2), subset-{F}(V2,V1) | pppp2-{T}(V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #20: input, references = 4, size of lhs = 4:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3), P_intersection-{F}(V2,V1,V4), V3 == V4 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #21: input, references = 3, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V1,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #22: input, references = 3, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), empty-{F}(V1) | pppp3-{T}(V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #23: input, references = 3, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), pppp3-{F}(V1) | empty-{T}(V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #24: input, references = 4, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp3-{F}(V1), member-{F}(V2,V1) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #25: input, references = 6, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), #-{F} V1 | pppp3-{T}(V1), pppp12-{T}(V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #26: input, references = 4, size of lhs = 1:
% 0.67/0.89 pppp12-{F}(V0) | EXISTS V1: pppp6-{T}(V0,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #27: input, references = 4, size of lhs = 1:
% 0.67/0.89 pppp6-{F}(V0,V1) | member-{T}(V1,V0)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #28: input, references = 3, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), #-{F} V2 | pppp4-{T}(V2,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #29: input, references = 3, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp4-{F}(V1,V2), V1 == V2 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #30: input, references = 3, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp4-{F}(V1,V2), member-{F}(V3,V1) | member-{T}(V3,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #31: input, references = 3, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp4-{F}(V1,V2), member-{F}(V3,V2) | member-{T}(V3,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #32: input, references = 4, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp4-{T}(V1,V2), pppp13-{T}(V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #33: input, references = 3, size of lhs = 1:
% 0.67/0.89 pppp13-{F}(V0,V1) | EXISTS V2: pppp7-{T}(V0,V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #34: input, references = 4, size of lhs = 3:
% 0.67/0.89 pppp7-{F}(V0,V1,V2), member-{F}(V2,V1), member-{F}(V2,V0) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #35: input, references = 5, size of lhs = 1:
% 0.67/0.89 pppp7-{F}(V0,V1,V2) | member-{T}(V2,V0), member-{T}(V2,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #36: input, references = 4, size of lhs = 1:
% 0.67/0.89 P_empty_set-{F}(V0) | EXISTS V1: pppp10-{T}(V0,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #37: input, references = 4, size of lhs = 1:
% 0.67/0.89 pppp10-{F}(V0,V1) | EXISTS V2: pppp9-{T}(V1,V2,V0)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #38: input, references = 4, size of lhs = 2:
% 0.67/0.89 pppp9-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V3) | EXISTS V4: pppp8-{T}(V4,V0,V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #39: input, references = 4, size of lhs = 3:
% 0.67/0.89 pppp9-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V3), V3 == V2 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #40: input, references = 4, size of lhs = 2:
% 0.67/0.89 pppp8-{F}(V0,V1,V2,V3), P_intersection-{F}(V0,V2,V3) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #41: input, references = 5, size of lhs = 2:
% 0.67/0.89 pppp8-{F}(V0,V1,V2,V3), P_intersection-{F}(V0,V2,V4) | subset-{T}(V0,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #42: input, references = 4, size of lhs = 0:
% 0.67/0.89 FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #43: input, references = 7, size of lhs = 2:
% 0.67/0.89 #-{F} V0, #-{F} V1 | EXISTS V2: P_intersection-{T}(V0,V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 number of initial rules = 44
% 0.67/0.89
% 0.67/0.89 Simplifiers:
% 0.67/0.89 #44: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #45: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 P_intersection-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #46: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp5-{F}(V0,V1,V2), pppp5-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #47: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp6-{F}(V0,V1), pppp6-{F}(V0,V3), V1 == V3 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #48: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp7-{F}(V0,V1,V2), pppp7-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #49: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp8-{F}(V0,V1,V2,V3), pppp8-{F}(V4,V1,V2,V3), V0 == V4 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #50: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp8-{F}(V0,V1,V2,V3), pppp8-{F}(V4,V1,V6,V3), V2 == V6 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #51: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp8-{F}(V0,V1,V2,V3), pppp8-{F}(V4,V5,V6,V3), V1 == V5 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #52: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp8-{F}(V0,V1,V2,V3), pppp8-{F}(V4,V5,V6,V7), V3 == V7 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #53: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp9-{F}(V0,V1,V2), pppp9-{F}(V0,V4,V2), V1 == V4 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #54: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp9-{F}(V0,V1,V2), pppp9-{F}(V3,V4,V2), V0 == V3 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #55: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp9-{F}(V0,V1,V2), pppp9-{F}(V3,V4,V5), V2 == V5 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #56: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp10-{F}(V0,V1), pppp10-{F}(V0,V3), V1 == V3 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #57: unsound, references = 3, size of lhs = 3:
% 0.67/0.89 pppp10-{F}(V0,V1), pppp10-{F}(V2,V3), V0 == V2 | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 number of simplifiers = 14
% 0.67/0.89
% 0.67/0.89 Learnt:
% 0.67/0.89 #60: mergings( V0 == V3; #58 ), references = 1, size of lhs = 4:
% 0.67/0.89 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, V1 == V2 | pppp13-{T}(V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #63: disj( #35, input ), references = 1, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), pppp7-{F}(V0,V1,V2) | member-{T}(V2,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #64: disj( #35, input ), references = 1, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp3-{F}(V1), pppp7-{F}(V1,V2,V3) | member-{T}(V3,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #67: mergings( V0 == V2; #65 ), references = 1, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), member-{F}(V1,V2) | pppp12-{T}(V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #73: exists( #43, #20 ), references = 4, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3) | P_intersection-{T}(V2,V1,V3)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #82: mergings( V0 == V3, V3 == V2; #77 ), references = 1, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), #-{F} V1, V1 == V0 | pppp11-{T}(V1,V0)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #86: mergings( V0 == V3, V3 == V2, V1 == V2; #78 ), references = 1, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), member-{F}(V1,V0) | pppp11-{T}(V0,V0)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #88: mergings( V0 == V3; #79 ), references = 1, size of lhs = 4:
% 0.67/0.89 P_empty_set-{F}(V0), member-{F}(V1,V2), member-{F}(V1,V3), pppp7-{F}(V4,V3,V1) | pppp11-{T}(V2,V4)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #97: exists( #26, #95 ), references = 1, size of lhs = 2:
% 0.67/0.89 pppp12-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #100: mergings( V0 == V1; #98 ), references = 1, size of lhs = 1:
% 0.67/0.89 P_empty_set-{F}(V0) | pppp3-{T}(V0)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #114: mergings( V3 == V4; #111 ), references = 1, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp11-{F}(V1,V2), P_intersection-{F}(V1,V1,V2) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #117: mergings( V3 == V4, V4 == V5; #110 ), references = 1, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V0), pppp11-{F}(V1,V2) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #120: mergings( V3 == V4, V4 == V5; #112 ), references = 1, size of lhs = 4:
% 0.67/0.89 P_empty_set-{F}(V0), pppp3-{F}(V1), P_intersection-{F}(V2,V2,V1), pppp11-{F}(V2,V3) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #130: mergings( V0 == V3; #127 ), references = 1, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V0), #-{F} V2 | pppp1-{T}(V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #132: mergings( V0 == V3; #128 ), references = 1, size of lhs = 4:
% 0.67/0.89 P_empty_set-{F}(V0), pppp3-{F}(V1), P_intersection-{F}(V2,V2,V1), #-{F} V3 | pppp1-{T}(V2,V3)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #141: mergings( V0 == V3; #139 ), references = 1, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V2) | pppp1-{T}(V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #169: mergings( V0 == V3, V3 == V4, V4 == V5; #165 ), references = 2, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), subset-{F}(V1,V2), V2 == V1 | pppp11-{T}(V2,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #187: mergings( V3 == V4; #185 ), references = 2, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp11-{F}(V1,V2), P_intersection-{F}(V2,V3,V1) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #200: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10; #191 ), references = 1, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), #-{F} V1 | P_intersection-{T}(V1,V1,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #205: exists( #43, #39 ), references = 2, size of lhs = 1:
% 0.67/0.89 pppp9-{F}(V0,V1,V2) | P_intersection-{T}(V0,V1,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #208: disj( #35, input ), references = 1, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), pppp7-{F}(V1,V0,V2) | member-{T}(V2,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #209: disj( #35, input ), references = 1, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp3-{F}(V1), pppp7-{F}(V2,V1,V3) | member-{T}(V3,V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #212: mergings( V0 == V2; #210 ), references = 1, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V1,V2), pppp11-{F}(V1,V3) | pppp12-{T}(V2)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #236: mergings( V0 == V3; #234 ), references = 1, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3) | pppp1-{T}(V3,V1)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #251: mergings( V3 == V4, V4 == V5; #247 ), references = 1, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V0), pppp8-{F}(V3,V1,V2,V4) | P_intersection-{T}(V2,V3,V0)
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #254: mergings( V3 == V4, V4 == V5; #248 ), references = 1, size of lhs = 4:
% 0.67/0.89 P_empty_set-{F}(V0), P_intersection-{F}(V1,V2,V3), V3 == V1, pppp8-{F}(V1,V3,V4,V5) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #262: mergings( V5 == V6, V6 == V2, V2 == V7, V7 == V3; #257 ), references = 1, size of lhs = 3:
% 0.67/0.89 P_empty_set-{F}(V0), pppp9-{F}(V1,V2,V0), P_intersection-{F}(V1,V2,V0) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #268: mergings( V3 == V4, V4 == V0, V0 == V5; #264 ), references = 1, size of lhs = 2:
% 0.67/0.89 P_empty_set-{F}(V0), pppp10-{F}(V0,V1) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #273: mergings( V2 == V3, V3 == V0, V0 == V4; #269 ), references = 1, size of lhs = 1:
% 0.67/0.89 P_empty_set-{F}(V0) | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 #275: exists( #42, #269 ), references = 1, size of lhs = 0:
% 0.67/0.89 FALSE | FALSE
% 0.67/0.89 (used 0 times, uses = {})
% 0.67/0.89
% 0.67/0.89 number of learnt formulas = 30
% 0.67/0.89
% 0.67/0.89
% 0.67/0.89 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.67/0.89
% 0.67/0.89 randbase = 1
%------------------------------------------------------------------------------