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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : SET907+1 : TPTP v8.1.0. Released v3.2.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:16:55 EDT 2022

% Result   : Theorem 1.95s 2.12s
% Output   : Refutation 1.95s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET907+1 : TPTP v8.1.0. Released v3.2.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 : Sat Jul 23 01:41:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.95/2.12  GeoParameters:
% 1.95/2.12  
% 1.95/2.12  tptp_input =     1
% 1.95/2.12  tptp_output =    0
% 1.95/2.12  nonempty =       1
% 1.95/2.12  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.95/2.12  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 1.95/2.12  
% 1.95/2.12  
% 1.95/2.12  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.95/2.12  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.95/2.12  
% 1.95/2.12  RuleSystem INPUT:
% 1.95/2.12  
% 1.95/2.12  Initial Rules:
% 1.95/2.12  #0: input, references = 6, size of lhs = 2:
% 1.95/2.12     in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #1: input, references = 4, size of lhs = 3:
% 1.95/2.12     P_unordered_pair-{F}(V0,V1,V2), P_unordered_pair-{F}(V1,V0,V3), V2 == V3 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #2: input, references = 4, size of lhs = 3:
% 1.95/2.12     P_set_union2-{F}(V0,V1,V2), P_set_union2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #3: input, references = 3, size of lhs = 2:
% 1.95/2.12     P_set_union2-{F}(V0,V1,V2), empty-{F}(V2) | empty-{T}(V0)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #4: input, references = 3, size of lhs = 2:
% 1.95/2.12     P_set_union2-{F}(V1,V0,V2), empty-{F}(V2) | empty-{T}(V0)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #5: input, references = 4, size of lhs = 2:
% 1.95/2.12     P_set_union2-{F}(V0,V0,V1), V1 == V0 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #6: input, references = 3, size of lhs = 0:
% 1.95/2.12     FALSE | EXISTS V0: pppp1-{T}(V0)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #7: input, references = 3, size of lhs = 1:
% 1.95/2.12     pppp1-{F}(V0) | empty-{T}(V0)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #8: input, references = 3, size of lhs = 0:
% 1.95/2.12     FALSE | EXISTS V0: pppp2-{T}(V0)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #9: input, references = 3, size of lhs = 2:
% 1.95/2.12     pppp2-{F}(V0), empty-{F}(V0) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #10: input, references = 5, size of lhs = 1:
% 1.95/2.12     #-{F} V0 | subset-{T}(V0,V0)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #11: input, references = 6, size of lhs = 3:
% 1.95/2.12     P_set_union2-{F}(V0,V1,V2), subset-{F}(V0,V1), V2 == V1 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #12: input, references = 5, size of lhs = 2:
% 1.95/2.12     P_unordered_pair-{F}(V0,V1,V3), subset-{F}(V3,V2) | pppp0-{T}(V0,V1,V2)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #13: input, references = 7, size of lhs = 2:
% 1.95/2.12     P_unordered_pair-{F}(V0,V1,V3), pppp0-{F}(V0,V1,V2) | subset-{T}(V3,V2)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #14: input, references = 4, size of lhs = 1:
% 1.95/2.12     pppp0-{F}(V0,V1,V2) | in-{T}(V0,V2)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #15: input, references = 4, size of lhs = 1:
% 1.95/2.12     pppp0-{F}(V0,V1,V2) | in-{T}(V1,V2)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #16: input, references = 6, size of lhs = 2:
% 1.95/2.12     in-{F}(V0,V2), in-{F}(V1,V2) | pppp0-{T}(V0,V1,V2)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #17: input, references = 4, size of lhs = 0:
% 1.95/2.12     FALSE | EXISTS V0: pppp5-{T}(V0)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #18: input, references = 4, size of lhs = 1:
% 1.95/2.12     pppp5-{F}(V0) | EXISTS V1: pppp4-{T}(V0,V1)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #19: input, references = 4, size of lhs = 1:
% 1.95/2.12     pppp4-{F}(V0,V1) | EXISTS V2: pppp3-{T}(V2,V0,V1)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #20: input, references = 4, size of lhs = 1:
% 1.95/2.12     pppp4-{F}(V0,V1) | in-{T}(V1,V0)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #21: input, references = 4, size of lhs = 3:
% 1.95/2.12     pppp3-{F}(V0,V1,V2), P_unordered_pair-{F}(V0,V2,V3), P_set_union2-{F}(V3,V1,V1) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #22: input, references = 7, size of lhs = 3:
% 1.95/2.12     pppp3-{F}(V0,V1,V2), P_unordered_pair-{F}(V0,V2,V3), P_set_union2-{F}(V3,V1,V4) | in-{T}(V0,V1)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #23: input, references = 9, size of lhs = 2:
% 1.95/2.12     #-{F} V0, #-{F} V1 | EXISTS V2: P_unordered_pair-{T}(V0,V1,V2)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #24: input, references = 8, size of lhs = 2:
% 1.95/2.12     #-{F} V0, #-{F} V1 | EXISTS V2: P_set_union2-{T}(V0,V1,V2)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  number of initial rules = 25
% 1.95/2.12  
% 1.95/2.12  Simplifiers:
% 1.95/2.12  #25: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     P_unordered_pair-{F}(V0,V1,V2), P_unordered_pair-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #26: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     P_set_union2-{F}(V0,V1,V2), P_set_union2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #27: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     pppp1-{F}(V0), pppp1-{F}(V1), V0 == V1 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #28: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     pppp2-{F}(V0), pppp2-{F}(V1), V0 == V1 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #29: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     pppp3-{F}(V0,V1,V2), pppp3-{F}(V3,V1,V2), V0 == V3 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #30: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     pppp3-{F}(V0,V1,V2), pppp3-{F}(V3,V1,V5), V2 == V5 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #31: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     pppp3-{F}(V0,V1,V2), pppp3-{F}(V3,V4,V5), V1 == V4 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #32: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     pppp4-{F}(V0,V1), pppp4-{F}(V0,V3), V1 == V3 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #33: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     pppp4-{F}(V0,V1), pppp4-{F}(V2,V3), V0 == V2 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #34: unsound, references = 3, size of lhs = 3:
% 1.95/2.12     pppp5-{F}(V0), pppp5-{F}(V1), V0 == V1 | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  number of simplifiers = 10
% 1.95/2.12  
% 1.95/2.12  Learnt:
% 1.95/2.12  #37: exists( #24, #5 ), references = 1, size of lhs = 1:
% 1.95/2.12     #-{F} V0 | P_set_union2-{T}(V0,V0,V0)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #38: exists( #24, #11 ), references = 3, size of lhs = 1:
% 1.95/2.12     subset-{F}(V0,V1) | P_set_union2-{T}(V0,V1,V1)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #44: exists( #23, #1 ), references = 3, size of lhs = 1:
% 1.95/2.12     P_unordered_pair-{F}(V0,V1,V2) | P_unordered_pair-{T}(V1,V0,V2)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #57: exists( #24, #2 ), references = 7, size of lhs = 1:
% 1.95/2.12     P_set_union2-{F}(V0,V1,V2) | P_set_union2-{T}(V1,V0,V2)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #103: exists( #24, #101 ), references = 1, size of lhs = 3:
% 1.95/2.12     in-{F}(V0,V1), pppp3-{F}(V1,V0,V2), P_unordered_pair-{F}(V1,V2,V3) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #105: exists( #23, #102 ), references = 1, size of lhs = 2:
% 1.95/2.12     in-{F}(V0,V1), pppp3-{F}(V1,V0,V2) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #146: exists( #23, #140 ), references = 1, size of lhs = 2:
% 1.95/2.12     P_unordered_pair-{F}(V0,V0,V1), pppp3-{F}(V1,V1,V0) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #178: exists( #24, #172 ), references = 1, size of lhs = 2:
% 1.95/2.12     pppp3-{F}(V0,V0,V1), P_unordered_pair-{F}(V0,V1,V2) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #184: exists( #23, #175 ), references = 1, size of lhs = 1:
% 1.95/2.12     pppp3-{F}(V0,V0,V1) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #233: exists( #23, #231 ), references = 1, size of lhs = 2:
% 1.95/2.12     P_unordered_pair-{F}(V0,V0,V1), pppp0-{F}(V2,V0,V1) | P_unordered_pair-{T}(V2,V0,V1)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #298: exists( #24, #296 ), references = 1, size of lhs = 4:
% 1.95/2.12     in-{F}(V0,V1), pppp3-{F}(V2,V1,V3), P_unordered_pair-{F}(V2,V3,V4), P_unordered_pair-{F}(V0,V2,V4) | P_set_union2-{T}(V1,V4,V1)
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #303: exists( #23, #301 ), references = 1, size of lhs = 2:
% 1.95/2.12     in-{F}(V0,V1), pppp3-{F}(V2,V1,V0) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #305: exists( #19, #302 ), references = 1, size of lhs = 2:
% 1.95/2.12     pppp4-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #308: exists( #18, #306 ), references = 1, size of lhs = 1:
% 1.95/2.12     pppp5-{F}(V0) | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  #310: exists( #17, #307 ), references = 1, size of lhs = 0:
% 1.95/2.12     FALSE | FALSE
% 1.95/2.12        (used 0 times, uses = {})
% 1.95/2.12  
% 1.95/2.12  number of learnt formulas = 15
% 1.95/2.12  
% 1.95/2.12  
% 1.95/2.12  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.95/2.12  
% 1.95/2.12  randbase = 1
%------------------------------------------------------------------------------