%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL007-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n015.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:35 PM UTC 2026
% Result : Unsatisfiable 0.46s 0.73s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 4 17:53:56 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.46/0.73 GeoParameters:
% 0.46/0.73
% 0.46/0.73 tptp_input = 1
% 0.46/0.73 tptp_output = 0
% 0.46/0.73 nonempty = 1
% 0.46/0.73 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.73 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.46/0.73
% 0.46/0.73
% 0.46/0.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.73 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.73
% 0.46/0.73 RuleSystem INPUT:
% 0.46/0.73
% 0.46/0.73 Initial Rules:
% 0.46/0.73 #0: input, references = 5, size of lhs = 3:
% 0.46/0.73 P_equivalent-{F}(V1,V0,V2), is_a_theorem-{F}(V2), is_a_theorem-{F}(V1) | is_a_theorem-{T}(V0)
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #1: input, references = 5, size of lhs = 3:
% 0.46/0.73 P_equivalent-{F}(V0,V1,V2), P_equivalent-{F}(V1,V0,V3), P_equivalent-{F}(V2,V3,V4) | is_a_theorem-{T}(V4)
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #2: input, references = 6, size of lhs = 5:
% 0.46/0.73 P_equivalent-{F}(V0,V1,V3), P_equivalent-{F}(V3,V2,V4), P_equivalent-{F}(V1,V2,V5), P_equivalent-{F}(V0,V5,V6), P_equivalent-{F}(V4,V6,V7) | is_a_theorem-{T}(V7)
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #3: input, references = 7, size of lhs = 9:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_equivalent-{F}(V1,V2,V3), P_equivalent-{F}(V0,V3,V4), P_equivalent-{F}(V0,V1,V5), P_equivalent-{F}(V5,V2,V6), P_equivalent-{F}(V4,V6,V7), is_a_theorem-{F}(V7) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #4: input, references = 18, size of lhs = 2:
% 0.46/0.73 #-{F} V0, #-{F} V1 | EXISTS V2: P_equivalent-{T}(V0,V1,V2)
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #5: input, references = 4, size of lhs = 0:
% 0.46/0.73 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #6: input, references = 4, size of lhs = 0:
% 0.46/0.73 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #7: input, references = 4, size of lhs = 0:
% 0.46/0.73 FALSE | EXISTS V0: P_c-{T}(V0)
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 number of initial rules = 8
% 0.46/0.73
% 0.46/0.73 Simplifiers:
% 0.46/0.73 #8: unsound, references = 3, size of lhs = 3:
% 0.46/0.73 P_equivalent-{F}(V0,V1,V2), P_equivalent-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #9: unsound, references = 3, size of lhs = 3:
% 0.46/0.73 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #10: unsound, references = 3, size of lhs = 3:
% 0.46/0.73 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #11: unsound, references = 3, size of lhs = 3:
% 0.46/0.73 P_c-{F}(V0), P_c-{F}(V1), V0 == V1 | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 number of simplifiers = 4
% 0.46/0.73
% 0.46/0.73 Learnt:
% 0.46/0.73 #14: exists( #4, #12 ), references = 2, size of lhs = 9:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_equivalent-{F}(V1,V2,V3), P_equivalent-{F}(V0,V3,V4), P_equivalent-{F}(V0,V1,V5), P_equivalent-{F}(V5,V2,V6), P_equivalent-{F}(V7,V8,V4), P_equivalent-{F}(V8,V7,V6) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #16: exists( #4, #13 ), references = 2, size of lhs = 7:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_equivalent-{F}(V1,V2,V3), P_equivalent-{F}(V0,V1,V4), P_equivalent-{F}(V4,V2,V5), P_equivalent-{F}(V3,V0,V5) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #19: exists( #4, #16 ), references = 1, size of lhs = 5:
% 0.46/0.73 P_a-{F}(V0), P_c-{F}(V0), P_b-{F}(V1), P_equivalent-{F}(V1,V0,V2), P_equivalent-{F}(V0,V1,V2) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #20: exists( #4, #14 ), references = 1, size of lhs = 7:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_equivalent-{F}(V1,V2,V3), P_equivalent-{F}(V0,V3,V4), P_equivalent-{F}(V0,V1,V5), P_equivalent-{F}(V2,V5,V4) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #22: exists( #4, #17 ), references = 1, size of lhs = 3:
% 0.46/0.73 P_a-{F}(V0), P_c-{F}(V0), P_b-{F}(V0) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #25: exists( #4, #23 ), references = 1, size of lhs = 11:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_equivalent-{F}(V1,V2,V3), P_equivalent-{F}(V0,V3,V4), P_equivalent-{F}(V0,V1,V5), P_equivalent-{F}(V5,V2,V6), P_equivalent-{F}(V7,V8,V4), P_equivalent-{F}(V9,V10,V7), P_equivalent-{F}(V10,V8,V11), P_equivalent-{F}(V9,V11,V6) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #32: exists( #4, #30 ), references = 1, size of lhs = 13:
% 0.46/0.73 is_a_theorem-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_equivalent-{F}(V2,V3,V4), P_equivalent-{F}(V1,V4,V5), P_equivalent-{F}(V1,V2,V6), P_equivalent-{F}(V6,V3,V7), P_equivalent-{F}(V5,V7,V8), P_equivalent-{F}(V9,V10,V0), P_equivalent-{F}(V11,V12,V9), P_equivalent-{F}(V12,V10,V13), P_equivalent-{F}(V11,V13,V8) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #34: exists( #4, #31 ), references = 1, size of lhs = 13:
% 0.46/0.73 is_a_theorem-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_equivalent-{F}(V2,V3,V4), P_equivalent-{F}(V1,V4,V5), P_equivalent-{F}(V1,V2,V6), P_equivalent-{F}(V6,V3,V7), P_equivalent-{F}(V5,V7,V8), P_equivalent-{F}(V9,V10,V0), P_equivalent-{F}(V11,V12,V9), P_equivalent-{F}(V12,V10,V13), P_equivalent-{F}(V11,V13,V8) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #56: exists( #4, #50 ), references = 1, size of lhs = 11:
% 0.46/0.73 is_a_theorem-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_equivalent-{F}(V2,V3,V4), P_equivalent-{F}(V1,V4,V5), P_equivalent-{F}(V1,V2,V6), P_equivalent-{F}(V6,V3,V7), P_equivalent-{F}(V5,V7,V8), P_equivalent-{F}(V9,V10,V0), P_equivalent-{F}(V10,V9,V8) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #58: exists( #4, #53 ), references = 2, size of lhs = 9:
% 0.46/0.73 is_a_theorem-{F}(V0), P_a-{F}(V1), P_b-{F}(V2), P_c-{F}(V3), P_equivalent-{F}(V2,V3,V4), P_equivalent-{F}(V1,V4,V5), P_equivalent-{F}(V1,V2,V6), P_equivalent-{F}(V6,V3,V7), P_equivalent-{F}(V7,V5,V0) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #61: exists( #4, #59 ), references = 1, size of lhs = 11:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_equivalent-{F}(V1,V2,V3), P_equivalent-{F}(V0,V3,V4), P_equivalent-{F}(V0,V1,V5), P_equivalent-{F}(V5,V2,V6), P_equivalent-{F}(V7,V8,V6), P_equivalent-{F}(V9,V10,V7), P_equivalent-{F}(V10,V8,V11), P_equivalent-{F}(V9,V11,V4) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #63: exists( #4, #60 ), references = 2, size of lhs = 9:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_equivalent-{F}(V1,V2,V3), P_equivalent-{F}(V0,V1,V4), P_equivalent-{F}(V4,V2,V5), P_equivalent-{F}(V0,V6,V7), P_equivalent-{F}(V7,V8,V5), P_equivalent-{F}(V6,V8,V3) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #65: exists( #4, #62 ), references = 1, size of lhs = 4:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_equivalent-{F}(V0,V1,V1), P_c-{F}(V2) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #68: mergings( V4 == V6; #66 ), references = 1, size of lhs = 5:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_equivalent-{F}(V0,V1,V3), P_equivalent-{F}(V3,V2,V4) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #70: exists( #4, #66 ), references = 1, size of lhs = 4:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2), P_equivalent-{F}(V0,V1,V3) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #72: exists( #4, #69 ), references = 1, size of lhs = 3:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1), P_c-{F}(V2) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #74: exists( #7, #71 ), references = 1, size of lhs = 2:
% 0.46/0.73 P_a-{F}(V0), P_b-{F}(V1) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #76: exists( #6, #73 ), references = 1, size of lhs = 1:
% 0.46/0.73 P_a-{F}(V0) | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 #78: exists( #5, #75 ), references = 1, size of lhs = 0:
% 0.46/0.73 FALSE | FALSE
% 0.46/0.73 (used 0 times, uses = {})
% 0.46/0.73
% 0.46/0.73 number of learnt formulas = 19
% 0.46/0.73
% 0.46/0.73
% 0.46/0.73 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.73
% 0.46/0.73 randbase = 1
%------------------------------------------------------------------------------