↑ 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  : SWC133+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 : n007.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:48 PM UTC 2026

% Result   : Theorem 0.17s 0.49s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   36 (  16 unt;   2 def)
%            Number of atoms       :   98 (  21 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  101 (  39   ~;  26   |;  22   &)
%                                         (   4 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   24 (   0 sgn  16   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(f60,axiom,
    cyclefreeP(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax60) ).

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

fof(f118,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

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

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

fof(f273,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f118]) ).

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

fof(f389,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f446,plain,
    cyclefreeP(nil),
    inference(cnf_transformation,[],[f60]) ).

fof(f499,plain,
    ssList(sK56),
    inference(cnf_transformation,[],[f296]) ).

fof(f500,plain,
    ~ cyclefreeP(sK54),
    inference(cnf_transformation,[],[f296]) ).

fof(f501,plain,
    ~ neq(sK56,nil),
    inference(cnf_transformation,[],[f296]) ).

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

fof(f504,plain,
    ~ cyclefreeP(sK56),
    inference(definition_unfolding,[],[f500,f503]) ).

fof(f542,definition,
    ( spl57_1
  <=> ssList(nil) ),
    introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).

fof(f543,plain,
    ( ssList(nil)
    | ~ spl57_1 ),
    inference(avatar_component_clause,[],[f542]) ).

fof(f575,plain,
    spl57_1,
    inference(avatar_split_clause,[],[f389,f542]) ).

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

fof(f952,plain,
    ( nil = sK56
    | ~ spl57_24 ),
    inference(avatar_component_clause,[],[f950]) ).

fof(f956,plain,
    ( nil = sK56
    | ~ ssList(nil)
    | ~ ssList(sK56) ),
    inference(resolution,[],[f387,f501]) ).

fof(f961,plain,
    ( nil = sK56
    | ~ ssList(sK56)
    | ~ spl57_1 ),
    inference(forward_subsumption_resolution,[],[f956,f543]) ).

fof(f962,plain,
    ( nil = sK56
    | ~ spl57_1 ),
    inference(forward_subsumption_resolution,[],[f961,f499]) ).

fof(f963,plain,
    ( spl57_24
    | ~ spl57_1 ),
    inference(avatar_split_clause,[],[f962,f542,f950]) ).

fof(f966,plain,
    ( ~ cyclefreeP(nil)
    | ~ spl57_24 ),
    inference(superposition,[],[f504,f952]) ).

fof(f990,plain,
    ( $false
    | ~ spl57_24 ),
    inference(forward_subsumption_resolution,[],[f966,f446]) ).

fof(f991,plain,
    ~ spl57_24,
    inference(avatar_contradiction_clause,[],[f990]) ).

cnf(s9,plain,
    spl57_1,
    inference(sat_conversion,[],[f575]) ).

cnf(s23,plain,
    ( ~ spl57_1
    | spl57_24 ),
    inference(sat_conversion,[],[f963]) ).

cnf(s30,plain,
    ~ spl57_24,
    inference(sat_conversion,[],[f991]) ).

cnf(s31,plain,
    ~ spl57_1,
    inference(rat,[],[s23,s30]) ).

cnf(s33,plain,
    $false,
    inference(rat,[],[s9,s31]) ).

fof(f992,plain,
    $false,
    inference(avatar_sat_refutation,[],[s33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC133+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39  % Computer : n007.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Mon Sep 28 08:01:56 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42  Running first-order model finding
% 0.13/0.42  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.17/0.49  % (2237114)Will run a generic schedule for satisfiability detection.
% 0.17/0.49  % (2237121)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2627070055:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.49  % (2237120)% WARNING: option uhcvi not known.
% 0.17/0.49  % (2237119)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2783328644_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.49  % (2237123)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=917993877:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.49  % (2237122)dis+10_1_sil=32000:sp=arity:random_seed=2084595015:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.49  % (2237120)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=82695819:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.49  % (2237124)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=873570562:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.49  % (2237125)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2637458449:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.49  % (2237122) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2237114-2237122"...
% 0.17/0.49  % TRYING [1]
% 0.17/0.49  % (2237120) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2237114-2237120"...
% 0.17/0.49  % TRYING [2]
% 0.17/0.49  % (2237122)...printing done.
% 0.17/0.49  % (2237120)...printing done.
% 0.17/0.49  % (2237123) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2237114-2237123"...
% 0.17/0.49  % (2237122)Refutation found. Thanks to Tanya!
% 0.17/0.49  % SZS status Theorem for theBenchmark
% 0.17/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.49  % (2237122)------------------------------
% 0.17/0.49  % (2237122)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.49  % (2237122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.49  % (2237122)CaDiCaL version: 2.1.3
% 0.17/0.49  % (2237122)Termination reason: Refutation
% 0.17/0.49  % (2237122)Time elapsed: 0.014 s
% 0.17/0.49  % (2237122)Peak memory usage: 13 MB
% 0.17/0.49  % (2237122)Instructions burned: 22 (million)
% 0.17/0.49  % (2237114)Success in time 0.054 s
% 0.17/0.49  % Vampire exiting
%------------------------------------------------------------------------------