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

View Problem - Process Solution

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

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

% Result   : Theorem 0.20s 0.47s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Fri Jul 22 23:26:41 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.47  GeoParameters:
% 0.20/0.47  
% 0.20/0.47  tptp_input =     1
% 0.20/0.47  tptp_output =    0
% 0.20/0.47  nonempty =       1
% 0.20/0.47  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.20/0.47  
% 0.20/0.47  
% 0.20/0.47  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  
% 0.20/0.47  RuleSystem INPUT:
% 0.20/0.47  
% 0.20/0.47  Initial Rules:
% 0.20/0.47  #0: input, references = 3, size of lhs = 2:
% 0.20/0.47     in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #1: input, references = 3, size of lhs = 1:
% 0.20/0.47     empty-{F}(V0) | function-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #2: input, references = 3, size of lhs = 1:
% 0.20/0.47     ordinal-{F}(V0) | epsilon_transitive-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #3: input, references = 3, size of lhs = 1:
% 0.20/0.47     ordinal-{F}(V0) | epsilon_connected-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #4: input, references = 3, size of lhs = 1:
% 0.20/0.47     empty-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #5: input, references = 3, size of lhs = 3:
% 0.20/0.47     relation-{F}(V0), empty-{F}(V0), function-{F}(V0) | one_to_one-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #6: input, references = 3, size of lhs = 2:
% 0.20/0.47     epsilon_transitive-{F}(V0), epsilon_connected-{F}(V0) | ordinal-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #7: input, references = 4, size of lhs = 2:
% 0.20/0.47     ordinal-{F}(V0), ordinal-{F}(V1) | ordinal_subset-{T}(V1,V0), ordinal_subset-{T}(V0,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #8: input, references = 3, size of lhs = 1:
% 0.20/0.47     inclusion_comparable-{F}(V0,V1) | pppp0-{T}(V0,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #9: input, references = 5, size of lhs = 1:
% 0.20/0.47     pppp0-{F}(V0,V1) | inclusion_comparable-{T}(V0,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #10: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp0-{F}(V0,V1) | subset-{T}(V0,V1), subset-{T}(V1,V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #11: input, references = 4, size of lhs = 1:
% 0.20/0.47     subset-{F}(V0,V1) | pppp0-{T}(V0,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #12: input, references = 4, size of lhs = 1:
% 0.20/0.47     subset-{F}(V1,V0) | pppp0-{T}(V0,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #13: input, references = 3, size of lhs = 1:
% 0.20/0.47     #-{F} V0 | EXISTS V1: pppp1-{T}(V0,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #14: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp1-{F}(V0,V1) | element-{T}(V1,V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #15: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | empty-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #16: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #17: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | relation_empty_yielding-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #18: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | empty-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #19: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | empty-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #20: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #21: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp2-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #22: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp2-{F}(V0) | function-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #23: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp2-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #24: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp3-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #25: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp3-{F}(V0) | ordinal-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #26: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp3-{F}(V0) | epsilon_connected-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #27: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp3-{F}(V0) | epsilon_transitive-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #28: input, references = 4, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp4-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #29: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp4-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #30: input, references = 5, size of lhs = 1:
% 0.20/0.47     pppp4-{F}(V0) | empty-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #31: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp5-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #32: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp5-{F}(V0) | empty-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #33: input, references = 4, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp6-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #34: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp6-{F}(V0) | function-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #35: input, references = 5, size of lhs = 1:
% 0.20/0.47     pppp6-{F}(V0) | empty-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #36: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp6-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #37: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp7-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #38: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp7-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #39: input, references = 3, size of lhs = 2:
% 0.20/0.47     pppp7-{F}(V0), empty-{F}(V0) | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #40: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp8-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #41: input, references = 3, size of lhs = 2:
% 0.20/0.47     pppp8-{F}(V0), empty-{F}(V0) | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #42: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp9-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #43: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp9-{F}(V0) | one_to_one-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #44: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp9-{F}(V0) | function-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #45: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp9-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #46: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp10-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #47: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp10-{F}(V0) | relation_empty_yielding-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #48: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp10-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #49: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp11-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #50: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp11-{F}(V0) | function-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #51: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp11-{F}(V0) | relation_empty_yielding-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #52: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp11-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #53: input, references = 3, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp12-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #54: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp12-{F}(V0) | function-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #55: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp12-{F}(V0) | relation_non_empty-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #56: input, references = 3, size of lhs = 1:
% 0.20/0.47     pppp12-{F}(V0) | relation-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #57: input, references = 5, size of lhs = 4:
% 0.20/0.47     P_empty_set-{F}(V0), ordinal-{F}(V1), ordinal-{F}(V2), ordinal_subset-{F}(V2,V1) | subset-{T}(V2,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #58: input, references = 3, size of lhs = 4:
% 0.20/0.47     P_empty_set-{F}(V0), ordinal-{F}(V1), ordinal-{F}(V2), subset-{F}(V2,V1) | ordinal_subset-{T}(V2,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #59: input, references = 3, size of lhs = 3:
% 0.20/0.47     P_empty_set-{F}(V0), ordinal-{F}(V1), ordinal-{F}(V2) | ordinal_subset-{T}(V2,V2)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #60: input, references = 3, size of lhs = 2:
% 0.20/0.47     P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V1,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #61: input, references = 3, size of lhs = 2:
% 0.20/0.47     P_empty_set-{F}(V0), #-{F} V1 | inclusion_comparable-{T}(V1,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #62: input, references = 3, size of lhs = 2:
% 0.20/0.47     P_empty_set-{F}(V0), inclusion_comparable-{F}(V1,V2) | inclusion_comparable-{T}(V2,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #63: input, references = 3, size of lhs = 2:
% 0.20/0.47     P_empty_set-{F}(V0), in-{F}(V1,V2) | element-{T}(V1,V2)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #64: input, references = 4, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | EXISTS V1: pppp14-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #65: input, references = 4, size of lhs = 1:
% 0.20/0.47     pppp14-{F}(V0) | EXISTS V1: pppp13-{T}(V0,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #66: input, references = 4, size of lhs = 1:
% 0.20/0.47     pppp14-{F}(V0) | ordinal-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #67: input, references = 5, size of lhs = 2:
% 0.20/0.47     pppp13-{F}(V0,V1), inclusion_comparable-{F}(V0,V1) | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #68: input, references = 4, size of lhs = 1:
% 0.20/0.47     pppp13-{F}(V0,V1) | ordinal-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #69: input, references = 4, size of lhs = 2:
% 0.20/0.47     P_empty_set-{F}(V0), element-{F}(V2,V1) | empty-{T}(V1), in-{T}(V2,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #70: input, references = 3, size of lhs = 3:
% 0.20/0.47     P_empty_set-{F}(V0), P_powerset-{F}(V2,V3), element-{F}(V1,V3) | subset-{T}(V1,V2)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #71: input, references = 3, size of lhs = 3:
% 0.20/0.47     P_empty_set-{F}(V0), P_powerset-{F}(V2,V3), subset-{F}(V1,V2) | element-{T}(V1,V3)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #72: input, references = 3, size of lhs = 4:
% 0.20/0.47     P_empty_set-{F}(V0), P_powerset-{F}(V2,V3), element-{F}(V1,V3), in-{F}(V4,V1) | element-{T}(V4,V2)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #73: input, references = 3, size of lhs = 5:
% 0.20/0.47     P_empty_set-{F}(V0), P_powerset-{F}(V1,V2), empty-{F}(V1), element-{F}(V3,V2), in-{F}(V4,V3) | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #74: input, references = 5, size of lhs = 3:
% 0.20/0.47     P_empty_set-{F}(V0), empty-{F}(V1), V1 == V0 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #75: input, references = 3, size of lhs = 3:
% 0.20/0.47     P_empty_set-{F}(V0), empty-{F}(V1), in-{F}(V2,V1) | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #76: input, references = 5, size of lhs = 4:
% 0.20/0.47     P_empty_set-{F}(V0), empty-{F}(V1), empty-{F}(V2), V2 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #77: input, references = 4, size of lhs = 0:
% 0.20/0.47     FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #78: input, references = 3, size of lhs = 1:
% 0.20/0.47     #-{F} V0 | EXISTS V1: P_powerset-{T}(V0,V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  number of initial rules = 79
% 0.20/0.47  
% 0.20/0.47  Simplifiers:
% 0.20/0.47  #79: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     relation_non_empty-{F}(V0), relation_non_empty-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #80: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #81: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     P_powerset-{F}(V0,V1), P_powerset-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #82: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp1-{F}(V0,V1), pppp1-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #83: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp2-{F}(V0), pppp2-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #84: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp3-{F}(V0), pppp3-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #85: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp4-{F}(V0), pppp4-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #86: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp5-{F}(V0), pppp5-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #87: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp6-{F}(V0), pppp6-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #88: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp7-{F}(V0), pppp7-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #89: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp8-{F}(V0), pppp8-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #90: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp9-{F}(V0), pppp9-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #91: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp10-{F}(V0), pppp10-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #92: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp11-{F}(V0), pppp11-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #93: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp12-{F}(V0), pppp12-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #94: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp13-{F}(V0,V1), pppp13-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #95: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp13-{F}(V0,V1), pppp13-{F}(V2,V3), V0 == V2 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #96: unsound, references = 3, size of lhs = 3:
% 0.20/0.47     pppp14-{F}(V0), pppp14-{F}(V1), V0 == V1 | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  number of simplifiers = 18
% 0.20/0.47  
% 0.20/0.47  Learnt:
% 0.20/0.47  #101: mergings( V0 == V3; #97 ), references = 1, size of lhs = 3:
% 0.20/0.47     P_empty_set-{F}(V0), element-{F}(V1,V2), V2 == V0 | in-{T}(V1,V2)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #104: mergings( V0 == V3, V2 == V3; #98 ), references = 1, size of lhs = 4:
% 0.20/0.47     P_empty_set-{F}(V0), empty-{F}(V1), V0 == V1, element-{F}(V2,V0) | in-{T}(V2,V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #106: mergings( V2 == V0; #99 ), references = 1, size of lhs = 3:
% 0.20/0.47     P_empty_set-{F}(V0), pppp8-{F}(V0), element-{F}(V1,V0) | in-{T}(V1,V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #115: mergings( V0 == V2; #112 ), references = 1, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | pppp4-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #117: mergings( V0 == V2; #113 ), references = 1, size of lhs = 2:
% 0.20/0.47     P_empty_set-{F}(V0), empty-{F}(V1) | pppp4-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #124: mergings( V0 == V2; #121 ), references = 1, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | pppp6-{T}(V0)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #126: mergings( V0 == V2; #122 ), references = 1, size of lhs = 2:
% 0.20/0.47     P_empty_set-{F}(V0), empty-{F}(V1) | pppp6-{T}(V1)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #136: disj( #7, #57+#11+#9+#67 ), references = 2, size of lhs = 4:
% 0.20/0.47     P_empty_set-{F}(V0), ordinal-{F}(V1), ordinal-{F}(V2), pppp13-{F}(V2,V1) | ordinal_subset-{T}(V1,V2)
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #151: mergings( V2 == V3; #149 ), references = 1, size of lhs = 3:
% 0.20/0.47     pppp14-{F}(V0), ordinal-{F}(V0), P_empty_set-{F}(V1) | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #156: mergings( V0 == V2, V2 == V3; #153 ), references = 1, size of lhs = 1:
% 0.20/0.47     P_empty_set-{F}(V0) | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  #158: exists( #77, #153 ), references = 1, size of lhs = 0:
% 0.20/0.47     FALSE | FALSE
% 0.20/0.47        (used 0 times, uses = {})
% 0.20/0.47  
% 0.20/0.47  number of learnt formulas = 11
% 0.20/0.47  
% 0.20/0.47  
% 0.20/0.47  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  
% 0.20/0.47  randbase = 1
%------------------------------------------------------------------------------