TSTP Solution File: LCL212-3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL212-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n008.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:08:58 EDT 2022
% Result : Unsatisfiable 0.72s 0.89s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL212-3 : TPTP v8.1.0. Released v2.3.0.
% 0.04/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Jul 22 22:34:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.72/0.89 GeoParameters:
% 0.72/0.89
% 0.72/0.89 tptp_input = 1
% 0.72/0.89 tptp_output = 0
% 0.72/0.89 nonempty = 1
% 0.72/0.89 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.72/0.89 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.72/0.89
% 0.72/0.89
% 0.72/0.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.72/0.89 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.72/0.89
% 0.72/0.89 RuleSystem INPUT:
% 0.72/0.89
% 0.72/0.89 Initial Rules:
% 0.72/0.89 #0: input, references = 3, size of lhs = 2:
% 0.72/0.89 P_or-{F}(V0,V0,V1), P_implies-{F}(V1,V0,V2) | axiom-{T}(V2)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #1: input, references = 6, size of lhs = 2:
% 0.72/0.89 P_or-{F}(V1,V0,V2), P_implies-{F}(V0,V2,V3) | axiom-{T}(V3)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #2: input, references = 6, size of lhs = 3:
% 0.72/0.89 P_or-{F}(V0,V1,V2), P_or-{F}(V1,V0,V3), P_implies-{F}(V2,V3,V4) | axiom-{T}(V4)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #3: input, references = 4, size of lhs = 5:
% 0.72/0.89 P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_or-{F}(V0,V2,V5), P_or-{F}(V1,V5,V6), P_implies-{F}(V4,V6,V7) | axiom-{T}(V7)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #4: input, references = 5, size of lhs = 5:
% 0.72/0.89 P_implies-{F}(V0,V1,V3), P_or-{F}(V2,V0,V4), P_or-{F}(V2,V1,V5), P_implies-{F}(V4,V5,V6), P_implies-{F}(V3,V6,V7) | axiom-{T}(V7)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #5: input, references = 5, size of lhs = 4:
% 0.72/0.89 P_implies-{F}(V0,V1,V2), P_not-{F}(V0,V3), P_or-{F}(V3,V1,V4), V2 == V4 | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #6: input, references = 12, size of lhs = 1:
% 0.72/0.89 axiom-{F}(V0) | theorem-{T}(V0)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #7: input, references = 4, size of lhs = 3:
% 0.72/0.89 theorem-{F}(V0), P_implies-{F}(V0,V1,V2), theorem-{F}(V2) | theorem-{T}(V1)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #8: input, references = 8, size of lhs = 8:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_implies-{F}(V0,V2,V3), P_implies-{F}(V3,V2,V4), P_implies-{F}(V2,V4,V5), P_implies-{F}(V1,V5,V6), theorem-{F}(V6) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #9: input, references = 20, size of lhs = 2:
% 0.72/0.89 #-{F} V0, #-{F} V1 | EXISTS V2: P_implies-{T}(V0,V1,V2)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #10: input, references = 5, size of lhs = 2:
% 0.72/0.89 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #11: input, references = 10, size of lhs = 1:
% 0.72/0.89 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #12: input, references = 4, size of lhs = 0:
% 0.72/0.89 FALSE | EXISTS V0: P_p-{T}(V0)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #13: input, references = 4, size of lhs = 0:
% 0.72/0.89 FALSE | EXISTS V0: P_q-{T}(V0)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 number of initial rules = 14
% 0.72/0.89
% 0.72/0.89 Simplifiers:
% 0.72/0.89 #14: unsound, references = 3, size of lhs = 3:
% 0.72/0.89 P_implies-{F}(V0,V1,V2), P_implies-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #15: unsound, references = 3, size of lhs = 3:
% 0.72/0.89 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #16: unsound, references = 3, size of lhs = 3:
% 0.72/0.89 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #17: unsound, references = 3, size of lhs = 3:
% 0.72/0.89 P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #18: unsound, references = 3, size of lhs = 3:
% 0.72/0.89 P_q-{F}(V0), P_q-{F}(V1), V0 == V1 | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 number of simplifiers = 5
% 0.72/0.89
% 0.72/0.89 Learnt:
% 0.72/0.89 #20: exists( #9, #5 ), references = 12, size of lhs = 2:
% 0.72/0.89 P_not-{F}(V0,V1), P_or-{F}(V1,V2,V3) | P_implies-{T}(V0,V2,V3)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #24: exists( #10, #5 ), references = 14, size of lhs = 2:
% 0.72/0.89 P_not-{F}(V0,V1), P_implies-{F}(V0,V2,V3) | P_or-{T}(V1,V2,V3)
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #34: exists( #9, #32 ), references = 1, size of lhs = 9:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_implies-{F}(V0,V4,V5), P_implies-{F}(V5,V4,V6), P_implies-{F}(V4,V6,V7), P_or-{F}(V8,V1,V7) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #47: exists( #9, #45 ), references = 1, size of lhs = 10:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_implies-{F}(V0,V4,V5), P_implies-{F}(V5,V4,V6), P_implies-{F}(V4,V6,V7), P_or-{F}(V8,V9,V1), P_or-{F}(V9,V8,V7) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #56: exists( #9, #54 ), references = 2, size of lhs = 12:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_implies-{F}(V0,V3,V4), P_implies-{F}(V4,V3,V5), P_implies-{F}(V3,V5,V6), P_not-{F}(V7,V2), P_implies-{F}(V8,V9,V7), P_or-{F}(V10,V8,V11), P_or-{F}(V10,V9,V12), P_implies-{F}(V11,V12,V6) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #65: exists( #9, #63 ), references = 1, size of lhs = 10:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_implies-{F}(V0,V3,V4), P_implies-{F}(V4,V3,V5), P_implies-{F}(V3,V5,V6), P_not-{F}(V7,V2), P_or-{F}(V8,V9,V7), P_or-{F}(V9,V8,V6) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #79: exists( #9, #77 ), references = 1, size of lhs = 11:
% 0.72/0.89 theorem-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V1), P_p-{F}(V3), P_not-{F}(V3,V4), P_q-{F}(V5), P_implies-{F}(V3,V5,V6), P_implies-{F}(V6,V5,V7), P_implies-{F}(V5,V7,V8), P_implies-{F}(V4,V8,V9), P_or-{F}(V10,V0,V9) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #81: exists( #10, #78 ), references = 1, size of lhs = 11:
% 0.72/0.89 theorem-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V1), P_p-{F}(V3), P_not-{F}(V3,V4), P_q-{F}(V5), P_implies-{F}(V3,V5,V6), P_implies-{F}(V6,V5,V7), P_implies-{F}(V5,V7,V8), P_implies-{F}(V4,V8,V9), P_or-{F}(V10,V0,V9) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #85: exists( #9, #83 ), references = 1, size of lhs = 11:
% 0.72/0.89 theorem-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V1), P_p-{F}(V3), P_not-{F}(V3,V4), P_not-{F}(V4,V5), P_not-{F}(V6,V5), P_q-{F}(V7), P_implies-{F}(V3,V7,V8), P_implies-{F}(V8,V7,V9), P_implies-{F}(V7,V9,V0) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #87: exists( #11, #84 ), references = 4, size of lhs = 9:
% 0.72/0.89 theorem-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_not-{F}(V4,V3), P_q-{F}(V5), P_implies-{F}(V1,V5,V6), P_implies-{F}(V6,V5,V7), P_implies-{F}(V5,V7,V0) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #93: exists( #9, #91 ), references = 1, size of lhs = 11:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_not-{F}(V4,V5), P_implies-{F}(V0,V4,V6), P_implies-{F}(V6,V4,V7), P_not-{F}(V8,V5), P_or-{F}(V9,V10,V8), P_or-{F}(V10,V9,V7) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #96: exists( #9, #94 ), references = 1, size of lhs = 10:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_not-{F}(V4,V5), P_implies-{F}(V0,V4,V6), P_not-{F}(V6,V7), P_or-{F}(V4,V7,V8), P_not-{F}(V8,V5) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #109: exists( #9, #107 ), references = 1, size of lhs = 13:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_not-{F}(V4,V5), P_implies-{F}(V0,V4,V6), P_implies-{F}(V6,V4,V7), P_not-{F}(V8,V5), P_or-{F}(V9,V10,V8), P_or-{F}(V11,V12,V10), P_or-{F}(V9,V12,V13), P_or-{F}(V11,V13,V7) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #119: exists( #9, #117 ), references = 2, size of lhs = 12:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_not-{F}(V3,V4), P_implies-{F}(V0,V3,V5), P_implies-{F}(V5,V3,V6), P_not-{F}(V7,V4), P_not-{F}(V8,V2), P_implies-{F}(V9,V10,V8), P_or-{F}(V11,V9,V7), P_or-{F}(V11,V10,V6) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #131: exists( #9, #129 ), references = 1, size of lhs = 13:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_not-{F}(V4,V5), P_not-{F}(V6,V5), P_implies-{F}(V0,V4,V7), P_implies-{F}(V7,V4,V8), P_implies-{F}(V9,V10,V4), P_or-{F}(V11,V9,V12), P_or-{F}(V11,V10,V13), P_implies-{F}(V12,V13,V8) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #133: exists( #9, #130 ), references = 2, size of lhs = 11:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_not-{F}(V4,V5), P_not-{F}(V6,V5), P_implies-{F}(V0,V4,V7), P_implies-{F}(V8,V9,V4), P_or-{F}(V10,V8,V7), P_or-{F}(V10,V9,V4) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #138: mergings( V4 == V5; #136 ), references = 1, size of lhs = 10:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V1), P_not-{F}(V1,V3), P_not-{F}(V4,V3), P_q-{F}(V5), P_not-{F}(V5,V6), P_not-{F}(V7,V6), P_implies-{F}(V5,V8,V5), P_or-{F}(V1,V8,V5) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #143: exists( #11, #119 ), references = 1, size of lhs = 10:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_not-{F}(V2,V3), P_implies-{F}(V0,V2,V4), P_implies-{F}(V4,V2,V5), P_not-{F}(V6,V3), P_implies-{F}(V7,V8,V1), P_or-{F}(V9,V7,V6), P_or-{F}(V9,V8,V5) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #145: exists( #11, #133 ), references = 1, size of lhs = 9:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_not-{F}(V2,V3), P_not-{F}(V4,V3), P_implies-{F}(V0,V2,V5), P_implies-{F}(V6,V7,V2), P_or-{F}(V8,V6,V5), P_or-{F}(V8,V7,V2) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #161: exists( #9, #159 ), references = 1, size of lhs = 8:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_implies-{F}(V0,V4,V5), P_implies-{F}(V5,V4,V6), P_or-{F}(V7,V4,V6) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #164: exists( #9, #162 ), references = 2, size of lhs = 7:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_implies-{F}(V0,V4,V5), P_not-{F}(V5,V6) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #166: exists( #11, #163 ), references = 1, size of lhs = 4:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_implies-{F}(V0,V2,V1) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #168: exists( #11, #164 ), references = 1, size of lhs = 6:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_implies-{F}(V0,V4,V5) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #170: exists( #11, #167 ), references = 1, size of lhs = 4:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_implies-{F}(V0,V2,V3) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #172: exists( #9, #169 ), references = 1, size of lhs = 3:
% 0.72/0.89 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #174: exists( #11, #171 ), references = 1, size of lhs = 2:
% 0.72/0.89 P_p-{F}(V0), P_q-{F}(V1) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #176: exists( #13, #173 ), references = 1, size of lhs = 1:
% 0.72/0.89 P_p-{F}(V0) | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 #178: exists( #12, #175 ), references = 1, size of lhs = 0:
% 0.72/0.89 FALSE | FALSE
% 0.72/0.89 (used 0 times, uses = {})
% 0.72/0.89
% 0.72/0.89 number of learnt formulas = 28
% 0.72/0.89
% 0.72/0.89
% 0.72/0.89 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.72/0.89
% 0.72/0.89 randbase = 1
%------------------------------------------------------------------------------