%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : MGT033-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_sat --cores 0 -t %d %s

% Computer : n024.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:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u32,negated_conjecture,
    in_environment(sk2,appear(an_organisation,sk2)) ).

cnf(u35,negated_conjecture,
    in_environment(sk2,sF0) ).

cnf(u49,negated_conjecture,
    ~ greater(sF0,start_time(sk2)) ).

cnf(u58,negated_conjecture,
    ~ greater(sF0,sk3) ).

cnf(u75,negated_conjecture,
    ~ greater(sF1,start_time(sk2)) ).

cnf(u98,negated_conjecture,
    ~ greater(sF1,sF0) ).

cnf(u111,negated_conjecture,
    ~ greater(sF0,sF0) ).

cnf(u123,negated_conjecture,
    ~ greater(sF0,appear(an_organisation,sk2)) ).

cnf(u149,negated_conjecture,
    greater(zero,zero) ).

cnf(u157,negated_conjecture,
    selection_favors(efficient_producers,efficient_producers,sk3) ).

cnf(u168,negated_conjecture,
    efficient_producers = sk1(sk3,sk2) ).

cnf(u171,negated_conjecture,
    first_movers != sk1(sk3,sk2) ).

cnf(u180,negated_conjecture,
    subpopulation(efficient_producers,sk2,sk3) ).

cnf(u183,negated_conjecture,
    greater(number_of_organizations(sk2,sk3),zero) ).

cnf(u26,negated_conjecture,
    greater_or_equal(sF0,start_time(sk2)) ).

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

cnf(u22,negated_conjecture,
    greater_or_equal(sk3,sF0) ).

cnf(u162,negated_conjecture,
    ( ~ greater_or_equal(X0,sF0)
    | first_movers = sk1(X0,sk2)
    | ~ in_environment(sk2,X0)
    | efficient_producers = sk1(X0,sk2) ) ).

cnf(u78,negated_conjecture,
    ( ~ greater_or_equal(X1,sk3)
    | ~ in_environment(X0,sF0)
    | ~ in_environment(X0,X1)
    | ~ environment(X0)
    | in_environment(X0,sk3) ) ).

cnf(u79,axiom,
    ( ~ greater_or_equal(X4,appear(first_movers,X3))
    | ~ environment(X2)
    | ~ in_environment(X2,X4)
    | ~ environment(X3)
    | in_environment(X2,appear(first_movers,X3))
    | ~ in_environment(X2,start_time(X3)) ) ).

cnf(a1_36,hypothesis,
    ( ~ greater_or_equal(X1,appear(an_organisation,X0))
    | greater(number_of_organizations(X0,X1),zero)
    | ~ environment(X0)
    | ~ in_environment(X0,X1) ) ).

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

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

cnf(prove_t2_40,negated_conjecture,
    in_environment(sk2,sk3) ).

cnf(u40,negated_conjecture,
    ( ~ in_environment(sk2,X0)
    | ~ greater(sF0,X0)
    | zero = cardinality_at_time(first_movers,X0) ) ).

cnf(u41,negated_conjecture,
    ( ~ in_environment(sk2,X1)
    | zero = cardinality_at_time(efficient_producers,X1)
    | ~ greater(sF1,X1) ) ).

cnf(u133,negated_conjecture,
    ( ~ in_environment(sk2,X1)
    | ~ greater(sF0,X1)
    | zero = cardinality_at_time(an_organisation,X1) ) ).

cnf(u80,negated_conjecture,
    ( ~ in_environment(X5,start_time(sk2))
    | ~ environment(X5)
    | ~ greater_or_equal(X6,sF0)
    | ~ in_environment(X5,X6)
    | in_environment(X5,sF0) ) ).

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

cnf(mp_FM_means_organisations_35,axiom,
    ( ~ in_environment(X0,appear(first_movers,X0))
    | ~ environment(X0)
    | in_environment(X0,appear(an_organisation,X0)) ) ).

cnf(u228,negated_conjecture,
    ( selection_favors(sk1(sk3,X0),efficient_producers,sk3)
    | ~ environment(X0)
    | ~ subpopulation(efficient_producers,X0,sk3)
    | ~ greater(number_of_organizations(X0,sk3),zero) ) ).

cnf(prove_t2_43,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sk3) ).

cnf(u24,negated_conjecture,
    greater(sF1,sk3) ).

cnf(u134,negated_conjecture,
    ( greater(number_of_organizations(sk2,X0),zero)
    | ~ in_environment(sk2,X0)
    | ~ greater_or_equal(X0,sF0) ) ).

