TSTP Solution File: LCL190-3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL190-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n024.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:56 EDT 2022
% Result : Unsatisfiable 0.78s 0.99s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL190-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n024.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 22:16:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.78/0.99 GeoParameters:
% 0.78/0.99
% 0.78/0.99 tptp_input = 1
% 0.78/0.99 tptp_output = 0
% 0.78/0.99 nonempty = 1
% 0.78/0.99 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.99 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.78/0.99
% 0.78/0.99
% 0.78/0.99 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.99 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.99
% 0.78/0.99 RuleSystem INPUT:
% 0.78/0.99
% 0.78/0.99 Initial Rules:
% 0.78/0.99 #0: input, references = 4, size of lhs = 2:
% 0.78/0.99 P_or-{F}(V0,V0,V1), P_implies-{F}(V1,V0,V2) | axiom-{T}(V2)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #1: input, references = 4, size of lhs = 2:
% 0.78/0.99 P_or-{F}(V1,V0,V2), P_implies-{F}(V0,V2,V3) | axiom-{T}(V3)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #2: input, references = 5, size of lhs = 3:
% 0.78/0.99 P_or-{F}(V0,V1,V2), P_or-{F}(V1,V0,V3), P_implies-{F}(V2,V3,V4) | axiom-{T}(V4)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #3: input, references = 4, size of lhs = 5:
% 0.78/0.99 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.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #4: input, references = 5, size of lhs = 5:
% 0.78/0.99 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.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #5: input, references = 5, size of lhs = 4:
% 0.78/0.99 P_implies-{F}(V0,V1,V2), P_not-{F}(V0,V3), P_or-{F}(V3,V1,V4), V2 == V4 | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #6: input, references = 10, size of lhs = 1:
% 0.78/0.99 axiom-{F}(V0) | theorem-{T}(V0)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #7: input, references = 4, size of lhs = 3:
% 0.78/0.99 theorem-{F}(V0), P_implies-{F}(V0,V1,V2), theorem-{F}(V2) | theorem-{T}(V1)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #8: input, references = 8, size of lhs = 9:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_or-{F}(V2,V1,V5), P_or-{F}(V0,V5,V6), P_implies-{F}(V4,V6,V7), theorem-{F}(V7) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #9: input, references = 20, size of lhs = 2:
% 0.78/0.99 #-{F} V0, #-{F} V1 | EXISTS V2: P_implies-{T}(V0,V1,V2)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #10: input, references = 11, size of lhs = 2:
% 0.78/0.99 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #11: input, references = 5, size of lhs = 1:
% 0.78/0.99 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #12: input, references = 4, size of lhs = 0:
% 0.78/0.99 FALSE | EXISTS V0: P_p-{T}(V0)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #13: input, references = 4, size of lhs = 0:
% 0.78/0.99 FALSE | EXISTS V0: P_q-{T}(V0)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #14: input, references = 4, size of lhs = 0:
% 0.78/0.99 FALSE | EXISTS V0: P_r-{T}(V0)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 number of initial rules = 15
% 0.78/0.99
% 0.78/0.99 Simplifiers:
% 0.78/0.99 #15: unsound, references = 3, size of lhs = 3:
% 0.78/0.99 P_implies-{F}(V0,V1,V2), P_implies-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #16: unsound, references = 3, size of lhs = 3:
% 0.78/0.99 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #17: unsound, references = 3, size of lhs = 3:
% 0.78/0.99 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #18: unsound, references = 3, size of lhs = 3:
% 0.78/0.99 P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #19: unsound, references = 3, size of lhs = 3:
% 0.78/0.99 P_q-{F}(V0), P_q-{F}(V1), V0 == V1 | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #20: unsound, references = 3, size of lhs = 3:
% 0.78/0.99 P_r-{F}(V0), P_r-{F}(V1), V0 == V1 | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 number of simplifiers = 6
% 0.78/0.99
% 0.78/0.99 Learnt:
% 0.78/0.99 #22: exists( #10, #5 ), references = 12, size of lhs = 2:
% 0.78/0.99 P_not-{F}(V0,V1), P_implies-{F}(V0,V2,V3) | P_or-{T}(V1,V2,V3)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #26: exists( #9, #24 ), references = 1, size of lhs = 8:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_or-{F}(V2,V1,V5), P_or-{F}(V0,V5,V6), P_or-{F}(V6,V6,V4) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #30: exists( #9, #5 ), references = 5, size of lhs = 2:
% 0.78/0.99 P_not-{F}(V0,V1), P_or-{F}(V1,V2,V3) | P_implies-{T}(V0,V2,V3)
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #43: exists( #9, #41 ), references = 1, size of lhs = 11:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_not-{F}(V4,V5), P_not-{F}(V6,V5), P_or-{F}(V2,V1,V7), P_or-{F}(V0,V7,V8), P_not-{F}(V9,V5), P_or-{F}(V10,V9,V8) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #52: exists( #9, #50 ), references = 1, size of lhs = 13:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_not-{F}(V4,V5), P_or-{F}(V2,V1,V6), P_or-{F}(V0,V6,V7), P_not-{F}(V8,V5), P_implies-{F}(V9,V10,V8), P_or-{F}(V11,V9,V12), P_or-{F}(V11,V10,V13), P_implies-{F}(V12,V13,V7) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #54: exists( #11, #51 ), references = 1, size of lhs = 11:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_or-{F}(V2,V1,V5), P_or-{F}(V0,V5,V6), P_implies-{F}(V7,V8,V4), P_or-{F}(V9,V7,V10), P_or-{F}(V9,V8,V11), P_implies-{F}(V10,V11,V6) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #59: exists( #9, #57 ), references = 2, size of lhs = 11:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_or-{F}(V2,V1,V5), P_or-{F}(V0,V5,V6), P_or-{F}(V7,V8,V4), P_or-{F}(V9,V10,V8), P_or-{F}(V7,V10,V11), P_or-{F}(V9,V11,V6) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #62: exists( #9, #60 ), references = 1, size of lhs = 7:
% 0.78/0.99 P_p-{F}(V0), P_not-{F}(V1,V0), P_q-{F}(V2), P_r-{F}(V3), P_or-{F}(V2,V3,V4), P_or-{F}(V3,V2,V4), P_or-{F}(V0,V5,V4) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #65: exists( #9, #63 ), references = 1, size of lhs = 5:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V0), P_r-{F}(V0), P_not-{F}(V1,V0), P_not-{F}(V2,V0) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #68: exists( #10, #59 ), references = 1, size of lhs = 6:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V1,V2,V3), P_or-{F}(V2,V1,V3), P_or-{F}(V0,V4,V3) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #70: exists( #10, #67 ), references = 1, size of lhs = 3:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V0), P_r-{F}(V0) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #93: exists( #9, #91 ), references = 1, size of lhs = 15:
% 0.78/0.99 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_q-{F}(V3), P_r-{F}(V4), P_or-{F}(V3,V4,V5), P_or-{F}(V2,V5,V6), P_or-{F}(V4,V3,V7), P_or-{F}(V2,V7,V8), P_implies-{F}(V6,V8,V9), P_not-{F}(V10,V1), P_implies-{F}(V11,V12,V10), P_or-{F}(V13,V11,V14), P_or-{F}(V13,V12,V15), P_implies-{F}(V14,V15,V9) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #95: exists( #9, #92 ), references = 3, size of lhs = 13:
% 0.78/0.99 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_q-{F}(V3), P_r-{F}(V4), P_or-{F}(V3,V4,V5), P_or-{F}(V2,V5,V6), P_or-{F}(V4,V3,V7), P_or-{F}(V2,V7,V8), P_not-{F}(V9,V1), P_implies-{F}(V10,V11,V9), P_or-{F}(V12,V10,V6), P_or-{F}(V12,V11,V8) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #98: exists( #9, #96 ), references = 2, size of lhs = 12:
% 0.78/0.99 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V3,V2), P_q-{F}(V4), P_r-{F}(V5), P_or-{F}(V4,V5,V6), P_or-{F}(V5,V4,V7), P_or-{F}(V2,V7,V8), P_or-{F}(V2,V9,V8), P_implies-{F}(V6,V9,V10), P_not-{F}(V10,V1) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #103: exists( #11, #98 ), references = 1, size of lhs = 10:
% 0.78/0.99 theorem-{F}(V0), P_p-{F}(V1), P_not-{F}(V2,V1), P_q-{F}(V3), P_r-{F}(V4), P_or-{F}(V3,V4,V5), P_or-{F}(V4,V3,V6), P_or-{F}(V1,V6,V7), P_or-{F}(V1,V8,V7), P_implies-{F}(V5,V8,V0) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #104: exists( #11, #95 ), references = 2, size of lhs = 11:
% 0.78/0.99 theorem-{F}(V0), P_p-{F}(V1), P_q-{F}(V2), P_r-{F}(V3), P_or-{F}(V2,V3,V4), P_or-{F}(V1,V4,V5), P_or-{F}(V3,V2,V6), P_or-{F}(V1,V6,V7), P_implies-{F}(V8,V9,V0), P_or-{F}(V10,V8,V5), P_or-{F}(V10,V9,V7) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #111: exists( #9, #107 ), references = 2, size of lhs = 10:
% 0.78/0.99 P_p-{F}(V0), P_not-{F}(V1,V0), P_q-{F}(V2), P_r-{F}(V3), P_or-{F}(V2,V3,V4), P_or-{F}(V3,V2,V5), P_or-{F}(V0,V5,V6), P_or-{F}(V0,V7,V6), P_or-{F}(V8,V9,V4), P_or-{F}(V9,V8,V7) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #114: exists( #9, #112 ), references = 1, size of lhs = 6:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V0), P_not-{F}(V1,V0), P_not-{F}(V2,V0), P_r-{F}(V3), P_or-{F}(V3,V0,V3) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #121: mergings( V6 == V8; #119 ), references = 2, size of lhs = 7:
% 0.78/0.99 P_p-{F}(V0), P_not-{F}(V1,V0), P_q-{F}(V2), P_not-{F}(V3,V2), P_r-{F}(V4), P_or-{F}(V4,V2,V5), P_or-{F}(V0,V5,V6) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #129: exists( #9, #123 ), references = 2, size of lhs = 7:
% 0.78/0.99 P_p-{F}(V0), P_not-{F}(V1,V0), P_not-{F}(V2,V0), P_q-{F}(V3), P_not-{F}(V4,V3), P_r-{F}(V5), P_or-{F}(V5,V3,V6) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #132: exists( #9, #130 ), references = 1, size of lhs = 7:
% 0.78/0.99 P_p-{F}(V0), P_not-{F}(V1,V0), P_not-{F}(V2,V0), P_q-{F}(V3), P_not-{F}(V4,V3), P_r-{F}(V5), P_not-{F}(V6,V5) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #134: exists( #10, #129 ), references = 1, size of lhs = 6:
% 0.78/0.99 P_p-{F}(V0), P_not-{F}(V1,V0), P_not-{F}(V2,V0), P_q-{F}(V3), P_not-{F}(V4,V3), P_r-{F}(V5) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #140: exists( #10, #95 ), references = 1, size of lhs = 11:
% 0.78/0.99 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_q-{F}(V3), P_r-{F}(V4), P_or-{F}(V3,V4,V5), P_or-{F}(V4,V3,V6), P_or-{F}(V2,V6,V7), P_or-{F}(V2,V8,V7), P_implies-{F}(V5,V8,V9), P_not-{F}(V9,V1) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #141: exists( #10, #104 ), references = 2, size of lhs = 9:
% 0.78/0.99 theorem-{F}(V0), P_p-{F}(V1), P_q-{F}(V2), P_r-{F}(V3), P_or-{F}(V2,V3,V4), P_or-{F}(V3,V2,V5), P_or-{F}(V1,V5,V6), P_implies-{F}(V4,V7,V0), P_or-{F}(V1,V7,V6) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #145: exists( #9, #143 ), references = 1, size of lhs = 9:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V1,V2,V3), P_or-{F}(V2,V1,V4), P_or-{F}(V0,V4,V5), P_or-{F}(V0,V6,V5), P_or-{F}(V7,V8,V3), P_or-{F}(V8,V7,V6) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #148: mergings( V4 == V6; #146 ), references = 2, size of lhs = 5:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V2,V1,V3), P_or-{F}(V0,V3,V4) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #152: exists( #10, #148 ), references = 2, size of lhs = 4:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_or-{F}(V2,V1,V3) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #156: exists( #9, #153 ), references = 1, size of lhs = 4:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2), P_not-{F}(V3,V2) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #158: exists( #10, #152 ), references = 1, size of lhs = 3:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1), P_r-{F}(V2) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #160: exists( #14, #157 ), references = 1, size of lhs = 2:
% 0.78/0.99 P_p-{F}(V0), P_q-{F}(V1) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #162: exists( #13, #159 ), references = 1, size of lhs = 1:
% 0.78/0.99 P_p-{F}(V0) | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 #164: exists( #12, #161 ), references = 1, size of lhs = 0:
% 0.78/0.99 FALSE | FALSE
% 0.78/0.99 (used 0 times, uses = {})
% 0.78/0.99
% 0.78/0.99 number of learnt formulas = 32
% 0.78/0.99
% 0.78/0.99
% 0.78/0.99 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.99
% 0.78/0.99 randbase = 1
%------------------------------------------------------------------------------