%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : NUM022-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n015.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:11:59 EDT 2022
% Result : Unsatisfiable 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.33 % Computer : n015.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 : Fri Jul 22 23:35:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.37 GeoParameters:
% 0.13/0.37
% 0.13/0.37 tptp_input = 1
% 0.13/0.37 tptp_output = 0
% 0.13/0.37 nonempty = 1
% 0.13/0.37 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37
% 0.13/0.37 RuleSystem INPUT:
% 0.13/0.37
% 0.13/0.37 Initial Rules:
% 0.13/0.37 #0: input, references = 4, size of lhs = 2:
% 0.13/0.37 less-{F}(V2,V0), less-{F}(V1,V2) | less-{T}(V1,V0)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #1: input, references = 4, size of lhs = 3:
% 0.13/0.37 P_successor-{F}(V2,V3), P_add-{F}(V3,V0,V4), equalish-{F}(V4,V1) | less-{T}(V0,V1)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #2: input, references = 4, size of lhs = 4:
% 0.13/0.37 P_predecessor_of_1st_minus_2nd-{F}(V1,V0,V2), P_successor-{F}(V2,V3), P_add-{F}(V3,V0,V4), less-{F}(V0,V1) | equalish-{T}(V4,V1)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #3: input, references = 5, size of lhs = 1:
% 0.13/0.37 divides-{F}(V0,V1) | less-{T}(V0,V1), equalish-{T}(V0,V1)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #4: input, references = 3, size of lhs = 1:
% 0.13/0.37 less-{F}(V0,V1) | divides-{T}(V0,V1)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #5: input, references = 3, size of lhs = 1:
% 0.13/0.37 equalish-{F}(V0,V1) | divides-{T}(V0,V1)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #6: input, references = 4, size of lhs = 2:
% 0.13/0.37 equalish-{F}(V2,V0), equalish-{F}(V1,V2) | equalish-{T}(V1,V0)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #7: input, references = 4, size of lhs = 2:
% 0.13/0.37 P_a-{F}(V0), P_b-{F}(V1) | less-{T}(V0,V1)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #8: input, references = 5, size of lhs = 3:
% 0.13/0.37 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2) | divides-{T}(V1,V2)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #9: input, references = 6, size of lhs = 4:
% 0.13/0.37 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), less-{F}(V0,V2) | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #10: input, references = 4, size of lhs = 2:
% 0.13/0.37 #-{F} V0, #-{F} V1 | EXISTS V2: P_add-{T}(V0,V1,V2)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #11: input, references = 5, size of lhs = 1:
% 0.13/0.37 #-{F} V0 | EXISTS V1: P_successor-{T}(V0,V1)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #12: input, references = 5, size of lhs = 2:
% 0.13/0.37 #-{F} V0, #-{F} V1 | EXISTS V2: P_predecessor_of_1st_minus_2nd-{T}(V0,V1,V2)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #13: input, references = 4, size of lhs = 0:
% 0.13/0.37 FALSE | EXISTS V0: P_a-{T}(V0)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #14: input, references = 4, size of lhs = 0:
% 0.13/0.37 FALSE | EXISTS V0: P_b-{T}(V0)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #15: input, references = 5, size of lhs = 0:
% 0.13/0.37 FALSE | EXISTS V0: P_d-{T}(V0)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 number of initial rules = 16
% 0.13/0.37
% 0.13/0.37 Simplifiers:
% 0.13/0.37 #16: unsound, references = 3, size of lhs = 3:
% 0.13/0.37 P_add-{F}(V0,V1,V2), P_add-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #17: unsound, references = 3, size of lhs = 3:
% 0.13/0.37 P_successor-{F}(V0,V1), P_successor-{F}(V0,V3), V1 == V3 | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #18: unsound, references = 3, size of lhs = 3:
% 0.13/0.37 P_predecessor_of_1st_minus_2nd-{F}(V0,V1,V2), P_predecessor_of_1st_minus_2nd-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #19: unsound, references = 3, size of lhs = 3:
% 0.13/0.37 P_a-{F}(V0), P_a-{F}(V1), V0 == V1 | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #20: unsound, references = 3, size of lhs = 3:
% 0.13/0.37 P_b-{F}(V0), P_b-{F}(V1), V0 == V1 | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #21: unsound, references = 3, size of lhs = 3:
% 0.13/0.37 P_d-{F}(V0), P_d-{F}(V1), V0 == V1 | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 number of simplifiers = 6
% 0.13/0.37
% 0.13/0.37 Learnt:
% 0.13/0.37 #26: exists( #10, #24 ), references = 2, size of lhs = 8:
% 0.13/0.37 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), less-{F}(V0,V3), equalish-{F}(V3,V2), P_predecessor_of_1st_minus_2nd-{F}(V3,V0,V4), P_successor-{F}(V4,V5), P_successor-{F}(V6,V5) | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #28: disj( #3, exists( #10, #24 ) ), references = 2, size of lhs = 8:
% 0.13/0.37 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), less-{F}(V0,V3), divides-{F}(V3,V2), P_predecessor_of_1st_minus_2nd-{F}(V3,V0,V4), P_successor-{F}(V4,V5), P_successor-{F}(V6,V5) | less-{T}(V3,V2)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #34: mergings( V2 == V4, V3 == V6; #31 ), references = 1, size of lhs = 6:
% 0.13/0.37 P_a-{F}(V0), less-{F}(V0,V0), divides-{F}(V0,V1), P_d-{F}(V1), P_predecessor_of_1st_minus_2nd-{F}(V0,V0,V2), P_b-{F}(V3) | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #38: mergings( V1 == V0, V3 == V5; #35 ), references = 1, size of lhs = 5:
% 0.13/0.37 P_a-{F}(V0), less-{F}(V0,V0), divides-{F}(V0,V1), P_d-{F}(V1), P_b-{F}(V2) | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #45: mergings( V1 == V2, V2 == V3, V3 == V4, V4 == V5; #40 ), references = 1, size of lhs = 3:
% 0.13/0.37 P_a-{F}(V0), less-{F}(V0,V0), P_b-{F}(V0) | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #50: exists( #11, #26 ), references = 1, size of lhs = 6:
% 0.13/0.37 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), less-{F}(V0,V3), equalish-{F}(V3,V2), P_predecessor_of_1st_minus_2nd-{F}(V3,V0,V4) | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #52: exists( #12, #49 ), references = 1, size of lhs = 5:
% 0.13/0.37 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), less-{F}(V0,V3), equalish-{F}(V3,V2) | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #54: disj( #3, exists( #12, #49 ) ), references = 1, size of lhs = 5:
% 0.13/0.37 P_a-{F}(V0), P_b-{F}(V1), P_d-{F}(V2), less-{F}(V0,V3), divides-{F}(V3,V2) | less-{T}(V3,V2)
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #63: mergings( V1 == V3, V3 == V5, V2 == V4, V4 == V6; #58 ), references = 1, size of lhs = 3:
% 0.13/0.37 P_a-{F}(V0), less-{F}(V0,V1), P_b-{F}(V1) | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #67: mergings( V1 == V2; #65 ), references = 1, size of lhs = 1:
% 0.13/0.37 P_a-{F}(V0) | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 #69: exists( #13, #65 ), references = 1, size of lhs = 0:
% 0.13/0.37 FALSE | FALSE
% 0.13/0.37 (used 0 times, uses = {})
% 0.13/0.37
% 0.13/0.37 number of learnt formulas = 11
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37
% 0.13/0.37 randbase = 1
%------------------------------------------------------------------------------