TSTP Solution File: LCL186-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL186-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n007.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:55 EDT 2022
% Result : Unsatisfiable 0.47s 0.63s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : LCL186-1 : TPTP v8.1.0. Released v1.1.0.
% 0.09/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jul 22 21:51:27 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.47/0.63 GeoParameters:
% 0.47/0.63
% 0.47/0.63 tptp_input = 1
% 0.47/0.63 tptp_output = 0
% 0.47/0.63 nonempty = 1
% 0.47/0.63 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.63 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.63 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.63
% 0.47/0.63 RuleSystem INPUT:
% 0.47/0.63
% 0.47/0.63 Initial Rules:
% 0.47/0.63 #0: input, references = 3, size of lhs = 3:
% 0.47/0.63 P_or-{F}(V0,V0,V1), P_not-{F}(V1,V2), P_or-{F}(V2,V0,V3) | axiom-{T}(V3)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #1: input, references = 5, size of lhs = 3:
% 0.47/0.63 P_not-{F}(V0,V2), P_or-{F}(V1,V0,V3), P_or-{F}(V2,V3,V4) | axiom-{T}(V4)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #2: input, references = 5, size of lhs = 4:
% 0.47/0.63 P_or-{F}(V0,V1,V2), P_not-{F}(V2,V3), P_or-{F}(V1,V0,V4), P_or-{F}(V3,V4,V5) | axiom-{T}(V5)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #3: input, references = 4, size of lhs = 6:
% 0.47/0.63 P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_not-{F}(V4,V5), P_or-{F}(V0,V2,V6), P_or-{F}(V1,V6,V7), P_or-{F}(V5,V7,V8) | axiom-{T}(V8)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #4: input, references = 5, size of lhs = 8:
% 0.47/0.63 P_not-{F}(V0,V3), P_or-{F}(V3,V1,V4), P_not-{F}(V4,V5), P_or-{F}(V2,V0,V6), P_not-{F}(V6,V7), P_or-{F}(V2,V1,V8), P_or-{F}(V7,V8,V9), P_or-{F}(V5,V9,V10) | axiom-{T}(V10)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #5: input, references = 7, size of lhs = 1:
% 0.47/0.63 axiom-{F}(V0) | theorem-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #6: input, references = 3, size of lhs = 4:
% 0.47/0.63 P_not-{F}(V0,V1), theorem-{F}(V0), P_or-{F}(V1,V2,V3), axiom-{F}(V3) | theorem-{T}(V2)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #7: input, references = 4, size of lhs = 7:
% 0.47/0.63 P_not-{F}(V0,V2), P_or-{F}(V2,V1,V3), theorem-{F}(V3), P_not-{F}(V4,V5), P_or-{F}(V5,V1,V6), P_or-{F}(V5,V0,V7), axiom-{F}(V7) | theorem-{T}(V6)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #8: input, references = 4, size of lhs = 7:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_or-{F}(V2,V4,V5), theorem-{F}(V5) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #9: input, references = 15, size of lhs = 2:
% 0.47/0.63 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #10: input, references = 8, size of lhs = 1:
% 0.47/0.63 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #11: input, references = 4, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_p-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #12: input, references = 4, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_q-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 number of initial rules = 13
% 0.47/0.63
% 0.47/0.63 Simplifiers:
% 0.47/0.63 #13: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #14: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #15: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #16: unsound, references = 3, size of lhs = 3:
% 0.47/0.63 P_q-{F}(V0), P_q-{F}(V1), V0 == V1 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 number of simplifiers = 4
% 0.47/0.63
% 0.47/0.63 Learnt:
% 0.47/0.63 #19: exists( #9, #17 ), references = 3, size of lhs = 11:
% 0.47/0.63 theorem-{F}(V0), axiom-{F}(V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_not-{F}(V3,V4), P_q-{F}(V5), P_or-{F}(V3,V5,V6), P_or-{F}(V4,V7,V1), P_not-{F}(V7,V8), P_or-{F}(V8,V6,V0), P_not-{F}(V9,V4) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #22: exists( #9, #20 ), references = 4, size of lhs = 11:
% 0.47/0.63 theorem-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_or-{F}(V2,V4,V5), P_not-{F}(V6,V3), P_not-{F}(V7,V3), P_or-{F}(V8,V5,V0), P_not-{F}(V9,V8), P_or-{F}(V10,V7,V9) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #29: exists( #9, #25 ), references = 1, size of lhs = 11:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_not-{F}(V5,V2), P_not-{F}(V6,V2), P_not-{F}(V7,V8), P_or-{F}(V9,V7,V4), P_not-{F}(V10,V8), P_or-{F}(V11,V6,V10) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #31: exists( #9, #27 ), references = 1, size of lhs = 9:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_not-{F}(V4,V2), P_not-{F}(V5,V2), P_not-{F}(V3,V6), P_not-{F}(V7,V6), P_or-{F}(V8,V5,V7) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #40: exists( #9, #35 ), references = 1, size of lhs = 16:
% 0.47/0.63 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_or-{F}(V2,V4,V5), P_or-{F}(V3,V6,V0), P_not-{F}(V6,V7), P_not-{F}(V8,V3), P_not-{F}(V9,V7), P_not-{F}(V10,V11), P_or-{F}(V11,V12,V9), P_or-{F}(V13,V10,V14), P_not-{F}(V14,V15), P_or-{F}(V13,V12,V16), P_or-{F}(V15,V16,V5) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #41: exists( #9, #36 ), references = 1, size of lhs = 16:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_not-{F}(V5,V2), P_not-{F}(V6,V2), P_not-{F}(V7,V8), P_or-{F}(V8,V9,V10), P_not-{F}(V10,V11), P_not-{F}(V12,V11), P_or-{F}(V13,V6,V12), P_or-{F}(V14,V7,V15), P_not-{F}(V15,V16), P_or-{F}(V14,V9,V17), P_or-{F}(V16,V17,V4) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #44: exists( #9, #38 ), references = 3, size of lhs = 14:
% 0.47/0.63 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_or-{F}(V3,V5,V0), P_not-{F}(V5,V6), P_not-{F}(V7,V3), P_not-{F}(V8,V6), P_not-{F}(V9,V2), P_not-{F}(V10,V11), P_or-{F}(V11,V12,V8), P_or-{F}(V13,V10,V9), P_or-{F}(V13,V12,V4) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #48: exists( #9, #46 ), references = 1, size of lhs = 17:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_not-{F}(V4,V2), P_not-{F}(V5,V1), P_not-{F}(V6,V2), P_not-{F}(V7,V8), P_or-{F}(V9,V7,V5), P_or-{F}(V9,V10,V3), P_or-{F}(V8,V10,V11), P_not-{F}(V11,V12), P_not-{F}(V13,V12), P_or-{F}(V14,V15,V6), P_or-{F}(V16,V17,V15), P_or-{F}(V14,V17,V18), P_or-{F}(V16,V18,V13) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #53: exists( #9, #49 ), references = 1, size of lhs = 15:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_not-{F}(V4,V2), P_not-{F}(V5,V1), P_not-{F}(V6,V2), P_not-{F}(V7,V8), P_or-{F}(V9,V7,V5), P_or-{F}(V9,V10,V3), P_or-{F}(V8,V10,V11), P_not-{F}(V11,V12), P_not-{F}(V13,V12), P_or-{F}(V14,V15,V6), P_or-{F}(V15,V14,V13) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #55: exists( #10, #51 ), references = 1, size of lhs = 13:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_not-{F}(V4,V2), P_not-{F}(V5,V1), P_not-{F}(V6,V2), P_not-{F}(V7,V8), P_or-{F}(V9,V7,V5), P_or-{F}(V9,V10,V3), P_or-{F}(V8,V10,V11), P_or-{F}(V12,V13,V6), P_or-{F}(V13,V12,V11) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #57: exists( #9, #54 ), references = 1, size of lhs = 11:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_not-{F}(V4,V2), P_not-{F}(V5,V1), P_not-{F}(V6,V2), P_not-{F}(V7,V8), P_or-{F}(V9,V7,V5), P_or-{F}(V9,V10,V3), P_or-{F}(V10,V8,V6) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #59: exists( #10, #56 ), references = 1, size of lhs = 8:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_not-{F}(V3,V1), P_not-{F}(V4,V5), P_or-{F}(V6,V4,V3), P_or-{F}(V6,V7,V2), P_or-{F}(V7,V5,V1) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #70: exists( #9, #66 ), references = 1, size of lhs = 12:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_not-{F}(V5,V2), P_not-{F}(V6,V2), P_or-{F}(V7,V6,V8), P_not-{F}(V8,V9), P_not-{F}(V10,V9), P_or-{F}(V11,V12,V10), P_or-{F}(V12,V11,V4) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #72: exists( #9, #68 ), references = 2, size of lhs = 10:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_not-{F}(V4,V2), P_not-{F}(V5,V2), P_or-{F}(V3,V1,V6), P_not-{F}(V6,V7), P_not-{F}(V8,V7), P_or-{F}(V9,V5,V8) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #76: exists( #10, #72 ), references = 1, size of lhs = 8:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_not-{F}(V4,V2), P_not-{F}(V5,V2), P_or-{F}(V3,V1,V6), P_or-{F}(V7,V5,V6) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #78: exists( #9, #73 ), references = 1, size of lhs = 5:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_not-{F}(V1,V3), P_not-{F}(V4,V3) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #80: exists( #10, #77 ), references = 1, size of lhs = 3:
% 0.47/0.63 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #82: exists( #10, #79 ), references = 1, size of lhs = 2:
% 0.47/0.63 P_p-{F}(V0), P_q-{F}(V1) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #84: exists( #12, #81 ), references = 1, size of lhs = 1:
% 0.47/0.63 P_p-{F}(V0) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #86: exists( #11, #83 ), references = 1, size of lhs = 0:
% 0.47/0.63 FALSE | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 number of learnt formulas = 20
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.63
% 0.47/0.63 randbase = 1
%------------------------------------------------------------------------------