TSTP Solution File: BOO012-4 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : BOO012-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n020.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:37 EDT 2022
% Result : Unsatisfiable 0.85s 1.04s
% Output : Refutation 0.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : BOO012-4 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jul 22 08:40:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.85/1.04 GeoParameters:
% 0.85/1.04
% 0.85/1.04 tptp_input = 1
% 0.85/1.04 tptp_output = 0
% 0.85/1.04 nonempty = 1
% 0.85/1.04 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.04 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.85/1.04
% 0.85/1.04
% 0.85/1.04 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.04 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.04
% 0.85/1.04 RuleSystem INPUT:
% 0.85/1.04
% 0.85/1.04 Initial Rules:
% 0.85/1.04 #0: input, references = 5, size of lhs = 3:
% 0.85/1.04 P_add-{F}(V0,V1,V2), P_add-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #1: input, references = 6, size of lhs = 3:
% 0.85/1.04 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #2: input, references = 5, size of lhs = 6:
% 0.85/1.04 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.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #3: input, references = 5, size of lhs = 6:
% 0.85/1.04 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.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #4: input, references = 4, size of lhs = 3:
% 0.85/1.04 P_additive_identity-{F}(V0), P_add-{F}(V1,V0,V2), V2 == V1 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #5: input, references = 5, size of lhs = 4:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_multiply-{F}(V2,V1,V3), V3 == V2 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #6: input, references = 4, size of lhs = 5:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_inverse-{F}(V2,V3), P_add-{F}(V2,V3,V4), V4 == V1 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #7: input, references = 4, size of lhs = 5:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_inverse-{F}(V2,V3), P_multiply-{F}(V2,V3,V4), V4 == V0 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #8: input, references = 4, size of lhs = 5:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_x-{F}(V2), P_inverse-{F}(V2,V3), P_inverse-{F}(V3,V2) | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #9: input, references = 7, size of lhs = 2:
% 0.85/1.04 #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #10: input, references = 8, size of lhs = 2:
% 0.85/1.04 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #11: input, references = 4, size of lhs = 0:
% 0.85/1.04 FALSE | EXISTS V0: P_additive_identity-{T}(V0)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #12: input, references = 4, size of lhs = 0:
% 0.85/1.04 FALSE | EXISTS V0: P_multiplicative_identity-{T}(V0)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #13: input, references = 8, size of lhs = 1:
% 0.85/1.04 #-{F} V0 | EXISTS V1: P_inverse-{T}(V0,V1)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #14: input, references = 4, size of lhs = 0:
% 0.85/1.04 FALSE | EXISTS V0: P_x-{T}(V0)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 number of initial rules = 15
% 0.85/1.04
% 0.85/1.04 Simplifiers:
% 0.85/1.04 #15: unsound, references = 3, size of lhs = 3:
% 0.85/1.04 P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #16: unsound, references = 3, size of lhs = 3:
% 0.85/1.04 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #17: unsound, references = 3, size of lhs = 3:
% 0.85/1.04 P_additive_identity-{F}(V0), P_additive_identity-{F}(V1), V0 == V1 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #18: unsound, references = 3, size of lhs = 3:
% 0.85/1.04 P_multiplicative_identity-{F}(V0), P_multiplicative_identity-{F}(V1), V0 == V1 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #19: unsound, references = 3, size of lhs = 3:
% 0.85/1.04 P_inverse-{F}(V0,V1), P_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #20: unsound, references = 3, size of lhs = 3:
% 0.85/1.04 P_x-{F}(V0), P_x-{F}(V1), V0 == V1 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 number of simplifiers = 6
% 0.85/1.04
% 0.85/1.04 Learnt:
% 0.85/1.04 #23: exists( #9, #4 ), references = 5, size of lhs = 2:
% 0.85/1.04 P_additive_identity-{F}(V0), #-{F} V1 | P_add-{T}(V1,V0,V1)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #24: exists( #9, #6 ), references = 5, size of lhs = 3:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_inverse-{F}(V2,V3) | P_add-{T}(V2,V3,V1)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #26: exists( #10, #5 ), references = 5, size of lhs = 3:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), #-{F} V2 | P_multiply-{T}(V2,V1,V2)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #28: exists( #9, #3 ), references = 1, size of lhs = 4:
% 0.85/1.04 P_add-{F}(V0,V1,V2), P_multiply-{F}(V3,V2,V4), P_multiply-{F}(V3,V0,V5), P_multiply-{F}(V3,V1,V6) | P_add-{T}(V5,V6,V4)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #30: exists( #10, #2 ), references = 3, size of lhs = 4:
% 0.85/1.04 P_multiply-{F}(V0,V1,V2), P_add-{F}(V3,V2,V4), P_add-{F}(V3,V0,V5), P_add-{F}(V3,V1,V6) | P_multiply-{T}(V5,V6,V4)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #37: mergings( V2 == V4, V3 == V5; #34 ), references = 2, size of lhs = 5:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_add-{F}(V2,V1,V3), P_multiply-{F}(V3,V1,V4), V4 == V1 | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #42: exists( #9, #0 ), references = 3, size of lhs = 1:
% 0.85/1.04 P_add-{F}(V0,V1,V2) | P_add-{T}(V1,V0,V2)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #46: exists( #10, #7 ), references = 4, size of lhs = 3:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_inverse-{F}(V2,V3) | P_multiply-{T}(V2,V3,V0)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #53: exists( #10, #51 ), references = 1, size of lhs = 4:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_add-{F}(V3,V2,V4), P_multiply-{F}(V1,V4,V5) | P_multiply-{T}(V1,V3,V5)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #58: mergings( V0 == V2; #56 ), references = 1, size of lhs = 2:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1) | P_inverse-{T}(V0,V1)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #66: mergings( V2 == V3, V0 == V4; #63 ), references = 1, size of lhs = 2:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1) | P_inverse-{T}(V1,V0)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #74: mergings( V3 == V4; #70 ), references = 1, size of lhs = 3:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), #-{F} V2 | P_add-{T}(V2,V1,V1)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #75: exists( #9, #67 ), references = 2, size of lhs = 5:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_add-{F}(V2,V3,V1), P_multiply-{F}(V4,V3,V5), P_add-{F}(V2,V5,V6) | P_add-{T}(V2,V4,V6)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #92: exists( #10, #1 ), references = 2, size of lhs = 1:
% 0.85/1.04 P_multiply-{F}(V0,V1,V2) | P_multiply-{T}(V1,V0,V2)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #108: mergings( V2 == V3, V3 == V4, V4 == V6, V6 == V8, V5 == V7, V7 == V9; #101 ), references = 2, size of lhs = 5:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_add-{F}(V2,V3,V1), P_multiply-{F}(V2,V3,V0), P_add-{F}(V2,V0,V4) | P_inverse-{T}(V3,V4)
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #120: mergings( V2 == V4, V4 == V6, V3 == V5, V5 == V7; #115 ), references = 1, size of lhs = 4:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1), P_x-{F}(V2), P_add-{F}(V2,V0,V2) | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #127: mergings( V1 == V3, V3 == V5, V2 == V4, V4 == V6; #122 ), references = 1, size of lhs = 2:
% 0.85/1.04 P_additive_identity-{F}(V0), P_multiplicative_identity-{F}(V1) | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #131: mergings( V1 == V2, V2 == V3; #128 ), references = 1, size of lhs = 1:
% 0.85/1.04 P_additive_identity-{F}(V0) | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 #133: exists( #11, #128 ), references = 1, size of lhs = 0:
% 0.85/1.04 FALSE | FALSE
% 0.85/1.04 (used 0 times, uses = {})
% 0.85/1.04
% 0.85/1.04 number of learnt formulas = 19
% 0.85/1.04
% 0.85/1.04
% 0.85/1.04 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.04
% 0.85/1.04 randbase = 1
%------------------------------------------------------------------------------