%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SEU122+2 : TPTP v8.1.0. Released v3.3.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:17:14 EDT 2022
% Result : Theorem 0.47s 0.70s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU122+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n011.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 : Fri Jul 22 19:34:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.47/0.70 GeoParameters:
% 0.47/0.70
% 0.47/0.70 tptp_input = 1
% 0.47/0.70 tptp_output = 0
% 0.47/0.70 nonempty = 1
% 0.47/0.70 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.70 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.47/0.70
% 0.47/0.70
% 0.47/0.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.70 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.70
% 0.47/0.70 RuleSystem INPUT:
% 0.47/0.70
% 0.47/0.70 Initial Rules:
% 0.47/0.70 #0: input, references = 4, size of lhs = 2:
% 0.47/0.70 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #1: input, references = 4, size of lhs = 3:
% 0.47/0.70 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #2: input, references = 4, size of lhs = 1:
% 0.47/0.70 P_empty_set-{F}(V0) | pppp0-{T}(V0)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #3: input, references = 3, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), pppp0-{F}(V1), V1 == V0 | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #4: input, references = 6, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), pppp0-{F}(V1), in-{F}(V2,V1) | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #5: input, references = 4, size of lhs = 2:
% 0.47/0.70 P_empty_set-{F}(V0), #-{F} V1 | pppp0-{T}(V1), pppp12-{T}(V1)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #6: input, references = 4, size of lhs = 1:
% 0.47/0.70 pppp12-{F}(V0) | EXISTS V1: pppp4-{T}(V0,V1)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #7: input, references = 5, size of lhs = 1:
% 0.47/0.70 pppp4-{F}(V0,V1) | in-{T}(V1,V0)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #8: input, references = 3, size of lhs = 2:
% 0.47/0.70 P_empty_set-{F}(V0), subset-{F}(V1,V2) | pppp1-{T}(V1,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #9: input, references = 4, size of lhs = 2:
% 0.47/0.70 P_empty_set-{F}(V0), pppp1-{F}(V1,V2) | subset-{T}(V1,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #10: input, references = 6, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), pppp1-{F}(V1,V2), in-{F}(V3,V1) | in-{T}(V3,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #11: input, references = 5, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp1-{T}(V1,V2), pppp13-{T}(V1,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #12: input, references = 4, size of lhs = 1:
% 0.47/0.70 pppp13-{F}(V0,V1) | EXISTS V2: pppp5-{T}(V0,V1,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #13: input, references = 3, size of lhs = 2:
% 0.47/0.70 pppp5-{F}(V0,V1,V2), in-{F}(V2,V1) | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #14: input, references = 6, size of lhs = 1:
% 0.47/0.70 pppp5-{F}(V0,V1,V2) | in-{T}(V2,V0)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #15: input, references = 5, size of lhs = 2:
% 0.47/0.70 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4) | pppp3-{T}(V1,V2,V4)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #16: input, references = 3, size of lhs = 4:
% 0.47/0.70 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4), pppp3-{F}(V1,V2,V3), V3 == V4 | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #17: input, references = 5, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), pppp3-{F}(V1,V2,V3), in-{F}(V4,V3) | pppp2-{T}(V1,V2,V4)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #18: input, references = 3, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), pppp3-{F}(V1,V2,V3), pppp2-{F}(V1,V2,V4) | in-{T}(V4,V3)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #19: input, references = 4, size of lhs = 4:
% 0.47/0.70 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, #-{F} V3 | pppp3-{T}(V1,V2,V3), pppp14-{T}(V1,V2,V3)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #20: input, references = 3, size of lhs = 1:
% 0.47/0.70 pppp14-{F}(V0,V1,V2) | EXISTS V3: pppp6-{T}(V0,V1,V2,V3)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #21: input, references = 3, size of lhs = 3:
% 0.47/0.70 pppp6-{F}(V0,V1,V2,V3), pppp2-{F}(V0,V1,V3), in-{F}(V3,V2) | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #22: input, references = 4, size of lhs = 1:
% 0.47/0.70 pppp6-{F}(V0,V1,V2,V3) | in-{T}(V3,V2), pppp2-{T}(V0,V1,V3)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #23: input, references = 5, size of lhs = 2:
% 0.47/0.70 P_empty_set-{F}(V0), pppp2-{F}(V1,V2,V3) | in-{T}(V3,V1)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #24: input, references = 3, size of lhs = 2:
% 0.47/0.70 P_empty_set-{F}(V0), pppp2-{F}(V1,V2,V3) | in-{T}(V3,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #25: input, references = 3, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), in-{F}(V3,V1), in-{F}(V3,V2) | pppp2-{T}(V1,V2,V3)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #26: input, references = 3, size of lhs = 4:
% 0.47/0.70 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), disjoint-{F}(V1,V2), V3 == V0 | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #27: input, references = 3, size of lhs = 2:
% 0.47/0.70 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V0) | disjoint-{T}(V1,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #28: input, references = 3, size of lhs = 1:
% 0.47/0.70 P_empty_set-{F}(V0) | empty-{T}(V0)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #29: input, references = 4, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #30: input, references = 4, size of lhs = 1:
% 0.47/0.70 P_empty_set-{F}(V0) | EXISTS V1: pppp7-{T}(V1)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #31: input, references = 5, size of lhs = 1:
% 0.47/0.70 pppp7-{F}(V0) | empty-{T}(V0)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #32: input, references = 3, size of lhs = 1:
% 0.47/0.70 P_empty_set-{F}(V0) | EXISTS V1: pppp8-{T}(V1)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #33: input, references = 3, size of lhs = 2:
% 0.47/0.70 pppp8-{F}(V0), empty-{F}(V0) | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #34: input, references = 3, size of lhs = 2:
% 0.47/0.70 P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V1,V1)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #35: input, references = 3, size of lhs = 2:
% 0.47/0.70 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | disjoint-{T}(V2,V1)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #36: input, references = 3, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), subset-{F}(V1,V2), subset-{F}(V3,V1) | subset-{T}(V3,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #37: input, references = 4, size of lhs = 1:
% 0.47/0.70 P_empty_set-{F}(V0) | EXISTS V1: pppp9-{T}(V0,V1)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #38: input, references = 4, size of lhs = 2:
% 0.47/0.70 pppp9-{F}(V0,V1), subset-{F}(V0,V1) | FALSE
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #39: input, references = 4, size of lhs = 3:
% 0.47/0.70 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | disjoint-{T}(V1,V2), pppp15-{T}(V1,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.70
% 0.47/0.70 #40: input, references = 3, size of lhs = 1:
% 0.47/0.70 pppp15-{F}(V0,V1) | EXISTS V2: pppp10-{T}(V0,V1,V2)
% 0.47/0.70 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #41: input, references = 4, size of lhs = 4:
% 0.47/0.71 P_empty_set-{F}(V0), in-{F}(V3,V1), in-{F}(V3,V2), disjoint-{F}(V1,V2) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #42: input, references = 3, size of lhs = 1:
% 0.47/0.71 pppp10-{F}(V0,V1,V2) | in-{T}(V2,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #43: input, references = 3, size of lhs = 1:
% 0.47/0.71 pppp10-{F}(V0,V1,V2) | in-{T}(V2,V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #44: input, references = 4, size of lhs = 2:
% 0.47/0.71 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3) | disjoint-{T}(V1,V2), pppp16-{T}(V3)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #45: input, references = 3, size of lhs = 1:
% 0.47/0.71 pppp16-{F}(V0) | EXISTS V1: pppp11-{T}(V0,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #46: input, references = 3, size of lhs = 4:
% 0.47/0.71 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), in-{F}(V4,V3), disjoint-{F}(V1,V2) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #47: input, references = 3, size of lhs = 1:
% 0.47/0.71 pppp11-{F}(V0,V1) | in-{T}(V1,V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #48: input, references = 4, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), empty-{F}(V1), V1 == V0 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #49: input, references = 6, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), empty-{F}(V1), in-{F}(V2,V1) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #50: input, references = 4, size of lhs = 4:
% 0.47/0.71 P_empty_set-{F}(V0), empty-{F}(V1), empty-{F}(V2), V2 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #51: input, references = 6, size of lhs = 2:
% 0.47/0.71 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #52: input, references = 4, size of lhs = 0:
% 0.47/0.71 FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 number of initial rules = 53
% 0.47/0.71
% 0.47/0.71 Simplifiers:
% 0.47/0.71 #53: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #54: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #55: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 pppp4-{F}(V0,V1), pppp4-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #56: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 pppp5-{F}(V0,V1,V2), pppp5-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #57: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 pppp6-{F}(V0,V1,V2,V3), pppp6-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #58: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 pppp7-{F}(V0), pppp7-{F}(V1), V0 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #59: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 pppp8-{F}(V0), pppp8-{F}(V1), V0 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #60: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 pppp9-{F}(V0,V1), pppp9-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #61: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 pppp9-{F}(V0,V1), pppp9-{F}(V2,V3), V0 == V2 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #62: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 pppp10-{F}(V0,V1,V2), pppp10-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #63: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 pppp11-{F}(V0,V1), pppp11-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 number of simplifiers = 11
% 0.47/0.71
% 0.47/0.71 Learnt:
% 0.47/0.71 #65: exists( #51, #29 ), references = 1, size of lhs = 2:
% 0.47/0.71 P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V1,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #68: mergings( V0 == V2; #66 ), references = 3, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), #-{F} V1, V1 == V0 | pppp12-{T}(V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #75: mergings( V0 == V2; #72 ), references = 1, size of lhs = 1:
% 0.47/0.71 P_empty_set-{F}(V0) | pppp7-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #77: mergings( V0 == V2; #73 ), references = 1, size of lhs = 2:
% 0.47/0.71 P_empty_set-{F}(V0), empty-{F}(V1) | pppp7-{T}(V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #79: exists( #51, #1 ), references = 3, size of lhs = 1:
% 0.47/0.71 P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #87: mergings( V0 == V3; #83 ), references = 1, size of lhs = 2:
% 0.47/0.71 P_empty_set-{F}(V0), in-{F}(V1,V2) | pppp13-{T}(V2,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #90: mergings( V0 == V3, V3 == V4; #84 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), pppp0-{F}(V1), in-{F}(V2,V3) | pppp13-{T}(V3,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #93: mergings( V0 == V3, V3 == V4; #85 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), empty-{F}(V1), in-{F}(V2,V3) | pppp13-{T}(V3,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #105: mergings( V0 == V4; #103 ), references = 1, size of lhs = 4:
% 0.47/0.71 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), #-{F} V4, V4 == V3 | pppp14-{T}(V1,V2,V4)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #111: mergings( V0 == V3; #107 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), V3 == V0 | pppp15-{T}(V1,V2)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #113: mergings( V0 == V3; #108 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), in-{F}(V1,V2), in-{F}(V1,V3) | pppp15-{T}(V2,V3)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #116: mergings( V0 == V3, V4 == V3; #109 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), in-{F}(V1,V0), P_set_intersection2-{F}(V2,V3,V0) | pppp15-{T}(V2,V3)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #121: mergings( V0 == V3; #119 ), references = 4, size of lhs = 2:
% 0.47/0.71 P_empty_set-{F}(V0), pppp9-{F}(V1,V2) | pppp13-{T}(V1,V2)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #149: mergings( V2 == V3, V3 == V4; #145 ), references = 2, size of lhs = 4:
% 0.47/0.71 pppp12-{F}(V0), P_empty_set-{F}(V1), pppp0-{F}(V2), pppp3-{F}(V2,V3,V0) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #152: mergings( V2 == V3, V3 == V4; #146 ), references = 2, size of lhs = 4:
% 0.47/0.71 pppp12-{F}(V0), P_empty_set-{F}(V1), empty-{F}(V2), pppp3-{F}(V2,V3,V0) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #167: mergings( V3 == V4, V4 == V5; #163 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), pppp0-{F}(V1), #-{F} V2 | P_set_intersection2-{T}(V2,V1,V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #170: mergings( V3 == V4, V4 == V5; #164 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), empty-{F}(V1), #-{F} V2 | P_set_intersection2-{T}(V2,V1,V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #176: mergings( V3 == V5, V0 == V4; #171 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), V3 == V0 | pppp16-{T}(V3)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #179: mergings( V0 == V4, V3 == V4; #172 ), references = 1, size of lhs = 4:
% 0.47/0.71 P_empty_set-{F}(V0), in-{F}(V1,V2), in-{F}(V1,V3), P_set_intersection2-{F}(V2,V3,V0) | pppp16-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #183: mergings( V5 == V3, V0 == V4, V3 == V4; #173 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), in-{F}(V1,V0), P_set_intersection2-{F}(V2,V3,V0) | pppp16-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #189: disj( #22, input ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), pppp0-{F}(V1), pppp6-{F}(V2,V3,V1,V4) | pppp2-{T}(V2,V3,V4)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #190: disj( #22, input ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), empty-{F}(V1), pppp6-{F}(V2,V3,V1,V4) | pppp2-{T}(V2,V3,V4)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #191: disj( #22, input ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), disjoint-{F}(V1,V1), pppp6-{F}(V2,V3,V1,V4) | pppp2-{T}(V2,V3,V4)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #213: exists( #12, #207 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), pppp0-{F}(V1), pppp13-{F}(V1,V2) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #214: exists( #12, #208 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), empty-{F}(V1), pppp13-{F}(V1,V2) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #215: exists( #12, #209 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_empty_set-{F}(V0), disjoint-{F}(V1,V1), pppp13-{F}(V1,V2) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #224: mergings( V0 == V2, V2 == V3; #219 ), references = 1, size of lhs = 2:
% 0.47/0.71 pppp0-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #227: mergings( V0 == V2, V2 == V3; #220 ), references = 1, size of lhs = 2:
% 0.47/0.71 empty-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #230: mergings( V0 == V2, V2 == V3; #221 ), references = 1, size of lhs = 2:
% 0.47/0.71 P_empty_set-{F}(V0), disjoint-{F}(V0,V0) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #238: exists( #52, #234 ), references = 1, size of lhs = 0:
% 0.47/0.71 FALSE | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 number of learnt formulas = 30
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.71
% 0.47/0.71 randbase = 1
%------------------------------------------------------------------------------