TSTP Solution File: SEU165+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SEU165+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n028.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:17:23 EDT 2022
% Result : Theorem 0.83s 1.01s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU165+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jul 22 19:38:43 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.83/1.01 GeoParameters:
% 0.83/1.01
% 0.83/1.01 tptp_input = 1
% 0.83/1.01 tptp_output = 0
% 0.83/1.01 nonempty = 1
% 0.83/1.01 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.83/1.01 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.83/1.01
% 0.83/1.01
% 0.83/1.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.83/1.01 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.83/1.01
% 0.83/1.01 RuleSystem INPUT:
% 0.83/1.01
% 0.83/1.01 Initial Rules:
% 0.83/1.01 #0: input, references = 4, size of lhs = 3:
% 0.83/1.01 P_unordered_pair-{F}(V0,V1,V2), P_unordered_pair-{F}(V1,V0,V3), V2 == V3 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #1: input, references = 3, size of lhs = 0:
% 0.83/1.01 FALSE | EXISTS V0: pppp2-{T}(V0)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #2: input, references = 3, size of lhs = 1:
% 0.83/1.01 pppp2-{F}(V0) | empty-{T}(V0)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #3: input, references = 3, size of lhs = 0:
% 0.83/1.01 FALSE | EXISTS V0: pppp3-{T}(V0)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #4: input, references = 3, size of lhs = 2:
% 0.83/1.01 pppp3-{F}(V0), empty-{F}(V0) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #5: input, references = 10, size of lhs = 2:
% 0.83/1.01 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #6: input, references = 3, size of lhs = 2:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), empty-{F}(V2) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #7: input, references = 6, size of lhs = 5:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), P_unordered_pair-{F}(V0,V1,V3), P_singleton-{F}(V0,V4), P_unordered_pair-{F}(V3,V4,V5), V2 == V5 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #8: input, references = 4, size of lhs = 0:
% 0.83/1.01 FALSE | EXISTS V0: pppp7-{T}(V0)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #9: input, references = 4, size of lhs = 1:
% 0.83/1.01 pppp7-{F}(V0) | EXISTS V1: pppp6-{T}(V0,V1)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #10: input, references = 4, size of lhs = 1:
% 0.83/1.01 pppp6-{F}(V0,V1) | EXISTS V2: pppp5-{T}(V0,V1,V2)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #11: input, references = 7, size of lhs = 1:
% 0.83/1.01 pppp5-{F}(V0,V1,V2) | EXISTS V3: pppp4-{T}(V0,V1,V2,V3)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #12: input, references = 5, size of lhs = 5:
% 0.83/1.01 pppp4-{F}(V0,V1,V2,V3), P_ordered_pair-{F}(V0,V1,V4), P_cartesian_product2-{F}(V2,V3,V5), pppp0-{F}(V0,V1,V2,V3), in-{F}(V4,V5) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #13: input, references = 6, size of lhs = 3:
% 0.83/1.01 pppp4-{F}(V0,V1,V2,V3), P_ordered_pair-{F}(V0,V1,V4), P_cartesian_product2-{F}(V2,V3,V5) | in-{T}(V4,V5), pppp0-{T}(V0,V1,V2,V3)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #14: input, references = 7, size of lhs = 1:
% 0.83/1.01 pppp0-{F}(V0,V1,V2,V3) | in-{T}(V0,V2)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #15: input, references = 6, size of lhs = 1:
% 0.83/1.01 pppp0-{F}(V0,V1,V2,V3) | in-{T}(V1,V3)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #16: input, references = 4, size of lhs = 2:
% 0.83/1.01 in-{F}(V0,V2), in-{F}(V1,V3) | pppp0-{T}(V0,V1,V2,V3)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #17: input, references = 9, size of lhs = 3:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V4), P_cartesian_product2-{F}(V2,V3,V5), in-{F}(V4,V5) | pppp1-{T}(V0,V1,V2,V3)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #18: input, references = 4, size of lhs = 3:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V4), P_cartesian_product2-{F}(V2,V3,V5), pppp1-{F}(V0,V1,V2,V3) | in-{T}(V4,V5)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #19: input, references = 8, size of lhs = 1:
% 0.83/1.01 pppp1-{F}(V0,V1,V2,V3) | in-{T}(V0,V2)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #20: input, references = 5, size of lhs = 1:
% 0.83/1.01 pppp1-{F}(V0,V1,V2,V3) | in-{T}(V1,V3)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #21: input, references = 4, size of lhs = 2:
% 0.83/1.01 in-{F}(V0,V2), in-{F}(V1,V3) | pppp1-{T}(V0,V1,V2,V3)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #22: input, references = 6, size of lhs = 2:
% 0.83/1.01 #-{F} V0, #-{F} V1 | EXISTS V2: P_unordered_pair-{T}(V0,V1,V2)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #23: input, references = 5, size of lhs = 2:
% 0.83/1.01 #-{F} V0, #-{F} V1 | EXISTS V2: P_ordered_pair-{T}(V0,V1,V2)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #24: input, references = 3, size of lhs = 1:
% 0.83/1.01 #-{F} V0 | EXISTS V1: P_singleton-{T}(V0,V1)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #25: input, references = 9, size of lhs = 2:
% 0.83/1.01 #-{F} V0, #-{F} V1 | EXISTS V2: P_cartesian_product2-{T}(V0,V1,V2)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 number of initial rules = 26
% 0.83/1.01
% 0.83/1.01 Simplifiers:
% 0.83/1.01 #26: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 empty-{F}(V0), empty-{F}(V1), V0 == V1 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #27: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 P_unordered_pair-{F}(V0,V1,V2), P_unordered_pair-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #28: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), P_ordered_pair-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #29: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 P_singleton-{F}(V0,V1), P_singleton-{F}(V0,V3), V1 == V3 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #30: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 P_cartesian_product2-{F}(V0,V1,V2), P_cartesian_product2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #31: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp2-{F}(V0), pppp2-{F}(V1), V0 == V1 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #32: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp3-{F}(V0), pppp3-{F}(V1), V0 == V1 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #33: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp4-{F}(V0,V1,V2,V3), pppp4-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #34: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp4-{F}(V0,V1,V2,V3), pppp4-{F}(V0,V1,V6,V7), V2 == V6 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #35: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp4-{F}(V0,V1,V2,V3), pppp4-{F}(V0,V5,V6,V7), V1 == V5 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #36: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp4-{F}(V0,V1,V2,V3), pppp4-{F}(V4,V5,V6,V7), V0 == V4 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #37: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp5-{F}(V0,V1,V2), pppp5-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #38: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp5-{F}(V0,V1,V2), pppp5-{F}(V0,V4,V5), V1 == V4 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #39: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp5-{F}(V0,V1,V2), pppp5-{F}(V3,V4,V5), V0 == V3 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #40: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp6-{F}(V0,V1), pppp6-{F}(V0,V3), V1 == V3 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #41: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp6-{F}(V0,V1), pppp6-{F}(V2,V3), V0 == V2 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #42: unsound, references = 3, size of lhs = 3:
% 0.83/1.01 pppp7-{F}(V0), pppp7-{F}(V1), V0 == V1 | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 number of simplifiers = 17
% 0.83/1.01
% 0.83/1.01 Learnt:
% 0.83/1.01 #44: exists( #22, #0 ), references = 2, size of lhs = 1:
% 0.83/1.01 P_unordered_pair-{F}(V0,V1,V2) | P_unordered_pair-{T}(V1,V0,V2)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #47: exists( #22, #45 ), references = 1, size of lhs = 3:
% 0.83/1.01 P_singleton-{F}(V0,V1), P_ordered_pair-{F}(V0,V2,V3), P_unordered_pair-{F}(V0,V2,V4) | P_unordered_pair-{T}(V1,V4,V3)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #49: exists( #23, #7 ), references = 1, size of lhs = 3:
% 0.83/1.01 P_singleton-{F}(V0,V1), P_unordered_pair-{F}(V0,V2,V3), P_unordered_pair-{F}(V3,V1,V4) | P_ordered_pair-{T}(V0,V2,V4)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #55: disj( #13, #17+#19+#5 ), references = 2, size of lhs = 5:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), pppp4-{F}(V0,V1,V3,V4), P_cartesian_product2-{F}(V3,V4,V5), P_ordered_pair-{F}(V6,V7,V2), P_cartesian_product2-{F}(V6,V8,V5) | pppp0-{T}(V0,V1,V3,V4)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #59: exists( #25, #57 ), references = 1, size of lhs = 3:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), pppp4-{F}(V0,V1,V0,V3), P_ordered_pair-{F}(V0,V4,V2) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #61: exists( #11, #58 ), references = 1, size of lhs = 3:
% 0.83/1.01 pppp5-{F}(V0,V1,V0), P_ordered_pair-{F}(V0,V1,V2), P_ordered_pair-{F}(V0,V3,V2) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #67: exists( #25, #65 ), references = 1, size of lhs = 5:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), P_ordered_pair-{F}(V2,V3,V4), P_cartesian_product2-{F}(V0,V5,V6), P_ordered_pair-{F}(V6,V7,V4), pppp4-{F}(V2,V3,V6,V8) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #69: exists( #11, #66 ), references = 1, size of lhs = 5:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), pppp5-{F}(V2,V3,V4), P_ordered_pair-{F}(V2,V3,V5), P_cartesian_product2-{F}(V0,V6,V4), P_ordered_pair-{F}(V4,V7,V5) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #94: disj( #13, #17+#20+#5 ), references = 2, size of lhs = 5:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), pppp4-{F}(V0,V1,V3,V4), P_cartesian_product2-{F}(V3,V4,V5), P_ordered_pair-{F}(V6,V7,V2), P_cartesian_product2-{F}(V8,V7,V5) | pppp0-{T}(V0,V1,V3,V4)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #100: exists( #25, #98 ), references = 1, size of lhs = 5:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), P_ordered_pair-{F}(V3,V2,V4), pppp4-{F}(V3,V2,V5,V6), P_ordered_pair-{F}(V7,V6,V4), P_cartesian_product2-{F}(V0,V8,V6) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #121: exists( #25, #119 ), references = 1, size of lhs = 3:
% 0.83/1.01 pppp4-{F}(V0,V1,V2,V1), P_ordered_pair-{F}(V0,V1,V3), P_ordered_pair-{F}(V4,V1,V3) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #152: mergings( V0 == V6, V1 == V7, V2 == V8, V3 == V9; #147 ), references = 2, size of lhs = 3:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), pppp4-{F}(V0,V1,V3,V4), P_cartesian_product2-{F}(V3,V4,V5) | pppp0-{T}(V0,V1,V3,V4)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #160: mergings( V3 == V6, V4 == V7; #157 ), references = 1, size of lhs = 4:
% 0.83/1.01 P_cartesian_product2-{F}(V0,V1,V2), P_ordered_pair-{F}(V0,V3,V4), P_ordered_pair-{F}(V4,V5,V6), pppp4-{F}(V4,V5,V2,V7) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #162: exists( #11, #157 ), references = 1, size of lhs = 4:
% 0.83/1.01 P_cartesian_product2-{F}(V0,V1,V2), P_ordered_pair-{F}(V0,V3,V4), pppp5-{F}(V4,V5,V2), P_ordered_pair-{F}(V4,V5,V6) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #174: mergings( V5 == V6; #172 ), references = 1, size of lhs = 2:
% 0.83/1.01 P_ordered_pair-{F}(V0,V1,V2), pppp4-{F}(V0,V1,V3,V4) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #177: mergings( V4 == V5; #175 ), references = 2, size of lhs = 2:
% 0.83/1.01 pppp5-{F}(V0,V1,V2), P_ordered_pair-{F}(V0,V1,V3) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #180: mergings( V3 == V4; #178 ), references = 2, size of lhs = 2:
% 0.83/1.01 pppp6-{F}(V0,V1), P_ordered_pair-{F}(V0,V1,V2) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #183: exists( #22, #7 ), references = 1, size of lhs = 3:
% 0.83/1.01 P_singleton-{F}(V0,V1), P_ordered_pair-{F}(V0,V2,V3), P_unordered_pair-{F}(V0,V2,V4) | P_unordered_pair-{T}(V4,V1,V3)
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #190: exists( #23, #180 ), references = 1, size of lhs = 1:
% 0.83/1.01 pppp6-{F}(V0,V1) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #191: exists( #23, #177 ), references = 1, size of lhs = 1:
% 0.83/1.01 pppp5-{F}(V0,V1,V2) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #193: exists( #9, #187 ), references = 1, size of lhs = 1:
% 0.83/1.01 pppp7-{F}(V0) | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 #195: exists( #8, #192 ), references = 1, size of lhs = 0:
% 0.83/1.01 FALSE | FALSE
% 0.83/1.01 (used 0 times, uses = {})
% 0.83/1.01
% 0.83/1.01 number of learnt formulas = 22
% 0.83/1.01
% 0.83/1.01
% 0.83/1.01 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.83/1.01
% 0.83/1.01 randbase = 1
%------------------------------------------------------------------------------