TSTP Solution File: CAT014-3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : CAT014-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n009.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:51 EDT 2022
% Result : Unsatisfiable 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT014-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jul 22 07:15:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.53 GeoParameters:
% 0.20/0.53
% 0.20/0.53 tptp_input = 1
% 0.20/0.53 tptp_output = 0
% 0.20/0.53 nonempty = 1
% 0.20/0.53 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53
% 0.20/0.53 RuleSystem INPUT:
% 0.20/0.53
% 0.20/0.53 Initial Rules:
% 0.20/0.53 #0: input, references = 3, size of lhs = 1:
% 0.20/0.53 equivalent-{F}(V0,V1) | there_exists-{T}(V0)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #1: input, references = 3, size of lhs = 2:
% 0.20/0.53 equivalent-{F}(V0,V1), V0 == V1 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #2: input, references = 3, size of lhs = 1:
% 0.20/0.53 there_exists-{F}(V1) | equivalent-{T}(V1,V1)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #3: input, references = 3, size of lhs = 2:
% 0.20/0.53 P_domain-{F}(V0,V1), there_exists-{F}(V1) | there_exists-{T}(V0)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #4: input, references = 4, size of lhs = 2:
% 0.20/0.53 P_codomain-{F}(V0,V1), there_exists-{F}(V1) | there_exists-{T}(V0)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #5: input, references = 3, size of lhs = 3:
% 0.20/0.53 P_domain-{F}(V0,V1), P_compose-{F}(V0,V2,V3), there_exists-{F}(V3) | there_exists-{T}(V1)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #6: input, references = 5, size of lhs = 5:
% 0.20/0.53 P_compose-{F}(V0,V1,V2), P_domain-{F}(V0,V3), P_codomain-{F}(V1,V4), there_exists-{F}(V2), V3 == V4 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #7: input, references = 3, size of lhs = 4:
% 0.20/0.53 P_domain-{F}(V0,V3), there_exists-{F}(V3), P_codomain-{F}(V2,V3), P_compose-{F}(V0,V2,V4) | there_exists-{T}(V4)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #8: input, references = 5, size of lhs = 5:
% 0.20/0.53 P_compose-{F}(V1,V2,V3), P_compose-{F}(V0,V3,V4), P_compose-{F}(V0,V1,V5), P_compose-{F}(V5,V2,V6), V4 == V6 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #9: input, references = 5, size of lhs = 3:
% 0.20/0.53 P_domain-{F}(V0,V1), P_compose-{F}(V0,V1,V2), V2 == V0 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #10: input, references = 4, size of lhs = 3:
% 0.20/0.53 P_codomain-{F}(V0,V1), P_compose-{F}(V1,V0,V2), V2 == V0 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #11: input, references = 3, size of lhs = 1:
% 0.20/0.53 equivalent-{F}(V1,V0) | there_exists-{T}(V0)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #12: input, references = 3, size of lhs = 1:
% 0.20/0.53 there_exists-{F}(V0) | equivalent-{T}(V0,V0)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #13: input, references = 3, size of lhs = 3:
% 0.20/0.53 P_codomain-{F}(V0,V1), P_compose-{F}(V0,V2,V3), there_exists-{F}(V3) | there_exists-{T}(V1)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #14: input, references = 4, size of lhs = 2:
% 0.20/0.53 P_f1-{F}(V0,V1,V2), V0 == V1 | there_exists-{T}(V2)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #15: input, references = 4, size of lhs = 4:
% 0.20/0.53 P_f1-{F}(V0,V1,V2), V0 == V2, V1 == V2, V0 == V1 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #16: input, references = 5, size of lhs = 2:
% 0.20/0.53 P_a-{F}(V0), P_codomain-{F}(V0,V1) | there_exists-{T}(V1)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #17: input, references = 4, size of lhs = 3:
% 0.20/0.53 P_a-{F}(V0), P_codomain-{F}(V0,V1), P_codomain-{F}(V1,V1) | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #18: input, references = 4, size of lhs = 1:
% 0.20/0.53 #-{F} V0 | EXISTS V1: P_domain-{T}(V0,V1)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #19: input, references = 7, size of lhs = 1:
% 0.20/0.53 #-{F} V0 | EXISTS V1: P_codomain-{T}(V0,V1)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #20: input, references = 7, size of lhs = 2:
% 0.20/0.53 #-{F} V0, #-{F} V1 | EXISTS V2: P_compose-{T}(V0,V1,V2)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #21: input, references = 4, size of lhs = 2:
% 0.20/0.53 #-{F} V0, #-{F} V1 | EXISTS V2: P_f1-{T}(V0,V1,V2)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #22: input, references = 4, size of lhs = 0:
% 0.20/0.53 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 number of initial rules = 23
% 0.20/0.53
% 0.20/0.53 Simplifiers:
% 0.20/0.53 #23: unsound, references = 3, size of lhs = 2:
% 0.20/0.53 equivalent-{F}(V0,V1), V1 == V0 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #24: unsound, references = 3, size of lhs = 3:
% 0.20/0.53 P_domain-{F}(V0,V1), P_domain-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #25: unsound, references = 3, size of lhs = 3:
% 0.20/0.53 P_codomain-{F}(V0,V1), P_codomain-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #26: unsound, references = 3, size of lhs = 3:
% 0.20/0.53 P_compose-{F}(V0,V1,V2), P_compose-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #27: unsound, references = 3, size of lhs = 3:
% 0.20/0.53 P_f1-{F}(V0,V1,V2), P_f1-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #28: unsound, references = 3, size of lhs = 3:
% 0.20/0.53 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 number of simplifiers = 6
% 0.20/0.53
% 0.20/0.53 Learnt:
% 0.20/0.53 #30: exists( #20, #10 ), references = 2, size of lhs = 1:
% 0.20/0.53 P_codomain-{F}(V0,V1) | P_compose-{T}(V1,V0,V0)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #33: exists( #19, #31 ), references = 1, size of lhs = 3:
% 0.20/0.53 P_codomain-{F}(V0,V1), V0 == V1, P_domain-{F}(V1,V0) | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #35: exists( #21, #15 ), references = 1, size of lhs = 3:
% 0.20/0.53 #-{F} V0, #-{F} V1, V0 == V1 | P_f1-{T}(V0,V1,V0), P_f1-{T}(V0,V1,V1)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #40: exists( #20, #9 ), references = 2, size of lhs = 1:
% 0.20/0.53 P_domain-{F}(V0,V1) | P_compose-{T}(V0,V1,V0)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #42: exists( #19, #6 ), references = 2, size of lhs = 3:
% 0.20/0.53 there_exists-{F}(V0), P_compose-{F}(V1,V2,V0), P_domain-{F}(V1,V3) | P_codomain-{T}(V2,V3)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #53: exists( #20, #8 ), references = 1, size of lhs = 3:
% 0.20/0.53 P_compose-{F}(V0,V1,V2), P_compose-{F}(V3,V0,V4), P_compose-{F}(V4,V1,V5) | P_compose-{T}(V3,V2,V5)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #58: exists( #20, #8 ), references = 1, size of lhs = 3:
% 0.20/0.53 P_compose-{F}(V0,V1,V2), P_compose-{F}(V3,V2,V4), P_compose-{F}(V3,V0,V5) | P_compose-{T}(V5,V1,V4)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #67: exists( #18, #6 ), references = 2, size of lhs = 3:
% 0.20/0.53 there_exists-{F}(V0), P_compose-{F}(V1,V2,V0), P_codomain-{F}(V2,V3) | P_domain-{T}(V1,V3)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #77: exists( #19, #75 ), references = 2, size of lhs = 2:
% 0.20/0.53 there_exists-{F}(V0), P_a-{F}(V0) | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #80: disj( #34, #14+#76 ), references = 1, size of lhs = 3:
% 0.20/0.53 P_a-{F}(V0), #-{F} V1, V1 == V0 | P_f1-{T}(V1,V0,V1)
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #88: exists( #19, #84 ), references = 1, size of lhs = 1:
% 0.20/0.53 P_a-{F}(V0) | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 #90: exists( #22, #86 ), references = 1, size of lhs = 0:
% 0.20/0.53 FALSE | FALSE
% 0.20/0.53 (used 0 times, uses = {})
% 0.20/0.53
% 0.20/0.53 number of learnt formulas = 12
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53
% 0.20/0.53 randbase = 1
%------------------------------------------------------------------------------