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

View Problem - Process Solution

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

% Computer : n015.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:17 EDT 2022

% Result   : Theorem 0.18s 0.42s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n015.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 18:54:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.42  GeoParameters:
% 0.18/0.42  
% 0.18/0.42  tptp_input =     1
% 0.18/0.42  tptp_output =    0
% 0.18/0.42  nonempty =       1
% 0.18/0.42  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.42  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.42  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.42  
% 0.18/0.42  RuleSystem INPUT:
% 0.18/0.42  
% 0.18/0.42  Initial Rules:
% 0.18/0.42  #0: input, references = 3, size of lhs = 2:
% 0.18/0.42     in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #1: input, references = 4, size of lhs = 3:
% 0.18/0.42     P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #2: input, references = 4, size of lhs = 4:
% 0.18/0.42     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), disjoint-{F}(V1,V2), V3 == V0 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #3: input, references = 4, size of lhs = 2:
% 0.18/0.42     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V0) | disjoint-{T}(V1,V2)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #4: input, references = 3, size of lhs = 1:
% 0.18/0.42     P_empty_set-{F}(V0) | empty-{T}(V0)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #5: input, references = 4, size of lhs = 3:
% 0.18/0.42     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #6: input, references = 4, size of lhs = 1:
% 0.18/0.42     P_empty_set-{F}(V0) | EXISTS V1: pppp0-{T}(V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #7: input, references = 5, size of lhs = 1:
% 0.18/0.42     pppp0-{F}(V0) | empty-{T}(V0)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #8: input, references = 3, size of lhs = 1:
% 0.18/0.42     P_empty_set-{F}(V0) | EXISTS V1: pppp1-{T}(V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #9: input, references = 3, size of lhs = 2:
% 0.18/0.42     pppp1-{F}(V0), empty-{F}(V0) | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #10: input, references = 3, size of lhs = 2:
% 0.18/0.42     P_empty_set-{F}(V0), #-{F} V1 | subset-{T}(V1,V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #11: input, references = 3, size of lhs = 2:
% 0.18/0.42     P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | disjoint-{T}(V2,V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #12: input, references = 4, size of lhs = 4:
% 0.18/0.42     P_empty_set-{F}(V0), subset-{F}(V1,V2), P_set_intersection2-{F}(V1,V3,V4), P_set_intersection2-{F}(V2,V3,V5) | subset-{T}(V4,V5)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #13: input, references = 4, size of lhs = 3:
% 0.18/0.42     P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V0,V2), V2 == V0 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #14: input, references = 5, size of lhs = 3:
% 0.18/0.42     P_empty_set-{F}(V0), subset-{F}(V1,V0), V1 == V0 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #15: input, references = 4, size of lhs = 1:
% 0.18/0.42     P_empty_set-{F}(V0) | EXISTS V1: pppp4-{T}(V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #16: input, references = 5, size of lhs = 1:
% 0.18/0.42     pppp4-{F}(V0) | EXISTS V1: pppp3-{T}(V0,V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #17: input, references = 5, size of lhs = 1:
% 0.18/0.42     pppp3-{F}(V0,V1) | EXISTS V2: pppp2-{T}(V2,V0,V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #18: input, references = 5, size of lhs = 1:
% 0.18/0.42     pppp3-{F}(V0,V1) | disjoint-{T}(V0,V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #19: input, references = 5, size of lhs = 2:
% 0.18/0.42     pppp2-{F}(V0,V1,V2), disjoint-{F}(V0,V2) | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #20: input, references = 5, size of lhs = 1:
% 0.18/0.42     pppp2-{F}(V0,V1,V2) | subset-{T}(V0,V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #21: input, references = 4, size of lhs = 3:
% 0.18/0.42     P_empty_set-{F}(V0), empty-{F}(V1), V1 == V0 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #22: input, references = 3, size of lhs = 3:
% 0.18/0.42     P_empty_set-{F}(V0), empty-{F}(V1), in-{F}(V2,V1) | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #23: input, references = 4, size of lhs = 4:
% 0.18/0.42     P_empty_set-{F}(V0), empty-{F}(V1), empty-{F}(V2), V2 == V1 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #24: input, references = 7, size of lhs = 2:
% 0.18/0.42     #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #25: input, references = 4, size of lhs = 0:
% 0.18/0.42     FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  number of initial rules = 26
% 0.18/0.42  
% 0.18/0.42  Simplifiers:
% 0.18/0.42  #26: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #27: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #28: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     pppp0-{F}(V0), pppp0-{F}(V1), V0 == V1 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #29: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     pppp1-{F}(V0), pppp1-{F}(V1), V0 == V1 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #30: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     pppp2-{F}(V0,V1,V2), pppp2-{F}(V3,V1,V2), V0 == V3 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #31: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     pppp2-{F}(V0,V1,V2), pppp2-{F}(V3,V1,V5), V2 == V5 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #32: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     pppp2-{F}(V0,V1,V2), pppp2-{F}(V3,V4,V5), V1 == V4 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #33: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     pppp3-{F}(V0,V1), pppp3-{F}(V0,V3), V1 == V3 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #34: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     pppp3-{F}(V0,V1), pppp3-{F}(V2,V3), V0 == V2 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #35: unsound, references = 3, size of lhs = 3:
% 0.18/0.42     pppp4-{F}(V0), pppp4-{F}(V1), V0 == V1 | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  number of simplifiers = 10
% 0.18/0.42  
% 0.18/0.42  Learnt:
% 0.18/0.42  #37: exists( #24, #5 ), references = 1, size of lhs = 2:
% 0.18/0.42     P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V1,V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #39: exists( #24, #13 ), references = 1, size of lhs = 2:
% 0.18/0.42     P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V0,V0)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #45: mergings( V0 == V2; #42 ), references = 1, size of lhs = 1:
% 0.18/0.42     P_empty_set-{F}(V0) | pppp0-{T}(V0)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #47: mergings( V0 == V2; #43 ), references = 1, size of lhs = 2:
% 0.18/0.42     P_empty_set-{F}(V0), empty-{F}(V1) | pppp0-{T}(V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #50: exists( #24, #1 ), references = 1, size of lhs = 1:
% 0.18/0.42     P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #51: exists( #24, #2 ), references = 2, size of lhs = 2:
% 0.18/0.42     P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | P_set_intersection2-{T}(V1,V2,V0)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #54: exists( #17, #52 ), references = 2, size of lhs = 2:
% 0.18/0.42     P_empty_set-{F}(V0), pppp3-{F}(V0,V1) | pppp2-{T}(V0,V0,V1)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #59: exists( #16, #57 ), references = 1, size of lhs = 2:
% 0.18/0.42     pppp4-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #66: mergings( V3 == V4; #64 ), references = 1, size of lhs = 3:
% 0.18/0.42     P_empty_set-{F}(V0), subset-{F}(V1,V2), P_set_intersection2-{F}(V2,V3,V0) | P_set_intersection2-{T}(V1,V3,V0)
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #72: mergings( V3 == V4; #70 ), references = 1, size of lhs = 3:
% 0.18/0.42     P_empty_set-{F}(V0), pppp3-{F}(V1,V2), P_set_intersection2-{F}(V1,V2,V0) | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #77: mergings( V2 == V3; #75 ), references = 1, size of lhs = 2:
% 0.18/0.42     pppp4-{F}(V0), P_empty_set-{F}(V1) | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #81: mergings( V0 == V2, V2 == V3; #78 ), references = 1, size of lhs = 1:
% 0.18/0.42     P_empty_set-{F}(V0) | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  #83: exists( #25, #78 ), references = 1, size of lhs = 0:
% 0.18/0.42     FALSE | FALSE
% 0.18/0.42        (used 0 times, uses = {})
% 0.18/0.42  
% 0.18/0.42  number of learnt formulas = 13
% 0.18/0.42  
% 0.18/0.42  
% 0.18/0.42  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.42  
% 0.18/0.42  randbase = 1
%------------------------------------------------------------------------------