↑ 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  : SWC392+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 : 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:51 PM UTC 2026

% Result   : Theorem 0.27s 0.48s
% Output   : Refutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   64 (  19 unt;   5 def)
%            Number of atoms       :  222 (  45 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  242 (  84   ~; 101   |;  34   &)
%                                         (   7 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   6 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn  34   !;  14   ?)

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

fof(f37,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ! [X2] :
              ( ssList(X2)
             => ( memberP(cons(X1,X2),X0)
              <=> ( X0 = X1
                  | memberP(X2,X0) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).

fof(f38,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).

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

fof(f147,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( memberP(cons(X1,X2),X0)
              <=> ( X0 = X1
                  | memberP(X2,X0) ) )
              | ~ ssList(X2) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f148,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ? [X4] :
                      ( memberP(X0,X4)
                      & ~ memberP(X1,X4)
                      & ssItem(X4) )
                  & ( ? [X5] :
                        ( cons(X5,nil) = X2
                        & memberP(X3,X5)
                        & ! [X6] :
                            ( ~ ssItem(X6)
                            | X5 = X6
                            | ~ memberP(X3,X6)
                            | ~ leq(X6,X5) )
                        & ssItem(X5) )
                    | ( 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
                  & ? [X4] :
                      ( memberP(X0,X4)
                      & ~ memberP(X1,X4)
                      & ssItem(X4) )
                  & ( ? [X5] :
                        ( cons(X5,nil) = X2
                        & memberP(X3,X5)
                        & ! [X6] :
                            ( ~ ssItem(X6)
                            | X5 = X6
                            | ~ memberP(X3,X6)
                            | ~ leq(X6,X5) )
                        & ssItem(X5) )
                    | ( nil = X3
                      & nil = X2 ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

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

fof(f333,plain,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | ~ ssList(X2)
      | memberP(X2,X0)
      | X0 = X1
      | ~ memberP(cons(X1,X2),X0) ),
    inference(cnf_transformation,[],[f147]) ).

fof(f336,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | ~ memberP(nil,X0) ),
    inference(cnf_transformation,[],[f148]) ).

fof(f416,plain,
    ( nil = sK49
    | ssItem(sK52) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f417,plain,
    ( nil = sK49
    | memberP(sK50,sK52) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f418,plain,
    ( nil = sK49
    | sK49 = cons(sK52,nil) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f419,plain,
    ssItem(sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f420,plain,
    ~ memberP(sK48,sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f421,plain,
    memberP(sK47,sK51),
    inference(cnf_transformation,[],[f222]) ).

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

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

fof(f430,plain,
    memberP(sK49,sK51),
    inference(definition_unfolding,[],[f421,f423]) ).

fof(f431,plain,
    ~ memberP(sK50,sK51),
    inference(definition_unfolding,[],[f420,f424]) ).

fof(f533,plain,
    ! [X2,X0,X1] :
      ( ~ memberP(cons(X1,X2),X0)
      | ssItem(X1)
      | ~ ssList(X2)
      | memberP(X2,X0)
      | X0 = X1
      | ssItem(X0) ),
    inference(consistent_polarity_flipping,[],[f333]) ).

fof(f534,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ssItem(X0) ),
    inference(consistent_polarity_flipping,[],[f336]) ).

fof(f583,plain,
    ~ ssItem(sK51),
    inference(consistent_polarity_flipping,[],[f419]) ).

fof(f584,plain,
    ( nil = sK49
    | ~ ssItem(sK52) ),
    inference(consistent_polarity_flipping,[],[f416]) ).

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

fof(f601,plain,
    ( nil = sK49
    | ~ spl53_2 ),
    inference(avatar_component_clause,[],[f599]) ).

fof(f609,definition,
    ( spl53_4
  <=> ssItem(sK52) ),
    introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).

fof(f611,plain,
    ( ~ ssItem(sK52)
    | spl53_4 ),
    inference(avatar_component_clause,[],[f609]) ).

fof(f614,definition,
    ( spl53_5
  <=> memberP(sK50,sK52) ),
    introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).

fof(f616,plain,
    ( memberP(sK50,sK52)
    | ~ spl53_5 ),
    inference(avatar_component_clause,[],[f614]) ).

fof(f619,definition,
    ( spl53_6
  <=> sK49 = cons(sK52,nil) ),
    introduced(definition,[new_symbols(definition,[spl53_6])],[avatar_definition]) ).

fof(f621,plain,
    ( sK49 = cons(sK52,nil)
    | ~ spl53_6 ),
    inference(avatar_component_clause,[],[f619]) ).

fof(f623,plain,
    ( ~ spl53_4
    | spl53_2 ),
    inference(avatar_split_clause,[],[f584,f599,f609]) ).

fof(f624,plain,
    ( spl53_5
    | spl53_2 ),
    inference(avatar_split_clause,[],[f417,f599,f614]) ).

fof(f625,plain,
    ( spl53_6
    | spl53_2 ),
    inference(avatar_split_clause,[],[f418,f599,f619]) ).

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

fof(f632,plain,
    ( ssList(nil)
    | ~ spl53_8 ),
    inference(avatar_component_clause,[],[f631]) ).

fof(f660,plain,
    spl53_8,
    inference(avatar_split_clause,[],[f306,f631]) ).

fof(f661,plain,
    ( memberP(nil,sK51)
    | ~ spl53_2 ),
    inference(superposition,[],[f430,f601]) ).

fof(f672,plain,
    ( ssItem(sK51)
    | ~ spl53_2 ),
    inference(resolution,[],[f534,f661]) ).

fof(f673,plain,
    ( $false
    | ~ spl53_2 ),
    inference(forward_subsumption_resolution,[],[f672,f583]) ).

fof(f674,plain,
    ~ spl53_2,
    inference(avatar_contradiction_clause,[],[f673]) ).

fof(f1912,plain,
    ( ! [X0] :
        ( ~ memberP(sK49,X0)
        | ssItem(sK52)
        | ~ ssList(nil)
        | memberP(nil,X0)
        | sK52 = X0
        | ssItem(X0) )
    | ~ spl53_6 ),
    inference(superposition,[],[f533,f621]) ).

fof(f1918,plain,
    ( ! [X0] :
        ( ~ memberP(sK49,X0)
        | ~ ssList(nil)
        | memberP(nil,X0)
        | sK52 = X0
        | ssItem(X0) )
    | spl53_4
    | ~ spl53_6 ),
    inference(forward_subsumption_resolution,[],[f1912,f611]) ).

fof(f1921,plain,
    ( ! [X0] :
        ( ~ memberP(sK49,X0)
        | memberP(nil,X0)
        | sK52 = X0
        | ssItem(X0) )
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f1918,f632]) ).

fof(f1923,plain,
    ( ! [X0] :
        ( ~ memberP(sK49,X0)
        | sK52 = X0
        | ssItem(X0) )
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f1921,f534]) ).

fof(f3302,plain,
    ( sK51 = sK52
    | ssItem(sK51)
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(resolution,[],[f1923,f430]) ).

fof(f3304,plain,
    ( sK51 = sK52
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f3302,f583]) ).

fof(f4076,plain,
    ( ~ memberP(sK50,sK52)
    | spl53_4
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(superposition,[],[f431,f3304]) ).

fof(f4087,plain,
    ( $false
    | spl53_4
    | ~ spl53_5
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(forward_subsumption_resolution,[],[f4076,f616]) ).

fof(f4088,plain,
    ( spl53_4
    | ~ spl53_5
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(avatar_contradiction_clause,[],[f4087]) ).

cnf(s6,plain,
    ( spl53_2
    | ~ spl53_4 ),
    inference(sat_conversion,[],[f623]) ).

cnf(s7,plain,
    ( spl53_2
    | spl53_5 ),
    inference(sat_conversion,[],[f624]) ).

cnf(s8,plain,
    ( spl53_2
    | spl53_6 ),
    inference(sat_conversion,[],[f625]) ).

cnf(s17,plain,
    spl53_8,
    inference(sat_conversion,[],[f660]) ).

cnf(s21,plain,
    ~ spl53_2,
    inference(sat_conversion,[],[f674]) ).

cnf(s251,plain,
    ( spl53_4
    | ~ spl53_5
    | ~ spl53_6
    | ~ spl53_8 ),
    inference(sat_conversion,[],[f4088]) ).

cnf(s302,plain,
    spl53_6,
    inference(rat,[],[s8,s21]) ).

cnf(s303,plain,
    spl53_5,
    inference(rat,[],[s7,s21]) ).

cnf(s304,plain,
    spl53_4,
    inference(rat,[],[s251,s17,s302,s303]) ).

cnf(s305,plain,
    $false,
    inference(rat,[],[s6,s304,s21]) ).

fof(f4089,plain,
    $false,
    inference(avatar_sat_refutation,[],[s305]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC392+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.25  % Computer : n015.cluster.edu
% 0.10/0.25  % Model    : x86_64 x86_64
% 0.10/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25  % Memory   : 8046.5625MB
% 0.10/0.25  % OS       : Linux 6.8.0-71-generic
% 0.10/0.25  % CPULimit : 300
% 0.10/0.25  % WCLimit  : 300
% 0.10/0.25  % DateTime : Mon Sep 28 09:29:47 UTC 2026
% 0.10/0.26  % CPUTime  : 
% 0.10/0.26  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.31  Running first-order model finding
% 0.24/0.31  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.27/0.48  % (2499437)Will run a generic schedule for satisfiability detection.
% 0.27/0.48  % (2499447)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3563664090:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.27/0.48  % (2499443)% WARNING: option uhcvi not known.
% 0.27/0.48  % (2499442)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3182718224_2999 on theBenchmark for (2999ds/0Mi)
% 0.27/0.48  % (2499443)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1213378817:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.27/0.48  % (2499445)dis+10_1_sil=32000:sp=arity:random_seed=3947205708:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.27/0.48  % (2499448)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3634432009:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.27/0.48  % (2499446)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3146266142:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.27/0.48  % (2499444)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2426435584:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.27/0.48  % TRYING [1]
% 0.27/0.48  % TRYING [2]
% 0.27/0.48  % TRYING [3]
% 0.27/0.48  % (2499447)Instruction limit reached! 
% 0.27/0.48  % (2499447)------------------------------
% 0.27/0.48  % (2499447)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.48  % (2499447)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.48  % (2499447)CaDiCaL version: 2.1.3
% 0.27/0.48  % (2499447)Termination reason: Instruction limit
% 0.27/0.48  % (2499447)Termination phase: Saturation
% 0.27/0.48  % (2499447)Time elapsed: 0.065 s
% 0.27/0.48  % (2499447)Peak memory usage: 14 MB
% 0.27/0.48  % (2499447)Instructions burned: 132 (million)
% 0.27/0.48  % TRYING [4]
% 0.27/0.48  % (2499456)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1593898213:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.27/0.48  % TRYING [1]
% 0.27/0.48  % TRYING [2]
% 0.27/0.48  % TRYING [3]
% 0.27/0.48  % (2499445)Instruction limit reached! 
% 0.27/0.48  % (2499445)------------------------------
% 0.27/0.48  % (2499445)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.48  % (2499445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.48  % (2499445)CaDiCaL version: 2.1.3
% 0.27/0.48  % (2499445)Termination reason: Instruction limit
% 0.27/0.48  % (2499445)Termination phase: Saturation
% 0.27/0.48  % (2499445)Time elapsed: 0.098 s
% 0.27/0.48  % (2499445)Peak memory usage: 13 MB
% 0.27/0.48  % (2499445)Instructions burned: 103 (million)
% 0.27/0.48  % (2499443) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2499437-2499443"...
% 0.27/0.48  % (2499443)...printing done.
% 0.27/0.48  % (2499446)Instruction limit reached! 
% 0.27/0.48  % (2499446)------------------------------
% 0.27/0.48  % (2499446)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.48  % (2499446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.48  % (2499446)CaDiCaL version: 2.1.3
% 0.27/0.48  % (2499446)Termination reason: Instruction limit
% 0.27/0.48  % (2499446)Termination phase: Saturation
% 0.27/0.48  % (2499446)Time elapsed: 0.113 s
% 0.27/0.48  % (2499446)Peak memory usage: 13 MB
% 0.27/0.48  % (2499446)Instructions burned: 117 (million)
% 0.27/0.48  % TRYING [4]
% 0.27/0.48  % (2499443)Refutation found. Thanks to Tanya!
% 0.27/0.48  % SZS status Theorem for theBenchmark
% 0.27/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.48  % (2499443)------------------------------
% 0.27/0.48  % (2499443)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.48  % (2499443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.48  % (2499443)CaDiCaL version: 2.1.3
% 0.27/0.48  % (2499443)Termination reason: Refutation
% 0.27/0.48  % (2499443)Time elapsed: 0.111 s
% 0.27/0.48  % (2499443)Peak memory usage: 15 MB
% 0.27/0.48  % (2499443)Instructions burned: 114 (million)
% 0.27/0.48  % (2499437)Success in time 0.154 s
% 0.27/0.48  % Vampire exiting
%------------------------------------------------------------------------------