TSTP Solution File: MGT036-2 by Geo-III---2018C
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Geo-III---2018C
% Problem : MGT036-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : geo -tptp_input -nonempty -inputfile %s
% Computer : n011.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:10:39 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT036-2 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : geo -tptp_input -nonempty -inputfile %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jul 22 11:11:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.39 GeoParameters:
% 0.20/0.39
% 0.20/0.39 tptp_input = 1
% 0.20/0.39 tptp_output = 0
% 0.20/0.39 nonempty = 1
% 0.20/0.39 inputfile = /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 includepath = /export/starexec/sandbox/solver/bin/../../benchmark/
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39
% 0.20/0.39 RuleSystem INPUT:
% 0.20/0.39
% 0.20/0.39 Initial Rules:
% 0.20/0.39 #0: input, references = 4, size of lhs = 2:
% 0.20/0.39 environment-{F}(V0), subpopulations-{F}(V3,V2,V0,V1) | subpopulations-{T}(V2,V3,V0,V1)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #1: input, references = 4, size of lhs = 4:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), environment-{F}(V2), subpopulations-{F}(V0,V1,V2,V3) | in_environment-{T}(V2,V3)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #2: input, references = 3, size of lhs = 6:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), #-{F} V3, P_growth_rate-{F}(V5,V4,V6), greater-{F}(V2,V6) | environment-{T}(V3)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #3: input, references = 3, size of lhs = 7:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_growth_rate-{F}(V3,V4,V5), greater-{F}(V2,V5), #-{F} V6, #-{F} V7 | subpopulations-{T}(V3,V7,V6,V4)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #4: input, references = 5, size of lhs = 6:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_growth_rate-{F}(V3,V4,V5), greater_or_equal-{F}(V5,V2), greater-{F}(V2,V5) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #5: input, references = 3, size of lhs = 6:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_growth_rate-{F}(V3,V4,V5), environment-{F}(V6), subpopulations-{F}(V3,V7,V6,V4) | greater-{T}(V2,V5), greater_or_equal-{T}(V5,V2)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #6: input, references = 3, size of lhs = 9:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_growth_rate-{F}(V3,V4,V5), greater_or_equal-{F}(V5,V2), P_growth_rate-{F}(V6,V4,V7), greater-{F}(V2,V7), environment-{F}(V8), subpopulations-{F}(V6,V3,V8,V4) | outcompetes-{T}(V3,V6,V4)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #7: input, references = 5, size of lhs = 7:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_growth_rate-{F}(V3,V4,V5), outcompetes-{F}(V3,V6,V4), environment-{F}(V7), subpopulations-{F}(V6,V3,V7,V4) | greater_or_equal-{T}(V5,V2)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #8: input, references = 5, size of lhs = 7:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_growth_rate-{F}(V3,V4,V5), outcompetes-{F}(V6,V3,V4), environment-{F}(V7), subpopulations-{F}(V3,V6,V7,V4) | greater-{T}(V2,V5)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #9: input, references = 4, size of lhs = 5:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_resilience-{F}(V1,V3), P_resilience-{F}(V0,V4) | greater-{T}(V3,V4)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #10: input, references = 4, size of lhs = 13:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_resilience-{F}(V1,V3), P_resilience-{F}(V0,V4), environment-{F}(V6), in_environment-{F}(V6,V5), P_growth_rate-{F}(V7,V5,V8), P_resilience-{F}(V7,V9), greater-{F}(V2,V8), P_growth_rate-{F}(V10,V5,V11), P_resilience-{F}(V10,V12), greater-{F}(V9,V12) | greater-{T}(V2,V11)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #11: input, references = 5, size of lhs = 6:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_resilience-{F}(V1,V3), P_resilience-{F}(V0,V4), P_sk1-{F}(V5) | environment-{T}(V5)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #12: input, references = 5, size of lhs = 7:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_resilience-{F}(V1,V3), P_resilience-{F}(V0,V4), P_sk1-{F}(V5), P_sk2-{F}(V6) | subpopulations-{T}(V0,V1,V5,V6)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #13: input, references = 5, size of lhs = 7:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2), P_resilience-{F}(V1,V3), P_resilience-{F}(V0,V4), P_sk1-{F}(V5), P_sk2-{F}(V6) | outcompetes-{T}(V0,V1,V6)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #14: input, references = 4, size of lhs = 0:
% 0.20/0.39 FALSE | EXISTS V0: P_first_movers-{T}(V0)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #15: input, references = 4, size of lhs = 0:
% 0.20/0.39 FALSE | EXISTS V0: P_efficient_producers-{T}(V0)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #16: input, references = 5, size of lhs = 0:
% 0.20/0.39 FALSE | EXISTS V0: P_zero-{T}(V0)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #17: input, references = 6, size of lhs = 2:
% 0.20/0.39 #-{F} V0, #-{F} V1 | EXISTS V2: P_growth_rate-{T}(V0,V1,V2)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #18: input, references = 6, size of lhs = 1:
% 0.20/0.39 #-{F} V0 | EXISTS V1: P_resilience-{T}(V0,V1)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #19: input, references = 5, size of lhs = 0:
% 0.20/0.39 FALSE | EXISTS V0: P_sk1-{T}(V0)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #20: input, references = 5, size of lhs = 0:
% 0.20/0.39 FALSE | EXISTS V0: P_sk2-{T}(V0)
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 number of initial rules = 21
% 0.20/0.39
% 0.20/0.39 Simplifiers:
% 0.20/0.39 #21: unsound, references = 3, size of lhs = 3:
% 0.20/0.39 greater_or_equal-{F}(V0,V1), greater_or_equal-{F}(V2,V3), V1 == V3 | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #22: unsound, references = 3, size of lhs = 3:
% 0.20/0.39 P_first_movers-{F}(V0), P_first_movers-{F}(V1), V0 == V1 | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #23: unsound, references = 3, size of lhs = 3:
% 0.20/0.39 P_efficient_producers-{F}(V0), P_efficient_producers-{F}(V1), V0 == V1 | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #24: unsound, references = 3, size of lhs = 3:
% 0.20/0.39 P_zero-{F}(V0), P_zero-{F}(V1), V0 == V1 | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #25: unsound, references = 3, size of lhs = 3:
% 0.20/0.39 P_growth_rate-{F}(V0,V1,V2), P_growth_rate-{F}(V0,V1,V5), V2 == V5 | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #26: unsound, references = 3, size of lhs = 3:
% 0.20/0.39 P_resilience-{F}(V0,V1), P_resilience-{F}(V0,V3), V1 == V3 | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #27: unsound, references = 3, size of lhs = 3:
% 0.20/0.39 P_sk1-{F}(V0), P_sk1-{F}(V1), V0 == V1 | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #28: unsound, references = 3, size of lhs = 3:
% 0.20/0.39 P_sk2-{F}(V0), P_sk2-{F}(V1), V0 == V1 | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 number of simplifiers = 8
% 0.20/0.39
% 0.20/0.39 Learnt:
% 0.20/0.39 #36: mergings( V3 == V6, V6 == V9, V4 == V7, V7 == V10; #31 ), references = 1, size of lhs = 9:
% 0.20/0.39 environment-{F}(V0), environment-{F}(V1), P_first_movers-{F}(V2), P_efficient_producers-{F}(V3), P_zero-{F}(V4), outcompetes-{F}(V5,V6,V7), subpopulations-{F}(V6,V5,V0,V7), outcompetes-{F}(V8,V5,V7), subpopulations-{F}(V5,V8,V1,V7) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #51: mergings( V0 == V8, V8 == V10, V10 == V12, V12 == V9, V9 == V11, V11 == V13, V2 == V3, V3 == V5, V5 == V14, V4 == V6; #40 ), references = 1, size of lhs = 5:
% 0.20/0.39 P_sk1-{F}(V0), P_sk2-{F}(V1), P_first_movers-{F}(V2), P_efficient_producers-{F}(V2), P_zero-{F}(V3) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #63: mergings( V4 == V7, V7 == V9, V9 == V11, V11 == V8, V8 == V10, V10 == V12, V1 == V2, V2 == V5, V5 == V13, V3 == V6; #52 ), references = 1, size of lhs = 4:
% 0.20/0.39 P_sk1-{F}(V0), P_first_movers-{F}(V1), P_efficient_producers-{F}(V1), P_zero-{F}(V2) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #74: mergings( V3 == V5, V5 == V7, V7 == V9, V9 == V6, V6 == V8, V8 == V10, V1 == V2, V2 == V4, V4 == V11; #64 ), references = 1, size of lhs = 3:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V0), P_zero-{F}(V1) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #82: mergings( V1 == V2, V2 == V4, V4 == V6, V6 == V3, V3 == V5, V5 == V7; #75 ), references = 1, size of lhs = 2:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V0) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #91: mergings( V3 == V6, V6 == V11, V4 == V7, V7 == V12; #86 ), references = 1, size of lhs = 16:
% 0.20/0.39 environment-{F}(V0), environment-{F}(V1), in_environment-{F}(V1,V2), P_first_movers-{F}(V3), P_resilience-{F}(V3,V4), P_efficient_producers-{F}(V5), P_resilience-{F}(V5,V6), P_zero-{F}(V7), greater_or_equal-{F}(V8,V7), P_growth_rate-{F}(V9,V2,V8), P_resilience-{F}(V9,V10), greater-{F}(V11,V10), P_resilience-{F}(V12,V11), outcompetes-{F}(V13,V12,V2), subpopulations-{F}(V12,V13,V0,V2), P_growth_rate-{F}(V14,V15,V8) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #100: mergings( V3 == V6, V6 == V9, V9 == V14, V4 == V7, V7 == V10, V10 == V15; #93 ), references = 1, size of lhs = 16:
% 0.20/0.39 environment-{F}(V0), environment-{F}(V1), environment-{F}(V2), in_environment-{F}(V2,V3), P_first_movers-{F}(V4), P_resilience-{F}(V4,V5), P_efficient_producers-{F}(V6), P_resilience-{F}(V6,V7), P_zero-{F}(V8), P_resilience-{F}(V9,V10), outcompetes-{F}(V9,V11,V3), subpopulations-{F}(V11,V9,V0,V3), greater-{F}(V12,V10), P_resilience-{F}(V13,V12), outcompetes-{F}(V14,V13,V3), subpopulations-{F}(V13,V14,V1,V3) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #126: mergings( V2 == V5, V5 == V10, V10 == V16, V16 == V18, V18 == V20, V20 == V22, V17 == V19, V19 == V0, V0 == V23, V3 == V6, V6 == V8, V8 == V12, V12 == V24, V7 == V4, V4 == V11, V11 == V13, V13 == V21, V9 == V14; #107 ), references = 1, size of lhs = 6:
% 0.20/0.39 P_sk1-{F}(V0), P_sk2-{F}(V1), P_first_movers-{F}(V2), P_resilience-{F}(V2,V3), P_efficient_producers-{F}(V4), P_zero-{F}(V5) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #139: mergings( V9 == V11, V11 == V0, V0 == V14, V10 == V12, V12 == V13, V13 == V15, V2 == V3, V3 == V4, V4 == V6, V6 == V16, V5 == V7; #127 ), references = 1, size of lhs = 5:
% 0.20/0.39 P_sk1-{F}(V0), P_sk2-{F}(V1), P_first_movers-{F}(V2), P_efficient_producers-{F}(V3), P_zero-{F}(V4) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #152: mergings( V7 == V9, V9 == V11, V11 == V13, V8 == V10, V10 == V12, V12 == V14, V1 == V2, V2 == V3, V3 == V5, V5 == V15, V4 == V6; #140 ), references = 1, size of lhs = 4:
% 0.20/0.39 P_sk1-{F}(V0), P_first_movers-{F}(V1), P_efficient_producers-{F}(V2), P_zero-{F}(V3) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #164: mergings( V5 == V7, V7 == V9, V9 == V11, V6 == V8, V8 == V10, V10 == V12, V1 == V2, V2 == V3, V3 == V4, V4 == V13; #153 ), references = 1, size of lhs = 3:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1), P_zero-{F}(V2) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #172: mergings( V1 == V3, V3 == V5, V5 == V7, V2 == V4, V4 == V6, V6 == V8; #165 ), references = 1, size of lhs = 2:
% 0.20/0.39 P_first_movers-{F}(V0), P_efficient_producers-{F}(V1) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #177: mergings( V1 == V2, V2 == V3, V3 == V4; #173 ), references = 1, size of lhs = 1:
% 0.20/0.39 P_first_movers-{F}(V0) | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 #179: exists( #14, #173 ), references = 1, size of lhs = 0:
% 0.20/0.39 FALSE | FALSE
% 0.20/0.39 (used 0 times, uses = {})
% 0.20/0.39
% 0.20/0.39 number of learnt formulas = 14
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 % SZS output end Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39
% 0.20/0.39 randbase = 1
%------------------------------------------------------------------------------