TSTP Solution File: SET912+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n013.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:56 EDT 2022
% Result : Theorem 2.97s 3.20s
% Output : Refutation 2.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n013.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 : Sat Jul 23 01:46:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.97/3.20 GeoParameters:
% 2.97/3.20
% 2.97/3.20 tptp_input = 1
% 2.97/3.20 tptp_output = 0
% 2.97/3.20 nonempty = 1
% 2.97/3.20 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.97/3.20 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 2.97/3.20
% 2.97/3.20
% 2.97/3.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.97/3.20 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.97/3.20
% 2.97/3.20 RuleSystem INPUT:
% 2.97/3.20
% 2.97/3.20 Initial Rules:
% 2.97/3.20 #0: input, references = 4, size of lhs = 2:
% 2.97/3.20 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #1: input, references = 4, size of lhs = 3:
% 2.97/3.20 P_unordered_pair-{F}(V0,V1,V2), P_unordered_pair-{F}(V1,V0,V3), V2 == V3 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #2: input, references = 4, size of lhs = 3:
% 2.97/3.20 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #3: input, references = 4, size of lhs = 2:
% 2.97/3.20 P_set_intersection2-{F}(V0,V0,V1), V1 == V0 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #4: input, references = 3, size of lhs = 0:
% 2.97/3.20 FALSE | EXISTS V0: pppp1-{T}(V0)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #5: input, references = 3, size of lhs = 1:
% 2.97/3.20 pppp1-{F}(V0) | empty-{T}(V0)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #6: input, references = 3, size of lhs = 0:
% 2.97/3.20 FALSE | EXISTS V0: pppp2-{T}(V0)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #7: input, references = 3, size of lhs = 2:
% 2.97/3.20 pppp2-{F}(V0), empty-{F}(V0) | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #8: input, references = 4, size of lhs = 1:
% 2.97/3.20 #-{F} V0 | subset-{T}(V0,V0)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #9: input, references = 6, size of lhs = 3:
% 2.97/3.20 P_set_intersection2-{F}(V0,V1,V2), subset-{F}(V0,V1), V2 == V0 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #10: input, references = 4, size of lhs = 2:
% 2.97/3.20 P_unordered_pair-{F}(V0,V1,V3), subset-{F}(V3,V2) | pppp0-{T}(V0,V1,V2)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #11: input, references = 7, size of lhs = 2:
% 2.97/3.20 P_unordered_pair-{F}(V0,V1,V3), pppp0-{F}(V0,V1,V2) | subset-{T}(V3,V2)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #12: input, references = 3, size of lhs = 1:
% 2.97/3.20 pppp0-{F}(V0,V1,V2) | in-{T}(V0,V2)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #13: input, references = 4, size of lhs = 1:
% 2.97/3.20 pppp0-{F}(V0,V1,V2) | in-{T}(V1,V2)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #14: input, references = 6, size of lhs = 2:
% 2.97/3.20 in-{F}(V0,V2), in-{F}(V1,V2) | pppp0-{T}(V0,V1,V2)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #15: input, references = 4, size of lhs = 0:
% 2.97/3.20 FALSE | EXISTS V0: pppp5-{T}(V0)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #16: input, references = 4, size of lhs = 1:
% 2.97/3.20 pppp5-{F}(V0) | EXISTS V1: pppp4-{T}(V0,V1)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #17: input, references = 4, size of lhs = 1:
% 2.97/3.20 pppp4-{F}(V0,V1) | EXISTS V2: pppp3-{T}(V2,V0,V1)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #18: input, references = 4, size of lhs = 1:
% 2.97/3.20 pppp4-{F}(V0,V1) | in-{T}(V1,V0)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #19: input, references = 5, size of lhs = 3:
% 2.97/3.20 pppp3-{F}(V0,V1,V2), P_unordered_pair-{F}(V0,V2,V3), P_set_intersection2-{F}(V3,V1,V3) | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #20: input, references = 6, size of lhs = 3:
% 2.97/3.20 pppp3-{F}(V0,V1,V2), P_unordered_pair-{F}(V0,V2,V3), P_set_intersection2-{F}(V3,V1,V4) | in-{T}(V0,V1)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #21: input, references = 8, size of lhs = 2:
% 2.97/3.20 #-{F} V0, #-{F} V1 | EXISTS V2: P_unordered_pair-{T}(V0,V1,V2)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #22: input, references = 7, size of lhs = 2:
% 2.97/3.20 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 number of initial rules = 23
% 2.97/3.20
% 2.97/3.20 Simplifiers:
% 2.97/3.20 #23: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 empty-{F}(V0), empty-{F}(V1), V0 == V1 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #24: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 P_unordered_pair-{F}(V0,V1,V2), P_unordered_pair-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #25: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #26: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 pppp1-{F}(V0), pppp1-{F}(V1), V0 == V1 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #27: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 pppp2-{F}(V0), pppp2-{F}(V1), V0 == V1 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #28: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 pppp3-{F}(V0,V1,V2), pppp3-{F}(V3,V1,V2), V0 == V3 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #29: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 pppp3-{F}(V0,V1,V2), pppp3-{F}(V3,V1,V5), V2 == V5 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #30: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 pppp3-{F}(V0,V1,V2), pppp3-{F}(V3,V4,V5), V1 == V4 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #31: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 pppp4-{F}(V0,V1), pppp4-{F}(V0,V3), V1 == V3 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #32: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 pppp4-{F}(V0,V1), pppp4-{F}(V2,V3), V0 == V2 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #33: unsound, references = 3, size of lhs = 3:
% 2.97/3.20 pppp5-{F}(V0), pppp5-{F}(V1), V0 == V1 | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 number of simplifiers = 11
% 2.97/3.20
% 2.97/3.20 Learnt:
% 2.97/3.20 #36: exists( #22, #3 ), references = 1, size of lhs = 1:
% 2.97/3.20 #-{F} V0 | P_set_intersection2-{T}(V0,V0,V0)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #37: exists( #22, #9 ), references = 3, size of lhs = 1:
% 2.97/3.20 subset-{F}(V0,V1) | P_set_intersection2-{T}(V0,V1,V0)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #43: exists( #21, #1 ), references = 3, size of lhs = 1:
% 2.97/3.20 P_unordered_pair-{F}(V0,V1,V2) | P_unordered_pair-{T}(V1,V0,V2)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #54: exists( #22, #2 ), references = 5, size of lhs = 1:
% 2.97/3.20 P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #77: exists( #21, #75 ), references = 1, size of lhs = 2:
% 2.97/3.20 pppp0-{F}(V0,V1,V2), pppp3-{F}(V0,V2,V1) | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #137: exists( #22, #135 ), references = 1, size of lhs = 3:
% 2.97/3.20 in-{F}(V0,V1), pppp3-{F}(V1,V0,V2), P_unordered_pair-{F}(V1,V2,V3) | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #139: exists( #21, #136 ), references = 1, size of lhs = 2:
% 2.97/3.20 in-{F}(V0,V1), pppp3-{F}(V1,V0,V2) | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #194: exists( #21, #192 ), references = 1, size of lhs = 3:
% 2.97/3.20 in-{F}(V0,V1), P_unordered_pair-{F}(V0,V0,V1), pppp3-{F}(V2,V1,V0) | P_unordered_pair-{T}(V0,V2,V1)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #296: exists( #22, #294 ), references = 1, size of lhs = 4:
% 2.97/3.20 in-{F}(V0,V1), pppp3-{F}(V2,V1,V3), P_unordered_pair-{F}(V2,V3,V4), P_unordered_pair-{F}(V0,V2,V4) | P_set_intersection2-{T}(V1,V4,V4)
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #301: exists( #21, #299 ), references = 1, size of lhs = 2:
% 2.97/3.20 in-{F}(V0,V1), pppp3-{F}(V2,V1,V0) | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #303: exists( #17, #300 ), references = 1, size of lhs = 2:
% 2.97/3.20 pppp4-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #306: exists( #16, #304 ), references = 1, size of lhs = 1:
% 2.97/3.20 pppp5-{F}(V0) | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 #308: exists( #15, #305 ), references = 1, size of lhs = 0:
% 2.97/3.20 FALSE | FALSE
% 2.97/3.20 (used 0 times, uses = {})
% 2.97/3.20
% 2.97/3.20 number of learnt formulas = 13
% 2.97/3.20
% 2.97/3.20
% 2.97/3.20 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.97/3.20
% 2.97/3.20 randbase = 1
%------------------------------------------------------------------------------