↑ 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  : SWC351+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 : n015.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:40 PM UTC 2026

% Result   : Theorem 0.19s 0.27s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (   9 unt;   0 def)
%            Number of atoms       :  125 (  34 equ)
%            Maximal formula atoms :   20 (   5 avg)
%            Number of connectives :  155 (  53   ~;  46   |;  40   &)
%                                         (   2 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   8 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   55 (  35   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( frontsegP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & app(X1,X2) = X0 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).

fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).

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

fof(f101,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( frontsegP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & app(X1,X2) = X0 ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f132,plain,
    ! [X0] :
      ( ! [X1] :
          ( ssList(app(X0,X1))
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & neq(X1,nil)
                  & ? [X4] :
                      ( app(X2,X4) = X3
                      & strictorderedP(X2)
                      & ! [X5] :
                          ( ~ ssItem(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(cons(X5,nil),X6) != X4
                              | ! [X7] :
                                  ( ~ ssItem(X7)
                                  | ! [X8] :
                                      ( ~ ssList(X8)
                                      | app(X8,cons(X7,nil)) != X2
                                      | ~ lt(X7,X5) ) ) ) )
                      & ssList(X4) )
                  & ~ frontsegP(X1,X0)
                  & ( nil = X3
                    | nil != X2 )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & neq(X1,nil)
                  & ? [X4] :
                      ( app(X2,X4) = X3
                      & strictorderedP(X2)
                      & ! [X5] :
                          ( ~ ssItem(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(cons(X5,nil),X6) != X4
                              | ! [X7] :
                                  ( ~ ssItem(X7)
                                  | ! [X8] :
                                      ( ~ ssList(X8)
                                      | app(X8,cons(X7,nil)) != X2
                                      | ~ lt(X7,X5) ) ) ) )
                      & ssList(X4) )
                  & ~ frontsegP(X1,X0)
                  & ( nil = X3
                    | nil != X2 )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f237,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | app(X1,X2) != X0
      | ~ ssList(X2)
      | frontsegP(X0,X1) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f318,plain,
    ! [X0,X1] :
      ( ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f132]) ).

fof(f412,plain,
    ssList(sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f414,plain,
    sK50 = app(sK49,sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f417,plain,
    ~ frontsegP(sK48,sK47),
    inference(cnf_transformation,[],[f222]) ).

fof(f419,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f222]) ).

fof(f420,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f222]) ).

fof(f421,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f222]) ).

fof(f427,plain,
    ~ frontsegP(sK50,sK49),
    inference(definition_unfolding,[],[f417,f420,f419]) ).

fof(f431,plain,
    ! [X2,X1] :
      ( ~ ssList(app(X1,X2))
      | ~ ssList(X1)
      | ~ ssList(X2)
      | frontsegP(app(X1,X2),X1) ),
    inference(equality_resolution,[],[f237]) ).

fof(f500,plain,
    ! [X2,X1] :
      ( frontsegP(app(X1,X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X1) ),
    inference(forward_subsumption_resolution,[],[f431,f318]) ).

fof(f585,plain,
    ( frontsegP(sK50,sK49)
    | ~ ssList(sK51)
    | ~ ssList(sK49) ),
    inference(superposition,[],[f500,f414]) ).

fof(f590,plain,
    ( ~ ssList(sK51)
    | ~ ssList(sK49) ),
    inference(forward_subsumption_resolution,[],[f585,f427]) ).

fof(f591,plain,
    ~ ssList(sK49),
    inference(forward_subsumption_resolution,[],[f590,f412]) ).

fof(f592,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f591,f421]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC351+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.17  % Computer : n015.cluster.edu
% 0.07/0.17  % Model    : x86_64 x86_64
% 0.07/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17  % Memory   : 8046.5625MB
% 0.07/0.17  % OS       : Linux 6.8.0-71-generic
% 0.07/0.17  % CPULimit : 300
% 0.07/0.17  % WCLimit  : 300
% 0.07/0.17  % DateTime : Mon Sep 28 09:16:16 UTC 2026
% 0.07/0.17  % CPUTime  : 
% 0.07/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20  Running first-order model finding
% 0.07/0.20  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.19/0.27  % (2494619)Will run a generic schedule for satisfiability detection.
% 0.19/0.27  % (2494624)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2348287040_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27  % (2494625)% WARNING: option uhcvi not known.
% 0.19/0.27  % (2494626)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4255314333:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27  % (2494625)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3467544949:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27  % (2494627)dis+10_1_sil=32000:sp=arity:random_seed=583706410:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27  % (2494628)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=753091999:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27  % TRYING [1]
% 0.19/0.27  % (2494630)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=306709369:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.27  % (2494629)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3634343754:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27  % TRYING [2]
% 0.19/0.27  % TRYING [3]
% 0.19/0.27  % TRYING [4]
% 0.19/0.27  % (2494628) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2494619-2494628"...
% 0.19/0.27  % (2494628)...printing done.
% 0.19/0.27  % (2494628)Refutation found. Thanks to Tanya!
% 0.19/0.27  % SZS status Theorem for theBenchmark
% 0.19/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27  % (2494628)------------------------------
% 0.19/0.27  % (2494628)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27  % (2494628)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27  % (2494628)CaDiCaL version: 2.1.3
% 0.19/0.27  % (2494628)Termination reason: Refutation
% 0.19/0.27  % (2494628)Time elapsed: 0.014 s
% 0.19/0.27  % (2494628)Peak memory usage: 12 MB
% 0.19/0.27  % (2494628)Instructions burned: 23 (million)
% 0.19/0.27  % (2494619)Success in time 0.057 s
% 0.19/0.27  % Vampire exiting
%------------------------------------------------------------------------------