↑ 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  : MGT041-2 : TPTP v9.3.1. Released v2.4.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:40 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.45s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   30 (  12 unt;   2 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   74 (  40   ~;  32   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   3 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   17 (   0 sgn  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ number_of_routines(X0,X1,high)
      | ~ number_of_routines(X0,X1,low) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low_1) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( has_elaborated_routines(X0,X1)
      | ~ efficient_producer(X0)
      | ~ founding_time(X0,X1)
      | ~ organisation_at_time(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14_2) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ~ first_mover(X0)
      | ~ organisation_at_time(X0,X1)
      | ~ founding_time(X0,X1)
      | number_of_routines(X0,X1,low) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15_3) ).

fof(f4,axiom,
    organisation_at_time(sk1,sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_4) ).

fof(f5,axiom,
    founding_time(sk1,sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_5) ).

fof(f6,axiom,
    number_of_routines(sk1,sk2,high),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_6) ).

fof(f7,axiom,
    ~ has_elaborated_routines(sk1,sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_7) ).

fof(f8,negated_conjecture,
    ! [X0,X1] :
      ( first_mover(X0)
      | ~ organisation_at_time(X0,X1)
      | efficient_producer(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10_8) ).

fof(f9,plain,
    ~ number_of_routines(sk1,sk2,low),
    inference(resolution,[],[f1,f6]) ).

fof(f10,plain,
    ( ~ efficient_producer(sk1)
    | ~ founding_time(sk1,sk2)
    | ~ organisation_at_time(sk1,sk2) ),
    inference(resolution,[],[f2,f7]) ).

fof(f11,plain,
    ( ~ efficient_producer(sk1)
    | ~ organisation_at_time(sk1,sk2) ),
    inference(forward_subsumption_resolution,[],[f10,f5]) ).

fof(f12,plain,
    ~ efficient_producer(sk1),
    inference(forward_subsumption_resolution,[],[f11,f4]) ).

fof(f13,plain,
    ! [X2,X0,X1] :
      ( efficient_producer(X0)
      | ~ founding_time(X0,X1)
      | number_of_routines(X0,X1,low)
      | ~ organisation_at_time(X0,X2)
      | ~ organisation_at_time(X0,X1) ),
    inference(resolution,[],[f3,f8]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ~ founding_time(sk1,X0)
      | number_of_routines(sk1,X0,low)
      | ~ organisation_at_time(sk1,X1)
      | ~ organisation_at_time(sk1,X0) ),
    inference(resolution,[],[f13,f12]) ).

fof(f16,definition,
    ( spl0_1
  <=> ! [X1] : ~ organisation_at_time(sk1,X1) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f17,plain,
    ( ! [X1] : ~ organisation_at_time(sk1,X1)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f16]) ).

fof(f19,definition,
    ( spl0_2
  <=> ! [X0] :
        ( ~ founding_time(sk1,X0)
        | ~ organisation_at_time(sk1,X0)
        | number_of_routines(sk1,X0,low) ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f20,plain,
    ( ! [X0] :
        ( ~ founding_time(sk1,X0)
        | ~ organisation_at_time(sk1,X0)
        | number_of_routines(sk1,X0,low) )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f19]) ).

fof(f21,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f14,f19,f16]) ).

fof(f22,plain,
    ( ~ organisation_at_time(sk1,sk2)
    | number_of_routines(sk1,sk2,low)
    | ~ spl0_2 ),
    inference(resolution,[],[f20,f5]) ).

fof(f23,plain,
    ( number_of_routines(sk1,sk2,low)
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f22,f4]) ).

fof(f24,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f23,f9]) ).

fof(f25,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f24]) ).

fof(f26,plain,
    ( $false
    | ~ spl0_1 ),
    inference(resolution,[],[f17,f4]) ).

fof(f27,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f26]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f21]) ).

cnf(s2,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f25]) ).

cnf(s3,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f27]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s2,s3]) ).

fof(f28,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39  % Computer : n014.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 27 17:25:32 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42  Running first-order model finding
% 0.13/0.42  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.13/0.45  % (1042059)Will run a generic schedule for satisfiability detection.
% 0.13/0.45  % (1042068)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=703433107:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.45  % (1042068) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1042059-1042068"...
% 0.13/0.45  % (1042068)...printing done.
% 0.13/0.45  % (1042068)Refutation found. Thanks to Tanya!
% 0.13/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.46  % (1042068)------------------------------
% 0.13/0.46  % (1042068)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.46  % (1042068)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.46  % (1042068)CaDiCaL version: 2.1.3
% 0.13/0.46  % (1042068)Termination reason: Refutation
% 0.13/0.46  % (1042068)Time elapsed: 0.001 s
% 0.13/0.46  % (1042068)Peak memory usage: 12 MB
% 0.13/0.46  % (1042068)Instructions burned: 1 (million)
% 0.13/0.46  % (1042059)Success in time 0.027 s
% 0.13/0.46  % Vampire exiting
%------------------------------------------------------------------------------