TSTP Solution File: SEU107+1 by Geo-III---2018C

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : geo -tptp_input -nonempty -inputfile %s

% Computer : n016.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:12 EDT 2022

% Result   : Theorem 0.84s 1.08s
% Output   : Refutation 0.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n016.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:29:15 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.84/1.08  GeoParameters:
% 0.84/1.08  
% 0.84/1.08  tptp_input =     1
% 0.84/1.08  tptp_output =    0
% 0.84/1.08  nonempty =       1
% 0.84/1.08  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.08  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.84/1.08  
% 0.84/1.08  
% 0.84/1.08  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.08  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.08  
% 0.84/1.08  RuleSystem INPUT:
% 0.84/1.08  
% 0.84/1.08  Initial Rules:
% 0.84/1.08  #0: input, references = 3, size of lhs = 2:
% 0.84/1.08     in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #1: input, references = 3, size of lhs = 1:
% 0.84/1.08     empty-{F}(V0) | finite-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #2: input, references = 3, size of lhs = 1:
% 0.84/1.08     preboolean-{F}(V0) | cup_closed-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #3: input, references = 3, size of lhs = 1:
% 0.84/1.08     preboolean-{F}(V0) | diff_closed-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #4: input, references = 3, size of lhs = 3:
% 0.84/1.08     P_powerset-{F}(V0,V1), finite-{F}(V0), element-{F}(V2,V1) | finite-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #5: input, references = 3, size of lhs = 2:
% 0.84/1.08     cup_closed-{F}(V0), diff_closed-{F}(V0) | preboolean-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #6: input, references = 4, size of lhs = 4:
% 0.84/1.08     preboolean-{F}(V0), element-{F}(V1,V0), P_prebool_difference-{F}(V0,V2,V1,V3), element-{F}(V2,V0) | empty-{T}(V0), element-{T}(V3,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #7: input, references = 5, size of lhs = 1:
% 0.84/1.08     #-{F} V0 | EXISTS V1: pppp0-{T}(V0,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #8: input, references = 5, size of lhs = 1:
% 0.84/1.08     pppp0-{F}(V0,V1) | element-{T}(V1,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #9: input, references = 3, size of lhs = 2:
% 0.84/1.08     finite-{F}(V0), P_set_difference-{F}(V0,V1,V2) | finite-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #10: input, references = 3, size of lhs = 2:
% 0.84/1.08     P_powerset-{F}(V0,V1), empty-{F}(V1) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #11: input, references = 4, size of lhs = 1:
% 0.84/1.08     P_empty_set-{F}(V0) | empty-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #12: input, references = 3, size of lhs = 1:
% 0.84/1.08     P_empty_set-{F}(V0) | EXISTS V1: pppp1-{T}(V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #13: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp1-{F}(V0) | finite-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #14: input, references = 3, size of lhs = 2:
% 0.84/1.08     pppp1-{F}(V0), empty-{F}(V0) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #15: input, references = 3, size of lhs = 1:
% 0.84/1.08     P_empty_set-{F}(V0) | EXISTS V1: pppp3-{T}(V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #16: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp3-{F}(V0) | pppp2-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #17: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp2-{F}(V0) | preboolean-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #18: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp2-{F}(V0) | diff_closed-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #19: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp2-{F}(V0) | cap_closed-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #20: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp2-{F}(V0) | cup_closed-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #21: input, references = 4, size of lhs = 2:
% 0.84/1.08     pppp2-{F}(V0), empty-{F}(V0) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #22: input, references = 4, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | empty-{T}(V1), pppp13-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #23: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp13-{F}(V0) | EXISTS V1: pppp4-{T}(V1,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #24: input, references = 3, size of lhs = 2:
% 0.84/1.08     pppp4-{F}(V0,V1), empty-{F}(V0) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #25: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp4-{F}(V0,V1) | element-{T}(V0,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #26: input, references = 4, size of lhs = 1:
% 0.84/1.08     P_empty_set-{F}(V0) | EXISTS V1: pppp5-{T}(V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #27: input, references = 5, size of lhs = 1:
% 0.84/1.08     pppp5-{F}(V0) | empty-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #28: input, references = 4, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | EXISTS V3: pppp7-{T}(V2,V3)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #29: input, references = 4, size of lhs = 1:
% 0.84/1.08     pppp7-{F}(V0,V1) | pppp6-{T}(V1,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #30: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | finite-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #31: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | natural-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #32: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | ordinal-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #33: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | epsilon_connected-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #34: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | epsilon_transitive-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #35: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | one_to_one-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #36: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | function-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #37: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | relation-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #38: input, references = 4, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | empty-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #39: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp6-{F}(V0,V1) | element-{T}(V0,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #40: input, references = 4, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | EXISTS V3: pppp8-{T}(V3,V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #41: input, references = 4, size of lhs = 1:
% 0.84/1.08     pppp8-{F}(V0,V1) | empty-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #42: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp8-{F}(V0,V1) | element-{T}(V0,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #43: input, references = 3, size of lhs = 1:
% 0.84/1.08     P_empty_set-{F}(V0) | EXISTS V1: pppp9-{T}(V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #44: input, references = 3, size of lhs = 2:
% 0.84/1.08     pppp9-{F}(V0), empty-{F}(V0) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #45: input, references = 4, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | empty-{T}(V1), pppp14-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #46: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp14-{F}(V0) | EXISTS V1: pppp10-{T}(V1,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #47: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp10-{F}(V0,V1) | finite-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #48: input, references = 3, size of lhs = 2:
% 0.84/1.08     pppp10-{F}(V0,V1), empty-{F}(V0) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #49: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp10-{F}(V0,V1) | element-{T}(V0,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #50: input, references = 4, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | empty-{T}(V1), pppp15-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #51: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp15-{F}(V0) | EXISTS V1: pppp11-{T}(V1,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #52: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp11-{F}(V0,V1) | finite-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #53: input, references = 3, size of lhs = 2:
% 0.84/1.08     pppp11-{F}(V0,V1), empty-{F}(V0) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #54: input, references = 3, size of lhs = 1:
% 0.84/1.08     pppp11-{F}(V0,V1) | element-{T}(V0,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #55: input, references = 6, size of lhs = 7:
% 0.84/1.08     P_empty_set-{F}(V0), preboolean-{F}(V1), element-{F}(V2,V1), P_prebool_difference-{F}(V1,V3,V2,V4), P_set_difference-{F}(V3,V2,V5), element-{F}(V3,V1), V4 == V5 | empty-{T}(V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #56: input, references = 4, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V1,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #57: input, references = 4, size of lhs = 1:
% 0.84/1.08     P_empty_set-{F}(V0) | EXISTS V1: pppp12-{T}(V1,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #58: input, references = 4, size of lhs = 2:
% 0.84/1.08     pppp12-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #59: input, references = 4, size of lhs = 1:
% 0.84/1.08     pppp12-{F}(V0,V1) | preboolean-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #60: input, references = 4, size of lhs = 2:
% 0.84/1.08     pppp12-{F}(V0,V1), empty-{F}(V0) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #61: input, references = 3, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), in-{F}(V1,V2) | element-{T}(V1,V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #62: input, references = 4, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), element-{F}(V2,V1) | empty-{T}(V1), in-{T}(V2,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #63: input, references = 3, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V0) | subset-{T}(V1,V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #64: input, references = 5, size of lhs = 4:
% 0.84/1.08     P_empty_set-{F}(V0), P_set_difference-{F}(V1,V2,V3), subset-{F}(V1,V2), V3 == V0 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #65: input, references = 4, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), P_set_difference-{F}(V1,V0,V2), V2 == V1 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #66: input, references = 4, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V2,V3), element-{F}(V1,V3) | subset-{T}(V1,V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #67: input, references = 3, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V2,V3), subset-{F}(V1,V2) | element-{T}(V1,V3)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #68: input, references = 4, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), P_set_difference-{F}(V0,V1,V2), V2 == V0 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #69: input, references = 4, size of lhs = 4:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V2,V3), element-{F}(V1,V3), in-{F}(V4,V1) | element-{T}(V4,V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #70: input, references = 3, size of lhs = 5:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2), empty-{F}(V1), element-{F}(V3,V2), in-{F}(V4,V3) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #71: input, references = 7, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), empty-{F}(V1), V1 == V0 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #72: input, references = 4, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), empty-{F}(V1), in-{F}(V2,V1) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #73: input, references = 4, size of lhs = 4:
% 0.84/1.08     P_empty_set-{F}(V0), empty-{F}(V1), empty-{F}(V2), V2 == V1 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #74: input, references = 3, size of lhs = 1:
% 0.84/1.08     #-{F} V0 | EXISTS V1: P_powerset-{T}(V0,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #75: input, references = 4, size of lhs = 3:
% 0.84/1.08     #-{F} V0, #-{F} V1, #-{F} V2 | EXISTS V3: P_prebool_difference-{T}(V0,V1,V2,V3)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #76: input, references = 6, size of lhs = 2:
% 0.84/1.08     #-{F} V0, #-{F} V1 | EXISTS V2: P_set_difference-{T}(V0,V1,V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #77: input, references = 4, size of lhs = 0:
% 0.84/1.08     FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  number of initial rules = 78
% 0.84/1.08  
% 0.84/1.08  Simplifiers:
% 0.84/1.08  #78: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     cap_closed-{F}(V0), cap_closed-{F}(V1), V0 == V1 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #79: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     P_powerset-{F}(V0,V1), P_powerset-{F}(V0,V3), V1 == V3 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #80: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     P_prebool_difference-{F}(V0,V1,V2,V3), P_prebool_difference-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #81: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     P_set_difference-{F}(V0,V1,V2), P_set_difference-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #82: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #83: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp0-{F}(V0,V1), pppp0-{F}(V0,V3), V1 == V3 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #84: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp1-{F}(V0), pppp1-{F}(V1), V0 == V1 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #85: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp2-{F}(V0), pppp2-{F}(V1), V0 == V1 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #86: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp3-{F}(V0), pppp3-{F}(V1), V0 == V1 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #87: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp4-{F}(V0,V1), pppp4-{F}(V2,V1), V0 == V2 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #88: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp5-{F}(V0), pppp5-{F}(V1), V0 == V1 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #89: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp6-{F}(V0,V1), pppp6-{F}(V2,V1), V0 == V2 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #90: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp7-{F}(V0,V1), pppp7-{F}(V0,V3), V1 == V3 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #91: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp8-{F}(V0,V1), pppp8-{F}(V2,V1), V0 == V2 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #92: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp9-{F}(V0), pppp9-{F}(V1), V0 == V1 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #93: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp10-{F}(V0,V1), pppp10-{F}(V2,V1), V0 == V2 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #94: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp11-{F}(V0,V1), pppp11-{F}(V2,V1), V0 == V2 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #95: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp12-{F}(V0,V1), pppp12-{F}(V2,V1), V0 == V2 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #96: unsound, references = 3, size of lhs = 3:
% 0.84/1.08     pppp12-{F}(V0,V1), pppp12-{F}(V2,V3), V1 == V3 | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  number of simplifiers = 19
% 0.84/1.08  
% 0.84/1.08  Learnt:
% 0.84/1.08  #98: exists( #76, #64 ), references = 2, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), subset-{F}(V1,V2) | P_set_difference-{T}(V1,V2,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #115: mergings( V0 == V2; #112 ), references = 1, size of lhs = 1:
% 0.84/1.08     P_empty_set-{F}(V0) | pppp5-{T}(V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #117: mergings( V0 == V2; #113 ), references = 1, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), empty-{F}(V1) | pppp5-{T}(V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #119: exists( #76, #65 ), references = 2, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), #-{F} V1 | P_set_difference-{T}(V1,V0,V1)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #121: exists( #76, #68 ), references = 1, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), #-{F} V1 | P_set_difference-{T}(V0,V1,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #127: mergings( V0 == V3; #123 ), references = 3, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), element-{F}(V1,V2), V2 == V0 | in-{T}(V1,V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #130: mergings( V0 == V3, V2 == V3; #124 ), references = 1, size of lhs = 4:
% 0.84/1.08     P_empty_set-{F}(V0), empty-{F}(V1), V0 == V1, element-{F}(V2,V0) | in-{T}(V2,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #132: mergings( V2 == V0; #125 ), references = 1, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), element-{F}(V1,V0), P_powerset-{F}(V2,V0) | in-{T}(V1,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #144: mergings( V0 == V3; #140 ), references = 1, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2), V1 == V0 | pppp14-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #147: mergings( V0 == V3, V1 == V3; #141 ), references = 1, size of lhs = 4:
% 0.84/1.08     P_empty_set-{F}(V0), empty-{F}(V1), V0 == V1, P_powerset-{F}(V0,V2) | pppp14-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #150: mergings( V0 == V3, V1 == V3; #142 ), references = 1, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), in-{F}(V1,V0), P_powerset-{F}(V0,V2) | pppp14-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #164: mergings( V0 == V3; #160 ), references = 1, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2), V1 == V0 | pppp13-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #167: mergings( V0 == V3, V1 == V3; #161 ), references = 1, size of lhs = 4:
% 0.84/1.08     P_empty_set-{F}(V0), empty-{F}(V1), V0 == V1, P_powerset-{F}(V0,V2) | pppp13-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #170: mergings( V0 == V3, V1 == V3; #162 ), references = 1, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), in-{F}(V1,V0), P_powerset-{F}(V0,V2) | pppp13-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #185: exists( #75, #179 ), references = 1, size of lhs = 6:
% 0.84/1.08     P_empty_set-{F}(V0), preboolean-{F}(V1), pppp2-{F}(V1), element-{F}(V2,V1), element-{F}(V3,V1), P_set_difference-{F}(V3,V2,V4) | P_prebool_difference-{T}(V1,V3,V2,V4)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #187: mergings( V4 == V6; #183 ), references = 2, size of lhs = 6:
% 0.84/1.08     preboolean-{F}(V0), element-{F}(V1,V0), element-{F}(V2,V0), P_set_difference-{F}(V2,V1,V3), P_empty_set-{F}(V4), V0 == V4 | P_prebool_difference-{T}(V0,V2,V1,V3)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #190: mergings( V4 == V6, V0 == V6; #184 ), references = 1, size of lhs = 6:
% 0.84/1.08     preboolean-{F}(V0), P_empty_set-{F}(V0), element-{F}(V1,V0), element-{F}(V2,V0), P_set_difference-{F}(V2,V1,V3), in-{F}(V4,V0) | P_prebool_difference-{T}(V0,V2,V1,V3)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #213: mergings( V0 == V4; #211 ), references = 1, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | pppp7-{T}(V2,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #234: mergings( V0 == V4; #232 ), references = 1, size of lhs = 2:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2) | pppp8-{T}(V0,V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #246: mergings( V0 == V3; #242 ), references = 1, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2), V1 == V0 | pppp15-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #249: mergings( V0 == V3, V1 == V3; #243 ), references = 1, size of lhs = 4:
% 0.84/1.08     P_empty_set-{F}(V0), empty-{F}(V1), V0 == V1, P_powerset-{F}(V0,V2) | pppp15-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #252: mergings( V0 == V3, V1 == V3; #244 ), references = 1, size of lhs = 3:
% 0.84/1.08     P_empty_set-{F}(V0), in-{F}(V1,V0), P_powerset-{F}(V0,V2) | pppp15-{T}(V2)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #279: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #274 ), references = 1, size of lhs = 5:
% 0.84/1.08     P_empty_set-{F}(V0), P_powerset-{F}(V0,V1), P_powerset-{F}(V1,V2), element-{F}(V3,V2), V3 == V0 | pppp0-{T}(V3,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #333: disj( #6, input ), references = 2, size of lhs = 5:
% 0.84/1.08     preboolean-{F}(V0), element-{F}(V1,V0), element-{F}(V2,V0), P_prebool_difference-{F}(V0,V2,V1,V3), pppp12-{F}(V0,V4) | element-{T}(V3,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #334: disj( #6, input ), references = 1, size of lhs = 6:
% 0.84/1.08     preboolean-{F}(V0), element-{F}(V1,V0), element-{F}(V2,V0), P_prebool_difference-{F}(V0,V2,V1,V3), P_empty_set-{F}(V4), V0 == V4 | element-{T}(V3,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #336: mergings( V0 == V4; #332 ), references = 1, size of lhs = 6:
% 0.84/1.08     preboolean-{F}(V0), P_empty_set-{F}(V0), element-{F}(V1,V0), element-{F}(V2,V0), P_prebool_difference-{F}(V0,V2,V1,V3), in-{F}(V4,V0) | element-{T}(V3,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #352: mergings( V2 == V3, V3 == V4, V4 == V6, V6 == V5; #347 ), references = 1, size of lhs = 4:
% 0.84/1.08     preboolean-{F}(V0), pppp12-{F}(V0,V1), V0 == V1, P_empty_set-{F}(V1) | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #358: mergings( V2 == V0, V0 == V3, V3 == V4; #354 ), references = 1, size of lhs = 1:
% 0.84/1.08     P_empty_set-{F}(V0) | pppp12-{T}(V0,V0)
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  #366: exists( #77, #364 ), references = 1, size of lhs = 0:
% 0.84/1.08     FALSE | FALSE
% 0.84/1.08        (used 0 times, uses = {})
% 0.84/1.08  
% 0.84/1.08  number of learnt formulas = 29
% 0.84/1.08  
% 0.84/1.08  
% 0.84/1.08  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.08  
% 0.84/1.08  randbase = 1
%------------------------------------------------------------------------------