↑ Up

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

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

% Computer : n004.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:14:52 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : RNG008-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 : n004.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:29:51 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.91/1.13  GeoParameters:
% 0.91/1.13  
% 0.91/1.13  tptp_input =     1
% 0.91/1.13  tptp_output =    0
% 0.91/1.13  nonempty =       1
% 0.91/1.13  inputfile =      /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.13  includepath =    /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.91/1.13  
% 0.91/1.13  
% 0.91/1.13  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.13  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.13  
% 0.91/1.13  RuleSystem INPUT:
% 0.91/1.13  
% 0.91/1.13  Initial Rules:
% 0.91/1.13  #0: input, references = 11, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), #-{F} V1 | sum-{T}(V0,V1,V1)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #1: input, references = 5, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), #-{F} V1 | sum-{T}(V1,V0,V1)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #2: input, references = 8, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V3) | product-{T}(V1,V2,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #3: input, references = 13, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3) | sum-{T}(V1,V2,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #4: input, references = 5, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2) | sum-{T}(V2,V1,V0)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #5: input, references = 3, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2) | sum-{T}(V1,V2,V0)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #6: input, references = 7, size of lhs = 4:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3), sum-{F}(V5,V2,V4), sum-{F}(V6,V5,V1) | sum-{T}(V6,V4,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #7: input, references = 5, size of lhs = 4:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V5,V2,V4), sum-{F}(V6,V5,V1), sum-{F}(V6,V4,V3) | sum-{T}(V1,V2,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #8: input, references = 7, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3) | sum-{T}(V2,V1,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #9: input, references = 5, size of lhs = 4:
% 0.91/1.13     P_additive_identity-{F}(V0), product-{F}(V1,V2,V3), product-{F}(V5,V2,V4), product-{F}(V6,V5,V1) | product-{T}(V6,V4,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #10: input, references = 7, size of lhs = 4:
% 0.91/1.13     P_additive_identity-{F}(V0), product-{F}(V5,V2,V4), product-{F}(V6,V5,V1), product-{F}(V6,V4,V3) | product-{T}(V1,V2,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #11: input, references = 4, size of lhs = 5:
% 0.91/1.13     P_additive_identity-{F}(V0), product-{F}(V5,V4,V3), product-{F}(V5,V6,V2), product-{F}(V5,V7,V1), sum-{F}(V7,V6,V4) | sum-{T}(V1,V2,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #12: input, references = 8, size of lhs = 5:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3), product-{F}(V5,V6,V2), product-{F}(V5,V7,V1), sum-{F}(V7,V6,V4) | product-{T}(V5,V4,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #13: input, references = 5, size of lhs = 5:
% 0.91/1.13     P_additive_identity-{F}(V0), product-{F}(V4,V5,V3), product-{F}(V6,V5,V2), product-{F}(V7,V5,V1), sum-{F}(V7,V6,V4) | sum-{T}(V1,V2,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #14: input, references = 6, size of lhs = 5:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3), product-{F}(V6,V5,V2), product-{F}(V7,V5,V1), sum-{F}(V7,V6,V4) | product-{T}(V4,V5,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #15: input, references = 7, size of lhs = 4:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V4,V3,V1), sum-{F}(V4,V3,V2), V1 == V2 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #16: input, references = 6, size of lhs = 4:
% 0.91/1.13     P_additive_identity-{F}(V0), product-{F}(V4,V3,V1), product-{F}(V4,V3,V2), V1 == V2 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #17: input, references = 12, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), #-{F} V1 | product-{T}(V1,V1,V1)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #18: input, references = 5, size of lhs = 4:
% 0.91/1.13     P_additive_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3) | product-{T}(V1,V2,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #19: input, references = 5, size of lhs = 5:
% 0.91/1.13     P_additive_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), product-{F}(V2,V1,V3) | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #20: input, references = 4, size of lhs = 0:
% 0.91/1.13     FALSE | EXISTS V0: P_additive_identity-{T}(V0)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #21: input, references = 6, size of lhs = 2:
% 0.91/1.13     #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #22: input, references = 7, size of lhs = 2:
% 0.91/1.13     #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #23: input, references = 5, size of lhs = 1:
% 0.91/1.13     #-{F} V0 | EXISTS V1: P_additive_inverse-{T}(V0,V1)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #24: input, references = 4, size of lhs = 0:
% 0.91/1.13     FALSE | EXISTS V0: P_a-{T}(V0)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #25: input, references = 5, size of lhs = 0:
% 0.91/1.13     FALSE | EXISTS V0: P_b-{T}(V0)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #26: input, references = 5, size of lhs = 0:
% 0.91/1.13     FALSE | EXISTS V0: P_c-{T}(V0)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  number of initial rules = 27
% 0.91/1.13  
% 0.91/1.13  Simplifiers:
% 0.91/1.13  #27: unsound, references = 3, size of lhs = 3:
% 0.91/1.13     P_additive_identity-{F}(V0), P_additive_identity-{F}(V1), V0 == V1 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #28: unsound, references = 3, size of lhs = 3:
% 0.91/1.13     P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #29: unsound, references = 3, size of lhs = 3:
% 0.91/1.13     P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #30: unsound, references = 3, size of lhs = 3:
% 0.91/1.13     P_additive_inverse-{F}(V0,V1), P_additive_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #31: unsound, references = 3, size of lhs = 3:
% 0.91/1.13     P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #32: unsound, references = 3, size of lhs = 3:
% 0.91/1.13     P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #33: unsound, references = 3, size of lhs = 3:
% 0.91/1.13     P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  number of simplifiers = 7
% 0.91/1.13  
% 0.91/1.13  Learnt:
% 0.91/1.13  #40: mergings( V2 == V3, V3 == V4; #37 ), references = 3, size of lhs = 4:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V1), sum-{F}(V0,V2,V3), V3 == V0 | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #55: mergings( V1 == V2, V2 == V5, V5 == V6, V6 == V7, V7 == V8; #49 ), references = 2, size of lhs = 7:
% 0.91/1.13     P_a-{F}(V0), P_b-{F}(V1), P_additive_identity-{F}(V2), product-{F}(V1,V3,V1), product-{F}(V4,V1,V3), sum-{F}(V0,V4,V5), product-{F}(V5,V1,V3) | P_c-{T}(V2)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #61: mergings( V3 == V4; #59 ), references = 1, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), product-{F}(V1,V2,V3) | P_multiply-{T}(V1,V2,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #69: mergings( V3 == V4; #67 ), references = 1, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3) | P_add-{T}(V1,V2,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #86: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #81 ), references = 6, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), product-{F}(V1,V1,V1) | P_add-{T}(V1,V1,V0)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #114: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11; #105 ), references = 2, size of lhs = 9:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V0), product-{F}(V3,V4,V2), sum-{F}(V3,V4,V5), product-{F}(V3,V6,V1), sum-{F}(V5,V6,V7), product-{F}(V7,V6,V8), product-{F}(V7,V4,V9), sum-{F}(V9,V8,V10) | P_add-{T}(V4,V6,V10)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #139: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11, V11 == V12; #129 ), references = 2, size of lhs = 9:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V0,V1,V2), product-{F}(V2,V1,V3), product-{F}(V4,V1,V4), sum-{F}(V1,V5,V0), product-{F}(V2,V6,V7), product-{F}(V7,V4,V8), sum-{F}(V8,V3,V9), sum-{F}(V9,V5,V10) | P_multiply-{T}(V6,V4,V10)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #152: mergings( V2 == V3, V3 == V4, V4 == V5; #148 ), references = 1, size of lhs = 3:
% 0.91/1.13     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V0), sum-{F}(V0,V2,V3) | P_additive_inverse-{T}(V1,V3)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #166: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6; #160 ), references = 1, size of lhs = 2:
% 0.91/1.13     P_a-{F}(V0), P_additive_identity-{F}(V0) | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #203: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11, V11 == V12, V12 == V13, V13 == V14, V14 == V15, V15 == V16; #189 ), references = 2, size of lhs = 10:
% 0.91/1.13     P_additive_identity-{F}(V0), product-{F}(V1,V1,V1), sum-{F}(V0,V2,V3), product-{F}(V3,V1,V4), V4 == V3, sum-{F}(V2,V5,V6), sum-{F}(V6,V7,V1), product-{F}(V7,V2,V8), product-{F}(V5,V2,V9), sum-{F}(V9,V8,V0) | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #222: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #216 ), references = 1, size of lhs = 6:
% 0.91/1.13     P_additive_identity-{F}(V0), product-{F}(V1,V1,V1), sum-{F}(V0,V2,V1), product-{F}(V2,V3,V3), product-{F}(V4,V1,V5), product-{F}(V3,V5,V6) | P_multiply-{T}(V3,V4,V6)
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #248: mergings( V1 == V2, V2 == V3, V3 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11, V11 == V12, V12 == V13, V13 == V14, V14 == V15, V4 == V17; #233 ), references = 2, size of lhs = 6:
% 0.91/1.13     P_additive_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), product-{F}(V2,V2,V2), product-{F}(V3,V2,V2), sum-{F}(V0,V3,V2) | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #253: mergings( V1 == V2; #251 ), references = 1, size of lhs = 2:
% 0.91/1.13     P_additive_identity-{F}(V0), P_a-{F}(V1) | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #256: mergings( V1 == V2; #254 ), references = 1, size of lhs = 1:
% 0.91/1.13     P_additive_identity-{F}(V0) | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  #258: exists( #20, #254 ), references = 1, size of lhs = 0:
% 0.91/1.13     FALSE | FALSE
% 0.91/1.13        (used 0 times, uses = {})
% 0.91/1.13  
% 0.91/1.13  number of learnt formulas = 15
% 0.91/1.13  
% 0.91/1.13  
% 0.91/1.13  % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.13  
% 0.91/1.13  randbase = 1
%------------------------------------------------------------------------------