TSTP Solution File: RNG001-4 by Geo-III---2018C

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : RNG001-4 : 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:14:50 EDT 2022

% Result   : Unsatisfiable 0.19s 0.40s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : RNG001-4 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.13  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Fri Jul 22 07:39:48 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.40  GeoParameters:
% 0.19/0.40  
% 0.19/0.40  tptp_input =     1
% 0.19/0.40  tptp_output =    0
% 0.19/0.40  nonempty =       1
% 0.19/0.40  inputfile =      /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40  includepath =    /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40  
% 0.19/0.40  RuleSystem INPUT:
% 0.19/0.40  
% 0.19/0.40  Initial Rules:
% 0.19/0.40  #0: input, references = 4, size of lhs = 2:
% 0.19/0.40     P_additive_identity-{F}(V0), #-{F} V1 | sum-{T}(V0,V1,V1)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #1: input, references = 4, size of lhs = 2:
% 0.19/0.40     P_additive_identity-{F}(V0), #-{F} V1 | sum-{T}(V1,V0,V1)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #2: input, references = 5, size of lhs = 2:
% 0.19/0.40     P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V3) | product-{T}(V1,V2,V3)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #3: input, references = 4, size of lhs = 2:
% 0.19/0.40     P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3) | sum-{T}(V1,V2,V3)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #4: input, references = 3, size of lhs = 2:
% 0.19/0.40     P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2) | sum-{T}(V2,V1,V0)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #5: input, references = 3, size of lhs = 2:
% 0.19/0.40     P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2) | sum-{T}(V1,V2,V0)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #6: input, references = 3, size of lhs = 4:
% 0.19/0.40     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.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #7: input, references = 3, size of lhs = 4:
% 0.19/0.40     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.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #8: input, references = 3, size of lhs = 2:
% 0.19/0.40     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3) | sum-{T}(V2,V1,V3)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #9: input, references = 3, size of lhs = 4:
% 0.19/0.40     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.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #10: input, references = 3, size of lhs = 4:
% 0.19/0.40     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.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #11: input, references = 4, size of lhs = 5:
% 0.19/0.40     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.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #12: input, references = 3, size of lhs = 5:
% 0.19/0.40     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.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #13: input, references = 3, size of lhs = 5:
% 0.19/0.40     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.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #14: input, references = 3, size of lhs = 5:
% 0.19/0.40     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.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #15: input, references = 4, size of lhs = 4:
% 0.19/0.40     P_additive_identity-{F}(V0), sum-{F}(V4,V3,V1), sum-{F}(V4,V3,V2), V1 == V2 | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #16: input, references = 3, size of lhs = 4:
% 0.19/0.40     P_additive_identity-{F}(V0), product-{F}(V4,V3,V1), product-{F}(V4,V3,V2), V1 == V2 | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #17: input, references = 4, size of lhs = 4:
% 0.19/0.40     P_additive_identity-{F}(V0), sum-{F}(V4,V1,V3), sum-{F}(V4,V2,V3), V1 == V2 | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #18: input, references = 3, size of lhs = 4:
% 0.19/0.40     P_additive_identity-{F}(V0), sum-{F}(V3,V1,V2), sum-{F}(V4,V1,V2), V4 == V3 | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #19: input, references = 4, size of lhs = 3:
% 0.19/0.40     P_additive_identity-{F}(V0), P_a-{F}(V1), product-{F}(V1,V0,V0) | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #20: input, references = 4, size of lhs = 0:
% 0.19/0.40     FALSE | EXISTS V0: P_additive_identity-{T}(V0)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #21: input, references = 4, size of lhs = 2:
% 0.19/0.40     #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #22: input, references = 4, size of lhs = 2:
% 0.19/0.40     #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #23: input, references = 3, size of lhs = 1:
% 0.19/0.40     #-{F} V0 | EXISTS V1: P_additive_inverse-{T}(V0,V1)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #24: input, references = 4, size of lhs = 0:
% 0.19/0.40     FALSE | EXISTS V0: P_a-{T}(V0)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  number of initial rules = 25
% 0.19/0.40  
% 0.19/0.40  Simplifiers:
% 0.19/0.40  #25: unsound, references = 3, size of lhs = 3:
% 0.19/0.40     P_additive_identity-{F}(V0), P_additive_identity-{F}(V1), V0 == V1 | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #26: unsound, references = 3, size of lhs = 3:
% 0.19/0.40     P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #27: unsound, references = 3, size of lhs = 3:
% 0.19/0.40     P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #28: unsound, references = 3, size of lhs = 3:
% 0.19/0.40     P_additive_inverse-{F}(V0,V1), P_additive_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #29: unsound, references = 3, size of lhs = 3:
% 0.19/0.40     P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  number of simplifiers = 5
% 0.19/0.40  
% 0.19/0.40  Learnt:
% 0.19/0.40  #36: mergings( V3 == V4; #34 ), references = 1, size of lhs = 2:
% 0.19/0.40     P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3) | P_add-{T}(V1,V2,V3)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #53: mergings( V3 == V4, V4 == V5, V5 == V6; #48 ), references = 2, size of lhs = 3:
% 0.19/0.40     P_additive_identity-{F}(V0), sum-{F}(V1,V1,V1), #-{F} V2 | P_multiply-{T}(V2,V1,V0)
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #58: mergings( V1 == V2; #56 ), references = 1, size of lhs = 2:
% 0.19/0.40     P_additive_identity-{F}(V0), sum-{F}(V0,V0,V0) | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  #61: exists( #20, #59 ), references = 1, size of lhs = 0:
% 0.19/0.40     FALSE | FALSE
% 0.19/0.40        (used 0 times, uses = {})
% 0.19/0.40  
% 0.19/0.40  number of learnt formulas = 4
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.40  
% 0.19/0.40  randbase = 1
%------------------------------------------------------------------------------