TSTP Solution File: SET877+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SET877+1 : TPTP v8.1.0. Released v3.2.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 06:16:53 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET877+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/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 : Sat Jul 23 02:26:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.52 GeoParameters:
% 0.20/0.52
% 0.20/0.52 tptp_input = 1
% 0.20/0.52 tptp_output = 0
% 0.20/0.52 nonempty = 1
% 0.20/0.52 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52
% 0.20/0.52 RuleSystem INPUT:
% 0.20/0.52
% 0.20/0.52 Initial Rules:
% 0.20/0.52 #0: input, references = 4, size of lhs = 2:
% 0.20/0.52 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #1: input, references = 4, size of lhs = 3:
% 0.20/0.52 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #2: input, references = 4, size of lhs = 1:
% 0.20/0.52 P_singleton-{F}(V0,V2) | pppp0-{T}(V0,V2)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #3: input, references = 3, size of lhs = 3:
% 0.20/0.52 P_singleton-{F}(V0,V2), pppp0-{F}(V0,V1), V1 == V2 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #4: input, references = 5, size of lhs = 3:
% 0.20/0.52 pppp0-{F}(V0,V1), in-{F}(V2,V1), V2 == V0 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #5: input, references = 4, size of lhs = 1:
% 0.20/0.52 pppp0-{F}(V0,V1) | in-{T}(V0,V1)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #6: input, references = 6, size of lhs = 2:
% 0.20/0.52 #-{F} V0, #-{F} V1 | pppp0-{T}(V0,V1), pppp6-{T}(V0,V1)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #7: input, references = 4, size of lhs = 1:
% 0.20/0.52 pppp6-{F}(V0,V1) | EXISTS V2: pppp1-{T}(V0,V1,V2)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #8: input, references = 3, size of lhs = 2:
% 0.20/0.52 pppp1-{F}(V0,V1,V0), in-{F}(V0,V1) | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #9: input, references = 4, size of lhs = 2:
% 0.20/0.52 pppp1-{F}(V0,V1,V2), V2 == V0 | in-{T}(V2,V1)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #10: input, references = 4, size of lhs = 2:
% 0.20/0.52 P_set_intersection2-{F}(V0,V0,V1), V1 == V0 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #11: input, references = 4, size of lhs = 2:
% 0.20/0.52 P_singleton-{F}(V1,V2), P_set_intersection2-{F}(V0,V2,V2) | in-{T}(V1,V0)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #12: input, references = 3, size of lhs = 0:
% 0.20/0.52 FALSE | EXISTS V0: pppp2-{T}(V0)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #13: input, references = 3, size of lhs = 1:
% 0.20/0.52 pppp2-{F}(V0) | empty-{T}(V0)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #14: input, references = 3, size of lhs = 0:
% 0.20/0.52 FALSE | EXISTS V0: pppp3-{T}(V0)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #15: input, references = 3, size of lhs = 2:
% 0.20/0.52 pppp3-{F}(V0), empty-{F}(V0) | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #16: input, references = 4, size of lhs = 0:
% 0.20/0.52 FALSE | EXISTS V0: pppp5-{T}(V0)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #17: input, references = 4, size of lhs = 1:
% 0.20/0.52 pppp5-{F}(V0) | EXISTS V1: pppp4-{T}(V0,V1)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #18: input, references = 4, size of lhs = 4:
% 0.20/0.52 pppp4-{F}(V1,V1), P_singleton-{F}(V1,V2), P_singleton-{F}(V1,V3), P_set_intersection2-{F}(V2,V3,V4) | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #19: input, references = 4, size of lhs = 5:
% 0.20/0.52 pppp4-{F}(V0,V1), P_singleton-{F}(V0,V2), P_singleton-{F}(V1,V3), P_set_intersection2-{F}(V2,V3,V4), V4 == V2 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #20: input, references = 6, size of lhs = 2:
% 0.20/0.52 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #21: input, references = 5, size of lhs = 1:
% 0.20/0.52 #-{F} V0 | EXISTS V1: P_singleton-{T}(V0,V1)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 number of initial rules = 22
% 0.20/0.52
% 0.20/0.52 Simplifiers:
% 0.20/0.52 #22: unsound, references = 3, size of lhs = 3:
% 0.20/0.52 empty-{F}(V0), empty-{F}(V1), V0 == V1 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #23: unsound, references = 3, size of lhs = 3:
% 0.20/0.52 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #24: unsound, references = 3, size of lhs = 3:
% 0.20/0.52 P_singleton-{F}(V0,V1), P_singleton-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #25: unsound, references = 3, size of lhs = 3:
% 0.20/0.52 pppp1-{F}(V0,V1,V2), pppp1-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #26: unsound, references = 3, size of lhs = 3:
% 0.20/0.52 pppp2-{F}(V0), pppp2-{F}(V1), V0 == V1 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #27: unsound, references = 3, size of lhs = 3:
% 0.20/0.52 pppp3-{F}(V0), pppp3-{F}(V1), V0 == V1 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #28: unsound, references = 3, size of lhs = 3:
% 0.20/0.52 pppp4-{F}(V0,V1), pppp4-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #29: unsound, references = 3, size of lhs = 3:
% 0.20/0.52 pppp4-{F}(V0,V1), pppp4-{F}(V2,V3), V0 == V2 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #30: unsound, references = 3, size of lhs = 3:
% 0.20/0.52 pppp5-{F}(V0), pppp5-{F}(V1), V0 == V1 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 number of simplifiers = 9
% 0.20/0.52
% 0.20/0.52 Learnt:
% 0.20/0.52 #33: disj( #6, #5+#0 ), references = 1, size of lhs = 1:
% 0.20/0.52 #-{F} V0 | pppp6-{T}(V0,V0)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #35: exists( #20, #10 ), references = 2, size of lhs = 1:
% 0.20/0.52 #-{F} V0 | P_set_intersection2-{T}(V0,V0,V0)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #38: disj( #6, input ), references = 1, size of lhs = 3:
% 0.20/0.52 P_singleton-{F}(V0,V1), #-{F} V2, V2 == V1 | pppp6-{T}(V0,V2)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #45: exists( #7, #43 ), references = 1, size of lhs = 2:
% 0.20/0.52 pppp6-{F}(V0,V1), pppp0-{F}(V2,V1) | pppp1-{T}(V0,V1,V0), pppp1-{T}(V0,V1,V2)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #49: exists( #20, #1 ), references = 2, size of lhs = 1:
% 0.20/0.52 P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #52: disj( #6, input ), references = 1, size of lhs = 3:
% 0.20/0.52 in-{F}(V0,V1), #-{F} V2, V0 == V2 | pppp6-{T}(V2,V1)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #81: exists( #20, #79 ), references = 2, size of lhs = 3:
% 0.20/0.52 pppp4-{F}(V0,V1), P_singleton-{F}(V0,V2), P_singleton-{F}(V1,V3) | P_set_intersection2-{T}(V3,V2,V2)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #99: exists( #21, #97 ), references = 1, size of lhs = 4:
% 0.20/0.52 pppp4-{F}(V0,V1), P_singleton-{F}(V0,V2), P_singleton-{F}(V3,V2), V3 == V1 | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #101: exists( #17, #98 ), references = 1, size of lhs = 3:
% 0.20/0.52 pppp5-{F}(V0), P_singleton-{F}(V0,V1), P_singleton-{F}(V2,V1) | pppp4-{T}(V0,V2)
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #105: exists( #21, #103 ), references = 1, size of lhs = 1:
% 0.20/0.52 pppp5-{F}(V0) | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 #107: exists( #16, #104 ), references = 1, size of lhs = 0:
% 0.20/0.52 FALSE | FALSE
% 0.20/0.52 (used 0 times, uses = {})
% 0.20/0.52
% 0.20/0.52 number of learnt formulas = 11
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52
% 0.20/0.52 randbase = 1
%------------------------------------------------------------------------------