TSTP Solution File: LCL899+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : LCL899+1 : TPTP v8.1.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n009.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:10:18 EDT 2022
% Result : Theorem 0.41s 0.58s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL899+1 : TPTP v8.1.0. Released v5.5.0.
% 0.12/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n009.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:07:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.58 GeoParameters:
% 0.41/0.58
% 0.41/0.58 tptp_input = 1
% 0.41/0.58 tptp_output = 0
% 0.41/0.58 nonempty = 1
% 0.41/0.58 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.58 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.41/0.58
% 0.41/0.58
% 0.41/0.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.58 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.58
% 0.41/0.58 RuleSystem INPUT:
% 0.41/0.58
% 0.41/0.58 Initial Rules:
% 0.41/0.58 #0: input, references = 4, size of lhs = 5:
% 0.41/0.58 P_+-{F}(V0,V1,V3), P_+-{F}(V3,V2,V4), P_+-{F}(V1,V2,V5), P_+-{F}(V0,V5,V6), V4 == V6 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #1: input, references = 4, size of lhs = 3:
% 0.41/0.58 P_+-{F}(V0,V1,V2), P_+-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #2: input, references = 4, size of lhs = 3:
% 0.41/0.58 P_0-{F}(V0), P_+-{F}(V1,V0,V2), V2 == V1 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #3: input, references = 5, size of lhs = 2:
% 0.41/0.58 P_0-{F}(V0), #-{F} V1 | >=-{T}(V1,V1)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #4: input, references = 3, size of lhs = 3:
% 0.41/0.58 P_0-{F}(V0), >=-{F}(V1,V2), >=-{F}(V3,V1) | >=-{T}(V3,V2)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #5: input, references = 6, size of lhs = 4:
% 0.41/0.58 P_0-{F}(V0), >=-{F}(V1,V2), >=-{F}(V2,V1), V1 == V2 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #6: input, references = 5, size of lhs = 4:
% 0.41/0.58 P_0-{F}(V0), P_+-{F}(V1,V2,V4), P_==>-{F}(V1,V3,V5), >=-{F}(V4,V3) | >=-{T}(V2,V5)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #7: input, references = 6, size of lhs = 4:
% 0.41/0.58 P_0-{F}(V0), P_+-{F}(V1,V2,V4), P_==>-{F}(V1,V3,V5), >=-{F}(V2,V5) | >=-{T}(V4,V3)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #8: input, references = 5, size of lhs = 2:
% 0.41/0.58 P_0-{F}(V0), #-{F} V1 | >=-{T}(V1,V0)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #9: input, references = 4, size of lhs = 4:
% 0.41/0.58 P_0-{F}(V0), >=-{F}(V1,V2), P_+-{F}(V1,V3,V4), P_+-{F}(V2,V3,V5) | >=-{T}(V4,V5)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #10: input, references = 3, size of lhs = 4:
% 0.41/0.58 P_0-{F}(V0), >=-{F}(V1,V2), P_==>-{F}(V2,V3,V4), P_==>-{F}(V1,V3,V5) | >=-{T}(V4,V5)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #11: input, references = 3, size of lhs = 4:
% 0.41/0.58 P_0-{F}(V0), >=-{F}(V1,V2), P_==>-{F}(V3,V1,V4), P_==>-{F}(V3,V2,V5) | >=-{T}(V4,V5)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #12: input, references = 4, size of lhs = 4:
% 0.41/0.58 P_0-{F}(V0), P_1-{F}(V1), P_+-{F}(V2,V1,V3), V3 == V1 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #13: input, references = 4, size of lhs = 7:
% 0.41/0.58 P_0-{F}(V0), P_1-{F}(V1), P_==>-{F}(V2,V3,V4), P_==>-{F}(V4,V3,V5), P_==>-{F}(V3,V2,V6), P_==>-{F}(V6,V2,V7), V5 == V7 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #14: input, references = 4, size of lhs = 2:
% 0.41/0.58 P_0-{F}(V0), P_1-{F}(V1) | EXISTS V2: pppp0-{T}(V1,V2)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #15: input, references = 4, size of lhs = 3:
% 0.41/0.58 pppp0-{F}(V0,V1), P_==>-{F}(V1,V0,V2), P_==>-{F}(V2,V0,V1) | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #16: input, references = 7, size of lhs = 2:
% 0.41/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_+-{T}(V0,V1,V2)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #17: input, references = 4, size of lhs = 0:
% 0.41/0.58 FALSE | EXISTS V0: P_0-{T}(V0)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #18: input, references = 7, size of lhs = 2:
% 0.41/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_==>-{T}(V0,V1,V2)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #19: input, references = 4, size of lhs = 0:
% 0.41/0.58 FALSE | EXISTS V0: P_1-{T}(V0)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 number of initial rules = 20
% 0.41/0.58
% 0.41/0.58 Simplifiers:
% 0.41/0.58 #20: unsound, references = 3, size of lhs = 3:
% 0.41/0.58 P_+-{F}(V0,V1,V2), P_+-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #21: unsound, references = 3, size of lhs = 3:
% 0.41/0.58 P_0-{F}(V0), P_0-{F}(V1), V0 == V1 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #22: unsound, references = 3, size of lhs = 3:
% 0.41/0.58 P_==>-{F}(V0,V1,V2), P_==>-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #23: unsound, references = 3, size of lhs = 3:
% 0.41/0.58 P_1-{F}(V0), P_1-{F}(V1), V0 == V1 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #24: unsound, references = 3, size of lhs = 3:
% 0.41/0.58 pppp0-{F}(V0,V1), pppp0-{F}(V0,V3), V1 == V3 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #25: unsound, references = 3, size of lhs = 3:
% 0.41/0.58 pppp0-{F}(V0,V1), pppp0-{F}(V2,V3), V0 == V2 | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 number of simplifiers = 6
% 0.41/0.58
% 0.41/0.58 Learnt:
% 0.41/0.58 #27: exists( #16, #12 ), references = 3, size of lhs = 3:
% 0.41/0.58 P_0-{F}(V0), P_1-{F}(V1), #-{F} V2 | P_+-{T}(V2,V1,V1)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #30: exists( #16, #2 ), references = 5, size of lhs = 2:
% 0.41/0.58 P_0-{F}(V0), #-{F} V1 | P_+-{T}(V1,V0,V1)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #37: mergings( V3 == V4, V4 == V5; #34 ), references = 3, size of lhs = 3:
% 0.41/0.58 P_0-{F}(V0), P_+-{F}(V1,V0,V2), >=-{F}(V2,V3) | P_==>-{T}(V1,V3,V0)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #41: exists( #16, #1 ), references = 5, size of lhs = 1:
% 0.41/0.58 P_+-{F}(V0,V1,V2) | P_+-{T}(V1,V0,V2)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #42: exists( #16, #0 ), references = 1, size of lhs = 3:
% 0.41/0.58 P_+-{F}(V0,V1,V2), P_+-{F}(V1,V3,V4), P_+-{F}(V0,V4,V5) | P_+-{T}(V2,V3,V5)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #54: mergings( V3 == V0, V0 == V4, V4 == V5, V5 == V6; #49 ), references = 2, size of lhs = 3:
% 0.41/0.58 P_0-{F}(V0), P_+-{F}(V0,V1,V2), >=-{F}(V2,V1) | P_==>-{T}(V0,V1,V1)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #69: mergings( V3 == V4, V4 == V6, V6 == V7, V7 == V8; #64 ), references = 1, size of lhs = 5:
% 0.41/0.58 P_1-{F}(V0), >=-{F}(V0,V1), P_0-{F}(V1), >=-{F}(V2,V3), P_==>-{F}(V4,V0,V3) | P_+-{T}(V4,V2,V0)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #71: exists( #18, #13 ), references = 1, size of lhs = 5:
% 0.41/0.58 P_0-{F}(V0), P_1-{F}(V1), P_==>-{F}(V2,V3,V4), P_==>-{F}(V3,V2,V5), P_==>-{F}(V5,V2,V6) | P_==>-{T}(V4,V3,V6)
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #74: exists( #18, #72 ), references = 1, size of lhs = 5:
% 0.41/0.58 P_0-{F}(V0), P_1-{F}(V1), pppp0-{F}(V2,V3), P_==>-{F}(V2,V3,V4), P_==>-{F}(V4,V3,V3) | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #91: mergings( V0 == V3, V3 == V4, V4 == V6, V6 == V7, V7 == V8, V1 == V5, V5 == V9; #83 ), references = 2, size of lhs = 4:
% 0.41/0.58 P_0-{F}(V0), P_1-{F}(V1), >=-{F}(V1,V0), P_+-{F}(V1,V0,V1) | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #95: exists( #19, #93 ), references = 1, size of lhs = 1:
% 0.41/0.58 P_0-{F}(V0) | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 #97: exists( #17, #94 ), references = 1, size of lhs = 0:
% 0.41/0.58 FALSE | FALSE
% 0.41/0.58 (used 0 times, uses = {})
% 0.41/0.58
% 0.41/0.58 number of learnt formulas = 12
% 0.41/0.58
% 0.41/0.58
% 0.41/0.58 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.58
% 0.41/0.58 randbase = 1
%------------------------------------------------------------------------------