%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL185-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 12:05:50 PM UTC 2026
% Result : Unsatisfiable 1.17s 1.45s
% Output : Refutation 1.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL185-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.08/0.34 % Computer : n016.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 5 01:02:43 UTC 2026
% 0.08/0.34 % CPUTime :
% 1.17/1.45 GeoParameters:
% 1.17/1.45
% 1.17/1.45 tptp_input = 1
% 1.17/1.45 tptp_output = 0
% 1.17/1.45 nonempty = 1
% 1.17/1.45 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.17/1.45 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 1.17/1.45
% 1.17/1.45
% 1.17/1.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.17/1.45 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.17/1.45
% 1.17/1.45 RuleSystem INPUT:
% 1.17/1.45
% 1.17/1.45 Initial Rules:
% 1.17/1.45 #0: input, references = 3, size of lhs = 3:
% 1.17/1.45 P_or-{F}(V0,V0,V1), P_not-{F}(V1,V2), P_or-{F}(V2,V0,V3) | axiom-{T}(V3)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #1: input, references = 12, size of lhs = 3:
% 1.17/1.45 P_not-{F}(V0,V2), P_or-{F}(V1,V0,V3), P_or-{F}(V2,V3,V4) | axiom-{T}(V4)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #2: input, references = 14, size of lhs = 4:
% 1.17/1.45 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)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #3: input, references = 3, size of lhs = 6:
% 1.17/1.45 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)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #4: input, references = 3, size of lhs = 8:
% 1.17/1.45 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)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #5: input, references = 9, size of lhs = 1:
% 1.17/1.45 axiom-{F}(V0) | theorem-{T}(V0)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #6: input, references = 8, size of lhs = 4:
% 1.17/1.45 P_not-{F}(V0,V1), theorem-{F}(V0), P_or-{F}(V1,V2,V3), axiom-{F}(V3) | theorem-{T}(V2)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #7: input, references = 5, size of lhs = 7:
% 1.17/1.45 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)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #8: input, references = 7, size of lhs = 6:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_or-{F}(V0,V2,V3), P_or-{F}(V1,V3,V4), theorem-{F}(V4) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #9: input, references = 20, size of lhs = 2:
% 1.17/1.45 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #10: input, references = 9, size of lhs = 1:
% 1.17/1.45 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #11: input, references = 4, size of lhs = 0:
% 1.17/1.45 FALSE | EXISTS V0: P_p-{T}(V0)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #12: input, references = 4, size of lhs = 0:
% 1.17/1.45 FALSE | EXISTS V0: P_q-{T}(V0)
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 number of initial rules = 13
% 1.17/1.45
% 1.17/1.45 Simplifiers:
% 1.17/1.45 #13: unsound, references = 3, size of lhs = 3:
% 1.17/1.45 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #14: unsound, references = 3, size of lhs = 3:
% 1.17/1.45 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #15: unsound, references = 3, size of lhs = 3:
% 1.17/1.45 P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #16: unsound, references = 3, size of lhs = 3:
% 1.17/1.45 P_q-{F}(V0), P_q-{F}(V1), V0 == V1 | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 number of simplifiers = 4
% 1.17/1.45
% 1.17/1.45 Learnt:
% 1.17/1.45 #20: exists( #9, #18 ), references = 1, size of lhs = 6:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_or-{F}(V0,V2,V3), P_not-{F}(V4,V1), P_or-{F}(V5,V4,V3) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #22: exists( #9, #19 ), references = 1, size of lhs = 4:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_not-{F}(V2,V1) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #24: exists( #10, #21 ), references = 1, size of lhs = 2:
% 1.17/1.45 P_p-{F}(V0), P_q-{F}(V0) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #27: exists( #9, #25 ), references = 5, size of lhs = 10:
% 1.17/1.45 theorem-{F}(V0), axiom-{F}(V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_or-{F}(V2,V4,V5), P_or-{F}(V3,V6,V1), P_not-{F}(V6,V7), P_or-{F}(V7,V5,V0), P_not-{F}(V8,V3) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #31: exists( #9, #29 ), references = 2, size of lhs = 10:
% 1.17/1.45 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_or-{F}(V2,V5,V0), P_not-{F}(V5,V6), P_not-{F}(V7,V2), P_not-{F}(V8,V6), P_or-{F}(V9,V8,V4) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #33: exists( #9, #30 ), references = 3, size of lhs = 8:
% 1.17/1.45 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V2,V4,V0), P_not-{F}(V4,V5), P_not-{F}(V3,V5), P_not-{F}(V6,V2) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #36: exists( #9, #34 ), references = 1, size of lhs = 8:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_not-{F}(V2,V3), P_not-{F}(V4,V1), P_not-{F}(V5,V1), P_not-{F}(V6,V3), P_or-{F}(V7,V5,V6) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #38: exists( #10, #35 ), references = 1, size of lhs = 6:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_not-{F}(V3,V1), P_not-{F}(V4,V1), P_or-{F}(V5,V4,V2) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #47: exists( #9, #45 ), references = 4, size of lhs = 14:
% 1.17/1.45 theorem-{F}(V0), axiom-{F}(V1), axiom-{F}(V2), P_p-{F}(V3), P_not-{F}(V3,V4), P_q-{F}(V5), P_or-{F}(V3,V5,V6), P_or-{F}(V4,V7,V2), P_not-{F}(V7,V8), P_not-{F}(V9,V4), P_or-{F}(V8,V10,V1), P_not-{F}(V10,V11), P_or-{F}(V11,V6,V0), P_not-{F}(V12,V8) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #51: exists( #9, #49 ), references = 3, size of lhs = 14:
% 1.17/1.45 axiom-{F}(V0), axiom-{F}(V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_or-{F}(V2,V4,V5), P_or-{F}(V3,V6,V1), P_not-{F}(V6,V7), P_not-{F}(V8,V3), P_or-{F}(V7,V9,V0), P_not-{F}(V9,V10), P_not-{F}(V11,V7), P_not-{F}(V12,V10), P_or-{F}(V13,V12,V5) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #54: exists( #9, #52 ), references = 1, size of lhs = 11:
% 1.17/1.45 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V2,V4,V0), P_not-{F}(V4,V1), P_not-{F}(V5,V2), P_not-{F}(V6,V1), P_not-{F}(V7,V1), P_or-{F}(V8,V7,V3), P_not-{F}(V3,V9) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #63: exists( #9, #59 ), references = 1, size of lhs = 9:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_not-{F}(V2,V3), P_not-{F}(V4,V1), P_not-{F}(V5,V3), P_not-{F}(V6,V1), P_or-{F}(V7,V8,V6), P_or-{F}(V8,V7,V5) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #64: exists( #9, #58 ), references = 1, size of lhs = 11:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_or-{F}(V0,V2,V3), P_not-{F}(V4,V1), P_not-{F}(V5,V1), P_not-{F}(V6,V7), P_or-{F}(V8,V6,V3), P_not-{F}(V9,V7), P_or-{F}(V10,V11,V5), P_or-{F}(V11,V10,V9) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #65: exists( #9, #57 ), references = 2, size of lhs = 15:
% 1.17/1.45 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_or-{F}(V2,V5,V0), P_not-{F}(V5,V6), P_not-{F}(V7,V2), P_not-{F}(V8,V6), P_not-{F}(V9,V6), P_not-{F}(V10,V11), P_or-{F}(V12,V10,V4), P_not-{F}(V13,V11), P_or-{F}(V14,V15,V9), P_or-{F}(V15,V14,V13) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #81: exists( #9, #75 ), references = 1, size of lhs = 7:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_or-{F}(V0,V2,V3), P_not-{F}(V4,V1), P_or-{F}(V5,V6,V4), P_or-{F}(V6,V5,V3) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #82: exists( #9, #76 ), references = 2, size of lhs = 11:
% 1.17/1.45 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_or-{F}(V2,V5,V0), P_not-{F}(V5,V6), P_not-{F}(V7,V2), P_not-{F}(V8,V6), P_or-{F}(V9,V10,V8), P_or-{F}(V10,V9,V4) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #83: exists( #9, #77 ), references = 2, size of lhs = 15:
% 1.17/1.45 axiom-{F}(V0), axiom-{F}(V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_or-{F}(V2,V4,V5), P_or-{F}(V3,V6,V1), P_not-{F}(V6,V7), P_not-{F}(V8,V3), P_or-{F}(V7,V9,V0), P_not-{F}(V9,V10), P_not-{F}(V11,V7), P_not-{F}(V12,V10), P_or-{F}(V13,V14,V12), P_or-{F}(V14,V13,V5) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #100: exists( #9, #94 ), references = 1, size of lhs = 10:
% 1.17/1.45 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_or-{F}(V2,V4,V5), P_or-{F}(V3,V5,V6), P_not-{F}(V7,V1), P_or-{F}(V8,V9,V7), P_or-{F}(V9,V8,V6) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #101: exists( #9, #95 ), references = 3, size of lhs = 14:
% 1.17/1.45 theorem-{F}(V0), P_not-{F}(V0,V1), axiom-{F}(V2), P_p-{F}(V3), P_not-{F}(V3,V4), P_q-{F}(V5), P_or-{F}(V3,V5,V6), P_or-{F}(V4,V7,V2), P_not-{F}(V7,V8), P_or-{F}(V8,V6,V9), P_not-{F}(V10,V4), P_not-{F}(V11,V1), P_or-{F}(V12,V13,V11), P_or-{F}(V13,V12,V9) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #102: exists( #9, #96 ), references = 3, size of lhs = 18:
% 1.17/1.45 theorem-{F}(V0), P_not-{F}(V0,V1), axiom-{F}(V2), axiom-{F}(V3), P_p-{F}(V4), P_not-{F}(V4,V5), P_q-{F}(V6), P_or-{F}(V4,V6,V7), P_or-{F}(V5,V8,V3), P_not-{F}(V8,V9), P_not-{F}(V10,V5), P_or-{F}(V9,V11,V2), P_not-{F}(V11,V12), P_or-{F}(V12,V7,V13), P_not-{F}(V14,V9), P_not-{F}(V15,V1), P_or-{F}(V16,V17,V15), P_or-{F}(V17,V16,V13) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #121: exists( #9, #117 ), references = 1, size of lhs = 18:
% 1.17/1.45 theorem-{F}(V0), P_not-{F}(V0,V1), axiom-{F}(V2), P_p-{F}(V3), P_not-{F}(V3,V4), P_q-{F}(V5), P_or-{F}(V3,V5,V6), P_or-{F}(V4,V7,V2), P_not-{F}(V7,V8), P_or-{F}(V8,V6,V9), P_not-{F}(V10,V4), P_not-{F}(V11,V1), P_or-{F}(V12,V13,V9), P_or-{F}(V13,V12,V14), P_not-{F}(V14,V15), P_not-{F}(V16,V15), P_or-{F}(V17,V18,V11), P_or-{F}(V18,V17,V16) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #122: exists( #9, #118 ), references = 1, size of lhs = 22:
% 1.17/1.45 theorem-{F}(V0), P_not-{F}(V0,V1), axiom-{F}(V2), axiom-{F}(V3), P_p-{F}(V4), P_not-{F}(V4,V5), P_q-{F}(V6), P_or-{F}(V4,V6,V7), P_or-{F}(V5,V8,V3), P_not-{F}(V8,V9), P_not-{F}(V10,V5), P_or-{F}(V9,V11,V2), P_not-{F}(V11,V12), P_or-{F}(V12,V7,V13), P_not-{F}(V14,V9), P_not-{F}(V15,V1), P_or-{F}(V16,V17,V13), P_or-{F}(V17,V16,V18), P_not-{F}(V18,V19), P_not-{F}(V20,V19), P_or-{F}(V21,V22,V15), P_or-{F}(V22,V21,V20) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #125: exists( #10, #119 ), references = 1, size of lhs = 16:
% 1.17/1.45 theorem-{F}(V0), axiom-{F}(V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_or-{F}(V2,V4,V5), P_or-{F}(V3,V6,V1), P_not-{F}(V6,V7), P_or-{F}(V7,V5,V8), P_not-{F}(V9,V3), P_or-{F}(V10,V11,V8), P_or-{F}(V11,V10,V12), P_not-{F}(V12,V13), P_not-{F}(V14,V13), P_or-{F}(V15,V16,V0), P_or-{F}(V16,V15,V14) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #126: exists( #10, #120 ), references = 1, size of lhs = 20:
% 1.17/1.45 theorem-{F}(V0), axiom-{F}(V1), axiom-{F}(V2), P_p-{F}(V3), P_not-{F}(V3,V4), P_q-{F}(V5), P_or-{F}(V3,V5,V6), P_or-{F}(V4,V7,V2), P_not-{F}(V7,V8), P_not-{F}(V9,V4), P_or-{F}(V8,V10,V1), P_not-{F}(V10,V11), P_or-{F}(V11,V6,V12), P_not-{F}(V13,V8), P_or-{F}(V14,V15,V12), P_or-{F}(V15,V14,V16), P_not-{F}(V16,V17), P_not-{F}(V18,V17), P_or-{F}(V19,V20,V0), P_or-{F}(V20,V19,V18) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #130: exists( #10, #101 ), references = 1, size of lhs = 12:
% 1.17/1.45 theorem-{F}(V0), axiom-{F}(V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_or-{F}(V2,V4,V5), P_or-{F}(V3,V6,V1), P_not-{F}(V6,V7), P_or-{F}(V7,V5,V8), P_not-{F}(V9,V3), P_or-{F}(V10,V11,V0), P_or-{F}(V11,V10,V8) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #131: exists( #10, #102 ), references = 1, size of lhs = 16:
% 1.17/1.45 theorem-{F}(V0), axiom-{F}(V1), axiom-{F}(V2), P_p-{F}(V3), P_not-{F}(V3,V4), P_q-{F}(V5), P_or-{F}(V3,V5,V6), P_or-{F}(V4,V7,V2), P_not-{F}(V7,V8), P_not-{F}(V9,V4), P_or-{F}(V8,V10,V1), P_not-{F}(V10,V11), P_or-{F}(V11,V6,V12), P_not-{F}(V13,V8), P_or-{F}(V14,V15,V0), P_or-{F}(V15,V14,V12) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #145: exists( #9, #141 ), references = 1, size of lhs = 14:
% 1.17/1.45 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_or-{F}(V2,V5,V0), P_not-{F}(V5,V6), P_not-{F}(V7,V2), P_not-{F}(V8,V6), P_not-{F}(V9,V6), P_or-{F}(V10,V9,V11), P_not-{F}(V11,V12), P_not-{F}(V13,V12), P_or-{F}(V14,V13,V4) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #155: exists( #9, #149 ), references = 1, size of lhs = 11:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_or-{F}(V0,V2,V3), P_not-{F}(V4,V1), P_not-{F}(V5,V1), P_or-{F}(V6,V5,V7), P_not-{F}(V7,V8), P_not-{F}(V9,V8), P_or-{F}(V10,V11,V9), P_or-{F}(V11,V10,V3) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #156: exists( #9, #150 ), references = 1, size of lhs = 15:
% 1.17/1.45 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_or-{F}(V2,V5,V0), P_not-{F}(V5,V6), P_not-{F}(V7,V2), P_not-{F}(V8,V6), P_not-{F}(V9,V6), P_or-{F}(V10,V9,V11), P_not-{F}(V11,V12), P_not-{F}(V13,V12), P_or-{F}(V14,V15,V13), P_or-{F}(V15,V14,V4) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #157: exists( #9, #151 ), references = 1, size of lhs = 15:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_or-{F}(V0,V2,V3), P_not-{F}(V4,V1), P_not-{F}(V5,V1), P_or-{F}(V6,V5,V7), P_not-{F}(V7,V8), P_not-{F}(V9,V8), P_not-{F}(V10,V8), P_not-{F}(V11,V12), P_or-{F}(V13,V11,V3), P_not-{F}(V14,V12), P_or-{F}(V15,V16,V10), P_or-{F}(V16,V15,V14) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #161: exists( #10, #152 ), references = 1, size of lhs = 9:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_or-{F}(V0,V2,V3), P_not-{F}(V4,V1), P_not-{F}(V5,V1), P_or-{F}(V6,V5,V7), P_or-{F}(V8,V9,V7), P_or-{F}(V9,V8,V3) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #162: exists( #10, #153 ), references = 1, size of lhs = 13:
% 1.17/1.45 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_or-{F}(V1,V3,V4), P_or-{F}(V2,V5,V0), P_not-{F}(V5,V6), P_not-{F}(V7,V2), P_not-{F}(V8,V6), P_not-{F}(V9,V6), P_or-{F}(V10,V9,V11), P_or-{F}(V12,V13,V11), P_or-{F}(V13,V12,V4) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #166: exists( #9, #158 ), references = 1, size of lhs = 7:
% 1.17/1.45 P_p-{F}(V0), P_not-{F}(V0,V1), P_q-{F}(V2), P_or-{F}(V0,V2,V3), P_not-{F}(V4,V1), P_not-{F}(V5,V1), P_or-{F}(V5,V6,V3) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #169: exists( #9, #164 ), references = 1, size of lhs = 4:
% 1.17/1.45 P_p-{F}(V0), P_q-{F}(V1), P_not-{F}(V0,V2), P_not-{F}(V3,V2) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #171: exists( #10, #167 ), references = 1, size of lhs = 2:
% 1.17/1.45 P_p-{F}(V0), P_q-{F}(V1) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #173: exists( #12, #170 ), references = 1, size of lhs = 1:
% 1.17/1.45 P_p-{F}(V0) | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 #175: exists( #11, #172 ), references = 1, size of lhs = 0:
% 1.17/1.45 FALSE | FALSE
% 1.17/1.45 (used 0 times, uses = {})
% 1.17/1.45
% 1.17/1.45 number of learnt formulas = 37
% 1.17/1.45
% 1.17/1.45
% 1.17/1.45 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.17/1.45
% 1.17/1.45 randbase = 1
%------------------------------------------------------------------------------