↑ 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  : SWC020+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 : 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 01:04:19 PM UTC 2026

% Result   : Theorem 0.12s 0.46s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   48 (   9 unt;   4 def)
%            Number of atoms       :  168 (  42 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  192 (  72   ~;  67   |;  40   &)
%                                         (   4 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   26 (   0 sgn  16   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f42,axiom,
    ! [X0] :
      ( ssList(X0)
     => frontsegP(X0,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax42) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ? [X4] :
                        ( ssList(X4)
                        & neq(X4,nil)
                        & frontsegP(X1,X4)
                        & frontsegP(X0,X4) )
                    | ( nil = X1
                      & nil = X0 )
                    | ( ( nil != X3
                        | nil != X2 )
                      & ( ~ neq(X2,nil)
                        | ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
    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
                      | ? [X4] :
                          ( ssList(X4)
                          & neq(X4,nil)
                          & frontsegP(X1,X4)
                          & frontsegP(X0,X4) )
                      | ( nil = X1
                        & nil = X0 )
                      | ( ( nil != X3
                          | nil != X2 )
                        & ( ~ neq(X2,nil)
                          | ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f153,plain,
    ! [X0] :
      ( frontsegP(X0,X0)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f42]) ).

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

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

fof(f296,plain,
    ( sK54 = sK56
    & sK53 = sK55
    & ! [X4] :
        ( ~ ssList(X4)
        | ~ neq(X4,nil)
        | ~ frontsegP(sK54,X4)
        | ~ frontsegP(sK53,X4) )
    & ( nil != sK54
      | nil != sK53 )
    & ( ( nil = sK56
        & nil = sK55 )
      | ( neq(sK55,nil)
        & frontsegP(sK56,sK55) ) )
    & 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(f423,plain,
    ! [X0] :
      ( frontsegP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f153]) ).

fof(f498,plain,
    ssList(sK55),
    inference(cnf_transformation,[],[f296]) ).

fof(f500,plain,
    ( nil = sK55
    | frontsegP(sK56,sK55) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f501,plain,
    ( nil = sK55
    | neq(sK55,nil) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f502,plain,
    ( nil = sK56
    | frontsegP(sK56,sK55) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f503,plain,
    ( nil = sK56
    | neq(sK55,nil) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f504,plain,
    ( nil != sK54
    | nil != sK53 ),
    inference(cnf_transformation,[],[f296]) ).

fof(f505,plain,
    ! [X4] :
      ( ~ ssList(X4)
      | ~ neq(X4,nil)
      | ~ frontsegP(sK54,X4)
      | ~ frontsegP(sK53,X4) ),
    inference(cnf_transformation,[],[f296]) ).

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

fof(f507,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f296]) ).

fof(f508,plain,
    ! [X4] :
      ( ~ frontsegP(sK56,X4)
      | ~ neq(X4,nil)
      | ~ ssList(X4)
      | ~ frontsegP(sK55,X4) ),
    inference(definition_unfolding,[],[f505,f507,f506]) ).

fof(f509,plain,
    ( nil != sK56
    | nil != sK55 ),
    inference(definition_unfolding,[],[f504,f507,f506]) ).

fof(f547,definition,
    ( spl57_1
  <=> frontsegP(sK56,sK55) ),
    introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).

fof(f549,plain,
    ( frontsegP(sK56,sK55)
    | ~ spl57_1 ),
    inference(avatar_component_clause,[],[f547]) ).

fof(f551,definition,
    ( spl57_2
  <=> nil = sK55 ),
    introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).

fof(f554,plain,
    ( spl57_1
    | spl57_2 ),
    inference(avatar_split_clause,[],[f500,f551,f547]) ).

fof(f556,definition,
    ( spl57_3
  <=> neq(sK55,nil) ),
    introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).

fof(f558,plain,
    ( neq(sK55,nil)
    | ~ spl57_3 ),
    inference(avatar_component_clause,[],[f556]) ).

fof(f559,plain,
    ( spl57_3
    | spl57_2 ),
    inference(avatar_split_clause,[],[f501,f551,f556]) ).

fof(f561,definition,
    ( spl57_4
  <=> nil = sK56 ),
    introduced(definition,[new_symbols(definition,[spl57_4])],[avatar_definition]) ).

fof(f564,plain,
    ( spl57_1
    | spl57_4 ),
    inference(avatar_split_clause,[],[f502,f561,f547]) ).

fof(f565,plain,
    ( spl57_3
    | spl57_4 ),
    inference(avatar_split_clause,[],[f503,f561,f556]) ).

fof(f566,plain,
    ( ~ spl57_2
    | ~ spl57_4 ),
    inference(avatar_split_clause,[],[f509,f561,f551]) ).

fof(f602,plain,
    ( ~ neq(sK55,nil)
    | ~ ssList(sK55)
    | ~ frontsegP(sK55,sK55)
    | ~ spl57_1 ),
    inference(resolution,[],[f508,f549]) ).

fof(f603,plain,
    ( ~ ssList(sK55)
    | ~ frontsegP(sK55,sK55)
    | ~ spl57_1
    | ~ spl57_3 ),
    inference(forward_subsumption_resolution,[],[f602,f558]) ).

fof(f604,plain,
    ( ~ frontsegP(sK55,sK55)
    | ~ spl57_1
    | ~ spl57_3 ),
    inference(forward_subsumption_resolution,[],[f603,f498]) ).

fof(f642,plain,
    ( ~ ssList(sK55)
    | ~ spl57_1
    | ~ spl57_3 ),
    inference(resolution,[],[f423,f604]) ).

fof(f644,plain,
    ( $false
    | ~ spl57_1
    | ~ spl57_3 ),
    inference(forward_subsumption_resolution,[],[f642,f498]) ).

fof(f645,plain,
    ( ~ spl57_1
    | ~ spl57_3 ),
    inference(avatar_contradiction_clause,[],[f644]) ).

cnf(s1,plain,
    ( spl57_1
    | spl57_2 ),
    inference(sat_conversion,[],[f554]) ).

cnf(s2,plain,
    ( spl57_2
    | spl57_3 ),
    inference(sat_conversion,[],[f559]) ).

cnf(s3,plain,
    ( spl57_1
    | spl57_4 ),
    inference(sat_conversion,[],[f564]) ).

cnf(s4,plain,
    ( spl57_3
    | spl57_4 ),
    inference(sat_conversion,[],[f565]) ).

cnf(s5,plain,
    ( ~ spl57_2
    | ~ spl57_4 ),
    inference(sat_conversion,[],[f566]) ).

cnf(s15,plain,
    ( ~ spl57_1
    | ~ spl57_3 ),
    inference(sat_conversion,[],[f645]) ).

cnf(s21,plain,
    spl57_1,
    inference(rat,[],[s5,s1,s3]) ).

cnf(s22,plain,
    ~ spl57_3,
    inference(rat,[],[s15,s21]) ).

cnf(s23,plain,
    spl57_4,
    inference(rat,[],[s4,s22]) ).

cnf(s24,plain,
    spl57_2,
    inference(rat,[],[s2,s22]) ).

cnf(s25,plain,
    $false,
    inference(rat,[],[s5,s23,s24]) ).

fof(f656,plain,
    $false,
    inference(avatar_sat_refutation,[],[s25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC020+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.12/0.37  % Computer : n006.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 28 07:27:40 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40  Running first-order model finding
% 0.12/0.40  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.12/0.46  % (3795984)Will run a generic schedule for satisfiability detection.
% 0.12/0.46  % (3795990)% WARNING: option uhcvi not known.
% 0.12/0.46  % (3795989)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4138399738_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.46  % (3795991)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=946323575:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.46  % (3795993)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=333034442:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.46  % (3795992)dis+10_1_sil=32000:sp=arity:random_seed=322548934:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.46  % (3795994)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1560857385:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.46  % (3795995)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1819558476:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.46  % (3795990)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1098192074:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.46  % (3795992) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3795984-3795992"...
% 0.12/0.46  % (3795994) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3795984-3795994"...
% 0.12/0.46  % (3795992)...printing done.
% 0.12/0.46  % (3795994)...printing done.
% 0.12/0.46  % (3795992)Refutation found. Thanks to Tanya!
% 0.12/0.46  % SZS status Theorem for theBenchmark
% 0.12/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46  % (3795992)------------------------------
% 0.12/0.46  % (3795992)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46  % (3795992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46  % (3795992)CaDiCaL version: 2.1.3
% 0.12/0.46  % (3795992)Termination reason: Refutation
% 0.12/0.46  % (3795992)Time elapsed: 0.007 s
% 0.12/0.46  % (3795992)Peak memory usage: 12 MB
% 0.12/0.46  % (3795992)Instructions burned: 11 (million)
% 0.12/0.46  % (3795984)Success in time 0.045 s
% 0.12/0.46  % Vampire exiting
%------------------------------------------------------------------------------