↑ 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  : MGT040-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 : 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:40 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u31,negated_conjecture,
    selection_favors(efficient_producers,first_movers,sk2) ).

cnf(u34,negated_conjecture,
    ~ environment(sk1(sk2)) ).

cnf(u41,negated_conjecture,
    ~ greater_or_equal(end_time(sk1(sk2)),appear(an_organisation,sk1(sk2))) ).

cnf(u52,negated_conjecture,
    in_environment(sk2,sk1(sk2)) ).

cnf(u80,negated_conjecture,
    ~ greater_or_equal(sk1(sk2),appear(efficient_producers,sk2)) ).

cnf(u85,negated_conjecture,
    greater(appear(efficient_producers,sk2),sk1(sk2)) ).

cnf(prove_t9_39,negated_conjecture,
    observational_period(sk2) ).

cnf(mp6_not_extreme_change_means_not_empty_27,axiom,
    ( ~ empty(X1)
    | extreme(X0)
    | ~ environment(X1)
    | ~ in_environment(X0,X1)
    | ~ observational_period(X0) ) ).

cnf(u66,negated_conjecture,
    ( ~ environment(X0)
    | ~ in_environment(sk2,X0)
    | ~ in_environment(X0,critical_point(X0)) ) ).

cnf(u24,axiom,
    ( ~ observational_period(X0)
    | ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X0)))
    | selection_favors(efficient_producers,first_movers,X0) ) ).

cnf(mp5_rapid_change_is_non_critical_26,axiom,
    ( ~ rapid_change(X0)
    | ~ observational_period(X0)
    | ~ environment(X1)
    | ~ in_environment(X0,X1)
    | ~ in_environment(X1,critical_point(X1)) ) ).

cnf(mp_non_empty_means_organisations_32,axiom,
    ( ~ environment(X0)
    | empty(X0)
    | greater_or_equal(end_time(X0),appear(an_organisation,X0)) ) ).

cnf(mp_appearance_of_EP_36,axiom,
    ( ~ in_environment(X0,X1)
    | greater(appear(efficient_producers,X0),X1)
    | greater_or_equal(X1,appear(efficient_producers,X0)) ) ).

cnf(t3_38,hypothesis,
    ( ~ environment(X0)
    | ~ in_environment(X0,critical_point(X0))
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ greater(critical_point(X0),X1)
    | selection_favors(first_movers,efficient_producers,X1) ) ).

cnf(mp_organizational_sets2_29,axiom,
    propagation_strategy(efficient_producers) ).

cnf(u26,axiom,
    ( ~ observational_period(X0)
    | environment(sk1(X0))
    | selection_favors(efficient_producers,first_movers,X0) ) ).

cnf(mp_critical_point_not_before_opening_31,axiom,
    ( ~ environment(X0)
    | in_environment(X0,critical_point(X0))
    | greater(critical_point(X0),end_time(X0)) ) ).

cnf(prove_t9_42,negated_conjecture,
    ~ selection_favors(first_movers,efficient_producers,sk2) ).

cnf(prove_t9_41,negated_conjecture,
    ~ extreme(sk2) ).

cnf(mp_organizational_sets1_28,axiom,
    propagation_strategy(first_movers) ).

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

cnf(mp_endpoint_in_environment_30,axiom,
    ( ~ environment(X0)
    | in_environment(X0,end_time(X0)) ) ).

cnf(prove_t9_40,negated_conjecture,
    rapid_change(sk2) ).

cnf(u25,axiom,
    ( ~ observational_period(X0)
    | in_environment(X0,sk1(X0))
    | selection_favors(efficient_producers,first_movers,X0) ) ).

cnf(t2_37,hypothesis,
    ( ~ environment(X0)
    | ~ in_environment(X0,X1)
    | ~ greater_or_equal(X1,appear(first_movers,X0))
    | ~ greater(appear(efficient_producers,X0),X1)
    | selection_favors(first_movers,efficient_producers,X1) ) ).

cnf(mp_selection_favours_in_time_34,axiom,
    ( ~ environment(X0)
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ greater(critical_point(X0),X1)
    | ~ selection_favors(first_movers,efficient_producers,X1)
    | in_environment(X0,critical_point(X0))
    | selection_favors(first_movers,efficient_producers,end_time(X0)) ) ).

cnf(mp_selection_favours_in_time_33,axiom,
    ( ~ environment(X0)
    | ~ greater_or_equal(X1,appear(efficient_producers,X0))
    | ~ greater(critical_point(X0),X1)
    | in_environment(X0,critical_point(X0))
    | selection_favors(first_movers,efficient_producers,end_time(X0)) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT040-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 : 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:24:49 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  % (3292086)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (3292096)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1277598631:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45  % (3292096) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3292086-3292096"...
% 0.11/0.45  % (3292096)...printing done.
% 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  % (3292096)------------------------------
% 0.11/0.45  % (3292096)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (3292096)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (3292096)CaDiCaL version: 2.1.3
% 0.11/0.45  % (3292096)Termination reason: Satisfiable
% 0.11/0.45  % (3292096)Time elapsed: 0.001 s
% 0.11/0.45  % (3292096)Peak memory usage: 11 MB
% 0.11/0.45  % (3292096)Instructions burned: 2 (million)
% 0.11/0.45  % (3292086)Success in time 0.03 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------