TSTP Solution File: HEN006-4 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : HEN006-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n010.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:42 EDT 2022
% Result : Unsatisfiable 1.39s 1.57s
% Output : Refutation 1.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN006-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n010.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 20:56:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.39/1.57 GeoParameters:
% 1.39/1.57
% 1.39/1.57 tptp_input = 1
% 1.39/1.57 tptp_output = 0
% 1.39/1.57 nonempty = 1
% 1.39/1.57 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.39/1.57 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 1.39/1.57
% 1.39/1.57
% 1.39/1.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.39/1.57 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.39/1.57
% 1.39/1.57 RuleSystem INPUT:
% 1.39/1.57
% 1.39/1.57 Initial Rules:
% 1.39/1.57 #0: input, references = 4, size of lhs = 4:
% 1.39/1.57 P_zero-{F}(V0), P_divide-{F}(V1,V2,V3), less_equal-{F}(V1,V2), V3 == V0 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #1: input, references = 6, size of lhs = 2:
% 1.39/1.57 P_zero-{F}(V0), P_divide-{F}(V1,V2,V0) | less_equal-{T}(V1,V2)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #2: input, references = 8, size of lhs = 2:
% 1.39/1.57 P_zero-{F}(V0), P_divide-{F}(V1,V2,V3) | less_equal-{T}(V3,V1)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #3: input, references = 5, size of lhs = 6:
% 1.39/1.57 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.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #4: input, references = 7, size of lhs = 2:
% 1.39/1.57 P_zero-{F}(V0), #-{F} V1 | less_equal-{T}(V0,V1)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #5: input, references = 7, size of lhs = 4:
% 1.39/1.57 P_zero-{F}(V0), less_equal-{F}(V1,V2), less_equal-{F}(V2,V1), V1 == V2 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #6: input, references = 4, size of lhs = 3:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), #-{F} V2 | less_equal-{T}(V2,V1)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #7: input, references = 3, size of lhs = 4:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V2,V1,V3), V3 == V0 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #8: input, references = 4, size of lhs = 4:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V0,V2,V3), V3 == V0 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #9: input, references = 4, size of lhs = 4:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V2,V2,V3), V3 == V0 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #10: input, references = 4, size of lhs = 5:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), V3 == V2 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #11: input, references = 7, size of lhs = 6:
% 1.39/1.57 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.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #12: input, references = 6, size of lhs = 7:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4), P_divide-{F}(V2,V4,V5), P_d-{F}(V6) | less_equal-{T}(V5,V6)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #13: input, references = 8, size of lhs = 9:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4), P_divide-{F}(V2,V4,V5), P_d-{F}(V6), P_divide-{F}(V2,V6,V7), less_equal-{F}(V7,V4) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #14: input, references = 16, size of lhs = 2:
% 1.39/1.57 #-{F} V0, #-{F} V1 | EXISTS V2: P_divide-{T}(V0,V1,V2)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #15: input, references = 4, size of lhs = 0:
% 1.39/1.57 FALSE | EXISTS V0: P_zero-{T}(V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #16: input, references = 4, size of lhs = 0:
% 1.39/1.57 FALSE | EXISTS V0: P_identity-{T}(V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #17: input, references = 4, size of lhs = 0:
% 1.39/1.57 FALSE | EXISTS V0: P_a-{T}(V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #18: input, references = 5, size of lhs = 0:
% 1.39/1.57 FALSE | EXISTS V0: P_b-{T}(V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #19: input, references = 7, size of lhs = 0:
% 1.39/1.57 FALSE | EXISTS V0: P_d-{T}(V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 number of initial rules = 20
% 1.39/1.57
% 1.39/1.57 Simplifiers:
% 1.39/1.57 #20: unsound, references = 3, size of lhs = 3:
% 1.39/1.57 P_divide-{F}(V0,V1,V2), P_divide-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #21: unsound, references = 3, size of lhs = 3:
% 1.39/1.57 P_zero-{F}(V0), P_zero-{F}(V1), V0 == V1 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #22: unsound, references = 3, size of lhs = 3:
% 1.39/1.57 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #23: unsound, references = 3, size of lhs = 3:
% 1.39/1.57 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #24: unsound, references = 3, size of lhs = 3:
% 1.39/1.57 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #25: unsound, references = 3, size of lhs = 3:
% 1.39/1.57 P_d-{F}(V0), P_d-{F}(V1), V0 == V1 | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 number of simplifiers = 6
% 1.39/1.57
% 1.39/1.57 Learnt:
% 1.39/1.57 #28: exists( #14, #9 ), references = 1, size of lhs = 3:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), #-{F} V2 | P_divide-{T}(V2,V2,V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #31: exists( #14, #0 ), references = 5, size of lhs = 2:
% 1.39/1.57 P_zero-{F}(V0), less_equal-{F}(V1,V2) | P_divide-{T}(V1,V2,V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #32: exists( #14, #8 ), references = 1, size of lhs = 3:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), #-{F} V2 | P_divide-{T}(V0,V2,V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #39: mergings( V1 == V2, V2 == V3; #36 ), references = 2, size of lhs = 7:
% 1.39/1.57 P_a-{F}(V0), P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V0,V0,V2), P_b-{F}(V3), less_equal-{F}(V0,V3), P_divide-{F}(V0,V3,V4) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #44: mergings( V1 == V2; #42 ), references = 1, size of lhs = 4:
% 1.39/1.57 P_a-{F}(V0), P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V0,V0,V2) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #46: exists( #14, #10 ), references = 1, size of lhs = 3:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2) | P_divide-{T}(V2,V0,V2)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #51: mergings( V3 == V5, V4 == V6; #48 ), references = 1, size of lhs = 7:
% 1.39/1.57 P_b-{F}(V0), P_identity-{F}(V0), P_zero-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V1,V3), P_divide-{F}(V2,V0,V4), P_d-{F}(V5) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #55: mergings( V1 == V3, V2 == V4; #52 ), references = 1, size of lhs = 6:
% 1.39/1.57 P_b-{F}(V0), P_identity-{F}(V0), P_zero-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V1,V3), P_divide-{F}(V2,V0,V4) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #69: mergings( V1 == V7, V7 == V8, V2 == V9, V3 == V6, V4 == V10, V5 == V11, V6 == V12; #61 ), references = 1, size of lhs = 7:
% 1.39/1.57 P_a-{F}(V0), P_zero-{F}(V1), P_identity-{F}(V2), P_divide-{F}(V0,V1,V3), P_b-{F}(V4), less_equal-{F}(V1,V4), P_divide-{F}(V0,V4,V0) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #73: exists( #14, #13 ), references = 3, size of lhs = 8:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4), P_d-{F}(V5), P_divide-{F}(V2,V5,V6), less_equal-{F}(V6,V4) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #85: mergings( V3 == V4, V4 == V7; #82 ), references = 1, size of lhs = 6:
% 1.39/1.57 P_d-{F}(V0), P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4) | P_divide-{T}(V2,V4,V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #110: mergings( V3 == V4, V4 == V8, V5 == V9, V6 == V0, V7 == V10; #103 ), references = 1, size of lhs = 7:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4), less_equal-{F}(V2,V4), P_d-{F}(V5) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #118: mergings( V3 == V4, V4 == V5; #115 ), references = 4, size of lhs = 5:
% 1.39/1.57 P_zero-{F}(V0), P_divide-{F}(V1,V2,V0), P_divide-{F}(V3,V2,V4), P_divide-{F}(V3,V5,V1), P_divide-{F}(V5,V2,V6) | P_divide-{T}(V4,V6,V0)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #163: mergings( V3 == V4, V4 == V8, V8 == V9; #159 ), references = 1, size of lhs = 8:
% 1.39/1.57 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,V7,V5), P_divide-{F}(V6,V4,V8), P_divide-{F}(V8,V7,V2) | P_divide-{T}(V4,V7,V5)
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #182: mergings( V3 == V4, V4 == V5; #179 ), references = 1, size of lhs = 5:
% 1.39/1.57 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.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #251: mergings( V3 == V4, V4 == V5, V5 == V9, V6 == V10, V7 == V11, V8 == V12; #242 ), references = 1, size of lhs = 10:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4), P_d-{F}(V5), P_divide-{F}(V2,V5,V6), P_divide-{F}(V7,V8,V6), P_divide-{F}(V7,V4,V9), P_divide-{F}(V9,V8,V0) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #258: mergings( V3 == V4, V4 == V5, V5 == V9, V6 == V10, V7 == V11, V8 == V12; #243 ), references = 1, size of lhs = 11:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4), P_divide-{F}(V2,V4,V5), P_d-{F}(V6), P_divide-{F}(V2,V6,V7), P_divide-{F}(V8,V9,V7), P_divide-{F}(V8,V4,V10), P_divide-{F}(V10,V9,V0) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #267: mergings( V3 == V4, V4 == V5, V5 == V9, V6 == V10, V7 == V0, V8 == V11; #259 ), references = 1, size of lhs = 8:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4), P_d-{F}(V5), P_divide-{F}(V2,V4,V6), P_divide-{F}(V6,V5,V0) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #275: mergings( V13 == V14, V3 == V4, V4 == V5, V5 == V9, V6 == V10, V7 == V0, V8 == V11; #260 ), references = 1, size of lhs = 8:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4), P_d-{F}(V5), P_divide-{F}(V2,V4,V6), P_divide-{F}(V6,V5,V0) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #291: mergings( V3 == V6, V6 == V7, V7 == V8, V8 == V12, V5 == V14, V4 == V9, V9 == V13, V10 == V0, V11 == V14; #280 ), references = 1, size of lhs = 6:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4), P_d-{F}(V5) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #303: mergings( V1 == V3, V3 == V4, V4 == V5, V5 == V9, V12 == V13, V2 == V6, V6 == V10, V7 == V11, V8 == V13; #292 ), references = 1, size of lhs = 5:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3), P_b-{F}(V4) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #315: mergings( V1 == V3, V3 == V4, V4 == V5, V5 == V9, V12 == V13, V2 == V6, V6 == V10, V7 == V11, V8 == V13; #304 ), references = 1, size of lhs = 4:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1), P_a-{F}(V2), P_divide-{F}(V2,V0,V3) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #325: mergings( V3 == V4, V4 == V6, V1 == V2, V2 == V5, V5 == V7; #318 ), references = 1, size of lhs = 2:
% 1.39/1.57 P_zero-{F}(V0), P_identity-{F}(V1) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #330: mergings( V1 == V2, V2 == V3; #326 ), references = 1, size of lhs = 1:
% 1.39/1.57 P_zero-{F}(V0) | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 #333: exists( #15, #326 ), references = 1, size of lhs = 0:
% 1.39/1.57 FALSE | FALSE
% 1.39/1.57 (used 0 times, uses = {})
% 1.39/1.57
% 1.39/1.57 number of learnt formulas = 25
% 1.39/1.57
% 1.39/1.57
% 1.39/1.57 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.39/1.57
% 1.39/1.57 randbase = 1
%------------------------------------------------------------------------------