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

% Computer : n008.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:46 PM UTC 2026

% Result   : Theorem 0.19s 0.46s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   60 (  24 unt;   6 def)
%            Number of atoms       :  153 (  19 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  156 (  63   ~;  53   |;  22   &)
%                                         (   8 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   7 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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

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

fof(f39,axiom,
    ~ singletonP(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax39) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ~ neq(X1,nil)
                    | ~ segmentP(X3,X2)
                    | ( ~ singletonP(X2)
                      & neq(X3,nil) )
                    | ( neq(X0,nil)
                      & segmentP(X1,X0) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/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)
                      | ~ segmentP(X3,X2)
                      | ( ~ singletonP(X2)
                        & neq(X3,nil) )
                      | ( neq(X0,nil)
                        & segmentP(X1,X0) ) ) ) ) ) ),
    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(X1,nil)
                  & segmentP(X3,X2)
                  & ( singletonP(X2)
                    | ~ neq(X3,nil) )
                  & ( ~ neq(X0,nil)
                    | ~ segmentP(X1,X0) )
                  & 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)
                  & segmentP(X3,X2)
                  & ( singletonP(X2)
                    | ~ neq(X3,nil) )
                  & ( ~ neq(X0,nil)
                    | ~ segmentP(X1,X0) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f303,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | X0 = X1
      | neq(X0,X1) ),
    inference(cnf_transformation,[],[f118]) ).

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

fof(f337,plain,
    ~ singletonP(nil),
    inference(cnf_transformation,[],[f39]) ).

fof(f411,plain,
    ( ~ neq(sK50,nil)
    | singletonP(sK49) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f412,plain,
    ( ~ segmentP(sK48,sK47)
    | ~ neq(sK47,nil) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f414,plain,
    segmentP(sK50,sK49),
    inference(cnf_transformation,[],[f222]) ).

fof(f415,plain,
    neq(sK48,nil),
    inference(cnf_transformation,[],[f222]) ).

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

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

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

fof(f423,plain,
    neq(sK50,nil),
    inference(definition_unfolding,[],[f415,f417]) ).

fof(f424,plain,
    ( ~ segmentP(sK50,sK49)
    | ~ neq(sK49,nil) ),
    inference(definition_unfolding,[],[f412,f417,f416,f416]) ).

fof(f513,plain,
    ! [X0,X1] :
      ( ~ neq(X0,X1)
      | ~ ssList(X1)
      | X0 = X1
      | ~ ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f303]) ).

fof(f540,plain,
    singletonP(nil),
    inference(consistent_polarity_flipping,[],[f337]) ).

fof(f596,plain,
    ~ neq(sK50,nil),
    inference(consistent_polarity_flipping,[],[f423]) ).

fof(f597,plain,
    ~ segmentP(sK50,sK49),
    inference(consistent_polarity_flipping,[],[f414]) ).

fof(f598,plain,
    ( segmentP(sK50,sK49)
    | neq(sK49,nil) ),
    inference(consistent_polarity_flipping,[],[f424]) ).

fof(f599,plain,
    ( neq(sK50,nil)
    | ~ singletonP(sK49) ),
    inference(consistent_polarity_flipping,[],[f411]) ).

fof(f608,definition,
    ( spl51_1
  <=> singletonP(sK49) ),
    introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).

fof(f610,plain,
    ( ~ singletonP(sK49)
    | spl51_1 ),
    inference(avatar_component_clause,[],[f608]) ).

fof(f612,definition,
    ( spl51_2
  <=> neq(sK50,nil) ),
    introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).

fof(f615,plain,
    ( ~ spl51_1
    | spl51_2 ),
    inference(avatar_split_clause,[],[f599,f612,f608]) ).

fof(f617,definition,
    ( spl51_3
  <=> neq(sK49,nil) ),
    introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).

fof(f619,plain,
    ( neq(sK49,nil)
    | ~ spl51_3 ),
    inference(avatar_component_clause,[],[f617]) ).

fof(f621,definition,
    ( spl51_4
  <=> segmentP(sK50,sK49) ),
    introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).

fof(f624,plain,
    ( spl51_3
    | spl51_4 ),
    inference(avatar_split_clause,[],[f598,f621,f617]) ).

fof(f625,plain,
    ~ spl51_4,
    inference(avatar_split_clause,[],[f597,f621]) ).

fof(f626,plain,
    ~ spl51_2,
    inference(avatar_split_clause,[],[f596,f612]) ).

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

fof(f633,plain,
    ( ssList(nil)
    | ~ spl51_6 ),
    inference(avatar_component_clause,[],[f632]) ).

fof(f661,plain,
    spl51_6,
    inference(avatar_split_clause,[],[f306,f632]) ).

fof(f754,definition,
    ( spl51_15
  <=> nil = sK49 ),
    introduced(definition,[new_symbols(definition,[spl51_15])],[avatar_definition]) ).

fof(f756,plain,
    ( nil = sK49
    | ~ spl51_15 ),
    inference(avatar_component_clause,[],[f754]) ).

fof(f813,plain,
    ( ~ singletonP(nil)
    | spl51_1
    | ~ spl51_15 ),
    inference(superposition,[],[f610,f756]) ).

fof(f819,plain,
    ( $false
    | spl51_1
    | ~ spl51_15 ),
    inference(forward_subsumption_resolution,[],[f813,f540]) ).

fof(f820,plain,
    ( spl51_1
    | ~ spl51_15 ),
    inference(avatar_contradiction_clause,[],[f819]) ).

fof(f821,plain,
    ( ~ ssList(nil)
    | nil = sK49
    | ~ ssList(sK49)
    | ~ spl51_3 ),
    inference(resolution,[],[f513,f619]) ).

fof(f826,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | ~ spl51_3
    | ~ spl51_6 ),
    inference(forward_subsumption_resolution,[],[f821,f633]) ).

