↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : BOO002-2 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : geo -tptp_input -nonempty -inputfile %s

% Computer : n024.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:34 EDT 2022

% Result   : Unsatisfiable 1.21s 1.42s
% Output   : Refutation 1.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : BOO002-2 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n024.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 08:43:41 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.21/1.42  GeoParameters:
% 1.21/1.42  
% 1.21/1.42  tptp_input =     1
% 1.21/1.42  tptp_output =    0
% 1.21/1.42  nonempty =       1
% 1.21/1.42  inputfile =      /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.21/1.42  includepath =    /export/starexec/sandbox2/solver/bin/../../benchmark/
% 1.21/1.42  
% 1.21/1.42  
% 1.21/1.42  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.21/1.42  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.21/1.42  
% 1.21/1.42  RuleSystem INPUT:
% 1.21/1.42  
% 1.21/1.42  Initial Rules:
% 1.21/1.42  #0: input, references = 5, size of lhs = 6:
% 1.21/1.42     P_multiply-{F}(V0,V1,V2,V5), P_multiply-{F}(V0,V1,V4,V6), P_multiply-{F}(V5,V3,V6,V7), P_multiply-{F}(V2,V3,V4,V8), P_multiply-{F}(V0,V1,V8,V9), V7 == V9 | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #1: input, references = 4, size of lhs = 2:
% 1.21/1.42     P_multiply-{F}(V1,V0,V0,V2), V2 == V0 | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #2: input, references = 4, size of lhs = 2:
% 1.21/1.42     P_multiply-{F}(V0,V0,V1,V2), V2 == V0 | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #3: input, references = 4, size of lhs = 3:
% 1.21/1.42     P_inverse-{F}(V1,V2), P_multiply-{F}(V2,V1,V0,V3), V3 == V0 | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #4: input, references = 4, size of lhs = 2:
% 1.21/1.42     P_multiply-{F}(V0,V1,V0,V2), V2 == V0 | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #5: input, references = 4, size of lhs = 4:
% 1.21/1.42     P_a-{F}(V0), P_inverse-{F}(V0,V1), P_b-{F}(V2), P_multiply-{F}(V0,V1,V2,V2) | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #6: input, references = 6, size of lhs = 3:
% 1.21/1.42     #-{F} V0, #-{F} V1, #-{F} V2 | EXISTS V3: P_multiply-{T}(V0,V1,V2,V3)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #7: input, references = 4, size of lhs = 1:
% 1.21/1.42     #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #8: input, references = 4, size of lhs = 0:
% 1.21/1.42     FALSE | EXISTS V0: P_a-{T}(V0)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #9: input, references = 4, size of lhs = 0:
% 1.21/1.42     FALSE | EXISTS V0: P_b-{T}(V0)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  number of initial rules = 10
% 1.21/1.42  
% 1.21/1.42  Simplifiers:
% 1.21/1.42  #10: unsound, references = 3, size of lhs = 3:
% 1.21/1.42     P_multiply-{F}(V0,V1,V2,V3), P_multiply-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #11: unsound, references = 3, size of lhs = 3:
% 1.21/1.42     P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #12: unsound, references = 3, size of lhs = 3:
% 1.21/1.42     P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #13: unsound, references = 3, size of lhs = 3:
% 1.21/1.42     P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  number of simplifiers = 4
% 1.21/1.42  
% 1.21/1.42  Learnt:
% 1.21/1.42  #17: exists( #6, #1 ), references = 3, size of lhs = 2:
% 1.21/1.42     #-{F} V0, #-{F} V1 | P_multiply-{T}(V0,V1,V1,V1)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #18: exists( #6, #2 ), references = 4, size of lhs = 2:
% 1.21/1.42     #-{F} V0, #-{F} V1 | P_multiply-{T}(V0,V0,V1,V0)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #19: exists( #6, #4 ), references = 2, size of lhs = 2:
% 1.21/1.42     #-{F} V0, #-{F} V1 | P_multiply-{T}(V1,V0,V1,V1)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #22: exists( #6, #0 ), references = 4, size of lhs = 4:
% 1.21/1.42     P_multiply-{F}(V0,V1,V2,V3), P_multiply-{F}(V0,V1,V4,V5), P_multiply-{F}(V2,V6,V4,V7), P_multiply-{F}(V0,V1,V7,V8) | P_multiply-{T}(V3,V6,V5,V8)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #23: exists( #6, #3 ), references = 2, size of lhs = 2:
% 1.21/1.42     P_inverse-{F}(V0,V1), #-{F} V2 | P_multiply-{T}(V1,V0,V2,V2)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #29: exists( #6, #27 ), references = 2, size of lhs = 6:
% 1.21/1.42     P_multiply-{F}(V0,V1,V2,V2), P_multiply-{F}(V3,V1,V2,V3), P_multiply-{F}(V4,V2,V5,V4), P_multiply-{F}(V4,V2,V6,V4), P_multiply-{F}(V7,V8,V5,V3), P_multiply-{F}(V7,V8,V6,V0) | P_multiply-{T}(V7,V8,V4,V2)
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #38: exists( #7, #36 ), references = 2, size of lhs = 4:
% 1.21/1.42     P_a-{F}(V0), P_b-{F}(V1), P_multiply-{F}(V1,V1,V0,V1), P_multiply-{F}(V0,V0,V1,V0) | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #42: exists( #9, #40 ), references = 1, size of lhs = 1:
% 1.21/1.42     P_a-{F}(V0) | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  #44: exists( #8, #41 ), references = 1, size of lhs = 0:
% 1.21/1.42     FALSE | FALSE
% 1.21/1.42        (used 0 times, uses = {})
% 1.21/1.42  
% 1.21/1.42  number of learnt formulas = 9
% 1.21/1.42  
% 1.21/1.42  
% 1.21/1.42  % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.21/1.42  
% 1.21/1.42  randbase = 1
%------------------------------------------------------------------------------