TSTP Solution File: NUM017-2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : NUM017-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n028.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:11:58 EDT 2022
% Result : Unsatisfiable 0.49s 0.66s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM017-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n028.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 23:15:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.49/0.66 GeoParameters:
% 0.49/0.66
% 0.49/0.66 tptp_input = 1
% 0.49/0.66 tptp_output = 0
% 0.49/0.66 nonempty = 1
% 0.49/0.66 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.49/0.66 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.49/0.66
% 0.49/0.66
% 0.49/0.66 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.49/0.66 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.49/0.66
% 0.49/0.66 RuleSystem INPUT:
% 0.49/0.66
% 0.49/0.66 Initial Rules:
% 0.49/0.66 #0: input, references = 12, size of lhs = 1:
% 0.49/0.66 P_multiply-{F}(V0,V1,V2) | product-{T}(V0,V1,V2)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #1: input, references = 5, size of lhs = 3:
% 0.49/0.66 product-{F}(V3,V1,V4), product-{F}(V5,V4,V0), product-{F}(V5,V3,V2) | product-{T}(V2,V1,V0)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #2: input, references = 4, size of lhs = 3:
% 0.49/0.66 product-{F}(V3,V4,V1), product-{F}(V5,V4,V0), product-{F}(V2,V3,V5) | product-{T}(V2,V1,V0)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #3: input, references = 8, size of lhs = 1:
% 0.49/0.66 product-{F}(V0,V1,V2) | product-{T}(V1,V0,V2)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #4: input, references = 5, size of lhs = 3:
% 0.49/0.66 product-{F}(V3,V0,V2), product-{F}(V3,V1,V2), V0 == V1 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #5: input, references = 3, size of lhs = 2:
% 0.49/0.66 divides-{F}(V2,V0), divides-{F}(V1,V2) | divides-{T}(V1,V0)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #6: input, references = 5, size of lhs = 3:
% 0.49/0.66 product-{F}(V3,V2,V0), product-{F}(V3,V2,V1), V1 == V0 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #7: input, references = 6, size of lhs = 2:
% 0.49/0.66 P_second_divided_by_1st-{F}(V0,V1,V2), divides-{F}(V0,V1) | product-{T}(V0,V2,V1)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #8: input, references = 9, size of lhs = 1:
% 0.49/0.66 product-{F}(V0,V2,V1) | divides-{T}(V0,V1)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #9: input, references = 8, size of lhs = 3:
% 0.49/0.66 prime-{F}(V0), divides-{F}(V0,V2), product-{F}(V1,V1,V2) | divides-{T}(V0,V1)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #10: input, references = 4, size of lhs = 1:
% 0.49/0.66 P_a-{F}(V0) | prime-{T}(V0)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #11: input, references = 4, size of lhs = 3:
% 0.49/0.66 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2) | product-{T}(V1,V1,V2)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #12: input, references = 4, size of lhs = 5:
% 0.49/0.66 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), P_c-{F}(V3), P_e-{F}(V4) | product-{T}(V3,V3,V4)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #13: input, references = 3, size of lhs = 6:
% 0.49/0.66 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), P_c-{F}(V3), P_e-{F}(V4), product-{F}(V0,V4,V2) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #14: input, references = 4, size of lhs = 7:
% 0.49/0.66 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), P_c-{F}(V3), P_e-{F}(V4), divides-{F}(V5,V3), divides-{F}(V5,V1) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #15: input, references = 8, size of lhs = 2:
% 0.49/0.66 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #16: input, references = 6, size of lhs = 2:
% 0.49/0.66 #-{F} V0, #-{F} V1 | EXISTS V2: P_second_divided_by_1st-{T}(V0,V1,V2)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #17: input, references = 4, size of lhs = 0:
% 0.49/0.66 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #18: input, references = 4, size of lhs = 0:
% 0.49/0.66 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #19: input, references = 5, size of lhs = 0:
% 0.49/0.66 FALSE | EXISTS V0: P_d-{T}(V0)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #20: input, references = 5, size of lhs = 0:
% 0.49/0.66 FALSE | EXISTS V0: P_c-{T}(V0)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #21: input, references = 5, size of lhs = 0:
% 0.49/0.66 FALSE | EXISTS V0: P_e-{T}(V0)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 number of initial rules = 22
% 0.49/0.66
% 0.49/0.66 Simplifiers:
% 0.49/0.66 #22: unsound, references = 3, size of lhs = 3:
% 0.49/0.66 prime-{F}(V0), prime-{F}(V1), V0 == V1 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #23: unsound, references = 3, size of lhs = 3:
% 0.49/0.66 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #24: unsound, references = 3, size of lhs = 3:
% 0.49/0.66 P_second_divided_by_1st-{F}(V0,V1,V2), P_second_divided_by_1st-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #25: unsound, references = 3, size of lhs = 3:
% 0.49/0.66 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #26: unsound, references = 3, size of lhs = 3:
% 0.49/0.66 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #27: unsound, references = 3, size of lhs = 3:
% 0.49/0.66 P_d-{F}(V0), P_d-{F}(V1), V0 == V1 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #28: unsound, references = 3, size of lhs = 3:
% 0.49/0.66 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #29: unsound, references = 3, size of lhs = 3:
% 0.49/0.66 P_e-{F}(V0), P_e-{F}(V1), V0 == V1 | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 number of simplifiers = 8
% 0.49/0.66
% 0.49/0.66 Learnt:
% 0.49/0.66 #31: exists( #21, #14 ), references = 2, size of lhs = 6:
% 0.49/0.66 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), P_c-{F}(V3), divides-{F}(V4,V3), divides-{F}(V4,V1) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #51: exists( #15, #48 ), references = 1, size of lhs = 1:
% 0.49/0.66 product-{F}(V0,V1,V2) | P_multiply-{T}(V0,V1,V2)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #68: exists( #15, #66 ), references = 3, size of lhs = 2:
% 0.49/0.66 product-{F}(V0,V0,V0), #-{F} V1 | P_multiply-{T}(V1,V0,V1)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #99: exists( #15, #97 ), references = 3, size of lhs = 3:
% 0.49/0.66 product-{F}(V0,V1,V2), product-{F}(V2,V3,V4), product-{F}(V0,V5,V4) | P_multiply-{T}(V1,V3,V5)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #139: exists( #16, #135 ), references = 3, size of lhs = 7:
% 0.49/0.66 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), P_c-{F}(V3), divides-{F}(V4,V5), product-{F}(V6,V4,V1), product-{F}(V6,V5,V1) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #176: exists( #16, #174 ), references = 1, size of lhs = 6:
% 0.49/0.66 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), P_c-{F}(V3), divides-{F}(V4,V4), divides-{F}(V4,V1) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #178: exists( #20, #175 ), references = 2, size of lhs = 5:
% 0.49/0.66 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), divides-{F}(V3,V3), divides-{F}(V3,V1) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #184: mergings( V1 == V3; #182 ), references = 1, size of lhs = 3:
% 0.49/0.66 prime-{F}(V0), P_b-{F}(V0), P_a-{F}(V1) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #187: exists( #21, #185 ), references = 1, size of lhs = 5:
% 0.49/0.66 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), P_c-{F}(V3), product-{F}(V3,V3,V4) | P_e-{T}(V4)
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #225: exists( #15, #219 ), references = 1, size of lhs = 6:
% 0.49/0.66 prime-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), product-{F}(V2,V2,V3), product-{F}(V3,V3,V0), P_d-{F}(V4) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #307: exists( #16, #305 ), references = 1, size of lhs = 5:
% 0.49/0.66 divides-{F}(V0,V0), P_a-{F}(V1), P_b-{F}(V2), P_d-{F}(V3), P_c-{F}(V4) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #312: exists( #15, #310 ), references = 1, size of lhs = 5:
% 0.49/0.66 prime-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_d-{F}(V3), P_c-{F}(V4) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #314: exists( #20, #311 ), references = 1, size of lhs = 4:
% 0.49/0.66 prime-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_d-{F}(V3) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #316: exists( #19, #313 ), references = 1, size of lhs = 3:
% 0.49/0.66 prime-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #318: exists( #18, #315 ), references = 1, size of lhs = 2:
% 0.49/0.66 prime-{F}(V0), P_a-{F}(V1) | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 #321: exists( #17, #319 ), references = 1, size of lhs = 0:
% 0.49/0.66 FALSE | FALSE
% 0.49/0.66 (used 0 times, uses = {})
% 0.49/0.66
% 0.49/0.66 number of learnt formulas = 16
% 0.49/0.66
% 0.49/0.66
% 0.49/0.66 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.49/0.66
% 0.49/0.66 randbase = 1
%------------------------------------------------------------------------------