TSTP Solution File: GRP012-3 by Geo-III---2018C

View Problem - Process Solution

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

% Computer : n021.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:02:58 EDT 2022

% Result   : Unsatisfiable 1.17s 1.33s
% Output   : Refutation 1.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP012-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n021.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 14:13:03 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.17/1.33  GeoParameters:
% 1.17/1.33  
% 1.17/1.33  tptp_input =     1
% 1.17/1.33  tptp_output =    0
% 1.17/1.33  nonempty =       1
% 1.17/1.33  inputfile =      /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.17/1.33  includepath =    /export/starexec/sandbox2/solver/bin/../../benchmark/
% 1.17/1.33  
% 1.17/1.33  
% 1.17/1.33  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.17/1.33  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.17/1.33  
% 1.17/1.33  RuleSystem INPUT:
% 1.17/1.33  
% 1.17/1.33  Initial Rules:
% 1.17/1.33  #0: input, references = 5, size of lhs = 2:
% 1.17/1.33     P_identity-{F}(V0), #-{F} V1 | product-{T}(V0,V1,V1)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #1: input, references = 6, size of lhs = 2:
% 1.17/1.33     P_identity-{F}(V0), #-{F} V1 | product-{T}(V1,V0,V1)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #2: input, references = 5, size of lhs = 2:
% 1.17/1.33     P_identity-{F}(V0), P_inverse-{F}(V1,V2) | product-{T}(V2,V1,V0)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #3: input, references = 5, size of lhs = 2:
% 1.17/1.33     P_identity-{F}(V0), P_inverse-{F}(V1,V2) | product-{T}(V1,V2,V0)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #4: input, references = 6, size of lhs = 2:
% 1.17/1.33     P_identity-{F}(V0), P_multiply-{F}(V1,V2,V3) | product-{T}(V1,V2,V3)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #5: input, references = 6, size of lhs = 4:
% 1.17/1.33     P_identity-{F}(V0), product-{F}(V4,V3,V1), product-{F}(V4,V3,V2), V1 == V2 | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #6: input, references = 5, size of lhs = 4:
% 1.17/1.33     P_identity-{F}(V0), product-{F}(V3,V1,V2), product-{F}(V5,V1,V4), product-{F}(V6,V5,V3) | product-{T}(V6,V4,V2)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #7: input, references = 4, size of lhs = 4:
% 1.17/1.33     P_identity-{F}(V0), product-{F}(V5,V1,V4), product-{F}(V6,V5,V3), product-{F}(V6,V4,V2) | product-{T}(V3,V1,V2)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #8: input, references = 5, size of lhs = 8:
% 1.17/1.33     P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_multiply-{F}(V1,V2,V3), P_inverse-{F}(V3,V7), P_inverse-{F}(V2,V5), P_inverse-{F}(V1,V6), P_multiply-{F}(V5,V6,V7) | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #9: input, references = 4, size of lhs = 0:
% 1.17/1.33     FALSE | EXISTS V0: P_identity-{T}(V0)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #10: input, references = 8, size of lhs = 1:
% 1.17/1.33     #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #11: input, references = 6, size of lhs = 2:
% 1.17/1.33     #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #12: input, references = 4, size of lhs = 0:
% 1.17/1.33     FALSE | EXISTS V0: P_a-{T}(V0)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #13: input, references = 4, size of lhs = 0:
% 1.17/1.33     FALSE | EXISTS V0: P_b-{T}(V0)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  number of initial rules = 14
% 1.17/1.33  
% 1.17/1.33  Simplifiers:
% 1.17/1.33  #14: unsound, references = 3, size of lhs = 3:
% 1.17/1.33     P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #15: unsound, references = 3, size of lhs = 3:
% 1.17/1.33     P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #16: unsound, references = 3, size of lhs = 3:
% 1.17/1.33     P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #17: unsound, references = 3, size of lhs = 3:
% 1.17/1.33     P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #18: unsound, references = 3, size of lhs = 3:
% 1.17/1.33     P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  number of simplifiers = 5
% 1.17/1.33  
% 1.17/1.33  Learnt:
% 1.17/1.33  #22: mergings( V3 == V4; #20 ), references = 2, size of lhs = 2:
% 1.17/1.33     P_identity-{F}(V0), product-{F}(V1,V2,V3) | P_multiply-{T}(V1,V2,V3)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #32: mergings( V0 == V2, V2 == V3; #29 ), references = 1, size of lhs = 1:
% 1.17/1.33     P_identity-{F}(V0) | P_inverse-{T}(V0,V0)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #38: mergings( V2 == V3, V3 == V4; #35 ), references = 1, size of lhs = 5:
% 1.17/1.33     P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_inverse-{F}(V2,V0), P_multiply-{F}(V1,V2,V1) | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #51: mergings( V2 == V3, V3 == V4, V4 == V5; #47 ), references = 2, size of lhs = 3:
% 1.17/1.33     P_identity-{F}(V0), product-{F}(V1,V2,V0), product-{F}(V0,V2,V3) | P_inverse-{T}(V1,V3)
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #100: mergings( V3 == V4, V4 == V5, V5 == V6; #96 ), references = 1, size of lhs = 8:
% 1.17/1.33     P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_multiply-{F}(V1,V2,V3), P_inverse-{F}(V2,V4), P_inverse-{F}(V1,V5), product-{F}(V3,V4,V6), product-{F}(V6,V5,V0) | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #109: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #103 ), references = 1, size of lhs = 8:
% 1.17/1.33     P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_inverse-{F}(V2,V3), P_inverse-{F}(V1,V4), product-{F}(V2,V3,V5), product-{F}(V1,V5,V6), product-{F}(V6,V4,V0) | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #118: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #111 ), references = 2, size of lhs = 6:
% 1.17/1.33     P_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_inverse-{F}(V1,V3), product-{F}(V1,V0,V4), product-{F}(V4,V3,V0) | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #122: exists( #10, #120 ), references = 1, size of lhs = 4:
% 1.17/1.33     P_identity-{F}(V0), P_a-{F}(V1), product-{F}(V1,V0,V1), P_b-{F}(V2) | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #124: exists( #13, #121 ), references = 2, size of lhs = 3:
% 1.17/1.33     P_identity-{F}(V0), P_a-{F}(V1), product-{F}(V1,V0,V1) | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #127: exists( #12, #125 ), references = 1, size of lhs = 1:
% 1.17/1.33     P_identity-{F}(V0) | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  #129: exists( #9, #126 ), references = 1, size of lhs = 0:
% 1.17/1.33     FALSE | FALSE
% 1.17/1.33        (used 0 times, uses = {})
% 1.17/1.33  
% 1.17/1.33  number of learnt formulas = 11
% 1.17/1.33  
% 1.17/1.33  
% 1.17/1.33  % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.17/1.33  
% 1.17/1.33  randbase = 1
%------------------------------------------------------------------------------