↑ Up

Geo-III---2018C.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : SEU120+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : geo -tptp_input -nonempty -inputfile %s

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat Jul 23 06:17:14 EDT 2022

% Result   : Theorem 2.94s 3.17s
% Output   : Refutation 2.94s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU120+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n026.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:11:50 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.94/3.17  GeoParameters:
% 2.94/3.17  
% 2.94/3.17  tptp_input =     1
% 2.94/3.17  tptp_output =    0
% 2.94/3.17  nonempty =       1
% 2.94/3.17  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/3.17  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 2.94/3.17  
% 2.94/3.17  
% 2.94/3.17  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/3.17  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/3.17  
% 2.94/3.17  RuleSystem INPUT:
% 2.94/3.17  
% 2.94/3.17  Initial Rules:
% 2.94/3.17  #0: input, references = 6, size of lhs = 2:
% 2.94/3.17     in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #1: input, references = 4, size of lhs = 3:
% 2.94/3.17     P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #2: input, references = 4, size of lhs = 1:
% 2.94/3.17     P_empty_set-{F}(V0) | pppp0-{T}(V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #3: input, references = 3, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), pppp0-{F}(V1), V1 == V0 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #4: input, references = 7, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), pppp0-{F}(V1), in-{F}(V2,V1) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #5: input, references = 4, size of lhs = 2:
% 2.94/3.17     P_empty_set-{F}(V0), #-{F} V1 | pppp0-{T}(V1), pppp11-{T}(V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #6: input, references = 5, size of lhs = 1:
% 2.94/3.17     pppp11-{F}(V0) | EXISTS V1: pppp3-{T}(V0,V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #7: input, references = 6, size of lhs = 1:
% 2.94/3.17     pppp3-{F}(V0,V1) | in-{T}(V1,V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #8: input, references = 7, size of lhs = 2:
% 2.94/3.17     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4) | pppp2-{T}(V1,V2,V4)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #9: input, references = 3, size of lhs = 4:
% 2.94/3.17     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4), pppp2-{F}(V1,V2,V3), V3 == V4 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #10: input, references = 5, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), pppp2-{F}(V1,V2,V3), in-{F}(V4,V3) | pppp1-{T}(V1,V2,V4)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #11: input, references = 5, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), pppp2-{F}(V1,V2,V3), pppp1-{F}(V1,V2,V4) | in-{T}(V4,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #12: input, references = 4, size of lhs = 4:
% 2.94/3.17     P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, #-{F} V3 | pppp2-{T}(V1,V2,V3), pppp12-{T}(V1,V2,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #13: input, references = 3, size of lhs = 1:
% 2.94/3.17     pppp12-{F}(V0,V1,V2) | EXISTS V3: pppp4-{T}(V0,V1,V2,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #14: input, references = 3, size of lhs = 3:
% 2.94/3.17     pppp4-{F}(V0,V1,V2,V3), pppp1-{F}(V0,V1,V3), in-{F}(V3,V2) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #15: input, references = 9, size of lhs = 1:
% 2.94/3.17     pppp4-{F}(V0,V1,V2,V3) | in-{T}(V3,V2), pppp1-{T}(V0,V1,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #16: input, references = 7, size of lhs = 2:
% 2.94/3.17     P_empty_set-{F}(V0), pppp1-{F}(V1,V2,V3) | in-{T}(V3,V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #17: input, references = 8, size of lhs = 2:
% 2.94/3.17     P_empty_set-{F}(V0), pppp1-{F}(V1,V2,V3) | in-{T}(V3,V2)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #18: input, references = 3, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), in-{F}(V3,V1), in-{F}(V3,V2) | pppp1-{T}(V1,V2,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #19: input, references = 5, size of lhs = 4:
% 2.94/3.17     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), disjoint-{F}(V1,V2), V3 == V0 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #20: input, references = 5, size of lhs = 2:
% 2.94/3.17     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V0) | disjoint-{T}(V1,V2)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #21: input, references = 3, size of lhs = 1:
% 2.94/3.17     P_empty_set-{F}(V0) | empty-{T}(V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #22: input, references = 4, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V1,V2), V2 == V1 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #23: input, references = 3, size of lhs = 1:
% 2.94/3.17     P_empty_set-{F}(V0) | EXISTS V1: pppp5-{T}(V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #24: input, references = 3, size of lhs = 1:
% 2.94/3.17     pppp5-{F}(V0) | empty-{T}(V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #25: input, references = 3, size of lhs = 1:
% 2.94/3.17     P_empty_set-{F}(V0) | EXISTS V1: pppp6-{T}(V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #26: input, references = 3, size of lhs = 2:
% 2.94/3.17     pppp6-{F}(V0), empty-{F}(V0) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #27: input, references = 3, size of lhs = 2:
% 2.94/3.17     P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | disjoint-{T}(V2,V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #28: input, references = 4, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), #-{F} V1, #-{F} V2 | disjoint-{T}(V1,V2), pppp13-{T}(V1,V2)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #29: input, references = 3, size of lhs = 1:
% 2.94/3.17     pppp13-{F}(V0,V1) | EXISTS V2: pppp7-{T}(V0,V1,V2)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #30: input, references = 8, size of lhs = 4:
% 2.94/3.17     P_empty_set-{F}(V0), in-{F}(V3,V1), in-{F}(V3,V2), disjoint-{F}(V1,V2) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #31: input, references = 3, size of lhs = 1:
% 2.94/3.17     pppp7-{F}(V0,V1,V2) | in-{T}(V2,V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #32: input, references = 3, size of lhs = 1:
% 2.94/3.17     pppp7-{F}(V0,V1,V2) | in-{T}(V2,V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #33: input, references = 4, size of lhs = 1:
% 2.94/3.17     P_empty_set-{F}(V0) | EXISTS V1: pppp10-{T}(V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #34: input, references = 4, size of lhs = 1:
% 2.94/3.17     pppp10-{F}(V0) | EXISTS V1: pppp9-{T}(V0,V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #35: input, references = 6, size of lhs = 3:
% 2.94/3.17     pppp9-{F}(V0,V1), P_set_intersection2-{F}(V0,V1,V2), in-{F}(V3,V2) | disjoint-{T}(V0,V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #36: input, references = 3, size of lhs = 3:
% 2.94/3.17     pppp9-{F}(V0,V1), P_set_intersection2-{F}(V0,V1,V2), in-{F}(V3,V2) | EXISTS V4: pppp8-{T}(V2,V4)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #37: input, references = 4, size of lhs = 3:
% 2.94/3.17     pppp9-{F}(V0,V1), P_set_intersection2-{F}(V0,V1,V2), disjoint-{F}(V0,V1) | EXISTS V3: pppp8-{T}(V2,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #38: input, references = 5, size of lhs = 1:
% 2.94/3.17     pppp8-{F}(V0,V1) | in-{T}(V1,V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #39: input, references = 8, size of lhs = 2:
% 2.94/3.17     #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #40: input, references = 4, size of lhs = 0:
% 2.94/3.17     FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  number of initial rules = 41
% 2.94/3.17  
% 2.94/3.17  Simplifiers:
% 2.94/3.17  #41: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #42: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #43: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     pppp3-{F}(V0,V1), pppp3-{F}(V0,V3), V1 == V3 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #44: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     pppp4-{F}(V0,V1,V2,V3), pppp4-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #45: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     pppp5-{F}(V0), pppp5-{F}(V1), V0 == V1 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #46: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     pppp6-{F}(V0), pppp6-{F}(V1), V0 == V1 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #47: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     pppp7-{F}(V0,V1,V2), pppp7-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #48: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     pppp8-{F}(V0,V1), pppp8-{F}(V0,V3), V1 == V3 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #49: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     pppp9-{F}(V0,V1), pppp9-{F}(V0,V3), V1 == V3 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #50: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     pppp9-{F}(V0,V1), pppp9-{F}(V2,V3), V0 == V2 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #51: unsound, references = 3, size of lhs = 3:
% 2.94/3.17     pppp10-{F}(V0), pppp10-{F}(V1), V0 == V1 | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  number of simplifiers = 11
% 2.94/3.17  
% 2.94/3.17  Learnt:
% 2.94/3.17  #53: exists( #39, #22 ), references = 1, size of lhs = 2:
% 2.94/3.17     P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V1,V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #56: mergings( V0 == V2; #54 ), references = 4, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), #-{F} V1, V1 == V0 | pppp11-{T}(V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #59: exists( #39, #1 ), references = 3, size of lhs = 1:
% 2.94/3.17     P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #63: mergings( V0 == V3; #60 ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), V3 == V0 | pppp13-{T}(V1,V2)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #65: mergings( V0 == V3; #61 ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), in-{F}(V1,V2), in-{F}(V1,V3) | pppp13-{T}(V2,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #68: mergings( V0 == V4; #66 ), references = 1, size of lhs = 4:
% 2.94/3.17     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), #-{F} V4, V4 == V3 | pppp12-{T}(V1,V2,V4)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #70: disj( #15, input ), references = 1, size of lhs = 1:
% 2.94/3.17     pppp4-{F}(V0,V1,V2,V2) | pppp1-{T}(V0,V1,V2)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #100: disj( #15, input ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), pppp0-{F}(V1), pppp4-{F}(V2,V3,V1,V4) | pppp1-{T}(V2,V3,V4)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #101: disj( #15, input ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), disjoint-{F}(V1,V1), pppp4-{F}(V2,V3,V1,V4) | pppp1-{T}(V2,V3,V4)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #102: disj( #15, input ), references = 1, size of lhs = 2:
% 2.94/3.17     in-{F}(V0,V1), pppp4-{F}(V2,V3,V0,V1) | pppp1-{T}(V2,V3,V1)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #131: mergings( V3 == V4, V4 == V5; #128 ), references = 1, size of lhs = 5:
% 2.94/3.17     P_empty_set-{F}(V0), in-{F}(V1,V2), pppp9-{F}(V2,V3), in-{F}(V1,V3), pppp1-{F}(V2,V3,V4) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #134: mergings( V3 == V4, V4 == V5; #127 ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), pppp9-{F}(V1,V2), pppp1-{F}(V1,V2,V3) | P_set_intersection2-{T}(V1,V2,V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #220: mergings( V2 == V3, V3 == V4; #216 ), references = 2, size of lhs = 4:
% 2.94/3.17     pppp11-{F}(V0), P_empty_set-{F}(V1), pppp0-{F}(V2), pppp2-{F}(V3,V2,V0) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #223: mergings( V2 == V3, V3 == V4; #217 ), references = 2, size of lhs = 4:
% 2.94/3.17     pppp11-{F}(V0), P_empty_set-{F}(V1), disjoint-{F}(V2,V2), pppp2-{F}(V3,V2,V0) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #238: mergings( V3 == V4, V4 == V5; #234 ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), pppp0-{F}(V1), #-{F} V2 | P_set_intersection2-{T}(V1,V2,V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #241: mergings( V3 == V4, V4 == V5; #235 ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), disjoint-{F}(V1,V1), #-{F} V2 | P_set_intersection2-{T}(V1,V2,V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #272: disj( #15, input ), references = 1, size of lhs = 4:
% 2.94/3.17     P_empty_set-{F}(V0), disjoint-{F}(V1,V2), in-{F}(V3,V2), pppp4-{F}(V4,V5,V1,V3) | pppp1-{T}(V4,V5,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #283: mergings( V4 == V5; #279 ), references = 1, size of lhs = 4:
% 2.94/3.17     P_empty_set-{F}(V0), disjoint-{F}(V1,V2), pppp4-{F}(V3,V4,V1,V4), pppp4-{F}(V5,V6,V2,V4) | pppp1-{T}(V5,V6,V4)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #286: mergings( V4 == V5, V5 == V6; #280 ), references = 1, size of lhs = 5:
% 2.94/3.17     P_empty_set-{F}(V0), pppp0-{F}(V1), disjoint-{F}(V2,V3), pppp4-{F}(V4,V1,V2,V5), pppp4-{F}(V6,V7,V3,V5) | pppp1-{T}(V6,V7,V5)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #289: mergings( V4 == V5, V5 == V6; #281 ), references = 1, size of lhs = 5:
% 2.94/3.17     P_empty_set-{F}(V0), disjoint-{F}(V1,V1), disjoint-{F}(V2,V3), pppp4-{F}(V4,V1,V2,V5), pppp4-{F}(V6,V7,V3,V5) | pppp1-{T}(V6,V7,V5)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #317: disj( #15, #16+#0 ), references = 1, size of lhs = 2:
% 2.94/3.17     P_empty_set-{F}(V0), pppp4-{F}(V1,V2,V3,V1) | in-{T}(V1,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #319: mergings( V4 == V5; #315 ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), pppp0-{F}(V1), pppp4-{F}(V1,V2,V3,V4) | in-{T}(V4,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #321: mergings( V4 == V5; #316 ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), disjoint-{F}(V1,V1), pppp4-{F}(V1,V2,V3,V4) | in-{T}(V4,V3)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #343: exists( #37, #339 ), references = 3, size of lhs = 5:
% 2.94/3.17     P_empty_set-{F}(V0), pppp0-{F}(V1), pppp9-{F}(V2,V3), P_set_intersection2-{F}(V2,V3,V1), disjoint-{F}(V2,V3) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #344: exists( #37, #340 ), references = 1, size of lhs = 5:
% 2.94/3.17     P_empty_set-{F}(V0), disjoint-{F}(V1,V1), pppp9-{F}(V2,V3), P_set_intersection2-{F}(V2,V3,V1), disjoint-{F}(V2,V3) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #407: disj( #15, #16+#0 ), references = 1, size of lhs = 3:
% 2.94/3.17     P_empty_set-{F}(V0), in-{F}(V1,V2), pppp4-{F}(V1,V3,V4,V2) | in-{T}(V2,V4)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #510: mergings( V0 == V5; #508 ), references = 2, size of lhs = 5:
% 2.94/3.17     pppp11-{F}(V0), P_empty_set-{F}(V1), V0 == V1, pppp9-{F}(V2,V3), P_set_intersection2-{F}(V2,V3,V0) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #514: mergings( V3 == V4; #512 ), references = 1, size of lhs = 2:
% 2.94/3.17     P_empty_set-{F}(V0), pppp9-{F}(V1,V2) | P_set_intersection2-{T}(V1,V2,V0)
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #528: mergings( V2 == V3, V3 == V4, V4 == V5; #523 ), references = 1, size of lhs = 3:
% 2.94/3.17     pppp10-{F}(V0), pppp0-{F}(V1), P_empty_set-{F}(V1) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #535: mergings( V0 == V2, V2 == V3, V3 == V4, V4 == V5; #529 ), references = 1, size of lhs = 2:
% 2.94/3.17     pppp0-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  #542: exists( #40, #538 ), references = 1, size of lhs = 0:
% 2.94/3.17     FALSE | FALSE
% 2.94/3.17        (used 0 times, uses = {})
% 2.94/3.17  
% 2.94/3.17  number of learnt formulas = 31
% 2.94/3.17  
% 2.94/3.17  
% 2.94/3.17  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/3.17  
% 2.94/3.17  randbase = 1
%------------------------------------------------------------------------------