TSTP Solution File: SEU056+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SEU056+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n008.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:08 EDT 2022
% Result : Theorem 1.67s 1.89s
% Output : Refutation 1.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU056+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Jul 22 19:13:08 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.67/1.89 GeoParameters:
% 1.67/1.89
% 1.67/1.89 tptp_input = 1
% 1.67/1.89 tptp_output = 0
% 1.67/1.89 nonempty = 1
% 1.67/1.89 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.67/1.89 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 1.67/1.89
% 1.67/1.89
% 1.67/1.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.67/1.89 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.67/1.89
% 1.67/1.89 RuleSystem INPUT:
% 1.67/1.89
% 1.67/1.89 Initial Rules:
% 1.67/1.89 #0: input, references = 3, size of lhs = 2:
% 1.67/1.89 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #1: input, references = 3, size of lhs = 1:
% 1.67/1.89 empty-{F}(V0) | function-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #2: input, references = 3, size of lhs = 1:
% 1.67/1.89 empty-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #3: input, references = 3, size of lhs = 3:
% 1.67/1.89 relation-{F}(V0), empty-{F}(V0), function-{F}(V0) | one_to_one-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #4: input, references = 4, size of lhs = 3:
% 1.67/1.89 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #5: input, references = 5, size of lhs = 4:
% 1.67/1.89 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), disjoint-{F}(V1,V2), V3 == V0 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #6: input, references = 5, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V0) | disjoint-{T}(V1,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #7: input, references = 5, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), #-{F} V1 | EXISTS V2: pppp0-{T}(V1,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #8: input, references = 5, size of lhs = 1:
% 1.67/1.89 pppp0-{F}(V0,V1) | element-{T}(V1,V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #9: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | empty-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #10: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #11: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | relation_empty_yielding-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #12: input, references = 3, size of lhs = 4:
% 1.67/1.89 P_empty_set-{F}(V0), relation-{F}(V1), P_set_intersection2-{F}(V2,V1,V3), relation-{F}(V2) | relation-{T}(V3)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #13: input, references = 3, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V1,V2), empty-{F}(V2) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #14: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | empty-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #15: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | empty-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #16: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #17: input, references = 4, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V1,V2), V2 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #18: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | EXISTS V1: pppp1-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #19: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp1-{F}(V0) | function-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #20: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp1-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #21: input, references = 4, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | EXISTS V1: pppp2-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #22: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp2-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #23: input, references = 5, size of lhs = 1:
% 1.67/1.89 pppp2-{F}(V0) | empty-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #24: input, references = 4, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | empty-{T}(V1), pppp14-{T}(V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #25: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp14-{F}(V0) | EXISTS V1: pppp3-{T}(V1,V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #26: input, references = 3, size of lhs = 2:
% 1.67/1.89 pppp3-{F}(V0,V1), empty-{F}(V0) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #27: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp3-{F}(V0,V1) | element-{T}(V0,V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #28: input, references = 4, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | EXISTS V1: pppp4-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #29: input, references = 5, size of lhs = 1:
% 1.67/1.89 pppp4-{F}(V0) | empty-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #30: input, references = 4, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | EXISTS V1: pppp5-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #31: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp5-{F}(V0) | function-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #32: input, references = 5, size of lhs = 1:
% 1.67/1.89 pppp5-{F}(V0) | empty-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #33: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp5-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #34: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | EXISTS V1: pppp6-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #35: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp6-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #36: input, references = 3, size of lhs = 2:
% 1.67/1.89 pppp6-{F}(V0), empty-{F}(V0) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #37: input, references = 4, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | EXISTS V3: pppp7-{T}(V3,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #38: input, references = 4, size of lhs = 1:
% 1.67/1.89 pppp7-{F}(V0,V1) | empty-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #39: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp7-{F}(V0,V1) | element-{T}(V0,V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #40: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | EXISTS V1: pppp8-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #41: input, references = 3, size of lhs = 2:
% 1.67/1.89 pppp8-{F}(V0), empty-{F}(V0) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #42: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | EXISTS V1: pppp9-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #43: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp9-{F}(V0) | one_to_one-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #44: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp9-{F}(V0) | function-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #45: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp9-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #46: input, references = 3, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | EXISTS V1: pppp10-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #47: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp10-{F}(V0) | relation_empty_yielding-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #48: input, references = 3, size of lhs = 1:
% 1.67/1.89 pppp10-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #49: input, references = 3, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V1,V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #50: input, references = 3, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | disjoint-{T}(V2,V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #51: input, references = 6, size of lhs = 10:
% 1.67/1.89 P_empty_set-{F}(V0), relation-{F}(V1), function-{F}(V1), one_to_one-{F}(V1), P_set_intersection2-{F}(V3,V2,V4), P_relation_image-{F}(V1,V4,V5), P_relation_image-{F}(V1,V3,V6), P_relation_image-{F}(V1,V2,V7), P_set_intersection2-{F}(V6,V7,V8), V5 == V8 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #52: input, references = 4, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | EXISTS V1: pppp13-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #53: input, references = 4, size of lhs = 1:
% 1.67/1.89 pppp13-{F}(V0) | EXISTS V1: pppp12-{T}(V0,V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #54: input, references = 4, size of lhs = 1:
% 1.67/1.89 pppp13-{F}(V0) | one_to_one-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #55: input, references = 4, size of lhs = 1:
% 1.67/1.89 pppp13-{F}(V0) | function-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #56: input, references = 4, size of lhs = 1:
% 1.67/1.89 pppp13-{F}(V0) | relation-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #57: input, references = 5, size of lhs = 1:
% 1.67/1.89 pppp12-{F}(V0,V1) | EXISTS V2: pppp11-{T}(V2,V1,V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #58: input, references = 6, size of lhs = 4:
% 1.67/1.89 pppp11-{F}(V0,V1,V2), P_relation_image-{F}(V2,V0,V3), P_relation_image-{F}(V2,V1,V4), disjoint-{F}(V3,V4) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #59: input, references = 4, size of lhs = 3:
% 1.67/1.89 pppp11-{F}(V0,V1,V2), P_relation_image-{F}(V2,V0,V3), P_relation_image-{F}(V2,V1,V4) | disjoint-{T}(V0,V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #60: input, references = 4, size of lhs = 4:
% 1.67/1.89 P_empty_set-{F}(V0), P_relation_image-{F}(V1,V0,V2), relation-{F}(V1), V2 == V0 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #61: input, references = 3, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), in-{F}(V1,V2) | element-{T}(V1,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #62: input, references = 4, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V0,V2), V2 == V0 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #63: input, references = 4, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), element-{F}(V2,V1) | empty-{T}(V1), in-{T}(V2,V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #64: input, references = 3, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V2,V3), element-{F}(V1,V3) | subset-{T}(V1,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #65: input, references = 3, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V2,V3), subset-{F}(V1,V2) | element-{T}(V1,V3)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #66: input, references = 3, size of lhs = 4:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V2,V3), element-{F}(V1,V3), in-{F}(V4,V1) | element-{T}(V4,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #67: input, references = 4, size of lhs = 5:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V1,V2), empty-{F}(V1), element-{F}(V3,V2), in-{F}(V4,V3) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #68: input, references = 7, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1), V1 == V0 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #69: input, references = 3, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1), in-{F}(V2,V1) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #70: input, references = 6, size of lhs = 4:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1), empty-{F}(V2), V2 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #71: input, references = 9, size of lhs = 2:
% 1.67/1.89 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #72: input, references = 4, size of lhs = 0:
% 1.67/1.89 FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #73: input, references = 3, size of lhs = 1:
% 1.67/1.89 #-{F} V0 | EXISTS V1: P_powerset-{T}(V0,V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #74: input, references = 10, size of lhs = 2:
% 1.67/1.89 #-{F} V0, #-{F} V1 | EXISTS V2: P_relation_image-{T}(V0,V1,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 number of initial rules = 75
% 1.67/1.89
% 1.67/1.89 Simplifiers:
% 1.67/1.89 #75: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #76: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #77: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 P_powerset-{F}(V0,V1), P_powerset-{F}(V0,V3), V1 == V3 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #78: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 P_relation_image-{F}(V0,V1,V2), P_relation_image-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #79: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp0-{F}(V0,V1), pppp0-{F}(V0,V3), V1 == V3 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #80: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp1-{F}(V0), pppp1-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #81: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp2-{F}(V0), pppp2-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #82: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp3-{F}(V0,V1), pppp3-{F}(V2,V1), V0 == V2 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #83: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp4-{F}(V0), pppp4-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #84: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp5-{F}(V0), pppp5-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #85: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp6-{F}(V0), pppp6-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #86: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp7-{F}(V0,V1), pppp7-{F}(V2,V1), V0 == V2 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #87: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp8-{F}(V0), pppp8-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #88: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp9-{F}(V0), pppp9-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #89: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp10-{F}(V0), pppp10-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #90: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp11-{F}(V0,V1,V2), pppp11-{F}(V3,V1,V2), V0 == V3 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #91: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp11-{F}(V0,V1,V2), pppp11-{F}(V3,V4,V2), V1 == V4 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #92: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp11-{F}(V0,V1,V2), pppp11-{F}(V3,V4,V5), V2 == V5 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #93: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp12-{F}(V0,V1), pppp12-{F}(V0,V3), V1 == V3 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #94: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp12-{F}(V0,V1), pppp12-{F}(V2,V3), V0 == V2 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #95: unsound, references = 3, size of lhs = 3:
% 1.67/1.89 pppp13-{F}(V0), pppp13-{F}(V1), V0 == V1 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 number of simplifiers = 21
% 1.67/1.89
% 1.67/1.89 Learnt:
% 1.67/1.89 #97: exists( #71, #17 ), references = 1, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V1,V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #104: mergings( V0 == V2; #101 ), references = 1, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | pppp2-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #106: mergings( V0 == V2; #102 ), references = 1, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1) | pppp2-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #108: exists( #71, #62 ), references = 2, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V0,V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #115: mergings( V0 == V2; #112 ), references = 1, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | pppp4-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #117: mergings( V0 == V2; #113 ), references = 1, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1) | pppp4-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #124: mergings( V0 == V2; #121 ), references = 1, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | pppp5-{T}(V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #126: mergings( V0 == V2; #122 ), references = 1, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1) | pppp5-{T}(V1)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #129: exists( #71, #4 ), references = 3, size of lhs = 1:
% 1.67/1.89 P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #130: exists( #71, #5 ), references = 1, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | P_set_intersection2-{T}(V1,V2,V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #132: exists( #74, #60 ), references = 2, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), relation-{F}(V1) | P_relation_image-{T}(V1,V0,V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #137: mergings( V0 == V3; #133 ), references = 1, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V1,V2), V1 == V0 | pppp14-{T}(V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #140: mergings( V0 == V3, V1 == V3; #134 ), references = 1, size of lhs = 4:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1), V0 == V1, P_powerset-{F}(V0,V2) | pppp14-{T}(V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #143: mergings( V0 == V3, V1 == V3; #135 ), references = 1, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V1,V0), P_powerset-{F}(V0,V2) | pppp14-{T}(V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #148: mergings( V0 == V3; #144 ), references = 1, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), element-{F}(V1,V2), P_powerset-{F}(V3,V2) | in-{T}(V1,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #150: mergings( V0 == V3; #145 ), references = 2, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), element-{F}(V1,V2), V2 == V0 | in-{T}(V1,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #153: mergings( V0 == V3, V2 == V3; #146 ), references = 1, size of lhs = 4:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1), V0 == V1, element-{F}(V2,V0) | in-{T}(V2,V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #161: mergings( V0 == V3, V3 == V4; #158 ), references = 2, size of lhs = 5:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1), P_powerset-{F}(V1,V2), element-{F}(V3,V2), V3 == V0 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #173: mergings( V0 == V4; #171 ), references = 1, size of lhs = 2:
% 1.67/1.89 P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | pppp7-{T}(V0,V2)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #178: mergings( V0 == V3; #176 ), references = 1, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), empty-{F}(V1), P_powerset-{F}(V1,V2) | pppp0-{T}(V2,V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #192: exists( #71, #51 ), references = 2, size of lhs = 8:
% 1.67/1.89 P_empty_set-{F}(V0), relation-{F}(V1), function-{F}(V1), one_to_one-{F}(V1), P_relation_image-{F}(V1,V2,V3), P_set_intersection2-{F}(V2,V4,V5), P_relation_image-{F}(V1,V5,V6), P_relation_image-{F}(V1,V4,V7) | P_set_intersection2-{T}(V3,V7,V6)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #208: exists( #74, #206 ), references = 1, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), P_relation_image-{F}(V1,V2,V0), pppp11-{F}(V3,V2,V1) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #210: exists( #57, #207 ), references = 1, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), pppp12-{F}(V1,V2), P_relation_image-{F}(V1,V2,V0) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #228: exists( #71, #51 ), references = 1, size of lhs = 8:
% 1.67/1.89 P_empty_set-{F}(V0), relation-{F}(V1), function-{F}(V1), one_to_one-{F}(V1), P_relation_image-{F}(V1,V2,V3), P_set_intersection2-{F}(V2,V4,V5), P_relation_image-{F}(V1,V5,V6), P_relation_image-{F}(V1,V4,V7) | P_set_intersection2-{T}(V3,V7,V6)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #234: mergings( V3 == V4; #232 ), references = 2, size of lhs = 9:
% 1.67/1.89 relation-{F}(V0), function-{F}(V0), one_to_one-{F}(V0), P_empty_set-{F}(V1), P_relation_image-{F}(V0,V2,V1), P_relation_image-{F}(V0,V3,V4), P_set_intersection2-{F}(V3,V5,V2), pppp11-{F}(V5,V6,V0), P_relation_image-{F}(V0,V6,V4) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #249: exists( #74, #51 ), references = 2, size of lhs = 8:
% 1.67/1.89 P_empty_set-{F}(V0), relation-{F}(V1), function-{F}(V1), one_to_one-{F}(V1), P_relation_image-{F}(V1,V2,V3), P_set_intersection2-{F}(V2,V4,V5), P_relation_image-{F}(V1,V4,V6), P_set_intersection2-{F}(V3,V6,V7) | P_relation_image-{T}(V1,V5,V7)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #265: mergings( V3 == V4; #263 ), references = 1, size of lhs = 12:
% 1.67/1.89 P_empty_set-{F}(V0), relation-{F}(V1), function-{F}(V1), one_to_one-{F}(V1), P_relation_image-{F}(V1,V2,V3), P_relation_image-{F}(V1,V4,V3), P_set_intersection2-{F}(V2,V5,V6), P_relation_image-{F}(V1,V6,V7), P_set_intersection2-{F}(V4,V5,V8), pppp11-{F}(V8,V9,V1), P_relation_image-{F}(V1,V9,V10), disjoint-{F}(V7,V10) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #285: exists( #74, #282 ), references = 2, size of lhs = 5:
% 1.67/1.89 P_empty_set-{F}(V0), pppp11-{F}(V1,V2,V3), P_relation_image-{F}(V3,V2,V4), P_set_intersection2-{F}(V1,V2,V5), V5 == V0 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #288: exists( #71, #286 ), references = 1, size of lhs = 3:
% 1.67/1.89 P_empty_set-{F}(V0), pppp11-{F}(V1,V2,V3), P_relation_image-{F}(V3,V2,V4) | P_set_intersection2-{T}(V2,V1,V0)
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #293: mergings( V3 == V4, V5 == V6; #290 ), references = 2, size of lhs = 7:
% 1.67/1.89 relation-{F}(V0), function-{F}(V0), one_to_one-{F}(V0), pppp12-{F}(V0,V1), P_empty_set-{F}(V2), P_relation_image-{F}(V0,V2,V2), P_relation_image-{F}(V0,V1,V3) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #312: exists( #74, #293 ), references = 1, size of lhs = 6:
% 1.67/1.89 relation-{F}(V0), function-{F}(V0), one_to_one-{F}(V0), pppp12-{F}(V0,V1), P_empty_set-{F}(V2), P_relation_image-{F}(V0,V2,V2) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #313: exists( #74, #285 ), references = 1, size of lhs = 4:
% 1.67/1.89 P_empty_set-{F}(V0), pppp11-{F}(V1,V2,V3), P_set_intersection2-{F}(V1,V2,V4), V4 == V0 | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #315: exists( #53, #310 ), references = 2, size of lhs = 6:
% 1.67/1.89 pppp13-{F}(V0), relation-{F}(V0), function-{F}(V0), one_to_one-{F}(V0), P_empty_set-{F}(V1), P_relation_image-{F}(V0,V1,V1) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #323: mergings( V0 == V2; #321 ), references = 1, size of lhs = 1:
% 1.67/1.89 P_empty_set-{F}(V0) | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 #325: exists( #72, #321 ), references = 1, size of lhs = 0:
% 1.67/1.89 FALSE | FALSE
% 1.67/1.89 (used 0 times, uses = {})
% 1.67/1.89
% 1.67/1.89 number of learnt formulas = 35
% 1.67/1.89
% 1.67/1.89
% 1.67/1.89 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.67/1.89
% 1.67/1.89 randbase = 1
%------------------------------------------------------------------------------