TSTP Solution File: LCL186-10 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n021.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 6.68s 6.91s
% Output : Refutation 6.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n021.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 22:23:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 6.68/6.91 GeoParameters:
% 6.68/6.91
% 6.68/6.91 tptp_input = 1
% 6.68/6.91 tptp_output = 0
% 6.68/6.91 nonempty = 1
% 6.68/6.91 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.68/6.91 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 6.68/6.91
% 6.68/6.91
% 6.68/6.91 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.68/6.91 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.68/6.91
% 6.68/6.91 RuleSystem INPUT:
% 6.68/6.91
% 6.68/6.91 Initial Rules:
% 6.68/6.91 #0: input, references = 4, size of lhs = 2:
% 6.68/6.91 P_ifeq-{F}(V0,V0,V1,V2,V3), V3 == V1 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #1: input, references = 4, size of lhs = 6:
% 6.68/6.91 P_true-{F}(V0), P_or-{F}(V1,V1,V2), P_not-{F}(V2,V3), P_or-{F}(V3,V1,V4), P_axiom-{F}(V4,V5), V5 == V0 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #2: input, references = 4, size of lhs = 6:
% 6.68/6.91 P_true-{F}(V0), P_not-{F}(V1,V3), P_or-{F}(V2,V1,V4), P_or-{F}(V3,V4,V5), P_axiom-{F}(V5,V6), V6 == V0 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #3: input, references = 4, size of lhs = 7:
% 6.68/6.91 P_true-{F}(V0), P_or-{F}(V1,V2,V3), P_not-{F}(V3,V4), P_or-{F}(V2,V1,V5), P_or-{F}(V4,V5,V6), P_axiom-{F}(V6,V7), V7 == V0 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #4: input, references = 4, size of lhs = 9:
% 6.68/6.91 P_true-{F}(V0), P_or-{F}(V2,V3,V4), P_or-{F}(V1,V4,V5), P_not-{F}(V5,V6), P_or-{F}(V1,V3,V7), P_or-{F}(V2,V7,V8), P_or-{F}(V6,V8,V9), P_axiom-{F}(V9,V10), V10 == V0 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #5: input, references = 4, size of lhs = 11:
% 6.68/6.91 P_true-{F}(V0), P_not-{F}(V1,V4), P_or-{F}(V4,V2,V5), P_not-{F}(V5,V6), P_or-{F}(V3,V1,V7), P_not-{F}(V7,V8), P_or-{F}(V3,V2,V9), P_or-{F}(V8,V9,V10), P_or-{F}(V6,V10,V11), P_axiom-{F}(V11,V12), V12 == V0 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #6: input, references = 5, size of lhs = 5:
% 6.68/6.91 P_true-{F}(V0), P_axiom-{F}(V1,V2), P_theorem-{F}(V1,V3), P_ifeq-{F}(V2,V0,V3,V0,V4), V4 == V0 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #7: input, references = 3, size of lhs = 9:
% 6.68/6.91 P_true-{F}(V0), P_theorem-{F}(V2,V3), P_not-{F}(V2,V4), P_or-{F}(V4,V1,V5), P_axiom-{F}(V5,V6), P_theorem-{F}(V1,V7), P_ifeq-{F}(V6,V0,V7,V0,V8), P_ifeq-{F}(V3,V0,V8,V0,V9), V9 == V0 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #8: input, references = 4, size of lhs = 12:
% 6.68/6.91 P_true-{F}(V0), P_not-{F}(V2,V4), P_or-{F}(V4,V3,V5), P_theorem-{F}(V5,V6), P_not-{F}(V1,V7), P_or-{F}(V7,V2,V8), P_axiom-{F}(V8,V9), P_or-{F}(V7,V3,V10), P_theorem-{F}(V10,V11), P_ifeq-{F}(V9,V0,V11,V0,V12), P_ifeq-{F}(V6,V0,V12,V0,V13), V13 == V0 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #9: input, references = 6, size of lhs = 8:
% 6.68/6.91 P_true-{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,V5,V6), P_theorem-{F}(V6,V0) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #10: input, references = 5, size of lhs = 4:
% 6.68/6.91 #-{F} V0, #-{F} V1, #-{F} V2, #-{F} V3 | EXISTS V4: P_ifeq-{T}(V0,V1,V2,V3,V4)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #11: input, references = 6, size of lhs = 1:
% 6.68/6.91 #-{F} V0 | EXISTS V1: P_axiom-{T}(V0,V1)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #12: input, references = 19, size of lhs = 2:
% 6.68/6.91 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #13: input, references = 6, size of lhs = 1:
% 6.68/6.91 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #14: input, references = 4, size of lhs = 0:
% 6.68/6.91 FALSE | EXISTS V0: P_true-{T}(V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #15: input, references = 5, size of lhs = 1:
% 6.68/6.91 #-{F} V0 | EXISTS V1: P_theorem-{T}(V0,V1)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #16: input, references = 4, size of lhs = 0:
% 6.68/6.91 FALSE | EXISTS V0: P_p-{T}(V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #17: input, references = 4, size of lhs = 0:
% 6.68/6.91 FALSE | EXISTS V0: P_q-{T}(V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 number of initial rules = 18
% 6.68/6.91
% 6.68/6.91 Simplifiers:
% 6.68/6.91 #18: unsound, references = 3, size of lhs = 3:
% 6.68/6.91 P_ifeq-{F}(V0,V1,V2,V3,V4), P_ifeq-{F}(V0,V1,V2,V3,V9), V4 == V9 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #19: unsound, references = 3, size of lhs = 3:
% 6.68/6.91 P_axiom-{F}(V0,V1), P_axiom-{F}(V0,V3), V1 == V3 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #20: unsound, references = 3, size of lhs = 3:
% 6.68/6.91 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #21: unsound, references = 3, size of lhs = 3:
% 6.68/6.91 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #22: unsound, references = 3, size of lhs = 3:
% 6.68/6.91 P_true-{F}(V0), P_true-{F}(V1), V0 == V1 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #23: unsound, references = 3, size of lhs = 3:
% 6.68/6.91 P_theorem-{F}(V0,V1), P_theorem-{F}(V0,V3), V1 == V3 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #24: unsound, references = 3, size of lhs = 3:
% 6.68/6.91 P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #25: unsound, references = 3, size of lhs = 3:
% 6.68/6.91 P_q-{F}(V0), P_q-{F}(V1), V0 == V1 | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 number of simplifiers = 8
% 6.68/6.91
% 6.68/6.91 Learnt:
% 6.68/6.91 #27: exists( #11, #2 ), references = 6, size of lhs = 4:
% 6.68/6.91 P_true-{F}(V0), P_not-{F}(V1,V2), P_or-{F}(V3,V1,V4), P_or-{F}(V2,V4,V5) | P_axiom-{T}(V5,V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #29: exists( #10, #0 ), references = 3, size of lhs = 3:
% 6.68/6.91 #-{F} V0, #-{F} V1, #-{F} V2 | P_ifeq-{T}(V0,V0,V1,V2,V1)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #32: exists( #15, #30 ), references = 5, size of lhs = 2:
% 6.68/6.91 P_true-{F}(V0), P_axiom-{F}(V1,V0) | P_theorem-{T}(V1,V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #36: exists( #12, #34 ), references = 1, size of lhs = 8:
% 6.68/6.91 P_true-{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_or-{F}(V7,V6,V5) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #38: exists( #12, #35 ), references = 1, size of lhs = 6:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_not-{F}(V4,V3) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #40: exists( #10, #6 ), references = 1, size of lhs = 3:
% 6.68/6.91 P_true-{F}(V0), P_axiom-{F}(V1,V2), P_theorem-{F}(V1,V3) | P_ifeq-{T}(V2,V0,V3,V0,V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #43: exists( #15, #41 ), references = 3, size of lhs = 8:
% 6.68/6.91 P_true-{F}(V0), P_theorem-{F}(V1,V0), P_axiom-{F}(V2,V0), P_not-{F}(V3,V4), P_or-{F}(V4,V5,V1), P_or-{F}(V6,V3,V2), P_not-{F}(V7,V6), P_or-{F}(V6,V5,V8) | P_theorem-{T}(V8,V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #49: exists( #12, #47 ), references = 2, size of lhs = 14:
% 6.68/6.91 P_true-{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,V5,V6), P_axiom-{F}(V7,V0), P_not-{F}(V8,V9), P_not-{F}(V10,V9), P_or-{F}(V11,V10,V7), P_not-{F}(V12,V11), P_or-{F}(V11,V13,V6), P_or-{F}(V14,V8,V13) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #51: exists( #12, #48 ), references = 3, size of lhs = 12:
% 6.68/6.91 P_true-{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_axiom-{F}(V7,V0), P_or-{F}(V3,V8,V7), P_not-{F}(V8,V9), P_not-{F}(V10,V9), P_or-{F}(V11,V10,V5) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #53: exists( #12, #50 ), references = 2, size of lhs = 10:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_not-{F}(V5,V3), P_not-{F}(V4,V6), P_not-{F}(V7,V6), P_or-{F}(V3,V7,V8), P_axiom-{F}(V8,V0) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #57: exists( #11, #1 ), references = 1, size of lhs = 4:
% 6.68/6.91 P_true-{F}(V0), P_or-{F}(V1,V1,V2), P_not-{F}(V2,V3), P_or-{F}(V3,V1,V4) | P_axiom-{T}(V4,V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #58: exists( #11, #4 ), references = 3, size of lhs = 7:
% 6.68/6.91 P_true-{F}(V0), P_not-{F}(V1,V2), P_or-{F}(V3,V4,V1), P_or-{F}(V5,V6,V4), P_or-{F}(V3,V6,V7), P_or-{F}(V5,V7,V8), P_or-{F}(V2,V8,V9) | P_axiom-{T}(V9,V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #63: exists( #12, #59 ), references = 2, size of lhs = 15:
% 6.68/6.91 P_true-{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_not-{F}(V8,V9), P_or-{F}(V10,V8,V5), P_not-{F}(V11,V9), P_or-{F}(V12,V13,V7), P_or-{F}(V14,V15,V13), P_or-{F}(V12,V15,V16), P_or-{F}(V14,V16,V11) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #64: exists( #12, #60 ), references = 1, size of lhs = 15:
% 6.68/6.91 P_true-{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}(V5,V6), P_not-{F}(V7,V6), P_not-{F}(V8,V3), P_or-{F}(V9,V7,V5), P_not-{F}(V10,V3), P_or-{F}(V11,V12,V10), P_or-{F}(V13,V14,V12), P_or-{F}(V11,V14,V15), P_or-{F}(V13,V15,V5) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #71: exists( #12, #65 ), references = 1, size of lhs = 10:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_not-{F}(V5,V3), P_not-{F}(V4,V6), P_not-{F}(V7,V3), P_not-{F}(V8,V6), P_or-{F}(V9,V7,V8) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #74: exists( #12, #72 ), references = 2, size of lhs = 12:
% 6.68/6.91 P_true-{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_theorem-{F}(V7,V0), P_axiom-{F}(V8,V0), P_or-{F}(V3,V9,V8), P_not-{F}(V9,V10), P_or-{F}(V10,V5,V7) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #77: exists( #12, #75 ), references = 3, size of lhs = 12:
% 6.68/6.91 P_true-{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_theorem-{F}(V8,V0), P_or-{F}(V9,V5,V8), P_not-{F}(V10,V9), P_or-{F}(V11,V7,V10) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #80: exists( #12, #78 ), references = 1, size of lhs = 12:
% 6.68/6.91 P_true-{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,V7,V9), P_not-{F}(V9,V10), P_not-{F}(V11,V10), P_or-{F}(V12,V11,V5) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #90: exists( #11, #5 ), references = 1, size of lhs = 9:
% 6.68/6.91 P_true-{F}(V0), P_not-{F}(V1,V2), P_or-{F}(V2,V3,V4), P_not-{F}(V4,V5), P_or-{F}(V6,V1,V7), P_not-{F}(V7,V8), P_or-{F}(V6,V3,V9), P_or-{F}(V8,V9,V10), P_or-{F}(V5,V10,V11) | P_axiom-{T}(V11,V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #91: exists( #11, #3 ), references = 2, size of lhs = 5:
% 6.68/6.91 P_true-{F}(V0), P_not-{F}(V1,V2), P_or-{F}(V3,V4,V1), P_or-{F}(V4,V3,V5), P_or-{F}(V2,V5,V6) | P_axiom-{T}(V6,V0)
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #98: exists( #12, #94 ), references = 1, size of lhs = 17:
% 6.68/6.91 P_true-{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_not-{F}(V8,V9), P_or-{F}(V9,V10,V11), P_not-{F}(V11,V12), P_not-{F}(V13,V12), P_or-{F}(V14,V7,V13), P_or-{F}(V15,V8,V16), P_not-{F}(V16,V17), P_or-{F}(V15,V10,V18), P_or-{F}(V17,V18,V5) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #100: exists( #12, #96 ), references = 1, size of lhs = 15:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_not-{F}(V5,V3), P_not-{F}(V6,V3), P_not-{F}(V7,V2), P_not-{F}(V8,V9), P_or-{F}(V10,V8,V7), P_or-{F}(V10,V11,V4), P_or-{F}(V9,V11,V12), P_not-{F}(V12,V13), P_not-{F}(V14,V13), P_or-{F}(V15,V6,V14) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #102: exists( #12, #63 ), references = 1, size of lhs = 13:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_not-{F}(V5,V3), P_not-{F}(V4,V6), P_not-{F}(V7,V3), P_not-{F}(V8,V6), P_or-{F}(V9,V10,V7), P_or-{F}(V11,V12,V10), P_or-{F}(V9,V12,V13), P_or-{F}(V11,V13,V8) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #106: exists( #12, #104 ), references = 1, size of lhs = 13:
% 6.68/6.91 P_true-{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,V7,V9), P_not-{F}(V9,V10), P_not-{F}(V11,V10), P_or-{F}(V12,V13,V11), P_or-{F}(V13,V12,V5) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #108: exists( #12, #105 ), references = 2, size of lhs = 11:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_not-{F}(V5,V3), P_not-{F}(V6,V3), P_or-{F}(V4,V2,V7), P_not-{F}(V7,V8), P_not-{F}(V9,V8), P_or-{F}(V10,V6,V9) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #111: exists( #13, #108 ), references = 1, size of lhs = 9:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V2,V3), P_q-{F}(V4), P_not-{F}(V5,V3), P_not-{F}(V6,V3), P_or-{F}(V4,V2,V7), P_or-{F}(V8,V6,V7) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #113: exists( #12, #109 ), references = 1, size of lhs = 6:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3), P_not-{F}(V2,V4), P_not-{F}(V5,V4) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #115: exists( #13, #112 ), references = 1, size of lhs = 4:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_q-{F}(V3) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #117: exists( #13, #114 ), references = 1, size of lhs = 3:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1), P_q-{F}(V2) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #119: exists( #17, #116 ), references = 1, size of lhs = 2:
% 6.68/6.91 P_true-{F}(V0), P_p-{F}(V1) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #121: exists( #16, #118 ), references = 1, size of lhs = 1:
% 6.68/6.91 P_true-{F}(V0) | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 #123: exists( #14, #120 ), references = 1, size of lhs = 0:
% 6.68/6.91 FALSE | FALSE
% 6.68/6.91 (used 0 times, uses = {})
% 6.68/6.91
% 6.68/6.91 number of learnt formulas = 32
% 6.68/6.91
% 6.68/6.91
% 6.68/6.91 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.68/6.91
% 6.68/6.91 randbase = 1
%------------------------------------------------------------------------------