TSTP Solution File: RNG012-6 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : RNG012-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n014.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:53 EDT 2022
% Result : Unsatisfiable 2.37s 2.55s
% Output : Refutation 2.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG012-6 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n014.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:27 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.37/2.55 GeoParameters:
% 2.37/2.55
% 2.37/2.55 tptp_input = 1
% 2.37/2.55 tptp_output = 0
% 2.37/2.55 nonempty = 1
% 2.37/2.55 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.37/2.55 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 2.37/2.55
% 2.37/2.55
% 2.37/2.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.37/2.55 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.37/2.55
% 2.37/2.55 RuleSystem INPUT:
% 2.37/2.55
% 2.37/2.55 Initial Rules:
% 2.37/2.55 #0: input, references = 5, size of lhs = 3:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V0,V1,V2), V2 == V1 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #1: input, references = 4, size of lhs = 3:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V0,V2), V2 == V1 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #2: input, references = 4, size of lhs = 3:
% 2.37/2.55 P_additive_identity-{F}(V0), P_multiply-{F}(V0,V1,V2), V2 == V0 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #3: input, references = 4, size of lhs = 3:
% 2.37/2.55 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V0,V2), V2 == V0 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #4: input, references = 5, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2), P_add-{F}(V2,V1,V3), V3 == V0 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #5: input, references = 4, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2), P_add-{F}(V1,V2,V3), V3 == V0 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #6: input, references = 4, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2), P_additive_inverse-{F}(V2,V3), V3 == V1 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #7: input, references = 6, size of lhs = 7:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V2,V3,V4), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V1,V2,V6), P_multiply-{F}(V1,V3,V7), P_add-{F}(V6,V7,V8), V5 == V8 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #8: input, references = 6, size of lhs = 7:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V4), P_multiply-{F}(V4,V3,V5), P_multiply-{F}(V1,V3,V6), P_multiply-{F}(V2,V3,V7), P_add-{F}(V6,V7,V8), V5 == V8 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #9: input, references = 4, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3), P_add-{F}(V2,V1,V4), V3 == V4 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #10: input, references = 6, size of lhs = 6:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V2,V3,V4), P_add-{F}(V1,V4,V5), P_add-{F}(V1,V2,V6), P_add-{F}(V6,V3,V7), V5 == V7 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #11: input, references = 3, size of lhs = 6:
% 2.37/2.55 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V3,V2,V4), P_multiply-{F}(V2,V2,V5), P_multiply-{F}(V1,V5,V6), V4 == V6 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #12: input, references = 3, size of lhs = 6:
% 2.37/2.55 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V1,V3), P_multiply-{F}(V3,V2,V4), P_multiply-{F}(V1,V2,V5), P_multiply-{F}(V1,V5,V6), V4 == V6 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #13: input, references = 5, size of lhs = 9:
% 2.37/2.55 P_additive_identity-{F}(V0), P_associator-{F}(V1,V2,V3,V4), P_multiply-{F}(V1,V2,V5), P_multiply-{F}(V5,V3,V6), P_multiply-{F}(V2,V3,V7), P_multiply-{F}(V1,V7,V8), P_additive_inverse-{F}(V8,V9), P_add-{F}(V6,V9,V10), V4 == V10 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #14: input, references = 6, size of lhs = 7:
% 2.37/2.55 P_additive_identity-{F}(V0), P_commutator-{F}(V1,V2,V3), P_multiply-{F}(V2,V1,V4), P_multiply-{F}(V1,V2,V5), P_additive_inverse-{F}(V5,V6), P_add-{F}(V4,V6,V7), V3 == V7 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #15: input, references = 7, size of lhs = 7:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_additive_inverse-{F}(V1,V2), P_b-{F}(V3), P_additive_inverse-{F}(V3,V4), P_multiply-{F}(V2,V4,V6), P_multiply-{F}(V1,V3,V6) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #16: input, references = 8, size of lhs = 2:
% 2.37/2.55 #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #17: input, references = 4, size of lhs = 0:
% 2.37/2.55 FALSE | EXISTS V0: P_additive_identity-{T}(V0)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #18: input, references = 15, size of lhs = 2:
% 2.37/2.55 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiply-{T}(V0,V1,V2)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #19: input, references = 10, size of lhs = 1:
% 2.37/2.55 #-{F} V0 | EXISTS V1: P_additive_inverse-{T}(V0,V1)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #20: input, references = 4, size of lhs = 3:
% 2.37/2.55 #-{F} V0, #-{F} V1, #-{F} V2 | EXISTS V3: P_associator-{T}(V0,V1,V2,V3)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #21: input, references = 5, size of lhs = 2:
% 2.37/2.55 #-{F} V0, #-{F} V1 | EXISTS V2: P_commutator-{T}(V0,V1,V2)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #22: input, references = 4, size of lhs = 0:
% 2.37/2.55 FALSE | EXISTS V0: P_a-{T}(V0)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #23: input, references = 5, size of lhs = 0:
% 2.37/2.55 FALSE | EXISTS V0: P_b-{T}(V0)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 number of initial rules = 24
% 2.37/2.55
% 2.37/2.55 Simplifiers:
% 2.37/2.55 #24: unsound, references = 3, size of lhs = 3:
% 2.37/2.55 P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #25: unsound, references = 3, size of lhs = 3:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_identity-{F}(V1), V0 == V1 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #26: unsound, references = 3, size of lhs = 3:
% 2.37/2.55 P_multiply-{F}(V0,V1,V2), P_multiply-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #27: unsound, references = 3, size of lhs = 3:
% 2.37/2.55 P_additive_inverse-{F}(V0,V1), P_additive_inverse-{F}(V0,V3), V1 == V3 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #28: unsound, references = 3, size of lhs = 3:
% 2.37/2.55 P_associator-{F}(V0,V1,V2,V3), P_associator-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #29: unsound, references = 3, size of lhs = 3:
% 2.37/2.55 P_commutator-{F}(V0,V1,V2), P_commutator-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #30: unsound, references = 3, size of lhs = 3:
% 2.37/2.55 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #31: unsound, references = 3, size of lhs = 3:
% 2.37/2.55 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 number of simplifiers = 8
% 2.37/2.55
% 2.37/2.55 Learnt:
% 2.37/2.55 #35: exists( #16, #1 ), references = 5, size of lhs = 2:
% 2.37/2.55 P_additive_identity-{F}(V0), #-{F} V1 | P_add-{T}(V1,V0,V1)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #36: exists( #16, #14 ), references = 2, size of lhs = 5:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2), P_multiply-{F}(V3,V4,V1), P_commutator-{F}(V3,V4,V5), P_multiply-{F}(V4,V3,V6) | P_add-{T}(V6,V2,V5)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #37: exists( #16, #13 ), references = 1, size of lhs = 7:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2), P_multiply-{F}(V3,V4,V1), P_multiply-{F}(V3,V5,V6), P_multiply-{F}(V5,V7,V4), P_associator-{F}(V3,V5,V7,V8), P_multiply-{F}(V6,V7,V9) | P_add-{T}(V9,V2,V8)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #46: mergings( V0 == V2; #42 ), references = 1, size of lhs = 1:
% 2.37/2.55 P_additive_identity-{F}(V0) | P_additive_inverse-{T}(V0,V0)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #48: mergings( V2 == V3; #43 ), references = 1, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_multiply-{F}(V2,V1,V3), P_commutator-{F}(V2,V1,V4) | P_additive_inverse-{T}(V3,V4)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #50: exists( #21, #14 ), references = 1, size of lhs = 5:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2), P_multiply-{F}(V3,V4,V1), P_multiply-{F}(V4,V3,V5), P_add-{F}(V5,V2,V6) | P_commutator-{T}(V3,V4,V6)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #52: exists( #18, #3 ), references = 2, size of lhs = 2:
% 2.37/2.55 P_additive_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V1,V0,V0)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #56: exists( #16, #0 ), references = 4, size of lhs = 2:
% 2.37/2.55 P_additive_identity-{F}(V0), #-{F} V1 | P_add-{T}(V0,V1,V1)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #57: exists( #16, #9 ), references = 3, size of lhs = 2:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3) | P_add-{T}(V2,V1,V3)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #58: exists( #16, #10 ), references = 2, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3), P_add-{F}(V4,V3,V5), P_add-{F}(V4,V1,V6) | P_add-{T}(V6,V2,V5)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #61: exists( #18, #2 ), references = 5, size of lhs = 2:
% 2.37/2.55 P_additive_identity-{F}(V0), #-{F} V1 | P_multiply-{T}(V0,V1,V0)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #62: exists( #18, #8 ), references = 2, size of lhs = 5:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3), P_multiply-{F}(V1,V4,V5), P_multiply-{F}(V2,V4,V6), P_add-{F}(V5,V6,V7) | P_multiply-{T}(V3,V4,V7)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #66: mergings( V2 == V3; #64 ), references = 2, size of lhs = 5:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_additive_inverse-{F}(V1,V0), P_b-{F}(V2), P_multiply-{F}(V1,V2,V0) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #69: exists( #23, #67 ), references = 1, size of lhs = 3:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V0), P_additive_inverse-{F}(V0,V0) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #71: exists( #20, #13 ), references = 1, size of lhs = 7:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2), P_multiply-{F}(V3,V4,V1), P_multiply-{F}(V3,V5,V6), P_multiply-{F}(V5,V7,V4), P_multiply-{F}(V6,V7,V8), P_add-{F}(V8,V2,V9) | P_associator-{T}(V3,V5,V7,V9)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #73: exists( #18, #15 ), references = 1, size of lhs = 5:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_additive_inverse-{F}(V1,V1), P_b-{F}(V2), P_additive_inverse-{F}(V2,V2) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #76: exists( #19, #6 ), references = 1, size of lhs = 2:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2) | P_additive_inverse-{T}(V2,V1)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #79: exists( #16, #4 ), references = 3, size of lhs = 2:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2) | P_add-{T}(V2,V1,V0)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #80: exists( #16, #5 ), references = 2, size of lhs = 2:
% 2.37/2.55 P_additive_identity-{F}(V0), P_additive_inverse-{F}(V1,V2) | P_add-{T}(V1,V2,V0)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #83: exists( #18, #7 ), references = 1, size of lhs = 5:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3), P_multiply-{F}(V4,V1,V5), P_multiply-{F}(V4,V2,V6), P_add-{F}(V5,V6,V7) | P_multiply-{T}(V4,V3,V7)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #89: mergings( V2 == V3; #87 ), references = 1, size of lhs = 5:
% 2.37/2.55 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V2,V1,V3), P_commutator-{F}(V2,V1,V4), V4 == V0 | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #92: mergings( V3 == V4; #90 ), references = 1, size of lhs = 3:
% 2.37/2.55 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V3), P_multiply-{F}(V2,V1,V3) | P_commutator-{T}(V2,V1,V0)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #95: exists( #16, #7 ), references = 4, size of lhs = 5:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3), P_multiply-{F}(V4,V3,V5), P_multiply-{F}(V4,V1,V6), P_multiply-{F}(V4,V2,V7) | P_add-{T}(V6,V7,V5)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #96: exists( #16, #8 ), references = 2, size of lhs = 5:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V3), P_multiply-{F}(V3,V4,V5), P_multiply-{F}(V1,V4,V6), P_multiply-{F}(V2,V4,V7) | P_add-{T}(V6,V7,V5)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #103: mergings( V3 == V4, V4 == V5; #100 ), references = 1, size of lhs = 9:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_additive_inverse-{F}(V1,V2), P_b-{F}(V3), P_additive_inverse-{F}(V3,V4), P_multiply-{F}(V1,V3,V5), P_add-{F}(V6,V6,V2), P_add-{F}(V4,V4,V7), P_multiply-{F}(V6,V7,V5) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #107: mergings( V3 == V4, V4 == V5; #104 ), references = 1, size of lhs = 7:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_additive_inverse-{F}(V1,V2), P_add-{F}(V1,V1,V2), P_b-{F}(V3), P_additive_inverse-{F}(V3,V4), P_add-{F}(V4,V4,V3) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #119: mergings( V3 == V4; #117 ), references = 1, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_add-{F}(V3,V1,V4), P_multiply-{F}(V4,V2,V5) | P_multiply-{T}(V3,V2,V5)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #128: mergings( V3 == V4; #126 ), references = 1, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_multiply-{F}(V1,V2,V0), P_add-{F}(V2,V3,V4), P_multiply-{F}(V1,V4,V5) | P_multiply-{T}(V1,V3,V5)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #145: mergings( V3 == V4, V4 == V5; #142 ), references = 2, size of lhs = 6:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V0), P_multiply-{F}(V3,V4,V1), P_add-{F}(V5,V3,V6), P_multiply-{F}(V6,V4,V7), P_add-{F}(V7,V2,V8) | P_multiply-{T}(V5,V4,V8)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #161: mergings( V3 == V4, V4 == V5; #158 ), references = 2, size of lhs = 6:
% 2.37/2.55 P_additive_identity-{F}(V0), P_add-{F}(V1,V2,V0), P_multiply-{F}(V3,V4,V1), P_add-{F}(V5,V4,V6), P_multiply-{F}(V3,V6,V7), P_add-{F}(V7,V2,V8) | P_multiply-{T}(V3,V5,V8)
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #177: mergings( V3 == V4, V4 == V5, V5 == V6, V6 == V7; #172 ), references = 2, size of lhs = 14:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_additive_inverse-{F}(V1,V2), P_b-{F}(V3), P_additive_inverse-{F}(V3,V4), P_multiply-{F}(V1,V3,V5), P_add-{F}(V4,V6,V7), P_multiply-{F}(V8,V7,V0), P_multiply-{F}(V8,V6,V9), P_add-{F}(V2,V8,V10), P_multiply-{F}(V10,V4,V11), P_add-{F}(V11,V9,V5), P_add-{F}(V12,V9,V13), P_add-{F}(V14,V13,V0) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #187: mergings( V3 == V4; #185 ), references = 1, size of lhs = 16:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_additive_inverse-{F}(V1,V2), P_b-{F}(V3), P_additive_inverse-{F}(V3,V4), P_multiply-{F}(V1,V3,V5), P_add-{F}(V4,V6,V7), P_multiply-{F}(V8,V7,V0), P_multiply-{F}(V8,V6,V9), P_add-{F}(V2,V8,V10), P_multiply-{F}(V10,V4,V11), P_add-{F}(V11,V9,V5), P_add-{F}(V12,V9,V13), P_multiply-{F}(V14,V15,V13), P_multiply-{F}(V14,V16,V0), P_add-{F}(V17,V15,V16) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #192: mergings( V3 == V4, V4 == V5; #189 ), references = 2, size of lhs = 11:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_additive_inverse-{F}(V1,V2), P_b-{F}(V3), P_additive_inverse-{F}(V3,V4), P_add-{F}(V2,V1,V5), P_multiply-{F}(V5,V4,V0), P_add-{F}(V4,V3,V6), P_multiply-{F}(V1,V6,V0), P_multiply-{F}(V1,V7,V0), P_add-{F}(V8,V3,V7) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #202: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #197 ), references = 1, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_b-{F}(V1), P_multiply-{F}(V1,V0,V0) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #209: mergings( V2 == V3; #207 ), references = 1, size of lhs = 6:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V1,V0,V0), P_additive_inverse-{F}(V1,V2), P_add-{F}(V2,V1,V0), P_b-{F}(V3) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #213: mergings( V2 == V3; #211 ), references = 1, size of lhs = 4:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V1,V0,V0), P_b-{F}(V2) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #216: mergings( V1 == V2; #214 ), references = 2, size of lhs = 3:
% 2.37/2.55 P_additive_identity-{F}(V0), P_a-{F}(V1), P_multiply-{F}(V1,V0,V0) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #219: exists( #22, #217 ), references = 1, size of lhs = 1:
% 2.37/2.55 P_additive_identity-{F}(V0) | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 #221: exists( #17, #218 ), references = 1, size of lhs = 0:
% 2.37/2.55 FALSE | FALSE
% 2.37/2.55 (used 0 times, uses = {})
% 2.37/2.55
% 2.37/2.55 number of learnt formulas = 39
% 2.37/2.55
% 2.37/2.55
% 2.37/2.55 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.37/2.55
% 2.37/2.55 randbase = 1
%------------------------------------------------------------------------------