%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : MGT034+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n002.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 : Wed Aug 31 17:51:29 EDT 2022

% Result   : CounterSatisfiable 0.19s 0.53s
% Output   : Saturation 0.19s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u133,negated_conjecture,
    greater(appear(first_movers,sK1),start_time(sK1)) ).

cnf(u138,negated_conjecture,
    greater(sK0,sF3) ).

cnf(u166,negated_conjecture,
    greater(sF2,sF3) ).

cnf(u178,negated_conjecture,
    ~ in_environment(sK1,sF3) ).

cnf(u194,negated_conjecture,
    in_environment(sK1,sK0) ).

cnf(u208,negated_conjecture,
    ~ decreases(difference(disbanding_rate(first_movers,sF2),disbanding_rate(efficient_producers,sF2))) ).

cnf(u213,negated_conjecture,
    decreases(difference(growth_rate(first_movers,sF2),growth_rate(efficient_producers,sF2))) ).

cnf(u228,negated_conjecture,
    ~ greater_or_equal(sK0,appear(first_movers,sK1)) ).

cnf(u246,negated_conjecture,
    ~ greater_or_equal(sK0,sF2) ).

cnf(u253,negated_conjecture,
    greater_or_equal(difference(growth_rate(first_movers,sF2),growth_rate(efficient_producers,sF2)),zero) ).

cnf(u256,negated_conjecture,
    ~ greater(zero,difference(growth_rate(first_movers,sF2),growth_rate(efficient_producers,sF2))) ).

cnf(u265,negated_conjecture,
    zero = difference(growth_rate(first_movers,sF2),growth_rate(efficient_producers,sF2)) ).

cnf(u282,negated_conjecture,
    ~ in_environment(sK1,zero) ).

cnf(u160,negated_conjecture,
    greater_or_equal(sF2,sF3) ).

cnf(u119,negated_conjecture,
    greater_or_equal(sF2,sK0) ).

cnf(u115,negated_conjecture,
    greater_or_equal(sK0,sF3) ).

cnf(u121,negated_conjecture,
    greater_or_equal(appear(first_movers,sK1),start_time(sK1)) ).

cnf(u111,axiom,
    greater_or_equal(X1,X1) ).

cnf(u203,negated_conjecture,
    ~ greater_or_equal(sF3,start_time(sK1)) ).

cnf(u204,negated_conjecture,
    ~ greater_or_equal(sF3,sK0) ).

cnf(u202,negated_conjecture,
    ~ greater_or_equal(sF3,sF2) ).

cnf(u186,negated_conjecture,
    ( ~ greater_or_equal(sF2,X1)
    | ~ in_environment(sK1,X0)
    | ~ greater_or_equal(X1,X0)
    | in_environment(sK1,X1) ) ).

cnf(u235,negated_conjecture,
    ( ~ greater_or_equal(sF2,X0)
    | ~ greater_or_equal(X0,sF2)
    | subpopulations(first_movers,efficient_producers,sK1,X0) ) ).

cnf(u187,negated_conjecture,
    ( ~ greater_or_equal(start_time(sK1),X3)
    | ~ greater_or_equal(X3,X2)
    | in_environment(sK1,X3)
    | ~ in_environment(sK1,X2) ) ).

cnf(u108,axiom,
    ( ~ greater_or_equal(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)
    | greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)
    | ~ environment(X0)
    | ~ in_environment(X0,X2)
    | ~ greater(X2,X1)
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ decreases(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1))) ) ).

cnf(u100,axiom,
    ( ~ greater_or_equal(X0,X1)
    | greater(X0,X1)
    | X0 = X1 ) ).

cnf(u201,negated_conjecture,
    ( ~ greater_or_equal(X1,X0)
    | in_environment(sK1,X1)
    | ~ in_environment(sK1,X0)
    | ~ greater_or_equal(sK0,X1) ) ).

cnf(u120,negated_conjecture,
    in_environment(sK1,start_time(sK1)) ).

cnf(u113,negated_conjecture,
    in_environment(sK1,sF2) ).

cnf(u199,negated_conjecture,
    ( ~ in_environment(sK1,X1)
    | ~ greater_or_equal(sF3,X1) ) ).

cnf(u105,axiom,
    ( ~ in_environment(X0,X1)
    | ~ in_environment(X0,X3)
    | in_environment(X0,X2)
    | ~ greater_or_equal(X1,X2)
    | ~ environment(X0)
    | ~ greater_or_equal(X2,X3) ) ).

cnf(u89,axiom,
    ( ~ in_environment(X0,appear(efficient_producers,X0))
    | ~ environment(X0)
    | subpopulations(first_movers,efficient_producers,X0,appear(efficient_producers,X0)) ) ).

cnf(u87,axiom,
    ( ~ in_environment(X0,critical_point(X0))
    | subpopulations(first_movers,efficient_producers,X0,critical_point(X0))
    | ~ environment(X0) ) ).

cnf(u289,negated_conjecture,
    decreases(zero) ).

cnf(u161,negated_conjecture,
    decreases(difference(founding_rate(first_movers,sF2),founding_rate(efficient_producers,sF2))) ).

cnf(u294,negated_conjecture,
    ( ~ decreases(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)))
    | ~ greater(sF2,X0)
    | ~ in_environment(X1,sF2)
    | ~ greater_or_equal(X0,appear(efficient_producers,X1))
    | ~ environment(X1)
    | greater(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)),zero) ) ).

cnf(u92,axiom,
    ( ~ decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))
    | ~ environment(X0)
    | ~ subpopulations(first_movers,efficient_producers,X0,X1) ) ).

