TSTP Solution File: CAT003-3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : CAT003-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n017.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:47 EDT 2022
% Result : Unsatisfiable 0.47s 0.71s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CAT003-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jul 22 06:41:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.47/0.71 GeoParameters:
% 0.47/0.71
% 0.47/0.71 tptp_input = 1
% 0.47/0.71 tptp_output = 0
% 0.47/0.71 nonempty = 1
% 0.47/0.71 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.71 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.71 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.71
% 0.47/0.71 RuleSystem INPUT:
% 0.47/0.71
% 0.47/0.71 Initial Rules:
% 0.47/0.71 #0: input, references = 3, size of lhs = 1:
% 0.47/0.71 equivalent-{F}(V0,V1) | there_exists-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #1: input, references = 3, size of lhs = 2:
% 0.47/0.71 equivalent-{F}(V0,V1), V0 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #2: input, references = 3, size of lhs = 1:
% 0.47/0.71 there_exists-{F}(V1) | equivalent-{T}(V1,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #3: input, references = 3, size of lhs = 2:
% 0.47/0.71 P_domain-{F}(V0,V1), there_exists-{F}(V1) | there_exists-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #4: input, references = 3, size of lhs = 2:
% 0.47/0.71 P_codomain-{F}(V0,V1), there_exists-{F}(V1) | there_exists-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #5: input, references = 3, size of lhs = 3:
% 0.47/0.71 P_domain-{F}(V0,V1), P_compose-{F}(V0,V2,V3), there_exists-{F}(V3) | there_exists-{T}(V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #6: input, references = 6, size of lhs = 5:
% 0.47/0.71 P_compose-{F}(V0,V1,V2), P_domain-{F}(V0,V3), P_codomain-{F}(V1,V4), there_exists-{F}(V2), V3 == V4 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #7: input, references = 3, size of lhs = 4:
% 0.47/0.71 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.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #8: input, references = 5, size of lhs = 5:
% 0.47/0.71 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.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #9: input, references = 4, size of lhs = 3:
% 0.47/0.71 P_domain-{F}(V0,V1), P_compose-{F}(V0,V1,V2), V2 == V0 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #10: input, references = 4, size of lhs = 3:
% 0.47/0.71 P_codomain-{F}(V0,V1), P_compose-{F}(V1,V0,V2), V2 == V0 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #11: input, references = 3, size of lhs = 1:
% 0.47/0.71 equivalent-{F}(V1,V0) | there_exists-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #12: input, references = 3, size of lhs = 1:
% 0.47/0.71 there_exists-{F}(V0) | equivalent-{T}(V0,V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #13: input, references = 3, size of lhs = 3:
% 0.47/0.71 P_codomain-{F}(V0,V1), P_compose-{F}(V0,V2,V3), there_exists-{F}(V3) | there_exists-{T}(V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #14: input, references = 3, size of lhs = 2:
% 0.47/0.71 P_f1-{F}(V0,V1,V2), V0 == V1 | there_exists-{T}(V2)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #15: input, references = 4, size of lhs = 4:
% 0.47/0.71 P_f1-{F}(V0,V1,V2), V0 == V2, V1 == V2, V0 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #16: input, references = 4, size of lhs = 3:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V0,V1,V2) | there_exists-{T}(V2)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #17: input, references = 6, size of lhs = 6:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V0,V1,V2), P_compose-{F}(V4,V2,V3), P_compose-{F}(V6,V2,V3), V6 == V4 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #18: input, references = 3, size of lhs = 4:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V0,V1,V2), P_h-{F}(V3) | there_exists-{T}(V3)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #19: input, references = 4, size of lhs = 8:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V0,V1,V2), P_h-{F}(V3), P_compose-{F}(V3,V0,V4), P_g-{F}(V5), P_compose-{F}(V5,V0,V6), V4 == V6 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #20: input, references = 4, size of lhs = 7:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V0,V1,V2), P_h-{F}(V3), P_compose-{F}(V3,V0,V4), P_g-{F}(V3), P_compose-{F}(V3,V0,V6) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #21: input, references = 4, size of lhs = 1:
% 0.47/0.71 #-{F} V0 | EXISTS V1: P_domain-{T}(V0,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #22: input, references = 5, size of lhs = 1:
% 0.47/0.71 #-{F} V0 | EXISTS V1: P_codomain-{T}(V0,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #23: input, references = 17, size of lhs = 2:
% 0.47/0.71 #-{F} V0, #-{F} V1 | EXISTS V2: P_compose-{T}(V0,V1,V2)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #24: input, references = 4, size of lhs = 2:
% 0.47/0.71 #-{F} V0, #-{F} V1 | EXISTS V2: P_f1-{T}(V0,V1,V2)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #25: input, references = 4, size of lhs = 0:
% 0.47/0.71 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #26: input, references = 4, size of lhs = 0:
% 0.47/0.71 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #27: input, references = 4, size of lhs = 0:
% 0.47/0.71 FALSE | EXISTS V0: P_h-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #28: input, references = 4, size of lhs = 0:
% 0.47/0.71 FALSE | EXISTS V0: P_g-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 number of initial rules = 29
% 0.47/0.71
% 0.47/0.71 Simplifiers:
% 0.47/0.71 #29: unsound, references = 3, size of lhs = 2:
% 0.47/0.71 equivalent-{F}(V0,V1), V1 == V0 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #30: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_domain-{F}(V0,V1), P_domain-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #31: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_codomain-{F}(V0,V1), P_codomain-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #32: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_compose-{F}(V0,V1,V2), P_compose-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #33: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_f1-{F}(V0,V1,V2), P_f1-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #34: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #35: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #36: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_h-{F}(V0), P_h-{F}(V1), V0 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #37: unsound, references = 3, size of lhs = 3:
% 0.47/0.71 P_g-{F}(V0), P_g-{F}(V1), V0 == V1 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 number of simplifiers = 9
% 0.47/0.71
% 0.47/0.71 Learnt:
% 0.47/0.71 #41: exists( #24, #15 ), references = 1, size of lhs = 3:
% 0.47/0.71 #-{F} V0, #-{F} V1, V0 == V1 | P_f1-{T}(V0,V1,V0), P_f1-{T}(V0,V1,V1)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #43: exists( #23, #10 ), references = 2, size of lhs = 1:
% 0.47/0.71 P_codomain-{F}(V0,V1) | P_compose-{T}(V1,V0,V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #46: exists( #23, #9 ), references = 1, size of lhs = 1:
% 0.47/0.71 P_domain-{F}(V0,V1) | P_compose-{T}(V0,V1,V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #49: exists( #21, #6 ), references = 1, size of lhs = 3:
% 0.47/0.71 there_exists-{F}(V0), P_compose-{F}(V1,V2,V0), P_codomain-{F}(V2,V3) | P_domain-{T}(V1,V3)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #54: exists( #22, #6 ), references = 1, size of lhs = 3:
% 0.47/0.71 there_exists-{F}(V0), P_compose-{F}(V1,V2,V0), P_domain-{F}(V1,V3) | P_codomain-{T}(V2,V3)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #57: exists( #23, #19 ), references = 2, size of lhs = 7:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_h-{F}(V2), P_compose-{F}(V2,V0,V3), P_g-{F}(V4), P_compose-{F}(V4,V0,V5), V3 == V5 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #65: exists( #23, #8 ), references = 2, size of lhs = 3:
% 0.47/0.71 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.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #69: exists( #23, #67 ), references = 1, size of lhs = 7:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V2,V1,V3), P_compose-{F}(V4,V2,V0), P_domain-{F}(V4,V5), P_codomain-{F}(V3,V6), V5 == V6 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #71: exists( #22, #68 ), references = 2, size of lhs = 5:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V2,V1,V3), P_compose-{F}(V4,V2,V0), P_domain-{F}(V4,V5) | P_codomain-{T}(V3,V5)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #75: exists( #23, #8 ), references = 6, size of lhs = 3:
% 0.47/0.71 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.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #79: exists( #23, #57 ), references = 2, size of lhs = 5:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_h-{F}(V2), P_compose-{F}(V2,V0,V3), P_g-{F}(V4) | P_compose-{T}(V4,V0,V3)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #89: mergings( V3 == V1, V1 == V6, V4 == V9; #85 ), references = 1, size of lhs = 10:
% 0.47/0.71 P_h-{F}(V0), P_g-{F}(V1), P_a-{F}(V2), P_compose-{F}(V3,V2,V2), P_domain-{F}(V3,V4), P_b-{F}(V5), P_compose-{F}(V6,V0,V1), V4 == V6, P_compose-{F}(V7,V5,V2), P_compose-{F}(V0,V7,V2) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #102: exists( #23, #100 ), references = 1, size of lhs = 5:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V2,V0,V0), P_compose-{F}(V3,V0,V0), V2 == V3 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #110: exists( #23, #108 ), references = 1, size of lhs = 8:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V0,V1,V2), P_compose-{F}(V3,V4,V2), P_compose-{F}(V5,V4,V2), P_compose-{F}(V6,V3,V7), P_compose-{F}(V8,V5,V7), V8 == V6 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #112: exists( #23, #109 ), references = 1, size of lhs = 5:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V2,V0,V3), P_compose-{F}(V4,V0,V3), V4 == V2 | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #116: mergings( V3 == V5; #114 ), references = 1, size of lhs = 5:
% 0.47/0.71 P_h-{F}(V0), P_g-{F}(V1), V0 == V1, P_a-{F}(V2), P_b-{F}(V3) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #119: mergings( V1 == V4; #117 ), references = 1, size of lhs = 3:
% 0.47/0.71 P_h-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | P_g-{T}(V0)
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #121: exists( #23, #20 ), references = 2, size of lhs = 5:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_compose-{F}(V0,V1,V2), P_h-{F}(V3), P_g-{F}(V3) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #125: exists( #23, #121 ), references = 1, size of lhs = 4:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1), P_h-{F}(V2), P_g-{F}(V2) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #131: mergings( V2 == V4, V1 == V3, V3 == V5; #127 ), references = 1, size of lhs = 2:
% 0.47/0.71 P_a-{F}(V0), P_b-{F}(V1) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #134: mergings( V1 == V2; #132 ), references = 1, size of lhs = 1:
% 0.47/0.71 P_a-{F}(V0) | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 #136: exists( #25, #132 ), references = 1, size of lhs = 0:
% 0.47/0.71 FALSE | FALSE
% 0.47/0.71 (used 0 times, uses = {})
% 0.47/0.71
% 0.47/0.71 number of learnt formulas = 22
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.71
% 0.47/0.71 randbase = 1
%------------------------------------------------------------------------------