%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n021.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:15:10 EDT 2022
% Result : Unsatisfiable 0.47s 0.66s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% 0.08/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jul 22 07:32:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.47/0.66 GeoParameters:
% 0.47/0.66
% 0.47/0.66 tptp_input = 1
% 0.47/0.66 tptp_output = 0
% 0.47/0.66 nonempty = 1
% 0.47/0.66 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.66 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.47/0.66
% 0.47/0.66
% 0.47/0.66 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.66 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.66
% 0.47/0.66 RuleSystem INPUT:
% 0.47/0.66
% 0.47/0.66 Initial Rules:
% 0.47/0.66 #0: input, references = 5, size of lhs = 5:
% 0.47/0.66 P_add-{F}(V1,V2,V3), P_add-{F}(V0,V3,V4), P_add-{F}(V0,V1,V5), P_add-{F}(V5,V2,V6), V4 == V6 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #1: input, references = 4, size of lhs = 3:
% 0.47/0.66 P_add-{F}(V0,V1,V2), P_add-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #2: input, references = 4, size of lhs = 3:
% 0.47/0.66 P_mult-{F}(V0,V1,V2), P_mult-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #3: input, references = 6, size of lhs = 6:
% 0.47/0.66 P_add-{F}(V1,V2,V3), P_mult-{F}(V0,V3,V4), P_mult-{F}(V0,V1,V5), P_mult-{F}(V0,V2,V6), P_add-{F}(V5,V6,V7), V4 == V7 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #4: input, references = 4, size of lhs = 3:
% 0.47/0.66 P_zero-{F}(V0), P_add-{F}(V0,V1,V2), V2 == V1 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #5: input, references = 4, size of lhs = 4:
% 0.47/0.66 P_zero-{F}(V0), P_unit-{F}(V1), P_mult-{F}(V2,V1,V3), V3 == V2 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #6: input, references = 6, size of lhs = 6:
% 0.47/0.66 P_zero-{F}(V0), P_unit-{F}(V1), P_mult-{F}(V2,V2,V3), P_add-{F}(V2,V3,V4), P_add-{F}(V1,V4,V5), V5 == V2 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #7: input, references = 5, size of lhs = 6:
% 0.47/0.66 P_zero-{F}(V0), P_unit-{F}(V1), P_x0-{F}(V2), P_x1-{F}(V3), P_add-{F}(V2,V3,V5), P_mult-{F}(V2,V3,V5) | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #8: input, references = 9, size of lhs = 2:
% 0.47/0.66 #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #9: input, references = 9, size of lhs = 2:
% 0.47/0.66 #-{F} V0, #-{F} V1 | EXISTS V2: P_mult-{T}(V0,V1,V2)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #10: input, references = 4, size of lhs = 0:
% 0.47/0.66 FALSE | EXISTS V0: P_zero-{T}(V0)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #11: input, references = 4, size of lhs = 0:
% 0.47/0.66 FALSE | EXISTS V0: P_unit-{T}(V0)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #12: input, references = 4, size of lhs = 0:
% 0.47/0.66 FALSE | EXISTS V0: P_x0-{T}(V0)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #13: input, references = 5, size of lhs = 0:
% 0.47/0.66 FALSE | EXISTS V0: P_x1-{T}(V0)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 number of initial rules = 14
% 0.47/0.66
% 0.47/0.66 Simplifiers:
% 0.47/0.66 #14: unsound, references = 3, size of lhs = 3:
% 0.47/0.66 P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #15: unsound, references = 3, size of lhs = 3:
% 0.47/0.66 P_mult-{F}(V0,V1,V2), P_mult-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #16: unsound, references = 3, size of lhs = 3:
% 0.47/0.66 P_zero-{F}(V0), P_zero-{F}(V1), V0 == V1 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #17: unsound, references = 3, size of lhs = 3:
% 0.47/0.66 P_unit-{F}(V0), P_unit-{F}(V1), V0 == V1 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #18: unsound, references = 3, size of lhs = 3:
% 0.47/0.66 P_x0-{F}(V0), P_x0-{F}(V1), V0 == V1 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #19: unsound, references = 3, size of lhs = 3:
% 0.47/0.66 P_x1-{F}(V0), P_x1-{F}(V1), V0 == V1 | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 number of simplifiers = 6
% 0.47/0.66
% 0.47/0.66 Learnt:
% 0.47/0.66 #21: exists( #8, #4 ), references = 8, size of lhs = 2:
% 0.47/0.66 P_zero-{F}(V0), #-{F} V1 | P_add-{T}(V0,V1,V1)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #23: exists( #8, #1 ), references = 6, size of lhs = 1:
% 0.47/0.66 P_add-{F}(V0,V1,V2) | P_add-{T}(V1,V0,V2)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #25: exists( #9, #5 ), references = 5, size of lhs = 3:
% 0.47/0.66 P_zero-{F}(V0), P_unit-{F}(V1), #-{F} V2 | P_mult-{T}(V2,V1,V2)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #27: exists( #8, #3 ), references = 5, size of lhs = 4:
% 0.47/0.66 P_add-{F}(V0,V1,V2), P_mult-{F}(V3,V2,V4), P_mult-{F}(V3,V0,V5), P_mult-{F}(V3,V1,V6) | P_add-{T}(V5,V6,V4)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #32: mergings( V2 == V3; #30 ), references = 3, size of lhs = 4:
% 0.47/0.66 P_unit-{F}(V0), P_zero-{F}(V0), P_mult-{F}(V1,V2,V1), P_add-{F}(V2,V1,V1) | P_mult-{T}(V1,V1,V1)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #34: exists( #9, #2 ), references = 3, size of lhs = 1:
% 0.47/0.66 P_mult-{F}(V0,V1,V2) | P_mult-{T}(V1,V0,V2)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #42: mergings( V1 == V2, V2 == V3, V3 == V4; #38 ), references = 1, size of lhs = 3:
% 0.47/0.66 P_x0-{F}(V0), P_zero-{F}(V0), P_unit-{F}(V0) | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #46: exists( #9, #44 ), references = 3, size of lhs = 5:
% 0.47/0.66 P_add-{F}(V0,V1,V1), P_mult-{F}(V2,V0,V3), P_mult-{F}(V2,V4,V3), P_add-{F}(V4,V1,V5), P_mult-{F}(V2,V5,V6) | P_mult-{T}(V1,V2,V6)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #52: exists( #8, #0 ), references = 2, size of lhs = 3:
% 0.47/0.66 P_add-{F}(V0,V1,V2), P_add-{F}(V3,V0,V4), P_add-{F}(V4,V1,V5) | P_add-{T}(V3,V2,V5)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #66: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #61 ), references = 1, size of lhs = 9:
% 0.47/0.66 P_zero-{F}(V0), P_unit-{F}(V0), P_x0-{F}(V1), P_add-{F}(V2,V1,V1), P_x1-{F}(V3), P_add-{F}(V0,V3,V3), P_add-{F}(V3,V3,V3), P_mult-{F}(V3,V2,V4), P_mult-{F}(V3,V3,V4) | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #78: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7; #71 ), references = 1, size of lhs = 5:
% 0.47/0.66 P_zero-{F}(V0), P_add-{F}(V0,V0,V0), P_unit-{F}(V0), P_x0-{F}(V1), P_add-{F}(V0,V1,V1) | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #87: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7; #80 ), references = 2, size of lhs = 3:
% 0.47/0.66 P_zero-{F}(V0), P_add-{F}(V0,V0,V0), P_unit-{F}(V0) | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #90: exists( #8, #88 ), references = 1, size of lhs = 4:
% 0.47/0.66 P_zero-{F}(V0), P_unit-{F}(V1), P_mult-{F}(V2,V2,V3), P_add-{F}(V2,V3,V4) | P_add-{T}(V4,V1,V2)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #94: exists( #9, #3 ), references = 1, size of lhs = 4:
% 0.47/0.66 P_add-{F}(V0,V1,V2), P_mult-{F}(V3,V0,V4), P_mult-{F}(V3,V1,V5), P_add-{F}(V4,V5,V6) | P_mult-{T}(V3,V2,V6)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #105: exists( #9, #103 ), references = 2, size of lhs = 6:
% 0.47/0.66 P_zero-{F}(V0), P_add-{F}(V1,V2,V0), P_mult-{F}(V3,V4,V1), P_add-{F}(V5,V4,V6), P_mult-{F}(V3,V6,V7), P_add-{F}(V7,V2,V8) | P_mult-{T}(V3,V5,V8)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #115: mergings( V3 == V6, V1 == V2, V2 == V6, V6 == V4; #110 ), references = 1, size of lhs = 3:
% 0.47/0.66 P_zero-{F}(V0), P_add-{F}(V0,V0,V0), P_add-{F}(V0,V1,V0) | P_unit-{T}(V0)
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 #119: exists( #10, #117 ), references = 1, size of lhs = 0:
% 0.47/0.66 FALSE | FALSE
% 0.47/0.66 (used 0 times, uses = {})
% 0.47/0.66
% 0.47/0.66 number of learnt formulas = 17
% 0.47/0.66
% 0.47/0.66
% 0.47/0.66 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.66
% 0.47/0.66 randbase = 1
%------------------------------------------------------------------------------