TSTP Solution File: SWV007-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n028.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.37s 0.61s
% Output : Refutation 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWV007-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 : n028.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:47:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.37/0.61 GeoParameters:
% 0.37/0.61
% 0.37/0.61 tptp_input = 1
% 0.37/0.61 tptp_output = 0
% 0.37/0.61 nonempty = 1
% 0.37/0.61 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.61 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.61 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.61
% 0.37/0.61 RuleSystem INPUT:
% 0.37/0.61
% 0.37/0.61 Initial Rules:
% 0.37/0.61 #0: input, references = 4, size of lhs = 3:
% 0.37/0.61 P_successor-{F}(V0,V1), P_predecessor-{F}(V1,V2), V2 == V0 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #1: input, references = 4, size of lhs = 3:
% 0.37/0.61 P_predecessor-{F}(V0,V1), P_successor-{F}(V1,V2), V2 == V0 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #2: input, references = 3, size of lhs = 3:
% 0.37/0.61 P_predecessor-{F}(V0,V3), P_predecessor-{F}(V1,V3), V0 == V1 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #3: input, references = 3, size of lhs = 3:
% 0.37/0.61 P_successor-{F}(V0,V3), P_successor-{F}(V1,V3), V0 == V1 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #4: input, references = 3, size of lhs = 1:
% 0.37/0.61 P_predecessor-{F}(V0,V1) | less_than-{T}(V1,V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #5: input, references = 5, size of lhs = 1:
% 0.37/0.61 P_successor-{F}(V0,V1) | less_than-{T}(V0,V1)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #6: input, references = 4, size of lhs = 2:
% 0.37/0.61 less_than-{F}(V0,V1), less_than-{F}(V2,V0) | less_than-{T}(V2,V1)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #7: input, references = 4, size of lhs = 3:
% 0.37/0.61 #-{F} V0, #-{F} V1, V0 == V1 | less_than-{T}(V0,V1), less_than-{T}(V1,V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #8: input, references = 3, size of lhs = 1:
% 0.37/0.61 less_than-{F}(V0,V0) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #9: input, references = 4, size of lhs = 2:
% 0.37/0.61 less_than-{F}(V0,V1), less_than-{F}(V1,V0) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #10: input, references = 3, size of lhs = 3:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), less_than-{F}(V0,V1) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #11: input, references = 3, size of lhs = 4:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), less_than-{F}(V1,V2) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #12: input, references = 3, size of lhs = 3:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2) | less_than-{T}(V2,V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #13: input, references = 5, size of lhs = 5:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3), less_than-{F}(V0,V3) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #14: input, references = 4, size of lhs = 4:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3) | less_than-{T}(V2,V3)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #15: input, references = 3, size of lhs = 6:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3), P_one-{F}(V4), less_than-{F}(V2,V4) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #16: input, references = 4, size of lhs = 5:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V3), P_i-{F}(V2), P_m-{F}(V3), P_one-{F}(V4) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #17: input, references = 4, size of lhs = 7:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3), P_one-{F}(V4), P_a-{F}(V3,V5), P_a-{F}(V1,V6) | less_than-{T}(V5,V6)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #18: input, references = 3, size of lhs = 13:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3), P_one-{F}(V4), P_a-{F}(V3,V5), P_a-{F}(V1,V6), P_a-{F}(V7,V8), P_predecessor-{F}(V7,V9), P_a-{F}(V9,V10), less_than-{F}(V4,V7), less_than-{F}(V7,V2), less_than-{F}(V8,V10) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #19: input, references = 3, size of lhs = 12:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3), P_one-{F}(V4), P_a-{F}(V3,V5), P_a-{F}(V1,V6), P_predecessor-{F}(V2,V7), P_a-{F}(V7,V8), P_a-{F}(V9,V10), less_than-{F}(V4,V9), less_than-{F}(V10,V8) | less_than-{T}(V9,V2), less_than-{T}(V0,V9)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #20: input, references = 4, size of lhs = 13:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3), P_one-{F}(V4), P_a-{F}(V3,V5), P_a-{F}(V1,V6), P_predecessor-{F}(V2,V7), P_a-{F}(V7,V8), P_successor-{F}(V0,V9), P_a-{F}(V10,V11), less_than-{F}(V10,V9), less_than-{F}(V11,V6) | less_than-{T}(V10,V2)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #21: input, references = 5, size of lhs = 1:
% 0.37/0.61 #-{F} V0 | EXISTS V1: P_predecessor-{T}(V0,V1)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #22: input, references = 5, size of lhs = 1:
% 0.37/0.61 #-{F} V0 | EXISTS V1: P_successor-{T}(V0,V1)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #23: input, references = 4, size of lhs = 0:
% 0.37/0.61 FALSE | EXISTS V0: P_n-{T}(V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #24: input, references = 4, size of lhs = 0:
% 0.37/0.61 FALSE | EXISTS V0: P_k-{T}(V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #25: input, references = 4, size of lhs = 0:
% 0.37/0.61 FALSE | EXISTS V0: P_i-{T}(V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #26: input, references = 4, size of lhs = 0:
% 0.37/0.61 FALSE | EXISTS V0: P_m-{T}(V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #27: input, references = 5, size of lhs = 0:
% 0.37/0.61 FALSE | EXISTS V0: P_one-{T}(V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #28: input, references = 6, size of lhs = 1:
% 0.37/0.61 #-{F} V0 | EXISTS V1: P_a-{T}(V0,V1)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 number of initial rules = 29
% 0.37/0.61
% 0.37/0.61 Simplifiers:
% 0.37/0.61 #29: unsound, references = 3, size of lhs = 3:
% 0.37/0.61 P_predecessor-{F}(V0,V1), P_predecessor-{F}(V0,V3), V1 == V3 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #30: unsound, references = 3, size of lhs = 3:
% 0.37/0.61 P_successor-{F}(V0,V1), P_successor-{F}(V0,V3), V1 == V3 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #31: unsound, references = 3, size of lhs = 3:
% 0.37/0.61 P_n-{F}(V0), P_n-{F}(V1), V0 == V1 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #32: unsound, references = 3, size of lhs = 3:
% 0.37/0.61 P_k-{F}(V0), P_k-{F}(V1), V0 == V1 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #33: unsound, references = 3, size of lhs = 3:
% 0.37/0.61 P_i-{F}(V0), P_i-{F}(V1), V0 == V1 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #34: unsound, references = 3, size of lhs = 3:
% 0.37/0.61 P_m-{F}(V0), P_m-{F}(V1), V0 == V1 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #35: unsound, references = 3, size of lhs = 3:
% 0.37/0.61 P_one-{F}(V0), P_one-{F}(V1), V0 == V1 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #36: unsound, references = 3, size of lhs = 3:
% 0.37/0.61 P_a-{F}(V0,V1), P_a-{F}(V0,V3), V1 == V3 | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 number of simplifiers = 8
% 0.37/0.61
% 0.37/0.61 Learnt:
% 0.37/0.61 #43: exists( #27, #16 ), references = 1, size of lhs = 4:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_m-{F}(V1), P_i-{F}(V2) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #48: exists( #22, #1 ), references = 1, size of lhs = 1:
% 0.37/0.61 P_predecessor-{F}(V0,V1) | P_successor-{T}(V1,V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #50: exists( #21, #0 ), references = 1, size of lhs = 1:
% 0.37/0.61 P_successor-{F}(V0,V1) | P_predecessor-{T}(V1,V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #69: exists( #28, #67 ), references = 2, size of lhs = 13:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3), P_one-{F}(V4), P_a-{F}(V3,V5), P_a-{F}(V1,V6), P_predecessor-{F}(V2,V7), P_successor-{F}(V0,V8), less_than-{F}(V2,V9), less_than-{F}(V9,V8), P_a-{F}(V9,V10), less_than-{F}(V10,V6) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #76: mergings( V2 == V7, V3 == V8, V4 == V9, V5 == V10; #71 ), references = 1, size of lhs = 10:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_a-{F}(V1,V2), P_i-{F}(V3), P_m-{F}(V4), less_than-{F}(V3,V4), P_one-{F}(V5), P_predecessor-{F}(V3,V6), P_successor-{F}(V0,V7), less_than-{F}(V4,V7) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #82: mergings( V2 == V7, V3 == V8, V4 == V0, V5 == V10; #77 ), references = 1, size of lhs = 9:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_a-{F}(V1,V2), P_i-{F}(V3), P_m-{F}(V4), less_than-{F}(V3,V4), P_one-{F}(V5), P_successor-{F}(V0,V6), less_than-{F}(V4,V6) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #87: mergings( V2 == V5, V3 == V6, V4 == V8; #83 ), references = 1, size of lhs = 8:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3), less_than-{F}(V2,V3), P_one-{F}(V4), P_successor-{F}(V0,V5), less_than-{F}(V3,V5) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #110: disj( #7, mergings( V2 == V5, V3 == V6, V4 == V8; #83 ) ), references = 2, size of lhs = 8:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2), P_m-{F}(V3), less_than-{F}(V2,V3), P_one-{F}(V4), P_successor-{F}(V0,V5), V5 == V3 | less_than-{T}(V5,V3)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #129: mergings( V2 == V6, V3 == V7; #125 ), references = 1, size of lhs = 6:
% 0.37/0.61 P_m-{F}(V0), P_one-{F}(V1), P_n-{F}(V2), P_k-{F}(V3), P_i-{F}(V4), less_than-{F}(V4,V0) | P_successor-{T}(V2,V0)
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #137: mergings( V1 == V4, V4 == V7, V2 == V5, V5 == V8; #132 ), references = 1, size of lhs = 5:
% 0.37/0.61 P_m-{F}(V0), P_n-{F}(V1), P_k-{F}(V2), P_i-{F}(V3), less_than-{F}(V3,V0) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #146: mergings( V1 == V7, V2 == V3, V3 == V5, V5 == V8, V4 == V6, V6 == V9; #139 ), references = 1, size of lhs = 3:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1), P_i-{F}(V2) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #152: mergings( V1 == V5, V2 == V3, V3 == V4, V4 == V6; #147 ), references = 1, size of lhs = 2:
% 0.37/0.61 P_n-{F}(V0), P_k-{F}(V1) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #155: mergings( V1 == V2; #153 ), references = 1, size of lhs = 1:
% 0.37/0.61 P_n-{F}(V0) | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 #157: exists( #23, #153 ), references = 1, size of lhs = 0:
% 0.37/0.61 FALSE | FALSE
% 0.37/0.61 (used 0 times, uses = {})
% 0.37/0.61
% 0.37/0.61 number of learnt formulas = 14
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.61
% 0.37/0.61 randbase = 1
%------------------------------------------------------------------------------