↑ Up

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

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

% Computer : n009.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:20:51 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n009.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.18/0.33  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Fri Jul 22 14:56:21 EDT 2022
% 0.18/0.34  % CPUTime  : 
% 0.19/0.43  GeoParameters:
% 0.19/0.43  
% 0.19/0.43  tptp_input =     1
% 0.19/0.43  tptp_output =    0
% 0.19/0.43  nonempty =       1
% 0.19/0.43  inputfile =      /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43  includepath =    /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43  
% 0.19/0.43  RuleSystem INPUT:
% 0.19/0.43  
% 0.19/0.43  Initial Rules:
% 0.19/0.43  #0: input, references = 4, size of lhs = 3:
% 0.19/0.43     P_successor-{F}(V0,V1), P_predecessor-{F}(V1,V2), V2 == V0 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #1: input, references = 4, size of lhs = 3:
% 0.19/0.43     P_predecessor-{F}(V0,V1), P_successor-{F}(V1,V2), V2 == V0 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #2: input, references = 3, size of lhs = 3:
% 0.19/0.43     P_predecessor-{F}(V0,V3), P_predecessor-{F}(V1,V3), V0 == V1 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #3: input, references = 3, size of lhs = 3:
% 0.19/0.43     P_successor-{F}(V0,V3), P_successor-{F}(V1,V3), V0 == V1 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #4: input, references = 3, size of lhs = 1:
% 0.19/0.43     P_predecessor-{F}(V0,V1) | less_than-{T}(V1,V0)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #5: input, references = 4, size of lhs = 1:
% 0.19/0.43     P_successor-{F}(V0,V1) | less_than-{T}(V0,V1)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #6: input, references = 4, size of lhs = 2:
% 0.19/0.43     less_than-{F}(V0,V1), less_than-{F}(V2,V0) | less_than-{T}(V2,V1)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #7: input, references = 3, size of lhs = 3:
% 0.19/0.43     #-{F} V0, #-{F} V1, V0 == V1 | less_than-{T}(V0,V1), less_than-{T}(V1,V0)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #8: input, references = 4, size of lhs = 1:
% 0.19/0.43     less_than-{F}(V0,V0) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #9: input, references = 4, size of lhs = 2:
% 0.19/0.43     less_than-{F}(V0,V1), less_than-{F}(V1,V0) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #10: input, references = 3, size of lhs = 3:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), less_than-{F}(V0,V1) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #11: input, references = 4, size of lhs = 3:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2) | less_than-{T}(V2,V1)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #12: input, references = 4, size of lhs = 3:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2) | less_than-{T}(V2,V0)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #13: input, references = 3, size of lhs = 5:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2), P_one-{F}(V3), less_than-{F}(V2,V3) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #14: input, references = 4, size of lhs = 6:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2), P_one-{F}(V3), P_a-{F}(V2,V4), P_a-{F}(V1,V5) | less_than-{T}(V4,V5)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #15: input, references = 5, size of lhs = 10:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2), P_one-{F}(V3), P_a-{F}(V2,V4), P_a-{F}(V1,V5), P_successor-{F}(V0,V6), P_a-{F}(V7,V8), less_than-{F}(V7,V6), less_than-{F}(V8,V5) | less_than-{T}(V7,V2)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #16: input, references = 3, size of lhs = 12:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2), P_one-{F}(V3), P_a-{F}(V2,V4), P_a-{F}(V1,V5), P_successor-{F}(V0,V6), P_predecessor-{F}(V2,V7), P_a-{F}(V7,V8), less_than-{F}(V3,V2), P_a-{F}(V9,V10), less_than-{F}(V10,V8) | less_than-{T}(V9,V2), less_than-{T}(V0,V9)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #17: input, references = 3, size of lhs = 15:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2), P_one-{F}(V3), P_a-{F}(V2,V4), P_a-{F}(V1,V5), P_successor-{F}(V0,V6), P_predecessor-{F}(V2,V7), P_a-{F}(V7,V8), P_a-{F}(V9,V10), P_predecessor-{F}(V9,V11), P_a-{F}(V11,V12), less_than-{F}(V3,V9), less_than-{F}(V9,V2), less_than-{F}(V10,V12) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #18: input, references = 4, size of lhs = 1:
% 0.19/0.43     #-{F} V0 | EXISTS V1: P_predecessor-{T}(V0,V1)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #19: input, references = 5, size of lhs = 1:
% 0.19/0.43     #-{F} V0 | EXISTS V1: P_successor-{T}(V0,V1)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #20: input, references = 4, size of lhs = 0:
% 0.19/0.43     FALSE | EXISTS V0: P_n-{T}(V0)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #21: input, references = 4, size of lhs = 0:
% 0.19/0.43     FALSE | EXISTS V0: P_m-{T}(V0)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #22: input, references = 5, size of lhs = 0:
% 0.19/0.43     FALSE | EXISTS V0: P_i-{T}(V0)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #23: input, references = 4, size of lhs = 0:
% 0.19/0.43     FALSE | EXISTS V0: P_one-{T}(V0)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #24: input, references = 6, size of lhs = 1:
% 0.19/0.43     #-{F} V0 | EXISTS V1: P_a-{T}(V0,V1)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  number of initial rules = 25
% 0.19/0.43  
% 0.19/0.43  Simplifiers:
% 0.19/0.43  #25: unsound, references = 3, size of lhs = 3:
% 0.19/0.43     P_predecessor-{F}(V0,V1), P_predecessor-{F}(V0,V3), V1 == V3 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #26: unsound, references = 3, size of lhs = 3:
% 0.19/0.43     P_successor-{F}(V0,V1), P_successor-{F}(V0,V3), V1 == V3 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #27: unsound, references = 3, size of lhs = 3:
% 0.19/0.43     P_n-{F}(V0), P_n-{F}(V1), V0 == V1 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #28: unsound, references = 3, size of lhs = 3:
% 0.19/0.43     P_m-{F}(V0), P_m-{F}(V1), V0 == V1 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #29: unsound, references = 3, size of lhs = 3:
% 0.19/0.43     P_i-{F}(V0), P_i-{F}(V1), V0 == V1 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #30: unsound, references = 3, size of lhs = 3:
% 0.19/0.43     P_one-{F}(V0), P_one-{F}(V1), V0 == V1 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #31: unsound, references = 3, size of lhs = 3:
% 0.19/0.43     P_a-{F}(V0,V1), P_a-{F}(V0,V3), V1 == V3 | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  number of simplifiers = 7
% 0.19/0.43  
% 0.19/0.43  Learnt:
% 0.19/0.43  #37: exists( #18, #0 ), references = 1, size of lhs = 1:
% 0.19/0.43     P_successor-{F}(V0,V1) | P_predecessor-{T}(V1,V0)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #40: exists( #19, #1 ), references = 1, size of lhs = 1:
% 0.19/0.43     P_predecessor-{F}(V0,V1) | P_successor-{T}(V1,V0)
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #45: exists( #24, #43 ), references = 1, size of lhs = 10:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2), P_one-{F}(V3), P_a-{F}(V1,V4), P_successor-{F}(V0,V5), less_than-{F}(V2,V6), less_than-{F}(V6,V5), P_a-{F}(V6,V7), less_than-{F}(V7,V4) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #63: mergings( V2 == V6, V3 == V7, V4 == V8; #57 ), references = 1, size of lhs = 7:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_a-{F}(V1,V2), P_i-{F}(V3), P_one-{F}(V4), P_successor-{F}(V0,V5), less_than-{F}(V3,V5) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #69: mergings( V2 == V4, V3 == V6; #64 ), references = 1, size of lhs = 6:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2), P_one-{F}(V3), P_successor-{F}(V0,V4), less_than-{F}(V2,V4) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #81: mergings( V2 == V0, V3 == V6; #76 ), references = 1, size of lhs = 5:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2), less_than-{F}(V2,V0), P_one-{F}(V3) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #85: mergings( V1 == V2; #82 ), references = 2, size of lhs = 4:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1), P_i-{F}(V2), less_than-{F}(V2,V0) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #93: mergings( V1 == V2, V2 == V3, V3 == V4; #88 ), references = 1, size of lhs = 2:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V0) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #97: mergings( V1 == V3; #95 ), references = 1, size of lhs = 2:
% 0.19/0.43     P_n-{F}(V0), P_m-{F}(V1) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #99: exists( #21, #95 ), references = 1, size of lhs = 1:
% 0.19/0.43     P_n-{F}(V0) | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  #101: exists( #20, #98 ), references = 1, size of lhs = 0:
% 0.19/0.43     FALSE | FALSE
% 0.19/0.43        (used 0 times, uses = {})
% 0.19/0.43  
% 0.19/0.43  number of learnt formulas = 11
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43  
% 0.19/0.43  randbase = 1
%------------------------------------------------------------------------------