↑ 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  : SYN970+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 : n013.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:58 PM UTC 2026

% Result   : Theorem 0.08s 0.25s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (   8 unt;   2 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   43 (  19   ~;  10   |;   6   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   24 (   0 sgn  16   !;   8   ?)

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

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

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

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

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

fof(f6,plain,
    ! [X2,X3] :
      ( r(X3)
      | ~ p(X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    p(sK0),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ~ r(sK1),
    inference(cnf_transformation,[],[f5]) ).

fof(f10,definition,
    ( spl2_1
  <=> ! [X2] : ~ p(X2) ),
    introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).

fof(f11,plain,
    ( ! [X2] : ~ p(X2)
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f10]) ).

fof(f13,definition,
    ( spl2_2
  <=> ! [X3] : r(X3) ),
    introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).

fof(f14,plain,
    ( ! [X3] : r(X3)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f13]) ).

fof(f15,plain,
    ( spl2_1
    | spl2_2 ),
    inference(avatar_split_clause,[],[f6,f13,f10]) ).

fof(f16,plain,
    ( $false
    | ~ spl2_2 ),
    inference(resolution,[],[f14,f8]) ).

fof(f17,plain,
    ~ spl2_2,
    inference(avatar_contradiction_clause,[],[f16]) ).

fof(f18,plain,
    ( $false
    | ~ spl2_1 ),
    inference(resolution,[],[f11,f7]) ).

fof(f19,plain,
    ~ spl2_1,
    inference(avatar_contradiction_clause,[],[f18]) ).

cnf(s1,plain,
    ( spl2_1
    | spl2_2 ),
    inference(sat_conversion,[],[f15]) ).

cnf(s2,plain,
    ~ spl2_2,
    inference(sat_conversion,[],[f17]) ).

cnf(s3,plain,
    ~ spl2_1,
    inference(sat_conversion,[],[f19]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN970+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.08/0.18  % Computer : n013.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.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 17:17:21 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/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.08/0.25  % (1332263)Will run a generic schedule for satisfiability detection.
% 0.08/0.25  % (1332269)% WARNING: option uhcvi not known.
% 0.08/0.25  % (1332271)dis+10_1_sil=32000:sp=arity:random_seed=1208258339:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25  % (1332270)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4215350382:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.25  % (1332268)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1868037259_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.25  % (1332269)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1260753470:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.25  % (1332274)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3822893748:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.25  % (1332273)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3149249086:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.25  % Detected minimum model sizes of [1]
% 0.08/0.25  % Detected maximum model sizes of [2]
% 0.08/0.25  % TRYING [1]
% 0.08/0.25  % (1332268) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1332263-1332268"...
% 0.08/0.25  % (1332271) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1332263-1332271"...
% 0.08/0.25  % (1332274) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1332263-1332274"...
% 0.08/0.25  % (1332269) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1332263-1332269"...
% 0.08/0.25  % (1332270) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1332263-1332270"...
% 0.08/0.25  % (1332273) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1332263-1332273"...
% 0.08/0.25  % (1332268)...printing done.
% 0.08/0.25  % (1332271)...printing done.
% 0.08/0.25  % (1332269)...printing done.
% 0.08/0.25  % (1332270)...printing done.
% 0.08/0.25  % (1332273)...printing done.
% 0.08/0.25  % (1332274)...printing done.
% 0.08/0.25  % (1332271)Refutation found. Thanks to Tanya!
% 0.08/0.25  % SZS status Theorem for theBenchmark
% 0.08/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25  % (1332271)------------------------------
% 0.08/0.25  % (1332271)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25  % (1332271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25  % (1332271)CaDiCaL version: 2.1.3
% 0.08/0.25  % (1332271)Termination reason: Refutation
% 0.08/0.25  % (1332271)Time elapsed: 0.001 s
% 0.08/0.25  % (1332271)Peak memory usage: 12 MB
% 0.08/0.25  % (1332263)Success in time 0.036 s
% 0.08/0.25  % Vampire exiting
%------------------------------------------------------------------------------