↑ Up

Vampire-SAT---5.0.1.CSA-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.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n001.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   : CounterSatisfiable 0.17s 0.47s
% Output   : Saturation 0.17s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u102,negated_conjecture,
    greater(cardinality_at_time(efficient_producers,sK0(sK2,sK3)),zero) ).

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

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

cnf(u112,negated_conjecture,
    greater(zero,growth_rate(first_movers,sK0(sK2,sK3))) ).

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

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

cnf(u90,negated_conjecture,
    in_environment(sK2,sK0(sK2,sK3)) ).

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

cnf(u73,negated_conjecture,
    in_environment(sK2,sK3) ).

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

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

cnf(u108,negated_conjecture,
    ( ~ in_environment(X0,sK0(X1,sK3))
    | greater(zero,growth_rate(first_movers,sK0(X1,sK3)))
    | ~ environment(X0)
    | ~ greater_or_equal(sK3,appear(efficient_producers,X1))
    | ~ environment(X1) ) ).

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

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

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

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

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

cnf(u105,negated_conjecture,
    ( greater(sK0(X0,sK3),appear(efficient_producers,X0))
    | ~ greater_or_equal(sK3,appear(efficient_producers,X0))
    | ~ environment(X0) ) ).

cnf(u72,negated_conjecture,
    greater_or_equal(sK3,appear(efficient_producers,sK2)) ).

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

cnf(u84,negated_conjecture,
    ( ~ greater_or_equal(sK3,appear(efficient_producers,X0))
    | ~ environment(X0)
    | greater(sK3,sK0(X0,sK3)) ) ).

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

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

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

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

cnf(u75,negated_conjecture,
    ~ greater(cardinality_at_time(efficient_producers,sK3),zero) ).

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

cnf(u86,negated_conjecture,
    ( ~ greater_or_equal(sK3,appear(efficient_producers,X0))
    | ~ environment(X0)
    | in_environment(X0,sK0(X0,sK3)) ) ).

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

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

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

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

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

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

cnf(u74,negated_conjecture,
    environment(sK2) ).

cnf(u56,axiom,
    ( subpopulation(sK1(X0,X1),X0,X1)
    | ~ environment(X0)
    | ~ in_environment(X0,X1)
    | decreases(number_of_organizations(X0,X1)) ) ).

cnf(u88,negated_conjecture,
    greater(sK3,sK0(sK2,sK3)) ).

cnf(u81,negated_conjecture,
    ~ greater(zero,growth_rate(efficient_producers,sK3)) ).

cnf(u92,negated_conjecture,
    ( greater(zero,growth_rate(efficient_producers,sK0(X0,sK3)))
    | ~ greater_or_equal(sK3,appear(efficient_producers,X0))
    | ~ environment(X0) ) ).

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

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

cnf(u78,negated_conjecture,
    zero = cardinality_at_time(efficient_producers,sK3) ).


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