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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Geo-III---2018C
% Problem  : HEN010-4 : 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:04:45 EDT 2022

% Result   : Unsatisfiable 1.11s 1.36s
% Output   : Refutation 1.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : HEN010-4 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33  % Computer : n029.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 21:13:11 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.11/1.36  GeoParameters:
% 1.11/1.36  
% 1.11/1.36  tptp_input =     1
% 1.11/1.36  tptp_output =    0
% 1.11/1.36  nonempty =       1
% 1.11/1.36  inputfile =      /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.11/1.36  includepath =    /export/starexec/sandbox2/solver/bin/../../benchmark/
% 1.11/1.36  
% 1.11/1.36  
% 1.11/1.36  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.11/1.36  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.11/1.36  
% 1.11/1.36  RuleSystem INPUT:
% 1.11/1.36  
% 1.11/1.36  Initial Rules:
% 1.11/1.36  #0: input, references = 5, size of lhs = 4:
% 1.11/1.36     P_zero-{F}(V0), P_divide-{F}(V1,V2,V3), less_equal-{F}(V1,V2), V3 == V0 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #1: input, references = 7, size of lhs = 2:
% 1.11/1.36     P_zero-{F}(V0), P_divide-{F}(V1,V2,V0) | less_equal-{T}(V1,V2)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #2: input, references = 6, size of lhs = 2:
% 1.11/1.36     P_zero-{F}(V0), P_divide-{F}(V1,V2,V3) | less_equal-{T}(V3,V1)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #3: input, references = 6, size of lhs = 6:
% 1.11/1.36     P_zero-{F}(V0), P_divide-{F}(V1,V3,V4), P_divide-{F}(V2,V3,V5), P_divide-{F}(V4,V5,V6), P_divide-{F}(V1,V2,V7), P_divide-{F}(V7,V3,V8) | less_equal-{T}(V6,V8)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #4: input, references = 5, size of lhs = 2:
% 1.11/1.36     P_zero-{F}(V0), #-{F} V1 | less_equal-{T}(V0,V1)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #5: input, references = 9, size of lhs = 4:
% 1.11/1.36     P_zero-{F}(V0), less_equal-{F}(V1,V2), less_equal-{F}(V2,V1), V1 == V2 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #6: input, references = 3, size of lhs = 3:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), #-{F} V2 | less_equal-{T}(V2,V1)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #7: input, references = 3, size of lhs = 4:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V2,V1,V3), V3 == V0 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #8: input, references = 4, size of lhs = 4:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V0,V2,V3), V3 == V0 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #9: input, references = 4, size of lhs = 4:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V2,V2,V3), V3 == V0 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #10: input, references = 4, size of lhs = 5:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), V3 == V2 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #11: input, references = 3, size of lhs = 6:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), less_equal-{F}(V4,V5), less_equal-{F}(V6,V4) | less_equal-{T}(V6,V5)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #12: input, references = 7, size of lhs = 7:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_divide-{F}(V4,V5,V7), P_divide-{F}(V4,V6,V8), less_equal-{F}(V7,V6) | less_equal-{T}(V8,V5)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #13: input, references = 4, size of lhs = 7:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), less_equal-{F}(V4,V5), P_divide-{F}(V6,V5,V7), P_divide-{F}(V6,V4,V8) | less_equal-{T}(V7,V8)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #14: input, references = 4, size of lhs = 7:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), less_equal-{F}(V4,V5), P_divide-{F}(V4,V6,V7), P_divide-{F}(V5,V6,V8) | less_equal-{T}(V7,V8)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #15: input, references = 4, size of lhs = 8:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_divide-{F}(V1,V4,V5), P_divide-{F}(V1,V5,V6), P_divide-{F}(V1,V6,V7), V7 == V5 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #16: input, references = 5, size of lhs = 7:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_divide-{F}(V1,V2,V6), P_divide-{F}(V1,V6,V5), P_divide-{F}(V6,V5,V6) | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #17: input, references = 15, size of lhs = 2:
% 1.11/1.36     #-{F} V0, #-{F} V1 | EXISTS V2: P_divide-{T}(V0,V1,V2)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #18: input, references = 4, size of lhs = 0:
% 1.11/1.36     FALSE | EXISTS V0: P_zero-{T}(V0)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #19: input, references = 4, size of lhs = 0:
% 1.11/1.36     FALSE | EXISTS V0: P_identity-{T}(V0)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #20: input, references = 4, size of lhs = 0:
% 1.11/1.36     FALSE | EXISTS V0: P_a-{T}(V0)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  number of initial rules = 21
% 1.11/1.36  
% 1.11/1.36  Simplifiers:
% 1.11/1.36  #21: unsound, references = 3, size of lhs = 3:
% 1.11/1.36     P_divide-{F}(V0,V1,V2), P_divide-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #22: unsound, references = 3, size of lhs = 3:
% 1.11/1.36     P_zero-{F}(V0), P_zero-{F}(V1), V0 == V1 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #23: unsound, references = 3, size of lhs = 3:
% 1.11/1.36     P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #24: unsound, references = 3, size of lhs = 3:
% 1.11/1.36     P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  number of simplifiers = 4
% 1.11/1.36  
% 1.11/1.36  Learnt:
% 1.11/1.36  #26: exists( #17, #9 ), references = 5, size of lhs = 3:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), #-{F} V2 | P_divide-{T}(V2,V2,V0)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #30: exists( #17, #0 ), references = 1, size of lhs = 2:
% 1.11/1.36     P_zero-{F}(V0), less_equal-{F}(V1,V2) | P_divide-{T}(V1,V2,V0)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #31: exists( #17, #8 ), references = 1, size of lhs = 3:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), #-{F} V2 | P_divide-{T}(V0,V2,V0)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #35: exists( #17, #10 ), references = 2, size of lhs = 3:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2) | P_divide-{T}(V2,V0,V2)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #36: exists( #17, #15 ), references = 1, size of lhs = 5:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V1), P_divide-{F}(V1,V2,V0), P_divide-{F}(V1,V3,V2) | P_divide-{T}(V1,V0,V2)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #50: mergings( V3 == V4, V4 == V8; #47 ), references = 1, size of lhs = 6:
% 1.11/1.36     P_identity-{F}(V0), P_a-{F}(V1), P_zero-{F}(V2), P_divide-{F}(V1,V2,V3), P_divide-{F}(V4,V2,V5), less_equal-{F}(V5,V6) | P_divide-{T}(V4,V6,V2)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #63: mergings( V3 == V5, V5 == V6, V6 == V10, V10 == V1, V1 == V11, V4 == V7; #56 ), references = 5, size of lhs = 5:
% 1.11/1.36     P_identity-{F}(V0), P_a-{F}(V1), P_zero-{F}(V2), P_divide-{F}(V1,V2,V3), #-{F} V4 | P_divide-{T}(V4,V2,V4)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #84: mergings( V5 == V7, V7 == V8; #80 ), references = 1, size of lhs = 7:
% 1.11/1.36     P_identity-{F}(V0), P_a-{F}(V1), P_zero-{F}(V2), P_divide-{F}(V1,V2,V3), P_divide-{F}(V4,V5,V2), P_divide-{F}(V6,V5,V2), P_divide-{F}(V7,V4,V6) | P_divide-{T}(V7,V5,V2)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #88: mergings( V3 == V6, V6 == V8, V8 == V9; #81 ), references = 1, size of lhs = 7:
% 1.11/1.36     P_identity-{F}(V0), P_a-{F}(V1), P_zero-{F}(V2), P_divide-{F}(V1,V2,V3), P_divide-{F}(V4,V5,V2), P_divide-{F}(V6,V5,V2), P_divide-{F}(V7,V4,V6) | P_divide-{T}(V7,V5,V2)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #97: mergings( V3 == V4, V4 == V5; #94 ), references = 3, size of lhs = 5:
% 1.11/1.36     P_zero-{F}(V0), P_divide-{F}(V1,V2,V3), P_divide-{F}(V1,V4,V5), P_divide-{F}(V4,V2,V6), P_divide-{F}(V3,V6,V5) | P_divide-{T}(V5,V2,V5)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #109: mergings( V3 == V7, V7 == V11, V4 == V8, V5 == V9, V6 == V10; #103 ), references = 2, size of lhs = 8:
% 1.11/1.36     P_identity-{F}(V0), P_a-{F}(V1), P_zero-{F}(V2), P_divide-{F}(V1,V2,V3), less_equal-{F}(V4,V5), P_divide-{F}(V4,V6,V7), P_divide-{F}(V5,V7,V8), less_equal-{F}(V8,V6) | P_divide-{T}(V5,V6,V7)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #129: mergings( V3 == V4, V4 == V8; #126 ), references = 3, size of lhs = 6:
% 1.11/1.36     P_identity-{F}(V0), P_a-{F}(V1), P_zero-{F}(V2), P_divide-{F}(V1,V2,V3), less_equal-{F}(V4,V5), P_divide-{F}(V6,V5,V6) | P_divide-{T}(V6,V4,V6)
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #160: mergings( V4 == V7, V7 == V9, V9 == V10, V10 == V16, V16 == V20, V20 == V22, V3 == V5, V5 == V11, V11 == V14, V14 == V18, V18 == V0, V6 == V12, V8 == V13, V12 == V15, V13 == V17, V15 == V19, V17 == V21, V19 == V1, V21 == V23; #140 ), references = 1, size of lhs = 9:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), less_equal-{F}(V2,V1), P_divide-{F}(V2,V2,V0), P_divide-{F}(V2,V0,V3), P_divide-{F}(V2,V4,V2), P_divide-{F}(V1,V4,V5), less_equal-{F}(V5,V2) | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #191: mergings( V3 == V9, V9 == V11, V4 == V7, V7 == V0, V5 == V8, V6 == V10, V8 == V12, V10 == V13; #182 ), references = 1, size of lhs = 8:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_divide-{F}(V1,V2,V4), P_divide-{F}(V4,V5,V4), P_divide-{F}(V1,V5,V6), less_equal-{F}(V6,V4) | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #212: mergings( V4 == V7, V7 == V9, V9 == V10, V10 == V16, V16 == V18, V3 == V5, V5 == V11, V11 == V14, V14 == V0, V6 == V12, V8 == V13, V12 == V15, V13 == V17, V15 == V1, V17 == V19; #196 ), references = 1, size of lhs = 5:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V2,V0), P_divide-{F}(V2,V0,V3) | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #224: mergings( V4 == V6, V6 == V9, V1 == V2, V2 == V3, V3 == V5, V5 == V7, V7 == V8, V8 == V10; #215 ), references = 1, size of lhs = 2:
% 1.11/1.36     P_zero-{F}(V0), P_identity-{F}(V1) | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #228: mergings( V1 == V2, V2 == V3; #225 ), references = 1, size of lhs = 1:
% 1.11/1.36     P_zero-{F}(V0) | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  #230: exists( #18, #225 ), references = 1, size of lhs = 0:
% 1.11/1.36     FALSE | FALSE
% 1.11/1.36        (used 0 times, uses = {})
% 1.11/1.36  
% 1.11/1.36  number of learnt formulas = 18
% 1.11/1.36  
% 1.11/1.36  
% 1.11/1.36  % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.11/1.36  
% 1.11/1.36  randbase = 1
%------------------------------------------------------------------------------