%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL177-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n013.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:49 PM UTC 2026
% Result : Unsatisfiable 0.78s 1.11s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL177-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.09/0.35 % Computer : n013.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 5 11:50:05 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.78/1.11 GeoParameters:
% 0.78/1.11
% 0.78/1.11 tptp_input = 1
% 0.78/1.11 tptp_output = 0
% 0.78/1.11 nonempty = 1
% 0.78/1.11 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.78/1.11 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.78/1.11
% 0.78/1.11
% 0.78/1.11 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.78/1.11 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.78/1.11
% 0.78/1.11 RuleSystem INPUT:
% 0.78/1.11
% 0.78/1.11 Initial Rules:
% 0.78/1.11 #0: input, references = 6, size of lhs = 3:
% 0.78/1.11 P_or-{F}(V0,V0,V1), P_not-{F}(V1,V2), P_or-{F}(V2,V0,V3) | axiom-{T}(V3)
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #1: input, references = 12, size of lhs = 3:
% 0.78/1.11 P_not-{F}(V0,V2), P_or-{F}(V1,V0,V3), P_or-{F}(V2,V3,V4) | axiom-{T}(V4)
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #2: input, references = 8, size of lhs = 4:
% 0.78/1.11 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.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #3: input, references = 6, size of lhs = 6:
% 0.78/1.11 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.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #4: input, references = 3, size of lhs = 8:
% 0.78/1.11 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.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #5: input, references = 11, size of lhs = 1:
% 0.78/1.11 axiom-{F}(V0) | theorem-{T}(V0)
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #6: input, references = 11, size of lhs = 4:
% 0.78/1.11 P_not-{F}(V0,V1), theorem-{F}(V0), P_or-{F}(V1,V2,V3), axiom-{F}(V3) | theorem-{T}(V2)
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #7: input, references = 7, size of lhs = 7:
% 0.78/1.11 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.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #8: input, references = 8, size of lhs = 4:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), theorem-{F}(V2) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #9: input, references = 24, size of lhs = 2:
% 0.78/1.11 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #10: input, references = 9, size of lhs = 1:
% 0.78/1.11 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #11: input, references = 4, size of lhs = 0:
% 0.78/1.11 FALSE | EXISTS V0: P_p-{T}(V0)
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 number of initial rules = 12
% 0.78/1.11
% 0.78/1.11 Simplifiers:
% 0.78/1.11 #12: unsound, references = 3, size of lhs = 3:
% 0.78/1.11 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #13: unsound, references = 3, size of lhs = 3:
% 0.78/1.11 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #14: unsound, references = 3, size of lhs = 3:
% 0.78/1.11 P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 number of simplifiers = 3
% 0.78/1.11
% 0.78/1.11 Learnt:
% 0.78/1.11 #20: exists( #9, #18 ), references = 1, size of lhs = 4:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V0), P_or-{F}(V3,V2,V1) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #26: exists( #9, #24 ), references = 1, size of lhs = 10:
% 0.78/1.11 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V2,V3), P_not-{F}(V4,V5), P_not-{F}(V6,V5), P_or-{F}(V7,V6,V0), P_not-{F}(V8,V7), P_or-{F}(V7,V9,V3), P_or-{F}(V10,V4,V9) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #28: exists( #9, #25 ), references = 1, size of lhs = 8:
% 0.78/1.11 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V3,V0), P_not-{F}(V3,V4), P_not-{F}(V5,V4), P_not-{F}(V6,V1), P_or-{F}(V7,V5,V2) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #31: exists( #9, #29 ), references = 1, size of lhs = 8:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V0), P_not-{F}(V3,V0), P_or-{F}(V4,V3,V5), P_not-{F}(V5,V6), P_not-{F}(V7,V6), P_or-{F}(V8,V7,V1) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #39: exists( #9, #37 ), references = 2, size of lhs = 7:
% 0.78/1.11 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V2,V3,V4), P_not-{F}(V5,V1), P_or-{F}(V6,V5,V4) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #41: exists( #9, #38 ), references = 2, size of lhs = 5:
% 0.78/1.11 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_not-{F}(V3,V1) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #62: exists( #9, #60 ), references = 4, size of lhs = 8:
% 0.78/1.11 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V2,V3,V4), P_not-{F}(V5,V1), P_or-{F}(V6,V7,V5), P_or-{F}(V7,V6,V4) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #67: exists( #10, #62 ), references = 4, size of lhs = 6:
% 0.78/1.11 theorem-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V2,V3), P_or-{F}(V4,V5,V0), P_or-{F}(V5,V4,V3) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #71: exists( #9, #69 ), references = 1, size of lhs = 7:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_or-{F}(V5,V4,V2), P_or-{F}(V6,V7,V3), P_or-{F}(V7,V6,V5) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #73: exists( #9, #70 ), references = 1, size of lhs = 5:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V1), P_or-{F}(V3,V4,V2), P_or-{F}(V4,V3,V0) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #75: exists( #10, #72 ), references = 1, size of lhs = 3:
% 0.78/1.11 P_p-{F}(V0), P_or-{F}(V1,V2,V0), P_or-{F}(V2,V1,V0) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #111: exists( #9, #105 ), references = 1, size of lhs = 9:
% 0.78/1.11 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_not-{F}(V3,V4), P_not-{F}(V5,V4), P_not-{F}(V6,V1), P_or-{F}(V7,V8,V6), P_or-{F}(V8,V7,V5) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #112: exists( #9, #106 ), references = 1, size of lhs = 11:
% 0.78/1.11 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V2,V3,V4), P_not-{F}(V5,V1), P_not-{F}(V6,V7), P_or-{F}(V8,V6,V4), P_not-{F}(V9,V7), P_or-{F}(V10,V11,V5), P_or-{F}(V11,V10,V9) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #113: exists( #9, #107 ), references = 2, size of lhs = 10:
% 0.78/1.11 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V2,V3,V4), P_not-{F}(V5,V1), P_or-{F}(V6,V7,V4), P_or-{F}(V7,V6,V8), P_or-{F}(V9,V10,V5), P_or-{F}(V10,V9,V8) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #117: exists( #10, #108 ), references = 1, size of lhs = 7:
% 0.78/1.11 theorem-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_not-{F}(V4,V3), P_or-{F}(V5,V6,V0), P_or-{F}(V6,V5,V4) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #118: exists( #10, #109 ), references = 1, size of lhs = 9:
% 0.78/1.11 theorem-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V2,V3), P_not-{F}(V4,V5), P_or-{F}(V6,V4,V3), P_not-{F}(V7,V5), P_or-{F}(V8,V9,V0), P_or-{F}(V9,V8,V7) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #125: exists( #9, #121 ), references = 1, size of lhs = 7:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V1,V2), P_not-{F}(V3,V2), P_not-{F}(V4,V5), P_or-{F}(V6,V5,V3), P_or-{F}(V7,V4,V6) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #180: exists( #9, #174 ), references = 1, size of lhs = 12:
% 0.78/1.11 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V2,V3,V4), P_not-{F}(V5,V1), P_or-{F}(V6,V7,V4), P_or-{F}(V7,V6,V8), P_or-{F}(V9,V10,V5), P_or-{F}(V11,V12,V10), P_or-{F}(V9,V12,V13), P_or-{F}(V11,V13,V8) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #181: exists( #9, #175 ), references = 1, size of lhs = 14:
% 0.78/1.11 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V2,V3,V4), P_not-{F}(V5,V1), P_or-{F}(V6,V7,V4), P_or-{F}(V7,V6,V8), P_not-{F}(V8,V9), P_not-{F}(V10,V9), P_or-{F}(V11,V12,V5), P_or-{F}(V13,V14,V12), P_or-{F}(V11,V14,V15), P_or-{F}(V13,V15,V10) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #182: exists( #9, #176 ), references = 1, size of lhs = 16:
% 0.78/1.11 theorem-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V2,V3,V4), P_not-{F}(V5,V1), P_or-{F}(V6,V7,V4), P_or-{F}(V7,V6,V8), P_or-{F}(V9,V10,V8), P_or-{F}(V10,V9,V11), P_not-{F}(V11,V12), P_not-{F}(V13,V12), P_or-{F}(V14,V15,V5), P_or-{F}(V16,V17,V15), P_or-{F}(V14,V17,V18), P_or-{F}(V16,V18,V13) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #186: exists( #10, #177 ), references = 1, size of lhs = 10:
% 0.78/1.11 theorem-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V2,V3), P_or-{F}(V4,V5,V3), P_or-{F}(V5,V4,V6), P_or-{F}(V7,V8,V0), P_or-{F}(V9,V10,V8), P_or-{F}(V7,V10,V11), P_or-{F}(V9,V11,V6) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #187: exists( #10, #178 ), references = 1, size of lhs = 12:
% 0.78/1.11 theorem-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V2,V3), P_or-{F}(V4,V5,V3), P_or-{F}(V5,V4,V6), P_not-{F}(V6,V7), P_not-{F}(V8,V7), P_or-{F}(V9,V10,V0), P_or-{F}(V11,V12,V10), P_or-{F}(V9,V12,V13), P_or-{F}(V11,V13,V8) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #188: exists( #10, #179 ), references = 1, size of lhs = 14:
% 0.78/1.11 theorem-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V2,V3), P_or-{F}(V4,V5,V3), P_or-{F}(V5,V4,V6), P_or-{F}(V7,V8,V6), P_or-{F}(V8,V7,V9), P_not-{F}(V9,V10), P_not-{F}(V11,V10), P_or-{F}(V12,V13,V0), P_or-{F}(V14,V15,V13), P_or-{F}(V12,V15,V16), P_or-{F}(V14,V16,V11) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #198: exists( #9, #192 ), references = 2, size of lhs = 10:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_or-{F}(V5,V3,V6), P_or-{F}(V7,V8,V2), P_or-{F}(V8,V7,V9), P_or-{F}(V10,V11,V6), P_or-{F}(V4,V11,V12), P_or-{F}(V10,V12,V9) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #209: exists( #9, #198 ), references = 1, size of lhs = 8:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_or-{F}(V4,V3,V5), P_or-{F}(V6,V7,V2), P_or-{F}(V7,V6,V8), P_or-{F}(V9,V5,V8) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #225: exists( #9, #219 ), references = 1, size of lhs = 10:
% 0.78/1.11 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V2,V3), P_or-{F}(V4,V4,V5), P_not-{F}(V5,V6), P_not-{F}(V7,V6), P_or-{F}(V8,V4,V3), P_or-{F}(V8,V7,V0), P_not-{F}(V9,V8) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #226: exists( #9, #220 ), references = 1, size of lhs = 12:
% 0.78/1.11 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V2,V3), P_or-{F}(V4,V4,V5), P_not-{F}(V5,V6), P_not-{F}(V7,V6), P_or-{F}(V8,V7,V0), P_not-{F}(V9,V8), P_or-{F}(V8,V4,V10), P_or-{F}(V11,V12,V10), P_or-{F}(V12,V11,V3) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #227: exists( #9, #221 ), references = 1, size of lhs = 14:
% 0.78/1.11 axiom-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_or-{F}(V1,V2,V3), P_or-{F}(V4,V4,V5), P_not-{F}(V5,V6), P_not-{F}(V7,V6), P_or-{F}(V8,V7,V0), P_not-{F}(V9,V8), P_or-{F}(V8,V4,V10), P_not-{F}(V10,V11), P_not-{F}(V12,V11), P_or-{F}(V13,V14,V12), P_or-{F}(V14,V13,V3) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #234: exists( #9, #228 ), references = 1, size of lhs = 10:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_or-{F}(V4,V5,V2), P_or-{F}(V5,V5,V6), P_not-{F}(V6,V7), P_not-{F}(V8,V4), P_not-{F}(V9,V7), P_or-{F}(V10,V3,V9) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #235: exists( #9, #229 ), references = 1, size of lhs = 12:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_not-{F}(V5,V4), P_or-{F}(V6,V3,V7), P_not-{F}(V7,V8), P_not-{F}(V9,V8), P_or-{F}(V10,V10,V9), P_or-{F}(V4,V10,V11), P_or-{F}(V12,V13,V11), P_or-{F}(V13,V12,V2) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #236: exists( #9, #230 ), references = 1, size of lhs = 14:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_not-{F}(V5,V4), P_or-{F}(V6,V3,V7), P_not-{F}(V7,V8), P_not-{F}(V9,V8), P_or-{F}(V10,V10,V9), P_or-{F}(V4,V10,V11), P_not-{F}(V11,V12), P_not-{F}(V13,V12), P_or-{F}(V14,V15,V13), P_or-{F}(V15,V14,V2) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #240: exists( #10, #231 ), references = 2, size of lhs = 8:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_or-{F}(V4,V5,V2), P_or-{F}(V5,V5,V6), P_not-{F}(V7,V4), P_or-{F}(V8,V3,V6) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #241: exists( #10, #232 ), references = 2, size of lhs = 10:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_not-{F}(V5,V4), P_or-{F}(V6,V3,V7), P_or-{F}(V8,V8,V7), P_or-{F}(V4,V8,V9), P_or-{F}(V10,V11,V9), P_or-{F}(V11,V10,V2) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #242: exists( #10, #233 ), references = 1, size of lhs = 10:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_not-{F}(V5,V4), P_or-{F}(V6,V3,V7), P_or-{F}(V8,V8,V7), P_or-{F}(V4,V8,V7), P_or-{F}(V9,V10,V7), P_or-{F}(V10,V9,V2) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #246: exists( #9, #237 ), references = 1, size of lhs = 3:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V0), P_not-{F}(V1,V0) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #249: exists( #9, #240 ), references = 1, size of lhs = 6:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V0), P_or-{F}(V1,V1,V3), P_not-{F}(V4,V0), P_or-{F}(V5,V2,V3) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #251: exists( #9, #241 ), references = 1, size of lhs = 8:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_or-{F}(V0,V1,V2), P_not-{F}(V3,V4), P_not-{F}(V5,V4), P_or-{F}(V6,V4,V2), P_or-{F}(V6,V6,V7), P_or-{F}(V8,V3,V7) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #253: exists( #9, #250 ), references = 1, size of lhs = 6:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V1), P_not-{F}(V3,V1), P_or-{F}(V0,V0,V4), P_or-{F}(V5,V2,V4) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #255: exists( #9, #252 ), references = 1, size of lhs = 3:
% 0.78/1.11 P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V1) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #257: exists( #10, #254 ), references = 1, size of lhs = 1:
% 0.78/1.11 P_p-{F}(V0) | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 #259: exists( #11, #256 ), references = 1, size of lhs = 0:
% 0.78/1.11 FALSE | FALSE
% 0.78/1.11 (used 0 times, uses = {})
% 0.78/1.11
% 0.78/1.11 number of learnt formulas = 41
% 0.78/1.11
% 0.78/1.11
% 0.78/1.11 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.78/1.11
% 0.78/1.11 randbase = 1
%------------------------------------------------------------------------------