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

% Computer : n018.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:00:06 PM UTC 2026

% Result   : Theorem 0.22s 0.50s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   92 (  51   ~;  27   |;  14   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   25 (  19   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : r1(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).

fof(f3,conjecture,
    ~ ? [X0] :
        ~ ( ~ ! [X1] :
                ( ~ r1(X0,X1)
                | ! [X0] :
                    ( ~ r1(X1,X0)
                    | ~ ( p201(X0)
                        & p101(X0) ) ) )
          | ~ ( p201(X0)
              & p101(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

fof(f4,negated_conjecture,
    ~ ~ ? [X0] :
          ~ ( ~ ! [X1] :
                  ( ~ r1(X0,X1)
                  | ! [X0] :
                      ( ~ r1(X1,X0)
                      | ~ ( p201(X0)
                          & p101(X0) ) ) )
            | ~ ( p201(X0)
                & p101(X0) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

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

fof(f6,plain,
    ? [X0] :
      ~ ( ~ ! [X1] :
              ( ~ r1(X0,X1)
              | ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( p201(X2)
                      & p101(X2) ) ) )
        | ~ ( p201(X0)
            & p101(X0) ) ),
    inference(flattening,[],[f5]) ).

fof(f9,plain,
    ? [X0] :
      ( ! [X1] :
          ( ~ r1(X0,X1)
          | ! [X2] :
              ( ~ r1(X1,X2)
              | ~ p201(X2)
              | ~ p101(X2) ) )
      & p201(X0)
      & p101(X0) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f10,plain,
    ? [X0] :
      ( ! [X1] :
          ( ~ r1(X0,X1)
          | ! [X2] :
              ( ~ r1(X1,X2)
              | ~ p201(X2)
              | ~ p101(X2) ) )
      & p201(X0)
      & p101(X0) ),
    inference(flattening,[],[f9]) ).

fof(f11,plain,
    ( ! [X1] :
        ( ~ r1(sK0,X1)
        | ! [X2] :
            ( ~ r1(X1,X2)
            | ~ p201(X2)
            | ~ p101(X2) ) )
    & p201(sK0)
    & p101(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f10]) ).

fof(f12,plain,
    ! [X0] : r1(X0,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f14,plain,
    p101(sK0),
    inference(cnf_transformation,[],[f11]) ).

fof(f15,plain,
    p201(sK0),
    inference(cnf_transformation,[],[f11]) ).

fof(f16,plain,
    ! [X2,X1] :
      ( ~ r1(sK0,X1)
      | ~ r1(X1,X2)
      | ~ p201(X2)
      | ~ p101(X2) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f17,plain,
    ! [X0] :
      ( ~ r1(sK0,X0)
      | ~ p201(X0)
      | ~ p101(X0) ),
    inference(resolution,[],[f12,f16]) ).

fof(f18,plain,
    ( ~ p201(sK0)
    | ~ p101(sK0) ),
    inference(resolution,[],[f17,f12]) ).

fof(f19,plain,
    ~ p101(sK0),
    inference(forward_subsumption_resolution,[],[f18,f15]) ).

fof(f20,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f19,f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL684+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41  % Computer : n018.cluster.edu
% 0.13/0.41  % Model    : x86_64 x86_64
% 0.13/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41  % Memory   : 8046.5625MB
% 0.13/0.41  % OS       : Linux 6.8.0-71-generic
% 0.13/0.41  % CPULimit : 300
% 0.13/0.41  % WCLimit  : 300
% 0.13/0.41  % DateTime : Sun Sep 27 16:39:54 UTC 2026
% 0.13/0.41  % CPUTime  : 
% 0.13/0.41  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.46  Running first-order model finding
% 0.13/0.46  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.22/0.50  % (2570487)Will run a generic schedule for satisfiability detection.
% 0.22/0.50  % (2570495)dis+10_1_sil=32000:sp=arity:random_seed=2260028629:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.50  % (2570495) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2570487-2570495"...
% 0.22/0.50  % (2570492)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4037593564_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.50  % (2570495)...printing done.
% 0.22/0.50  % Detected minimum model sizes of [1]
% 0.22/0.50  % Detected maximum model sizes of [1]
% 0.22/0.50  % TRYING [1]
% 0.22/0.50  % (2570492) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2570487-2570492"...
% 0.22/0.50  % (2570495)Refutation found. Thanks to Tanya!
% 0.22/0.50  % SZS status Theorem for theBenchmark
% 0.22/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.50  % (2570495)------------------------------
% 0.22/0.50  % (2570495)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.50  % (2570495)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.50  % (2570495)CaDiCaL version: 2.1.3
% 0.22/0.50  % (2570495)Termination reason: Refutation
% 0.22/0.50  % (2570495)Time elapsed: 0.001 s
% 0.22/0.50  % (2570495)Peak memory usage: 11 MB
% 0.22/0.50  % (2570487)Success in time 0.024 s
% 0.22/0.50  % Vampire exiting
%------------------------------------------------------------------------------