TSTP Solution File: HEN012-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : HEN012-1 : TPTP v8.1.0. Released v1.0.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:04:46 EDT 2022
% Result : Unsatisfiable 0.42s 0.58s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : HEN012-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.12 % 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 20:58:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/0.58 GeoParameters:
% 0.42/0.58
% 0.42/0.58 tptp_input = 1
% 0.42/0.58 tptp_output = 0
% 0.42/0.58 nonempty = 1
% 0.42/0.58 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.58 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.42/0.58
% 0.42/0.58
% 0.42/0.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.58 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.58
% 0.42/0.58 RuleSystem INPUT:
% 0.42/0.58
% 0.42/0.58 Initial Rules:
% 0.42/0.58 #0: input, references = 5, size of lhs = 2:
% 0.42/0.58 P_zero-{F}(V0), less_equal-{F}(V1,V2) | quotient-{T}(V1,V2,V0)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #1: input, references = 5, size of lhs = 2:
% 0.42/0.58 P_zero-{F}(V0), quotient-{F}(V1,V2,V0) | less_equal-{T}(V1,V2)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #2: input, references = 4, size of lhs = 2:
% 0.42/0.58 P_zero-{F}(V0), quotient-{F}(V1,V3,V2) | less_equal-{T}(V2,V1)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #3: input, references = 4, size of lhs = 6:
% 0.42/0.58 P_zero-{F}(V0), quotient-{F}(V3,V4,V1), quotient-{F}(V5,V6,V2), quotient-{F}(V7,V6,V4), quotient-{F}(V8,V7,V5), quotient-{F}(V8,V6,V3) | less_equal-{T}(V1,V2)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #4: input, references = 6, size of lhs = 2:
% 0.42/0.58 P_zero-{F}(V0), #-{F} V1 | less_equal-{T}(V0,V1)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #5: input, references = 5, size of lhs = 4:
% 0.42/0.58 P_zero-{F}(V0), less_equal-{F}(V1,V2), less_equal-{F}(V2,V1), V1 == V2 | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #6: input, references = 3, size of lhs = 3:
% 0.42/0.58 P_zero-{F}(V0), P_identity-{F}(V1), #-{F} V2 | less_equal-{T}(V2,V1)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #7: input, references = 9, size of lhs = 3:
% 0.42/0.58 P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V2,V3,V4) | quotient-{T}(V2,V3,V4)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #8: input, references = 4, size of lhs = 5:
% 0.42/0.58 P_zero-{F}(V0), P_identity-{F}(V1), quotient-{F}(V5,V4,V2), quotient-{F}(V5,V4,V3), V2 == V3 | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #9: input, references = 4, size of lhs = 4:
% 0.42/0.58 P_zero-{F}(V0), P_identity-{F}(V1), P_x-{F}(V2), less_equal-{F}(V2,V2) | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #10: input, references = 4, size of lhs = 0:
% 0.42/0.58 FALSE | EXISTS V0: P_zero-{T}(V0)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #11: input, references = 4, size of lhs = 0:
% 0.42/0.58 FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #12: input, references = 7, size of lhs = 2:
% 0.42/0.58 #-{F} V0, #-{F} V1 | EXISTS V2: P_divide-{T}(V0,V1,V2)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #13: input, references = 4, size of lhs = 0:
% 0.42/0.58 FALSE | EXISTS V0: P_x-{T}(V0)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 number of initial rules = 14
% 0.42/0.58
% 0.42/0.58 Simplifiers:
% 0.42/0.58 #14: unsound, references = 3, size of lhs = 3:
% 0.42/0.58 P_zero-{F}(V0), P_zero-{F}(V1), V0 == V1 | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #15: unsound, references = 3, size of lhs = 3:
% 0.42/0.58 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #16: unsound, references = 3, size of lhs = 3:
% 0.42/0.58 P_divide-{F}(V0,V1,V2), P_divide-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #17: unsound, references = 3, size of lhs = 3:
% 0.42/0.58 P_x-{F}(V0), P_x-{F}(V1), V0 == V1 | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 number of simplifiers = 4
% 0.42/0.58
% 0.42/0.58 Learnt:
% 0.42/0.58 #25: mergings( V3 == V5, V4 == V6; #22 ), references = 1, size of lhs = 3:
% 0.42/0.58 P_zero-{F}(V0), P_identity-{F}(V1), quotient-{F}(V2,V3,V4) | P_divide-{T}(V2,V3,V4)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #41: mergings( V3 == V4, V4 == V6, V6 == V7; #37 ), references = 2, size of lhs = 6:
% 0.42/0.58 P_identity-{F}(V0), P_zero-{F}(V1), quotient-{F}(V2,V3,V1), quotient-{F}(V4,V3,V5), quotient-{F}(V6,V4,V2), quotient-{F}(V6,V3,V7) | P_divide-{T}(V7,V5,V1)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #90: mergings( V3 == V5, V5 == V7, V7 == V9, V9 == V10, V4 == V6, V6 == V8; #83 ), references = 1, size of lhs = 6:
% 0.42/0.58 P_identity-{F}(V0), P_zero-{F}(V1), quotient-{F}(V2,V2,V3), less_equal-{F}(V4,V3), V4 == V3, quotient-{F}(V5,V2,V4) | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #103: mergings( V2 == V3, V3 == V5, V5 == V7, V7 == V9, V9 == V11, V11 == V12, V4 == V6, V6 == V8, V8 == V10; #93 ), references = 2, size of lhs = 3:
% 0.42/0.58 P_identity-{F}(V0), P_zero-{F}(V1), quotient-{F}(V2,V3,V1) | P_divide-{T}(V3,V3,V1)
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #115: mergings( V1 == V3, V3 == V5, V5 == V6, V2 == V4, V4 == V7; #109 ), references = 1, size of lhs = 2:
% 0.42/0.58 P_zero-{F}(V0), P_identity-{F}(V1) | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #120: mergings( V1 == V2, V2 == V3, V3 == V4; #116 ), references = 1, size of lhs = 1:
% 0.42/0.58 P_zero-{F}(V0) | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 #122: exists( #10, #116 ), references = 1, size of lhs = 0:
% 0.42/0.58 FALSE | FALSE
% 0.42/0.58 (used 0 times, uses = {})
% 0.42/0.58
% 0.42/0.58 number of learnt formulas = 7
% 0.42/0.58
% 0.42/0.58
% 0.42/0.58 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.58
% 0.42/0.58 randbase = 1
%------------------------------------------------------------------------------