%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n014.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:46 PM UTC 2026
% Result : Unsatisfiable 1.05s 1.32s
% Output : Refutation 1.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.09/0.35 % Computer : n014.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 00:25:12 UTC 2026
% 0.09/0.35 % CPUTime :
% 1.05/1.32 GeoParameters:
% 1.05/1.32
% 1.05/1.32 tptp_input = 1
% 1.05/1.32 tptp_output = 0
% 1.05/1.32 nonempty = 1
% 1.05/1.32 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.05/1.32 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 1.05/1.32
% 1.05/1.32
% 1.05/1.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.05/1.32 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.05/1.32
% 1.05/1.32 RuleSystem INPUT:
% 1.05/1.32
% 1.05/1.32 Initial Rules:
% 1.05/1.32 #0: input, references = 4, size of lhs = 3:
% 1.05/1.32 P_truth-{F}(V0), P_implies-{F}(V0,V1,V2), V2 == V1 | FALSE
% 1.05/1.32 (used 0 times, uses = {})
% 1.05/1.32
% 1.05/1.32 #1: input, references = 5, size of lhs = 7:
% 1.05/1.32 P_truth-{F}(V0), P_implies-{F}(V1,V2,V4), P_implies-{F}(V2,V3,V5), P_implies-{F}(V1,V3,V6), P_implies-{F}(V5,V6,V7), P_implies-{F}(V4,V7,V8), V8 == V0 | FALSE
% 1.05/1.32 (used 0 times, uses = {})
% 1.05/1.32
% 1.05/1.32 #2: input, references = 5, size of lhs = 6:
% 1.05/1.32 P_truth-{F}(V0), P_implies-{F}(V1,V2,V3), P_implies-{F}(V3,V2,V4), P_implies-{F}(V2,V1,V5), P_implies-{F}(V5,V1,V6), V4 == V6 | FALSE
% 1.05/1.32 (used 0 times, uses = {})
% 1.05/1.32
% 1.05/1.32 #3: input, references = 4, size of lhs = 7:
% 1.05/1.32 P_truth-{F}(V0), P_not-{F}(V1,V3), P_not-{F}(V2,V4), P_implies-{F}(V3,V4,V5), P_implies-{F}(V2,V1,V6), P_implies-{F}(V5,V6,V7), V7 == V0 | FALSE
% 1.05/1.32 (used 0 times, uses = {})
% 1.05/1.32
% 1.05/1.32 #4: input, references = 5, size of lhs = 5:
% 1.05/1.32 P_truth-{F}(V0), P_or-{F}(V1,V2,V3), P_not-{F}(V1,V4), P_implies-{F}(V4,V2,V5), V3 == V5 | FALSE
% 1.05/1.32 (used 0 times, uses = {})
% 1.05/1.32
% 1.05/1.32 #5: input, references = 4, size of lhs = 6:
% 1.05/1.32 P_truth-{F}(V0), P_or-{F}(V1,V2,V4), P_or-{F}(V4,V3,V5), P_or-{F}(V2,V3,V6), P_or-{F}(V1,V6,V7), V5 == V7 | FALSE
% 1.05/1.32 (used 0 times, uses = {})
% 1.05/1.32
% 1.05/1.32 #6: input, references = 4, size of lhs = 4:
% 1.05/1.32 P_truth-{F}(V0), P_or-{F}(V1,V2,V3), P_or-{F}(V2,V1,V4), V3 == V4 | FALSE
% 1.05/1.32 (used 0 times, uses = {})
% 1.05/1.32
% 1.05/1.32 #7: input, references = 5, size of lhs = 7:
% 1.05/1.32 P_truth-{F}(V0), P_and-{F}(V1,V2,V3), P_not-{F}(V1,V4), P_not-{F}(V2,V5), P_or-{F}(V4,V5,V6), P_not-{F}(V6,V7), V3 == V7 | FALSE
% 1.05/1.32 (used 0 times, uses = {})
% 1.05/1.32
% 1.05/1.32 #8: input, references = 4, size of lhs = 6:
% 1.05/1.32 P_truth-{F}(V0), P_and-{F}(V1,V2,V4), P_and-{F}(V4,V3,V5), P_and-{F}(V2,V3,V6), P_and-{F}(V1,V6,V7), V5 == V7 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #9: input, references = 4, size of lhs = 4:
% 1.05/1.33 P_truth-{F}(V0), P_and-{F}(V1,V2,V3), P_and-{F}(V2,V1,V4), V3 == V4 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #10: input, references = 6, size of lhs = 8:
% 1.05/1.33 P_truth-{F}(V0), P_xor-{F}(V1,V2,V3), P_not-{F}(V2,V4), P_and-{F}(V1,V4,V5), P_not-{F}(V1,V6), P_and-{F}(V6,V2,V7), P_or-{F}(V5,V7,V8), V3 == V8 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #11: input, references = 4, size of lhs = 4:
% 1.05/1.33 P_truth-{F}(V0), P_xor-{F}(V1,V2,V3), P_xor-{F}(V2,V1,V4), V3 == V4 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #12: input, references = 4, size of lhs = 7:
% 1.05/1.33 P_truth-{F}(V0), P_and_star-{F}(V1,V2,V3), P_not-{F}(V1,V4), P_not-{F}(V2,V5), P_or-{F}(V4,V5,V6), P_not-{F}(V6,V7), V3 == V7 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #13: input, references = 3, size of lhs = 6:
% 1.05/1.33 P_truth-{F}(V0), P_and_star-{F}(V1,V2,V4), P_and_star-{F}(V4,V3,V5), P_and_star-{F}(V2,V3,V6), P_and_star-{F}(V1,V6,V7), V5 == V7 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #14: input, references = 4, size of lhs = 4:
% 1.05/1.33 P_truth-{F}(V0), P_and_star-{F}(V1,V2,V3), P_and_star-{F}(V2,V1,V4), V3 == V4 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #15: input, references = 4, size of lhs = 4:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V0,V1), P_falsehood-{F}(V2), V1 == V2 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #16: input, references = 4, size of lhs = 5:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V0,V1), P_falsehood-{F}(V2), P_x-{F}(V3), P_xor-{F}(V3,V2,V3) | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #17: input, references = 7, size of lhs = 2:
% 1.05/1.33 #-{F} V0, #-{F} V1 | EXISTS V2: P_implies-{T}(V0,V1,V2)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #18: input, references = 4, size of lhs = 0:
% 1.05/1.33 FALSE | EXISTS V0: P_truth-{T}(V0)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #19: input, references = 11, size of lhs = 1:
% 1.05/1.33 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #20: input, references = 6, size of lhs = 2:
% 1.05/1.33 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #21: input, references = 6, size of lhs = 2:
% 1.05/1.33 #-{F} V0, #-{F} V1 | EXISTS V2: P_and-{T}(V0,V1,V2)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #22: input, references = 6, size of lhs = 2:
% 1.05/1.33 #-{F} V0, #-{F} V1 | EXISTS V2: P_xor-{T}(V0,V1,V2)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #23: input, references = 5, size of lhs = 2:
% 1.05/1.33 #-{F} V0, #-{F} V1 | EXISTS V2: P_and_star-{T}(V0,V1,V2)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #24: input, references = 4, size of lhs = 0:
% 1.05/1.33 FALSE | EXISTS V0: P_falsehood-{T}(V0)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #25: input, references = 4, size of lhs = 0:
% 1.05/1.33 FALSE | EXISTS V0: P_x-{T}(V0)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 number of initial rules = 26
% 1.05/1.33
% 1.05/1.33 Simplifiers:
% 1.05/1.33 #26: unsound, references = 3, size of lhs = 3:
% 1.05/1.33 P_implies-{F}(V0,V1,V2), P_implies-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #27: unsound, references = 3, size of lhs = 3:
% 1.05/1.33 P_truth-{F}(V0), P_truth-{F}(V1), V0 == V1 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #28: unsound, references = 3, size of lhs = 3:
% 1.05/1.33 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #29: unsound, references = 3, size of lhs = 3:
% 1.05/1.33 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #30: unsound, references = 3, size of lhs = 3:
% 1.05/1.33 P_and-{F}(V0,V1,V2), P_and-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #31: unsound, references = 3, size of lhs = 3:
% 1.05/1.33 P_xor-{F}(V0,V1,V2), P_xor-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #32: unsound, references = 3, size of lhs = 3:
% 1.05/1.33 P_and_star-{F}(V0,V1,V2), P_and_star-{F}(V0,V1,V5), V2 == V5 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #33: unsound, references = 3, size of lhs = 3:
% 1.05/1.33 P_falsehood-{F}(V0), P_falsehood-{F}(V1), V0 == V1 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #34: unsound, references = 3, size of lhs = 3:
% 1.05/1.33 P_x-{F}(V0), P_x-{F}(V1), V0 == V1 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 number of simplifiers = 9
% 1.05/1.33
% 1.05/1.33 Learnt:
% 1.05/1.33 #36: exists( #17, #0 ), references = 9, size of lhs = 2:
% 1.05/1.33 P_truth-{F}(V0), #-{F} V1 | P_implies-{T}(V0,V1,V1)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #38: exists( #19, #15 ), references = 2, size of lhs = 2:
% 1.05/1.33 P_truth-{F}(V0), P_falsehood-{F}(V1) | P_not-{T}(V0,V1)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #40: exists( #21, #7 ), references = 5, size of lhs = 5:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V1,V2), P_not-{F}(V3,V4), P_or-{F}(V2,V4,V5), P_not-{F}(V5,V6) | P_and-{T}(V1,V3,V6)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #43: exists( #20, #4 ), references = 6, size of lhs = 3:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V1,V2), P_implies-{F}(V2,V3,V4) | P_or-{T}(V1,V3,V4)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #44: exists( #20, #10 ), references = 1, size of lhs = 6:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V1,V2), P_xor-{F}(V3,V1,V4), P_and-{F}(V3,V2,V5), P_not-{F}(V3,V6), P_and-{F}(V6,V1,V7) | P_or-{T}(V5,V7,V4)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #46: exists( #20, #6 ), references = 7, size of lhs = 2:
% 1.05/1.33 P_truth-{F}(V0), P_or-{F}(V1,V2,V3) | P_or-{T}(V2,V1,V3)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #50: mergings( V3 == V4; #48 ), references = 5, size of lhs = 4:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V1,V2,V0), P_implies-{F}(V2,V3,V4), P_implies-{F}(V1,V3,V5) | P_implies-{T}(V4,V5,V0)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #52: exists( #17, #4 ), references = 6, size of lhs = 3:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V1,V2), P_or-{F}(V1,V3,V4) | P_implies-{T}(V2,V3,V4)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #55: exists( #17, #2 ), references = 1, size of lhs = 4:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V1,V2,V3), P_implies-{F}(V3,V2,V4), P_implies-{F}(V2,V1,V5) | P_implies-{T}(V5,V1,V4)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #69: mergings( V2 == V3, V3 == V4, V4 == V5; #64 ), references = 2, size of lhs = 4:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0), P_or-{F}(V1,V0,V2), V2 == V0 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #81: exists( #20, #69 ), references = 3, size of lhs = 3:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0), #-{F} V1 | P_or-{T}(V1,V0,V0)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #82: exists( #20, #5 ), references = 1, size of lhs = 4:
% 1.05/1.33 P_truth-{F}(V0), P_or-{F}(V1,V2,V3), P_or-{F}(V3,V4,V5), P_or-{F}(V2,V4,V6) | P_or-{T}(V1,V6,V5)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #86: exists( #23, #12 ), references = 1, size of lhs = 5:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V1,V2), P_not-{F}(V3,V4), P_or-{F}(V2,V4,V5), P_not-{F}(V5,V6) | P_and_star-{T}(V1,V3,V6)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #88: exists( #22, #11 ), references = 1, size of lhs = 2:
% 1.05/1.33 P_truth-{F}(V0), P_xor-{F}(V1,V2,V3) | P_xor-{T}(V2,V1,V3)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #90: exists( #19, #7 ), references = 3, size of lhs = 5:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V1,V2), P_and-{F}(V1,V3,V4), P_not-{F}(V3,V5), P_or-{F}(V2,V5,V6) | P_not-{T}(V6,V4)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #109: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #103 ), references = 2, size of lhs = 8:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0), P_not-{F}(V0,V1), P_not-{F}(V2,V3), P_not-{F}(V4,V5), P_or-{F}(V3,V5,V6), P_or-{F}(V6,V1,V7), P_implies-{F}(V7,V1,V8) | P_and-{T}(V2,V4,V8)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #111: exists( #22, #10 ), references = 2, size of lhs = 6:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V1,V2), P_and-{F}(V3,V2,V4), P_not-{F}(V3,V5), P_and-{F}(V5,V1,V6), P_or-{F}(V4,V6,V7) | P_xor-{T}(V3,V1,V7)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #121: exists( #23, #14 ), references = 1, size of lhs = 2:
% 1.05/1.33 P_truth-{F}(V0), P_and_star-{F}(V1,V2,V3) | P_and_star-{T}(V2,V1,V3)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #138: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V9 == V10; #130 ), references = 1, size of lhs = 8:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0), P_not-{F}(V0,V1), P_or-{F}(V1,V1,V2), P_not-{F}(V3,V4), P_not-{F}(V5,V4), P_xor-{F}(V3,V5,V6), V6 == V2 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #147: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V10 == V11; #139 ), references = 1, size of lhs = 6:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0), P_not-{F}(V0,V1), P_or-{F}(V1,V1,V2), P_not-{F}(V3,V4), P_not-{F}(V5,V4) | P_xor-{T}(V3,V5,V2)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #164: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #158 ), references = 1, size of lhs = 8:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0), P_not-{F}(V0,V1), P_not-{F}(V2,V3), P_and-{F}(V2,V4,V5), P_and-{F}(V4,V6,V3), P_and-{F}(V5,V6,V7), V7 == V1 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #166: exists( #21, #9 ), references = 3, size of lhs = 2:
% 1.05/1.33 P_truth-{F}(V0), P_and-{F}(V1,V2,V3) | P_and-{T}(V2,V1,V3)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #177: mergings( V2 == V3; #174 ), references = 2, size of lhs = 6:
% 1.05/1.33 P_truth-{F}(V0), P_not-{F}(V1,V2), P_or-{F}(V3,V2,V4), P_implies-{F}(V1,V3,V5), P_implies-{F}(V4,V5,V6), V6 == V0 | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #189: mergings( V2 == V3, V3 == V4, V4 == V5; #185 ), references = 1, size of lhs = 3:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0), P_not-{F}(V0,V1) | P_not-{T}(V1,V0)
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #213: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V8, V8 == V9, V9 == V10, V10 == V11, V11 == V12, V12 == V13, V7 == V14, V16 == V17; #200 ), references = 2, size of lhs = 12:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0), P_not-{F}(V0,V1), P_not-{F}(V1,V0), P_falsehood-{F}(V2), P_not-{F}(V2,V3), P_not-{F}(V3,V1), P_x-{F}(V4), P_or-{F}(V4,V1,V5), P_or-{F}(V3,V5,V6), P_not-{F}(V6,V7), P_or-{F}(V5,V7,V4) | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #225: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6; #219 ), references = 1, size of lhs = 6:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0), P_not-{F}(V0,V1), P_not-{F}(V1,V0), P_falsehood-{F}(V2), P_not-{F}(V2,V0) | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #234: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6; #228 ), references = 1, size of lhs = 2:
% 1.05/1.33 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0) | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 #237: exists( #18, #235 ), references = 1, size of lhs = 0:
% 1.05/1.33 FALSE | FALSE
% 1.05/1.33 (used 0 times, uses = {})
% 1.05/1.33
% 1.05/1.33 number of learnt formulas = 28
% 1.05/1.33
% 1.05/1.33
% 1.05/1.33 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.05/1.33
% 1.05/1.33 randbase = 1
%------------------------------------------------------------------------------