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

% Computer : n014.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:44:54 PM UTC 2026

% Result   : Theorem 0.09s 0.44s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   8 unt;   0 def)
%            Number of atoms       :   21 (  14 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   16 (   8   ~;   5   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (  23   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0,X1,X2] :
      ( X2 = unordered_pair(X0,X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( X3 = X0
            | X3 = X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( set_difference(singleton(X0),X1) = empty_set
    <=> in(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l36_zfmisc_1) ).

fof(f8,conjecture,
    ! [X0,X1] : set_difference(singleton(X0),unordered_pair(X0,X1)) = empty_set,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_zfmisc_1) ).

fof(f9,negated_conjecture,
    ~ ! [X0,X1] : set_difference(singleton(X0),unordered_pair(X0,X1)) = empty_set,
    inference(negated_conjecture,[status(cth)],[f8]) ).

fof(f11,plain,
    ? [X0,X1] : empty_set != set_difference(singleton(X0),unordered_pair(X0,X1)),
    inference(ennf_transformation,[],[f9]) ).

fof(f19,plain,
    ! [X2,X3,X0,X1] :
      ( X0 != X3
      | in(X3,X2)
      | unordered_pair(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f3]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | empty_set = set_difference(singleton(X0),X1) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f25,plain,
    empty_set != set_difference(singleton(sK3),unordered_pair(sK3,sK4)),
    inference(cnf_transformation,[],[f11]) ).

fof(f26,plain,
    ! [X2,X3,X1] :
      ( in(X3,X2)
      | unordered_pair(X3,X1) != X2 ),
    inference(equality_resolution,[],[f19]) ).

fof(f27,plain,
    ! [X3,X1] : in(X3,unordered_pair(X3,X1)),
    inference(equality_resolution,[],[f26]) ).

fof(f35,plain,
    ! [X0,X1] : empty_set = set_difference(singleton(X0),unordered_pair(X0,X1)),
    inference(resolution,[],[f21,f27]) ).

fof(f42,plain,
    empty_set != empty_set,
    inference(superposition,[],[f25,f35]) ).

fof(f43,plain,
    $false,
    inference(trivial_inequality_removal,[],[f42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET881+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37  % Computer : n014.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 28 03:06:01 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40  Running first-order model finding
% 0.09/0.40  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.09/0.44  % (1398492)Will run a generic schedule for satisfiability detection.
% 0.09/0.44  % (1398501)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2440846585:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.44  % (1398501) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1398492-1398501"...
% 0.09/0.44  % (1398501)...printing done.
% 0.09/0.44  % (1398501)Refutation found. Thanks to Tanya!
% 0.09/0.44  % SZS status Theorem for theBenchmark
% 0.09/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.44  % (1398501)------------------------------
% 0.09/0.44  % (1398501)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.44  % (1398501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.44  % (1398501)CaDiCaL version: 2.1.3
% 0.09/0.44  % (1398501)Termination reason: Refutation
% 0.09/0.44  % (1398501)Time elapsed: 0.001 s
% 0.09/0.44  % (1398501)Peak memory usage: 12 MB
% 0.09/0.44  % (1398501)Instructions burned: 1 (million)
% 0.09/0.44  % (1398492)Success in time 0.026 s
% 0.09/0.44  % Vampire exiting
%------------------------------------------------------------------------------