cnf(u107,axiom,
    ( ~ decreases(difference(founding_rate(first_movers,X0),founding_rate(efficient_producers,X0)))
    | decreases(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)))
    | decreases(difference(disbanding_rate(first_movers,X0),disbanding_rate(efficient_producers,X0))) ) ).

cnf(u97,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sK0) ).

cnf(u116,negated_conjecture,
    greater(sF2,sK0) ).

cnf(u157,negated_conjecture,
    ~ greater(sF2,sF2) ).

cnf(u288,negated_conjecture,
    ~ greater(zero,zero) ).

cnf(u90,axiom,
    ( ~ greater(zero,difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)))
    | greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ) ).

cnf(u86,axiom,
    ( ~ greater(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)),zero)
    | greater(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)) ) ).

cnf(u85,axiom,
    ( ~ greater(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0))
    | greater(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)),zero) ) ).

cnf(u81,axiom,
    ( ~ greater(growth_rate(X0,X1),growth_rate(X2,X1))
    | ~ environment(X3)
    | selection_favors(X0,X2,X1)
    | ~ subpopulations(X2,X0,X3,X1) ) ).

cnf(u91,axiom,
    ( ~ greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0))
    | greater(zero,difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0))) ) ).

cnf(u118,negated_conjecture,
    ~ greater(growth_rate(efficient_producers,sF2),growth_rate(first_movers,sF2)) ).

cnf(u109,hypothesis,
    ( ~ greater(growth_rate(efficient_producers,critical_point(X0)),growth_rate(first_movers,critical_point(X0)))
    | ~ environment(X0) ) ).

cnf(u102,axiom,
    ( ~ greater(X0,X1)
    | greater_or_equal(X0,X1) ) ).

cnf(u154,negated_conjecture,
    subpopulations(efficient_producers,first_movers,sK1,sF2) ).

cnf(u148,negated_conjecture,
    subpopulations(first_movers,efficient_producers,sK1,sF2) ).

cnf(u158,negated_conjecture,
    ( ~ subpopulations(first_movers,efficient_producers,sK1,X0)
    | ~ greater_or_equal(X1,sF2)
    | ~ greater_or_equal(X0,X1)
    | subpopulations(first_movers,efficient_producers,sK1,X1) ) ).

cnf(u93,hypothesis,
    ( ~ subpopulations(first_movers,efficient_producers,X0,X1)
    | decreases(difference(founding_rate(first_movers,X1),founding_rate(efficient_producers,X1)))
    | ~ environment(X0) ) ).

cnf(u110,hypothesis,
    ( ~ subpopulations(first_movers,efficient_producers,X0,X2)
    | ~ greater(X2,critical_point(X0))
    | ~ environment(X0)
    | greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) ) ).

cnf(u84,hypothesis,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X0)
    | ~ subpopulations(first_movers,efficient_producers,X1,X3)
    | ~ environment(X1)
    | ~ greater_or_equal(X3,X2)
    | ~ greater_or_equal(X2,X0)
    | subpopulations(first_movers,efficient_producers,X1,X2) ) ).

cnf(u103,axiom,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X0)
    | subpopulations(efficient_producers,first_movers,X1,X0)
    | ~ environment(X1) ) ).

cnf(u104,axiom,
    ( ~ subpopulations(first_movers,efficient_producers,X0,X1)
    | ~ environment(X0)
    | greater_or_equal(X1,appear(efficient_producers,X0)) ) ).

cnf(u94,axiom,
    ( ~ subpopulations(first_movers,efficient_producers,X1,X0)
    | greater(zero,difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)))
    | ~ environment(X1)
    | greater_or_equal(difference(growth_rate(first_movers,X0),growth_rate(efficient_producers,X0)),zero) ) ).

cnf(u98,negated_conjecture,
    environment(sK1) ).

cnf(u106,axiom,
    ( ~ environment(X0)
    | in_environment(X0,start_time(X0)) ) ).

cnf(u88,axiom,
    ( ~ environment(X0)
    | greater_or_equal(appear(first_movers,X0),start_time(X0)) ) ).

cnf(u114,axiom,
    appear(efficient_producers,sK1) = sF3 ).

cnf(u112,axiom,
    sF2 = critical_point(sK1) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : MGT034+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n002.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   : Tue Aug 30 03:28:43 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  % (27205)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.49  % (27213)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.50  % (27197)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51  % (27221)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.51  % (27221)First to succeed.
% 0.19/0.51  % (27201)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.52  % (27200)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.52  % (27212)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.52  % (27195)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.52  % (27198)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.52  % (27194)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.53  % (27213)Also succeeded, but the first one will report.
% 0.19/0.53  % (27194)Refutation not found, incomplete strategy% (27194)------------------------------
% 0.19/0.53  % (27194)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (27194)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (27194)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.53  
% 0.19/0.53  % (27194)Memory used [KB]: 5500
% 0.19/0.53  % (27194)Time elapsed: 0.122 s
% 0.19/0.53  % (27194)Instructions burned: 3 (million)
% 0.19/0.53  % (27194)------------------------------
% 0.19/0.53  % (27194)------------------------------
% 0.19/0.53  % SZS status CounterSatisfiable for theBenchmark
% 0.19/0.53  % (27221)# SZS output start Saturation.
% See solution above
% 0.19/0.53  % (27221)------------------------------
% 0.19/0.53  % (27221)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (27221)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (27221)Termination reason: Satisfiable
% 0.19/0.53  
% 0.19/0.53  % (27221)Memory used [KB]: 5628
% 0.19/0.53  % (27221)Time elapsed: 0.119 s
% 0.19/0.53  % (27221)Instructions burned: 6 (million)
% 0.19/0.53  % (27221)------------------------------
% 0.19/0.53  % (27221)------------------------------
% 0.19/0.53  % (27192)Success in time 0.179 s
%------------------------------------------------------------------------------