TSTP Solution File: SET848-2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SET848-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n016.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:16:50 EDT 2022
% Result : Unsatisfiable 0.85s 1.06s
% Output : Refutation 0.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET848-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n016.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 : Sat Jul 23 02:16:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.85/1.06 GeoParameters:
% 0.85/1.06
% 0.85/1.06 tptp_input = 1
% 0.85/1.06 tptp_output = 0
% 0.85/1.06 nonempty = 1
% 0.85/1.06 inputfile = /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.06 includepath = /export/starexec/sandbox2/solver/bin/../../benchmark/
% 0.85/1.06
% 0.85/1.06
% 0.85/1.06 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.06 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.06
% 0.85/1.06 RuleSystem INPUT:
% 0.85/1.06
% 0.85/1.06 Initial Rules:
% 0.85/1.06 #0: input, references = 5, size of lhs = 3:
% 0.85/1.06 P_tc_set-{F}(V1,V3), P_c_minus-{F}(V4,V2,V3,V5), c_in-{F}(V0,V4,V1) | c_in-{T}(V0,V2,V1), c_in-{T}(V0,V5,V1)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #1: input, references = 4, size of lhs = 2:
% 0.85/1.06 #-{F} V0, P_tc_set-{F}(V1,V2) | c_lessequals-{T}(V0,V0,V2)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #2: input, references = 4, size of lhs = 6:
% 0.85/1.06 P_c_Zorn_OTFin-{F}(V2,V0,V3), P_tc_set-{F}(V0,V4), P_tc_set-{F}(V4,V5), P_tc_set-{F}(V5,V6), P_c_Union-{F}(V1,V4,V7), c_lessequals-{F}(V1,V3,V6) | c_in-{T}(V7,V3,V5)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #3: input, references = 4, size of lhs = 5:
% 0.85/1.06 P_c_Zorn_OTFin-{F}(V2,V1,V3), P_tc_set-{F}(V1,V4), P_tc_set-{F}(V4,V5), P_c_Zorn_Ochain-{F}(V2,V1,V6), c_in-{F}(V0,V3,V5) | c_in-{T}(V0,V6,V5)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #4: input, references = 5, size of lhs = 8:
% 0.85/1.06 P_c_Zorn_Ochain-{F}(V2,V1,V3), P_c_Zorn_Omaxchain-{F}(V2,V1,V4), P_tc_set-{F}(V1,V5), P_tc_set-{F}(V5,V6), P_tc_set-{F}(V6,V7), P_c_minus-{F}(V3,V4,V7,V8), P_c_Zorn_Osucc-{F}(V2,V0,V1,V0), c_in-{F}(V0,V8,V6) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #5: input, references = 3, size of lhs = 8:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_c_Zorn_OTFin-{F}(V0,V1,V2), P_tc_set-{F}(V1,V3), P_c_Union-{F}(V2,V3,V4), P_c_Zorn_Omaxchain-{F}(V0,V1,V5), P_tc_set-{F}(V3,V6), c_in-{F}(V4,V5,V6) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #6: input, references = 4, size of lhs = 9:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_c_Zorn_OTFin-{F}(V0,V1,V2), P_tc_set-{F}(V1,V3), P_c_Union-{F}(V2,V3,V4), P_c_Zorn_Omaxchain-{F}(V0,V1,V5), P_tc_set-{F}(V3,V6), P_c_Zorn_Osucc-{F}(V0,V4,V1,V7), V7 == V4 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #7: input, references = 5, size of lhs = 3:
% 0.85/1.06 #-{F} V0, #-{F} V1, #-{F} V2 | EXISTS V3: P_c_minus-{T}(V0,V1,V2,V3)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #8: input, references = 6, size of lhs = 1:
% 0.85/1.06 #-{F} V0 | EXISTS V1: P_tc_set-{T}(V0,V1)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #9: input, references = 4, size of lhs = 2:
% 0.85/1.06 #-{F} V0, #-{F} V1 | EXISTS V2: P_c_Zorn_OTFin-{T}(V0,V1,V2)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #10: input, references = 4, size of lhs = 2:
% 0.85/1.06 #-{F} V0, #-{F} V1 | EXISTS V2: P_c_Union-{T}(V0,V1,V2)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #11: input, references = 4, size of lhs = 2:
% 0.85/1.06 #-{F} V0, #-{F} V1 | EXISTS V2: P_c_Zorn_Ochain-{T}(V0,V1,V2)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #12: input, references = 4, size of lhs = 2:
% 0.85/1.06 #-{F} V0, #-{F} V1 | EXISTS V2: P_c_Zorn_Omaxchain-{T}(V0,V1,V2)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #13: input, references = 4, size of lhs = 3:
% 0.85/1.06 #-{F} V0, #-{F} V1, #-{F} V2 | EXISTS V3: P_c_Zorn_Osucc-{T}(V0,V1,V2,V3)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #14: input, references = 4, size of lhs = 0:
% 0.85/1.06 FALSE | EXISTS V0: P_v_S-{T}(V0)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #15: input, references = 4, size of lhs = 0:
% 0.85/1.06 FALSE | EXISTS V0: P_t_a-{T}(V0)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 number of initial rules = 16
% 0.85/1.06
% 0.85/1.06 Simplifiers:
% 0.85/1.06 #16: unsound, references = 3, size of lhs = 2:
% 0.85/1.06 c_lessequals-{F}(V0,V1,V2), V1 == V0 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #17: unsound, references = 3, size of lhs = 3:
% 0.85/1.06 P_c_minus-{F}(V0,V1,V2,V3), P_c_minus-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #18: unsound, references = 3, size of lhs = 3:
% 0.85/1.06 P_tc_set-{F}(V0,V1), P_tc_set-{F}(V0,V3), V1 == V3 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #19: unsound, references = 3, size of lhs = 3:
% 0.85/1.06 P_c_Zorn_OTFin-{F}(V0,V1,V2), P_c_Zorn_OTFin-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #20: unsound, references = 3, size of lhs = 3:
% 0.85/1.06 P_c_Union-{F}(V0,V1,V2), P_c_Union-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #21: unsound, references = 3, size of lhs = 3:
% 0.85/1.06 P_c_Zorn_Ochain-{F}(V0,V1,V2), P_c_Zorn_Ochain-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #22: unsound, references = 3, size of lhs = 3:
% 0.85/1.06 P_c_Zorn_Omaxchain-{F}(V0,V1,V2), P_c_Zorn_Omaxchain-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #23: unsound, references = 3, size of lhs = 3:
% 0.85/1.06 P_c_Zorn_Osucc-{F}(V0,V1,V2,V3), P_c_Zorn_Osucc-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #24: unsound, references = 3, size of lhs = 3:
% 0.85/1.06 P_v_S-{F}(V0), P_v_S-{F}(V1), V0 == V1 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #25: unsound, references = 3, size of lhs = 3:
% 0.85/1.06 P_t_a-{F}(V0), P_t_a-{F}(V1), V0 == V1 | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 number of simplifiers = 10
% 0.85/1.06
% 0.85/1.06 Learnt:
% 0.85/1.06 #27: exists( #13, #6 ), references = 1, size of lhs = 7:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_c_Zorn_OTFin-{F}(V0,V1,V2), P_tc_set-{F}(V1,V3), P_c_Union-{F}(V2,V3,V4), P_c_Zorn_Omaxchain-{F}(V0,V1,V5), P_tc_set-{F}(V3,V6) | P_c_Zorn_Osucc-{T}(V0,V4,V1,V4)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #42: mergings( V1 == V11; #40 ), references = 1, size of lhs = 9:
% 0.85/1.06 P_tc_set-{F}(V0,V1), P_tc_set-{F}(V1,V2), P_tc_set-{F}(V2,V3), P_c_Zorn_Ochain-{F}(V4,V0,V5), P_c_Zorn_Omaxchain-{F}(V4,V0,V6), P_c_minus-{F}(V5,V6,V3,V7), P_c_Zorn_Osucc-{F}(V4,V8,V0,V8), c_in-{F}(V8,V9,V2), P_c_minus-{F}(V9,V7,V3,V10) | c_in-{T}(V8,V10,V2)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #46: mergings( V7 == V2; #44 ), references = 1, size of lhs = 13:
% 0.85/1.06 P_tc_set-{F}(V0,V1), P_tc_set-{F}(V1,V2), P_tc_set-{F}(V2,V3), P_tc_set-{F}(V4,V2), P_tc_set-{F}(V5,V4), P_c_Zorn_Ochain-{F}(V6,V0,V7), P_c_Zorn_Omaxchain-{F}(V6,V0,V8), P_c_minus-{F}(V7,V8,V3,V9), P_c_Zorn_Omaxchain-{F}(V10,V5,V9), P_c_Zorn_Ochain-{F}(V10,V5,V11), P_c_Zorn_Osucc-{F}(V6,V12,V0,V12), c_in-{F}(V12,V11,V2), P_c_Zorn_Osucc-{F}(V10,V12,V5,V12) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #64: disj( #0, input ), references = 1, size of lhs = 10:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_c_Zorn_OTFin-{F}(V0,V1,V2), P_tc_set-{F}(V1,V3), P_c_Union-{F}(V2,V3,V4), P_c_Zorn_Omaxchain-{F}(V0,V1,V5), P_tc_set-{F}(V3,V6), P_tc_set-{F}(V6,V7), c_in-{F}(V4,V8,V6), P_c_minus-{F}(V8,V5,V7,V9) | c_in-{T}(V4,V9,V6)
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #67: exists( #7, #65 ), references = 1, size of lhs = 14:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_c_Zorn_OTFin-{F}(V0,V1,V2), P_tc_set-{F}(V1,V3), P_c_Union-{F}(V2,V3,V4), P_c_Zorn_Omaxchain-{F}(V0,V1,V5), P_tc_set-{F}(V3,V6), P_tc_set-{F}(V6,V7), c_in-{F}(V4,V8,V6), P_tc_set-{F}(V9,V6), P_tc_set-{F}(V10,V9), P_c_Zorn_Osucc-{F}(V11,V4,V10,V4), P_c_Zorn_Ochain-{F}(V11,V10,V8), P_c_Zorn_Omaxchain-{F}(V11,V10,V5) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #74: mergings( V4 == V8, V6 == V9, V8 == V11, V3 == V7; #69 ), references = 2, size of lhs = 9:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_c_Zorn_OTFin-{F}(V0,V1,V2), P_tc_set-{F}(V1,V3), P_c_Union-{F}(V2,V3,V4), P_tc_set-{F}(V3,V5), P_tc_set-{F}(V5,V6), P_c_Zorn_Ochain-{F}(V0,V1,V7), c_in-{F}(V4,V7,V5) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #79: mergings( V4 == V8, V3 == V9; #76 ), references = 1, size of lhs = 8:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_tc_set-{F}(V1,V2), P_tc_set-{F}(V2,V3), P_tc_set-{F}(V3,V4), P_c_Zorn_OTFin-{F}(V0,V1,V5), P_c_Union-{F}(V5,V2,V6), c_in-{F}(V6,V5,V3) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #85: mergings( V9 == V0, V1 == V8, V6 == V7; #81 ), references = 2, size of lhs = 9:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_tc_set-{F}(V1,V2), P_tc_set-{F}(V2,V3), P_tc_set-{F}(V3,V4), P_c_Zorn_OTFin-{F}(V0,V1,V5), c_lessequals-{F}(V5,V5,V4), P_tc_set-{F}(V6,V2), P_c_Zorn_OTFin-{F}(V7,V6,V5) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #88: exists( #9, #86 ), references = 2, size of lhs = 6:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_tc_set-{F}(V1,V2), P_tc_set-{F}(V2,V3), P_tc_set-{F}(V3,V4), P_tc_set-{F}(V5,V4) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #90: exists( #8, #88 ), references = 1, size of lhs = 4:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_tc_set-{F}(V1,V2), P_tc_set-{F}(V2,V3) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #92: exists( #8, #89 ), references = 1, size of lhs = 3:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1), P_tc_set-{F}(V1,V2) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #94: exists( #8, #91 ), references = 1, size of lhs = 2:
% 0.85/1.06 P_v_S-{F}(V0), P_t_a-{F}(V1) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #96: exists( #15, #93 ), references = 1, size of lhs = 1:
% 0.85/1.06 P_v_S-{F}(V0) | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 #98: exists( #14, #95 ), references = 1, size of lhs = 0:
% 0.85/1.06 FALSE | FALSE
% 0.85/1.06 (used 0 times, uses = {})
% 0.85/1.06
% 0.85/1.06 number of learnt formulas = 14
% 0.85/1.06
% 0.85/1.06
% 0.85/1.06 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.06
% 0.85/1.06 randbase = 1
%------------------------------------------------------------------------------