TSTP Solution File: NUM020-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : NUM020-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n011.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:11:59 EDT 2022
% Result : Unsatisfiable 0.47s 0.64s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM020-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n011.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 : Sat Jul 23 00:15:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.47/0.64 GeoParameters:
% 0.47/0.64
% 0.47/0.64 tptp_input = 1
% 0.47/0.64 tptp_output = 0
% 0.47/0.64 nonempty = 1
% 0.47/0.64 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.64 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.64 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.64
% 0.47/0.64 RuleSystem INPUT:
% 0.47/0.64
% 0.47/0.64 Initial Rules:
% 0.47/0.64 #0: input, references = 4, size of lhs = 2:
% 0.47/0.64 P_n0-{F}(V0), P_add-{F}(V1,V0,V2) | equalish-{T}(V2,V1)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #1: input, references = 13, size of lhs = 5:
% 0.47/0.64 P_n0-{F}(V0), P_successor-{F}(V2,V3), P_add-{F}(V1,V3,V4), P_add-{F}(V1,V2,V5), P_successor-{F}(V5,V6) | equalish-{T}(V4,V6)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #2: input, references = 3, size of lhs = 2:
% 0.47/0.64 P_n0-{F}(V0), P_multiply-{F}(V1,V0,V2) | equalish-{T}(V2,V0)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #3: input, references = 6, size of lhs = 5:
% 0.47/0.64 P_n0-{F}(V0), P_successor-{F}(V2,V3), P_multiply-{F}(V1,V3,V4), P_multiply-{F}(V1,V2,V5), P_add-{F}(V5,V1,V6) | equalish-{T}(V4,V6)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #4: input, references = 11, size of lhs = 4:
% 0.47/0.64 P_n0-{F}(V0), P_successor-{F}(V1,V3), P_successor-{F}(V2,V4), equalish-{F}(V3,V4) | equalish-{T}(V1,V2)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #5: input, references = 4, size of lhs = 4:
% 0.47/0.64 P_n0-{F}(V0), P_successor-{F}(V1,V3), P_successor-{F}(V2,V4), equalish-{F}(V1,V2) | equalish-{T}(V3,V4)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #6: input, references = 3, size of lhs = 2:
% 0.47/0.64 P_n0-{F}(V0), #-{F} V1 | equalish-{T}(V1,V1)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #7: input, references = 11, size of lhs = 2:
% 0.47/0.64 P_n0-{F}(V0), equalish-{F}(V1,V2) | equalish-{T}(V2,V1)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #8: input, references = 7, size of lhs = 3:
% 0.47/0.64 P_n0-{F}(V0), equalish-{F}(V1,V2), equalish-{F}(V3,V1) | equalish-{T}(V3,V2)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #9: input, references = 4, size of lhs = 3:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2) | equalish-{T}(V1,V2)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #10: input, references = 5, size of lhs = 7:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_a-{F}(V3), P_add-{F}(V3,V2,V4), P_successor-{F}(V3,V5), equalish-{F}(V4,V5) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #11: input, references = 4, size of lhs = 8:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_a-{F}(V3), P_add-{F}(V3,V2,V4), P_successor-{F}(V3,V5), P_successor-{F}(V6,V7), equalish-{F}(V7,V0) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #12: input, references = 9, size of lhs = 2:
% 0.47/0.64 #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #13: input, references = 4, size of lhs = 0:
% 0.47/0.64 FALSE | EXISTS V0: P_n0-{T}(V0)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #14: input, references = 14, size of lhs = 1:
% 0.47/0.64 #-{F} V0 | EXISTS V1: P_successor-{T}(V0,V1)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #15: input, references = 3, size of lhs = 2:
% 0.47/0.64 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #16: input, references = 4, size of lhs = 0:
% 0.47/0.64 FALSE | EXISTS V0: P_n1-{T}(V0)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #17: input, references = 5, size of lhs = 0:
% 0.47/0.64 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 number of initial rules = 18
% 0.47/0.64
% 0.47/0.64 Simplifiers:
% 0.47/0.64 #18: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #19: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_n0-{F}(V0), P_n0-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #20: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_successor-{F}(V0,V1), P_successor-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #21: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #22: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_n1-{F}(V0), P_n1-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #23: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 number of simplifiers = 6
% 0.47/0.64
% 0.47/0.64 Learnt:
% 0.47/0.64 #25: exists( #12, #11 ), references = 4, size of lhs = 7:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_a-{F}(V3), P_successor-{F}(V3,V4), equalish-{F}(V5,V0), P_successor-{F}(V6,V5) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #31: mergings( V0 == V2, V2 == V3; #28 ), references = 1, size of lhs = 4:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V0), P_a-{F}(V1), P_successor-{F}(V1,V2) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #35: mergings( V2 == V3, V3 == V4; #32 ), references = 1, size of lhs = 3:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V0), P_a-{F}(V1) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #39: mergings( V1 == V2, V2 == V3; #36 ), references = 1, size of lhs = 2:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V0) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #41: exists( #14, #25 ), references = 4, size of lhs = 5:
% 0.47/0.64 P_n0-{F}(V0), P_a-{F}(V0), P_n1-{F}(V1), equalish-{F}(V2,V0), P_successor-{F}(V3,V2) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #53: mergings( V2 == V3, V3 == V4; #49 ), references = 1, size of lhs = 6:
% 0.47/0.64 P_n0-{F}(V0), P_a-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V2,V3), P_add-{F}(V4,V3,V0), P_add-{F}(V4,V2,V5) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #105: mergings( V2 == V3, V3 == V4, V4 == V5; #100 ), references = 4, size of lhs = 7:
% 0.47/0.64 P_n0-{F}(V0), P_a-{F}(V0), equalish-{F}(V0,V1), P_n1-{F}(V2), P_successor-{F}(V3,V4), P_add-{F}(V5,V4,V1), P_add-{F}(V5,V3,V6) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #109: mergings( V2 == V3, V3 == V4, V4 == V5; #101 ), references = 3, size of lhs = 9:
% 0.47/0.64 P_n0-{F}(V0), equalish-{F}(V0,V1), P_n1-{F}(V2), P_successor-{F}(V0,V3), P_a-{F}(V4), P_successor-{F}(V4,V5), P_successor-{F}(V6,V7), P_add-{F}(V8,V7,V1), P_add-{F}(V8,V6,V9) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #118: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #112 ), references = 1, size of lhs = 7:
% 0.47/0.64 P_n0-{F}(V0), P_a-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V2,V2), P_multiply-{F}(V2,V3,V0), P_successor-{F}(V4,V3), P_multiply-{F}(V2,V4,V5) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #139: mergings( V2 == V3, V3 == V4; #135 ), references = 1, size of lhs = 10:
% 0.47/0.64 P_n0-{F}(V0), P_a-{F}(V0), P_successor-{F}(V0,V1), P_n1-{F}(V2), P_successor-{F}(V3,V4), P_add-{F}(V5,V4,V1), P_add-{F}(V5,V3,V6), P_successor-{F}(V7,V8), P_add-{F}(V9,V8,V6), P_add-{F}(V9,V7,V10) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #143: mergings( V2 == V3, V3 == V4, V5 == V7; #136 ), references = 1, size of lhs = 11:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_a-{F}(V3), P_successor-{F}(V3,V4), P_successor-{F}(V5,V6), P_add-{F}(V7,V6,V2), P_add-{F}(V7,V5,V8), P_successor-{F}(V9,V10), P_add-{F}(V11,V10,V8), P_add-{F}(V11,V9,V12) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #189: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #182 ), references = 1, size of lhs = 10:
% 0.47/0.64 P_n0-{F}(V0), P_a-{F}(V0), P_successor-{F}(V0,V1), P_successor-{F}(V1,V2), P_n1-{F}(V3), P_successor-{F}(V4,V5), P_add-{F}(V6,V5,V2), P_add-{F}(V6,V4,V7), P_successor-{F}(V8,V7), P_successor-{F}(V9,V8) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #195: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V7 == V10; #183 ), references = 1, size of lhs = 11:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_successor-{F}(V2,V3), P_a-{F}(V4), P_successor-{F}(V4,V5), P_successor-{F}(V6,V7), P_add-{F}(V8,V7,V3), P_add-{F}(V8,V6,V9), P_successor-{F}(V10,V9), P_successor-{F}(V11,V10) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #201: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V8 == V0; #184 ), references = 1, size of lhs = 11:
% 0.47/0.64 P_n0-{F}(V0), P_a-{F}(V0), P_successor-{F}(V0,V1), P_successor-{F}(V1,V2), P_n1-{F}(V3), P_successor-{F}(V4,V5), P_add-{F}(V6,V5,V2), P_add-{F}(V6,V4,V2), P_successor-{F}(V7,V8), P_add-{F}(V9,V8,V2), P_add-{F}(V9,V7,V10) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #209: mergings( V3 == V4; #207 ), references = 1, size of lhs = 8:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_a-{F}(V3), P_successor-{F}(V3,V4), P_successor-{F}(V5,V2), P_add-{F}(V3,V5,V6), P_successor-{F}(V6,V4) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #233: mergings( V3 == V4; #230 ), references = 1, size of lhs = 8:
% 0.47/0.64 P_n0-{F}(V0), P_a-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V2,V3), P_multiply-{F}(V4,V3,V0), P_multiply-{F}(V4,V2,V5), P_successor-{F}(V6,V4), P_add-{F}(V5,V6,V7) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #235: mergings( V3 == V4; #231 ), references = 1, size of lhs = 10:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_a-{F}(V3), P_successor-{F}(V3,V4), P_successor-{F}(V5,V6), P_multiply-{F}(V7,V6,V0), P_multiply-{F}(V7,V5,V8), P_successor-{F}(V9,V7), P_add-{F}(V8,V9,V10) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #241: mergings( V3 == V4, V4 == V5; #238 ), references = 1, size of lhs = 9:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_a-{F}(V3), P_successor-{F}(V3,V4), P_successor-{F}(V5,V2), P_add-{F}(V3,V5,V6), P_successor-{F}(V6,V7), equalish-{F}(V7,V4) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #249: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #244 ), references = 1, size of lhs = 9:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_a-{F}(V3), P_successor-{F}(V3,V4), P_successor-{F}(V5,V4), equalish-{F}(V5,V6), P_successor-{F}(V7,V2), P_add-{F}(V3,V7,V6) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #259: mergings( V1 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8; #252 ), references = 2, size of lhs = 5:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_successor-{F}(V0,V2), P_a-{F}(V3), P_successor-{F}(V3,V4) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #266: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V0; #260 ), references = 1, size of lhs = 3:
% 0.47/0.64 P_n0-{F}(V0), P_a-{F}(V0), P_n1-{F}(V1) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #268: exists( #14, #259 ), references = 1, size of lhs = 4:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_a-{F}(V2), P_successor-{F}(V2,V3) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #270: exists( #14, #267 ), references = 1, size of lhs = 3:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1), P_a-{F}(V2) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #272: exists( #17, #269 ), references = 1, size of lhs = 2:
% 0.47/0.64 P_n0-{F}(V0), P_n1-{F}(V1) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #274: exists( #16, #271 ), references = 1, size of lhs = 1:
% 0.47/0.64 P_n0-{F}(V0) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #276: exists( #13, #273 ), references = 1, size of lhs = 0:
% 0.47/0.64 FALSE | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 number of learnt formulas = 26
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.64
% 0.47/0.64 randbase = 1
%------------------------------------------------------------------------------