TSTP Solution File: SEU119+2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SEU119+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n011.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:17:13 EDT 2022
% Result : Theorem 2.06s 2.27s
% Output : Refutation 2.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU119+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n011.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 : Fri Jul 22 19:34:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.06/2.27 GeoParameters:
% 2.06/2.27
% 2.06/2.27 tptp_input = 1
% 2.06/2.27 tptp_output = 0
% 2.06/2.27 nonempty = 1
% 2.06/2.27 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.06/2.27 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 2.06/2.27
% 2.06/2.27
% 2.06/2.27 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.06/2.27 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.06/2.27
% 2.06/2.27 RuleSystem INPUT:
% 2.06/2.27
% 2.06/2.27 Initial Rules:
% 2.06/2.27 #0: input, references = 3, size of lhs = 2:
% 2.06/2.27 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #1: input, references = 4, size of lhs = 3:
% 2.06/2.27 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #2: input, references = 4, size of lhs = 1:
% 2.06/2.27 P_empty_set-{F}(V0) | pppp0-{T}(V0)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #3: input, references = 3, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), pppp0-{F}(V1), V1 == V0 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #4: input, references = 7, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), pppp0-{F}(V1), in-{F}(V2,V1) | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #5: input, references = 4, size of lhs = 2:
% 2.06/2.27 P_empty_set-{F}(V0), #-{F} V1 | pppp0-{T}(V1), pppp10-{T}(V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #6: input, references = 5, size of lhs = 1:
% 2.06/2.27 pppp10-{F}(V0) | EXISTS V1: pppp3-{T}(V0,V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #7: input, references = 5, size of lhs = 1:
% 2.06/2.27 pppp3-{F}(V0,V1) | in-{T}(V1,V0)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #8: input, references = 7, size of lhs = 2:
% 2.06/2.27 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4) | pppp2-{T}(V1,V2,V4)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #9: input, references = 3, size of lhs = 4:
% 2.06/2.27 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4), pppp2-{F}(V1,V2,V3), V3 == V4 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #10: input, references = 5, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), pppp2-{F}(V1,V2,V3), in-{F}(V4,V3) | pppp1-{T}(V1,V2,V4)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #11: input, references = 4, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), pppp2-{F}(V1,V2,V3), pppp1-{F}(V1,V2,V4) | in-{T}(V4,V3)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #12: input, references = 4, size of lhs = 4:
% 2.06/2.27 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, #-{F} V3 | pppp2-{T}(V1,V2,V3), pppp11-{T}(V1,V2,V3)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #13: input, references = 3, size of lhs = 1:
% 2.06/2.27 pppp11-{F}(V0,V1,V2) | EXISTS V3: pppp4-{T}(V0,V1,V2,V3)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #14: input, references = 3, size of lhs = 3:
% 2.06/2.27 pppp4-{F}(V0,V1,V2,V3), pppp1-{F}(V0,V1,V3), in-{F}(V3,V2) | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #15: input, references = 7, size of lhs = 1:
% 2.06/2.27 pppp4-{F}(V0,V1,V2,V3) | in-{T}(V3,V2), pppp1-{T}(V0,V1,V3)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #16: input, references = 6, size of lhs = 2:
% 2.06/2.27 P_empty_set-{F}(V0), pppp1-{F}(V1,V2,V3) | in-{T}(V3,V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #17: input, references = 4, size of lhs = 2:
% 2.06/2.27 P_empty_set-{F}(V0), pppp1-{F}(V1,V2,V3) | in-{T}(V3,V2)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #18: input, references = 4, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), in-{F}(V3,V1), in-{F}(V3,V2) | pppp1-{T}(V1,V2,V3)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #19: input, references = 4, size of lhs = 4:
% 2.06/2.27 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), disjoint-{F}(V1,V2), V3 == V0 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #20: input, references = 5, size of lhs = 2:
% 2.06/2.27 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V0) | disjoint-{T}(V1,V2)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #21: input, references = 3, size of lhs = 1:
% 2.06/2.27 P_empty_set-{F}(V0) | empty-{T}(V0)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #22: input, references = 4, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V1,V2), V2 == V1 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #23: input, references = 3, size of lhs = 1:
% 2.06/2.27 P_empty_set-{F}(V0) | EXISTS V1: pppp5-{T}(V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #24: input, references = 3, size of lhs = 1:
% 2.06/2.27 pppp5-{F}(V0) | empty-{T}(V0)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #25: input, references = 3, size of lhs = 1:
% 2.06/2.27 P_empty_set-{F}(V0) | EXISTS V1: pppp6-{T}(V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #26: input, references = 3, size of lhs = 2:
% 2.06/2.27 pppp6-{F}(V0), empty-{F}(V0) | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #27: input, references = 3, size of lhs = 2:
% 2.06/2.27 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | disjoint-{T}(V2,V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #28: input, references = 4, size of lhs = 1:
% 2.06/2.27 P_empty_set-{F}(V0) | EXISTS V1: pppp9-{T}(V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #29: input, references = 4, size of lhs = 1:
% 2.06/2.27 pppp9-{F}(V0) | EXISTS V1: pppp8-{T}(V0,V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #30: input, references = 4, size of lhs = 3:
% 2.06/2.27 pppp8-{F}(V0,V1), in-{F}(V2,V0), in-{F}(V2,V1) | disjoint-{T}(V0,V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #31: input, references = 3, size of lhs = 3:
% 2.06/2.27 pppp8-{F}(V0,V1), in-{F}(V2,V0), in-{F}(V2,V1) | EXISTS V3: pppp7-{T}(V0,V1,V3)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #32: input, references = 5, size of lhs = 2:
% 2.06/2.27 pppp8-{F}(V0,V1), disjoint-{F}(V0,V1) | EXISTS V2: pppp7-{T}(V0,V1,V2)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #33: input, references = 5, size of lhs = 1:
% 2.06/2.27 pppp7-{F}(V0,V1,V2) | in-{T}(V2,V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #34: input, references = 4, size of lhs = 1:
% 2.06/2.27 pppp7-{F}(V0,V1,V2) | in-{T}(V2,V0)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #35: input, references = 7, size of lhs = 2:
% 2.06/2.27 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #36: input, references = 4, size of lhs = 0:
% 2.06/2.27 FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 number of initial rules = 37
% 2.06/2.27
% 2.06/2.27 Simplifiers:
% 2.06/2.27 #37: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #38: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #39: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp3-{F}(V0,V1), pppp3-{F}(V0,V3), V1 == V3 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #40: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp4-{F}(V0,V1,V2,V3), pppp4-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #41: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp5-{F}(V0), pppp5-{F}(V1), V0 == V1 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #42: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp6-{F}(V0), pppp6-{F}(V1), V0 == V1 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #43: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp7-{F}(V0,V1,V2), pppp7-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #44: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp7-{F}(V0,V1,V2), pppp7-{F}(V0,V4,V5), V1 == V4 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #45: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp7-{F}(V0,V1,V2), pppp7-{F}(V3,V4,V5), V0 == V3 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #46: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp8-{F}(V0,V1), pppp8-{F}(V0,V3), V1 == V3 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #47: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp8-{F}(V0,V1), pppp8-{F}(V2,V3), V0 == V2 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #48: unsound, references = 3, size of lhs = 3:
% 2.06/2.27 pppp9-{F}(V0), pppp9-{F}(V1), V0 == V1 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 number of simplifiers = 12
% 2.06/2.27
% 2.06/2.27 Learnt:
% 2.06/2.27 #50: exists( #35, #22 ), references = 1, size of lhs = 2:
% 2.06/2.27 P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V1,V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #53: mergings( V0 == V2; #51 ), references = 3, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), #-{F} V1, V1 == V0 | pppp10-{T}(V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #56: exists( #35, #1 ), references = 3, size of lhs = 1:
% 2.06/2.27 P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #59: mergings( V0 == V4; #57 ), references = 1, size of lhs = 4:
% 2.06/2.27 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), #-{F} V4, V4 == V3 | pppp11-{T}(V1,V2,V4)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #61: disj( #15, input ), references = 1, size of lhs = 1:
% 2.06/2.27 pppp4-{F}(V0,V1,V2,V2) | pppp1-{T}(V0,V1,V2)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #78: mergings( V4 == V5; #76 ), references = 1, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), pppp0-{F}(V1), pppp4-{F}(V1,V2,V3,V4) | in-{T}(V4,V3)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #87: mergings( V2 == V3, V3 == V4; #84 ), references = 2, size of lhs = 4:
% 2.06/2.27 pppp10-{F}(V0), P_empty_set-{F}(V1), pppp0-{F}(V2), pppp2-{F}(V2,V3,V0) | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #128: mergings( V3 == V4, V4 == V5; #125 ), references = 1, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), pppp0-{F}(V1), #-{F} V2 | P_set_intersection2-{T}(V1,V2,V0)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #154: exists( #32, #152 ), references = 1, size of lhs = 4:
% 2.06/2.27 P_empty_set-{F}(V0), pppp0-{F}(V1), pppp8-{F}(V2,V1), disjoint-{F}(V2,V1) | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #176: disj( #15, input ), references = 1, size of lhs = 2:
% 2.06/2.27 in-{F}(V0,V1), pppp4-{F}(V2,V3,V0,V1) | pppp1-{T}(V2,V3,V1)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #218: mergings( V2 == V3, V3 == V4, V4 == V5; #214 ), references = 2, size of lhs = 6:
% 2.06/2.27 pppp10-{F}(V0), P_empty_set-{F}(V1), pppp8-{F}(V2,V3), pppp2-{F}(V2,V3,V0), P_set_intersection2-{F}(V2,V3,V4), V4 == V1 | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #282: disj( #15, input ), references = 1, size of lhs = 3:
% 2.06/2.27 P_empty_set-{F}(V0), pppp0-{F}(V1), pppp4-{F}(V2,V3,V1,V4) | pppp1-{T}(V2,V3,V4)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #389: mergings( V3 == V4, V4 == V5; #386 ), references = 3, size of lhs = 5:
% 2.06/2.27 P_empty_set-{F}(V0), pppp0-{F}(V1), pppp8-{F}(V2,V3), disjoint-{F}(V2,V3), pppp2-{F}(V3,V2,V1) | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #398: mergings( V3 == V4, V4 == V5; #395 ), references = 1, size of lhs = 2:
% 2.06/2.27 P_empty_set-{F}(V0), pppp8-{F}(V1,V2) | P_set_intersection2-{T}(V1,V2,V0)
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #414: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #407 ), references = 1, size of lhs = 3:
% 2.06/2.27 pppp9-{F}(V0), pppp0-{F}(V1), P_empty_set-{F}(V1) | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #423: mergings( V0 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #415 ), references = 1, size of lhs = 2:
% 2.06/2.27 pppp0-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 #426: exists( #36, #424 ), references = 1, size of lhs = 0:
% 2.06/2.27 FALSE | FALSE
% 2.06/2.27 (used 0 times, uses = {})
% 2.06/2.27
% 2.06/2.27 number of learnt formulas = 17
% 2.06/2.27
% 2.06/2.27
% 2.06/2.27 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.06/2.27
% 2.06/2.27 randbase = 1
%------------------------------------------------------------------------------