TSTP Solution File: LCL170-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL170-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n012.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:52 EDT 2022
% Result : Unsatisfiable 0.19s 0.35s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL170-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jul 22 22:06:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.35 GeoParameters:
% 0.19/0.35
% 0.19/0.35 tptp_input = 1
% 0.19/0.35 tptp_output = 0
% 0.19/0.35 nonempty = 1
% 0.19/0.35 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.35 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.19/0.35
% 0.19/0.35
% 0.19/0.35 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.35 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.35
% 0.19/0.35 RuleSystem INPUT:
% 0.19/0.35
% 0.19/0.35 Initial Rules:
% 0.19/0.35 #0: input, references = 3, size of lhs = 3:
% 0.19/0.35 P_or-{F}(V0,V0,V1), P_not-{F}(V1,V2), P_or-{F}(V2,V0,V3) | axiom-{T}(V3)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #1: input, references = 4, size of lhs = 3:
% 0.19/0.35 P_not-{F}(V0,V2), P_or-{F}(V1,V0,V3), P_or-{F}(V2,V3,V4) | axiom-{T}(V4)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #2: input, references = 3, size of lhs = 4:
% 0.19/0.35 P_or-{F}(V0,V1,V2), P_not-{F}(V2,V3), P_or-{F}(V1,V0,V4), P_or-{F}(V3,V4,V5) | axiom-{T}(V5)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #3: input, references = 3, size of lhs = 6:
% 0.19/0.35 P_or-{F}(V1,V2,V3), P_or-{F}(V0,V3,V4), P_not-{F}(V4,V5), P_or-{F}(V0,V2,V6), P_or-{F}(V1,V6,V7), P_or-{F}(V5,V7,V8) | axiom-{T}(V8)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #4: input, references = 3, size of lhs = 8:
% 0.19/0.35 P_not-{F}(V0,V3), P_or-{F}(V3,V1,V4), P_not-{F}(V4,V5), P_or-{F}(V2,V0,V6), P_not-{F}(V6,V7), P_or-{F}(V2,V1,V8), P_or-{F}(V7,V8,V9), P_or-{F}(V5,V9,V10) | axiom-{T}(V10)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #5: input, references = 4, size of lhs = 1:
% 0.19/0.35 axiom-{F}(V0) | theorem-{T}(V0)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #6: input, references = 3, size of lhs = 4:
% 0.19/0.35 P_not-{F}(V0,V1), theorem-{F}(V0), P_or-{F}(V1,V2,V3), axiom-{F}(V3) | theorem-{T}(V2)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #7: input, references = 3, size of lhs = 7:
% 0.19/0.35 P_not-{F}(V0,V2), P_or-{F}(V2,V1,V3), theorem-{F}(V3), P_not-{F}(V4,V5), P_or-{F}(V5,V1,V6), P_or-{F}(V5,V0,V7), axiom-{F}(V7) | theorem-{T}(V6)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #8: input, references = 4, size of lhs = 7:
% 0.19/0.35 P_q-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V3,V0,V4), P_or-{F}(V1,V4,V5), theorem-{F}(V5) | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #9: input, references = 5, size of lhs = 2:
% 0.19/0.35 #-{F} V0, #-{F} V1 | EXISTS V2: P_or-{T}(V0,V1,V2)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #10: input, references = 6, size of lhs = 1:
% 0.19/0.35 #-{F} V0 | EXISTS V1: P_not-{T}(V0,V1)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #11: input, references = 4, size of lhs = 0:
% 0.19/0.35 FALSE | EXISTS V0: P_q-{T}(V0)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #12: input, references = 4, size of lhs = 0:
% 0.19/0.35 FALSE | EXISTS V0: P_p-{T}(V0)
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 number of initial rules = 13
% 0.19/0.35
% 0.19/0.35 Simplifiers:
% 0.19/0.35 #13: unsound, references = 3, size of lhs = 3:
% 0.19/0.35 P_or-{F}(V0,V1,V2), P_or-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #14: unsound, references = 3, size of lhs = 3:
% 0.19/0.35 P_not-{F}(V0,V1), P_not-{F}(V0,V3), V1 == V3 | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #15: unsound, references = 3, size of lhs = 3:
% 0.19/0.35 P_q-{F}(V0), P_q-{F}(V1), V0 == V1 | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #16: unsound, references = 3, size of lhs = 3:
% 0.19/0.35 P_p-{F}(V0), P_p-{F}(V1), V0 == V1 | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 number of simplifiers = 4
% 0.19/0.35
% 0.19/0.35 Learnt:
% 0.19/0.35 #20: exists( #9, #18 ), references = 1, size of lhs = 7:
% 0.19/0.35 P_q-{F}(V0), P_not-{F}(V0,V1), P_p-{F}(V2), P_not-{F}(V2,V3), P_or-{F}(V3,V0,V4), P_not-{F}(V5,V1), P_or-{F}(V6,V5,V4) | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #22: exists( #9, #19 ), references = 2, size of lhs = 4:
% 0.19/0.35 P_q-{F}(V0), P_p-{F}(V1), P_not-{F}(V1,V2), P_not-{F}(V0,V3) | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #24: exists( #10, #21 ), references = 1, size of lhs = 2:
% 0.19/0.35 P_q-{F}(V0), P_p-{F}(V0) | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #26: exists( #10, #22 ), references = 1, size of lhs = 3:
% 0.19/0.35 P_q-{F}(V0), P_p-{F}(V1), P_not-{F}(V0,V2) | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #28: exists( #10, #25 ), references = 1, size of lhs = 2:
% 0.19/0.35 P_q-{F}(V0), P_p-{F}(V1) | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #30: exists( #12, #27 ), references = 1, size of lhs = 1:
% 0.19/0.35 P_q-{F}(V0) | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 #32: exists( #11, #29 ), references = 1, size of lhs = 0:
% 0.19/0.35 FALSE | FALSE
% 0.19/0.35 (used 0 times, uses = {})
% 0.19/0.35
% 0.19/0.35 number of learnt formulas = 7
% 0.19/0.35
% 0.19/0.35
% 0.19/0.35 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.35
% 0.19/0.35 randbase = 1
%------------------------------------------------------------------------------