TSTP Solution File: GRP657-10 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRP657-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n003.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:04:21 EDT 2022
% Result : Unsatisfiable 0.40s 0.58s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP657-10 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n003.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 14:39:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/0.58 GeoParameters:
% 0.40/0.58
% 0.40/0.58 tptp_input = 1
% 0.40/0.58 tptp_output = 0
% 0.40/0.58 nonempty = 1
% 0.40/0.58 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.58 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.40/0.58
% 0.40/0.58
% 0.40/0.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.58 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.58
% 0.40/0.58 RuleSystem INPUT:
% 0.40/0.58
% 0.40/0.58 Initial Rules:
% 0.40/0.58 #0: input, references = 4, size of lhs = 3:
% 0.40/0.58 P_ld-{F}(V0,V1,V2), P_mult-{F}(V0,V2,V3), V3 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #1: input, references = 6, size of lhs = 3:
% 0.40/0.58 P_mult-{F}(V0,V1,V2), P_ld-{F}(V0,V2,V3), V3 == V1 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #2: input, references = 5, size of lhs = 3:
% 0.40/0.58 P_rd-{F}(V0,V1,V2), P_mult-{F}(V2,V1,V3), V3 == V0 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #3: input, references = 6, size of lhs = 3:
% 0.40/0.58 P_mult-{F}(V0,V1,V2), P_rd-{F}(V2,V1,V3), V3 == V0 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #4: input, references = 5, size of lhs = 7:
% 0.40/0.58 P_mult-{F}(V0,V1,V3), P_mult-{F}(V2,V0,V4), P_mult-{F}(V3,V4,V5), P_mult-{F}(V1,V2,V6), P_mult-{F}(V6,V0,V7), P_mult-{F}(V0,V7,V8), V5 == V8 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #5: input, references = 4, size of lhs = 6:
% 0.40/0.58 P_x1-{F}(V0,V1), P_mult-{F}(V0,V1,V2), P_x1_2-{F}(V0,V3), P_mult-{F}(V3,V0,V4), P_tuple-{F}(V2,V4,V6), P_tuple-{F}(V1,V3,V6) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #6: input, references = 12, size of lhs = 2:
% 0.40/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_mult-{T}(V0,V1,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #7: input, references = 5, size of lhs = 2:
% 0.40/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_ld-{T}(V0,V1,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #8: input, references = 6, size of lhs = 2:
% 0.40/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_rd-{T}(V0,V1,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #9: input, references = 4, size of lhs = 2:
% 0.40/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_tuple-{T}(V0,V1,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #10: input, references = 4, size of lhs = 1:
% 0.40/0.58 #-{F} V0 | EXISTS V1: P_x1-{T}(V0,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #11: input, references = 4, size of lhs = 1:
% 0.40/0.58 #-{F} V0 | EXISTS V1: P_x1_2-{T}(V0,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 number of initial rules = 12
% 0.40/0.58
% 0.40/0.58 Simplifiers:
% 0.40/0.58 #12: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_mult-{F}(V0,V1,V2), P_mult-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #13: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_ld-{F}(V0,V1,V2), P_ld-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #14: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_rd-{F}(V0,V1,V2), P_rd-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #15: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_tuple-{F}(V0,V1,V2), P_tuple-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #16: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_x1-{F}(V0,V1), P_x1-{F}(V0,V3), V1 == V3 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #17: unsound, references = 3, size of lhs = 3:
% 0.40/0.58 P_x1_2-{F}(V0,V1), P_x1_2-{F}(V0,V3), V1 == V3 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 number of simplifiers = 6
% 0.40/0.58
% 0.40/0.58 Learnt:
% 0.40/0.58 #19: exists( #6, #0 ), references = 1, size of lhs = 1:
% 0.40/0.58 P_ld-{F}(V0,V1,V2) | P_mult-{T}(V0,V2,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #21: exists( #7, #1 ), references = 2, size of lhs = 1:
% 0.40/0.58 P_mult-{F}(V0,V1,V2) | P_ld-{T}(V0,V2,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #23: exists( #6, #2 ), references = 5, size of lhs = 1:
% 0.40/0.58 P_rd-{F}(V0,V1,V2) | P_mult-{T}(V2,V1,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #25: exists( #6, #4 ), references = 5, size of lhs = 5:
% 0.40/0.58 P_mult-{F}(V0,V1,V2), P_mult-{F}(V3,V0,V4), P_mult-{F}(V1,V3,V5), P_mult-{F}(V5,V0,V6), P_mult-{F}(V0,V6,V7) | P_mult-{T}(V2,V4,V7)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #27: exists( #8, #3 ), references = 3, size of lhs = 1:
% 0.40/0.58 P_mult-{F}(V0,V1,V2) | P_rd-{T}(V2,V1,V0)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #32: exists( #6, #30 ), references = 1, size of lhs = 9:
% 0.40/0.58 P_mult-{F}(V0,V1,V1), P_mult-{F}(V2,V1,V0), P_mult-{F}(V3,V0,V3), P_mult-{F}(V3,V4,V0), P_mult-{F}(V4,V1,V5), P_mult-{F}(V5,V3,V6), P_mult-{F}(V3,V6,V7), P_mult-{F}(V3,V2,V8), P_mult-{F}(V8,V1,V3) | P_mult-{T}(V1,V3,V7)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #37: exists( #6, #34 ), references = 1, size of lhs = 5:
% 0.40/0.58 P_mult-{F}(V0,V1,V2), P_mult-{F}(V3,V0,V4), P_mult-{F}(V4,V1,V5), P_mult-{F}(V1,V5,V6), P_rd-{F}(V6,V2,V7) | P_mult-{T}(V1,V3,V7)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #41: exists( #8, #39 ), references = 2, size of lhs = 5:
% 0.40/0.58 P_mult-{F}(V0,V1,V2), P_mult-{F}(V3,V1,V4), P_mult-{F}(V1,V4,V5), P_rd-{F}(V5,V2,V6), P_ld-{F}(V1,V6,V7) | P_rd-{T}(V3,V0,V7)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #43: exists( #9, #5 ), references = 2, size of lhs = 4:
% 0.40/0.58 P_x1-{F}(V0,V1), P_mult-{F}(V0,V1,V1), P_x1_2-{F}(V0,V2), P_mult-{F}(V2,V0,V2) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #48: exists( #6, #46 ), references = 2, size of lhs = 5:
% 0.40/0.58 P_mult-{F}(V0,V1,V2), V0 == V2, P_mult-{F}(V3,V0,V4), P_mult-{F}(V1,V3,V5), P_mult-{F}(V5,V0,V4) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #50: exists( #6, #47 ), references = 2, size of lhs = 3:
% 0.40/0.58 P_mult-{F}(V0,V1,V1), P_mult-{F}(V2,V0,V3), V2 == V3 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #53: exists( #6, #50 ), references = 3, size of lhs = 2:
% 0.40/0.58 P_mult-{F}(V0,V1,V1), #-{F} V2 | P_mult-{T}(V2,V0,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #54: exists( #6, #48 ), references = 1, size of lhs = 3:
% 0.40/0.58 P_mult-{F}(V0,V1,V2), P_mult-{F}(V3,V1,V2), P_mult-{F}(V4,V0,V3) | P_mult-{T}(V1,V4,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #57: exists( #11, #55 ), references = 2, size of lhs = 3:
% 0.40/0.58 P_mult-{F}(V0,V1,V1), P_x1-{F}(V0,V2), P_mult-{F}(V0,V2,V2) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #61: exists( #6, #59 ), references = 1, size of lhs = 3:
% 0.40/0.58 P_ld-{F}(V0,V0,V0), P_mult-{F}(V1,V0,V1), P_mult-{F}(V2,V0,V1) | P_mult-{T}(V0,V1,V2)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #65: exists( #10, #63 ), references = 2, size of lhs = 3:
% 0.40/0.58 P_ld-{F}(V0,V0,V0), P_mult-{F}(V0,V1,V1), P_mult-{F}(V0,V2,V2) | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #78: exists( #8, #76 ), references = 2, size of lhs = 2:
% 0.40/0.58 P_ld-{F}(V0,V0,V1), #-{F} V2 | P_rd-{T}(V2,V2,V1)
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 #85: exists( #7, #83 ), references = 1, size of lhs = 1:
% 0.40/0.58 #-{F} V0 | FALSE
% 0.40/0.58 (used 0 times, uses = {})
% 0.40/0.58
% 0.40/0.58 number of learnt formulas = 18
% 0.40/0.58
% 0.40/0.58
% 0.40/0.58 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.58
% 0.40/0.58 randbase = 1
%------------------------------------------------------------------------------