↑ 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  : SWC373+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 : n002.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:46 PM UTC 2026

% Result   : Theorem 0.89s 0.45s
% Output   : Refutation 0.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   52 (  17 unt;   1 def)
%            Number of atoms       :  153 (  20 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  173 (  72   ~;  65   |;  16   &)
%                                         (   3 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   2 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   57 (   0 sgn  47   !;  10   ?)

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

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

fof(f55,axiom,
    ! [X0] :
      ( ssList(X0)
     => segmentP(X0,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).

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

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

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

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

fof(f172,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f55]) ).

fof(f173,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( segmentP(app(app(X2,X0),X3),X1)
                  | ~ segmentP(X0,X1)
                  | ~ ssList(X3) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f56]) ).

fof(f174,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( segmentP(app(app(X2,X0),X3),X1)
                  | ~ segmentP(X0,X1)
                  | ~ ssList(X3) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f173]) ).

fof(f201,plain,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f84]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & rearsegP(X3,X2)
                  & ~ 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
                  & rearsegP(X3,X2)
                  & ~ segmentP(X1,X0)
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f238,plain,
    ! [X0,X1] :
      ( ~ rearsegP(X0,X1)
      | ~ ssList(X1)
      | app(sK6(X0,X1),X1) = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f102]) ).

fof(f239,plain,
    ! [X0,X1] :
      ( ssList(sK6(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ rearsegP(X0,X1) ),
    inference(cnf_transformation,[],[f102]) ).

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

fof(f357,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f172]) ).

fof(f358,plain,
    ! [X2,X3,X0,X1] :
      ( ~ segmentP(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | ~ ssList(X0)
      | segmentP(app(app(X2,X0),X3),X1) ),
    inference(cnf_transformation,[],[f174]) ).

fof(f397,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(X0,nil) = X0 ),
    inference(cnf_transformation,[],[f201]) ).

fof(f411,plain,
    ssList(sK50),
    inference(cnf_transformation,[],[f222]) ).

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

fof(f413,plain,
    rearsegP(sK50,sK49),
    inference(cnf_transformation,[],[f222]) ).

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

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

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

fof(f421,plain,
    ~ segmentP(sK50,sK49),
    inference(definition_unfolding,[],[f412,f415,f414]) ).

fof(f528,plain,
    ( ~ ssList(sK49)
    | sK50 = app(sK6(sK50,sK49),sK49)
    | ~ ssList(sK50) ),
    inference(resolution,[],[f238,f413]) ).

fof(f533,plain,
    ( sK50 = app(sK6(sK50,sK49),sK49)
    | ~ ssList(sK50) ),
    inference(forward_subsumption_resolution,[],[f528,f416]) ).

fof(f536,plain,
    sK50 = app(sK6(sK50,sK49),sK49),
    inference(forward_subsumption_resolution,[],[f533,f411]) ).

fof(f588,definition,
    ( spl51_14
  <=> ssList(sK6(sK50,sK49)) ),
    introduced(definition,[new_symbols(definition,[spl51_14])],[avatar_definition]) ).

fof(f589,plain,
    ( ssList(sK6(sK50,sK49))
    | ~ spl51_14 ),
    inference(avatar_component_clause,[],[f588]) ).

fof(f590,plain,
    ( ~ ssList(sK6(sK50,sK49))
    | spl51_14 ),
    inference(avatar_component_clause,[],[f588]) ).

fof(f595,plain,
    ( ~ ssList(sK49)
    | ~ ssList(sK50)
    | ~ rearsegP(sK50,sK49)
    | spl51_14 ),
    inference(resolution,[],[f590,f239]) ).

fof(f596,plain,
    ( ~ ssList(sK50)
    | ~ rearsegP(sK50,sK49)
    | spl51_14 ),
    inference(forward_subsumption_resolution,[],[f595,f416]) ).

fof(f597,plain,
    ( ~ rearsegP(sK50,sK49)
    | spl51_14 ),
    inference(forward_subsumption_resolution,[],[f596,f411]) ).

