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

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

% Result   : Theorem 0.15s 0.47s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   8 unt;   0 def)
%            Number of atoms       :   32 (  12 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   24 (  11   ~;   6   |;   3   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (  20   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f31,conjecture,
    ! [X0,X1] :
      ( in(X0,X1)
     => set_union2(singleton(X0),X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).

fof(f32,negated_conjecture,
    ~ ! [X0,X1] :
        ( in(X0,X1)
       => set_union2(singleton(X0),X1) = X1 ),
    inference(negated_conjecture,[status(cth)],[f31]) ).

fof(f33,axiom,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
    <=> in(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).

fof(f42,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_union2(X0,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).

fof(f67,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).

fof(f91,plain,
    ? [X0,X1] :
      ( set_union2(singleton(X0),X1) != X1
      & in(X0,X1) ),
    inference(ennf_transformation,[],[f32]) ).

fof(f96,plain,
    ! [X0,X1] :
      ( set_union2(X0,X1) = X1
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f151,plain,
    ( sK9 != set_union2(singleton(sK8),sK9)
    & in(sK8,sK9) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f91]) ).

fof(f152,plain,
    ! [X0,X1] :
      ( ( subset(singleton(X0),X1)
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ~ subset(singleton(X0),X1) ) ),
    inference(nnf_transformation,[],[f33]) ).

fof(f219,plain,
    in(sK8,sK9),
    inference(cnf_transformation,[],[f151]) ).

fof(f220,plain,
    sK9 != set_union2(singleton(sK8),sK9),
    inference(cnf_transformation,[],[f151]) ).

fof(f222,plain,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
      | ~ in(X0,X1) ),
    inference(cnf_transformation,[],[f152]) ).

fof(f234,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | set_union2(X0,X1) = X1 ),
    inference(cnf_transformation,[],[f96]) ).

fof(f264,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f67]) ).

fof(f290,plain,
    sK9 != set_union2(unordered_pair(sK8,sK8),sK9),
    inference(definition_unfolding,[],[f220,f264]) ).

fof(f291,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | subset(unordered_pair(X0,X0),X1) ),
    inference(definition_unfolding,[],[f222,f264]) ).

fof(f547,plain,
    subset(unordered_pair(sK8,sK8),sK9),
    inference(resolution,[],[f291,f219]) ).

fof(f550,plain,
    sK9 = set_union2(unordered_pair(sK8,sK8),sK9),
    inference(resolution,[],[f547,f234]) ).

fof(f552,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f550,f290]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU152+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38  % Computer : n006.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 : Mon Sep 28 03:46:11 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.15/0.47  % (3557821)Will run a generic schedule for satisfiability detection.
% 0.15/0.47  % (3557826)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1026247189_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.47  % TRYING [1]
% 0.15/0.47  % (3557827)% WARNING: option uhcvi not known.
% 0.15/0.47  % TRYING [2]
% 0.15/0.47  % TRYING [3]
% 0.15/0.47  % (3557827)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2675597491:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.47  % (3557829)dis+10_1_sil=32000:sp=arity:random_seed=3369939784:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.47  % (3557828)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=704599363:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.47  % (3557831)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2345432077:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.47  % (3557830)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4212407443:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.47  % (3557832)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=634718227:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.47  % TRYING [4]
% 0.15/0.47  % (3557831) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3557821-3557831"...
% 0.15/0.47  % (3557831)...printing done.
% 0.15/0.47  % (3557831)Refutation found. Thanks to Tanya!
% 0.15/0.47  % SZS status Theorem for theBenchmark
% 0.15/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47  % (3557831)------------------------------
% 0.15/0.47  % (3557831)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.47  % (3557831)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.47  % (3557831)CaDiCaL version: 2.1.3
% 0.15/0.47  % (3557831)Termination reason: Refutation
% 0.15/0.47  % (3557831)Time elapsed: 0.010 s
% 0.15/0.47  % (3557831)Peak memory usage: 12 MB
% 0.15/0.47  % (3557831)Instructions burned: 13 (million)
% 0.15/0.47  % (3557821)Success in time 0.047 s
% 0.15/0.47  % Vampire exiting
%------------------------------------------------------------------------------