↑ 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  : MGT038-1 : 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 : n018.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:39 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u17,negated_conjecture,
    zero != cardinality_at_time(first_movers,to) ).

cnf(u25,axiom,
    cardinality_at_time(s,t2) = zero ).

cnf(u46,negated_conjecture,
    ~ in_environment(sk3,sk2(sk3)) ).

cnf(u51,negated_conjecture,
    ~ in_environment(sk3,appear(efficient_producers,sk3)) ).

cnf(u35,negated_conjecture,
    ( ~ greater(appear(first_movers,sk3),X0)
    | greater(appear(efficient_producers,e),X0) ) ).

cnf(mp_long_stable_environments_21,axiom,
    ( ~ stable(X0)
    | ~ environment(X0)
    | ~ in_environment(X0,X1)
    | ~ greater(X2,X1)
    | in_environment(X0,X2) ) ).

cnf(u53,negated_conjecture,
    in_environment(sk3,appear(efficient_producers,e)) ).

cnf(u39,axiom,
    ( ~ contracts_from(X0,first_movers)
    | greater(sk1(X0,first_movers),X0) ) ).

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

cnf(u34,negated_conjecture,
    in_environment(sk3,appear(first_movers,sk3)) ).

cnf(u41,negated_conjecture,
    ( ~ greater(X1,X0)
    | ~ in_environment(sk3,X0)
    | in_environment(sk3,X1) ) ).

cnf(mp_contracting_time_19,axiom,
    ( ~ finite_set(X0)
    | ~ contracts_from(X1,X0)
    | greater(sk1(X1,X0),X1) ) ).

cnf(u62,negated_conjecture,
    greater(sk1(sk2(sk3),first_movers),appear(efficient_producers,sk3)) ).

cnf(u38,negated_conjecture,
    ( ~ greater(appear(efficient_producers,sk3),X0)
    | greater(sk2(sk3),X0) ) ).

cnf(l9_23,hypothesis,
    ( ~ stable(X0)
    | ~ environment(X0)
    | greater(sk2(X0),appear(efficient_producers,X0)) ) ).

cnf(u31,negated_conjecture,
    contracts_from(sk2(sk3),first_movers) ).

cnf(mp_stable_first_movers_18,axiom,
    ( ~ stable(X0)
    | ~ environment(X0)
    | in_environment(X0,appear(first_movers,X0)) ) ).

cnf(a13_25,hypothesis,
    ( ~ environment(X0)
    | greater(appear(efficient_producers,e),appear(first_movers,X0)) ) ).

cnf(mp_greater_transitivity_22,axiom,
    ( ~ greater(X0,X1)
    | ~ greater(X1,X2)
    | greater(X0,X2) ) ).

cnf(u64,negated_conjecture,
    ( ~ greater(appear(efficient_producers,sk3),X0)
    | greater(sk1(sk2(sk3),first_movers),X0) ) ).

cnf(u54,negated_conjecture,
    greater(sk1(sk2(sk3),first_movers),sk2(sk3)) ).

cnf(u37,negated_conjecture,
    greater(sk2(sk3),appear(efficient_producers,sk3)) ).

cnf(u32,negated_conjecture,
    greater(appear(efficient_producers,e),appear(first_movers,sk3)) ).

cnf(l9_24,hypothesis,
    ( ~ stable(X0)
    | ~ environment(X0)
    | contracts_from(sk2(X0),first_movers) ) ).

cnf(u56,negated_conjecture,
    ( ~ greater(sk2(sk3),X0)
    | greater(sk1(sk2(sk3),first_movers),X0) ) ).

cnf(mp7_first_movers_exist_17,axiom,
    finite_set(first_movers) ).

cnf(prove_t7_27,negated_conjecture,
    stable(sk3) ).


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