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

% Computer : n018.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:06 EDT 2022

% Result   : Satisfiable 0.21s 0.51s
% Output   : Saturation 0.21s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u40,negated_conjecture,
    ( greater_or_equal(end_time(X0),appear(an_organisation,X0))
    | ~ in_environment(sk2,X0)
    | ~ environment(X0) ) ).

cnf(u48,axiom,
    ( ~ greater_or_equal(end_time(X0),appear(efficient_producers,X0))
    | ~ environment(X0)
    | selection_favors(first_movers,efficient_producers,end_time(X0))
    | in_environment(X0,critical_point(X0)) ) ).

cnf(mp_appearance_before_end_holds_33,axiom,
    ( ~ greater_or_equal(end_time(X0),appear(an_organisation,X0))
    | in_environment(X0,appear(an_organisation,X0))
    | ~ environment(X0) ) ).

cnf(u23,hypothesis,
    ( ~ greater_or_equal(appear(efficient_producers,X0),X1)
    | ~ greater_or_equal(X1,appear(first_movers,X0))
    | appear(efficient_producers,X0) = X1
    | selection_favors(first_movers,efficient_producers,X1)
    | ~ environment(X0)
    | ~ in_environment(X0,X1) ) ).

cnf(u35,hypothesis,
    ( ~ greater_or_equal(X0,appear(first_movers,X1))
    | ~ environment(X1)
    | selection_favors(first_movers,efficient_producers,X0)
    | greater_or_equal(X0,appear(efficient_producers,X1))
    | ~ in_environment(X1,X0) ) ).

cnf(u24,hypothesis,
    ( ~ greater_or_equal(X3,appear(efficient_producers,X2))
    | ~ environment(X2)
    | ~ in_environment(X2,critical_point(X2))
    | ~ greater_or_equal(critical_point(X2),X3)
    | selection_favors(first_movers,efficient_producers,X3)
    | critical_point(X2) = X3 ) ).

cnf(u47,axiom,
    ( ~ greater_or_equal(X2,appear(efficient_producers,X1))
    | critical_point(X1) = X2
    | ~ greater_or_equal(critical_point(X1),X2)
    | ~ environment(X1)
    | selection_favors(first_movers,efficient_producers,end_time(X1))
    | in_environment(X1,critical_point(X1)) ) ).

cnf(mp_appearance_of_EP_37,axiom,
    ( greater(appear(efficient_producers,X0),X1)
    | greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ in_environment(X0,X1) ) ).

cnf(mp_critical_point_not_before_opening_31,axiom,
    ( greater(critical_point(X0),end_time(X0))
    | ~ environment(X0)
    | in_environment(X0,critical_point(X0)) ) ).

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

cnf(t3_39,hypothesis,
    ( ~ greater(critical_point(X0),X1)
    | selection_favors(first_movers,efficient_producers,X1)
    | ~ environment(X0)
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ in_environment(X0,critical_point(X0)) ) ).

cnf(mp_selection_favours_in_time_34,axiom,
    ( ~ greater(critical_point(X0),X1)
    | in_environment(X0,critical_point(X0))
    | selection_favors(first_movers,efficient_producers,end_time(X0))
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ environment(X0) ) ).

cnf(t2_38,hypothesis,
    ( ~ greater(appear(efficient_producers,X0),X1)
    | selection_favors(first_movers,efficient_producers,X1)
    | ~ greater_or_equal(X1,appear(first_movers,X0))
    | ~ environment(X0)
    | ~ in_environment(X0,X1) ) ).

cnf(mp_non_empty_means_organisations_32,axiom,
    ( empty(X0)
    | ~ environment(X0)
    | greater_or_equal(end_time(X0),appear(an_organisation,X0)) ) ).

cnf(mp6_not_extreme_change_means_not_empty_27,axiom,
    ( ~ empty(X1)
    | extreme(X0)
    | ~ observational_period(X0)
    | ~ environment(X1)
    | ~ in_environment(X0,X1) ) ).

cnf(u26,axiom,
    ( extreme(X0)
    | ~ environment(X1)
    | ~ in_environment(X0,X1)
    | greater_or_equal(end_time(X1),appear(an_organisation,X1))
    | ~ observational_period(X0) ) ).

