TSTP Solution File: SET917+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SET917+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n023.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:57 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET917+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n023.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 02:28:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 GeoParameters:
% 0.12/0.35
% 0.12/0.35 tptp_input = 1
% 0.12/0.35 tptp_output = 0
% 0.12/0.35 nonempty = 1
% 0.12/0.35 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.12/0.35
% 0.12/0.35
% 0.12/0.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35
% 0.12/0.35 RuleSystem INPUT:
% 0.12/0.35
% 0.12/0.35 Initial Rules:
% 0.12/0.35 #0: input, references = 3, size of lhs = 2:
% 0.12/0.35 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #1: input, references = 4, size of lhs = 3:
% 0.12/0.35 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #2: input, references = 4, size of lhs = 2:
% 0.12/0.35 P_set_intersection2-{F}(V0,V0,V1), V1 == V0 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #3: input, references = 4, size of lhs = 2:
% 0.12/0.35 #-{F} V1, P_singleton-{F}(V0,V2) | in-{T}(V0,V1), disjoint-{T}(V2,V1)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #4: input, references = 3, size of lhs = 4:
% 0.12/0.35 P_singleton-{F}(V0,V2), P_set_intersection2-{F}(V1,V2,V3), in-{F}(V0,V1), V3 == V2 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #5: input, references = 3, size of lhs = 0:
% 0.12/0.35 FALSE | EXISTS V0: pppp0-{T}(V0)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #6: input, references = 3, size of lhs = 1:
% 0.12/0.35 pppp0-{F}(V0) | empty-{T}(V0)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #7: input, references = 3, size of lhs = 0:
% 0.12/0.35 FALSE | EXISTS V0: pppp1-{T}(V0)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #8: input, references = 3, size of lhs = 2:
% 0.12/0.35 pppp1-{F}(V0), empty-{F}(V0) | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #9: input, references = 3, size of lhs = 1:
% 0.12/0.35 disjoint-{F}(V0,V1) | disjoint-{T}(V1,V0)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #10: input, references = 4, size of lhs = 0:
% 0.12/0.35 FALSE | EXISTS V0: pppp3-{T}(V0)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #11: input, references = 4, size of lhs = 1:
% 0.12/0.35 pppp3-{F}(V0) | EXISTS V1: pppp2-{T}(V0,V1)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #12: input, references = 4, size of lhs = 3:
% 0.12/0.35 pppp2-{F}(V0,V1), P_singleton-{F}(V0,V2), P_set_intersection2-{F}(V2,V1,V2) | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #13: input, references = 4, size of lhs = 4:
% 0.12/0.35 pppp2-{F}(V0,V1), P_singleton-{F}(V0,V2), P_set_intersection2-{F}(V2,V1,V3), disjoint-{F}(V2,V1) | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #14: input, references = 6, size of lhs = 2:
% 0.12/0.35 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #15: input, references = 4, size of lhs = 1:
% 0.12/0.35 #-{F} V0 | EXISTS V1: P_singleton-{T}(V0,V1)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 number of initial rules = 16
% 0.12/0.35
% 0.12/0.35 Simplifiers:
% 0.12/0.35 #16: unsound, references = 3, size of lhs = 3:
% 0.12/0.35 empty-{F}(V0), empty-{F}(V1), V0 == V1 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #17: unsound, references = 3, size of lhs = 3:
% 0.12/0.35 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #18: unsound, references = 3, size of lhs = 3:
% 0.12/0.35 P_singleton-{F}(V0,V1), P_singleton-{F}(V0,V3), V1 == V3 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #19: unsound, references = 3, size of lhs = 3:
% 0.12/0.35 pppp0-{F}(V0), pppp0-{F}(V1), V0 == V1 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #20: unsound, references = 3, size of lhs = 3:
% 0.12/0.35 pppp1-{F}(V0), pppp1-{F}(V1), V0 == V1 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #21: unsound, references = 3, size of lhs = 3:
% 0.12/0.35 pppp2-{F}(V0,V1), pppp2-{F}(V0,V3), V1 == V3 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #22: unsound, references = 3, size of lhs = 3:
% 0.12/0.35 pppp2-{F}(V0,V1), pppp2-{F}(V2,V3), V0 == V2 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #23: unsound, references = 3, size of lhs = 3:
% 0.12/0.35 pppp3-{F}(V0), pppp3-{F}(V1), V0 == V1 | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 number of simplifiers = 8
% 0.12/0.35
% 0.12/0.35 Learnt:
% 0.12/0.35 #25: exists( #14, #2 ), references = 1, size of lhs = 1:
% 0.12/0.35 #-{F} V0 | P_set_intersection2-{T}(V0,V0,V0)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #28: mergings( V2 == V3; #26 ), references = 1, size of lhs = 3:
% 0.12/0.35 P_singleton-{F}(V0,V1), P_set_intersection2-{F}(V2,V1,V3), V3 == V1 | disjoint-{T}(V1,V2)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #32: mergings( V4 == V1; #30 ), references = 2, size of lhs = 4:
% 0.12/0.35 P_singleton-{F}(V0,V1), P_singleton-{F}(V2,V1), pppp2-{F}(V2,V3), P_set_intersection2-{F}(V1,V3,V4) | P_set_intersection2-{T}(V3,V1,V1)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #36: exists( #14, #34 ), references = 1, size of lhs = 3:
% 0.12/0.35 P_singleton-{F}(V0,V1), P_singleton-{F}(V2,V1), pppp2-{F}(V2,V3) | P_set_intersection2-{T}(V1,V3,V1)
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #39: exists( #11, #37 ), references = 1, size of lhs = 3:
% 0.12/0.35 pppp3-{F}(V0), P_singleton-{F}(V0,V1), P_singleton-{F}(V2,V1) | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #41: exists( #15, #38 ), references = 1, size of lhs = 1:
% 0.12/0.35 pppp3-{F}(V0) | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 #43: exists( #10, #40 ), references = 1, size of lhs = 0:
% 0.12/0.35 FALSE | FALSE
% 0.12/0.35 (used 0 times, uses = {})
% 0.12/0.35
% 0.12/0.35 number of learnt formulas = 7
% 0.12/0.35
% 0.12/0.35
% 0.12/0.35 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35
% 0.12/0.35 randbase = 1
%------------------------------------------------------------------------------