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

% Computer : n006.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 02:22:59 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0,X1] : p(X0,X1)
   => ! [X0] : p(X0,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0,X1] : p(X0,X1)
     => ! [X0] : p(X0,X0) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ( ! [X0,X1] : p(X0,X1)
     => ! [X2] : p(X2,X2) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ? [X2] : ~ p(X2,X2)
    & ! [X0,X1] : p(X0,X1) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ? [X0] : ~ p(X0,X0)
    & ! [X1,X2] : p(X1,X2) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ( ~ p(sK0,sK0)
    & ! [X1,X2] : p(X1,X2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f5]) ).

fof(f7,plain,
    ! [X2,X1] : p(X1,X2),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ~ p(sK0,sK0),
    inference(cnf_transformation,[],[f6]) ).

fof(f9,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f8,f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN975+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18  % Computer : n006.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 17:17:55 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21  Running first-order model finding
% 0.09/0.21  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.09/0.25  % (4125851)Will run a generic schedule for satisfiability detection.
% 0.09/0.25  % (4125857)% WARNING: option uhcvi not known.
% 0.09/0.25  % (4125861)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=207115474:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.25  % (4125861) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4125851-4125861"...
% 0.09/0.25  % (4125861)...printing done.
% 0.09/0.25  % (4125859)dis+10_1_sil=32000:sp=arity:random_seed=3829584296:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.25  % (4125856)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3889708574_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.25  % (4125857)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4115260603:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.25  % (4125858)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2728222517:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.25  % Detected minimum model sizes of [1]
% 0.09/0.25  % Detected maximum model sizes of [1]
% 0.09/0.25  % (4125859) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4125851-4125859"...
% 0.09/0.25  % TRYING [1]
% 0.09/0.25  % (4125857) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4125851-4125857"...
% 0.09/0.25  % (4125856) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4125851-4125856"...
% 0.09/0.25  % (4125858) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4125851-4125858"...
% 0.09/0.25  % (4125859)...printing done.
% 0.09/0.25  % (4125857)...printing done.
% 0.09/0.25  % (4125856)...printing done.
% 0.09/0.25  % (4125858)...printing done.
% 0.09/0.25  % (4125861)Refutation found. Thanks to Tanya!
% 0.09/0.25  % SZS status Theorem for theBenchmark
% 0.09/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25  % (4125861)------------------------------
% 0.09/0.25  % (4125861)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25  % (4125861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25  % (4125861)CaDiCaL version: 2.1.3
% 0.09/0.25  % (4125861)Termination reason: Refutation
% 0.09/0.25  % (4125861)Time elapsed: 0.001 s
% 0.09/0.25  % (4125861)Peak memory usage: 11 MB
% 0.09/0.25  % (4125851)Success in time 0.036 s
% 0.09/0.25  % Vampire exiting
%------------------------------------------------------------------------------