TSTP Solution File: RNG007-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : RNG007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n010.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:14:51 EDT 2022
% Result : Unsatisfiable 0.47s 0.67s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG007-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 : n010.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 07:25:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.47/0.67 GeoParameters:
% 0.47/0.67
% 0.47/0.67 tptp_input = 1
% 0.47/0.67 tptp_output = 0
% 0.47/0.67 nonempty = 1
% 0.47/0.67 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.67 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.47/0.67
% 0.47/0.67
% 0.47/0.67 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.67 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.67
% 0.47/0.67 RuleSystem INPUT:
% 0.47/0.67
% 0.47/0.67 Initial Rules:
% 0.47/0.67 #0: input, references = 4, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), #-{F} V1 | sum-{T}(V0,V1,V1)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #1: input, references = 7, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), #-{F} V1 | sum-{T}(V1,V0,V1)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #2: input, references = 5, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V3) | product-{T}(V1,V2,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #3: input, references = 6, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3) | sum-{T}(V1,V2,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #4: input, references = 5, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2) | sum-{T}(V2,V1,V0)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #5: input, references = 4, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2) | sum-{T}(V1,V2,V0)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #6: input, references = 5, size of lhs = 4:
% 0.47/0.67 P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3), sum-{F}(V5,V2,V4), sum-{F}(V6,V5,V1) | sum-{T}(V6,V4,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #7: input, references = 6, size of lhs = 4:
% 0.47/0.67 P_additive_identity-{F}(V0), sum-{F}(V5,V2,V4), sum-{F}(V6,V5,V1), sum-{F}(V6,V4,V3) | sum-{T}(V1,V2,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #8: input, references = 3, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3) | sum-{T}(V2,V1,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #9: input, references = 5, size of lhs = 4:
% 0.47/0.67 P_additive_identity-{F}(V0), product-{F}(V1,V2,V3), product-{F}(V5,V2,V4), product-{F}(V6,V5,V1) | product-{T}(V6,V4,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #10: input, references = 3, size of lhs = 4:
% 0.47/0.67 P_additive_identity-{F}(V0), product-{F}(V5,V2,V4), product-{F}(V6,V5,V1), product-{F}(V6,V4,V3) | product-{T}(V1,V2,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #11: input, references = 4, size of lhs = 5:
% 0.47/0.67 P_additive_identity-{F}(V0), product-{F}(V5,V4,V3), product-{F}(V5,V6,V2), product-{F}(V5,V7,V1), sum-{F}(V7,V6,V4) | sum-{T}(V1,V2,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #12: input, references = 4, size of lhs = 5:
% 0.47/0.67 P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3), product-{F}(V5,V6,V2), product-{F}(V5,V7,V1), sum-{F}(V7,V6,V4) | product-{T}(V5,V4,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #13: input, references = 4, size of lhs = 5:
% 0.47/0.67 P_additive_identity-{F}(V0), product-{F}(V4,V5,V3), product-{F}(V6,V5,V2), product-{F}(V7,V5,V1), sum-{F}(V7,V6,V4) | sum-{T}(V1,V2,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #14: input, references = 3, size of lhs = 5:
% 0.47/0.67 P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3), product-{F}(V6,V5,V2), product-{F}(V7,V5,V1), sum-{F}(V7,V6,V4) | product-{T}(V4,V5,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #15: input, references = 7, size of lhs = 4:
% 0.47/0.67 P_additive_identity-{F}(V0), sum-{F}(V4,V3,V1), sum-{F}(V4,V3,V2), V1 == V2 | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #16: input, references = 4, size of lhs = 4:
% 0.47/0.67 P_additive_identity-{F}(V0), product-{F}(V4,V3,V1), product-{F}(V4,V3,V2), V1 == V2 | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #17: input, references = 6, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), #-{F} V1 | product-{T}(V1,V1,V1)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #18: input, references = 4, size of lhs = 3:
% 0.47/0.67 P_additive_identity-{F}(V0), P_a-{F}(V1), sum-{F}(V1,V1,V0) | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #19: input, references = 4, size of lhs = 0:
% 0.47/0.67 FALSE | EXISTS V0: P_additive_identity-{T}(V0)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #20: input, references = 5, size of lhs = 2:
% 0.47/0.67 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #21: input, references = 5, size of lhs = 2:
% 0.47/0.67 #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #22: input, references = 4, size of lhs = 1:
% 0.47/0.67 #-{F} V0 | EXISTS V1: P_additive_inverse-{T}(V0,V1)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #23: input, references = 4, size of lhs = 0:
% 0.47/0.67 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 number of initial rules = 24
% 0.47/0.67
% 0.47/0.67 Simplifiers:
% 0.47/0.67 #24: unsound, references = 3, size of lhs = 3:
% 0.47/0.67 P_additive_identity-{F}(V0), P_additive_identity-{F}(V1), V0 == V1 | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #25: unsound, references = 3, size of lhs = 3:
% 0.47/0.67 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #26: unsound, references = 3, size of lhs = 3:
% 0.47/0.67 P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #27: unsound, references = 3, size of lhs = 3:
% 0.47/0.67 P_additive_inverse-{F}(V0,V1), P_additive_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #28: unsound, references = 3, size of lhs = 3:
% 0.47/0.67 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 number of simplifiers = 5
% 0.47/0.67
% 0.47/0.67 Learnt:
% 0.47/0.67 #32: mergings( V3 == V4; #30 ), references = 1, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), product-{F}(V1,V2,V3) | P_multiply-{T}(V1,V2,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #64: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10; #56 ), references = 1, size of lhs = 8:
% 0.47/0.67 P_additive_identity-{F}(V0), sum-{F}(V1,V2,V0), product-{F}(V3,V4,V1), product-{F}(V5,V3,V6), product-{F}(V6,V5,V7), sum-{F}(V7,V4,V8), product-{F}(V3,V8,V9), sum-{F}(V9,V2,V10) | P_multiply-{T}(V3,V5,V10)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #68: mergings( V3 == V4; #66 ), references = 1, size of lhs = 2:
% 0.47/0.67 P_additive_identity-{F}(V0), sum-{F}(V1,V2,V3) | P_add-{T}(V1,V2,V3)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #92: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6, V6 == V7, V7 == V8, V8 == V9, V9 == V10; #83 ), references = 2, size of lhs = 6:
% 0.47/0.67 P_additive_identity-{F}(V0), product-{F}(V1,V1,V1), sum-{F}(V1,V2,V3), sum-{F}(V1,V3,V4), sum-{F}(V4,V5,V0), sum-{F}(V4,V5,V6) | P_add-{T}(V1,V1,V6)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #108: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #103 ), references = 2, size of lhs = 4:
% 0.47/0.67 P_additive_identity-{F}(V0), product-{F}(V1,V1,V1), sum-{F}(V1,V0,V1), sum-{F}(V0,V1,V2) | P_additive_inverse-{T}(V1,V2)
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #117: mergings( V1 == V2, V2 == V3; #114 ), references = 1, size of lhs = 1:
% 0.47/0.67 P_additive_identity-{F}(V0) | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 #119: exists( #19, #114 ), references = 1, size of lhs = 0:
% 0.47/0.67 FALSE | FALSE
% 0.47/0.67 (used 0 times, uses = {})
% 0.47/0.67
% 0.47/0.67 number of learnt formulas = 7
% 0.47/0.67
% 0.47/0.67
% 0.47/0.67 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.67
% 0.47/0.67 randbase = 1
%------------------------------------------------------------------------------