↑ Up

Vampire-SAT---5.0.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : MGT037-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:02:38 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u50,negated_conjecture,
    greater(cardinality_at_time(efficient_producers,sk1(sk4,sk3)),zero) ).

cnf(u53,negated_conjecture,
    zero != cardinality_at_time(efficient_producers,sk1(sk4,sk3)) ).

cnf(mp_previous_negative_growth_30,axiom,
    ( cardinality_at_time(efficient_producers,X1) != zero
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ environment(X0)
    | greater(X1,sk1(X1,X0)) ) ).

cnf(u40,negated_conjecture,
    ( ~ greater_or_equal(sk4,appear(efficient_producers,X0))
    | ~ environment(X0)
    | in_environment(X0,sk1(sk4,X0)) ) ).

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

cnf(u42,negated_conjecture,
    ( ~ greater_or_equal(sk4,appear(efficient_producers,X0))
    | ~ environment(X0)
    | greater(sk4,sk1(sk4,X0)) ) ).

cnf(u79,hypothesis,
    ( decreases(number_of_organizations(X0,X1))
    | efficient_producers = sk2(X1,X0)
    | sk2(X1,X0) = first_movers
    | ~ in_environment(X0,X1)
    | ~ environment(X0) ) ).

cnf(u34,negated_conjecture,
    zero = cardinality_at_time(efficient_producers,sk4) ).

cnf(mp_non_decreasing_33,axiom,
    ( subpopulation(sk2(X1,X0),X0,X1)
    | ~ in_environment(X0,X1)
    | decreases(number_of_organizations(X0,X1))
    | ~ environment(X0) ) ).

cnf(u44,negated_conjecture,
    in_environment(sk3,sk1(sk4,sk3)) ).

cnf(u38,hypothesis,
    ( ~ subpopulation(sk2(X0,X1),X2,X0)
    | ~ environment(X2)
    | efficient_producers = sk2(X0,X1)
    | first_movers = sk2(X0,X1)
    | ~ in_environment(X1,X0)
    | decreases(number_of_organizations(X1,X0))
    | ~ environment(X1) ) ).

cnf(u74,negated_conjecture,
    ( ~ in_environment(X1,sk1(sk4,X0))
    | ~ greater_or_equal(sk4,appear(efficient_producers,X0))
    | greater(zero,growth_rate(first_movers,sk1(sk4,X0)))
    | ~ environment(X1)
    | ~ environment(X0) ) ).

cnf(u84,negated_conjecture,
    greater(zero,growth_rate(first_movers,sk1(sk4,sk3))) ).

cnf(a7_48,hypothesis,
    ( ~ constant(resources(X0,X1))
    | ~ in_environment(X0,X1)
    | ~ environment(X0)
    | constant(number_of_organizations(X0,X1)) ) ).

cnf(u65,negated_conjecture,
    ( greater(sk1(sk4,X0),appear(efficient_producers,X0))
    | ~ environment(X0)
    | ~ greater_or_equal(sk4,appear(efficient_producers,X0)) ) ).

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

cnf(mp_environment_inequality_42,axiom,
    ( ~ greater_or_equal(X1,appear(an_organisation,X0))
    | ~ in_environment(X0,X1)
    | ~ environment(X0)
    | greater(appear(an_organisation,X0),X1) ) ).

cnf(prove_t6_51,negated_conjecture,
    environment(sk3) ).

cnf(prove_t6_53,negated_conjecture,
    greater_or_equal(sk4,appear(efficient_producers,sk3)) ).

cnf(a4_46,hypothesis,
    ( ~ greater(number_of_organizations(X0,X1),zero)
    | ~ in_environment(X0,X1)
    | ~ environment(X0)
    | greater(equilibrium(X0),X1)
    | constant(resources(X0,X1)) ) ).

cnf(mp_efficient_producers_exist_40,axiom,
    ( ~ in_environment(X0,X1)
    | ~ environment(X0)
    | cardinality_at_time(efficient_producers,X1) = zero
    | greater(cardinality_at_time(efficient_producers,X1),zero) ) ).

cnf(mp_non_decreasing_34,axiom,
    ( greater(cardinality_at_time(sk2(X1,X0),X1),zero)
    | ~ in_environment(X0,X1)
    | decreases(number_of_organizations(X0,X1))
    | ~ environment(X0) ) ).

cnf(a2_44,hypothesis,
    greater(resilience(efficient_producers),resilience(first_movers)) ).

cnf(mp_previous_negative_growth_29,axiom,
    ( cardinality_at_time(efficient_producers,X1) != zero
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ environment(X0)
    | in_environment(X0,sk1(X1,X0)) ) ).

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