fof(f827,plain,
    ( nil = sK49
    | ~ spl51_3
    | ~ spl51_6 ),
    inference(forward_subsumption_resolution,[],[f826,f418]) ).

fof(f828,plain,
    ( spl51_15
    | ~ spl51_3
    | ~ spl51_6 ),
    inference(avatar_split_clause,[],[f827,f632,f617,f754]) ).

cnf(s1,plain,
    ( ~ spl51_1
    | spl51_2 ),
    inference(sat_conversion,[],[f615]) ).

cnf(s2,plain,
    ( spl51_3
    | spl51_4 ),
    inference(sat_conversion,[],[f624]) ).

cnf(s3,plain,
    ~ spl51_4,
    inference(sat_conversion,[],[f625]) ).

cnf(s4,plain,
    ~ spl51_2,
    inference(sat_conversion,[],[f626]) ).

cnf(s13,plain,
    spl51_6,
    inference(sat_conversion,[],[f661]) ).

cnf(s19,plain,
    ( spl51_1
    | ~ spl51_15 ),
    inference(sat_conversion,[],[f820]) ).

cnf(s20,plain,
    ( ~ spl51_3
    | ~ spl51_6
    | spl51_15 ),
    inference(sat_conversion,[],[f828]) ).

cnf(s25,plain,
    spl51_3,
    inference(rat,[],[s2,s3]) ).

cnf(s26,plain,
    spl51_15,
    inference(rat,[],[s20,s13,s25]) ).

cnf(s27,plain,
    spl51_1,
    inference(rat,[],[s19,s26]) ).

cnf(s28,plain,
    $false,
    inference(rat,[],[s1,s4,s27]) ).

fof(f829,plain,
    $false,
    inference(avatar_sat_refutation,[],[s28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC127+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37  % Computer : n008.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 28 08:03:39 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40  Running first-order model finding
% 0.09/0.40  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  % (2091076)Will run a generic schedule for satisfiability detection.
% 0.19/0.46  % (2091081)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2615834091_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.46  % (2091082)% WARNING: option uhcvi not known.
% 0.19/0.46  % (2091084)dis+10_1_sil=32000:sp=arity:random_seed=2335071960:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.46  % (2091083)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2783281193:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.46  % (2091085)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2087694069:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.46  % TRYING [1]
% 0.19/0.46  % (2091086)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1261017162:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.46  % (2091082)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2880108234:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.46  % (2091087)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=982765720:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.46  % TRYING [2]
% 0.19/0.46  % TRYING [3]
% 0.19/0.46  % (2091082) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2091076-2091082"...
% 0.19/0.46  % TRYING [4]
% 0.19/0.46  % (2091082)...printing done.
% 0.19/0.46  % (2091084) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2091076-2091084"...
% 0.19/0.46  % (2091082)Refutation found. Thanks to Tanya!
% 0.19/0.46  % SZS status Theorem for theBenchmark
% 0.19/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46  % (2091082)------------------------------
% 0.19/0.46  % (2091082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.46  % (2091082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.46  % (2091082)CaDiCaL version: 2.1.3
% 0.19/0.46  % (2091082)Termination reason: Refutation
% 0.19/0.46  % (2091082)Time elapsed: 0.013 s
% 0.19/0.46  % (2091082)Peak memory usage: 13 MB
% 0.19/0.46  % (2091082)Instructions burned: 18 (million)
% 0.19/0.46  % (2091076)Success in time 0.049 s
% 0.19/0.46  % Vampire exiting
%------------------------------------------------------------------------------