↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : DAT334_21 : TPTP v9.3.1. Released v8.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n005.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 09:48:31 AM UTC 2026

% Result   : Theorem 0.10s 0.25s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   69 (   0 equ)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :   42 (  15   ~;   8   |;  16   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :   27 (  27 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   9 usr;   7 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   15 (  10   !;   5   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    '$ki_world': $tType ).

tff(func_def_0,type,
    '$ki_local_world': '$ki_world' ).

tff(func_def_7,type,
    sK0: '$ki_world' > '$ki_world' ).

tff(func_def_8,type,
    sK1: '$ki_world' > $i ).

tff(func_def_9,type,
    sK2: '$ki_world' > $i ).

tff(func_def_10,type,
    sK3: '$ki_world' ).

tff(pred_def_1,type,
    '$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).

tff(pred_def_2,type,
    teach: ( '$ki_world' * $i * $i ) > $o ).

tff(pred_def_3,type,
    '$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).

tff(f4,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => ( teach(X0,john,math)
        & ? [X1: $i] :
            ( '$ki_exists_in_world_$i'(X0,X1)
            & teach(X0,X1,cs) )
        & teach(X0,mary,psych)
        & teach(X0,sue,psych) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',db) ).

tff(f5,conjecture,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => ? [X1: $i] :
          ( '$ki_exists_in_world_$i'(X0,X1)
          & teach(X0,X1,cs) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(f6,negated_conjecture,
    ~ ! [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
       => ? [X1: $i] :
            ( '$ki_exists_in_world_$i'(X0,X1)
            & teach(X0,X1,cs) ) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

tff(f9,plain,
    ! [X0: '$ki_world'] :
      ( ( teach(X0,john,math)
        & ? [X1: $i] :
            ( '$ki_exists_in_world_$i'(X0,X1)
            & teach(X0,X1,cs) )
        & teach(X0,mary,psych)
        & teach(X0,sue,psych) )
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f10,plain,
    ? [X0: '$ki_world'] :
      ( ! [X1: $i] :
          ( ~ '$ki_exists_in_world_$i'(X0,X1)
          | ~ teach(X0,X1,cs) )
      & '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f6]) ).

tff(f13,plain,
    ! [X0: '$ki_world'] :
      ( ( teach(X0,john,math)
        & '$ki_exists_in_world_$i'(X0,sK2(X0))
        & teach(X0,sK2(X0),cs)
        & teach(X0,mary,psych)
        & teach(X0,sue,psych) )
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2(X0))],[f9]) ).

tff(f14,plain,
    ( ! [X1: $i] :
        ( ~ '$ki_exists_in_world_$i'(sK3,X1)
        | ~ teach(sK3,X1,cs) )
    & '$ki_accessible'('$ki_local_world',sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f10]) ).

tff(f20,plain,
    ! [X0: '$ki_world'] :
      ( teach(X0,sK2(X0),cs)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f21,plain,
    ! [X0: '$ki_world'] :
      ( '$ki_exists_in_world_$i'(X0,sK2(X0))
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f23,plain,
    '$ki_accessible'('$ki_local_world',sK3),
    inference(cnf_transformation,[],[f14]) ).

tff(f24,plain,
    ! [X1: $i] :
      ( ~ teach(sK3,X1,cs)
      | ~ '$ki_exists_in_world_$i'(sK3,X1) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f56,plain,
    ( ~ '$ki_accessible'('$ki_local_world',sK3)
    | ~ '$ki_exists_in_world_$i'(sK3,sK2(sK3)) ),
    inference(resolution,[],[f20,f24]) ).

tff(f57,plain,
    ~ '$ki_exists_in_world_$i'(sK3,sK2(sK3)),
    inference(forward_subsumption_resolution,[],[f56,f23]) ).

tff(f62,plain,
    ~ '$ki_accessible'('$ki_local_world',sK3),
    inference(resolution,[],[f57,f21]) ).

tff(f63,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f62,f23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : DAT334_21 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19  % Computer : n005.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Tue Sep 29 00:19:47 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22  Running first-order model finding
% 0.10/0.22  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.25  % (1321089)Will run a generic schedule for satisfiability detection.
% 0.10/0.25  % (1321099)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2877194791:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.10/0.25  % (1321099) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1321089-1321099"...
% 0.10/0.25  % (1321099)...printing done.
% 0.10/0.25  % (1321099)Refutation found. Thanks to Tanya!
% 0.10/0.25  % SZS status Theorem for theBenchmark
% 0.10/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25  % (1321099)------------------------------
% 0.10/0.25  % (1321099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25  % (1321099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25  % (1321099)CaDiCaL version: 2.1.3
% 0.10/0.25  % (1321099)Termination reason: Refutation
% 0.10/0.25  % (1321099)Time elapsed: 0.001 s
% 0.10/0.25  % (1321099)Peak memory usage: 12 MB
% 0.10/0.25  % (1321099)Instructions burned: 1 (million)
% 0.10/0.25  % (1321089)Success in time 0.016 s
% 0.10/0.25  % Vampire exiting
%------------------------------------------------------------------------------