↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SET085-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:43:02 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.47s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   15 (  10 unt;   0 def)
%            Number of atoms       :   23 (  14 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   18 (  10   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    7 (   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ member(X0,unordered_pair(X1,X2))
      | X0 = X1
      | X0 = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( member(X0,unordered_pair(X1,X0))
      | ~ member(X0,universal_class) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).

fof(f12,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).

fof(f101,negated_conjecture,
    unordered_pair(y,z) = singleton(x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_1) ).

fof(f102,negated_conjecture,
    member(x,universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_2) ).

fof(f103,negated_conjecture,
    x != y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_3) ).

fof(f104,plain,
    y != x,
    inference(reorient_equations,[],[f103]) ).

fof(f105,negated_conjecture,
    x != z,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_4) ).

fof(f106,plain,
    z != x,
    inference(reorient_equations,[],[f105]) ).

fof(f155,plain,
    unordered_pair(y,z) = unordered_pair(x,x),
    inference(definition_unfolding,[],[f101,f12]) ).

fof(f233,plain,
    ! [X0] :
      ( ~ member(X0,unordered_pair(x,x))
      | y = X0
      | z = X0 ),
    inference(superposition,[],[f8,f155]) ).

fof(f235,plain,
    ( y = x
    | z = x
    | ~ member(x,universal_class) ),
    inference(resolution,[],[f233,f10]) ).

fof(f250,plain,
    ( z = x
    | ~ member(x,universal_class) ),
    inference(forward_subsumption_resolution,[],[f235,f104]) ).

fof(f252,plain,
    ~ member(x,universal_class),
    inference(forward_subsumption_resolution,[],[f250,f106]) ).

fof(f254,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f252,f102]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET085-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39  % Computer : n019.cluster.edu
% 0.10/0.39  % Model    : x86_64 x86_64
% 0.10/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39  % Memory   : 8046.5625MB
% 0.10/0.39  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Mon Sep 28 00:35:04 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.43  Running first-order model finding
% 0.10/0.43  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  % (3556760)Will run a generic schedule for satisfiability detection.
% 0.15/0.47  % (3556769)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3011888209:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.47  % (3556766)% WARNING: option uhcvi not known.
% 0.15/0.47  % (3556769) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3556760-3556769"...
% 0.15/0.47  % (3556769)...printing done.
% 0.15/0.47  % (3556769)Refutation found. Thanks to Tanya!
% 0.15/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47  % (3556769)------------------------------
% 0.15/0.47  % (3556769)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.47  % (3556769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.47  % (3556769)CaDiCaL version: 2.1.3
% 0.15/0.47  % (3556769)Termination reason: Refutation
% 0.15/0.47  % (3556769)Time elapsed: 0.004 s
% 0.15/0.47  % (3556769)Peak memory usage: 12 MB
% 0.15/0.47  % (3556769)Instructions burned: 12 (million)
% 0.15/0.47  % (3556760)Success in time 0.037 s
% 0.15/0.47  % Vampire exiting
%------------------------------------------------------------------------------