↑ 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  : DAT022_1 : TPTP v9.3.1. Released v5.0.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 09:47:58 AM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   55 (  14 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   50 (  15   ~;  14   |;  10   &)
%                                         (   2 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   71 (  15 atm;   0 fun;  34 num;  22 var)
%            Number of types       :    3 (   1 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   6 usr;   7 con; 0-2 aty)
%            Number of variables   :   36 (  30   !;   6   ?;  36   :)

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

tff(func_def_0,type,
    empty: collection ).

tff(func_def_1,type,
    add: ( $int * collection ) > collection ).

tff(func_def_2,type,
    remove: ( $int * collection ) > collection ).

tff(func_def_9,type,
    sK0: collection ).

tff(func_def_10,type,
    sK1: collection ).

tff(func_def_11,type,
    sK2: $int ).

tff(pred_def_1,type,
    in: ( $int * collection ) > $o ).

tff(f4,axiom,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( in(X0,X1)
        | ( X0 = X2 ) )
    <=> in(X0,add(X2,X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax4) ).

tff(f5,axiom,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( in(X0,X1)
        & ( X0 != X2 ) )
    <=> in(X0,remove(X2,X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax5) ).

tff(f6,conjecture,
    ! [X0: collection,X1: collection] :
      ( ( ! [X2: $int] :
            ( in(X2,X1)
           => $greater(X2,0) )
        & ( X0 = add(2,remove(7,X1)) ) )
     => ! [X3: $int] :
          ( in(X3,X0)
         => $greater(X3,0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

tff(f7,negated_conjecture,
    ~ ! [X0: collection,X1: collection] :
        ( ( ! [X2: $int] :
              ( in(X2,X1)
             => $greater(X2,0) )
          & ( X0 = add(2,remove(7,X1)) ) )
       => ! [X3: $int] :
            ( in(X3,X0)
           => $greater(X3,0) ) ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

tff(f8,plain,
    ~ ! [X0: collection,X1: collection] :
        ( ( ! [X2: $int] :
              ( in(X2,X1)
             => $less(0,X2) )
          & ( X0 = add(2,remove(7,X1)) ) )
       => ! [X3: $int] :
            ( in(X3,X0)
           => $less(0,X3) ) ),
    inference(theory_normalization,[],[f7]) ).

tff(f21,plain,
    ? [X0: collection,X1: collection] :
      ( ? [X3: $int] :
          ( ~ $less(0,X3)
          & in(X3,X0) )
      & ! [X2: $int] :
          ( $less(0,X2)
          | ~ in(X2,X1) )
      & ( X0 = add(2,remove(7,X1)) ) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f22,plain,
    ? [X0: collection,X1: collection] :
      ( ? [X3: $int] :
          ( ~ $less(0,X3)
          & in(X3,X0) )
      & ! [X2: $int] :
          ( $less(0,X2)
          | ~ in(X2,X1) )
      & ( X0 = add(2,remove(7,X1)) ) ),
    inference(flattening,[],[f21]) ).

tff(f28,plain,
    ! [X2: $int,X0: $int,X1: collection] :
      ( ~ in(X0,add(X2,X1))
      | ( X0 = X2 )
      | in(X0,X1) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f31,plain,
    ! [X2: $int,X0: $int,X1: collection] :
      ( ~ in(X0,remove(X2,X1))
      | in(X0,X1) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f32,plain,
    in(sK2,sK0),
    inference(cnf_transformation,[],[f22]) ).

tff(f33,plain,
    ~ $less(0,sK2),
    inference(cnf_transformation,[],[f22]) ).

tff(f34,plain,
    ! [X2: $int] :
      ( ~ in(X2,sK1)
      | $less(0,X2) ),
    inference(cnf_transformation,[],[f22]) ).

tff(f35,plain,
    sK0 = add(2,remove(7,sK1)),
    inference(cnf_transformation,[],[f22]) ).

tff(f177,plain,
    ! [X0: $int] :
      ( in(X0,remove(7,sK1))
      | ( 2 = X0 )
      | ~ in(X0,sK0) ),
    inference(superposition,[],[f28,f35]) ).

tff(f192,plain,
    ! [X0: $int] :
      ( in(X0,sK1)
      | ~ in(X0,sK0)
      | ( 2 = X0 ) ),
    inference(resolution,[],[f177,f31]) ).

tff(f209,plain,
    ! [X0: $int] :
      ( ~ in(X0,sK0)
      | ( 2 = X0 )
      | $less(0,X0) ),
    inference(resolution,[],[f192,f34]) ).

tff(f224,plain,
    ( ( 2 = sK2 )
    | $less(0,sK2) ),
    inference(resolution,[],[f209,f32]) ).

tff(f226,plain,
    2 = sK2,
    inference(forward_subsumption_resolution,[],[f224,f33]) ).

tff(f251,plain,
    ~ $less(0,2),
    inference(superposition,[],[f33,f226]) ).

tff(f258,plain,
    $false,
    inference(evaluation,[],[f251]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : DAT022_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n014.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 00:05:30 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/0.22  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.08/0.26  % (2301516)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (2301525)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=829738730:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26  % (2301522)% WARNING: option uhcvi not known.
% 0.08/0.26  % (2301525) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2301516-2301525"...
% 0.08/0.26  % (2301525)...printing done.
% 0.08/0.26  % (2301525)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Theorem for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (2301525)------------------------------
% 0.08/0.26  % (2301525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (2301525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (2301525)CaDiCaL version: 2.1.3
% 0.08/0.26  % (2301525)Termination reason: Refutation
% 0.08/0.26  % (2301525)Time elapsed: 0.005 s
% 0.08/0.26  % (2301525)Peak memory usage: 12 MB
% 0.08/0.26  % (2301525)Instructions burned: 11 (million)
% 0.08/0.26  % (2301516)Success in time 0.028 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------