cnf(prove_t9_43,negated_conjecture,
    ~ extreme(sk2) ).

cnf(prove_t9_42,negated_conjecture,
    rapid_change(sk2) ).

cnf(mp5_rapid_change_is_non_critical_26,axiom,
    ( ~ rapid_change(X0)
    | ~ in_environment(X1,critical_point(X1))
    | ~ observational_period(X0)
    | ~ environment(X1)
    | ~ in_environment(X0,X1) ) ).

cnf(u31,negated_conjecture,
    ( selection_favors(efficient_producers,first_movers,sk2)
    | environment(sk1(sk2)) ) ).

cnf(u38,negated_conjecture,
    ( selection_favors(efficient_producers,first_movers,sk2)
    | in_environment(sk2,sk1(sk2)) ) ).

cnf(u45,negated_conjecture,
    ( ~ selection_favors(efficient_producers,first_movers,end_time(sk1(sk2)))
    | selection_favors(efficient_producers,first_movers,sk2) ) ).

cnf(prove_t9_44,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sk2) ).

cnf(l13_40,hypothesis,
    ( ~ environment(X0)
    | appear(an_organisation,X0) = appear(first_movers,X0)
    | ~ in_environment(X0,appear(an_organisation,X0)) ) ).

cnf(mp_endpoint_in_environment_30,axiom,
    ( ~ environment(X0)
    | in_environment(X0,end_time(X0)) ) ).

cnf(u33,negated_conjecture,
    ( ~ environment(X0)
    | ~ in_environment(X0,critical_point(X0))
    | ~ in_environment(sk2,X0) ) ).

cnf(u42,negated_conjecture,
    ( ~ environment(X0)
    | in_environment(X0,appear(an_organisation,X0))
    | ~ in_environment(sk2,X0) ) ).

cnf(mp_organizational_sets2_29,axiom,
    propagation_strategy(efficient_producers) ).

cnf(mp_organizational_sets1_28,axiom,
    propagation_strategy(first_movers) ).

cnf(prove_t9_41,negated_conjecture,
    observational_period(sk2) ).

cnf(u30,axiom,
    ( ~ observational_period(X0)
    | selection_favors(efficient_producers,first_movers,X0)
    | environment(sk1(X0)) ) ).

cnf(u37,axiom,
    ( ~ observational_period(X0)
    | in_environment(X0,sk1(X0))
    | selection_favors(efficient_producers,first_movers,X0) ) ).

cnf(u44,axiom,
    ( ~ observational_period(X0)
    | selection_favors(efficient_producers,first_movers,X0)
    | ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X0))) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : MGT040-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n018.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:25:10 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.21/0.50  % (20890)lrs+10_1:1_kws=precedence:lwlo=on:tgt=ground:i=99966:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99966Mi)
% 0.21/0.51  % (20894)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/34Mi)
% 0.21/0.51  % (20896)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.51  % (20892)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=4:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.21/0.51  % (20894)Refutation not found, incomplete strategy% (20894)------------------------------
% 0.21/0.51  % (20894)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (20894)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (20894)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.51  
% 0.21/0.51  % (20894)Memory used [KB]: 5884
% 0.21/0.51  % (20894)Time elapsed: 0.106 s
% 0.21/0.51  % (20894)Instructions burned: 2 (million)
% 0.21/0.51  % (20894)------------------------------
% 0.21/0.51  % (20894)------------------------------
% 0.21/0.51  % (20896)First to succeed.
% 0.21/0.51  % SZS status Satisfiable for theBenchmark
% 0.21/0.51  % (20896)# SZS output start Saturation.
% See solution above
% 0.21/0.51  % (20896)------------------------------
% 0.21/0.51  % (20896)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (20896)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (20896)Termination reason: Satisfiable
% 0.21/0.51  
% 0.21/0.51  % (20896)Memory used [KB]: 1407
% 0.21/0.51  % (20896)Time elapsed: 0.113 s
% 0.21/0.51  % (20896)Instructions burned: 3 (million)
% 0.21/0.51  % (20896)------------------------------
% 0.21/0.51  % (20896)------------------------------
% 0.21/0.51  % (20889)Success in time 0.156 s
%------------------------------------------------------------------------------