TSTP Solution File: HEN005-1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : HEN005-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n027.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:41 EDT 2022
% Result : Unsatisfiable 0.47s 0.63s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : HEN005-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % 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 21:17:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.47/0.63 GeoParameters:
% 0.47/0.63
% 0.47/0.63 tptp_input = 1
% 0.47/0.63 tptp_output = 0
% 0.47/0.63 nonempty = 1
% 0.47/0.63 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.63 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.47/0.63
% 0.47/0.63
% 0.47/0.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.63 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.63
% 0.47/0.63 RuleSystem INPUT:
% 0.47/0.63
% 0.47/0.63 Initial Rules:
% 0.47/0.63 #0: input, references = 7, size of lhs = 2:
% 0.47/0.63 P_zero-{F}(V0), less_equal-{F}(V1,V2) | quotient-{T}(V1,V2,V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #1: input, references = 7, size of lhs = 2:
% 0.47/0.63 P_zero-{F}(V0), quotient-{F}(V1,V2,V0) | less_equal-{T}(V1,V2)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #2: input, references = 4, size of lhs = 2:
% 0.47/0.63 P_zero-{F}(V0), quotient-{F}(V1,V3,V2) | less_equal-{T}(V2,V1)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #3: input, references = 4, size of lhs = 6:
% 0.47/0.63 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.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #4: input, references = 7, size of lhs = 2:
% 0.47/0.63 P_zero-{F}(V0), #-{F} V1 | less_equal-{T}(V0,V1)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #5: input, references = 8, size of lhs = 4:
% 0.47/0.63 P_zero-{F}(V0), less_equal-{F}(V1,V2), less_equal-{F}(V2,V1), V1 == V2 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #6: input, references = 5, size of lhs = 3:
% 0.47/0.63 P_zero-{F}(V0), P_identity-{F}(V1), #-{F} V2 | less_equal-{T}(V2,V1)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #7: input, references = 12, size of lhs = 3:
% 0.47/0.63 P_zero-{F}(V0), P_identity-{F}(V1), P_divide-{F}(V2,V3,V4) | quotient-{T}(V2,V3,V4)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #8: input, references = 4, size of lhs = 5:
% 0.47/0.63 P_zero-{F}(V0), P_identity-{F}(V1), quotient-{F}(V5,V4,V2), quotient-{F}(V5,V4,V3), V2 == V3 | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #9: input, references = 5, size of lhs = 4:
% 0.47/0.63 P_zero-{F}(V0), P_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3) | less_equal-{T}(V2,V3)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #10: input, references = 6, size of lhs = 5:
% 0.47/0.63 P_zero-{F}(V0), P_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3), P_z-{F}(V4) | less_equal-{T}(V3,V4)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #11: input, references = 6, size of lhs = 6:
% 0.47/0.63 P_zero-{F}(V0), P_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3), P_z-{F}(V4), less_equal-{F}(V2,V4) | FALSE
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #12: input, references = 4, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_zero-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #13: input, references = 4, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_identity-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #14: input, references = 7, size of lhs = 2:
% 0.47/0.63 #-{F} V0, #-{F} V1 | EXISTS V2: P_divide-{T}(V0,V1,V2)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #15: input, references = 4, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_x-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #16: input, references = 6, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_y-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.63
% 0.47/0.63 #17: input, references = 7, size of lhs = 0:
% 0.47/0.63 FALSE | EXISTS V0: P_z-{T}(V0)
% 0.47/0.63 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 number of initial rules = 18
% 0.47/0.64
% 0.47/0.64 Simplifiers:
% 0.47/0.64 #18: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_zero-{F}(V0), P_zero-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #19: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_identity-{F}(V0), P_identity-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #20: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_divide-{F}(V0,V1,V2), P_divide-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #21: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_x-{F}(V0), P_x-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #22: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_y-{F}(V0), P_y-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #23: unsound, references = 3, size of lhs = 3:
% 0.47/0.64 P_z-{F}(V0), P_z-{F}(V1), V0 == V1 | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 number of simplifiers = 6
% 0.47/0.64
% 0.47/0.64 Learnt:
% 0.47/0.64 #33: mergings( V1 == V5, V2 == V6, V3 == V4, V4 == V7; #28 ), references = 1, size of lhs = 4:
% 0.47/0.64 P_x-{F}(V0), P_y-{F}(V0), P_zero-{F}(V1), P_identity-{F}(V2) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #40: mergings( V1 == V3, V3 == V5, V2 == V4; #36 ), references = 1, size of lhs = 3:
% 0.47/0.64 P_x-{F}(V0), P_identity-{F}(V0), P_zero-{F}(V1) | P_y-{T}(V0)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #45: mergings( V1 == V2; #43 ), references = 1, size of lhs = 4:
% 0.47/0.64 P_x-{F}(V0), P_zero-{F}(V0), P_identity-{F}(V1), P_y-{F}(V2) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #48: mergings( V1 == V2; #46 ), references = 1, size of lhs = 3:
% 0.47/0.64 P_x-{F}(V0), P_zero-{F}(V0), P_identity-{F}(V1) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #56: mergings( V1 == V3, V3 == V6, V2 == V4; #52 ), references = 1, size of lhs = 4:
% 0.47/0.64 P_y-{F}(V0), P_identity-{F}(V0), P_x-{F}(V1), P_zero-{F}(V2) | P_z-{T}(V0)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #73: mergings( V3 == V5, V4 == V6; #70 ), references = 1, size of lhs = 3:
% 0.47/0.64 P_zero-{F}(V0), P_identity-{F}(V1), quotient-{F}(V2,V3,V4) | P_divide-{T}(V2,V3,V4)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #116: mergings( V3 == V4, V4 == V6, V6 == V7; #112 ), references = 4, size of lhs = 6:
% 0.47/0.64 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.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #136: mergings( V3 == V5, V5 == V7, V7 == V9, V9 == V10, V4 == V6, V6 == V8; #129 ), references = 2, size of lhs = 6:
% 0.47/0.64 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.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #179: mergings( V3 == V4, V4 == V7, V7 == V9, V9 == V10, V5 == V6, V6 == V8; #171 ), references = 2, size of lhs = 5:
% 0.47/0.64 P_identity-{F}(V0), P_zero-{F}(V1), quotient-{F}(V2,V3,V1), quotient-{F}(V4,V3,V1), quotient-{F}(V5,V2,V4) | P_divide-{T}(V5,V3,V1)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #186: mergings( V3 == V6, V6 == V8, V8 == V10, V4 == V5, V5 == V7, V7 == V9; #172 ), references = 1, size of lhs = 6:
% 0.47/0.64 P_identity-{F}(V0), P_zero-{F}(V1), quotient-{F}(V2,V2,V3), quotient-{F}(V4,V2,V3), quotient-{F}(V5,V2,V1), quotient-{F}(V6,V4,V5) | P_divide-{T}(V6,V2,V3)
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #204: mergings( V1 == V2, V2 == V7, V7 == V9, V9 == V10, V3 == V6, V6 == V8, V8 == V11, V4 == V12, V5 == V13; #194 ), references = 1, size of lhs = 5:
% 0.47/0.64 P_zero-{F}(V0), P_identity-{F}(V1), P_x-{F}(V2), P_y-{F}(V3), quotient-{F}(V2,V3,V0) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #218: mergings( V1 == V3, V3 == V4, V4 == V8, V8 == V10, V10 == V11, V2 == V5, V5 == V7, V7 == V9, V9 == V12, V6 == V13; #207 ), references = 1, size of lhs = 3:
% 0.47/0.64 P_zero-{F}(V0), P_identity-{F}(V1), P_x-{F}(V2) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #229: mergings( V1 == V3, V3 == V4, V4 == V7, V7 == V9, V9 == V10, V2 == V5, V5 == V6, V6 == V8, V8 == V11; #219 ), references = 1, size of lhs = 2:
% 0.47/0.64 P_zero-{F}(V0), P_identity-{F}(V1) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #236: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6; #230 ), references = 1, size of lhs = 1:
% 0.47/0.64 P_zero-{F}(V0) | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 #238: exists( #12, #230 ), references = 1, size of lhs = 0:
% 0.47/0.64 FALSE | FALSE
% 0.47/0.64 (used 0 times, uses = {})
% 0.47/0.64
% 0.47/0.64 number of learnt formulas = 15
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.64
% 0.47/0.64 randbase = 1
%------------------------------------------------------------------------------