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

% Computer : n016.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 01:05:25 PM UTC 2026

% Result   : Theorem 0.20s 0.29s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   5 unt;   0 def)
%            Number of atoms       :   75 (  11 equ)
%            Maximal formula atoms :   14 (   7 avg)
%            Number of connectives :   94 (  29   ~;  22   |;  35   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   9 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   21 (  11   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ~ segmentP(X3,X2)
                    | ~ strictorderedP(X2)
                    | ? [X4] :
                        ( ssList(X4)
                        & neq(X2,X4)
                        & segmentP(X3,X4)
                        & segmentP(X4,X2)
                        & strictorderedP(X4) )
                    | strictorderedP(X0) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( X1 != X3
                      | X0 != X2
                      | ~ segmentP(X3,X2)
                      | ~ strictorderedP(X2)
                      | ? [X4] :
                          ( ssList(X4)
                          & neq(X2,X4)
                          & segmentP(X3,X4)
                          & segmentP(X4,X2)
                          & strictorderedP(X4) )
                      | strictorderedP(X0) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & segmentP(X3,X2)
                  & strictorderedP(X2)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X2,X4)
                      | ~ segmentP(X3,X4)
                      | ~ segmentP(X4,X2)
                      | ~ strictorderedP(X4) )
                  & ~ strictorderedP(X0)
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & segmentP(X3,X2)
                  & strictorderedP(X2)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X2,X4)
                      | ~ segmentP(X3,X4)
                      | ~ segmentP(X4,X2)
                      | ~ strictorderedP(X4) )
                  & ~ strictorderedP(X0)
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f296,plain,
    ( sK54 = sK56
    & sK53 = sK55
    & segmentP(sK56,sK55)
    & strictorderedP(sK55)
    & ! [X4] :
        ( ~ ssList(X4)
        | ~ neq(sK55,X4)
        | ~ segmentP(sK56,X4)
        | ~ segmentP(X4,sK55)
        | ~ strictorderedP(X4) )
    & ~ strictorderedP(sK53)
    & ssList(sK56)
    & ssList(sK55)
    & ssList(sK54)
    & ssList(sK53) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).

fof(f500,plain,
    ~ strictorderedP(sK53),
    inference(cnf_transformation,[],[f296]) ).

fof(f502,plain,
    strictorderedP(sK55),
    inference(cnf_transformation,[],[f296]) ).

fof(f504,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f296]) ).

fof(f506,plain,
    ~ strictorderedP(sK55),
    inference(definition_unfolding,[],[f500,f504]) ).

fof(f509,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f502,f506]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC291+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19  % Computer : n016.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Mon Sep 28 08:58:33 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22  Running first-order model finding
% 0.07/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.20/0.29  % (3490380)Will run a generic schedule for satisfiability detection.
% 0.20/0.29  % (3490385)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1594852104_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29  % (3490386)% WARNING: option uhcvi not known.
% 0.20/0.29  % (3490386)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1556500959:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29  % (3490387)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1988249296:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29  % (3490388)dis+10_1_sil=32000:sp=arity:random_seed=3189895045:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29  % (3490391)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1872552685:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29  % TRYING [1]
% 0.20/0.29  % (3490389)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3521652752:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29  % (3490390)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3158238363:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29  % TRYING [2]
% 0.20/0.29  % TRYING [3]
% 0.20/0.29  % (3490390) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3490380-3490390"...
% 0.20/0.29  % (3490387) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3490380-3490387"...
% 0.20/0.29  % (3490388) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3490380-3490388"...
% 0.20/0.29  % (3490386) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3490380-3490386"...
% 0.20/0.29  % (3490390)...printing done.
% 0.20/0.29  % (3490387)...printing done.
% 0.20/0.29  % (3490386)...printing done.
% 0.20/0.29  % (3490388)...printing done.
% 0.20/0.29  % (3490390)Refutation found. Thanks to Tanya!
% 0.20/0.29  % SZS status Theorem for theBenchmark
% 0.20/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29  % (3490390)------------------------------
% 0.20/0.29  % (3490390)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29  % (3490390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29  % (3490390)CaDiCaL version: 2.1.3
% 0.20/0.29  % (3490390)Termination reason: Refutation
% 0.20/0.29  % (3490390)Time elapsed: 0.005 s
% 0.20/0.29  % (3490390)Peak memory usage: 11 MB
% 0.20/0.29  % (3490390)Instructions burned: 7 (million)
% 0.20/0.29  % (3490380)Success in time 0.058 s
% 0.20/0.29  % Vampire exiting
%------------------------------------------------------------------------------