cnf(mp_positive_sum_means_members_27,axiom,
    ( greater(cardinality_at_time(sk1(X1,X0),X1),zero)
    | ~ environment(X0)
    | ~ greater(number_of_organizations(X0,X1),zero) ) ).

cnf(mp_positive_and_sustains_29,axiom,
    ( ~ greater(number_of_organizations(X0,X1),zero)
    | ~ environment(X0)
    | in_environment(X0,X1) ) ).

cnf(u160,hypothesis,
    ( ~ greater(number_of_organizations(X1,X0),zero)
    | first_movers = sk1(X0,X1)
    | ~ environment(X1)
    | efficient_producers = sk1(X0,X1) ) ).

cnf(mp_not_present_before_appearance_25,axiom,
    ( ~ greater(appear(X2,X0),X1)
    | ~ environment(X0)
    | ~ in_environment(X0,X1)
    | zero = cardinality_at_time(X2,X1) ) ).

cnf(u143,negated_conjecture,
    ( ~ greater(cardinality_at_time(X0,sk3),zero)
    | ~ subpopulation(X0,X1,sk3)
    | ~ subpopulation(efficient_producers,X1,sk3)
    | ~ environment(X1)
    | selection_favors(X0,efficient_producers,sk3) ) ).

cnf(a9_37,hypothesis,
    ( ~ greater(cardinality_at_time(X1,X2),zero)
    | first_movers = X1
    | ~ environment(X0)
    | ~ subpopulation(X1,X0,X2)
    | efficient_producers = X1 ) ).

cnf(mp_positive_sum_means_members_26,axiom,
    ( subpopulation(sk1(X1,X0),X0,X1)
    | ~ greater(number_of_organizations(X0,X1),zero)
    | ~ environment(X0) ) ).

cnf(mp_subpopulations_34,axiom,
    ( subpopulation(efficient_producers,X0,X1)
    | ~ in_environment(X0,X1)
    | ~ environment(X0) ) ).

cnf(mp_subpopulations_33,axiom,
    ( subpopulation(first_movers,X0,X1)
    | ~ in_environment(X0,X1)
    | ~ environment(X0) ) ).

cnf(u144,negated_conjecture,
    ( ~ subpopulation(sk1(sk3,X1),X0,sk3)
    | selection_favors(sk1(sk3,X1),efficient_producers,sk3)
    | ~ environment(X0)
    | ~ greater(number_of_organizations(X1,sk3),zero)
    | ~ environment(X1)
    | ~ subpopulation(efficient_producers,X0,sk3) ) ).

cnf(prove_t2_39,negated_conjecture,
    environment(sk2) ).

cnf(u126,negated_conjecture,
    sF0 = appear(an_organisation,sk2) ).

cnf(u23,axiom,
    appear(efficient_producers,sk2) = sF1 ).

cnf(u21,axiom,
    appear(first_movers,sk2) = sF0 ).

cnf(u66,negated_conjecture,
    zero = cardinality_at_time(efficient_producers,sk3) ).

cnf(u217,negated_conjecture,
    first_movers != efficient_producers ).

cnf(mp2_favour_members_24,axiom,
    ( zero != cardinality_at_time(X3,X2)
    | ~ greater(cardinality_at_time(X1,X2),zero)
    | selection_favors(X1,X3,X2)
    | ~ subpopulation(X1,X0,X2)
    | ~ subpopulation(X3,X0,X2)
    | ~ environment(X0) ) ).

cnf(mp_zero_is_not_positive_28,axiom,
    ( zero != cardinality_at_time(X0,t)
    | ~ greater(cardinality_at_time(X0,X1),zero) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : MGT033-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/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.33  % Computer : n024.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   : Tue Aug 30 03:18:34 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.49  % (761)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.20/0.49  % (773)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.49  % (784)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.49  % (774)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.20/0.50  % (774)First to succeed.
% 0.20/0.50  % (772)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50  % SZS status Satisfiable for theBenchmark
% 0.20/0.50  % (774)# SZS output start Saturation.
% See solution above
% 0.20/0.50  % (774)------------------------------
% 0.20/0.50  % (774)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (774)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (774)Termination reason: Satisfiable
% 0.20/0.50  
% 0.20/0.50  % (774)Memory used [KB]: 5628
% 0.20/0.50  % (774)Time elapsed: 0.100 s
% 0.20/0.50  % (774)Instructions burned: 6 (million)
% 0.20/0.50  % (774)------------------------------
% 0.20/0.50  % (774)------------------------------
% 0.20/0.50  % (758)Success in time 0.158 s
%------------------------------------------------------------------------------