TSTP Solution File: CAT009-1 by Geo-III---2018C

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : CAT009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : geo -tptp_input -nonempty -inputfile %s

% Computer : n029.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 05:58:49 EDT 2022

% Result   : Unsatisfiable 0.47s 0.64s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12  % Problem  : CAT009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n029.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 07:31:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.47/0.64  GeoParameters:
% 0.47/0.64  
% 0.47/0.64  tptp_input =     1
% 0.47/0.64  tptp_output =    0
% 0.47/0.64  nonempty =       1
% 0.47/0.64  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.64  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.47/0.64  
% 0.47/0.64  
% 0.47/0.64  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.64  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.64  
% 0.47/0.64  RuleSystem INPUT:
% 0.47/0.64  
% 0.47/0.64  Initial Rules:
% 0.47/0.64  #0: input, references = 5, size of lhs = 2:
% 0.47/0.64     P_compose-{F}(V0,V1,V2), defined-{F}(V0,V1) | product-{T}(V0,V1,V2)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #1: input, references = 3, size of lhs = 1:
% 0.47/0.64     product-{F}(V0,V1,V2) | defined-{T}(V0,V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #2: input, references = 4, size of lhs = 2:
% 0.47/0.64     defined-{F}(V1,V0), product-{F}(V3,V2,V1) | defined-{T}(V2,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #3: input, references = 3, size of lhs = 3:
% 0.47/0.64     defined-{F}(V1,V0), product-{F}(V3,V0,V2), product-{F}(V4,V3,V1) | defined-{T}(V4,V2)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #4: input, references = 3, size of lhs = 3:
% 0.47/0.64     product-{F}(V1,V0,V2), product-{F}(V4,V0,V3), product-{F}(V5,V4,V1) | product-{T}(V5,V3,V2)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #5: input, references = 4, size of lhs = 2:
% 0.47/0.64     product-{F}(V0,V2,V1), defined-{F}(V3,V1) | defined-{T}(V3,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #6: input, references = 4, size of lhs = 3:
% 0.47/0.64     product-{F}(V3,V0,V2), product-{F}(V4,V3,V1), defined-{F}(V4,V2) | defined-{T}(V1,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #7: input, references = 3, size of lhs = 3:
% 0.47/0.64     product-{F}(V4,V0,V3), product-{F}(V5,V3,V2), product-{F}(V5,V4,V1) | product-{T}(V1,V0,V2)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #8: input, references = 3, size of lhs = 3:
% 0.47/0.64     identity_map-{F}(V0), defined-{F}(V0,V1), defined-{F}(V2,V0) | defined-{T}(V2,V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #9: input, references = 5, size of lhs = 1:
% 0.47/0.64     P_domain-{F}(V0,V1) | identity_map-{T}(V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #10: input, references = 4, size of lhs = 1:
% 0.47/0.64     P_codomain-{F}(V0,V1) | identity_map-{T}(V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #11: input, references = 5, size of lhs = 1:
% 0.47/0.64     P_domain-{F}(V0,V1) | defined-{T}(V0,V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #12: input, references = 5, size of lhs = 1:
% 0.47/0.64     P_codomain-{F}(V0,V1) | defined-{T}(V1,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #13: input, references = 5, size of lhs = 1:
% 0.47/0.64     P_domain-{F}(V0,V1) | product-{T}(V0,V1,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #14: input, references = 6, size of lhs = 1:
% 0.47/0.64     P_codomain-{F}(V0,V1) | product-{T}(V1,V0,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #15: input, references = 5, size of lhs = 2:
% 0.47/0.64     identity_map-{F}(V0), defined-{F}(V0,V1) | product-{T}(V0,V1,V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #16: input, references = 7, size of lhs = 2:
% 0.47/0.64     identity_map-{F}(V0), defined-{F}(V1,V0) | product-{T}(V1,V0,V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #17: input, references = 8, size of lhs = 3:
% 0.47/0.64     product-{F}(V3,V2,V0), product-{F}(V3,V2,V1), V0 == V1 | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #18: input, references = 4, size of lhs = 2:
% 0.47/0.64     P_b-{F}(V0), P_a-{F}(V1) | defined-{T}(V0,V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #19: input, references = 5, size of lhs = 5:
% 0.47/0.64     P_b-{F}(V0), P_a-{F}(V1), P_compose-{F}(V0,V1,V2), P_domain-{F}(V2,V4), P_domain-{F}(V1,V4) | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #20: input, references = 5, size of lhs = 2:
% 0.47/0.64     #-{F} V0, #-{F} V1 | EXISTS V2: P_compose-{T}(V0,V1,V2)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #21: input, references = 7, size of lhs = 1:
% 0.47/0.64     #-{F} V0 | EXISTS V1: P_domain-{T}(V0,V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #22: input, references = 5, size of lhs = 1:
% 0.47/0.64     #-{F} V0 | EXISTS V1: P_codomain-{T}(V0,V1)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #23: input, references = 4, size of lhs = 0:
% 0.47/0.64     FALSE | EXISTS V0: P_b-{T}(V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #24: input, references = 4, size of lhs = 0:
% 0.47/0.64     FALSE | EXISTS V0: P_a-{T}(V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  number of initial rules = 25
% 0.47/0.64  
% 0.47/0.64  Simplifiers:
% 0.47/0.64  #25: unsound, references = 3, size of lhs = 3:
% 0.47/0.64     P_compose-{F}(V0,V1,V2), P_compose-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #26: unsound, references = 3, size of lhs = 3:
% 0.47/0.64     P_domain-{F}(V0,V1), P_domain-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #27: unsound, references = 3, size of lhs = 3:
% 0.47/0.64     P_codomain-{F}(V0,V1), P_codomain-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #28: unsound, references = 3, size of lhs = 3:
% 0.47/0.64     P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #29: unsound, references = 3, size of lhs = 3:
% 0.47/0.64     P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  number of simplifiers = 5
% 0.47/0.64  
% 0.47/0.64  Learnt:
% 0.47/0.64  #37: exists( #22, #35 ), references = 1, size of lhs = 1:
% 0.47/0.64     identity_map-{F}(V0) | P_codomain-{T}(V0,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #40: exists( #20, #38 ), references = 1, size of lhs = 2:
% 0.47/0.64     defined-{F}(V0,V1), product-{F}(V0,V1,V2) | P_compose-{T}(V0,V1,V2)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #42: exists( #21, #19 ), references = 1, size of lhs = 3:
% 0.47/0.64     P_b-{F}(V0), P_a-{F}(V1), P_compose-{F}(V0,V1,V1) | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #76: exists( #22, #74 ), references = 2, size of lhs = 3:
% 0.47/0.64     identity_map-{F}(V0), defined-{F}(V1,V0), defined-{F}(V1,V2) | P_codomain-{T}(V2,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #101: exists( #21, #99 ), references = 1, size of lhs = 1:
% 0.47/0.64     identity_map-{F}(V0) | P_domain-{T}(V0,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #118: exists( #21, #116 ), references = 1, size of lhs = 2:
% 0.47/0.64     identity_map-{F}(V0), defined-{F}(V1,V0) | P_domain-{T}(V1,V0)
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #123: exists( #20, #121 ), references = 2, size of lhs = 7:
% 0.47/0.64     identity_map-{F}(V0), P_b-{F}(V1), P_a-{F}(V2), P_domain-{F}(V2,V0), defined-{F}(V1,V2), product-{F}(V2,V0,V3), defined-{F}(V1,V3) | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #128: exists( #21, #126 ), references = 1, size of lhs = 3:
% 0.47/0.64     P_b-{F}(V0), P_a-{F}(V1), defined-{F}(V0,V1) | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #131: exists( #24, #129 ), references = 1, size of lhs = 1:
% 0.47/0.64     P_b-{F}(V0) | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  #133: exists( #23, #130 ), references = 1, size of lhs = 0:
% 0.47/0.64     FALSE | FALSE
% 0.47/0.64        (used 0 times, uses = {})
% 0.47/0.64  
% 0.47/0.64  number of learnt formulas = 10
% 0.47/0.64  
% 0.47/0.64  
% 0.47/0.64  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.64  
% 0.47/0.64  randbase = 1
%------------------------------------------------------------------------------