%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL132-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n013.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:44 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.37s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL132-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.10/0.36 % Computer : n013.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.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 4 20:17:20 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 GeoParameters:
% 0.10/0.37
% 0.10/0.37 tptp_input = 1
% 0.10/0.37 tptp_output = 0
% 0.10/0.37 nonempty = 1
% 0.10/0.37 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37
% 0.10/0.37 RuleSystem INPUT:
% 0.10/0.37
% 0.10/0.37 Initial Rules:
% 0.10/0.37 #0: input, references = 5, size of lhs = 3:
% 0.10/0.37 P_truth-{F}(V0), P_implies-{F}(V0,V1,V2), V2 == V1 | FALSE
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #1: input, references = 5, size of lhs = 7:
% 0.10/0.37 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
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #2: input, references = 3, size of lhs = 6:
% 0.10/0.37 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
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #3: input, references = 3, size of lhs = 7:
% 0.10/0.37 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
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #4: input, references = 4, size of lhs = 3:
% 0.10/0.37 P_truth-{F}(V0), P_x-{F}(V1), P_implies-{F}(V1,V1,V0) | FALSE
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #5: input, references = 5, size of lhs = 2:
% 0.10/0.37 #-{F} V0, #-{F} V1 | EXISTS V2: P_implies-{T}(V0,V1,V2)
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #6: input, references = 4, size of lhs = 0:
% 0.10/0.37 FALSE | EXISTS V0: P_truth-{T}(V0)
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #7: input, references = 3, size of lhs = 1:
% 0.10/0.37 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #8: input, references = 4, size of lhs = 0:
% 0.10/0.37 FALSE | EXISTS V0: P_x-{T}(V0)
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 number of initial rules = 9
% 0.10/0.37
% 0.10/0.37 Simplifiers:
% 0.10/0.37 #9: unsound, references = 3, size of lhs = 3:
% 0.10/0.37 P_implies-{F}(V0,V1,V2), P_implies-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #10: unsound, references = 3, size of lhs = 3:
% 0.10/0.37 P_truth-{F}(V0), P_truth-{F}(V1), V0 == V1 | FALSE
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #11: unsound, references = 3, size of lhs = 3:
% 0.10/0.37 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #12: unsound, references = 3, size of lhs = 3:
% 0.10/0.37 P_x-{F}(V0), P_x-{F}(V1), V0 == V1 | FALSE
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 number of simplifiers = 4
% 0.10/0.37
% 0.10/0.37 Learnt:
% 0.10/0.37 #15: exists( #5, #0 ), references = 3, size of lhs = 2:
% 0.10/0.37 P_truth-{F}(V0), #-{F} V1 | P_implies-{T}(V0,V1,V1)
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #16: exists( #5, #1 ), references = 3, size of lhs = 5:
% 0.10/0.37 P_truth-{F}(V0), P_implies-{F}(V1,V2,V3), P_implies-{F}(V2,V4,V5), P_implies-{F}(V1,V4,V6), P_implies-{F}(V5,V6,V7) | P_implies-{T}(V3,V7,V0)
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.37
% 0.10/0.37 #23: mergings( V3 == V4; #20 ), references = 2, size of lhs = 4:
% 0.10/0.37 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)
% 0.10/0.37 (used 0 times, uses = {})
% 0.10/0.38
% 0.10/0.38 #25: mergings( V3 == V4; #21 ), references = 1, size of lhs = 5:
% 0.10/0.38 P_truth-{F}(V0), P_implies-{F}(V0,V1,V0), P_implies-{F}(V2,V3,V1), P_implies-{F}(V3,V4,V5), P_implies-{F}(V2,V4,V6) | P_implies-{T}(V5,V6,V0)
% 0.10/0.38 (used 0 times, uses = {})
% 0.10/0.38
% 0.10/0.38 #30: mergings( V1 == V2; #28 ), references = 1, size of lhs = 2:
% 0.10/0.38 P_truth-{F}(V0), P_implies-{F}(V0,V0,V0) | FALSE
% 0.10/0.38 (used 0 times, uses = {})
% 0.10/0.38
% 0.10/0.38 #33: exists( #6, #31 ), references = 1, size of lhs = 0:
% 0.10/0.38 FALSE | FALSE
% 0.10/0.38 (used 0 times, uses = {})
% 0.10/0.38
% 0.10/0.38 number of learnt formulas = 6
% 0.10/0.38
% 0.10/0.38
% 0.10/0.38 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.38
% 0.10/0.38 randbase = 1
%------------------------------------------------------------------------------