TSTP Solution File: NUM025-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : NUM025-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n026.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.10s 0.32s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : NUM025-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.09/0.11 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.10/0.31 % Computer : n026.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri Jul 22 23:26:05 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.10/0.32 GeoParameters:
% 0.10/0.32
% 0.10/0.32 tptp_input = 1
% 0.10/0.32 tptp_output = 0
% 0.10/0.32 nonempty = 1
% 0.10/0.32 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.32 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.10/0.32
% 0.10/0.32
% 0.10/0.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.32 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.32
% 0.10/0.32 RuleSystem INPUT:
% 0.10/0.32
% 0.10/0.32 Initial Rules:
% 0.10/0.32 #0: input, references = 3, size of lhs = 2:
% 0.10/0.32 P_n0-{F}(V0), P_add-{F}(V1,V0,V2) | equalish-{T}(V2,V1)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #1: input, references = 3, size of lhs = 5:
% 0.10/0.32 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.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #2: input, references = 3, size of lhs = 2:
% 0.10/0.32 P_n0-{F}(V0), P_multiply-{F}(V1,V0,V2) | equalish-{T}(V2,V0)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #3: input, references = 3, size of lhs = 5:
% 0.10/0.32 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.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #4: input, references = 3, size of lhs = 4:
% 0.10/0.32 P_n0-{F}(V0), P_successor-{F}(V1,V3), P_successor-{F}(V2,V4), equalish-{F}(V3,V4) | equalish-{T}(V1,V2)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #5: input, references = 3, size of lhs = 4:
% 0.10/0.32 P_n0-{F}(V0), P_successor-{F}(V1,V3), P_successor-{F}(V2,V4), equalish-{F}(V1,V2) | equalish-{T}(V3,V4)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #6: input, references = 4, size of lhs = 3:
% 0.10/0.32 P_n0-{F}(V0), less-{F}(V3,V1), less-{F}(V2,V3) | less-{T}(V2,V1)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #7: input, references = 3, size of lhs = 4:
% 0.10/0.32 P_n0-{F}(V0), P_successor-{F}(V3,V4), P_add-{F}(V4,V1,V5), equalish-{F}(V5,V2) | less-{T}(V1,V2)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #8: input, references = 3, size of lhs = 5:
% 0.10/0.32 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.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #9: input, references = 3, size of lhs = 2:
% 0.10/0.32 P_n0-{F}(V0), #-{F} V1 | equalish-{T}(V1,V1)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #10: input, references = 3, size of lhs = 2:
% 0.10/0.32 P_n0-{F}(V0), equalish-{F}(V1,V2) | equalish-{T}(V2,V1)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #11: input, references = 3, size of lhs = 3:
% 0.10/0.32 P_n0-{F}(V0), equalish-{F}(V1,V2), equalish-{F}(V3,V1) | equalish-{T}(V3,V2)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #12: input, references = 3, size of lhs = 3:
% 0.10/0.32 P_n0-{F}(V0), P_successor-{F}(V1,V2), equalish-{F}(V2,V0) | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #13: input, references = 4, size of lhs = 2:
% 0.10/0.32 P_n0-{F}(V0), less-{F}(V1,V1) | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #14: input, references = 4, size of lhs = 3:
% 0.10/0.32 P_n0-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | less-{T}(V1,V2)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #15: input, references = 4, size of lhs = 3:
% 0.10/0.32 P_n0-{F}(V0), P_a-{F}(V1), P_b-{F}(V2) | less-{T}(V2,V1)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #16: input, references = 3, size of lhs = 2:
% 0.10/0.32 #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #17: input, references = 4, size of lhs = 0:
% 0.10/0.32 FALSE | EXISTS V0: P_n0-{T}(V0)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #18: input, references = 3, size of lhs = 1:
% 0.10/0.32 #-{F} V0 | EXISTS V1: P_successor-{T}(V0,V1)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #19: input, references = 3, size of lhs = 2:
% 0.10/0.32 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #20: input, references = 3, size of lhs = 2:
% 0.10/0.32 #-{F} V0, #-{F} V1 | EXISTS V2: P_predecessor_of_1st_minus_2nd-{T}(V0,V1,V2)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #21: input, references = 4, size of lhs = 0:
% 0.10/0.32 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #22: input, references = 4, size of lhs = 0:
% 0.10/0.32 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 number of initial rules = 23
% 0.10/0.32
% 0.10/0.32 Simplifiers:
% 0.10/0.32 #23: unsound, references = 3, size of lhs = 3:
% 0.10/0.32 P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #24: unsound, references = 3, size of lhs = 3:
% 0.10/0.32 P_n0-{F}(V0), P_n0-{F}(V1), V0 == V1 | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #25: unsound, references = 3, size of lhs = 3:
% 0.10/0.32 P_successor-{F}(V0,V1), P_successor-{F}(V0,V3), V1 == V3 | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #26: unsound, references = 3, size of lhs = 3:
% 0.10/0.32 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #27: unsound, references = 3, size of lhs = 3:
% 0.10/0.32 P_predecessor_of_1st_minus_2nd-{F}(V0,V1,V2), P_predecessor_of_1st_minus_2nd-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #28: unsound, references = 3, size of lhs = 3:
% 0.10/0.32 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #29: unsound, references = 3, size of lhs = 3:
% 0.10/0.32 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 number of simplifiers = 7
% 0.10/0.32
% 0.10/0.32 Learnt:
% 0.10/0.32 #37: mergings( V1 == V2, V2 == V4, V4 == V5; #33 ), references = 1, size of lhs = 2:
% 0.10/0.32 P_a-{F}(V0), P_n0-{F}(V1) | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #42: mergings( V1 == V2, V2 == V3, V3 == V4; #38 ), references = 1, size of lhs = 1:
% 0.10/0.32 P_n0-{F}(V0) | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 #44: exists( #17, #38 ), references = 1, size of lhs = 0:
% 0.10/0.32 FALSE | FALSE
% 0.10/0.32 (used 0 times, uses = {})
% 0.10/0.32
% 0.10/0.32 number of learnt formulas = 3
% 0.10/0.32
% 0.10/0.32
% 0.10/0.32 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.32
% 0.10/0.32 randbase = 1
%------------------------------------------------------------------------------