TSTP Solution File: ROB013-1 by Geo-III---2018C

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : ROB013-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : geo -tptp_input -nonempty -inputfile %s

% Computer : n017.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:15:11 EDT 2022

% Result   : Unsatisfiable 1.10s 1.31s
% Output   : Refutation 1.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : ROB013-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n017.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 10:40:13 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.10/1.31  GeoParameters:
% 1.10/1.31  
% 1.10/1.31  tptp_input =     1
% 1.10/1.31  tptp_output =    0
% 1.10/1.31  nonempty =       1
% 1.10/1.31  inputfile =      /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.10/1.31  includepath =    /export/starexec/sandbox2/solver/bin/../../benchmark/
% 1.10/1.31  
% 1.10/1.31  
% 1.10/1.31  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.10/1.31  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.10/1.31  
% 1.10/1.31  RuleSystem INPUT:
% 1.10/1.31  
% 1.10/1.31  Initial Rules:
% 1.10/1.31  #0: input, references = 4, size of lhs = 3:
% 1.10/1.31     P_add-{F}(V0,V1,V2), P_add-{F}(V1,V0,V3), V2 == V3 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #1: input, references = 4, size of lhs = 5:
% 1.10/1.31     P_add-{F}(V0,V1,V3), P_add-{F}(V3,V2,V4), P_add-{F}(V1,V2,V5), P_add-{F}(V0,V5,V6), V4 == V6 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #2: input, references = 7, size of lhs = 8:
% 1.10/1.31     P_add-{F}(V0,V1,V2), P_negate-{F}(V2,V3), P_negate-{F}(V1,V4), P_add-{F}(V0,V4,V5), P_negate-{F}(V5,V6), P_add-{F}(V3,V6,V7), P_negate-{F}(V7,V8), V8 == V0 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #3: input, references = 4, size of lhs = 6:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_add-{F}(V0,V1,V2), P_negate-{F}(V2,V3), P_c-{F}(V4), V3 == V4 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #4: input, references = 7, size of lhs = 10:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_add-{F}(V0,V1,V2), P_negate-{F}(V2,V3), P_c-{F}(V4), P_negate-{F}(V1,V5), P_add-{F}(V5,V0,V6), P_negate-{F}(V6,V7), P_add-{F}(V4,V7,V8), P_negate-{F}(V8,V0) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #5: input, references = 18, size of lhs = 2:
% 1.10/1.31     #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #6: input, references = 9, size of lhs = 1:
% 1.10/1.31     #-{F} V0 | EXISTS V1: P_negate-{T}(V0,V1)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #7: input, references = 4, size of lhs = 0:
% 1.10/1.31     FALSE | EXISTS V0: P_a-{T}(V0)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #8: input, references = 4, size of lhs = 0:
% 1.10/1.31     FALSE | EXISTS V0: P_b-{T}(V0)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #9: input, references = 4, size of lhs = 0:
% 1.10/1.31     FALSE | EXISTS V0: P_c-{T}(V0)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  number of initial rules = 10
% 1.10/1.31  
% 1.10/1.31  Simplifiers:
% 1.10/1.31  #10: unsound, references = 3, size of lhs = 3:
% 1.10/1.31     P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #11: unsound, references = 3, size of lhs = 3:
% 1.10/1.31     P_negate-{F}(V0,V1), P_negate-{F}(V0,V3), V1 == V3 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #12: unsound, references = 3, size of lhs = 3:
% 1.10/1.31     P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #13: unsound, references = 3, size of lhs = 3:
% 1.10/1.31     P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #14: unsound, references = 3, size of lhs = 3:
% 1.10/1.31     P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  number of simplifiers = 5
% 1.10/1.31  
% 1.10/1.31  Learnt:
% 1.10/1.31  #16: exists( #5, #0 ), references = 14, size of lhs = 1:
% 1.10/1.31     P_add-{F}(V0,V1,V2) | P_add-{T}(V1,V0,V2)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #18: exists( #6, #3 ), references = 4, size of lhs = 4:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_add-{F}(V0,V1,V2), P_c-{F}(V3) | P_negate-{T}(V2,V3)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #23: exists( #5, #19 ), references = 1, size of lhs = 9:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_negate-{F}(V3,V0), P_negate-{F}(V4,V1), P_negate-{F}(V5,V6), P_add-{F}(V7,V5,V3), V2 == V7, P_add-{F}(V7,V6,V4) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #24: exists( #5, #20 ), references = 1, size of lhs = 6:
% 1.10/1.31     P_a-{F}(V0), P_c-{F}(V0), P_b-{F}(V1), P_negate-{F}(V1,V2), P_add-{F}(V2,V0,V3), P_negate-{F}(V3,V1) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #26: exists( #5, #1 ), references = 9, size of lhs = 3:
% 1.10/1.31     P_add-{F}(V0,V1,V2), P_add-{F}(V2,V3,V4), P_add-{F}(V1,V3,V5) | P_add-{T}(V0,V5,V4)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #32: exists( #6, #2 ), references = 3, size of lhs = 6:
% 1.10/1.31     P_negate-{F}(V0,V1), P_add-{F}(V2,V0,V3), P_negate-{F}(V3,V4), P_add-{F}(V2,V1,V5), P_negate-{F}(V5,V6), P_add-{F}(V4,V6,V7) | P_negate-{T}(V7,V2)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #43: exists( #5, #37 ), references = 1, size of lhs = 11:
% 1.10/1.31     P_negate-{F}(V0,V1), P_add-{F}(V2,V0,V3), P_negate-{F}(V3,V4), P_add-{F}(V2,V1,V5), P_negate-{F}(V5,V6), P_negate-{F}(V7,V6), P_negate-{F}(V8,V4), P_negate-{F}(V9,V10), P_add-{F}(V11,V9,V7), V2 == V11, P_add-{F}(V11,V10,V8) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #44: exists( #5, #38 ), references = 1, size of lhs = 13:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_add-{F}(V0,V1,V2), P_negate-{F}(V2,V3), P_c-{F}(V4), P_negate-{F}(V1,V5), P_add-{F}(V5,V0,V6), P_negate-{F}(V6,V7), P_negate-{F}(V8,V7), P_add-{F}(V0,V9,V8), P_negate-{F}(V9,V10), P_add-{F}(V0,V10,V11), P_negate-{F}(V11,V4) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #47: exists( #6, #40 ), references = 3, size of lhs = 9:
% 1.10/1.31     P_negate-{F}(V0,V1), P_add-{F}(V2,V0,V3), P_negate-{F}(V3,V4), P_add-{F}(V2,V1,V5), P_negate-{F}(V6,V4), P_negate-{F}(V7,V8), P_add-{F}(V9,V7,V5), V2 == V9, P_add-{F}(V9,V8,V6) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #48: exists( #6, #41 ), references = 1, size of lhs = 11:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_add-{F}(V0,V1,V2), P_negate-{F}(V2,V3), P_c-{F}(V4), P_negate-{F}(V1,V5), P_add-{F}(V5,V0,V6), P_add-{F}(V0,V7,V6), P_negate-{F}(V7,V8), P_add-{F}(V0,V8,V9), P_negate-{F}(V9,V4) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #53: exists( #5, #49 ), references = 1, size of lhs = 10:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_negate-{F}(V3,V1), P_add-{F}(V0,V3,V4), P_negate-{F}(V5,V2), P_negate-{F}(V6,V7), P_add-{F}(V8,V6,V5), V8 == V0, P_add-{F}(V8,V7,V4) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #54: exists( #5, #50 ), references = 1, size of lhs = 7:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_negate-{F}(V1,V3), P_add-{F}(V3,V0,V4), P_add-{F}(V0,V5,V4), P_negate-{F}(V5,V1) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #59: exists( #5, #55 ), references = 1, size of lhs = 8:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_negate-{F}(V3,V1), V3 == V0, P_negate-{F}(V4,V0), P_add-{F}(V3,V4,V5), P_negate-{F}(V5,V2) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #60: exists( #5, #56 ), references = 1, size of lhs = 5:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_negate-{F}(V1,V3), P_negate-{F}(V3,V1) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #73: exists( #5, #71 ), references = 1, size of lhs = 9:
% 1.10/1.31     P_negate-{F}(V0,V1), P_negate-{F}(V2,V3), P_add-{F}(V2,V4,V5), P_add-{F}(V5,V0,V6), P_negate-{F}(V6,V7), P_add-{F}(V4,V1,V8), V5 == V8, P_add-{F}(V8,V3,V9), P_negate-{F}(V9,V7) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #108: exists( #5, #104 ), references = 1, size of lhs = 15:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_add-{F}(V0,V1,V2), P_negate-{F}(V2,V3), P_c-{F}(V4), P_negate-{F}(V1,V5), P_add-{F}(V5,V0,V6), P_negate-{F}(V6,V7), P_negate-{F}(V8,V4), P_add-{F}(V0,V9,V8), P_negate-{F}(V9,V10), P_add-{F}(V0,V10,V11), P_negate-{F}(V11,V7), P_add-{F}(V4,V12,V13), P_add-{F}(V12,V14,V7) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #115: exists( #5, #113 ), references = 1, size of lhs = 9:
% 1.10/1.31     P_negate-{F}(V0,V1), P_add-{F}(V1,V2,V3), P_add-{F}(V3,V4,V5), P_negate-{F}(V5,V6), P_add-{F}(V0,V4,V7), P_add-{F}(V7,V2,V8), P_negate-{F}(V8,V9), P_add-{F}(V9,V6,V10), P_negate-{F}(V10,V11) | P_add-{T}(V2,V4,V11)
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #125: exists( #5, #120 ), references = 1, size of lhs = 13:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_add-{F}(V0,V1,V2), P_negate-{F}(V2,V3), P_c-{F}(V4), P_negate-{F}(V1,V5), P_add-{F}(V5,V0,V6), P_negate-{F}(V6,V7), P_negate-{F}(V8,V4), P_add-{F}(V0,V9,V8), P_negate-{F}(V9,V10), P_add-{F}(V0,V10,V11), P_negate-{F}(V11,V7) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #127: exists( #6, #123 ), references = 2, size of lhs = 11:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_add-{F}(V0,V1,V2), P_negate-{F}(V2,V3), P_c-{F}(V4), P_negate-{F}(V1,V5), P_add-{F}(V5,V0,V6), P_negate-{F}(V7,V4), P_add-{F}(V0,V8,V7), P_negate-{F}(V8,V9), P_add-{F}(V0,V9,V6) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #154: exists( #6, #47 ), references = 3, size of lhs = 7:
% 1.10/1.31     P_negate-{F}(V0,V1), P_add-{F}(V2,V0,V3), P_add-{F}(V2,V1,V4), P_negate-{F}(V5,V6), P_add-{F}(V7,V5,V4), V2 == V7, P_add-{F}(V7,V6,V3) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #157: exists( #5, #155 ), references = 1, size of lhs = 7:
% 1.10/1.31     P_negate-{F}(V0,V1), P_add-{F}(V2,V3,V1), P_negate-{F}(V3,V4), P_add-{F}(V5,V2,V6), V5 == V6, P_add-{F}(V5,V0,V7), P_add-{F}(V6,V4,V7) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #174: exists( #5, #172 ), references = 1, size of lhs = 7:
% 1.10/1.31     P_negate-{F}(V0,V1), P_add-{F}(V2,V3,V1), P_add-{F}(V4,V2,V5), V4 == V3, P_add-{F}(V4,V0,V6), P_negate-{F}(V5,V7), P_add-{F}(V3,V7,V6) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #180: exists( #5, #178 ), references = 1, size of lhs = 7:
% 1.10/1.31     P_negate-{F}(V0,V0), P_negate-{F}(V1,V1), P_add-{F}(V2,V3,V1), P_add-{F}(V3,V4,V5), P_add-{F}(V4,V0,V6), P_add-{F}(V7,V2,V6), V7 == V5 | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #192: exists( #5, #190 ), references = 1, size of lhs = 9:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_add-{F}(V0,V1,V2), P_negate-{F}(V2,V3), P_c-{F}(V4), P_negate-{F}(V1,V5), P_negate-{F}(V6,V5), P_add-{F}(V0,V6,V7), P_negate-{F}(V7,V4) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #195: exists( #5, #193 ), references = 1, size of lhs = 4:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_negate-{F}(V1,V3) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #197: exists( #6, #194 ), references = 1, size of lhs = 3:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #199: exists( #9, #196 ), references = 1, size of lhs = 2:
% 1.10/1.31     P_a-{F}(V0), P_b-{F}(V1) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #201: exists( #8, #198 ), references = 1, size of lhs = 1:
% 1.10/1.31     P_a-{F}(V0) | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  #203: exists( #7, #200 ), references = 1, size of lhs = 0:
% 1.10/1.31     FALSE | FALSE
% 1.10/1.31        (used 0 times, uses = {})
% 1.10/1.31  
% 1.10/1.31  number of learnt formulas = 29
% 1.10/1.31  
% 1.10/1.31  
% 1.10/1.31  % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.10/1.31  
% 1.10/1.31  randbase = 1
%------------------------------------------------------------------------------