TSTP Solution File: BOO009-2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : BOO009-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n014.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 05:58:36 EDT 2022
% Result : Unsatisfiable 0.82s 1.01s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : BOO009-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n014.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 08:36:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.82/1.01 GeoParameters:
% 0.82/1.01
% 0.82/1.01 tptp_input = 1
% 0.82/1.01 tptp_output = 0
% 0.82/1.01 nonempty = 1
% 0.82/1.01 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.82/1.01 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.82/1.01
% 0.82/1.01
% 0.82/1.01 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.82/1.01 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.82/1.01
% 0.82/1.01 RuleSystem INPUT:
% 0.82/1.01
% 0.82/1.01 Initial Rules:
% 0.82/1.01 #0: input, references = 4, size of lhs = 3:
% 0.82/1.01 P_add-{F}(V0,V1,V2), P_add-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #1: input, references = 4, size of lhs = 3:
% 0.82/1.01 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #2: input, references = 5, size of lhs = 6:
% 0.82/1.01 P_multiply-{F}(V0,V1,V3), P_add-{F}(V3,V2,V4), P_add-{F}(V0,V2,V5), P_add-{F}(V1,V2,V6), P_multiply-{F}(V5,V6,V7), V4 == V7 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #3: input, references = 4, size of lhs = 6:
% 0.82/1.01 P_multiply-{F}(V1,V2,V3), P_add-{F}(V0,V3,V4), P_add-{F}(V0,V1,V5), P_add-{F}(V0,V2,V6), P_multiply-{F}(V5,V6,V7), V4 == V7 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #4: input, references = 4, size of lhs = 6:
% 0.82/1.01 P_add-{F}(V0,V1,V3), P_multiply-{F}(V3,V2,V4), P_multiply-{F}(V0,V2,V5), P_multiply-{F}(V1,V2,V6), P_add-{F}(V5,V6,V7), V4 == V7 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #5: input, references = 5, size of lhs = 6:
% 0.82/1.01 P_add-{F}(V1,V2,V3), P_multiply-{F}(V0,V3,V4), P_multiply-{F}(V0,V1,V5), P_multiply-{F}(V0,V2,V6), P_add-{F}(V5,V6,V7), V4 == V7 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #6: input, references = 4, size of lhs = 4:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_inverse-{F}(V1,V2), P_add-{F}(V1,V2,V3), V3 == V0 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #7: input, references = 4, size of lhs = 4:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_inverse-{F}(V1,V2), P_add-{F}(V2,V1,V3), V3 == V0 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #8: input, references = 4, size of lhs = 5:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_inverse-{F}(V2,V3), P_multiply-{F}(V2,V3,V4), V4 == V1 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #9: input, references = 4, size of lhs = 5:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_inverse-{F}(V2,V3), P_multiply-{F}(V3,V2,V4), V4 == V1 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #10: input, references = 4, size of lhs = 4:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V2,V0,V3), V3 == V2 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #11: input, references = 4, size of lhs = 4:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V0,V2,V3), V3 == V2 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #12: input, references = 4, size of lhs = 4:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_add-{F}(V2,V1,V3), V3 == V2 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #13: input, references = 4, size of lhs = 4:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_add-{F}(V1,V2,V3), V3 == V2 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #14: input, references = 6, size of lhs = 6:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_a-{F}(V2), P_b-{F}(V3), P_add-{F}(V2,V3,V4), P_multiply-{F}(V2,V4,V2) | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #15: input, references = 8, size of lhs = 2:
% 0.82/1.01 #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #16: input, references = 7, size of lhs = 2:
% 0.82/1.01 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #17: input, references = 7, size of lhs = 1:
% 0.82/1.01 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #18: input, references = 4, size of lhs = 0:
% 0.82/1.01 FALSE | EXISTS V0: P_multiplicative_identity-{T}(V0)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #19: input, references = 4, size of lhs = 0:
% 0.82/1.01 FALSE | EXISTS V0: P_additive_identity-{T}(V0)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #20: input, references = 4, size of lhs = 0:
% 0.82/1.01 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #21: input, references = 5, size of lhs = 0:
% 0.82/1.01 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 number of initial rules = 22
% 0.82/1.01
% 0.82/1.01 Simplifiers:
% 0.82/1.01 #22: unsound, references = 3, size of lhs = 3:
% 0.82/1.01 P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #23: unsound, references = 3, size of lhs = 3:
% 0.82/1.01 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #24: unsound, references = 3, size of lhs = 3:
% 0.82/1.01 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #25: unsound, references = 3, size of lhs = 3:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_multiplicative_identity-{F}(V1), V0 == V1 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #26: unsound, references = 3, size of lhs = 3:
% 0.82/1.01 P_additive_identity-{F}(V0), P_additive_identity-{F}(V1), V0 == V1 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #27: unsound, references = 3, size of lhs = 3:
% 0.82/1.01 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #28: unsound, references = 3, size of lhs = 3:
% 0.82/1.01 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 number of simplifiers = 7
% 0.82/1.01
% 0.82/1.01 Learnt:
% 0.82/1.01 #31: exists( #15, #6 ), references = 1, size of lhs = 2:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_add-{T}(V1,V2,V0)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #32: exists( #15, #7 ), references = 3, size of lhs = 2:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_inverse-{F}(V1,V2) | P_add-{T}(V2,V1,V0)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #35: exists( #16, #8 ), references = 4, size of lhs = 3:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_inverse-{F}(V2,V3) | P_multiply-{T}(V2,V3,V1)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #36: exists( #16, #9 ), references = 1, size of lhs = 3:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_inverse-{F}(V2,V3) | P_multiply-{T}(V3,V2,V1)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #38: exists( #15, #12 ), references = 3, size of lhs = 3:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), #-{F} V2 | P_add-{T}(V2,V1,V2)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #41: exists( #15, #0 ), references = 2, size of lhs = 1:
% 0.82/1.01 P_add-{F}(V0,V1,V2) | P_add-{T}(V1,V0,V2)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #42: exists( #15, #13 ), references = 4, size of lhs = 3:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), #-{F} V2 | P_add-{T}(V1,V2,V2)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #44: exists( #16, #10 ), references = 4, size of lhs = 3:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), #-{F} V2 | P_multiply-{T}(V2,V0,V2)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #54: mergings( V2 == V4, V3 == V5; #51 ), references = 1, size of lhs = 5:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V2,V1,V3), P_add-{F}(V3,V1,V4), V1 == V4 | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #61: exists( #15, #57 ), references = 3, size of lhs = 5:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_add-{F}(V2,V3,V0), P_multiply-{F}(V4,V2,V5), P_add-{F}(V5,V3,V6) | P_add-{T}(V4,V3,V6)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #62: exists( #15, #58 ), references = 1, size of lhs = 5:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_add-{F}(V2,V3,V0), P_multiply-{F}(V4,V3,V5), P_add-{F}(V2,V5,V6) | P_add-{T}(V2,V4,V6)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #66: exists( #16, #1 ), references = 4, size of lhs = 1:
% 0.82/1.01 P_multiply-{F}(V0,V1,V2) | P_multiply-{T}(V1,V0,V2)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #67: exists( #16, #11 ), references = 1, size of lhs = 3:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), #-{F} V2 | P_multiply-{T}(V0,V2,V2)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #68: exists( #16, #2 ), references = 2, size of lhs = 4:
% 0.82/1.01 P_multiply-{F}(V0,V1,V2), P_add-{F}(V2,V3,V4), P_add-{F}(V0,V3,V5), P_add-{F}(V1,V3,V6) | P_multiply-{T}(V5,V6,V4)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #78: mergings( V2 == V4, V4 == V6, V3 == V5, V5 == V7; #73 ), references = 1, size of lhs = 5:
% 0.82/1.01 P_a-{F}(V0), P_multiply-{F}(V0,V0,V0), P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_b-{F}(V2) | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #84: mergings( V1 == V3, V3 == V5, V2 == V4, V4 == V6; #79 ), references = 1, size of lhs = 4:
% 0.82/1.01 P_a-{F}(V0), P_multiply-{F}(V0,V0,V0), P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1) | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #94: exists( #16, #90 ), references = 2, size of lhs = 5:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V2,V3,V1), P_add-{F}(V2,V4,V5), P_multiply-{F}(V5,V3,V6) | P_multiply-{T}(V4,V3,V6)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #95: exists( #16, #91 ), references = 1, size of lhs = 5:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_multiply-{F}(V2,V3,V1), P_add-{F}(V4,V3,V5), P_multiply-{F}(V2,V5,V6) | P_multiply-{T}(V2,V4,V6)
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #107: mergings( V2 == V3, V3 == V5, V5 == V7, V4 == V6, V6 == V8; #101 ), references = 1, size of lhs = 6:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_a-{F}(V2), P_b-{F}(V2), P_add-{F}(V1,V2,V2), P_multiply-{F}(V0,V2,V2) | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #126: mergings( V2 == V3, V3 == V5, V5 == V7, V4 == V6, V6 == V8; #120 ), references = 1, size of lhs = 7:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_a-{F}(V2), P_b-{F}(V3), P_add-{F}(V2,V3,V4), P_add-{F}(V1,V5,V2), P_add-{F}(V6,V5,V4) | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #134: mergings( V3 == V4, V4 == V6, V6 == V8, V5 == V7, V7 == V9; #128 ), references = 1, size of lhs = 5:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_a-{F}(V2), P_add-{F}(V1,V2,V2), P_b-{F}(V3) | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #141: mergings( V1 == V2, V2 == V4, V4 == V6, V3 == V5, V5 == V7; #135 ), references = 2, size of lhs = 4:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1), P_a-{F}(V2), P_add-{F}(V1,V2,V2) | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #145: mergings( V1 == V2; #143 ), references = 1, size of lhs = 2:
% 0.82/1.01 P_multiplicative_identity-{F}(V0), P_additive_identity-{F}(V1) | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #148: mergings( V1 == V2; #146 ), references = 1, size of lhs = 1:
% 0.82/1.01 P_multiplicative_identity-{F}(V0) | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 #150: exists( #18, #146 ), references = 1, size of lhs = 0:
% 0.82/1.01 FALSE | FALSE
% 0.82/1.01 (used 0 times, uses = {})
% 0.82/1.01
% 0.82/1.01 number of learnt formulas = 25
% 0.82/1.01
% 0.82/1.01
% 0.82/1.01 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.82/1.01
% 0.82/1.01 randbase = 1
%------------------------------------------------------------------------------