↑ 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  : SEU083+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n015.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:51:54 PM UTC 2026

% Result   : Theorem 0.11s 0.45s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   30 (  13   ~;   7   |;   7   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   16 (  12   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f35,axiom,
    ! [X0,X1] :
      ( ( finite(X0)
        & finite(X1) )
     => finite(set_union2(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc9_finset_1) ).

fof(f61,conjecture,
    ! [X0,X1] :
      ( ( finite(X0)
        & finite(X1) )
     => finite(set_union2(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_finset_1) ).

fof(f62,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( finite(X0)
          & finite(X1) )
       => finite(set_union2(X0,X1)) ),
    inference(negated_conjecture,[status(cth)],[f61]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( finite(set_union2(X0,X1))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f118,plain,
    ! [X0,X1] :
      ( finite(set_union2(X0,X1))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(flattening,[],[f117]) ).

fof(f121,plain,
    ? [X0,X1] :
      ( ~ finite(set_union2(X0,X1))
      & finite(X0)
      & finite(X1) ),
    inference(ennf_transformation,[],[f62]) ).

fof(f122,plain,
    ? [X0,X1] :
      ( ~ finite(set_union2(X0,X1))
      & finite(X0)
      & finite(X1) ),
    inference(flattening,[],[f121]) ).

fof(f172,plain,
    ! [X0,X1] :
      ( finite(set_union2(X0,X1))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f244,plain,
    finite(sK27),
    inference(cnf_transformation,[],[f122]) ).

fof(f245,plain,
    finite(sK26),
    inference(cnf_transformation,[],[f122]) ).

fof(f246,plain,
    ~ finite(set_union2(sK26,sK27)),
    inference(cnf_transformation,[],[f122]) ).

fof(f451,plain,
    ( ~ finite(sK26)
    | ~ finite(sK27) ),
    inference(resolution,[],[f172,f246]) ).

fof(f458,plain,
    ~ finite(sK27),
    inference(forward_subsumption_resolution,[],[f451,f245]) ).

fof(f459,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f458,f244]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU083+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n015.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 28 03:34:31 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  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.11/0.45  % (2231668)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (2231674)% WARNING: option uhcvi not known.
% 0.11/0.45  % (2231674)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1786229067:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45  % (2231674) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2231668-2231674"...
% 0.11/0.45  % (2231674)...printing done.
% 0.11/0.45  % (2231674)Refutation found. Thanks to Tanya!
% 0.11/0.45  % SZS status Theorem for theBenchmark
% 0.11/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46  % (2231674)------------------------------
% 0.11/0.46  % (2231674)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46  % (2231674)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46  % (2231674)CaDiCaL version: 2.1.3
% 0.11/0.46  % (2231674)Termination reason: Refutation
% 0.11/0.46  % (2231674)Time elapsed: 0.004 s
% 0.11/0.46  % (2231674)Peak memory usage: 12 MB
% 0.11/0.46  % (2231674)Instructions burned: 8 (million)
% 0.11/0.46  % (2231668)Success in time 0.038 s
% 0.11/0.46  % Vampire exiting
%------------------------------------------------------------------------------