TSTP Solution File: KLE076+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : KLE076+1 : TPTP v8.1.0. Released v4.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:07:04 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE076+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n010.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 16:38:56 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.48 GeoParameters:
% 0.20/0.48
% 0.20/0.48 tptp_input = 1
% 0.20/0.48 tptp_output = 0
% 0.20/0.48 nonempty = 1
% 0.20/0.48 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48
% 0.20/0.48 RuleSystem INPUT:
% 0.20/0.48
% 0.20/0.48 Initial Rules:
% 0.20/0.48 #0: input, references = 5, size of lhs = 3:
% 0.20/0.48 P_addition-{F}(V0,V1,V2), P_addition-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #1: input, references = 3, size of lhs = 5:
% 0.20/0.48 P_addition-{F}(V1,V0,V3), P_addition-{F}(V2,V3,V4), P_addition-{F}(V2,V1,V5), P_addition-{F}(V5,V0,V6), V4 == V6 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #2: input, references = 3, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_addition-{F}(V1,V0,V2), V2 == V1 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #3: input, references = 4, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_addition-{F}(V1,V1,V2), V2 == V1 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #4: input, references = 3, size of lhs = 6:
% 0.20/0.48 P_zero-{F}(V0), P_multiplication-{F}(V2,V3,V4), P_multiplication-{F}(V1,V4,V5), P_multiplication-{F}(V1,V2,V6), P_multiplication-{F}(V6,V3,V7), V5 == V7 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #5: input, references = 4, size of lhs = 4:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_multiplication-{F}(V2,V1,V3), V3 == V2 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #6: input, references = 4, size of lhs = 4:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_multiplication-{F}(V1,V2,V3), V3 == V2 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #7: input, references = 3, size of lhs = 8:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_addition-{F}(V3,V4,V5), P_multiplication-{F}(V2,V5,V6), P_multiplication-{F}(V2,V3,V7), P_multiplication-{F}(V2,V4,V8), P_addition-{F}(V7,V8,V9), V6 == V9 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #8: input, references = 3, size of lhs = 8:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_addition-{F}(V2,V3,V5), P_multiplication-{F}(V5,V4,V6), P_multiplication-{F}(V2,V4,V7), P_multiplication-{F}(V3,V4,V8), P_addition-{F}(V7,V8,V9), V6 == V9 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #9: input, references = 4, size of lhs = 4:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_multiplication-{F}(V2,V0,V3), V3 == V0 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #10: input, references = 4, size of lhs = 4:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_multiplication-{F}(V0,V2,V3), V3 == V0 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #11: input, references = 3, size of lhs = 5:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_addition-{F}(V2,V3,V4), leq-{F}(V2,V3), V4 == V3 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #12: input, references = 3, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_addition-{F}(V2,V3,V3) | leq-{T}(V2,V3)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #13: input, references = 4, size of lhs = 6:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_domain-{F}(V2,V3), P_multiplication-{F}(V3,V2,V4), P_addition-{F}(V2,V4,V5), V5 == V4 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #14: input, references = 3, size of lhs = 8:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_multiplication-{F}(V2,V3,V4), P_domain-{F}(V4,V5), P_domain-{F}(V3,V6), P_multiplication-{F}(V2,V6,V7), P_domain-{F}(V7,V8), V5 == V8 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #15: input, references = 4, size of lhs = 5:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_domain-{F}(V2,V3), P_addition-{F}(V3,V1,V4), V4 == V1 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #16: input, references = 4, size of lhs = 4:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_domain-{F}(V0,V2), V2 == V0 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #17: input, references = 3, size of lhs = 9:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_domain-{F}(V0,V2), P_addition-{F}(V3,V4,V5), P_domain-{F}(V5,V6), P_domain-{F}(V3,V7), P_domain-{F}(V4,V8), P_addition-{F}(V7,V8,V9), V6 == V9 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #18: input, references = 4, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_domain-{F}(V0,V2) | EXISTS V3: pppp0-{T}(V0,V2,V3)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #19: input, references = 4, size of lhs = 3:
% 0.20/0.48 pppp0-{F}(V0,V1,V2), P_multiplication-{F}(V2,V1,V3), P_domain-{F}(V3,V0) | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #20: input, references = 6, size of lhs = 2:
% 0.20/0.48 #-{F} V0, #-{F} V1 | EXISTS V2: P_addition-{T}(V0,V1,V2)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #21: input, references = 4, size of lhs = 0:
% 0.20/0.48 FALSE | EXISTS V0: P_zero-{T}(V0)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #22: input, references = 6, size of lhs = 2:
% 0.20/0.48 #-{F} V0, #-{F} V1 | EXISTS V2: P_multiplication-{T}(V0,V1,V2)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #23: input, references = 4, size of lhs = 0:
% 0.20/0.48 FALSE | EXISTS V0: P_one-{T}(V0)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #24: input, references = 5, size of lhs = 1:
% 0.20/0.48 #-{F} V0 | EXISTS V1: P_domain-{T}(V0,V1)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 number of initial rules = 25
% 0.20/0.48
% 0.20/0.48 Simplifiers:
% 0.20/0.48 #25: unsound, references = 3, size of lhs = 3:
% 0.20/0.48 P_addition-{F}(V0,V1,V2), P_addition-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #26: unsound, references = 3, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_zero-{F}(V1), V0 == V1 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #27: unsound, references = 3, size of lhs = 3:
% 0.20/0.48 P_multiplication-{F}(V0,V1,V2), P_multiplication-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #28: unsound, references = 3, size of lhs = 3:
% 0.20/0.48 P_one-{F}(V0), P_one-{F}(V1), V0 == V1 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #29: unsound, references = 3, size of lhs = 3:
% 0.20/0.48 P_domain-{F}(V0,V1), P_domain-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #30: unsound, references = 3, size of lhs = 3:
% 0.20/0.48 pppp0-{F}(V0,V1,V2), pppp0-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #31: unsound, references = 3, size of lhs = 3:
% 0.20/0.48 pppp0-{F}(V0,V1,V2), pppp0-{F}(V3,V4,V5), V0 == V3 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #32: unsound, references = 3, size of lhs = 3:
% 0.20/0.48 pppp0-{F}(V0,V1,V2), pppp0-{F}(V0,V4,V5), V1 == V4 | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 number of simplifiers = 8
% 0.20/0.48
% 0.20/0.48 Learnt:
% 0.20/0.48 #34: exists( #20, #3 ), references = 1, size of lhs = 2:
% 0.20/0.48 P_zero-{F}(V0), #-{F} V1 | P_addition-{T}(V1,V1,V1)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #37: exists( #22, #5 ), references = 2, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), #-{F} V2 | P_multiplication-{T}(V2,V1,V2)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #38: exists( #22, #6 ), references = 1, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), #-{F} V2 | P_multiplication-{T}(V1,V2,V2)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #40: exists( #20, #13 ), references = 2, size of lhs = 4:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_domain-{F}(V2,V3), P_multiplication-{F}(V3,V2,V4) | P_addition-{T}(V2,V4,V4)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #43: exists( #24, #16 ), references = 1, size of lhs = 2:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1) | P_domain-{T}(V0,V0)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #48: exists( #20, #15 ), references = 2, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), P_domain-{F}(V2,V3) | P_addition-{T}(V3,V1,V1)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #49: exists( #20, #0 ), references = 1, size of lhs = 1:
% 0.20/0.48 P_addition-{F}(V0,V1,V2) | P_addition-{T}(V1,V0,V2)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #57: mergings( V2 == V3, V3 == V4, V0 == V5; #53 ), references = 1, size of lhs = 2:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1) | P_domain-{T}(V1,V1)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #59: exists( #22, #10 ), references = 1, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), #-{F} V2 | P_multiplication-{T}(V0,V2,V0)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #63: exists( #22, #9 ), references = 1, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_one-{F}(V1), #-{F} V2 | P_multiplication-{T}(V2,V0,V0)
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #68: mergings( V0 == V2, V1 == V4; #65 ), references = 1, size of lhs = 3:
% 0.20/0.48 P_zero-{F}(V0), P_domain-{F}(V0,V0), P_one-{F}(V1) | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #71: exists( #23, #69 ), references = 1, size of lhs = 1:
% 0.20/0.48 P_zero-{F}(V0) | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 #73: exists( #21, #70 ), references = 1, size of lhs = 0:
% 0.20/0.48 FALSE | FALSE
% 0.20/0.48 (used 0 times, uses = {})
% 0.20/0.48
% 0.20/0.48 number of learnt formulas = 13
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48
% 0.20/0.48 randbase = 1
%------------------------------------------------------------------------------