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

% Computer : n019.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 12:36:00 PM UTC 2026

% Result   : Theorem 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   40 (  13 unt;   2 def)
%            Number of atoms       :   99 (   1 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   87 (  28   ~;  30   |;  15   &)
%                                         (   4 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   3 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f24,axiom,
    ! [X0] :
      ( aIdeal0(X0)
    <=> ( aSet0(X0)
        & ! [X1] :
            ( aElementOf0(X1,X0)
           => ( ! [X2] :
                  ( aElementOf0(X2,X0)
                 => aElementOf0(sdtpldt0(X1,X2),X0) )
              & ! [X2] :
                  ( aElement0(X2)
                 => aElementOf0(sdtasdt0(X2,X1),X0) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).

fof(f25,axiom,
    ( aIdeal0(xI)
    & aIdeal0(xJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).

fof(f26,axiom,
    ( aElementOf0(xx,sdtpldt1(xI,xJ))
    & aElementOf0(xy,sdtpldt1(xI,xJ))
    & aElement0(xz) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__901) ).

fof(f27,axiom,
    ( aElementOf0(xk,xI)
    & aElementOf0(xl,xJ)
    & xx = sdtpldt0(xk,xl) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__934) ).

fof(f30,conjecture,
    ( aElementOf0(sdtasdt0(xz,xk),xI)
    & aElementOf0(sdtasdt0(xz,xl),xJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f31,negated_conjecture,
    ~ ( aElementOf0(sdtasdt0(xz,xk),xI)
      & aElementOf0(sdtasdt0(xz,xl),xJ) ),
    inference(negated_conjecture,[status(cth)],[f30]) ).

fof(f33,plain,
    ! [X0] :
      ( aIdeal0(X0)
    <=> ( aSet0(X0)
        & ! [X1] :
            ( aElementOf0(X1,X0)
           => ( ! [X2] :
                  ( aElementOf0(X2,X0)
                 => aElementOf0(sdtpldt0(X1,X2),X0) )
              & ! [X3] :
                  ( aElement0(X3)
                 => aElementOf0(sdtasdt0(X3,X1),X0) ) ) ) ) ),
    inference(rectify,[],[f24]) ).

fof(f34,plain,
    ! [X0] :
      ( aIdeal0(X0)
     => ( aSet0(X0)
        & ! [X1] :
            ( aElementOf0(X1,X0)
           => ( ! [X2] :
                  ( aElementOf0(X2,X0)
                 => aElementOf0(sdtpldt0(X1,X2),X0) )
              & ! [X3] :
                  ( aElement0(X3)
                 => aElementOf0(sdtasdt0(X3,X1),X0) ) ) ) ) ),
    inference(unused_predicate_definition_removal,[],[f33]) ).

fof(f66,plain,
    ! [X0] :
      ( ( aSet0(X0)
        & ! [X1] :
            ( ( ! [X2] :
                  ( aElementOf0(sdtpldt0(X1,X2),X0)
                  | ~ aElementOf0(X2,X0) )
              & ! [X3] :
                  ( aElementOf0(sdtasdt0(X3,X1),X0)
                  | ~ aElement0(X3) ) )
            | ~ aElementOf0(X1,X0) ) )
      | ~ aIdeal0(X0) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f67,plain,
    ( ~ aElementOf0(sdtasdt0(xz,xk),xI)
    | ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f113,plain,
    ! [X3,X0,X1] :
      ( ~ aIdeal0(X0)
      | ~ aElementOf0(X1,X0)
      | ~ aElement0(X3)
      | aElementOf0(sdtasdt0(X3,X1),X0) ),
    inference(cnf_transformation,[],[f66]) ).

fof(f115,plain,
    aIdeal0(xJ),
    inference(cnf_transformation,[],[f25]) ).

fof(f116,plain,
    aIdeal0(xI),
    inference(cnf_transformation,[],[f25]) ).

fof(f117,plain,
    aElement0(xz),
    inference(cnf_transformation,[],[f26]) ).

fof(f121,plain,
    aElementOf0(xl,xJ),
    inference(cnf_transformation,[],[f27]) ).

fof(f122,plain,
    aElementOf0(xk,xI),
    inference(cnf_transformation,[],[f27]) ).

fof(f128,plain,
    ( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
    | ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
    inference(cnf_transformation,[],[f67]) ).

fof(f161,plain,
    ! [X3,X0,X1] :
      ( aElementOf0(sdtasdt0(X3,X1),X0)
      | ~ aElementOf0(X1,X0)
      | ~ aElement0(X3)
      | aIdeal0(X0) ),
    inference(consistent_polarity_flipping,[],[f113]) ).

fof(f163,plain,
    ~ aIdeal0(xI),
    inference(consistent_polarity_flipping,[],[f116]) ).

fof(f164,plain,
    ~ aIdeal0(xJ),
    inference(consistent_polarity_flipping,[],[f115]) ).

fof(f166,definition,
    ( spl8_1
  <=> aElementOf0(sdtasdt0(xz,xk),xI) ),
    introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).

fof(f168,plain,
    ( ~ aElementOf0(sdtasdt0(xz,xk),xI)
    | spl8_1 ),
    inference(avatar_component_clause,[],[f166]) ).

fof(f170,definition,
    ( spl8_2
  <=> aElementOf0(sdtasdt0(xz,xl),xJ) ),
    introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).

fof(f172,plain,
    ( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
    | spl8_2 ),
    inference(avatar_component_clause,[],[f170]) ).

fof(f173,plain,
    ( ~ spl8_1
    | ~ spl8_2 ),
    inference(avatar_split_clause,[],[f128,f170,f166]) ).

fof(f371,plain,
    ( ~ aElementOf0(xk,xI)
    | ~ aElement0(xz)
    | aIdeal0(xI)
    | spl8_1 ),
    inference(resolution,[],[f161,f168]) ).

fof(f382,plain,
    ( ~ aElement0(xz)
    | aIdeal0(xI)
    | spl8_1 ),
    inference(forward_subsumption_resolution,[],[f371,f122]) ).

fof(f383,plain,
    ( aIdeal0(xI)
    | spl8_1 ),
    inference(forward_subsumption_resolution,[],[f382,f117]) ).

fof(f384,plain,
    ( $false
    | spl8_1 ),
    inference(forward_subsumption_resolution,[],[f383,f163]) ).

fof(f385,plain,
    spl8_1,
    inference(avatar_contradiction_clause,[],[f384]) ).

fof(f388,plain,
    ( ~ aElementOf0(xl,xJ)
    | ~ aElement0(xz)
    | aIdeal0(xJ)
    | spl8_2 ),
    inference(resolution,[],[f172,f161]) ).

fof(f389,plain,
    ( ~ aElement0(xz)
    | aIdeal0(xJ)
    | spl8_2 ),
    inference(forward_subsumption_resolution,[],[f388,f121]) ).

fof(f390,plain,
    ( aIdeal0(xJ)
    | spl8_2 ),
    inference(forward_subsumption_resolution,[],[f389,f117]) ).

fof(f391,plain,
    ( $false
    | spl8_2 ),
    inference(forward_subsumption_resolution,[],[f390,f164]) ).

fof(f392,plain,
    spl8_2,
    inference(avatar_contradiction_clause,[],[f391]) ).

cnf(s1,plain,
    ( ~ spl8_1
    | ~ spl8_2 ),
    inference(sat_conversion,[],[f173]) ).

cnf(s13,plain,
    spl8_1,
    inference(sat_conversion,[],[f385]) ).

cnf(s14,plain,
    spl8_2,
    inference(sat_conversion,[],[f392]) ).

cnf(s24,plain,
    $false,
    inference(rat,[],[s1,s14,s13]) ).

fof(f393,plain,
    $false,
    inference(avatar_sat_refutation,[],[s24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG089+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n019.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 23:12:34 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43  Running first-order model finding
% 0.12/0.43  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.49  % (3515017)Will run a generic schedule for satisfiability detection.
% 0.19/0.49  % (3515026)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=559745755:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.49  % (3515023)% WARNING: option uhcvi not known.
% 0.19/0.49  % (3515023)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=32068464:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.49  % (3515022)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1861483923_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.49  % (3515027)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3995264601:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.49  % (3515024)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=892024748:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.49  % (3515025)dis+10_1_sil=32000:sp=arity:random_seed=1373087188:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.49  % (3515028)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1039673621:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.49  % TRYING [1]
% 0.19/0.49  % TRYING [2]
% 0.19/0.49  % (3515023) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3515017-3515023"...
% 0.19/0.49  % (3515025) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3515017-3515025"...
% 0.19/0.49  % (3515023)...printing done.
% 0.19/0.49  % TRYING [3]
% 0.19/0.49  % (3515023)Refutation found. Thanks to Tanya!
% 0.19/0.49  % SZS status Theorem for theBenchmark
% 0.19/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49  % (3515023)------------------------------
% 0.19/0.49  % (3515023)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.49  % (3515023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.49  % (3515023)CaDiCaL version: 2.1.3
% 0.19/0.49  % (3515023)Termination reason: Refutation
% 0.19/0.49  % (3515023)Time elapsed: 0.007 s
% 0.19/0.49  % (3515023)Peak memory usage: 12 MB
% 0.19/0.49  % (3515023)Instructions burned: 9 (million)
% 0.19/0.49  % (3515017)Success in time 0.049 s
% 0.19/0.49  % Vampire exiting
%------------------------------------------------------------------------------