TSTP Solution File: SEU153+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : SEU153+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n029.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:20 EDT 2022
% Result : Theorem 2.94s 3.09s
% Output : Refutation 2.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU153+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n029.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 18:37:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.94/3.09 GeoParameters:
% 2.94/3.09
% 2.94/3.09 tptp_input = 1
% 2.94/3.09 tptp_output = 0
% 2.94/3.09 nonempty = 1
% 2.94/3.09 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/3.09 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 2.94/3.09
% 2.94/3.09
% 2.94/3.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/3.09 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/3.09
% 2.94/3.09 RuleSystem INPUT:
% 2.94/3.09
% 2.94/3.09 Initial Rules:
% 2.94/3.09 #0: input, references = 5, size of lhs = 2:
% 2.94/3.09 in-{F}(V0,V1), in-{F}(V1,V0) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #1: input, references = 4, size of lhs = 3:
% 2.94/3.09 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V1,V0,V3), V2 == V3 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #2: input, references = 5, size of lhs = 1:
% 2.94/3.09 P_singleton-{F}(V0,V2) | pppp0-{T}(V0,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #3: input, references = 3, size of lhs = 3:
% 2.94/3.09 P_singleton-{F}(V0,V2), pppp0-{F}(V0,V1), V1 == V2 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #4: input, references = 7, size of lhs = 3:
% 2.94/3.09 pppp0-{F}(V0,V1), in-{F}(V2,V1), V2 == V0 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #5: input, references = 5, size of lhs = 1:
% 2.94/3.09 pppp0-{F}(V0,V1) | in-{T}(V0,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #6: input, references = 5, size of lhs = 2:
% 2.94/3.09 #-{F} V0, #-{F} V1 | pppp0-{T}(V0,V1), pppp11-{T}(V0,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #7: input, references = 6, size of lhs = 1:
% 2.94/3.09 pppp11-{F}(V0,V1) | EXISTS V2: pppp4-{T}(V0,V1,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #8: input, references = 6, size of lhs = 2:
% 2.94/3.09 pppp4-{F}(V0,V1,V0), in-{F}(V0,V1) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #9: input, references = 6, size of lhs = 2:
% 2.94/3.09 pppp4-{F}(V0,V1,V2), V2 == V0 | in-{T}(V2,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #10: input, references = 4, size of lhs = 1:
% 2.94/3.09 P_empty_set-{F}(V0) | pppp1-{T}(V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #11: input, references = 3, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), pppp1-{F}(V1), V1 == V0 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #12: input, references = 7, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), pppp1-{F}(V1), in-{F}(V2,V1) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #13: input, references = 4, size of lhs = 2:
% 2.94/3.09 P_empty_set-{F}(V0), #-{F} V1 | pppp1-{T}(V1), pppp12-{T}(V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #14: input, references = 4, size of lhs = 1:
% 2.94/3.09 pppp12-{F}(V0) | EXISTS V1: pppp5-{T}(V0,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #15: input, references = 4, size of lhs = 1:
% 2.94/3.09 pppp5-{F}(V0,V1) | in-{T}(V1,V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #16: input, references = 6, size of lhs = 2:
% 2.94/3.09 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4) | pppp3-{T}(V1,V2,V4)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #17: input, references = 3, size of lhs = 4:
% 2.94/3.09 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V4), pppp3-{F}(V1,V2,V3), V3 == V4 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #18: input, references = 3, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), pppp3-{F}(V1,V2,V3), in-{F}(V4,V3) | pppp2-{T}(V1,V2,V4)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #19: input, references = 6, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), pppp3-{F}(V1,V2,V3), pppp2-{F}(V1,V2,V4) | in-{T}(V4,V3)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #20: input, references = 4, size of lhs = 4:
% 2.94/3.09 P_empty_set-{F}(V0), #-{F} V1, #-{F} V2, #-{F} V3 | pppp3-{T}(V1,V2,V3), pppp13-{T}(V1,V2,V3)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #21: input, references = 4, size of lhs = 1:
% 2.94/3.09 pppp13-{F}(V0,V1,V2) | EXISTS V3: pppp6-{T}(V0,V1,V2,V3)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #22: input, references = 4, size of lhs = 3:
% 2.94/3.09 pppp6-{F}(V0,V1,V2,V3), pppp2-{F}(V0,V1,V3), in-{F}(V3,V2) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #23: input, references = 4, size of lhs = 1:
% 2.94/3.09 pppp6-{F}(V0,V1,V2,V3) | in-{T}(V3,V2), pppp2-{T}(V0,V1,V3)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #24: input, references = 7, size of lhs = 2:
% 2.94/3.09 P_empty_set-{F}(V0), pppp2-{F}(V1,V2,V3) | in-{T}(V3,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #25: input, references = 6, size of lhs = 2:
% 2.94/3.09 P_empty_set-{F}(V0), pppp2-{F}(V1,V2,V3) | in-{T}(V3,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #26: input, references = 6, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), in-{F}(V3,V1), in-{F}(V3,V2) | pppp2-{T}(V1,V2,V3)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #27: input, references = 4, size of lhs = 4:
% 2.94/3.09 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), disjoint-{F}(V1,V2), V3 == V0 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #28: input, references = 3, size of lhs = 2:
% 2.94/3.09 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V0) | disjoint-{T}(V1,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #29: input, references = 3, size of lhs = 1:
% 2.94/3.09 P_empty_set-{F}(V0) | empty-{T}(V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #30: input, references = 4, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V1,V2), V2 == V1 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #31: input, references = 4, size of lhs = 1:
% 2.94/3.09 P_empty_set-{F}(V0) | EXISTS V1: pppp8-{T}(V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #32: input, references = 4, size of lhs = 1:
% 2.94/3.09 pppp8-{F}(V0) | EXISTS V1: pppp7-{T}(V0,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #33: input, references = 6, size of lhs = 2:
% 2.94/3.09 pppp7-{F}(V0,V1), P_singleton-{F}(V0,V2) | in-{T}(V0,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #34: input, references = 6, size of lhs = 2:
% 2.94/3.09 pppp7-{F}(V0,V1), P_singleton-{F}(V0,V2) | disjoint-{T}(V2,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #35: input, references = 3, size of lhs = 1:
% 2.94/3.09 P_empty_set-{F}(V0) | EXISTS V1: pppp9-{T}(V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #36: input, references = 3, size of lhs = 1:
% 2.94/3.09 pppp9-{F}(V0) | empty-{T}(V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #37: input, references = 3, size of lhs = 1:
% 2.94/3.09 P_empty_set-{F}(V0) | EXISTS V1: pppp10-{T}(V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #38: input, references = 3, size of lhs = 2:
% 2.94/3.09 pppp10-{F}(V0), empty-{F}(V0) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #39: input, references = 3, size of lhs = 2:
% 2.94/3.09 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | disjoint-{T}(V2,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #40: input, references = 7, size of lhs = 2:
% 2.94/3.09 #-{F} V0, #-{F} V1 | EXISTS V2: P_set_intersection2-{T}(V0,V1,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #41: input, references = 4, size of lhs = 1:
% 2.94/3.09 #-{F} V0 | EXISTS V1: P_singleton-{T}(V0,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #42: input, references = 4, size of lhs = 0:
% 2.94/3.09 FALSE | EXISTS V0: P_empty_set-{T}(V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 number of initial rules = 43
% 2.94/3.09
% 2.94/3.09 Simplifiers:
% 2.94/3.09 #43: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 P_set_intersection2-{F}(V0,V1,V2), P_set_intersection2-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #44: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 P_singleton-{F}(V0,V1), P_singleton-{F}(V0,V3), V1 == V3 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #45: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), P_empty_set-{F}(V1), V0 == V1 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #46: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 pppp4-{F}(V0,V1,V2), pppp4-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #47: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 pppp5-{F}(V0,V1), pppp5-{F}(V0,V3), V1 == V3 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #48: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 pppp6-{F}(V0,V1,V2,V3), pppp6-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #49: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 pppp7-{F}(V0,V1), pppp7-{F}(V0,V3), V1 == V3 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #50: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 pppp7-{F}(V0,V1), pppp7-{F}(V2,V3), V0 == V2 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #51: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 pppp8-{F}(V0), pppp8-{F}(V1), V0 == V1 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #52: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 pppp9-{F}(V0), pppp9-{F}(V1), V0 == V1 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #53: unsound, references = 3, size of lhs = 3:
% 2.94/3.09 pppp10-{F}(V0), pppp10-{F}(V1), V0 == V1 | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 number of simplifiers = 11
% 2.94/3.09
% 2.94/3.09 Learnt:
% 2.94/3.09 #55: disj( #6, input ), references = 1, size of lhs = 3:
% 2.94/3.09 P_singleton-{F}(V0,V1), #-{F} V2, V2 == V1 | pppp11-{T}(V0,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #59: exists( #40, #30 ), references = 1, size of lhs = 2:
% 2.94/3.09 P_empty_set-{F}(V0), #-{F} V1 | P_set_intersection2-{T}(V1,V1,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #64: mergings( V0 == V2; #62 ), references = 1, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), #-{F} V1, V1 == V0 | pppp12-{T}(V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #70: exists( #40, #1 ), references = 4, size of lhs = 1:
% 2.94/3.09 P_set_intersection2-{F}(V0,V1,V2) | P_set_intersection2-{T}(V1,V0,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #71: exists( #40, #27 ), references = 4, size of lhs = 2:
% 2.94/3.09 P_empty_set-{F}(V0), disjoint-{F}(V1,V2) | P_set_intersection2-{T}(V1,V2,V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #74: mergings( V0 == V4; #72 ), references = 4, size of lhs = 4:
% 2.94/3.09 P_empty_set-{F}(V0), P_set_intersection2-{F}(V1,V2,V3), #-{F} V4, V4 == V3 | pppp13-{T}(V1,V2,V4)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #83: exists( #14, #81 ), references = 1, size of lhs = 2:
% 2.94/3.09 pppp12-{F}(V0), pppp0-{F}(V1,V0) | pppp5-{T}(V0,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #94: exists( #7, #92 ), references = 1, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), pppp1-{F}(V1), pppp11-{F}(V2,V1) | pppp4-{T}(V2,V1,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #102: disj( #6, input ), references = 1, size of lhs = 3:
% 2.94/3.09 in-{F}(V0,V1), #-{F} V2, V0 == V2 | pppp11-{T}(V2,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #125: exists( #7, #123 ), references = 1, size of lhs = 2:
% 2.94/3.09 pppp11-{F}(V0,V1), pppp0-{F}(V2,V1) | pppp4-{T}(V0,V1,V0), pppp4-{T}(V0,V1,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #192: disj( #23, input ), references = 2, size of lhs = 3:
% 2.94/3.09 P_empty_set-{F}(V0), pppp1-{F}(V1), pppp6-{F}(V2,V3,V1,V4) | pppp2-{T}(V2,V3,V4)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #193: disj( #23, input ), references = 7, size of lhs = 2:
% 2.94/3.09 pppp4-{F}(V0,V1,V0), pppp6-{F}(V2,V3,V1,V0) | pppp2-{T}(V2,V3,V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #194: disj( #23, input ), references = 1, size of lhs = 2:
% 2.94/3.09 in-{F}(V0,V1), pppp6-{F}(V2,V3,V0,V1) | pppp2-{T}(V2,V3,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #229: mergings( V4 == V5; #227 ), references = 4, size of lhs = 4:
% 2.94/3.09 pppp1-{F}(V0), P_empty_set-{F}(V1), pppp0-{F}(V2,V3), pppp13-{F}(V3,V4,V0) | pppp6-{T}(V3,V4,V0,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #314: mergings( V3 == V5, V5 == V6; #310 ), references = 1, size of lhs = 5:
% 2.94/3.09 pppp1-{F}(V0), P_empty_set-{F}(V1), pppp4-{F}(V2,V0,V2), pppp0-{F}(V2,V3), pppp4-{F}(V2,V4,V2) | P_set_intersection2-{T}(V4,V3,V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #318: mergings( V3 == V5, V5 == V6, V6 == V7; #311 ), references = 1, size of lhs = 5:
% 2.94/3.09 pppp1-{F}(V0), P_empty_set-{F}(V1), pppp1-{F}(V2), pppp4-{F}(V3,V0,V3), pppp0-{F}(V3,V4) | P_set_intersection2-{T}(V2,V4,V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #359: mergings( V3 == V5, V5 == V6; #356 ), references = 1, size of lhs = 4:
% 2.94/3.09 pppp1-{F}(V0), P_empty_set-{F}(V1), pppp4-{F}(V2,V0,V2), pppp0-{F}(V2,V3) | P_set_intersection2-{T}(V2,V3,V0)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #450: disj( #440, #193+#24+#8 ), references = 1, size of lhs = 5:
% 2.94/3.09 P_empty_set-{F}(V0), pppp0-{F}(V1,V2), pppp11-{F}(V3,V2), pppp4-{F}(V3,V4,V3), pppp6-{F}(V4,V5,V2,V3) | pppp4-{T}(V3,V2,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #452: mergings( V3 == V4; #448 ), references = 1, size of lhs = 5:
% 2.94/3.09 P_empty_set-{F}(V0), pppp1-{F}(V1), pppp0-{F}(V2,V3), pppp11-{F}(V4,V3), pppp6-{F}(V1,V5,V3,V4) | pppp4-{T}(V4,V3,V2)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #453: disj( #440, #193+#24+#22 ), references = 1, size of lhs = 6:
% 2.94/3.09 P_empty_set-{F}(V0), pppp0-{F}(V1,V2), pppp11-{F}(V3,V2), pppp6-{F}(V4,V5,V2,V3), pppp6-{F}(V6,V7,V4,V3), pppp2-{F}(V6,V7,V3) | pppp4-{T}(V3,V2,V1)
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #574: mergings( V2 == V6, V0 == V3, V3 == V4, V4 == V5; #567 ), references = 1, size of lhs = 4:
% 2.94/3.09 pppp8-{F}(V0), P_empty_set-{F}(V0), in-{F}(V0,V1), P_singleton-{F}(V0,V1) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #580: mergings( V7 == V8, V2 == V3, V3 == V4, V4 == V5, V5 == V6; #568 ), references = 1, size of lhs = 5:
% 2.94/3.09 pppp8-{F}(V0), pppp1-{F}(V1), P_empty_set-{F}(V1), P_singleton-{F}(V0,V2), in-{F}(V0,V2) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #585: mergings( V6 == V7, V2 == V3, V3 == V4, V4 == V5; #569 ), references = 1, size of lhs = 5:
% 2.94/3.09 pppp8-{F}(V0), P_empty_set-{F}(V1), pppp4-{F}(V0,V1,V0), in-{F}(V0,V2), P_singleton-{F}(V0,V2) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #600: mergings( V0 == V2, V2 == V3, V3 == V4; #594 ), references = 1, size of lhs = 2:
% 2.94/3.09 pppp8-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #605: mergings( V2 == V3, V3 == V4, V4 == V5, V5 == V6; #595 ), references = 1, size of lhs = 3:
% 2.94/3.09 pppp8-{F}(V0), pppp1-{F}(V1), P_empty_set-{F}(V1) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #612: mergings( V0 == V2, V2 == V3, V3 == V4, V4 == V5, V5 == V6; #606 ), references = 1, size of lhs = 2:
% 2.94/3.09 pppp1-{F}(V0), P_empty_set-{F}(V0) | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 #615: exists( #42, #613 ), references = 1, size of lhs = 0:
% 2.94/3.09 FALSE | FALSE
% 2.94/3.09 (used 0 times, uses = {})
% 2.94/3.09
% 2.94/3.09 number of learnt formulas = 27
% 2.94/3.09
% 2.94/3.09
% 2.94/3.09 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/3.09
% 2.94/3.09 randbase = 1
%------------------------------------------------------------------------------