↑ 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  : MGT019+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n014.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:30 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u47,negated_conjecture,
    sK2(sK3) = sK4(sK2(sK3)) ).

cnf(u62,negated_conjecture,
    greater(founding_rate(efficient_producers,sK2(sK3)),founding_rate(first_movers,sK2(sK3))) ).

cnf(u35,negated_conjecture,
    subpopulations(first_movers,efficient_producers,sK3,sK4(sK2(sK3))) ).

cnf(u22,axiom,
    ~ greater(disbanding_rate(first_movers,sK1),disbanding_rate(efficient_producers,sK1)) ).

cnf(u29,negated_conjecture,
    ( ~ in_environment(sK3,X1)
    | greater_or_equal(sK4(X1),X1) ) ).

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

cnf(u34,negated_conjecture,
    ~ greater(growth_rate(efficient_producers,sK4(sK2(sK3))),growth_rate(first_movers,sK4(sK2(sK3)))) ).

cnf(u52,negated_conjecture,
    greater_or_equal(founding_rate(efficient_producers,sK2(sK3)),founding_rate(first_movers,sK2(sK3))) ).

cnf(u28,negated_conjecture,
    environment(sK3) ).

cnf(u27,negated_conjecture,
    stable(sK3) ).

cnf(u38,negated_conjecture,
    ( ~ greater_or_equal(X0,sK2(sK3))
    | ~ subpopulations(first_movers,efficient_producers,sK3,X0)
    | greater_or_equal(founding_rate(efficient_producers,X0),founding_rate(first_movers,X0)) ) ).

cnf(u21,axiom,
    environment(sK0) ).

cnf(u55,negated_conjecture,
    subpopulations(first_movers,efficient_producers,sK3,sK2(sK3)) ).

cnf(u31,negated_conjecture,
    ( ~ in_environment(sK3,X1)
    | ~ greater(growth_rate(efficient_producers,sK4(X1)),growth_rate(first_movers,sK4(X1))) ) ).

cnf(u26,hypothesis,
    ( ~ stable(X0)
    | ~ environment(X0)
    | in_environment(X0,sK2(X0)) ) ).

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

cnf(u20,axiom,
    subpopulations(first_movers,efficient_producers,sK0,sK1) ).

cnf(u30,negated_conjecture,
    ( ~ in_environment(sK3,X1)
    | subpopulations(first_movers,efficient_producers,sK3,sK4(X1)) ) ).

cnf(u68,negated_conjecture,
    ~ greater(disbanding_rate(first_movers,sK2(sK3)),disbanding_rate(efficient_producers,sK2(sK3))) ).

cnf(u23,axiom,
    ( ~ greater_or_equal(founding_rate(efficient_producers,X0),founding_rate(first_movers,X0))
    | ~ greater(disbanding_rate(first_movers,X0),disbanding_rate(efficient_producers,X0))
    | greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ) ).

cnf(u56,negated_conjecture,
    ~ greater(growth_rate(efficient_producers,sK2(sK3)),growth_rate(first_movers,sK2(sK3))) ).

cnf(u49,negated_conjecture,
    greater_or_equal(sK2(sK3),sK2(sK3)) ).

cnf(u25,hypothesis,
    ( ~ stable(X0)
    | ~ subpopulations(first_movers,efficient_producers,X0,X2)
    | ~ greater_or_equal(X2,sK2(X0))
    | ~ environment(X0)
    | greater_or_equal(founding_rate(efficient_producers,X2),founding_rate(first_movers,X2)) ) ).

cnf(u36,negated_conjecture,
    greater_or_equal(sK4(sK2(sK3)),sK2(sK3)) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT019+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36  % Computer : n014.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 27 17:16:31 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  Running first-order model finding
% 0.11/0.39  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.43  % (1035868)Will run a generic schedule for satisfiability detection.
% 0.11/0.43  % (1035878)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2607205594:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.43  % (1035878) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1035868-1035878"...
% 0.11/0.43  % (1035878)...printing done.
% 0.11/0.43  % SZS status CounterSatisfiable for theBenchmark
% 0.11/0.43  % SZS output start Saturation.
% See solution above
% 0.11/0.43  % SZS output start Definitions and Model Updates.
% 0.11/0.43  % SZS output end Definitions and Model Updates.
% 0.11/0.43  % (1035878)------------------------------
% 0.11/0.43  % (1035878)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.43  % (1035878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.43  % (1035878)CaDiCaL version: 2.1.3
% 0.11/0.43  % (1035878)Termination reason: Satisfiable
% 0.11/0.43  % (1035878)Time elapsed: 0.001 s
% 0.11/0.43  % (1035878)Peak memory usage: 11 MB
% 0.11/0.43  % (1035878)Instructions burned: 2 (million)
% 0.11/0.43  % (1035868)Success in time 0.03 s
% 0.11/0.43  % Vampire exiting
%------------------------------------------------------------------------------