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

% Computer : n008.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:31 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u27,negated_conjecture,
    greater(sk5(sk3(sk4)),sk3(sk4)) ).

cnf(u37,negated_conjecture,
    founding_rate(efficient_producers,sk5(sk3(sk4))) = founding_rate(first_movers,sk5(sk3(sk4))) ).

cnf(u29,negated_conjecture,
    ( ~ in_environment(sk4,X0)
    | greater_or_equal(founding_rate(efficient_producers,sk5(X0)),founding_rate(first_movers,sk5(X0)))
    | ~ greater_or_equal(sk5(X0),sk3(sk4)) ) ).

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

cnf(u15,negated_conjecture,
    ~ greater(growth_rate(efficient_producers,sk5(sk3(sk4))),growth_rate(first_movers,sk5(sk3(sk4)))) ).

cnf(prove_l1_31,negated_conjecture,
    ( subpopulations(first_movers,efficient_producers,sk4,sk5(X0))
    | ~ in_environment(sk4,X0) ) ).

cnf(mp_EP_lower_disbanding_rate_25,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(l2_24,axiom,
    ~ greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)) ).

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

cnf(u16,negated_conjecture,
    greater_or_equal(sk5(sk3(sk4)),sk3(sk4)) ).

cnf(a8_28,hypothesis,
    ( ~ stable(X0)
    | ~ environment(X0)
    | ~ subpopulations(first_movers,efficient_producers,X0,X1)
    | ~ greater_or_equal(X1,sk3(X0))
    | greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1)) ) ).

cnf(u31,negated_conjecture,
    greater_or_equal(founding_rate(efficient_producers,sk5(sk3(sk4))),founding_rate(first_movers,sk5(sk3(sk4)))) ).

cnf(l2_23,axiom,
    subpopulations(first_movers,efficient_producers,sk1,sk2) ).

cnf(prove_l1_30,negated_conjecture,
    stable(sk4) ).

cnf(u44,negated_conjecture,
    greater_or_equal(founding_rate(first_movers,sk5(sk3(sk4))),founding_rate(first_movers,sk5(sk3(sk4)))) ).

cnf(u43,negated_conjecture,
    ~ greater(disbanding_rate(first_movers,sk5(sk3(sk4))),disbanding_rate(efficient_producers,sk5(sk3(sk4)))) ).

cnf(a8_27,hypothesis,
    ( ~ stable(X0)
    | ~ environment(X0)
    | in_environment(X0,sk3(X0)) ) ).

cnf(prove_l1_29,negated_conjecture,
    environment(sk4) ).

cnf(u18,negated_conjecture,
    ( ~ subpopulations(first_movers,efficient_producers,sk4,X0)
    | ~ greater_or_equal(X0,sk3(sk4))
    | greater_or_equal(founding_rate(efficient_producers,X0),founding_rate(first_movers,X0)) ) ).

cnf(l2_22,axiom,
    environment(sk1) ).

cnf(prove_l1_33,negated_conjecture,
    ( ~ in_environment(sk4,X0)
    | ~ greater(growth_rate(efficient_producers,sk5(X0)),growth_rate(first_movers,sk5(X0))) ) ).

cnf(prove_l1_32,negated_conjecture,
    ( ~ in_environment(sk4,X0)
    | greater_or_equal(sk5(X0),X0) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT019-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n008.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:17:24 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  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.11/0.45  % (1477899)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (1477913)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2688172374:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45  % (1477913) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1477899-1477913"...
% 0.11/0.45  % (1477913)...printing done.
% 0.11/0.45  % (1477910)% WARNING: option uhcvi not known.
% 0.11/0.45  % SZS status Satisfiable for theBenchmark
% 0.11/0.45  % SZS output start Saturation.
% See solution above
% 0.11/0.45  % SZS output start Definitions and Model Updates.
% 0.11/0.45  % SZS output end Definitions and Model Updates.
% 0.11/0.45  % (1477913)------------------------------
% 0.11/0.45  % (1477913)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (1477913)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (1477913)CaDiCaL version: 2.1.3
% 0.11/0.45  % (1477913)Termination reason: Satisfiable
% 0.11/0.45  % (1477913)Time elapsed: 0.001 s
% 0.11/0.45  % (1477913)Peak memory usage: 11 MB
% 0.11/0.45  % (1477913)Instructions burned: 1 (million)
% 0.11/0.45  % (1477899)Success in time 0.033 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------