TSTP Solution File: SWV003-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SWV003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n004.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:20:51 EDT 2022
% Result : Unsatisfiable 0.46s 0.66s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n004.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 15:48:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.46/0.66 GeoParameters:
% 0.46/0.66
% 0.46/0.66 tptp_input = 1
% 0.46/0.66 tptp_output = 0
% 0.46/0.66 nonempty = 1
% 0.46/0.66 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.66 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.66 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.66
% 0.46/0.66 RuleSystem INPUT:
% 0.46/0.66
% 0.46/0.66 Initial Rules:
% 0.46/0.66 #0: input, references = 4, size of lhs = 3:
% 0.46/0.66 P_successor-{F}(V0,V1), P_predecessor-{F}(V1,V2), V2 == V0 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #1: input, references = 4, size of lhs = 3:
% 0.46/0.66 P_predecessor-{F}(V0,V1), P_successor-{F}(V1,V2), V2 == V0 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #2: input, references = 3, size of lhs = 3:
% 0.46/0.66 P_predecessor-{F}(V0,V3), P_predecessor-{F}(V1,V3), V0 == V1 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #3: input, references = 3, size of lhs = 3:
% 0.46/0.66 P_successor-{F}(V0,V3), P_successor-{F}(V1,V3), V0 == V1 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #4: input, references = 3, size of lhs = 1:
% 0.46/0.66 P_predecessor-{F}(V0,V1) | less_than-{T}(V1,V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #5: input, references = 3, size of lhs = 1:
% 0.46/0.66 P_successor-{F}(V0,V1) | less_than-{T}(V0,V1)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #6: input, references = 4, size of lhs = 2:
% 0.46/0.66 less_than-{F}(V0,V1), less_than-{F}(V2,V0) | less_than-{T}(V2,V1)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #7: input, references = 5, size of lhs = 3:
% 0.46/0.66 #-{F} V0, #-{F} V1, V0 == V1 | less_than-{T}(V0,V1), less_than-{T}(V1,V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #8: input, references = 3, size of lhs = 1:
% 0.46/0.66 less_than-{F}(V0,V0) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #9: input, references = 4, size of lhs = 2:
% 0.46/0.66 less_than-{F}(V0,V1), less_than-{F}(V1,V0) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #10: input, references = 3, size of lhs = 3:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), less_than-{F}(V0,V1) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #11: input, references = 4, size of lhs = 3:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2) | less_than-{T}(V2,V1)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #12: input, references = 3, size of lhs = 5:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), less_than-{F}(V2,V3) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #13: input, references = 4, size of lhs = 4:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3) | less_than-{T}(V3,V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #14: input, references = 3, size of lhs = 6:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), P_a-{F}(V1,V4), P_a-{F}(V2,V5) | less_than-{T}(V4,V5)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #15: input, references = 3, size of lhs = 9:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), P_a-{F}(V1,V4), P_a-{F}(V2,V5), P_a-{F}(V6,V7), less_than-{F}(V6,V1), less_than-{F}(V7,V5) | less_than-{T}(V6,V3)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #16: input, references = 3, size of lhs = 12:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), P_a-{F}(V1,V4), P_a-{F}(V2,V5), P_one-{F}(V6), P_predecessor-{F}(V3,V7), P_a-{F}(V7,V8), less_than-{F}(V6,V3), P_a-{F}(V9,V10), less_than-{F}(V10,V8) | less_than-{T}(V9,V3), less_than-{T}(V0,V9)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #17: input, references = 3, size of lhs = 15:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), P_a-{F}(V1,V4), P_a-{F}(V2,V5), P_one-{F}(V6), P_predecessor-{F}(V3,V7), P_a-{F}(V7,V8), P_a-{F}(V9,V10), P_predecessor-{F}(V9,V11), P_a-{F}(V11,V12), less_than-{F}(V6,V9), less_than-{F}(V9,V3), less_than-{F}(V10,V12) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #18: input, references = 4, size of lhs = 9:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), P_a-{F}(V1,V4), P_a-{F}(V2,V5), P_one-{F}(V6), P_predecessor-{F}(V3,V7), P_a-{F}(V7,V8) | less_than-{T}(V1,V3)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #19: input, references = 5, size of lhs = 1:
% 0.46/0.66 #-{F} V0 | EXISTS V1: P_predecessor-{T}(V0,V1)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #20: input, references = 4, size of lhs = 1:
% 0.46/0.66 #-{F} V0 | EXISTS V1: P_successor-{T}(V0,V1)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #21: input, references = 4, size of lhs = 0:
% 0.46/0.66 FALSE | EXISTS V0: P_n-{T}(V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #22: input, references = 4, size of lhs = 0:
% 0.46/0.66 FALSE | EXISTS V0: P_j-{T}(V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #23: input, references = 5, size of lhs = 0:
% 0.46/0.66 FALSE | EXISTS V0: P_k-{T}(V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #24: input, references = 5, size of lhs = 0:
% 0.46/0.66 FALSE | EXISTS V0: P_i-{T}(V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #25: input, references = 6, size of lhs = 1:
% 0.46/0.66 #-{F} V0 | EXISTS V1: P_a-{T}(V0,V1)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #26: input, references = 4, size of lhs = 0:
% 0.46/0.66 FALSE | EXISTS V0: P_one-{T}(V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 number of initial rules = 27
% 0.46/0.66
% 0.46/0.66 Simplifiers:
% 0.46/0.66 #27: unsound, references = 3, size of lhs = 3:
% 0.46/0.66 P_predecessor-{F}(V0,V1), P_predecessor-{F}(V0,V3), V1 == V3 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #28: unsound, references = 3, size of lhs = 3:
% 0.46/0.66 P_successor-{F}(V0,V1), P_successor-{F}(V0,V3), V1 == V3 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #29: unsound, references = 3, size of lhs = 3:
% 0.46/0.66 P_n-{F}(V0), P_n-{F}(V1), V0 == V1 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #30: unsound, references = 3, size of lhs = 3:
% 0.46/0.66 P_j-{F}(V0), P_j-{F}(V1), V0 == V1 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #31: unsound, references = 3, size of lhs = 3:
% 0.46/0.66 P_k-{F}(V0), P_k-{F}(V1), V0 == V1 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #32: unsound, references = 3, size of lhs = 3:
% 0.46/0.66 P_i-{F}(V0), P_i-{F}(V1), V0 == V1 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #33: unsound, references = 3, size of lhs = 3:
% 0.46/0.66 P_a-{F}(V0,V1), P_a-{F}(V0,V3), V1 == V3 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #34: unsound, references = 3, size of lhs = 3:
% 0.46/0.66 P_one-{F}(V0), P_one-{F}(V1), V0 == V1 | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 number of simplifiers = 8
% 0.46/0.66
% 0.46/0.66 Learnt:
% 0.46/0.66 #46: exists( #19, #0 ), references = 1, size of lhs = 1:
% 0.46/0.66 P_successor-{F}(V0,V1) | P_predecessor-{T}(V1,V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #49: exists( #20, #1 ), references = 1, size of lhs = 1:
% 0.46/0.66 P_predecessor-{F}(V0,V1) | P_successor-{T}(V1,V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #68: exists( #25, #64 ), references = 1, size of lhs = 9:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), less_than-{F}(V3,V1), P_a-{F}(V1,V4), P_a-{F}(V2,V5), P_one-{F}(V6), P_predecessor-{F}(V3,V7) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #70: exists( #25, #66 ), references = 1, size of lhs = 8:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), less_than-{F}(V3,V1), P_a-{F}(V1,V4), P_one-{F}(V5), P_predecessor-{F}(V3,V6) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #72: exists( #19, #69 ), references = 1, size of lhs = 7:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), less_than-{F}(V3,V1), P_a-{F}(V1,V4), P_one-{F}(V5) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #74: exists( #25, #71 ), references = 1, size of lhs = 6:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), less_than-{F}(V3,V1), P_one-{F}(V4) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #76: exists( #26, #73 ), references = 4, size of lhs = 5:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), less_than-{F}(V3,V1) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #82: mergings( V1 == V4, V4 == V2, V3 == V5; #78 ), references = 1, size of lhs = 3:
% 0.46/0.66 P_j-{F}(V0), P_n-{F}(V0), P_k-{F}(V1) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #86: mergings( V1 == V3, V3 == V2; #83 ), references = 1, size of lhs = 2:
% 0.46/0.66 P_j-{F}(V0), P_n-{F}(V0) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #106: disj( #7, input ), references = 1, size of lhs = 3:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), V0 == V1 | less_than-{T}(V1,V0)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #123: disj( #7, input ), references = 1, size of lhs = 5:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), V2 == V3 | less_than-{T}(V3,V2)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #130: mergings( V1 == V4, V2 == V5, V3 == V6; #126 ), references = 1, size of lhs = 4:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1), P_k-{F}(V2), less_than-{F}(V2,V1) | P_i-{T}(V2)
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #138: mergings( V1 == V2, V2 == V4, V4 == V5, V3 == V6; #133 ), references = 1, size of lhs = 2:
% 0.46/0.66 P_n-{F}(V0), P_j-{F}(V1) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #143: mergings( V1 == V2, V2 == V3, V3 == V4; #139 ), references = 1, size of lhs = 1:
% 0.46/0.66 P_n-{F}(V0) | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 #145: exists( #21, #139 ), references = 1, size of lhs = 0:
% 0.46/0.66 FALSE | FALSE
% 0.46/0.66 (used 0 times, uses = {})
% 0.46/0.66
% 0.46/0.66 number of learnt formulas = 15
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.66
% 0.46/0.66 randbase = 1
%------------------------------------------------------------------------------