fof(f598,plain,
    ( $false
    | spl51_14 ),
    inference(forward_subsumption_resolution,[],[f597,f413]) ).

fof(f599,plain,
    spl51_14,
    inference(avatar_contradiction_clause,[],[f598]) ).

fof(f1082,plain,
    sK50 = app(sK50,nil),
    inference(resolution,[],[f397,f411]) ).

fof(f1165,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | segmentP(app(app(X1,X0),X2),X0)
      | ~ ssList(X0) ),
    inference(resolution,[],[f358,f357]) ).

fof(f1170,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X1,X0),X2),X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0) ),
    inference(duplicate_literal_removal,[],[f1165]) ).

fof(f2607,plain,
    ! [X0] :
      ( segmentP(app(sK50,X0),sK49)
      | ~ ssList(sK6(sK50,sK49))
      | ~ ssList(X0)
      | ~ ssList(sK49) ),
    inference(superposition,[],[f1170,f536]) ).

fof(f2623,plain,
    ( ! [X0] :
        ( segmentP(app(sK50,X0),sK49)
        | ~ ssList(X0)
        | ~ ssList(sK49) )
    | ~ spl51_14 ),
    inference(forward_subsumption_resolution,[],[f2607,f589]) ).

fof(f2644,plain,
    ( ! [X0] :
        ( segmentP(app(sK50,X0),sK49)
        | ~ ssList(X0) )
    | ~ spl51_14 ),
    inference(forward_subsumption_resolution,[],[f2623,f416]) ).

fof(f3326,plain,
    ( segmentP(sK50,sK49)
    | ~ ssList(nil)
    | ~ spl51_14 ),
    inference(superposition,[],[f2644,f1082]) ).

fof(f3327,plain,
    ( ~ ssList(nil)
    | ~ spl51_14 ),
    inference(forward_subsumption_resolution,[],[f3326,f421]) ).

fof(f3332,plain,
    ( $false
    | ~ spl51_14 ),
    inference(forward_subsumption_resolution,[],[f3327,f306]) ).

fof(f3333,plain,
    ~ spl51_14,
    inference(avatar_contradiction_clause,[],[f3332]) ).

cnf(s12,plain,
    spl51_14,
    inference(sat_conversion,[],[f599]) ).

cnf(s115,plain,
    ~ spl51_14,
    inference(sat_conversion,[],[f3333]) ).

cnf(s128,plain,
    $false,
    inference(rat,[],[s12,s115]) ).