cnf(u6,axiom,
    ( ~ greater(appear(an_organisation,X0),X1)
    | ~ in_environment(X0,X1)
    | ~ environment(X0)
    | zero = number_of_organizations(X0,X1) ) ).

cnf(u72,hypothesis,
    ( ~ greater(zero,growth_rate(efficient_producers,X1))
    | greater(zero,growth_rate(first_movers,X1))
    | ~ environment(X0)
    | ~ in_environment(X0,X1) ) ).

cnf(prove_t6_52,negated_conjecture,
    in_environment(sk3,sk4) ).

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

cnf(mp_previous_negative_growth_31,axiom,
    ( cardinality_at_time(efficient_producers,X1) != zero
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ environment(X0)
    | greater(zero,growth_rate(efficient_producers,sk1(X1,X0))) ) ).

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

cnf(u37,negated_conjecture,
    ~ greater(zero,growth_rate(efficient_producers,sk4)) ).

cnf(prove_t6_54,negated_conjecture,
    ~ greater(cardinality_at_time(efficient_producers,sk4),zero) ).

cnf(a13_50,hypothesis,
    ( ~ greater(resilience(X3),resilience(X2))
    | ~ in_environment(X0,X1)
    | greater(zero,growth_rate(X2,X1))
    | ~ environment(X0)
    | ~ greater(zero,growth_rate(X3,X1)) ) ).

cnf(mp_constant_not_decrease_41,axiom,
    ( ~ constant(X0)
    | ~ decreases(X0) ) ).

cnf(u69,negated_conjecture,
    ( greater(zero,growth_rate(efficient_producers,sk1(sk4,X0)))
    | ~ environment(X0)
    | ~ greater_or_equal(sk4,appear(efficient_producers,X0)) ) ).

cnf(u71,negated_conjecture,
    greater(sk4,sk1(sk4,sk3)) ).

cnf(a4_45,hypothesis,
    ( ~ greater(number_of_organizations(X0,X1),zero)
    | ~ in_environment(X0,X1)
    | ~ environment(X0)
    | ~ greater(equilibrium(X0),X1)
    | decreases(resources(X0,X1)) ) ).

cnf(a7_47,hypothesis,
    ( ~ decreases(resources(X0,X1))
    | ~ in_environment(X0,X1)
    | ~ environment(X0)
    | ~ decreases(number_of_organizations(X0,X1)) ) ).

cnf(u15,axiom,
    ( zero != cardinality_at_time(X0,X1)
    | ~ greater(zero,growth_rate(X0,X1)) ) ).

cnf(mp_non_decreasing_35,axiom,
    ( ~ greater(zero,growth_rate(sk2(X1,X0),X1))
    | ~ in_environment(X0,X1)
    | decreases(number_of_organizations(X0,X1))
    | ~ environment(X0) ) ).

cnf(u11,axiom,
    ( zero != number_of_organizations(X0,X1)
    | ~ in_environment(X0,X1)
    | ~ environment(X0)
    | ~ subpopulation(X2,X0,X1)
    | zero = cardinality_at_time(X2,X1) ) ).

cnf(mp_previous_negative_growth_28,axiom,
    ( cardinality_at_time(efficient_producers,X1) != zero
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ environment(X0)
    | greater(sk1(X1,X0),appear(efficient_producers,X0)) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT037-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n019.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 17:23:34 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.46  % (3289196)Will run a generic schedule for satisfiability detection.
% 0.11/0.46  % (3289205)dis+10_1_sil=32000:sp=arity:random_seed=42568980:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46  % (3289205) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3289196-3289205"...
% 0.11/0.46  % (3289203)% WARNING: option uhcvi not known.
% 0.11/0.46  % (3289205)...printing done.
% 0.11/0.46  % SZS status Satisfiable for theBenchmark
% 0.11/0.46  % SZS output start Saturation.
% See solution above
% 0.11/0.46  % SZS output start Definitions and Model Updates.
% 0.11/0.46  % SZS output end Definitions and Model Updates.
% 0.11/0.46  % (3289205)------------------------------
% 0.11/0.46  % (3289205)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46  % (3289205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46  % (3289205)CaDiCaL version: 2.1.3
% 0.11/0.46  % (3289205)Termination reason: Satisfiable
% 0.11/0.46  % (3289205)Time elapsed: 0.002 s
% 0.11/0.46  % (3289205)Peak memory usage: 11 MB
% 0.11/0.46  % (3289205)Instructions burned: 4 (million)
% 0.11/0.46  % (3289196)Success in time 0.032 s
% 0.11/0.46  % Vampire exiting
%------------------------------------------------------------------------------