%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL171-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n001.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:48 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.45s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL171-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 4 22:18:00 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.15/0.45 GeoParameters:
% 0.15/0.45
% 0.15/0.45 tptp_input = 1
% 0.15/0.45 tptp_output = 0
% 0.15/0.45 nonempty = 1
% 0.15/0.45 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.45 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.15/0.45
% 0.15/0.45
% 0.15/0.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.45 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.45
% 0.15/0.45 RuleSystem INPUT:
% 0.15/0.45
% 0.15/0.45 Initial Rules:
% 0.15/0.45 #0: input, references = 3, size of lhs = 2:
% 0.15/0.45 P_or-{F}(V0,V0,V1), P_implies-{F}(V1,V0,V2) | axiom-{T}(V2)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #1: input, references = 3, size of lhs = 2:
% 0.15/0.45 P_or-{F}(V1,V0,V2), P_implies-{F}(V0,V2,V3) | axiom-{T}(V3)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #2: input, references = 4, size of lhs = 3:
% 0.15/0.45 P_or-{F}(V0,V1,V2), P_or-{F}(V1,V0,V3), P_implies-{F}(V2,V3,V4) | axiom-{T}(V4)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #3: input, references = 3, size of lhs = 5:
% 0.15/0.45 P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_or-{F}(V0,V2,V5), P_or-{F}(V1,V5,V6), P_implies-{F}(V4,V6,V7) | axiom-{T}(V7)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #4: input, references = 3, size of lhs = 5:
% 0.15/0.45 P_implies-{F}(V0,V1,V3), P_or-{F}(V2,V0,V4), P_or-{F}(V2,V1,V5), P_implies-{F}(V4,V5,V6), P_implies-{F}(V3,V6,V7) | axiom-{T}(V7)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #5: input, references = 5, size of lhs = 4:
% 0.15/0.45 P_implies-{F}(V0,V1,V2), P_not-{F}(V0,V3), P_or-{F}(V3,V1,V4), V2 == V4 | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #6: input, references = 4, size of lhs = 1:
% 0.15/0.45 axiom-{F}(V0) | theorem-{T}(V0)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #7: input, references = 3, size of lhs = 3:
% 0.15/0.45 theorem-{F}(V0), P_implies-{F}(V0,V1,V2), theorem-{F}(V2) | theorem-{T}(V1)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #8: input, references = 4, size of lhs = 8:
% 0.15/0.45 P_p-{F}(V0), P_q-{F}(V1), P_not-{F}(V1,V2), P_implies-{F}(V0,V2,V3), P_not-{F}(V0,V4), P_implies-{F}(V1,V4,V5), P_implies-{F}(V3,V5,V6), theorem-{F}(V6) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #9: input, references = 8, size of lhs = 2:
% 0.15/0.45 #-{F} V0, #-{F} V1 | EXISTS V2: P_implies-{T}(V0,V1,V2)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #10: input, references = 4, size of lhs = 2:
% 0.15/0.45 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #11: input, references = 6, size of lhs = 1:
% 0.15/0.45 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #12: input, references = 4, size of lhs = 0:
% 0.15/0.45 FALSE | EXISTS V0: P_p-{T}(V0)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #13: input, references = 4, size of lhs = 0:
% 0.15/0.45 FALSE | EXISTS V0: P_q-{T}(V0)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 number of initial rules = 14
% 0.15/0.45
% 0.15/0.45 Simplifiers:
% 0.15/0.45 #14: unsound, references = 3, size of lhs = 3:
% 0.15/0.45 P_implies-{F}(V0,V1,V2), P_implies-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #15: unsound, references = 3, size of lhs = 3:
% 0.15/0.45 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #16: unsound, references = 3, size of lhs = 3:
% 0.15/0.45 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #17: unsound, references = 3, size of lhs = 3:
% 0.15/0.45 P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #18: unsound, references = 3, size of lhs = 3:
% 0.15/0.45 P_q-{F}(V0), P_q-{F}(V1), V0 == V1 | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 number of simplifiers = 5
% 0.15/0.45
% 0.15/0.45 Learnt:
% 0.15/0.45 #20: exists( #9, #5 ), references = 3, size of lhs = 2:
% 0.15/0.45 P_not-{F}(V0,V1), P_or-{F}(V1,V2,V3) | P_implies-{T}(V0,V2,V3)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #23: exists( #10, #5 ), references = 5, size of lhs = 2:
% 0.15/0.45 P_not-{F}(V0,V1), P_implies-{F}(V0,V2,V3) | P_or-{T}(V1,V2,V3)
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #27: exists( #9, #25 ), references = 4, size of lhs = 8:
% 0.15/0.45 P_p-{F}(V0), P_q-{F}(V1), P_not-{F}(V1,V2), P_implies-{F}(V0,V2,V3), P_not-{F}(V0,V4), P_implies-{F}(V1,V4,V5), P_or-{F}(V6,V7,V3), P_or-{F}(V7,V6,V5) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #31: exists( #9, #29 ), references = 1, size of lhs = 3:
% 0.15/0.45 P_p-{F}(V0), P_q-{F}(V0), P_not-{F}(V0,V1) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #33: exists( #11, #30 ), references = 1, size of lhs = 2:
% 0.15/0.45 P_p-{F}(V0), P_q-{F}(V0) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #37: mergings( V4 == V6; #35 ), references = 2, size of lhs = 6:
% 0.15/0.45 P_p-{F}(V0), P_q-{F}(V1), P_not-{F}(V0,V2), P_not-{F}(V1,V3), P_implies-{F}(V0,V3,V4), P_or-{F}(V2,V3,V4) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #46: exists( #9, #42 ), references = 1, size of lhs = 4:
% 0.15/0.45 P_p-{F}(V0), P_q-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V0,V2) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #47: exists( #9, #41 ), references = 1, size of lhs = 5:
% 0.15/0.45 P_p-{F}(V0), P_q-{F}(V1), P_not-{F}(V0,V2), P_not-{F}(V3,V2), P_not-{F}(V1,V4) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #49: exists( #11, #44 ), references = 1, size of lhs = 4:
% 0.15/0.45 P_p-{F}(V0), P_q-{F}(V1), P_not-{F}(V0,V2), P_not-{F}(V3,V2) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #51: exists( #11, #48 ), references = 1, size of lhs = 2:
% 0.15/0.45 P_p-{F}(V0), P_q-{F}(V1) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #53: exists( #13, #50 ), references = 1, size of lhs = 1:
% 0.15/0.45 P_p-{F}(V0) | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 #55: exists( #12, #52 ), references = 1, size of lhs = 0:
% 0.15/0.45 FALSE | FALSE
% 0.15/0.45 (used 0 times, uses = {})
% 0.15/0.45
% 0.15/0.45 number of learnt formulas = 12
% 0.15/0.45
% 0.15/0.45
% 0.15/0.45 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.45
% 0.15/0.45 randbase = 1
%------------------------------------------------------------------------------