fof(f3334,plain,
    $false,
    inference(avatar_sat_refutation,[],[s128]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC373+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.08/0.20  % Computer : n002.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 09:23:07 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  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.89/0.45  % (229435)Will run a generic schedule for satisfiability detection.
% 0.89/0.45  % (229451)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4010403956:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.89/0.45  % (229446)% WARNING: option uhcvi not known.
% 0.89/0.45  % (229448)dis+10_1_sil=32000:sp=arity:random_seed=1726525717:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.89/0.45  % (229449)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2932919682:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.89/0.45  % (229445)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2935441382_2999 on theBenchmark for (2999ds/0Mi)
% 0.89/0.45  % (229446)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=743132016:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.89/0.45  % (229447)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2681998446:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.89/0.45  % (229450)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1328787871:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.89/0.45  % TRYING [1]
% 0.89/0.45  % TRYING [2]
% 0.89/0.45  % TRYING [3]
% 0.89/0.45  % TRYING [4]
% 0.89/0.45  % (229451)Instruction limit reached! 
% 0.89/0.45  % (229451)------------------------------
% 0.89/0.45  % (229451)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.45  % (229451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.45  % (229451)CaDiCaL version: 2.1.3
% 0.89/0.45  % (229451)Termination reason: Instruction limit
% 0.89/0.45  % (229451)Termination phase: Saturation
% 0.89/0.45  % (229451)Time elapsed: 0.058 s
% 0.89/0.45  % (229451)Peak memory usage: 15 MB
% 0.89/0.45  % (229451)Instructions burned: 161 (million)
% 0.89/0.45  % (229448)Instruction limit reached! 
% 0.89/0.45  % (229448)------------------------------
% 0.89/0.45  % (229448)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.45  % (229448)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.45  % (229448)CaDiCaL version: 2.1.3
% 0.89/0.45  % (229448)Termination reason: Instruction limit
% 0.89/0.45  % (229448)Termination phase: Saturation
% 0.89/0.45  % (229448)Time elapsed: 0.063 s
% 0.89/0.45  % (229448)Peak memory usage: 13 MB
% 0.89/0.45  % (229448)Instructions burned: 104 (million)
% 0.89/0.45  % (229487)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1211482799:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.89/0.45  % TRYING [1]
% 0.89/0.45  % (229449)Instruction limit reached! 
% 0.89/0.45  % (229449)------------------------------
% 0.89/0.45  % (229449)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.45  % (229449)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.45  % (229449)CaDiCaL version: 2.1.3
% 0.89/0.45  % (229449)Termination reason: Instruction limit
% 0.89/0.45  % (229449)Termination phase: Saturation
% 0.89/0.45  % (229449)Time elapsed: 0.070 s
% 0.89/0.45  % (229449)Peak memory usage: 13 MB
% 0.89/0.45  % (229449)Instructions burned: 117 (million)
% 0.89/0.45  % TRYING [2]
% 0.89/0.45  % TRYING [3]
% 0.89/0.45  % (229450)Instruction limit reached! 
% 0.89/0.45  % (229450)------------------------------
% 0.89/0.45  % (229450)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.45  % (229450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.45  % (229450)CaDiCaL version: 2.1.3
% 0.89/0.45  % (229450)Termination reason: Instruction limit
% 0.89/0.45  % (229450)Termination phase: Saturation
% 0.89/0.45  % (229450)Time elapsed: 0.076 s
% 0.89/0.45  % (229450)Peak memory usage: 14 MB
% 0.89/0.45  % (229450)Instructions burned: 132 (million)
% 0.89/0.45  % TRYING [4]
% 0.89/0.45  % (229498)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4035320135:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.89/0.45  % TRYING [5]
% 0.89/0.45  % (229502)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1204304315:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.89/0.45  % (229503)ott-21_1_sil=16000:fs=off:random_seed=2684116947:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.89/0.45  % TRYING [5]
% 0.89/0.45  % (229498)Instruction limit reached! 
% 0.89/0.45  % (229498)------------------------------
% 0.89/0.45  % (229498)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.45  % (229498)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.45  % (229498)CaDiCaL version: 2.1.3
% 0.89/0.45  % (229498)Termination reason: Instruction limit
% 0.89/0.45  % (229498)Termination phase: Saturation
% 0.89/0.45  % (229498)Time elapsed: 0.074 s
% 0.89/0.45  % (229498)Peak memory usage: 13 MB
% 0.89/0.45  % (229498)Instructions burned: 132 (million)
% 0.89/0.45  % (229502) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-229435-229502"...
% 0.89/0.45  % (229502)...printing done.
% 0.89/0.45  % (229502)Refutation found. Thanks to Tanya!
% 0.89/0.45  % SZS status Theorem for theBenchmark
% 0.89/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.89/0.45  % (229502)------------------------------
% 0.89/0.45  % (229502)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.45  % (229502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.45  % (229502)CaDiCaL version: 2.1.3
% 0.89/0.45  % (229502)Termination reason: Refutation
% 0.89/0.45  % (229502)Time elapsed: 0.077 s
% 0.89/0.45  % (229502)Peak memory usage: 15 MB
% 0.89/0.45  % (229502)Instructions burned: 102 (million)
% 0.89/0.45  % (229435)Success in time 0.21 s
% 0.89/0.45  % Vampire exiting
%------------------------------------------------------------------------------