TSTP Solution File: LCL173-3 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL173-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n019.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 : Sat Jul 23 06:08:53 EDT 2022
% Result : Unsatisfiable 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL173-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jul 22 22:49:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 GeoParameters:
% 0.19/0.46
% 0.19/0.46 tptp_input = 1
% 0.19/0.46 tptp_output = 0
% 0.19/0.46 nonempty = 1
% 0.19/0.46 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46
% 0.19/0.46 RuleSystem INPUT:
% 0.19/0.46
% 0.19/0.46 Initial Rules:
% 0.19/0.46 #0: input, references = 3, size of lhs = 2:
% 0.19/0.46 P_or-{F}(V0,V0,V1), P_implies-{F}(V1,V0,V2) | axiom-{T}(V2)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #1: input, references = 3, size of lhs = 2:
% 0.19/0.46 P_or-{F}(V1,V0,V2), P_implies-{F}(V0,V2,V3) | axiom-{T}(V3)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #2: input, references = 3, size of lhs = 3:
% 0.19/0.46 P_or-{F}(V0,V1,V2), P_or-{F}(V1,V0,V3), P_implies-{F}(V2,V3,V4) | axiom-{T}(V4)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #3: input, references = 3, size of lhs = 5:
% 0.19/0.46 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.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #4: input, references = 4, size of lhs = 5:
% 0.19/0.46 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.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #5: input, references = 6, size of lhs = 4:
% 0.19/0.46 P_implies-{F}(V0,V1,V2), P_not-{F}(V0,V3), P_or-{F}(V3,V1,V4), V2 == V4 | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #6: input, references = 4, size of lhs = 1:
% 0.19/0.46 axiom-{F}(V0) | theorem-{T}(V0)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #7: input, references = 3, size of lhs = 3:
% 0.19/0.46 theorem-{F}(V0), P_implies-{F}(V0,V1,V2), theorem-{F}(V2) | theorem-{T}(V1)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #8: input, references = 4, size of lhs = 9:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V1), P_implies-{F}(V0,V1,V2), P_p-{F}(V3), P_implies-{F}(V3,V0,V4), P_implies-{F}(V3,V1,V5), P_implies-{F}(V4,V5,V6), P_implies-{F}(V2,V6,V7), theorem-{F}(V7) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #9: input, references = 12, size of lhs = 2:
% 0.19/0.46 #-{F} V0, #-{F} V1 | EXISTS V2: P_implies-{T}(V0,V1,V2)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #10: input, references = 5, size of lhs = 2:
% 0.19/0.46 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #11: input, references = 7, size of lhs = 1:
% 0.19/0.46 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #12: input, references = 4, size of lhs = 0:
% 0.19/0.46 FALSE | EXISTS V0: P_q-{T}(V0)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #13: input, references = 4, size of lhs = 0:
% 0.19/0.46 FALSE | EXISTS V0: P_r-{T}(V0)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #14: input, references = 5, size of lhs = 0:
% 0.19/0.46 FALSE | EXISTS V0: P_p-{T}(V0)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 number of initial rules = 15
% 0.19/0.46
% 0.19/0.46 Simplifiers:
% 0.19/0.46 #15: unsound, references = 3, size of lhs = 3:
% 0.19/0.46 P_implies-{F}(V0,V1,V2), P_implies-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #16: unsound, references = 3, size of lhs = 3:
% 0.19/0.46 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #17: unsound, references = 3, size of lhs = 3:
% 0.19/0.46 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #18: unsound, references = 3, size of lhs = 3:
% 0.19/0.46 P_q-{F}(V0), P_q-{F}(V1), V0 == V1 | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #19: unsound, references = 3, size of lhs = 3:
% 0.19/0.46 P_r-{F}(V0), P_r-{F}(V1), V0 == V1 | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #20: unsound, references = 3, size of lhs = 3:
% 0.19/0.46 P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 number of simplifiers = 6
% 0.19/0.46
% 0.19/0.46 Learnt:
% 0.19/0.46 #22: exists( #10, #5 ), references = 5, size of lhs = 2:
% 0.19/0.46 P_not-{F}(V0,V1), P_implies-{F}(V0,V2,V3) | P_or-{T}(V1,V2,V3)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #24: exists( #9, #5 ), references = 2, size of lhs = 2:
% 0.19/0.46 P_not-{F}(V0,V1), P_or-{F}(V1,V2,V3) | P_implies-{T}(V0,V2,V3)
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #36: exists( #9, #34 ), references = 1, size of lhs = 11:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V1), P_implies-{F}(V0,V1,V2), P_p-{F}(V3), P_implies-{F}(V3,V0,V4), P_implies-{F}(V3,V1,V5), P_implies-{F}(V4,V5,V6), P_implies-{F}(V7,V8,V2), P_or-{F}(V9,V7,V10), P_or-{F}(V9,V8,V11), P_implies-{F}(V10,V11,V6) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #38: exists( #9, #35 ), references = 3, size of lhs = 9:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V1), P_implies-{F}(V0,V1,V2), P_p-{F}(V3), P_implies-{F}(V3,V0,V4), P_implies-{F}(V3,V1,V5), P_implies-{F}(V6,V7,V2), P_or-{F}(V8,V6,V4), P_or-{F}(V8,V7,V5) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #42: exists( #9, #40 ), references = 1, size of lhs = 5:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V0), P_p-{F}(V0), P_not-{F}(V0,V1), P_not-{F}(V2,V1) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #44: exists( #11, #41 ), references = 1, size of lhs = 3:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V0), P_p-{F}(V0) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #51: exists( #9, #49 ), references = 1, size of lhs = 5:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V0), P_p-{F}(V1), P_implies-{F}(V0,V0,V2), P_not-{F}(V1,V3) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #53: exists( #11, #50 ), references = 1, size of lhs = 4:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V0), P_p-{F}(V1), P_implies-{F}(V0,V0,V2) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #55: exists( #9, #52 ), references = 1, size of lhs = 3:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V0), P_p-{F}(V1) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #57: exists( #14, #54 ), references = 1, size of lhs = 2:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V0) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #62: exists( #9, #60 ), references = 1, size of lhs = 8:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V1), P_implies-{F}(V0,V1,V2), P_p-{F}(V3), P_implies-{F}(V3,V1,V4), P_not-{F}(V3,V5), P_implies-{F}(V0,V6,V2), P_or-{F}(V5,V6,V4) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #65: exists( #10, #63 ), references = 1, size of lhs = 7:
% 0.19/0.46 P_q-{F}(V0), P_not-{F}(V0,V1), P_r-{F}(V2), P_p-{F}(V3), P_implies-{F}(V3,V2,V4), P_not-{F}(V3,V5), P_or-{F}(V5,V2,V4) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #68: exists( #9, #66 ), references = 1, size of lhs = 5:
% 0.19/0.46 P_q-{F}(V0), P_not-{F}(V0,V1), P_r-{F}(V2), P_p-{F}(V3), P_not-{F}(V3,V4) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #70: exists( #11, #67 ), references = 1, size of lhs = 4:
% 0.19/0.46 P_q-{F}(V0), P_not-{F}(V0,V1), P_r-{F}(V2), P_p-{F}(V3) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #72: exists( #11, #69 ), references = 1, size of lhs = 3:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V1), P_p-{F}(V2) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #74: exists( #14, #71 ), references = 1, size of lhs = 2:
% 0.19/0.46 P_q-{F}(V0), P_r-{F}(V1) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #76: exists( #13, #73 ), references = 1, size of lhs = 1:
% 0.19/0.46 P_q-{F}(V0) | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 #78: exists( #12, #75 ), references = 1, size of lhs = 0:
% 0.19/0.46 FALSE | FALSE
% 0.19/0.46 (used 0 times, uses = {})
% 0.19/0.46
% 0.19/0.46 number of learnt formulas = 18
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46
% 0.19/0.46 randbase = 1
%------------------------------------------------------------------------------