TSTP Solution File: NUM023-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n006.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.84s 1.06s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n006.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 23:26:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.84/1.06 GeoParameters:
% 0.84/1.06
% 0.84/1.06 tptp_input = 1
% 0.84/1.06 tptp_output = 0
% 0.84/1.06 nonempty = 1
% 0.84/1.06 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.06 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.84/1.06
% 0.84/1.06
% 0.84/1.06 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.06 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.06
% 0.84/1.06 RuleSystem INPUT:
% 0.84/1.06
% 0.84/1.06 Initial Rules:
% 0.84/1.06 #0: input, references = 7, size of lhs = 2:
% 0.84/1.06 P_n0-{F}(V0), P_add-{F}(V1,V0,V2) | equalish-{T}(V2,V1)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #1: input, references = 8, size of lhs = 5:
% 0.84/1.06 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.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #2: input, references = 3, size of lhs = 2:
% 0.84/1.06 P_n0-{F}(V0), P_multiply-{F}(V1,V0,V2) | equalish-{T}(V2,V0)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #3: input, references = 4, size of lhs = 5:
% 0.84/1.06 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.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #4: input, references = 4, size of lhs = 4:
% 0.84/1.06 P_n0-{F}(V0), P_successor-{F}(V1,V3), P_successor-{F}(V2,V4), equalish-{F}(V3,V4) | equalish-{T}(V1,V2)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #5: input, references = 4, size of lhs = 4:
% 0.84/1.06 P_n0-{F}(V0), P_successor-{F}(V1,V3), P_successor-{F}(V2,V4), equalish-{F}(V1,V2) | equalish-{T}(V3,V4)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #6: input, references = 6, size of lhs = 3:
% 0.84/1.06 P_n0-{F}(V0), less-{F}(V3,V1), less-{F}(V2,V3) | less-{T}(V2,V1)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #7: input, references = 7, size of lhs = 4:
% 0.84/1.06 P_n0-{F}(V0), P_successor-{F}(V3,V4), P_add-{F}(V4,V1,V5), equalish-{F}(V5,V2) | less-{T}(V1,V2)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #8: input, references = 3, size of lhs = 5:
% 0.84/1.06 P_n0-{F}(V0), P_predecessor_of_1st_minus_2nd-{F}(V2,V1,V3), P_successor-{F}(V3,V4), P_add-{F}(V4,V1,V5), less-{F}(V1,V2) | equalish-{T}(V5,V2)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #9: input, references = 4, size of lhs = 2:
% 0.84/1.06 P_n0-{F}(V0), #-{F} V1 | equalish-{T}(V1,V1)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #10: input, references = 7, size of lhs = 2:
% 0.84/1.06 P_n0-{F}(V0), equalish-{F}(V1,V2) | equalish-{T}(V2,V1)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #11: input, references = 9, size of lhs = 3:
% 0.84/1.06 P_n0-{F}(V0), equalish-{F}(V1,V2), equalish-{F}(V3,V1) | equalish-{T}(V3,V2)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #12: input, references = 5, size of lhs = 3:
% 0.84/1.06 P_n0-{F}(V0), P_successor-{F}(V1,V2), equalish-{F}(V2,V0) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #13: input, references = 6, size of lhs = 2:
% 0.84/1.06 P_n0-{F}(V0), P_successor-{F}(V1,V2) | less-{T}(V1,V2)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #14: input, references = 7, size of lhs = 4:
% 0.84/1.06 P_n0-{F}(V0), P_a-{F}(V1), P_successor-{F}(V1,V2), less-{F}(V0,V2) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #15: input, references = 11, size of lhs = 2:
% 0.84/1.06 #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #16: input, references = 4, size of lhs = 0:
% 0.84/1.06 FALSE | EXISTS V0: P_n0-{T}(V0)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #17: input, references = 10, size of lhs = 1:
% 0.84/1.06 #-{F} V0 | EXISTS V1: P_successor-{T}(V0,V1)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #18: input, references = 3, size of lhs = 2:
% 0.84/1.06 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #19: input, references = 3, size of lhs = 2:
% 0.84/1.06 #-{F} V0, #-{F} V1 | EXISTS V2: P_predecessor_of_1st_minus_2nd-{T}(V0,V1,V2)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #20: input, references = 4, size of lhs = 0:
% 0.84/1.06 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 number of initial rules = 21
% 0.84/1.06
% 0.84/1.06 Simplifiers:
% 0.84/1.06 #21: unsound, references = 3, size of lhs = 3:
% 0.84/1.06 P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #22: unsound, references = 3, size of lhs = 3:
% 0.84/1.06 P_n0-{F}(V0), P_n0-{F}(V1), V0 == V1 | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #23: unsound, references = 3, size of lhs = 3:
% 0.84/1.06 P_successor-{F}(V0,V1), P_successor-{F}(V0,V3), V1 == V3 | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #24: unsound, references = 3, size of lhs = 3:
% 0.84/1.06 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #25: unsound, references = 3, size of lhs = 3:
% 0.84/1.06 P_predecessor_of_1st_minus_2nd-{F}(V0,V1,V2), P_predecessor_of_1st_minus_2nd-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #26: unsound, references = 3, size of lhs = 3:
% 0.84/1.06 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 number of simplifiers = 6
% 0.84/1.06
% 0.84/1.06 Learnt:
% 0.84/1.06 #30: mergings( V2 == V0; #28 ), references = 1, size of lhs = 2:
% 0.84/1.06 P_n0-{F}(V0), P_a-{F}(V0) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #50: mergings( V2 == V3, V3 == V4, V4 == V5; #46 ), references = 2, size of lhs = 4:
% 0.84/1.06 P_n0-{F}(V0), less-{F}(V0,V1), less-{F}(V1,V2), P_a-{F}(V2) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #75: mergings( V3 == V1; #73 ), references = 2, size of lhs = 4:
% 0.84/1.06 P_n0-{F}(V0), P_a-{F}(V1), less-{F}(V2,V1), P_successor-{F}(V3,V2) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #86: mergings( V3 == V4, V4 == V5, V5 == V6; #82 ), references = 2, size of lhs = 8:
% 0.84/1.06 P_n0-{F}(V0), P_a-{F}(V1), equalish-{F}(V2,V1), P_successor-{F}(V3,V2), P_successor-{F}(V4,V5), P_successor-{F}(V6,V5), P_add-{F}(V7,V4,V3), P_successor-{F}(V8,V7) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #97: mergings( V3 == V4, V4 == V1; #94 ), references = 1, size of lhs = 5:
% 0.84/1.06 P_n0-{F}(V0), P_a-{F}(V1), P_successor-{F}(V1,V2), less-{F}(V3,V2), P_successor-{F}(V4,V3) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #103: mergings( V2 == V3, V3 == V4, V4 == V5; #99 ), references = 1, size of lhs = 3:
% 0.84/1.06 P_n0-{F}(V0), P_a-{F}(V1), P_successor-{F}(V2,V1) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #136: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #131 ), references = 1, size of lhs = 13:
% 0.84/1.06 P_n0-{F}(V0), P_a-{F}(V1), P_successor-{F}(V2,V3), P_multiply-{F}(V3,V4,V1), P_successor-{F}(V5,V4), P_multiply-{F}(V3,V5,V6), P_add-{F}(V6,V2,V7), P_successor-{F}(V7,V8), P_successor-{F}(V9,V8), P_successor-{F}(V10,V11), P_successor-{F}(V12,V11), P_add-{F}(V13,V10,V9), P_successor-{F}(V14,V13) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #220: mergings( V2 == V3, V3 == V4; #217 ), references = 1, size of lhs = 4:
% 0.84/1.06 P_n0-{F}(V0), P_successor-{F}(V1,V2), P_add-{F}(V3,V2,V0), P_add-{F}(V3,V1,V4) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #224: mergings( V3 == V4, V4 == V5; #221 ), references = 1, size of lhs = 3:
% 0.84/1.06 P_n0-{F}(V0), P_successor-{F}(V1,V2), P_add-{F}(V3,V2,V0) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #271: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10, V10 == V11; #262 ), references = 1, size of lhs = 12:
% 0.84/1.06 P_n0-{F}(V0), equalish-{F}(V1,V0), equalish-{F}(V2,V1), P_successor-{F}(V2,V3), P_successor-{F}(V4,V3), P_successor-{F}(V5,V6), P_add-{F}(V7,V5,V4), P_successor-{F}(V8,V6), P_add-{F}(V7,V8,V9), P_successor-{F}(V9,V10), P_successor-{F}(V11,V10), P_successor-{F}(V12,V11) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #281: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10; #272 ), references = 1, size of lhs = 10:
% 0.84/1.06 P_n0-{F}(V0), equalish-{F}(V1,V0), equalish-{F}(V2,V1), P_successor-{F}(V2,V3), P_successor-{F}(V4,V3), P_successor-{F}(V5,V6), P_add-{F}(V7,V5,V4), P_successor-{F}(V8,V6), P_add-{F}(V7,V8,V9), P_successor-{F}(V10,V9) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #291: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10; #282 ), references = 2, size of lhs = 8:
% 0.84/1.06 P_n0-{F}(V0), equalish-{F}(V1,V0), equalish-{F}(V2,V1), P_successor-{F}(V3,V4), P_add-{F}(V5,V3,V2), P_successor-{F}(V6,V4), P_add-{F}(V5,V6,V7), P_successor-{F}(V8,V7) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #295: mergings( V1 == V3; #293 ), references = 1, size of lhs = 6:
% 0.84/1.06 P_n0-{F}(V0), equalish-{F}(V1,V0), P_successor-{F}(V0,V2), P_successor-{F}(V3,V2), P_add-{F}(V1,V3,V4), P_successor-{F}(V5,V4) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #324: mergings( V3 == V4, V4 == V1; #321 ), references = 1, size of lhs = 5:
% 0.84/1.06 P_n0-{F}(V0), P_a-{F}(V1), P_successor-{F}(V1,V2), equalish-{F}(V3,V2), P_successor-{F}(V4,V3) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #330: mergings( V2 == V3, V3 == V4, V4 == V5; #326 ), references = 1, size of lhs = 3:
% 0.84/1.06 P_n0-{F}(V0), P_a-{F}(V1), equalish-{F}(V1,V1) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #337: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5; #332 ), references = 1, size of lhs = 1:
% 0.84/1.06 P_n0-{F}(V0) | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 #339: exists( #16, #332 ), references = 1, size of lhs = 0:
% 0.84/1.06 FALSE | FALSE
% 0.84/1.06 (used 0 times, uses = {})
% 0.84/1.06
% 0.84/1.06 number of learnt formulas = 17
% 0.84/1.06
% 0.84/1.06
% 0.84/1.06 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.06
% 0.84/1.06 randbase = 1
%------------------------------------------------------------------------------