TSTP Solution File: SEU120+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n005.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:14 EDT 2022
% Result : Theorem 0.18s 0.39s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n005.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:16:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.39 GeoParameters:
% 0.18/0.39
% 0.18/0.39 tptp_input = 1
% 0.18/0.39 tptp_output = 0
% 0.18/0.39 nonempty = 1
% 0.18/0.39 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.39 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.39 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.39
% 0.18/0.39 RuleSystem INPUT:
% 0.18/0.39
% 0.18/0.39 Initial Rules:
% 0.18/0.39 #0: input, references = 3, size of lhs = 2:
% 0.18/0.39 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #1: input, references = 4, size of lhs = 3:
% 0.18/0.39 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #2: input, references = 4, size of lhs = 1:
% 0.18/0.39 P_empty_set-{F}(V0) | pppp0-{T}(V0)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #3: input, references = 3, size of lhs = 3:
% 0.18/0.39 P_empty_set-{F}(V0), pppp0-{F}(V1), V1 == V0 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #4: input, references = 4, size of lhs = 3:
% 0.18/0.39 P_empty_set-{F}(V0), pppp0-{F}(V1), in-{F}(V2,V1) | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #5: input, references = 4, size of lhs = 2:
% 0.18/0.39 P_empty_set-{F}(V0), #-{F} V1 | pppp0-{T}(V1), pppp7-{T}(V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #6: input, references = 4, size of lhs = 1:
% 0.18/0.39 pppp7-{F}(V0) | EXISTS V1: pppp1-{T}(V0,V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #7: input, references = 4, size of lhs = 1:
% 0.18/0.39 pppp1-{F}(V0,V1) | in-{T}(V1,V0)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #8: input, references = 4, size of lhs = 4:
% 0.18/0.39 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), disjoint-{F}(V1,V2), V3 == V0 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #9: input, references = 5, size of lhs = 2:
% 0.18/0.39 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V0) | disjoint-{T}(V1,V2)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #10: input, references = 3, size of lhs = 1:
% 0.18/0.39 P_empty_set-{F}(V0) | empty-{T}(V0)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #11: input, references = 4, size of lhs = 3:
% 0.18/0.39 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #12: input, references = 3, size of lhs = 1:
% 0.18/0.39 P_empty_set-{F}(V0) | EXISTS V1: pppp2-{T}(V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #13: input, references = 3, size of lhs = 1:
% 0.18/0.39 pppp2-{F}(V0) | empty-{T}(V0)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #14: input, references = 3, size of lhs = 1:
% 0.18/0.39 P_empty_set-{F}(V0) | EXISTS V1: pppp3-{T}(V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #15: input, references = 3, size of lhs = 2:
% 0.18/0.39 pppp3-{F}(V0), empty-{F}(V0) | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #16: input, references = 3, size of lhs = 2:
% 0.18/0.39 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | disjoint-{T}(V2,V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #17: input, references = 4, size of lhs = 1:
% 0.18/0.39 P_empty_set-{F}(V0) | EXISTS V1: pppp6-{T}(V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #18: input, references = 4, size of lhs = 1:
% 0.18/0.39 pppp6-{F}(V0) | EXISTS V1: pppp5-{T}(V0,V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #19: input, references = 4, size of lhs = 3:
% 0.18/0.39 pppp5-{F}(V0,V1), P_set_intersection2-{F}(V0,V1,V2), in-{F}(V3,V2) | disjoint-{T}(V0,V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #20: input, references = 3, size of lhs = 3:
% 0.18/0.39 pppp5-{F}(V0,V1), P_set_intersection2-{F}(V0,V1,V2), in-{F}(V3,V2) | EXISTS V4: pppp4-{T}(V2,V4)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #21: input, references = 4, size of lhs = 3:
% 0.18/0.39 pppp5-{F}(V0,V1), P_set_intersection2-{F}(V0,V1,V2), disjoint-{F}(V0,V1) | EXISTS V3: pppp4-{T}(V2,V3)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #22: input, references = 4, size of lhs = 1:
% 0.18/0.39 pppp4-{F}(V0,V1) | in-{T}(V1,V0)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #23: input, references = 6, size of lhs = 2:
% 0.18/0.39 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #24: input, references = 4, size of lhs = 0:
% 0.18/0.39 FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 number of initial rules = 25
% 0.18/0.39
% 0.18/0.39 Simplifiers:
% 0.18/0.39 #25: unsound, references = 3, size of lhs = 3:
% 0.18/0.39 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #26: unsound, references = 3, size of lhs = 3:
% 0.18/0.39 P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #27: unsound, references = 3, size of lhs = 3:
% 0.18/0.39 pppp1-{F}(V0,V1), pppp1-{F}(V0,V3), V1 == V3 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #28: unsound, references = 3, size of lhs = 3:
% 0.18/0.39 pppp2-{F}(V0), pppp2-{F}(V1), V0 == V1 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #29: unsound, references = 3, size of lhs = 3:
% 0.18/0.39 pppp3-{F}(V0), pppp3-{F}(V1), V0 == V1 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #30: unsound, references = 3, size of lhs = 3:
% 0.18/0.39 pppp4-{F}(V0,V1), pppp4-{F}(V0,V3), V1 == V3 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #31: unsound, references = 3, size of lhs = 3:
% 0.18/0.39 pppp5-{F}(V0,V1), pppp5-{F}(V0,V3), V1 == V3 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #32: unsound, references = 3, size of lhs = 3:
% 0.18/0.39 pppp5-{F}(V0,V1), pppp5-{F}(V2,V3), V0 == V2 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #33: unsound, references = 3, size of lhs = 3:
% 0.18/0.39 pppp6-{F}(V0), pppp6-{F}(V1), V0 == V1 | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 number of simplifiers = 9
% 0.18/0.39
% 0.18/0.39 Learnt:
% 0.18/0.39 #35: exists( #23, #11 ), references = 1, size of lhs = 2:
% 0.18/0.39 P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V1,V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #38: mergings( V0 == V2; #36 ), references = 2, size of lhs = 3:
% 0.18/0.39 P_empty_set-{F}(V0), #-{F} V1, V1 == V0 | pppp7-{T}(V1)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #41: exists( #23, #1 ), references = 1, size of lhs = 1:
% 0.18/0.39 P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #47: exists( #21, #44 ), references = 3, size of lhs = 5:
% 0.18/0.39 P_empty_set-{F}(V0), pppp0-{F}(V1), pppp5-{F}(V2,V3), P_set_intersection2-{F}(V2,V3,V1), disjoint-{F}(V2,V3) | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #53: mergings( V0 == V5; #51 ), references = 1, size of lhs = 5:
% 0.18/0.39 pppp7-{F}(V0), P_empty_set-{F}(V1), V0 == V1, pppp5-{F}(V2,V3), P_set_intersection2-{F}(V2,V3,V0) | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #57: mergings( V3 == V4; #55 ), references = 1, size of lhs = 2:
% 0.18/0.39 P_empty_set-{F}(V0), pppp5-{F}(V1,V2) | P_set_intersection2-{T}(V1,V2,V0)
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #66: mergings( V2 == V3, V3 == V4, V4 == V5; #62 ), references = 1, size of lhs = 3:
% 0.18/0.39 pppp6-{F}(V0), pppp0-{F}(V1), P_empty_set-{F}(V1) | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #72: mergings( V0 == V2, V2 == V3, V3 == V4, V4 == V5; #67 ), references = 1, size of lhs = 2:
% 0.18/0.39 pppp0-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 #75: exists( #24, #73 ), references = 1, size of lhs = 0:
% 0.18/0.39 FALSE | FALSE
% 0.18/0.39 (used 0 times, uses = {})
% 0.18/0.39
% 0.18/0.39 number of learnt formulas = 9
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.39
% 0.18/0.39 randbase = 1
%------------------------------------------------------------------------------