↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : GRP029-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 06:03:01 EDT 2022

% Result   : Unsatisfiable 0.95s 1.13s
% Output   : Refutation 0.95s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP029-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33  % Computer : n029.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Fri Jul 22 14:50:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.95/1.13  GeoParameters:
% 0.95/1.13  
% 0.95/1.13  tptp_input =     1
% 0.95/1.13  tptp_output =    0
% 0.95/1.13  nonempty =       1
% 0.95/1.13  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.95/1.13  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.95/1.13  
% 0.95/1.13  
% 0.95/1.13  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.95/1.13  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.95/1.13  
% 0.95/1.13  RuleSystem INPUT:
% 0.95/1.13  
% 0.95/1.13  Initial Rules:
% 0.95/1.13  #0: input, references = 4, size of lhs = 1:
% 0.95/1.13     P_multiply-{F}(V0,V1,V2) | product-{T}(V0,V1,V2)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #1: input, references = 5, size of lhs = 3:
% 0.95/1.13     product-{F}(V3,V2,V0), product-{F}(V3,V2,V1), V0 == V1 | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #2: input, references = 6, size of lhs = 3:
% 0.95/1.13     product-{F}(V2,V0,V1), product-{F}(V4,V0,V3), product-{F}(V5,V4,V2) | product-{T}(V5,V3,V1)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #3: input, references = 5, size of lhs = 3:
% 0.95/1.13     product-{F}(V4,V0,V3), product-{F}(V5,V4,V2), product-{F}(V5,V3,V1) | product-{T}(V2,V0,V1)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #4: input, references = 8, size of lhs = 2:
% 0.95/1.13     P_identity-{F}(V0), #-{F} V1 | product-{T}(V0,V1,V1)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #5: input, references = 10, size of lhs = 2:
% 0.95/1.13     P_identity-{F}(V0), P_inverse-{F}(V1,V2) | product-{T}(V2,V1,V0)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #6: input, references = 4, size of lhs = 3:
% 0.95/1.13     P_identity-{F}(V0), P_not_right_identity-{F}(V1,V2), product-{F}(V2,V1,V2) | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #7: input, references = 4, size of lhs = 2:
% 0.95/1.13     #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #8: input, references = 4, size of lhs = 0:
% 0.95/1.13     FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #9: input, references = 8, size of lhs = 1:
% 0.95/1.13     #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #10: input, references = 4, size of lhs = 1:
% 0.95/1.13     #-{F} V0 | EXISTS V1: P_not_right_identity-{T}(V0,V1)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  number of initial rules = 11
% 0.95/1.13  
% 0.95/1.13  Simplifiers:
% 0.95/1.13  #11: unsound, references = 3, size of lhs = 3:
% 0.95/1.13     P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #12: unsound, references = 3, size of lhs = 3:
% 0.95/1.13     P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #13: unsound, references = 3, size of lhs = 3:
% 0.95/1.13     P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #14: unsound, references = 3, size of lhs = 3:
% 0.95/1.13     P_not_right_identity-{F}(V0,V1), P_not_right_identity-{F}(V0,V3), V1 == V3 | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  number of simplifiers = 4
% 0.95/1.13  
% 0.95/1.13  Learnt:
% 0.95/1.13  #21: exists( #7, #19 ), references = 1, size of lhs = 1:
% 0.95/1.13     product-{F}(V0,V1,V2) | P_multiply-{T}(V0,V1,V2)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #39: exists( #9, #35 ), references = 4, size of lhs = 8:
% 0.95/1.13     P_identity-{F}(V0), product-{F}(V0,V1,V2), product-{F}(V3,V2,V4), product-{F}(V3,V0,V5), product-{F}(V4,V6,V7), V7 == V5, product-{F}(V8,V1,V9), product-{F}(V9,V6,V8) | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #49: mergings( V2 == V0; #47 ), references = 1, size of lhs = 2:
% 0.95/1.13     P_identity-{F}(V0), product-{F}(V0,V0,V0) | P_inverse-{T}(V0,V0)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #86: mergings( V2 == V3; #84 ), references = 2, size of lhs = 4:
% 0.95/1.13     P_identity-{F}(V0), product-{F}(V0,V1,V1), product-{F}(V1,V2,V0), product-{F}(V0,V2,V3) | P_inverse-{T}(V1,V3)
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #95: mergings( V2 == V3, V3 == V4, V4 == V5; #91 ), references = 1, size of lhs = 6:
% 0.95/1.13     P_identity-{F}(V0), product-{F}(V0,V1,V2), product-{F}(V0,V1,V3), product-{F}(V4,V3,V2), product-{F}(V4,V0,V5), V0 == V5 | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #111: mergings( V2 == V3, V3 == V4; #108 ), references = 1, size of lhs = 3:
% 0.95/1.13     P_identity-{F}(V0), P_not_right_identity-{F}(V0,V1), product-{F}(V0,V2,V1) | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #115: mergings( V0 == V2; #113 ), references = 1, size of lhs = 1:
% 0.95/1.13     P_identity-{F}(V0) | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  #117: exists( #8, #113 ), references = 1, size of lhs = 0:
% 0.95/1.13     FALSE | FALSE
% 0.95/1.13        (used 0 times, uses = {})
% 0.95/1.13  
% 0.95/1.13  number of learnt formulas = 8
% 0.95/1.13  
% 0.95/1.13  
% 0.95/1.13  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.95/1.13  
% 0.95/1.13  randbase = 1
%------------------------------------------------------------------------------