↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : SET626+3 : TPTP v8.1.0. Released v2.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:16:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET626+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n008.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 : Sat Jul 23 02:58:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.47/0.68  GeoParameters:
% 0.47/0.68  
% 0.47/0.68  tptp_input =     1
% 0.47/0.68  tptp_output =    0
% 0.47/0.68  nonempty =       1
% 0.47/0.68  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.68  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.47/0.68  
% 0.47/0.68  
% 0.47/0.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.68  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.68  
% 0.47/0.68  RuleSystem INPUT:
% 0.47/0.68  
% 0.47/0.68  Initial Rules:
% 0.47/0.68  #0: input, references = 10, size of lhs = 2:
% 0.47/0.68     P_intersection-{F}(V0,V1,V3), member-{F}(V2,V3) | pppp0-{T}(V2,V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #1: input, references = 6, size of lhs = 2:
% 0.47/0.68     P_intersection-{F}(V0,V1,V3), pppp0-{F}(V2,V0,V1) | member-{T}(V2,V3)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #2: input, references = 8, size of lhs = 1:
% 0.47/0.68     pppp0-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #3: input, references = 5, size of lhs = 1:
% 0.47/0.68     pppp0-{F}(V0,V1,V2) | member-{T}(V0,V2)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #4: input, references = 6, size of lhs = 2:
% 0.47/0.68     member-{F}(V0,V1), member-{F}(V0,V2) | pppp0-{T}(V0,V1,V2)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #5: input, references = 5, size of lhs = 1:
% 0.47/0.68     intersect-{F}(V0,V1) | pppp1-{T}(V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #6: input, references = 5, size of lhs = 1:
% 0.47/0.68     pppp1-{F}(V0,V1) | intersect-{T}(V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #7: input, references = 5, size of lhs = 1:
% 0.47/0.68     pppp1-{F}(V0,V1) | EXISTS V2: pppp3-{T}(V2,V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #8: input, references = 5, size of lhs = 2:
% 0.47/0.68     member-{F}(V2,V0), member-{F}(V2,V1) | pppp1-{T}(V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #9: input, references = 5, size of lhs = 1:
% 0.47/0.68     pppp3-{F}(V0,V1,V2) | member-{T}(V0,V2)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #10: input, references = 4, size of lhs = 1:
% 0.47/0.68     pppp3-{F}(V0,V1,V2) | member-{T}(V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #11: input, references = 4, size of lhs = 3:
% 0.47/0.68     P_intersection-{F}(V0,V1,V2), P_intersection-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #12: input, references = 5, size of lhs = 1:
% 0.47/0.68     intersect-{F}(V0,V1) | intersect-{T}(V1,V0)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #13: input, references = 3, size of lhs = 1:
% 0.47/0.68     #-{F} V1 | pppp2-{T}(V1,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #14: input, references = 3, size of lhs = 2:
% 0.47/0.68     pppp2-{F}(V0,V1), V0 == V1 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #15: input, references = 3, size of lhs = 2:
% 0.47/0.68     pppp2-{F}(V0,V1), member-{F}(V2,V0) | member-{T}(V2,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #16: input, references = 3, size of lhs = 2:
% 0.47/0.68     pppp2-{F}(V0,V1), member-{F}(V2,V1) | member-{T}(V2,V0)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #17: input, references = 4, size of lhs = 2:
% 0.47/0.68     #-{F} V0, #-{F} V1 | pppp2-{T}(V0,V1), pppp8-{T}(V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #18: input, references = 6, size of lhs = 1:
% 0.47/0.68     pppp8-{F}(V0,V1) | EXISTS V2: pppp4-{T}(V2,V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #19: input, references = 8, size of lhs = 3:
% 0.47/0.68     pppp4-{F}(V0,V1,V2), member-{F}(V0,V2), member-{F}(V0,V1) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #20: input, references = 5, size of lhs = 1:
% 0.47/0.68     pppp4-{F}(V0,V1,V2) | member-{T}(V0,V1), member-{T}(V0,V2)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #21: input, references = 4, size of lhs = 0:
% 0.47/0.68     FALSE | EXISTS V0: pppp7-{T}(V0)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #22: input, references = 4, size of lhs = 1:
% 0.47/0.68     pppp7-{F}(V0) | EXISTS V1: pppp6-{T}(V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #23: input, references = 5, size of lhs = 1:
% 0.47/0.68     pppp6-{F}(V0,V1) | EXISTS V2: pppp5-{T}(V0,V1,V2)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #24: input, references = 5, size of lhs = 2:
% 0.47/0.68     pppp6-{F}(V0,V1), intersect-{F}(V0,V1) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #25: input, references = 5, size of lhs = 2:
% 0.47/0.68     pppp5-{F}(V0,V1,V2), P_intersection-{F}(V1,V2,V3) | intersect-{T}(V0,V3)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #26: input, references = 7, size of lhs = 2:
% 0.47/0.68     #-{F} V0, #-{F} V1 | EXISTS V2: P_intersection-{T}(V0,V1,V2)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  number of initial rules = 27
% 0.47/0.68  
% 0.47/0.68  Simplifiers:
% 0.47/0.68  #27: unsound, references = 3, size of lhs = 3:
% 0.47/0.68     P_intersection-{F}(V0,V1,V2), P_intersection-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #28: unsound, references = 3, size of lhs = 3:
% 0.47/0.68     pppp3-{F}(V0,V1,V2), pppp3-{F}(V3,V1,V2), V0 == V3 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #29: unsound, references = 3, size of lhs = 3:
% 0.47/0.68     pppp4-{F}(V0,V1,V2), pppp4-{F}(V3,V1,V2), V0 == V3 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #30: unsound, references = 3, size of lhs = 3:
% 0.47/0.68     pppp5-{F}(V0,V1,V2), pppp5-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #31: unsound, references = 3, size of lhs = 3:
% 0.47/0.68     pppp5-{F}(V0,V1,V2), pppp5-{F}(V0,V4,V5), V1 == V4 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #32: unsound, references = 3, size of lhs = 3:
% 0.47/0.68     pppp5-{F}(V0,V1,V2), pppp5-{F}(V3,V4,V5), V0 == V3 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #33: unsound, references = 3, size of lhs = 3:
% 0.47/0.68     pppp6-{F}(V0,V1), pppp6-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #34: unsound, references = 3, size of lhs = 3:
% 0.47/0.68     pppp6-{F}(V0,V1), pppp6-{F}(V2,V3), V0 == V2 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #35: unsound, references = 3, size of lhs = 3:
% 0.47/0.68     pppp7-{F}(V0), pppp7-{F}(V1), V0 == V1 | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  number of simplifiers = 9
% 0.47/0.68  
% 0.47/0.68  Learnt:
% 0.47/0.68  #37: disj( #17, input ), references = 2, size of lhs = 3:
% 0.47/0.68     #-{F} V0, #-{F} V1, V0 == V1 | pppp8-{T}(V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #41: disj( #20, #0+#2+#19 ), references = 3, size of lhs = 3:
% 0.47/0.68     pppp4-{F}(V0,V1,V2), pppp4-{F}(V0,V3,V2), P_intersection-{F}(V3,V4,V2) | member-{T}(V0,V1)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #44: exists( #26, #11 ), references = 2, size of lhs = 1:
% 0.47/0.68     P_intersection-{F}(V0,V1,V2) | P_intersection-{T}(V1,V0,V2)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #51: exists( #7, #49 ), references = 2, size of lhs = 3:
% 0.47/0.68     pppp1-{F}(V0,V1), pppp6-{F}(V1,V2), P_intersection-{F}(V2,V3,V1) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #59: exists( #26, #57 ), references = 1, size of lhs = 3:
% 0.47/0.68     pppp6-{F}(V0,V1), P_intersection-{F}(V1,V2,V0), pppp5-{F}(V0,V3,V4) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #62: mergings( V1 == V3; #60 ), references = 1, size of lhs = 2:
% 0.47/0.68     pppp6-{F}(V0,V1), P_intersection-{F}(V1,V2,V0) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #71: disj( #20, #4+#1+#0+#3+#19 ), references = 2, size of lhs = 4:
% 0.47/0.68     P_intersection-{F}(V0,V0,V1), pppp4-{F}(V2,V3,V0), pppp4-{F}(V2,V4,V0), P_intersection-{F}(V5,V4,V1) | member-{T}(V2,V3)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #79: exists( #18, #77 ), references = 1, size of lhs = 4:
% 0.47/0.68     pppp8-{F}(V0,V1), P_intersection-{F}(V1,V1,V2), P_intersection-{F}(V3,V0,V2), P_intersection-{F}(V4,V1,V0) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #89: exists( #18, #87 ), references = 2, size of lhs = 3:
% 0.47/0.68     pppp8-{F}(V0,V1), P_intersection-{F}(V0,V0,V1), P_intersection-{F}(V0,V2,V1) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #92: exists( #26, #90 ), references = 1, size of lhs = 1:
% 0.47/0.68     #-{F} V0 | P_intersection-{T}(V0,V0,V0)
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #126: exists( #18, #124 ), references = 1, size of lhs = 5:
% 0.47/0.68     pppp8-{F}(V0,V1), P_intersection-{F}(V0,V2,V1), P_intersection-{F}(V3,V4,V0), P_intersection-{F}(V3,V5,V1), P_intersection-{F}(V5,V6,V0) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #144: exists( #7, #142 ), references = 1, size of lhs = 3:
% 0.47/0.68     pppp1-{F}(V0,V1), pppp6-{F}(V1,V2), P_intersection-{F}(V2,V3,V0) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #150: exists( #26, #148 ), references = 1, size of lhs = 2:
% 0.47/0.68     pppp6-{F}(V0,V1), pppp5-{F}(V0,V1,V2) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #152: exists( #23, #149 ), references = 1, size of lhs = 1:
% 0.47/0.68     pppp6-{F}(V0,V1) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #154: exists( #22, #151 ), references = 1, size of lhs = 1:
% 0.47/0.68     pppp7-{F}(V0) | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  #156: exists( #21, #153 ), references = 1, size of lhs = 0:
% 0.47/0.68     FALSE | FALSE
% 0.47/0.68        (used 0 times, uses = {})
% 0.47/0.68  
% 0.47/0.68  number of learnt formulas = 16
% 0.47/0.68  
% 0.47/0.68  
% 0.47/0.68  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.68  
% 0.47/0.68  randbase = 1
%------------------------------------------------------------------------------