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

% Computer : n016.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:24:52 PM UTC 2026

% Result   : Theorem 0.16s 0.48s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (   9 unt;   0 def)
%            Number of atoms       :   78 (  11 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   93 (  44   ~;  36   |;   8   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   16 (  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f35,axiom,
    ! [X0,X1] :
      ( ( aElementOf0(X0,szNzAzT0)
        & aElementOf0(X1,szNzAzT0) )
     => ( ( sdtlseqdt0(X0,X1)
          & sdtlseqdt0(X1,X0) )
       => X0 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessASymm) ).

fof(f37,axiom,
    ! [X0,X1] :
      ( ( aElementOf0(X0,szNzAzT0)
        & aElementOf0(X1,szNzAzT0) )
     => ( sdtlseqdt0(X0,X1)
        | sdtlseqdt0(szszuzczcdt0(X1),X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessTotal) ).

fof(f84,axiom,
    ( aElementOf0(xi,szNzAzT0)
    & aElementOf0(xj,szNzAzT0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3856) ).

fof(f85,conjecture,
    ( xi != xj
   => ( sdtlseqdt0(szszuzczcdt0(xj),xi)
      | sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f86,negated_conjecture,
    ~ ( xi != xj
     => ( sdtlseqdt0(szszuzczcdt0(xj),xi)
        | sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
    inference(negated_conjecture,[status(cth)],[f85]) ).

fof(f135,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ sdtlseqdt0(X0,X1)
      | ~ sdtlseqdt0(X1,X0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X1,szNzAzT0) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f136,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ sdtlseqdt0(X0,X1)
      | ~ sdtlseqdt0(X1,X0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X1,szNzAzT0) ),
    inference(flattening,[],[f135]) ).

fof(f139,plain,
    ! [X0,X1] :
      ( sdtlseqdt0(X0,X1)
      | sdtlseqdt0(szszuzczcdt0(X1),X0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X1,szNzAzT0) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f140,plain,
    ! [X0,X1] :
      ( sdtlseqdt0(X0,X1)
      | sdtlseqdt0(szszuzczcdt0(X1),X0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X1,szNzAzT0) ),
    inference(flattening,[],[f139]) ).

fof(f200,plain,
    ( ~ sdtlseqdt0(szszuzczcdt0(xj),xi)
    & ~ sdtlseqdt0(szszuzczcdt0(xi),xj)
    & xi != xj ),
    inference(ennf_transformation,[],[f86]) ).

fof(f201,plain,
    ( ~ sdtlseqdt0(szszuzczcdt0(xj),xi)
    & ~ sdtlseqdt0(szszuzczcdt0(xi),xj)
    & xi != xj ),
    inference(flattening,[],[f200]) ).

fof(f328,plain,
    ! [X0,X1] :
      ( ~ sdtlseqdt0(X1,X0)
      | ~ sdtlseqdt0(X0,X1)
      | X0 = X1
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cnf_transformation,[],[f136]) ).

fof(f330,plain,
    ! [X0,X1] :
      ( sdtlseqdt0(szszuzczcdt0(X1),X0)
      | sdtlseqdt0(X0,X1)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cnf_transformation,[],[f140]) ).

fof(f435,plain,
    aElementOf0(xj,szNzAzT0),
    inference(cnf_transformation,[],[f84]) ).

fof(f436,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f84]) ).

fof(f437,plain,
    xi != xj,
    inference(cnf_transformation,[],[f201]) ).

fof(f438,plain,
    ~ sdtlseqdt0(szszuzczcdt0(xi),xj),
    inference(cnf_transformation,[],[f201]) ).

fof(f439,plain,
    ~ sdtlseqdt0(szszuzczcdt0(xj),xi),
    inference(cnf_transformation,[],[f201]) ).

fof(f1102,plain,
    ( sdtlseqdt0(xj,xi)
    | ~ aElementOf0(xj,szNzAzT0)
    | ~ aElementOf0(xi,szNzAzT0) ),
    inference(resolution,[],[f330,f438]) ).

fof(f1103,plain,
    ( sdtlseqdt0(xi,xj)
    | ~ aElementOf0(xi,szNzAzT0)
    | ~ aElementOf0(xj,szNzAzT0) ),
    inference(resolution,[],[f330,f439]) ).

fof(f1108,plain,
    ( sdtlseqdt0(xi,xj)
    | ~ aElementOf0(xj,szNzAzT0) ),
    inference(forward_subsumption_resolution,[],[f1103,f436]) ).

fof(f1109,plain,
    ( sdtlseqdt0(xj,xi)
    | ~ aElementOf0(xi,szNzAzT0) ),
    inference(forward_subsumption_resolution,[],[f1102,f435]) ).

fof(f1110,plain,
    sdtlseqdt0(xi,xj),
    inference(forward_subsumption_resolution,[],[f1108,f435]) ).

fof(f1111,plain,
    sdtlseqdt0(xj,xi),
    inference(forward_subsumption_resolution,[],[f1109,f436]) ).

fof(f1349,plain,
    ( ~ sdtlseqdt0(xi,xj)
    | xi = xj
    | ~ aElementOf0(xi,szNzAzT0)
    | ~ aElementOf0(xj,szNzAzT0) ),
    inference(resolution,[],[f328,f1111]) ).

fof(f1359,plain,
    ( xi = xj
    | ~ aElementOf0(xi,szNzAzT0)
    | ~ aElementOf0(xj,szNzAzT0) ),
    inference(forward_subsumption_resolution,[],[f1349,f1110]) ).

fof(f1369,plain,
    ( ~ aElementOf0(xi,szNzAzT0)
    | ~ aElementOf0(xj,szNzAzT0) ),
    inference(forward_subsumption_resolution,[],[f1359,f437]) ).

fof(f1377,plain,
    ~ aElementOf0(xj,szNzAzT0),
    inference(forward_subsumption_resolution,[],[f1369,f436]) ).

fof(f1384,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1377,f435]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM576+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38  % Computer : n016.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 20:39:32 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41  Running first-order model finding
% 0.10/0.41  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.16/0.48  % (2969243)Will run a generic schedule for satisfiability detection.
% 0.16/0.48  % (2969248)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3661266794_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.48  % (2969249)% WARNING: option uhcvi not known.
% 0.16/0.48  % (2969249)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1309022085:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.48  % (2969250)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1686693181:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.48  % (2969251)dis+10_1_sil=32000:sp=arity:random_seed=766114031:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.48  % (2969252)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=321821214:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.48  % (2969254)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1123973420:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.48  % (2969253)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4210857702:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.48  % TRYING [1]
% 0.16/0.48  % TRYING [2]
% 0.16/0.48  % TRYING [3]
% 0.16/0.48  % TRYING [4]
% 0.16/0.48  % (2969251) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2969243-2969251"...
% 0.16/0.48  % (2969251)...printing done.
% 0.16/0.48  % (2969251)Refutation found. Thanks to Tanya!
% 0.16/0.48  % SZS status Theorem for theBenchmark
% 0.16/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48  % (2969251)------------------------------
% 0.16/0.48  % (2969251)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48  % (2969251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48  % (2969251)CaDiCaL version: 2.1.3
% 0.16/0.48  % (2969251)Termination reason: Refutation
% 0.16/0.48  % (2969251)Time elapsed: 0.023 s
% 0.16/0.48  % (2969251)Peak memory usage: 12 MB
% 0.16/0.48  % (2969251)Instructions burned: 32 (million)
% 0.16/0.48  % (2969243)Success in time 0.06 s
% 0.16/0.48  % Vampire exiting
%------------------------------------------------------------------------------