TSTP Solution File: SEU143+2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SEU143+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n019.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:18 EDT 2022
% Result : Theorem 1.37s 1.53s
% Output : Refutation 1.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU143+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n019.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:42:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.37/1.53 GeoParameters:
% 1.37/1.53
% 1.37/1.53 tptp_input = 1
% 1.37/1.53 tptp_output = 0
% 1.37/1.53 nonempty = 1
% 1.37/1.53 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.37/1.53 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 1.37/1.53
% 1.37/1.53
% 1.37/1.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.37/1.53 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.37/1.53
% 1.37/1.53 RuleSystem INPUT:
% 1.37/1.53
% 1.37/1.53 Initial Rules:
% 1.37/1.53 #0: input, references = 3, size of lhs = 2:
% 1.37/1.53 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #1: input, references = 3, size of lhs = 2:
% 1.37/1.53 proper_subset-{F}(V0,V1), proper_subset-{F}(V1,V0) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #2: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_unordered_pair-{F}(V0,V1,V2), P_unordered_pair-{F}(V1,V0,V3), V2 == V3 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #3: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_set_union2-{F}(V0,V1,V2), P_set_union2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #4: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #5: input, references = 3, size of lhs = 1:
% 1.37/1.53 #-{F} V1 | pppp0-{T}(V1,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #6: input, references = 3, size of lhs = 2:
% 1.37/1.53 pppp0-{F}(V0,V1), V0 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #7: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp0-{F}(V0,V1) | subset-{T}(V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #8: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp0-{F}(V0,V1) | subset-{T}(V1,V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #9: input, references = 3, size of lhs = 2:
% 1.37/1.53 subset-{F}(V0,V1), subset-{F}(V1,V0) | pppp0-{T}(V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #10: input, references = 5, size of lhs = 1:
% 1.37/1.53 P_singleton-{F}(V0,V2) | pppp1-{T}(V0,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #11: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_singleton-{F}(V0,V2), pppp1-{F}(V0,V1), V1 == V2 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #12: input, references = 3, size of lhs = 3:
% 1.37/1.53 pppp1-{F}(V0,V1), in-{F}(V2,V1), V2 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #13: input, references = 5, size of lhs = 1:
% 1.37/1.53 pppp1-{F}(V0,V1) | in-{T}(V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #14: input, references = 4, size of lhs = 2:
% 1.37/1.53 #-{F} V0, #-{F} V1 | pppp1-{T}(V0,V1), pppp26-{T}(V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #15: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp26-{F}(V0,V1) | EXISTS V2: pppp13-{T}(V0,V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #16: input, references = 3, size of lhs = 2:
% 1.37/1.53 pppp13-{F}(V0,V1,V0), in-{F}(V0,V1) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #17: input, references = 3, size of lhs = 2:
% 1.37/1.53 pppp13-{F}(V0,V1,V2), V2 == V0 | in-{T}(V2,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #18: input, references = 4, size of lhs = 1:
% 1.37/1.53 P_empty_set-{F}(V0) | pppp2-{T}(V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #19: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp2-{F}(V1), V1 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #20: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp2-{F}(V1), in-{F}(V2,V1) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #21: input, references = 4, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1 | pppp2-{T}(V1), pppp27-{T}(V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #22: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp27-{F}(V0) | EXISTS V1: pppp14-{T}(V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #23: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp14-{F}(V0,V1) | in-{T}(V1,V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #24: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_unordered_pair-{F}(V1,V2,V4) | pppp4-{T}(V1,V2,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #25: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_unordered_pair-{F}(V1,V2,V4), pppp4-{F}(V1,V2,V3), V3 == V4 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #26: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp4-{F}(V1,V2,V3), in-{F}(V4,V3) | pppp3-{T}(V1,V2,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #27: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp4-{F}(V1,V2,V3), pppp3-{F}(V1,V2,V4) | in-{T}(V4,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #28: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, #-{F} V3 | pppp4-{T}(V1,V2,V3), pppp28-{T}(V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #29: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp28-{F}(V0,V1,V2) | EXISTS V3: pppp15-{T}(V0,V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #30: input, references = 3, size of lhs = 3:
% 1.37/1.53 pppp15-{F}(V0,V1,V2,V3), pppp3-{F}(V0,V1,V3), in-{F}(V3,V2) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #31: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp15-{F}(V0,V1,V2,V3) | in-{T}(V3,V2), pppp3-{T}(V0,V1,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #32: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), pppp3-{F}(V1,V2,V3), V3 == V1, V3 == V2 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #33: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp3-{T}(V1,V2,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #34: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp3-{T}(V1,V2,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #35: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_union2-{F}(V1,V2,V4) | pppp6-{T}(V1,V2,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #36: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_union2-{F}(V1,V2,V4), pppp6-{F}(V1,V2,V3), V3 == V4 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #37: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp6-{F}(V1,V2,V3), in-{F}(V4,V3) | pppp5-{T}(V1,V2,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #38: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp6-{F}(V1,V2,V3), pppp5-{F}(V1,V2,V4) | in-{T}(V4,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #39: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, #-{F} V3 | pppp6-{T}(V1,V2,V3), pppp29-{T}(V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #40: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp29-{F}(V0,V1,V2) | EXISTS V3: pppp16-{T}(V0,V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #41: input, references = 3, size of lhs = 3:
% 1.37/1.53 pppp16-{F}(V0,V1,V2,V3), pppp5-{F}(V0,V1,V3), in-{F}(V3,V2) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #42: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp16-{F}(V0,V1,V2,V3) | in-{T}(V3,V2), pppp5-{T}(V0,V1,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #43: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), pppp5-{F}(V1,V2,V3) | in-{T}(V3,V1), in-{T}(V3,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #44: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V2, in-{F}(V3,V1) | pppp5-{T}(V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #45: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, in-{F}(V3,V2) | pppp5-{T}(V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #46: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2) | pppp7-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #47: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), pppp7-{F}(V1,V2) | subset-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #48: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp7-{F}(V1,V2), in-{F}(V3,V1) | in-{T}(V3,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #49: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | pppp7-{T}(V1,V2), pppp30-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #50: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp30-{F}(V0,V1) | EXISTS V2: pppp17-{T}(V0,V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #51: input, references = 3, size of lhs = 2:
% 1.37/1.53 pppp17-{F}(V0,V1,V2), in-{F}(V2,V1) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #52: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp17-{F}(V0,V1,V2) | in-{T}(V2,V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #53: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4) | pppp9-{T}(V1,V2,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #54: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4), pppp9-{F}(V1,V2,V3), V3 == V4 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #55: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp9-{F}(V1,V2,V3), in-{F}(V4,V3) | pppp8-{T}(V1,V2,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #56: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp9-{F}(V1,V2,V3), pppp8-{F}(V1,V2,V4) | in-{T}(V4,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #57: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, #-{F} V3 | pppp9-{T}(V1,V2,V3), pppp31-{T}(V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #58: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp31-{F}(V0,V1,V2) | EXISTS V3: pppp18-{T}(V0,V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #59: input, references = 3, size of lhs = 3:
% 1.37/1.53 pppp18-{F}(V0,V1,V2,V3), pppp8-{F}(V0,V1,V3), in-{F}(V3,V2) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #60: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp18-{F}(V0,V1,V2,V3) | in-{T}(V3,V2), pppp8-{T}(V0,V1,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #61: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), pppp8-{F}(V1,V2,V3) | in-{T}(V3,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #62: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), pppp8-{F}(V1,V2,V3) | in-{T}(V3,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #63: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), in-{F}(V3,V1), in-{F}(V3,V2) | pppp8-{T}(V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #64: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V4) | pppp11-{T}(V1,V2,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #65: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V4), pppp11-{F}(V1,V2,V3), V3 == V4 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #66: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp11-{F}(V1,V2,V3), in-{F}(V4,V3) | pppp10-{T}(V1,V2,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #67: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp11-{F}(V1,V2,V3), pppp10-{F}(V1,V2,V4) | in-{T}(V4,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #68: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, #-{F} V3 | pppp11-{T}(V1,V2,V3), pppp32-{T}(V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #69: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp32-{F}(V0,V1,V2) | EXISTS V3: pppp19-{T}(V0,V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #70: input, references = 3, size of lhs = 3:
% 1.37/1.53 pppp19-{F}(V0,V1,V2,V3), pppp10-{F}(V0,V1,V3), in-{F}(V3,V2) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #71: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp19-{F}(V0,V1,V2,V3) | in-{T}(V3,V2), pppp10-{T}(V0,V1,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #72: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), pppp10-{F}(V1,V2,V3) | in-{T}(V3,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #73: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), pppp10-{F}(V1,V2,V3), in-{F}(V3,V2) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #74: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V2, in-{F}(V3,V1) | pppp10-{T}(V1,V2,V3), in-{T}(V3,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #75: input, references = 4, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), disjoint-{F}(V1,V2), V3 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #76: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V0) | disjoint-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #77: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), proper_subset-{F}(V1,V2) | pppp12-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #78: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), pppp12-{F}(V1,V2) | proper_subset-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #79: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), pppp12-{F}(V1,V2) | subset-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #80: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), pppp12-{F}(V2,V2) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #81: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2), V1 == V2 | pppp12-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #82: input, references = 3, size of lhs = 1:
% 1.37/1.53 P_empty_set-{F}(V0) | empty-{T}(V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #83: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_union2-{F}(V1,V2,V3), empty-{F}(V3) | empty-{T}(V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #84: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_union2-{F}(V2,V1,V3), empty-{F}(V3) | empty-{T}(V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #85: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_union2-{F}(V1,V1,V2), V2 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #86: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V1,V2), V2 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #87: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), proper_subset-{F}(V1,V1) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #88: input, references = 4, size of lhs = 1:
% 1.37/1.53 P_empty_set-{F}(V0) | EXISTS V1: pppp20-{T}(V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #89: input, references = 4, size of lhs = 3:
% 1.37/1.53 pppp20-{F}(V0,V1), P_singleton-{F}(V1,V2), V2 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #90: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V0) | subset-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #91: input, references = 4, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V3), subset-{F}(V1,V2), V3 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #92: input, references = 4, size of lhs = 1:
% 1.37/1.53 P_empty_set-{F}(V0) | EXISTS V1: pppp21-{T}(V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #93: input, references = 5, size of lhs = 1:
% 1.37/1.53 pppp21-{F}(V0) | empty-{T}(V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #94: input, references = 3, size of lhs = 1:
% 1.37/1.53 P_empty_set-{F}(V0) | EXISTS V1: pppp22-{T}(V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #95: input, references = 3, size of lhs = 2:
% 1.37/1.53 pppp22-{F}(V0), empty-{F}(V0) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #96: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V1,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #97: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | disjoint-{T}(V2,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #98: input, references = 4, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_union2-{F}(V1,V2,V3), subset-{F}(V1,V2), V3 == V2 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #99: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3) | subset-{T}(V3,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #100: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2), P_set_intersection2-{F}(V3,V2,V4), subset-{F}(V1,V3) | subset-{T}(V1,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #101: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_union2-{F}(V1,V0,V2), V2 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #102: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2), subset-{F}(V3,V1) | subset-{T}(V3,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #103: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2), P_set_intersection2-{F}(V1,V3,V4), P_set_intersection2-{F}(V2,V3,V5) | subset-{T}(V4,V5)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #104: input, references = 4, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), subset-{F}(V1,V2), V3 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #105: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V0,V2), V2 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #106: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, V1 == V2 | EXISTS V3: pppp23-{T}(V1,V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #107: input, references = 3, size of lhs = 3:
% 1.37/1.53 pppp23-{F}(V0,V1,V2), in-{F}(V2,V1), in-{F}(V2,V0) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #108: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp23-{F}(V0,V1,V2) | in-{T}(V2,V0), in-{T}(V2,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #109: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #110: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2), P_set_difference-{F}(V1,V3,V4), P_set_difference-{F}(V2,V3,V5) | subset-{T}(V4,V5)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #111: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V3) | subset-{T}(V3,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #112: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V0) | subset-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #113: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V3), subset-{F}(V1,V2), V3 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #114: input, references = 4, size of lhs = 5:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V2,V1,V3), P_set_union2-{F}(V1,V3,V4), P_set_union2-{F}(V1,V2,V5), V4 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #115: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V0,V2), V2 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #116: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | disjoint-{T}(V1,V2), pppp33-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #117: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp33-{F}(V0,V1) | EXISTS V2: pppp24-{T}(V0,V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #118: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), in-{F}(V3,V1), in-{F}(V3,V2), disjoint-{F}(V1,V2) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #119: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp24-{F}(V0,V1,V2) | in-{T}(V2,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #120: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp24-{F}(V0,V1,V2) | in-{T}(V2,V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #121: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V0), V1 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #122: input, references = 3, size of lhs = 5:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_union2-{F}(V1,V2,V3), P_set_difference-{F}(V3,V2,V4), P_set_difference-{F}(V1,V2,V5), V4 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #123: input, references = 3, size of lhs = 5:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V2,V1,V3), P_set_union2-{F}(V1,V3,V4), subset-{F}(V1,V2), V2 == V4 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #124: input, references = 3, size of lhs = 5:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V3), P_set_difference-{F}(V1,V3,V4), P_set_intersection2-{F}(V1,V2,V5), V4 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #125: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V0,V1,V2), V2 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #126: input, references = 4, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3) | disjoint-{T}(V1,V2), pppp34-{T}(V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #127: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp34-{F}(V0) | EXISTS V1: pppp25-{T}(V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #128: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), in-{F}(V4,V3), disjoint-{F}(V1,V2) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #129: input, references = 3, size of lhs = 1:
% 1.37/1.53 pppp25-{F}(V0,V1) | in-{T}(V1,V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #130: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2), proper_subset-{F}(V2,V1) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #131: input, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), disjoint-{F}(V1,V2), subset-{F}(V3,V1) | disjoint-{T}(V3,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #132: input, references = 4, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_unordered_pair-{F}(V1,V1,V2), P_singleton-{F}(V1,V3), V2 == V3 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #133: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), empty-{F}(V1), V1 == V0 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #134: input, references = 4, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), empty-{F}(V1), in-{F}(V2,V1) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #135: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_union2-{F}(V1,V2,V3) | subset-{T}(V1,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #136: input, references = 4, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V3), disjoint-{F}(V1,V2), V3 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #137: input, references = 3, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V1) | disjoint-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #138: input, references = 4, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), empty-{F}(V1), empty-{F}(V2), V2 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #139: input, references = 3, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V2,V1), P_set_union2-{F}(V3,V2,V4), subset-{F}(V3,V1) | subset-{T}(V4,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #140: input, references = 5, size of lhs = 2:
% 1.37/1.53 #-{F} V0, #-{F} V1 | EXISTS V2: P_unordered_pair-{T}(V0,V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #141: input, references = 5, size of lhs = 2:
% 1.37/1.53 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_union2-{T}(V0,V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #142: input, references = 5, size of lhs = 2:
% 1.37/1.53 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #143: input, references = 4, size of lhs = 1:
% 1.37/1.53 #-{F} V0 | EXISTS V1: P_singleton-{T}(V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #144: input, references = 4, size of lhs = 0:
% 1.37/1.53 FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #145: input, references = 5, size of lhs = 2:
% 1.37/1.53 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_difference-{T}(V0,V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 number of initial rules = 146
% 1.37/1.53
% 1.37/1.53 Simplifiers:
% 1.37/1.53 #146: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 P_unordered_pair-{F}(V0,V1,V2), P_unordered_pair-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #147: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 P_set_union2-{F}(V0,V1,V2), P_set_union2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #148: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #149: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 P_singleton-{F}(V0,V1), P_singleton-{F}(V0,V3), V1 == V3 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #150: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #151: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 P_set_difference-{F}(V0,V1,V2), P_set_difference-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #152: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp13-{F}(V0,V1,V2), pppp13-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #153: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp14-{F}(V0,V1), pppp14-{F}(V0,V3), V1 == V3 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #154: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp15-{F}(V0,V1,V2,V3), pppp15-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #155: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp16-{F}(V0,V1,V2,V3), pppp16-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #156: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp17-{F}(V0,V1,V2), pppp17-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #157: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp18-{F}(V0,V1,V2,V3), pppp18-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #158: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp19-{F}(V0,V1,V2,V3), pppp19-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #159: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp20-{F}(V0,V1), pppp20-{F}(V0,V3), V1 == V3 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #160: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp20-{F}(V0,V1), pppp20-{F}(V2,V3), V0 == V2 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #161: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp21-{F}(V0), pppp21-{F}(V1), V0 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #162: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp22-{F}(V0), pppp22-{F}(V1), V0 == V1 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #163: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp23-{F}(V0,V1,V2), pppp23-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #164: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp24-{F}(V0,V1,V2), pppp24-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #165: unsound, references = 3, size of lhs = 3:
% 1.37/1.53 pppp25-{F}(V0,V1), pppp25-{F}(V0,V3), V1 == V3 | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 number of simplifiers = 20
% 1.37/1.53
% 1.37/1.53 Learnt:
% 1.37/1.53 #167: disj( #14, input ), references = 1, size of lhs = 3:
% 1.37/1.53 P_singleton-{F}(V0,V1), #-{F} V2, V2 == V1 | pppp26-{T}(V0,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #174: exists( #142, #86 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V1,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #175: exists( #142, #104 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2) | P_set_intersection2-{T}(V1,V2,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #177: exists( #140, #132 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), P_singleton-{F}(V1,V2) | P_unordered_pair-{T}(V1,V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #186: exists( #141, #85 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1 | P_set_union2-{T}(V1,V1,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #187: exists( #141, #98 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2) | P_set_union2-{T}(V1,V2,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #200: mergings( V0 == V2; #197 ), references = 1, size of lhs = 1:
% 1.37/1.53 P_empty_set-{F}(V0) | pppp21-{T}(V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #202: mergings( V0 == V2; #198 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), empty-{F}(V1) | pppp21-{T}(V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #217: exists( #140, #2 ), references = 1, size of lhs = 1:
% 1.37/1.53 P_unordered_pair-{F}(V0,V1,V2) | P_unordered_pair-{T}(V1,V0,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #221: exists( #141, #3 ), references = 1, size of lhs = 1:
% 1.37/1.53 P_set_union2-{F}(V0,V1,V2) | P_set_union2-{T}(V1,V0,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #222: exists( #141, #101 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1 | P_set_union2-{T}(V1,V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #223: exists( #141, #114 ), references = 1, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V3), P_set_union2-{F}(V2,V1,V4) | P_set_union2-{T}(V2,V3,V4)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #233: exists( #145, #91 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), subset-{F}(V1,V2) | P_set_difference-{T}(V1,V2,V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #244: exists( #142, #4 ), references = 1, size of lhs = 1:
% 1.37/1.53 P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #245: exists( #142, #105 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V0,V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #246: exists( #142, #75 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | P_set_intersection2-{T}(V1,V2,V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #264: mergings( V3 == V5, V0 == V4; #260 ), references = 1, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), V3 == V0 | pppp34-{T}(V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #267: mergings( V0 == V4, V3 == V4; #261 ), references = 1, size of lhs = 4:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V0), P_set_difference-{F}(V1,V2,V3), V3 == V1 | pppp34-{T}(V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #279: mergings( V0 == V2; #276 ), references = 1, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1, V1 == V0 | pppp27-{T}(V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #282: mergings( V0 == V2, V1 == V2; #277 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), in-{F}(V1,V0) | pppp27-{T}(V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #291: exists( #145, #115 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), #-{F} V1 | P_set_difference-{T}(V1,V0,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #292: exists( #145, #136 ), references = 1, size of lhs = 2:
% 1.37/1.53 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | P_set_difference-{T}(V1,V2,V1)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #305: mergings( V0 == V3; #301 ), references = 1, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), V3 == V0 | pppp33-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #307: mergings( V0 == V3; #302 ), references = 1, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V3), V3 == V1 | pppp33-{T}(V1,V2)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #309: mergings( V0 == V3; #303 ), references = 1, size of lhs = 3:
% 1.37/1.53 P_empty_set-{F}(V0), in-{F}(V1,V2), in-{F}(V1,V3) | pppp33-{T}(V2,V3)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #315: exists( #143, #89 ), references = 1, size of lhs = 1:
% 1.37/1.53 pppp20-{F}(V0,V1) | P_singleton-{T}(V1,V0)
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #328: mergings( V0 == V2; #325 ), references = 1, size of lhs = 2:
% 1.37/1.53 pppp2-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #330: mergings( V0 == V2; #326 ), references = 1, size of lhs = 2:
% 1.37/1.53 empty-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 #335: exists( #144, #332 ), references = 1, size of lhs = 0:
% 1.37/1.53 FALSE | FALSE
% 1.37/1.53 (used 0 times, uses = {})
% 1.37/1.53
% 1.37/1.53 number of learnt formulas = 29
% 1.37/1.53
% 1.37/1.53
% 1.37/1.53 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.37/1.53
% 1.37/1.53 randbase = 1
%------------------------------------------------------------------------------