TSTP Solution File: LCL398-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL398-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n028.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:09:13 EDT 2022
% Result : Unsatisfiable 1.32s 1.57s
% Output : Refutation 1.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.15 % Problem : LCL398-1 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.15 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.36 % Computer : n028.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Fri Jul 22 21:54:58 EDT 2022
% 0.12/0.36 % CPUTime :
% 1.32/1.57 GeoParameters:
% 1.32/1.57
% 1.32/1.57 tptp_input = 1
% 1.32/1.57 tptp_output = 0
% 1.32/1.57 nonempty = 1
% 1.32/1.57 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.32/1.57 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 1.32/1.57
% 1.32/1.57
% 1.32/1.57 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.32/1.57 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.32/1.57
% 1.32/1.57 RuleSystem INPUT:
% 1.32/1.57
% 1.32/1.57 Initial Rules:
% 1.32/1.57 #0: input, references = 18, size of lhs = 3:
% 1.32/1.57 P_implies-{F}(V1,V0,V2), is_a_theorem-{F}(V2), is_a_theorem-{F}(V1) | is_a_theorem-{T}(V0)
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #1: input, references = 14, size of lhs = 5:
% 1.32/1.57 P_implies-{F}(V0,V1,V3), P_implies-{F}(V1,V2,V4), P_implies-{F}(V0,V2,V5), P_implies-{F}(V4,V5,V6), P_implies-{F}(V3,V6,V7) | is_a_theorem-{T}(V7)
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #2: input, references = 6, size of lhs = 3:
% 1.32/1.57 P_not-{F}(V0,V1), P_implies-{F}(V1,V0,V2), P_implies-{F}(V2,V0,V3) | is_a_theorem-{T}(V3)
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #3: input, references = 9, size of lhs = 3:
% 1.32/1.57 P_not-{F}(V0,V2), P_implies-{F}(V2,V1,V3), P_implies-{F}(V0,V3,V4) | is_a_theorem-{T}(V4)
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #4: input, references = 7, size of lhs = 6:
% 1.32/1.57 P_x-{F}(V0), P_implies-{F}(V0,V0,V1), P_not-{F}(V1,V2), P_y-{F}(V3), P_implies-{F}(V2,V3,V4), is_a_theorem-{F}(V4) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #5: input, references = 24, size of lhs = 2:
% 1.32/1.57 #-{F} V0, #-{F} V1 | EXISTS V2: P_implies-{T}(V0,V1,V2)
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #6: input, references = 5, size of lhs = 1:
% 1.32/1.57 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #7: input, references = 4, size of lhs = 0:
% 1.32/1.57 FALSE | EXISTS V0: P_x-{T}(V0)
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #8: input, references = 4, size of lhs = 0:
% 1.32/1.57 FALSE | EXISTS V0: P_y-{T}(V0)
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 number of initial rules = 9
% 1.32/1.57
% 1.32/1.57 Simplifiers:
% 1.32/1.57 #9: unsound, references = 3, size of lhs = 3:
% 1.32/1.57 P_implies-{F}(V0,V1,V2), P_implies-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #10: unsound, references = 3, size of lhs = 3:
% 1.32/1.57 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #11: unsound, references = 3, size of lhs = 3:
% 1.32/1.57 P_x-{F}(V0), P_x-{F}(V1), V0 == V1 | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #12: unsound, references = 3, size of lhs = 3:
% 1.32/1.57 P_y-{F}(V0), P_y-{F}(V1), V0 == V1 | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 number of simplifiers = 4
% 1.32/1.57
% 1.32/1.57 Learnt:
% 1.32/1.57 #15: exists( #5, #13 ), references = 1, size of lhs = 8:
% 1.32/1.57 P_x-{F}(V0), P_implies-{F}(V0,V0,V1), P_not-{F}(V1,V2), P_y-{F}(V3), P_implies-{F}(V4,V5,V2), P_implies-{F}(V5,V6,V7), P_implies-{F}(V4,V6,V8), P_implies-{F}(V7,V8,V3) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #18: exists( #5, #16 ), references = 1, size of lhs = 6:
% 1.32/1.57 P_x-{F}(V0), P_implies-{F}(V0,V0,V1), P_not-{F}(V1,V2), P_y-{F}(V3), P_not-{F}(V2,V4), P_implies-{F}(V4,V5,V3) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #24: exists( #5, #22 ), references = 1, size of lhs = 10:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_not-{F}(V2,V3), P_y-{F}(V4), P_implies-{F}(V3,V4,V5), P_implies-{F}(V6,V7,V0), P_implies-{F}(V7,V8,V9), P_implies-{F}(V6,V8,V10), P_implies-{F}(V9,V10,V5) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #26: exists( #5, #23 ), references = 1, size of lhs = 8:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_not-{F}(V2,V3), P_y-{F}(V4), P_implies-{F}(V5,V6,V0), P_implies-{F}(V6,V7,V3), P_implies-{F}(V5,V7,V4) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #37: exists( #5, #35 ), references = 1, size of lhs = 8:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_not-{F}(V2,V3), P_y-{F}(V4), P_implies-{F}(V3,V4,V5), P_not-{F}(V0,V6), P_implies-{F}(V6,V7,V5) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #39: exists( #5, #36 ), references = 2, size of lhs = 6:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_not-{F}(V2,V3), P_not-{F}(V0,V3), P_y-{F}(V4) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #41: exists( #6, #38 ), references = 5, size of lhs = 4:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V0), P_y-{F}(V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #44: exists( #5, #42 ), references = 1, size of lhs = 4:
% 1.32/1.57 P_x-{F}(V0), P_y-{F}(V1), P_not-{F}(V0,V2), P_implies-{F}(V2,V3,V0) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #48: exists( #5, #45 ), references = 1, size of lhs = 6:
% 1.32/1.57 P_x-{F}(V0), P_y-{F}(V1), P_implies-{F}(V2,V3,V0), P_implies-{F}(V3,V4,V5), P_implies-{F}(V2,V4,V6), P_implies-{F}(V5,V6,V0) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #60: exists( #5, #56 ), references = 3, size of lhs = 6:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_y-{F}(V3), P_not-{F}(V0,V4), P_implies-{F}(V4,V5,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #82: exists( #5, #76 ), references = 2, size of lhs = 8:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_y-{F}(V3), P_implies-{F}(V4,V5,V0), P_implies-{F}(V5,V6,V7), P_implies-{F}(V4,V6,V8), P_implies-{F}(V7,V8,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #103: exists( #5, #101 ), references = 2, size of lhs = 10:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_y-{F}(V3), P_not-{F}(V4,V5), P_implies-{F}(V5,V4,V0), P_implies-{F}(V6,V7,V4), P_implies-{F}(V7,V8,V9), P_implies-{F}(V6,V8,V10), P_implies-{F}(V9,V10,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #131: exists( #5, #127 ), references = 2, size of lhs = 8:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_y-{F}(V3), P_not-{F}(V0,V4), P_implies-{F}(V4,V5,V6), P_not-{F}(V6,V7), P_implies-{F}(V7,V8,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #133: exists( #5, #129 ), references = 2, size of lhs = 8:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_y-{F}(V3), P_not-{F}(V0,V4), P_implies-{F}(V4,V5,V6), P_not-{F}(V6,V7), P_implies-{F}(V7,V8,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #168: exists( #5, #162 ), references = 1, size of lhs = 10:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_y-{F}(V3), P_implies-{F}(V4,V5,V0), P_implies-{F}(V5,V6,V7), P_implies-{F}(V4,V6,V8), P_implies-{F}(V7,V8,V9), P_not-{F}(V9,V10), P_implies-{F}(V10,V11,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #169: exists( #5, #163 ), references = 1, size of lhs = 12:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_y-{F}(V3), P_implies-{F}(V4,V5,V0), P_implies-{F}(V5,V6,V7), P_implies-{F}(V4,V6,V8), P_implies-{F}(V7,V8,V9), P_not-{F}(V9,V10), P_implies-{F}(V10,V11,V12), P_not-{F}(V12,V13), P_implies-{F}(V13,V14,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #170: exists( #5, #164 ), references = 1, size of lhs = 12:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_y-{F}(V3), P_implies-{F}(V4,V5,V0), P_implies-{F}(V5,V6,V7), P_implies-{F}(V4,V6,V8), P_implies-{F}(V7,V8,V9), P_not-{F}(V9,V10), P_implies-{F}(V10,V11,V12), P_not-{F}(V12,V13), P_implies-{F}(V13,V14,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #234: exists( #5, #228 ), references = 1, size of lhs = 10:
% 1.32/1.57 is_a_theorem-{F}(V0), is_a_theorem-{F}(V1), P_x-{F}(V2), P_implies-{F}(V2,V2,V3), P_implies-{F}(V1,V3,V4), P_y-{F}(V5), P_implies-{F}(V6,V7,V0), P_implies-{F}(V7,V8,V9), P_implies-{F}(V6,V8,V10), P_implies-{F}(V9,V10,V4) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #235: exists( #5, #229 ), references = 1, size of lhs = 16:
% 1.32/1.57 is_a_theorem-{F}(V0), is_a_theorem-{F}(V1), P_x-{F}(V2), P_implies-{F}(V2,V2,V3), P_y-{F}(V4), P_implies-{F}(V5,V6,V0), P_implies-{F}(V6,V7,V8), P_implies-{F}(V5,V7,V9), P_implies-{F}(V8,V9,V10), P_implies-{F}(V1,V11,V10), P_not-{F}(V12,V13), P_implies-{F}(V13,V12,V11), P_implies-{F}(V14,V15,V12), P_implies-{F}(V15,V16,V17), P_implies-{F}(V14,V16,V18), P_implies-{F}(V17,V18,V3) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #236: exists( #5, #230 ), references = 1, size of lhs = 12:
% 1.32/1.57 is_a_theorem-{F}(V0), is_a_theorem-{F}(V1), P_x-{F}(V2), P_implies-{F}(V2,V2,V3), P_not-{F}(V3,V4), P_not-{F}(V5,V4), P_implies-{F}(V1,V5,V6), P_y-{F}(V7), P_implies-{F}(V8,V9,V0), P_implies-{F}(V9,V10,V11), P_implies-{F}(V8,V10,V12), P_implies-{F}(V11,V12,V6) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #240: exists( #5, #231 ), references = 2, size of lhs = 8:
% 1.32/1.57 is_a_theorem-{F}(V0), is_a_theorem-{F}(V1), P_x-{F}(V2), P_implies-{F}(V2,V2,V3), P_y-{F}(V4), P_implies-{F}(V5,V6,V0), P_implies-{F}(V6,V7,V1), P_implies-{F}(V5,V7,V3) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #241: exists( #5, #233 ), references = 2, size of lhs = 10:
% 1.32/1.57 is_a_theorem-{F}(V0), is_a_theorem-{F}(V1), P_x-{F}(V2), P_implies-{F}(V2,V2,V3), P_not-{F}(V3,V4), P_y-{F}(V5), P_not-{F}(V6,V4), P_implies-{F}(V7,V8,V0), P_implies-{F}(V8,V9,V1), P_implies-{F}(V7,V9,V6) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #246: exists( #5, #242 ), references = 3, size of lhs = 8:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_y-{F}(V3), P_not-{F}(V4,V5), P_implies-{F}(V5,V4,V6), P_implies-{F}(V7,V6,V0), P_implies-{F}(V7,V4,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #247: exists( #5, #243 ), references = 1, size of lhs = 10:
% 1.32/1.57 is_a_theorem-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V2), P_not-{F}(V2,V3), P_y-{F}(V4), P_not-{F}(V5,V3), P_not-{F}(V6,V7), P_implies-{F}(V7,V6,V8), P_implies-{F}(V9,V8,V0), P_implies-{F}(V9,V6,V5) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #252: exists( #5, #248 ), references = 1, size of lhs = 10:
% 1.32/1.57 P_x-{F}(V0), P_implies-{F}(V0,V0,V1), P_y-{F}(V2), P_not-{F}(V3,V4), P_implies-{F}(V4,V3,V5), P_implies-{F}(V6,V3,V1), P_implies-{F}(V7,V8,V6), P_implies-{F}(V8,V9,V10), P_implies-{F}(V7,V9,V11), P_implies-{F}(V10,V11,V5) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #286: exists( #5, #281 ), references = 1, size of lhs = 8:
% 1.32/1.57 P_x-{F}(V0), P_implies-{F}(V0,V0,V1), P_y-{F}(V2), P_not-{F}(V3,V4), P_implies-{F}(V3,V5,V1), P_not-{F}(V5,V6), P_implies-{F}(V6,V5,V7), P_implies-{F}(V4,V8,V7) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #288: exists( #5, #284 ), references = 1, size of lhs = 6:
% 1.32/1.57 P_x-{F}(V0), P_implies-{F}(V0,V0,V1), P_y-{F}(V2), P_not-{F}(V3,V4), P_implies-{F}(V3,V5,V1), P_not-{F}(V5,V4) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #290: exists( #5, #287 ), references = 1, size of lhs = 3:
% 1.32/1.57 P_x-{F}(V0), P_y-{F}(V1), P_not-{F}(V0,V2) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #292: exists( #6, #289 ), references = 1, size of lhs = 2:
% 1.32/1.57 P_x-{F}(V0), P_y-{F}(V1) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #294: exists( #8, #291 ), references = 1, size of lhs = 1:
% 1.32/1.57 P_x-{F}(V0) | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 #296: exists( #7, #293 ), references = 1, size of lhs = 0:
% 1.32/1.57 FALSE | FALSE
% 1.32/1.57 (used 0 times, uses = {})
% 1.32/1.57
% 1.32/1.57 number of learnt formulas = 31
% 1.32/1.57
% 1.32/1.57
% 1.32/1.57 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.32/1.57
% 1.32/1.57 randbase = 1
%------------------------------------------------------------------------------