%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n004.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 : Tue May 5 07:01:17 PM UTC 2026
% Result : Unsatisfiable 0.40s 0.58s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.18/0.33 % Computer : n004.cluster.edu
% 0.18/0.33 % Model : x86_64 x86_64
% 0.18/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.33 % Memory : 8042.1875MB
% 0.18/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.33 % CPULimit : 300
% 0.18/0.33 % WCLimit : 300
% 0.18/0.33 % DateTime : Tue May 5 13:06:47 EDT 2026
% 0.18/0.33 % CPUTime :
% 0.40/0.58 GeoParameters:
% 0.40/0.58
% 0.40/0.58 tptp_input = 1
% 0.40/0.58 tptp_output = 0
% 0.40/0.58 nonempty = 1
% 0.40/0.58 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.58 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.40/0.58
% 0.40/0.58
% 0.40/0.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.58 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.58
% 0.40/0.58 RuleSystem INPUT:
% 0.40/0.58
% 0.40/0.58 Initial Rules:
% 0.40/0.58 #0: input, references = 4, size of lhs = 4:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_aux-{F}(V2,V0,V3), V3 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #1: input, references = 4, size of lhs = 4:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_aux-{F}(V2,V1,V3), V3 == V0 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #2: input, references = 4, size of lhs = 5:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), V3 == V2 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #3: input, references = 4, size of lhs = 7:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_cons-{F}(V4,V5,V6), P_h-{F}(V6,V7), V7 == V5 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #4: input, references = 4, size of lhs = 6:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), V4 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #5: input, references = 4, size of lhs = 7:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), V5 == V0 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #6: input, references = 4, size of lhs = 8:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), V6 == V0 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #7: input, references = 4, size of lhs = 12:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_cons-{F}(V8,V7,V9), P_f-{F}(V9,V10), P_f-{F}(V7,V11), P_aux-{F}(V7,V11,V12), V10 == V12 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #8: input, references = 5, size of lhs = 11:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_prop1-{F}(V7,V8), P_f-{F}(V7,V9), P_eq-{F}(V9,V1,V10), V8 == V10 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #9: input, references = 5, size of lhs = 9:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_eq-{F}(V1,V0,V7), V7 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #10: input, references = 5, size of lhs = 10:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_eq-{F}(V1,V0,V7), P_eq-{F}(V0,V1,V8), V8 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #11: input, references = 5, size of lhs = 11:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_eq-{F}(V1,V0,V7), P_eq-{F}(V0,V1,V8), P_eq-{F}(V9,V9,V10), V10 == V0 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #12: input, references = 5, size of lhs = 11:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_eq-{F}(V1,V0,V7), P_eq-{F}(V0,V1,V8), P_prop1-{F}(V9,V10), P_eq-{F}(V10,V1,V0) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #13: input, references = 4, size of lhs = 2:
% 0.40/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_aux-{T}(V0,V1,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #14: input, references = 4, size of lhs = 0:
% 0.40/0.58 FALSE | EXISTS V0: P_btrue-{T}(V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #15: input, references = 4, size of lhs = 0:
% 0.40/0.58 FALSE | EXISTS V0: P_bfalse-{T}(V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #16: input, references = 6, size of lhs = 1:
% 0.40/0.58 #-{F} V0 | EXISTS V1: P_h-{T}(V0,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #17: input, references = 5, size of lhs = 0:
% 0.40/0.58 FALSE | EXISTS V0: P_nil-{T}(V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #18: input, references = 3, size of lhs = 2:
% 0.40/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_cons-{T}(V0,V1,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #19: input, references = 5, size of lhs = 1:
% 0.40/0.58 #-{F} V0 | EXISTS V1: P_g-{T}(V0,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #20: input, references = 5, size of lhs = 1:
% 0.40/0.58 #-{F} V0 | EXISTS V1: P_f-{T}(V0,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #21: input, references = 7, size of lhs = 1:
% 0.40/0.58 #-{F} V0 | EXISTS V1: P_prop1-{T}(V0,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #22: input, references = 7, size of lhs = 2:
% 0.40/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_eq-{T}(V0,V1,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 number of initial rules = 23
% 0.40/0.58
% 0.40/0.58 Simplifiers:
% 0.40/0.58 #23: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_aux-{F}(V0,V1,V2), P_aux-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #24: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_btrue-{F}(V0), P_btrue-{F}(V1), V0 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #25: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_bfalse-{F}(V0), P_bfalse-{F}(V1), V0 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #26: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_h-{F}(V0,V1), P_h-{F}(V0,V3), V1 == V3 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #27: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_nil-{F}(V0), P_nil-{F}(V1), V0 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #28: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_cons-{F}(V0,V1,V2), P_cons-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #29: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_g-{F}(V0,V1), P_g-{F}(V0,V3), V1 == V3 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #30: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_f-{F}(V0,V1), P_f-{F}(V0,V3), V1 == V3 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #31: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_prop1-{F}(V0,V1), P_prop1-{F}(V0,V3), V1 == V3 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #32: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_eq-{F}(V0,V1,V2), P_eq-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 number of simplifiers = 10
% 0.40/0.58
% 0.40/0.58 Learnt:
% 0.40/0.58 #34: exists( #16, #3 ), references = 2, size of lhs = 6:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V3,V4), P_cons-{F}(V5,V6,V3), V4 == V6 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #36: exists( #16, #2 ), references = 3, size of lhs = 3:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2) | P_h-{T}(V2,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #38: exists( #20, #6 ), references = 3, size of lhs = 6:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5) | P_f-{T}(V2,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #42: exists( #13, #0 ), references = 1, size of lhs = 3:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), #-{F} V2 | P_aux-{T}(V2,V0,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #43: exists( #13, #1 ), references = 1, size of lhs = 3:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), #-{F} V2 | P_aux-{T}(V2,V1,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #46: exists( #19, #4 ), references = 2, size of lhs = 4:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3) | P_g-{T}(V0,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #48: exists( #22, #8 ), references = 8, size of lhs = 9:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_prop1-{F}(V7,V8), P_f-{F}(V7,V9) | P_eq-{T}(V9,V1,V8)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #62: mergings( V2 == V7, V3 == V9, V4 == V10, V5 == V8, V8 == V11, V11 == V12, V6 == V13; #52 ), references = 1, size of lhs = 7:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V0), P_f-{F}(V1,V0), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_f-{F}(V2,V5) | P_prop1-{T}(V1,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #70: mergings( V2 == V7, V3 == V9, V4 == V10, V5 == V8, V8 == V11, V11 == V12, V6 == V13; #53 ), references = 1, size of lhs = 7:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V0), P_f-{F}(V1,V0), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_f-{F}(V2,V5) | P_prop1-{T}(V1,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #79: mergings( V2 == V3, V3 == V9, V4 == V10, V5 == V11, V6 == V7, V7 == V12, V12 == V13, V8 == V14; #54 ), references = 1, size of lhs = 7:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V0), P_f-{F}(V1,V0), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_f-{F}(V2,V5) | P_prop1-{T}(V1,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #89: mergings( V1 == V4, V2 == V3, V3 == V4; #85 ), references = 1, size of lhs = 2:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V0) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #92: exists( #16, #34 ), references = 1, size of lhs = 4:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_cons-{F}(V3,V4,V5) | P_h-{T}(V5,V4)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #95: exists( #19, #5 ), references = 1, size of lhs = 5:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4) | P_g-{T}(V1,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #97: exists( #20, #7 ), references = 1, size of lhs = 10:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_f-{F}(V7,V8), P_aux-{F}(V7,V8,V9), P_cons-{F}(V10,V7,V11) | P_f-{T}(V11,V9)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #99: exists( #21, #8 ), references = 1, size of lhs = 9:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_f-{F}(V7,V8), P_eq-{F}(V8,V1,V9) | P_prop1-{T}(V7,V9)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #102: exists( #22, #10 ), references = 1, size of lhs = 9:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_eq-{F}(V0,V1,V7), V7 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #103: exists( #22, #11 ), references = 3, size of lhs = 10:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_eq-{F}(V0,V1,V7), P_eq-{F}(V8,V8,V9), V9 == V0 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #114: mergings( V2 == V7, V3 == V10, V4 == V11, V5 == V12, V9 == V13, V6 == V14; #106 ), references = 1, size of lhs = 8:
% 0.40/0.58 P_btrue-{F}(V0), P_f-{F}(V1,V0), P_bfalse-{F}(V2), P_nil-{F}(V3), P_h-{F}(V3,V4), P_g-{F}(V0,V5), P_g-{F}(V2,V6), P_f-{F}(V3,V7) | P_prop1-{T}(V1,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #124: mergings( V2 == V9, V3 == V10, V4 == V11, V5 == V12, V6 == V13, V7 == V14, V8 == V15; #116 ), references = 1, size of lhs = 9:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_f-{F}(V2,V1), P_nil-{F}(V3), P_h-{F}(V3,V4), P_g-{F}(V0,V5), P_g-{F}(V1,V6), P_f-{F}(V3,V7), P_eq-{F}(V0,V1,V8) | P_prop1-{T}(V2,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #126: exists( #22, #103 ), references = 2, size of lhs = 9:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_eq-{F}(V0,V1,V7), #-{F} V8 | P_eq-{T}(V8,V8,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #129: exists( #22, #12 ), references = 1, size of lhs = 10:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6), P_eq-{F}(V0,V1,V7), P_eq-{F}(V8,V1,V0), P_prop1-{F}(V9,V8) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #130: exists( #22, #9 ), references = 1, size of lhs = 7:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1), P_nil-{F}(V2), P_h-{F}(V2,V3), P_g-{F}(V0,V4), P_g-{F}(V1,V5), P_f-{F}(V2,V6) | P_eq-{T}(V1,V0,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #142: mergings( V1 == V4, V2 == V3, V3 == V5; #138 ), references = 1, size of lhs = 2:
% 0.40/0.58 P_btrue-{F}(V0), P_bfalse-{F}(V1) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #145: mergings( V1 == V2; #143 ), references = 1, size of lhs = 1:
% 0.40/0.58 P_btrue-{F}(V0) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #147: exists( #14, #143 ), references = 1, size of lhs = 0:
% 0.40/0.58 FALSE | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 number of learnt formulas = 25
% 0.40/0.58
% 0.40/0.58
% 0.40/0.58 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.58
% 0.40/0.58 randbase = 1
%------------------------------------------------------------------------------