TSTP Solution File: GRA010+1 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n025.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:02:48 EDT 2022
% Result : Theorem 2.84s 3.01s
% Output : Refutation 2.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.12/0.33 % Computer : n025.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 07:57:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.84/3.01 GeoParameters:
% 2.84/3.01
% 2.84/3.01 tptp_input = 1
% 2.84/3.01 tptp_output = 0
% 2.84/3.01 nonempty = 1
% 2.84/3.01 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.84/3.01 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 2.84/3.01
% 2.84/3.01
% 2.84/3.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.84/3.01 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.84/3.01
% 2.84/3.01 RuleSystem INPUT:
% 2.84/3.01
% 2.84/3.01 Initial Rules:
% 2.84/3.01 #0: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_head_of-{F}(V0,V2), P_tail_of-{F}(V0,V2), edge-{F}(V0) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #1: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_head_of-{F}(V0,V1), P_tail_of-{F}(V0,V2), edge-{F}(V0) | vertex-{T}(V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #2: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_head_of-{F}(V0,V1), P_tail_of-{F}(V0,V2), edge-{F}(V0) | vertex-{T}(V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #3: input, references = 3, size of lhs = 4:
% 2.84/3.01 complete-{F}(), vertex-{F}(V0), vertex-{F}(V1), V1 == V0 | EXISTS V2: pppp9-{T}(V1,V0,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #4: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp9-{F}(V0,V1,V2) | pppp8-{T}(V2,V0,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #5: input, references = 3, size of lhs = 3:
% 2.84/3.01 pppp8-{F}(V0,V1,V2), pppp1-{F}(V0,V1,V2), pppp0-{F}(V0,V1,V2) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #6: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp8-{F}(V0,V1,V2) | pppp0-{T}(V0,V1,V2), pppp1-{T}(V0,V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #7: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp8-{F}(V0,V1,V2) | edge-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #8: input, references = 3, size of lhs = 4:
% 2.84/3.01 P_head_of-{F}(V0,V3), P_tail_of-{F}(V0,V4), pppp1-{F}(V0,V1,V2), V2 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #9: input, references = 3, size of lhs = 4:
% 2.84/3.01 P_head_of-{F}(V0,V3), P_tail_of-{F}(V0,V4), pppp1-{F}(V0,V1,V2), V1 == V4 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #10: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_head_of-{F}(V0,V3), P_tail_of-{F}(V0,V4) | pppp1-{T}(V0,V4,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #11: input, references = 4, size of lhs = 4:
% 2.84/3.01 P_head_of-{F}(V0,V3), P_tail_of-{F}(V0,V4), pppp0-{F}(V0,V1,V2), V1 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #12: input, references = 3, size of lhs = 4:
% 2.84/3.01 P_head_of-{F}(V0,V3), P_tail_of-{F}(V0,V4), pppp0-{F}(V0,V1,V2), V2 == V4 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #13: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_head_of-{F}(V0,V3), P_tail_of-{F}(V0,V4) | pppp0-{T}(V0,V3,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #14: input, references = 3, size of lhs = 7:
% 2.84/3.01 P_empty-{F}(V0), vertex-{F}(V6), vertex-{F}(V5), P_tail_of-{F}(V4,V5), P_head_of-{F}(V4,V6), P_path_cons-{F}(V4,V0,V7), edge-{F}(V4) | path-{T}(V5,V6,V7)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #15: input, references = 4, size of lhs = 9:
% 2.84/3.01 P_empty-{F}(V0), vertex-{F}(V1), vertex-{F}(V5), P_tail_of-{F}(V4,V5), P_head_of-{F}(V4,V6), P_path_cons-{F}(V4,V0,V7), edge-{F}(V4), P_path_cons-{F}(V4,V8,V9), path-{F}(V6,V1,V8) | path-{T}(V5,V1,V9)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #16: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), path-{F}(V1,V2,V3) | vertex-{T}(V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #17: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), path-{F}(V1,V2,V3) | vertex-{T}(V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #18: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), path-{F}(V1,V2,V3) | EXISTS V4: pppp11-{T}(V1,V2,V3,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #19: input, references = 5, size of lhs = 2:
% 2.84/3.01 pppp11-{F}(V0,V1,V2,V3), P_tail_of-{F}(V3,V4) | pppp10-{T}(V3,V0,V1,V2,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #20: input, references = 3, size of lhs = 3:
% 2.84/3.01 pppp10-{F}(V0,V1,V2,V3,V4), pppp3-{F}(V0,V2,V3), pppp2-{F}(V0,V2,V3) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #21: input, references = 4, size of lhs = 1:
% 2.84/3.01 pppp10-{F}(V0,V1,V2,V3,V4) | pppp2-{T}(V0,V2,V3), pppp3-{T}(V0,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #22: input, references = 5, size of lhs = 2:
% 2.84/3.01 pppp10-{F}(V0,V1,V2,V3,V4), V1 == V4 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #23: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp10-{F}(V0,V1,V2,V3,V4) | edge-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #24: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), P_head_of-{F}(V1,V4), pppp3-{F}(V1,V2,V3) | EXISTS V5: pppp12-{T}(V1,V2,V3,V5,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #25: input, references = 3, size of lhs = 4:
% 2.84/3.01 P_empty-{F}(V0), P_head_of-{F}(V1,V4), P_path_cons-{F}(V1,V5,V6), path-{F}(V4,V2,V5) | pppp3-{T}(V1,V2,V6)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #26: input, references = 4, size of lhs = 3:
% 2.84/3.01 pppp12-{F}(V0,V1,V2,V3,V4), P_path_cons-{F}(V0,V3,V5), V2 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #27: input, references = 3, size of lhs = 2:
% 2.84/3.01 pppp12-{F}(V0,V1,V2,V3,V4), P_path_cons-{F}(V0,V3,V5) | path-{T}(V4,V1,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #28: input, references = 3, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), P_head_of-{F}(V1,V4), P_path_cons-{F}(V1,V0,V5), pppp2-{F}(V1,V2,V3), V2 == V4 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #29: input, references = 3, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), P_head_of-{F}(V1,V4), P_path_cons-{F}(V1,V0,V5), pppp2-{F}(V1,V2,V3), V3 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #30: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), P_head_of-{F}(V1,V4), P_path_cons-{F}(V1,V0,V5) | pppp2-{T}(V1,V4,V5)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #31: input, references = 3, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), path-{F}(V3,V2,V1), P_head_of-{F}(V4,V5), P_tail_of-{F}(V4,V6), on_path-{F}(V4,V1) | edge-{T}(V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #32: input, references = 3, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), path-{F}(V3,V2,V1), P_head_of-{F}(V4,V5), P_tail_of-{F}(V4,V6), on_path-{F}(V4,V1) | in_path-{T}(V5,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #33: input, references = 3, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), path-{F}(V3,V2,V1), P_head_of-{F}(V4,V5), P_tail_of-{F}(V4,V6), on_path-{F}(V4,V1) | in_path-{T}(V6,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #34: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), path-{F}(V3,V2,V1), in_path-{F}(V4,V1) | vertex-{T}(V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #35: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), path-{F}(V3,V2,V1), in_path-{F}(V4,V1) | EXISTS V5: pppp13-{T}(V5,V1,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #36: input, references = 5, size of lhs = 5:
% 2.84/3.01 pppp13-{F}(V0,V1,V2), P_head_of-{F}(V0,V3), P_tail_of-{F}(V0,V4), V2 == V3, V2 == V4 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #37: input, references = 3, size of lhs = 3:
% 2.84/3.01 pppp13-{F}(V0,V1,V2), P_head_of-{F}(V0,V3), P_tail_of-{F}(V0,V4) | on_path-{T}(V0,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #38: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), sequential-{F}(V1,V2) | pppp4-{T}(V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #39: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), pppp4-{F}(V1,V2) | sequential-{T}(V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #40: input, references = 4, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), P_head_of-{F}(V1,V3), P_tail_of-{F}(V2,V4) | pppp14-{T}(V1,V2,V3,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #41: input, references = 3, size of lhs = 4:
% 2.84/3.01 pppp14-{F}(V0,V1,V3,V3), edge-{F}(V0), edge-{F}(V1), V0 == V1 | pppp4-{T}(V0,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #42: input, references = 4, size of lhs = 3:
% 2.84/3.01 pppp14-{F}(V0,V1,V2,V3), pppp4-{F}(V0,V1), V2 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #43: input, references = 3, size of lhs = 2:
% 2.84/3.01 pppp14-{F}(V1,V1,V2,V3), pppp4-{F}(V1,V1) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #44: input, references = 3, size of lhs = 2:
% 2.84/3.01 pppp14-{F}(V0,V1,V2,V3), pppp4-{F}(V0,V1) | edge-{T}(V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #45: input, references = 3, size of lhs = 2:
% 2.84/3.01 pppp14-{F}(V0,V1,V2,V3), pppp4-{F}(V0,V1) | edge-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #46: input, references = 3, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), on_path-{F}(V2,V1), on_path-{F}(V3,V1), sequential-{F}(V3,V2), path-{F}(V5,V4,V1) | precedes-{T}(V3,V2,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #47: input, references = 3, size of lhs = 6:
% 2.84/3.01 P_empty-{F}(V0), on_path-{F}(V2,V1), on_path-{F}(V3,V1), sequential-{F}(V3,V4), precedes-{F}(V4,V2,V1), path-{F}(V6,V5,V1) | precedes-{T}(V3,V2,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #48: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), precedes-{F}(V2,V3,V1), path-{F}(V5,V4,V1) | pppp15-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #49: input, references = 3, size of lhs = 3:
% 2.84/3.01 pppp15-{F}(V0,V1,V2), pppp5-{F}(V0,V1,V2), sequential-{F}(V1,V2) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #50: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp15-{F}(V0,V1,V2) | sequential-{T}(V1,V2), pppp5-{T}(V0,V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #51: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp15-{F}(V0,V1,V2) | on_path-{T}(V2,V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #52: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp15-{F}(V0,V1,V2) | on_path-{T}(V1,V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #53: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), pppp5-{F}(V1,V2,V3) | EXISTS V4: pppp16-{T}(V1,V2,V3,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #54: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), sequential-{F}(V2,V4), precedes-{F}(V4,V3,V1) | pppp5-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #55: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp16-{F}(V0,V1,V2,V3) | precedes-{T}(V3,V2,V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #56: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp16-{F}(V0,V1,V2,V3) | sequential-{T}(V1,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #57: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), shortest_path-{F}(V1,V2,V3) | pppp6-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #58: input, references = 4, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), pppp6-{F}(V1,V2,V3) | shortest_path-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #59: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), P_length_of-{F}(V3,V4), pppp6-{F}(V1,V2,V3) | path-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #60: input, references = 3, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), P_length_of-{F}(V3,V4), pppp6-{F}(V2,V2,V3) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #61: input, references = 3, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), P_length_of-{F}(V3,V4), pppp6-{F}(V1,V2,V3), P_length_of-{F}(V5,V6), path-{F}(V1,V2,V5) | less_or_equal-{T}(V4,V6)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #62: input, references = 4, size of lhs = 4:
% 2.84/3.01 P_empty-{F}(V0), P_length_of-{F}(V3,V4), path-{F}(V1,V2,V3), V1 == V2 | pppp6-{T}(V1,V2,V3), pppp25-{T}(V1,V2,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #63: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp25-{F}(V0,V1,V2) | EXISTS V3: pppp17-{T}(V0,V1,V3,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #64: input, references = 3, size of lhs = 3:
% 2.84/3.01 pppp17-{F}(V0,V1,V2,V3), P_length_of-{F}(V2,V4), less_or_equal-{F}(V3,V4) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #65: input, references = 3, size of lhs = 2:
% 2.84/3.01 pppp17-{F}(V0,V1,V2,V3), P_length_of-{F}(V2,V4) | path-{T}(V0,V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #66: input, references = 5, size of lhs = 7:
% 2.84/3.01 P_empty-{F}(V0), shortest_path-{F}(V3,V2,V1), P_tail_of-{F}(V5,V6), P_head_of-{F}(V4,V7), precedes-{F}(V5,V4,V1), P_tail_of-{F}(V8,V6), P_head_of-{F}(V8,V7) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #67: input, references = 3, size of lhs = 6:
% 2.84/3.01 P_empty-{F}(V0), shortest_path-{F}(V3,V2,V1), P_tail_of-{F}(V5,V6), P_head_of-{F}(V4,V7), precedes-{F}(V5,V4,V1), precedes-{F}(V4,V5,V1) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #68: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), triangle-{F}(V1,V2,V3) | pppp7-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #69: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), pppp7-{F}(V1,V2,V3) | triangle-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #70: input, references = 3, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), pppp7-{F}(V1,V2,V3) | pppp18-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #71: input, references = 3, size of lhs = 7:
% 2.84/3.01 P_empty-{F}(V0), edge-{F}(V1), edge-{F}(V2), edge-{F}(V3), sequential-{F}(V1,V2), sequential-{F}(V2,V3), sequential-{F}(V3,V1) | pppp7-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #72: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp18-{F}(V0,V1,V2) | sequential-{T}(V2,V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #73: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp18-{F}(V0,V1,V2) | sequential-{T}(V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #74: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp18-{F}(V0,V1,V2) | sequential-{T}(V0,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #75: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp18-{F}(V0,V1,V2) | edge-{T}(V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #76: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp18-{F}(V0,V1,V2) | edge-{T}(V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #77: input, references = 3, size of lhs = 1:
% 2.84/3.01 pppp18-{F}(V0,V1,V2) | edge-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #78: input, references = 6, size of lhs = 6:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_length_of-{F}(V2,V3), P_number_of_in-{F}(V1,V2,V4), path-{F}(V6,V5,V2), V3 == V4 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #79: input, references = 6, size of lhs = 9:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_number_of_in-{F}(V2,V4,V5), P_length_of-{F}(V4,V6), P_minus-{F}(V6,V3,V7), path-{F}(V9,V8,V4), V5 == V7 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #80: input, references = 4, size of lhs = 9:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), P_number_of_in-{F}(V2,V5,V6), P_number_of_in-{F}(V4,V5,V7), path-{F}(V10,V9,V5), V6 == V7 | EXISTS V8: pppp20-{T}(V5,V8)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #81: input, references = 4, size of lhs = 1:
% 2.84/3.01 pppp20-{F}(V0,V1) | EXISTS V2: pppp19-{T}(V0,V2,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #82: input, references = 4, size of lhs = 1:
% 2.84/3.01 pppp20-{F}(V0,V1) | on_path-{T}(V1,V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #83: input, references = 4, size of lhs = 2:
% 2.84/3.01 pppp19-{F}(V0,V1,V2), triangle-{F}(V1,V2,V3) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #84: input, references = 4, size of lhs = 1:
% 2.84/3.01 pppp19-{F}(V0,V1,V2) | sequential-{T}(V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #85: input, references = 4, size of lhs = 1:
% 2.84/3.01 pppp19-{F}(V0,V1,V2) | on_path-{T}(V1,V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #86: input, references = 3, size of lhs = 8:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), P_graph-{F}(V5), P_number_of_in-{F}(V6,V7,V8), P_number_of_in-{F}(V6,V5,V9) | less_or_equal-{T}(V8,V9)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #87: input, references = 3, size of lhs = 6:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), P_graph-{F}(V5) | complete-{T}()
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #88: input, references = 5, size of lhs = 6:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), P_graph-{F}(V5) | EXISTS V6: pppp24-{T}(V6,V2,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #89: input, references = 6, size of lhs = 3:
% 2.84/3.01 pppp24-{F}(V0,V1,V2), P_number_of_in-{F}(V1,V0,V3), P_number_of_in-{F}(V2,V0,V4) | EXISTS V5: pppp23-{T}(V0,V5)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #90: input, references = 5, size of lhs = 3:
% 2.84/3.01 pppp24-{F}(V0,V1,V2), P_number_of_in-{F}(V1,V0,V4), P_number_of_in-{F}(V2,V0,V4) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #91: input, references = 4, size of lhs = 6:
% 2.84/3.01 pppp24-{F}(V0,V1,V2), P_number_of_in-{F}(V1,V0,V3), P_number_of_in-{F}(V2,V0,V4), on_path-{F}(V5,V0), on_path-{F}(V6,V0), sequential-{F}(V6,V5) | EXISTS V7: pppp21-{T}(V6,V5,V7)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #92: input, references = 6, size of lhs = 1:
% 2.84/3.01 pppp23-{F}(V0,V1) | EXISTS V2: pppp22-{T}(V1,V0,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #93: input, references = 6, size of lhs = 1:
% 2.84/3.01 pppp22-{F}(V0,V1,V2) | path-{T}(V2,V0,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #94: input, references = 4, size of lhs = 1:
% 2.84/3.01 pppp21-{F}(V0,V1,V2) | triangle-{T}(V0,V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #95: input, references = 7, size of lhs = 1:
% 2.84/3.01 #-{F} V0 | EXISTS V1: P_head_of-{T}(V0,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #96: input, references = 7, size of lhs = 1:
% 2.84/3.01 #-{F} V0 | EXISTS V1: P_tail_of-{T}(V0,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #97: input, references = 5, size of lhs = 2:
% 2.84/3.01 #-{F} V0, #-{F} V1 | EXISTS V2: P_path_cons-{T}(V0,V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #98: input, references = 4, size of lhs = 0:
% 2.84/3.01 FALSE | EXISTS V0: P_empty-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #99: input, references = 4, size of lhs = 1:
% 2.84/3.01 #-{F} V0 | EXISTS V1: P_length_of-{T}(V0,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #100: input, references = 13, size of lhs = 2:
% 2.84/3.01 #-{F} V0, #-{F} V1 | EXISTS V2: P_number_of_in-{T}(V0,V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #101: input, references = 4, size of lhs = 0:
% 2.84/3.01 FALSE | EXISTS V0: P_edges-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #102: input, references = 4, size of lhs = 0:
% 2.84/3.01 FALSE | EXISTS V0: P_sequential_pairs-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #103: input, references = 5, size of lhs = 2:
% 2.84/3.01 #-{F} V0, #-{F} V1 | EXISTS V2: P_minus-{T}(V0,V1,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #104: input, references = 5, size of lhs = 0:
% 2.84/3.01 FALSE | EXISTS V0: P_n1-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #105: input, references = 5, size of lhs = 0:
% 2.84/3.01 FALSE | EXISTS V0: P_triangles-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #106: input, references = 5, size of lhs = 0:
% 2.84/3.01 FALSE | EXISTS V0: P_graph-{T}(V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 number of initial rules = 107
% 2.84/3.01
% 2.84/3.01 Simplifiers:
% 2.84/3.01 #107: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_head_of-{F}(V0,V1), P_head_of-{F}(V0,V3), V1 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #108: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_tail_of-{F}(V0,V1), P_tail_of-{F}(V0,V3), V1 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #109: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_path_cons-{F}(V0,V1,V2), P_path_cons-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #110: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), P_empty-{F}(V1), V0 == V1 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #111: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_length_of-{F}(V0,V1), P_length_of-{F}(V0,V3), V1 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #112: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_number_of_in-{F}(V0,V1,V2), P_number_of_in-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #113: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_edges-{F}(V0), P_edges-{F}(V1), V0 == V1 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #114: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_sequential_pairs-{F}(V0), P_sequential_pairs-{F}(V1), V0 == V1 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #115: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_minus-{F}(V0,V1,V2), P_minus-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #116: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_n1-{F}(V0), P_n1-{F}(V1), V0 == V1 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #117: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_triangles-{F}(V0), P_triangles-{F}(V1), V0 == V1 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #118: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 P_graph-{F}(V0), P_graph-{F}(V1), V0 == V1 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #119: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp8-{F}(V0,V1,V2), pppp8-{F}(V3,V1,V2), V0 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #120: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp9-{F}(V0,V1,V2), pppp9-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #121: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp10-{F}(V0,V1,V2,V3,V4), pppp10-{F}(V5,V1,V2,V3,V9), V0 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #122: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp10-{F}(V0,V1,V2,V3,V4), pppp10-{F}(V0,V6,V7,V8,V9), V4 == V9 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #123: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp11-{F}(V0,V1,V2,V3), pppp11-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #124: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp12-{F}(V0,V1,V2,V3,V4), pppp12-{F}(V0,V1,V2,V8,V4), V3 == V8 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #125: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp12-{F}(V0,V1,V2,V3,V4), pppp12-{F}(V0,V6,V7,V8,V9), V4 == V9 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #126: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp13-{F}(V0,V1,V2), pppp13-{F}(V3,V1,V2), V0 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #127: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp14-{F}(V0,V1,V2,V3), pppp14-{F}(V0,V5,V6,V7), V2 == V6 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #128: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp14-{F}(V0,V1,V2,V3), pppp14-{F}(V4,V1,V6,V7), V3 == V7 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #129: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp16-{F}(V0,V1,V2,V3), pppp16-{F}(V0,V1,V2,V7), V3 == V7 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #130: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp17-{F}(V0,V1,V2,V3), pppp17-{F}(V0,V1,V6,V3), V2 == V6 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #131: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp19-{F}(V0,V1,V2), pppp19-{F}(V0,V4,V2), V1 == V4 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #132: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp19-{F}(V0,V1,V2), pppp19-{F}(V0,V4,V5), V2 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #133: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp20-{F}(V0,V1), pppp20-{F}(V0,V3), V1 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #134: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp21-{F}(V0,V1,V2), pppp21-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #135: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp22-{F}(V0,V1,V2), pppp22-{F}(V0,V1,V5), V2 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #136: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp22-{F}(V0,V1,V2), pppp22-{F}(V3,V1,V5), V0 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #137: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp23-{F}(V0,V1), pppp23-{F}(V0,V3), V1 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #138: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp24-{F}(V0,V1,V2), pppp24-{F}(V3,V1,V2), V0 == V3 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #139: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp24-{F}(V0,V1,V2), pppp24-{F}(V3,V4,V5), V1 == V4 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #140: unsound, references = 3, size of lhs = 3:
% 2.84/3.01 pppp24-{F}(V0,V1,V2), pppp24-{F}(V3,V4,V5), V2 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 number of simplifiers = 34
% 2.84/3.01
% 2.84/3.01 Learnt:
% 2.84/3.01 #143: exists( #92, #141 ), references = 1, size of lhs = 9:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), pppp23-{F}(V4,V5), P_number_of_in-{F}(V2,V4,V6), P_length_of-{F}(V4,V7), P_minus-{F}(V7,V3,V8), V6 == V8 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #145: exists( #89, #142 ), references = 1, size of lhs = 11:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_number_of_in-{F}(V2,V4,V5), P_length_of-{F}(V4,V6), P_minus-{F}(V6,V3,V7), V5 == V7, pppp24-{F}(V4,V8,V9), P_number_of_in-{F}(V8,V4,V10), P_number_of_in-{F}(V9,V4,V11) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #147: exists( #100, #144 ), references = 3, size of lhs = 8:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_length_of-{F}(V4,V5), P_minus-{F}(V5,V3,V6), pppp24-{F}(V4,V2,V7), P_number_of_in-{F}(V7,V4,V8) | P_number_of_in-{T}(V2,V4,V6)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #151: exists( #92, #149 ), references = 1, size of lhs = 6:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), pppp23-{F}(V2,V3), P_length_of-{F}(V2,V4), P_number_of_in-{F}(V1,V2,V5), V4 == V5 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #153: exists( #89, #150 ), references = 3, size of lhs = 8:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_length_of-{F}(V2,V3), P_number_of_in-{F}(V1,V2,V4), V3 == V4, pppp24-{F}(V2,V5,V6), P_number_of_in-{F}(V5,V2,V7), P_number_of_in-{F}(V6,V2,V8) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #159: mergings( V3 == V7, V8 == V10, V4 == V5; #155 ), references = 2, size of lhs = 8:
% 2.84/3.01 P_sequential_pairs-{F}(V0), P_edges-{F}(V0), P_n1-{F}(V1), P_empty-{F}(V2), P_length_of-{F}(V3,V4), P_minus-{F}(V4,V1,V5), V4 == V5, pppp24-{F}(V3,V0,V6) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #161: exists( #100, #153 ), references = 3, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_length_of-{F}(V2,V3), pppp24-{F}(V2,V1,V4), P_number_of_in-{F}(V4,V2,V5) | P_number_of_in-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #165: exists( #103, #159 ), references = 1, size of lhs = 6:
% 2.84/3.01 P_sequential_pairs-{F}(V0), P_edges-{F}(V0), P_n1-{F}(V1), P_empty-{F}(V2), P_length_of-{F}(V3,V4), pppp24-{F}(V3,V0,V5) | P_minus-{T}(V4,V1,V4)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #196: mergings( V1 == V8; #194 ), references = 1, size of lhs = 12:
% 2.84/3.01 vertex-{F}(V0), vertex-{F}(V1), edge-{F}(V2), P_tail_of-{F}(V2,V1), P_head_of-{F}(V2,V3), path-{F}(V3,V0,V4), P_path_cons-{F}(V2,V4,V5), P_empty-{F}(V6), P_edges-{F}(V7), P_length_of-{F}(V5,V8), P_number_of_in-{F}(V7,V5,V9), V8 == V9 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #201: exists( #100, #78 ), references = 1, size of lhs = 4:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_length_of-{F}(V2,V3), path-{F}(V4,V5,V2) | P_number_of_in-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #202: exists( #100, #79 ), references = 1, size of lhs = 7:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_length_of-{F}(V4,V5), P_minus-{F}(V5,V3,V6), path-{F}(V7,V8,V4) | P_number_of_in-{T}(V2,V4,V6)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #212: disj( #21, input ), references = 1, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), P_head_of-{F}(V1,V2), P_path_cons-{F}(V1,V0,V3), pppp10-{F}(V1,V4,V5,V6,V7), V5 == V2 | pppp3-{T}(V1,V5,V6)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #214: exists( #96, #11 ), references = 1, size of lhs = 3:
% 2.84/3.01 P_head_of-{F}(V0,V1), pppp0-{F}(V0,V2,V3), V2 == V1 | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #216: exists( #95, #213 ), references = 1, size of lhs = 1:
% 2.84/3.01 pppp0-{F}(V0,V1,V2) | P_head_of-{T}(V0,V1)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #219: exists( #103, #79 ), references = 1, size of lhs = 7:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_number_of_in-{F}(V2,V4,V5), P_length_of-{F}(V4,V6), path-{F}(V7,V8,V4) | P_minus-{T}(V6,V3,V5)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #245: exists( #96, #36 ), references = 1, size of lhs = 3:
% 2.84/3.01 P_head_of-{F}(V0,V1), pppp13-{F}(V0,V2,V3), V3 == V1 | P_tail_of-{T}(V0,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #249: exists( #95, #247 ), references = 1, size of lhs = 3:
% 2.84/3.01 pppp13-{F}(V0,V1,V2), pppp11-{F}(V3,V4,V5,V0), V3 == V2 | P_head_of-{T}(V0,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #262: exists( #95, #260 ), references = 1, size of lhs = 7:
% 2.84/3.01 P_empty-{F}(V0), P_tail_of-{F}(V1,V2), P_head_of-{F}(V1,V3), P_head_of-{F}(V4,V3), pppp13-{F}(V5,V6,V2), precedes-{F}(V5,V4,V7), shortest_path-{F}(V8,V9,V7) | P_head_of-{T}(V5,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #271: exists( #96, #269 ), references = 1, size of lhs = 1:
% 2.84/3.01 pppp11-{F}(V0,V1,V2,V3) | P_tail_of-{T}(V3,V0)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #276: mergings( V0 == V5, V5 == V6; #273 ), references = 1, size of lhs = 9:
% 2.84/3.01 P_empty-{F}(V0), P_tail_of-{F}(V1,V2), P_tail_of-{F}(V3,V2), P_head_of-{F}(V3,V4), P_head_of-{F}(V5,V4), precedes-{F}(V1,V5,V6), P_length_of-{F}(V6,V7), path-{F}(V8,V9,V6), V8 == V9 | pppp25-{T}(V8,V9,V7)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #288: exists( #95, #286 ), references = 1, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), pppp4-{F}(V1,V2), P_tail_of-{F}(V2,V3) | P_head_of-{T}(V1,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #338: exists( #97, #26 ), references = 1, size of lhs = 1:
% 2.84/3.01 pppp12-{F}(V0,V1,V2,V3,V4) | P_path_cons-{T}(V0,V3,V2)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #346: exists( #91, #344 ), references = 1, size of lhs = 7:
% 2.84/3.01 on_path-{F}(V0,V1), sequential-{F}(V0,V2), on_path-{F}(V2,V1), pppp19-{F}(V3,V0,V2), pppp24-{F}(V1,V4,V5), P_number_of_in-{F}(V4,V1,V6), P_number_of_in-{F}(V5,V1,V7) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #350: exists( #81, #348 ), references = 1, size of lhs = 5:
% 2.84/3.01 pppp20-{F}(V0,V1), on_path-{F}(V1,V0), pppp24-{F}(V0,V2,V3), P_number_of_in-{F}(V2,V0,V4), P_number_of_in-{F}(V3,V0,V5) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #353: exists( #80, #351 ), references = 1, size of lhs = 12:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), P_number_of_in-{F}(V2,V5,V6), P_number_of_in-{F}(V4,V5,V7), V6 == V7, path-{F}(V8,V9,V5), pppp24-{F}(V5,V10,V11), P_number_of_in-{F}(V10,V5,V12), P_number_of_in-{F}(V11,V5,V13) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #356: exists( #92, #354 ), references = 1, size of lhs = 12:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), pppp23-{F}(V5,V6), P_number_of_in-{F}(V2,V5,V7), P_number_of_in-{F}(V4,V5,V8), V7 == V8, pppp24-{F}(V5,V9,V10), P_number_of_in-{F}(V9,V5,V11), P_number_of_in-{F}(V10,V5,V12) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #362: mergings( V1 == V13, V3 == V15, V2 == V14, V4 == V16; #357 ), references = 3, size of lhs = 11:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), P_number_of_in-{F}(V2,V5,V6), P_number_of_in-{F}(V4,V5,V7), V6 == V7, pppp24-{F}(V5,V8,V9), P_number_of_in-{F}(V8,V5,V10), P_number_of_in-{F}(V9,V5,V11) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #367: mergings( V3 == V5, V4 == V6; #364 ), references = 1, size of lhs = 7:
% 2.84/3.01 P_sequential_pairs-{F}(V0), P_edges-{F}(V0), P_empty-{F}(V1), P_n1-{F}(V2), P_triangles-{F}(V3), pppp24-{F}(V4,V0,V3), P_length_of-{F}(V4,V5) | P_number_of_in-{T}(V3,V4,V5)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #375: mergings( V2 == V4, V4 == V8, V3 == V5, V5 == V9; #370 ), references = 1, size of lhs = 6:
% 2.84/3.01 P_sequential_pairs-{F}(V0), P_edges-{F}(V0), P_n1-{F}(V1), P_triangles-{F}(V2), P_empty-{F}(V3), pppp24-{F}(V4,V0,V2) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #383: mergings( V0 == V7, V7 == V8, V8 == V11, V1 == V2, V2 == V9, V3 == V10; #376 ), references = 1, size of lhs = 6:
% 2.84/3.01 P_graph-{F}(V0), P_sequential_pairs-{F}(V1), P_edges-{F}(V1), P_n1-{F}(V2), P_triangles-{F}(V3), P_empty-{F}(V4) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #391: mergings( V1 == V4, V4 == V6, V6 == V10, V2 == V5, V5 == V7, V3 == V8; #384 ), references = 1, size of lhs = 5:
% 2.84/3.01 P_sequential_pairs-{F}(V0), P_edges-{F}(V0), P_n1-{F}(V1), P_triangles-{F}(V2), P_empty-{F}(V3) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #399: mergings( V1 == V4, V4 == V6, V6 == V9, V2 == V5, V5 == V7, V3 == V8; #392 ), references = 1, size of lhs = 4:
% 2.84/3.01 P_sequential_pairs-{F}(V0), P_edges-{F}(V0), P_n1-{F}(V1), P_empty-{F}(V2) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #406: mergings( V1 == V3, V3 == V5, V5 == V7, V2 == V4, V4 == V6; #400 ), references = 1, size of lhs = 3:
% 2.84/3.01 P_sequential_pairs-{F}(V0), P_edges-{F}(V0), P_empty-{F}(V1) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #413: mergings( V3 == V6, V4 == V7, V5 == V9; #409 ), references = 1, size of lhs = 8:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), pppp24-{F}(V5,V2,V4), P_length_of-{F}(V5,V6), P_minus-{F}(V6,V3,V7) | P_number_of_in-{T}(V4,V5,V7)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #417: exists( #100, #153 ), references = 1, size of lhs = 7:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_length_of-{F}(V2,V3), P_number_of_in-{F}(V1,V2,V4), V3 == V4, pppp24-{F}(V2,V5,V6), P_number_of_in-{F}(V6,V2,V7) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #419: exists( #100, #416 ), references = 1, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_length_of-{F}(V2,V3), pppp24-{F}(V2,V4,V5), P_number_of_in-{F}(V5,V2,V6) | P_number_of_in-{T}(V1,V2,V3)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #421: exists( #100, #362 ), references = 1, size of lhs = 8:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), P_number_of_in-{F}(V4,V5,V6), pppp24-{F}(V5,V2,V7), P_number_of_in-{F}(V7,V5,V8) | P_number_of_in-{T}(V2,V5,V6)
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #424: exists( #100, #422 ), references = 1, size of lhs = 6:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4), pppp24-{F}(V5,V2,V4) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #429: mergings( V0 == V7, V1 == V8, V3 == V9; #425 ), references = 1, size of lhs = 6:
% 2.84/3.01 P_graph-{F}(V0), P_empty-{F}(V1), P_edges-{F}(V2), P_sequential_pairs-{F}(V3), P_n1-{F}(V4), P_triangles-{F}(V5) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #434: mergings( V1 == V4, V2 == V5, V3 == V7; #430 ), references = 1, size of lhs = 5:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3), P_triangles-{F}(V4) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #439: mergings( V1 == V4, V2 == V5, V3 == V7; #435 ), references = 1, size of lhs = 4:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2), P_n1-{F}(V3) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #443: mergings( V1 == V3, V2 == V4; #440 ), references = 1, size of lhs = 3:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1), P_sequential_pairs-{F}(V2) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #447: mergings( V1 == V3, V2 == V4; #444 ), references = 1, size of lhs = 2:
% 2.84/3.01 P_empty-{F}(V0), P_edges-{F}(V1) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #450: mergings( V1 == V2; #448 ), references = 1, size of lhs = 1:
% 2.84/3.01 P_empty-{F}(V0) | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 #452: exists( #98, #448 ), references = 1, size of lhs = 0:
% 2.84/3.01 FALSE | FALSE
% 2.84/3.01 (used 0 times, uses = {})
% 2.84/3.01
% 2.84/3.01 number of learnt formulas = 45
% 2.84/3.01
% 2.84/3.01
% 2.84/3.01 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.84/3.01
% 2.84/3.01 randbase = 1
%------------------------------------------------------------------------------