↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : MGT032-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 : 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:35 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.44s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   21 (   5 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   81 (  45   ~;  36   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ greater(growth_rate(X2,X3),growth_rate(X1,X3))
      | ~ subpopulations(X1,X2,X0,X3)
      | ~ environment(X0)
      | selection_favors(X2,X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp1_high_growth_rates_1) ).

fof(f2,axiom,
    ! [X0] :
      ( in_environment(X0,sk1(X0))
      | ~ stable(X0)
      | ~ environment(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_2) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ~ subpopulations(first_movers,efficient_producers,X0,X1)
      | ~ stable(X0)
      | ~ environment(X0)
      | ~ greater_or_equal(X1,sk1(X0))
      | greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_3) ).

fof(f4,negated_conjecture,
    environment(sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_4) ).

fof(f5,negated_conjecture,
    stable(sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_5) ).

fof(f6,negated_conjecture,
    ! [X0] :
      ( subpopulations(first_movers,efficient_producers,sk2,sk3(X0))
      | ~ in_environment(sk2,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_6) ).

fof(f7,negated_conjecture,
    ! [X0] :
      ( greater_or_equal(sk3(X0),X0)
      | ~ in_environment(sk2,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_7) ).

fof(f8,negated_conjecture,
    ! [X0] :
      ( ~ selection_favors(efficient_producers,first_movers,sk3(X0))
      | ~ in_environment(sk2,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1_8) ).

fof(f9,plain,
    ! [X0] :
      ( ~ stable(sk2)
      | ~ environment(sk2)
      | ~ greater_or_equal(sk3(X0),sk1(sk2))
      | greater(growth_rate(efficient_producers,sk3(X0)),growth_rate(first_movers,sk3(X0)))
      | ~ in_environment(sk2,X0) ),
    inference(resolution,[],[f3,f6]) ).

fof(f10,plain,
    ! [X0] :
      ( ~ environment(sk2)
      | ~ greater_or_equal(sk3(X0),sk1(sk2))
      | greater(growth_rate(efficient_producers,sk3(X0)),growth_rate(first_movers,sk3(X0)))
      | ~ in_environment(sk2,X0) ),
    inference(forward_subsumption_resolution,[],[f9,f5]) ).

fof(f11,plain,
    ! [X0] :
      ( greater(growth_rate(efficient_producers,sk3(X0)),growth_rate(first_movers,sk3(X0)))
      | ~ greater_or_equal(sk3(X0),sk1(sk2))
      | ~ in_environment(sk2,X0) ),
    inference(forward_subsumption_resolution,[],[f10,f4]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ greater_or_equal(sk3(X0),sk1(sk2))
      | ~ in_environment(sk2,X0)
      | ~ subpopulations(first_movers,efficient_producers,X1,sk3(X0))
      | ~ environment(X1)
      | selection_favors(efficient_producers,first_movers,sk3(X0)) ),
    inference(resolution,[],[f11,f1]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ~ subpopulations(first_movers,efficient_producers,X1,sk3(X0))
      | ~ in_environment(sk2,X0)
      | ~ greater_or_equal(sk3(X0),sk1(sk2))
      | ~ environment(X1) ),
    inference(forward_subsumption_resolution,[],[f12,f8]) ).

fof(f14,plain,
    ! [X0] :
      ( ~ in_environment(sk2,X0)
      | ~ greater_or_equal(sk3(X0),sk1(sk2))
      | ~ environment(sk2)
      | ~ in_environment(sk2,X0) ),
    inference(resolution,[],[f13,f6]) ).

fof(f15,plain,
    ! [X0] :
      ( ~ in_environment(sk2,X0)
      | ~ greater_or_equal(sk3(X0),sk1(sk2))
      | ~ environment(sk2) ),
    inference(duplicate_literal_removal,[],[f14]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ greater_or_equal(sk3(X0),sk1(sk2))
      | ~ in_environment(sk2,X0) ),
    inference(forward_subsumption_resolution,[],[f15,f4]) ).

fof(f17,plain,
    ( ~ in_environment(sk2,sk1(sk2))
    | ~ in_environment(sk2,sk1(sk2)) ),
    inference(resolution,[],[f16,f7]) ).

fof(f18,plain,
    ~ in_environment(sk2,sk1(sk2)),
    inference(duplicate_literal_removal,[],[f17]) ).

fof(f19,plain,
    ( ~ stable(sk2)
    | ~ environment(sk2) ),
    inference(resolution,[],[f18,f2]) ).

fof(f20,plain,
    ~ environment(sk2),
    inference(forward_subsumption_resolution,[],[f19,f5]) ).

fof(f21,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f20,f4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT032-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.10/0.38  % Computer : n014.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 17:20:47 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41  Running first-order model finding
% 0.10/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.10/0.44  % (1039486)Will run a generic schedule for satisfiability detection.
% 0.10/0.44  % (1039494)dis+10_1_sil=32000:sp=arity:random_seed=3854097787:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.44  % (1039494) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1039486-1039494"...
% 0.10/0.44  % (1039494)...printing done.
% 0.10/0.44  % (1039494)Refutation found. Thanks to Tanya!
% 0.10/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44  % (1039494)------------------------------
% 0.10/0.44  % (1039494)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44  % (1039494)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44  % (1039494)CaDiCaL version: 2.1.3
% 0.10/0.44  % (1039494)Termination reason: Refutation
% 0.10/0.44  % (1039494)Time elapsed: 0.001 s
% 0.10/0.44  % (1039494)Peak memory usage: 11 MB
% 0.10/0.44  % (1039494)Instructions burned: 1 (million)
% 0.10/0.44  % (1039486)Success in time 0.026 s
% 0.10/0.44  % Vampire exiting
%------------------------------------------------------------------------------