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

% Computer : n005.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 02:34:19 PM UTC 2026

% Result   : Unsatisfiable 0.06s 0.24s
% Output   : Refutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   30 (   6 unt;   0 def)
%            Number of atoms       :   82 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  116 (  64   ~;  52   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   50 (  50   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( element_of_set(X0,f1(X1,X0))
      | ~ element_of_set(X0,union_of_members(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_of_members_1) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( element_of_collection(f1(X1,X0),X1)
      | ~ element_of_set(X0,union_of_members(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_of_members_2) ).

fof(f3,axiom,
    ! [X2,X0,X1] :
      ( ~ element_of_collection(X0,top_of_basis(X1))
      | ~ element_of_set(X2,X0)
      | element_of_set(X2,f10(X1,X0,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',topology_generated_37) ).

fof(f4,axiom,
    ! [X2,X0,X1] :
      ( element_of_collection(f10(X1,X0,X2),X1)
      | ~ element_of_set(X2,X0)
      | ~ element_of_collection(X0,top_of_basis(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',topology_generated_38) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( subset_sets(f10(X1,X0,X2),X0)
      | ~ element_of_set(X2,X0)
      | ~ element_of_collection(X0,top_of_basis(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',topology_generated_39) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( element_of_collection(X0,top_of_basis(X1))
      | element_of_set(f11(X1,X0),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',topology_generated_40) ).

fof(f7,axiom,
    ! [X2,X0,X1] :
      ( element_of_collection(X0,top_of_basis(X1))
      | ~ element_of_set(f11(X1,X0),X2)
      | ~ element_of_collection(X2,X1)
      | ~ subset_sets(X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',topology_generated_41) ).

fof(f9,axiom,
    ! [X2,X0,X1] :
      ( subset_sets(X0,union_of_members(X2))
      | ~ element_of_collection(X1,X2)
      | ~ subset_sets(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_theory_20) ).

fof(f10,axiom,
    ! [X2,X0,X1] :
      ( ~ subset_collections(X0,X1)
      | ~ element_of_collection(X2,X0)
      | element_of_collection(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_theory_21) ).

fof(f11,negated_conjecture,
    subset_collections(g,top_of_basis(f)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1e_2) ).

fof(f12,negated_conjecture,
    ~ element_of_collection(union_of_members(g),top_of_basis(f)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1e_3) ).

fof(f13,plain,
    ! [X2,X0,X1] :
      ( subset_collections(X0,X1)
      | ~ element_of_collection(X2,X0)
      | element_of_collection(X2,X1) ),
    inference(consistent_polarity_flipping,[],[f10]) ).

fof(f14,plain,
    ~ subset_collections(g,top_of_basis(f)),
    inference(consistent_polarity_flipping,[],[f11]) ).

fof(f15,plain,
    element_of_set(f11(f,union_of_members(g)),union_of_members(g)),
    inference(resolution,[],[f6,f12]) ).

fof(f16,plain,
    ! [X0] :
      ( element_of_collection(X0,top_of_basis(f))
      | ~ element_of_collection(X0,g) ),
    inference(resolution,[],[f13,f14]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ element_of_collection(X1,g)
      | element_of_set(X0,f10(f,X1,X0))
      | ~ element_of_set(X0,X1) ),
    inference(resolution,[],[f3,f16]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( element_of_set(X0,f10(f,f1(g,X1),X0))
      | ~ element_of_set(X0,f1(g,X1))
      | ~ element_of_set(X1,union_of_members(g)) ),
    inference(resolution,[],[f20,f2]) ).

fof(f39,plain,
    ! [X0] :
      ( ~ subset_sets(X0,union_of_members(g))
      | ~ element_of_collection(X0,f)
      | ~ element_of_set(f11(f,union_of_members(g)),X0) ),
    inference(resolution,[],[f7,f12]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ~ subset_sets(X0,X1)
      | ~ element_of_set(f11(f,union_of_members(g)),X0)
      | ~ element_of_collection(X1,g)
      | ~ element_of_collection(X0,f) ),
    inference(resolution,[],[f39,f9]) ).

fof(f51,plain,
    ! [X2,X0,X1] :
      ( ~ element_of_collection(f10(X0,X1,X2),f)
      | ~ element_of_collection(X1,g)
      | ~ element_of_set(f11(f,union_of_members(g)),f10(X0,X1,X2))
      | ~ element_of_set(X2,X1)
      | ~ element_of_collection(X1,top_of_basis(X0)) ),
    inference(resolution,[],[f46,f5]) ).

fof(f77,plain,
    ! [X0,X1] :
      ( ~ element_of_collection(X0,g)
      | ~ element_of_set(f11(f,union_of_members(g)),f10(f,X0,X1))
      | ~ element_of_set(X1,X0)
      | ~ element_of_collection(X0,top_of_basis(f))
      | ~ element_of_set(X1,X0)
      | ~ element_of_collection(X0,top_of_basis(f)) ),
    inference(resolution,[],[f51,f4]) ).

fof(f78,plain,
    ! [X0,X1] :
      ( ~ element_of_collection(X0,top_of_basis(f))
      | ~ element_of_set(f11(f,union_of_members(g)),f10(f,X0,X1))
      | ~ element_of_set(X1,X0)
      | ~ element_of_collection(X0,g) ),
    inference(duplicate_literal_removal,[],[f77]) ).

fof(f80,plain,
    ! [X0,X1] :
      ( ~ element_of_set(f11(f,union_of_members(g)),f10(f,X0,X1))
      | ~ element_of_set(X1,X0)
      | ~ element_of_collection(X0,g)
      | ~ element_of_collection(X0,g) ),
    inference(resolution,[],[f78,f16]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( ~ element_of_collection(X0,g)
      | ~ element_of_set(X1,X0)
      | ~ element_of_set(f11(f,union_of_members(g)),f10(f,X0,X1)) ),
    inference(duplicate_literal_removal,[],[f80]) ).

fof(f85,plain,
    ! [X0,X1] :
      ( ~ element_of_set(X0,f1(g,X1))
      | ~ element_of_set(f11(f,union_of_members(g)),f10(f,f1(g,X1),X0))
      | ~ element_of_set(X1,union_of_members(g)) ),
    inference(resolution,[],[f84,f2]) ).

fof(f96,plain,
    ! [X0] :
      ( ~ element_of_set(f11(f,union_of_members(g)),f1(g,X0))
      | ~ element_of_set(X0,union_of_members(g))
      | ~ element_of_set(f11(f,union_of_members(g)),f1(g,X0))
      | ~ element_of_set(X0,union_of_members(g)) ),
    inference(resolution,[],[f85,f21]) ).

fof(f103,plain,
    ! [X0] :
      ( ~ element_of_set(f11(f,union_of_members(g)),f1(g,X0))
      | ~ element_of_set(X0,union_of_members(g)) ),
    inference(duplicate_literal_removal,[],[f96]) ).

fof(f133,plain,
    ( ~ element_of_set(f11(f,union_of_members(g)),union_of_members(g))
    | ~ element_of_set(f11(f,union_of_members(g)),union_of_members(g)) ),
    inference(resolution,[],[f103,f1]) ).

fof(f140,plain,
    ~ element_of_set(f11(f,union_of_members(g)),union_of_members(g)),
    inference(duplicate_literal_removal,[],[f133]) ).

fof(f146,plain,
    $false,
    inference(resolution,[],[f140,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : TOP005-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.18  % Computer : n005.cluster.edu
% 0.06/0.18  % Model    : x86_64 x86_64
% 0.06/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18  % Memory   : 8046.5625MB
% 0.06/0.18  % OS       : Linux 6.8.0-71-generic
% 0.06/0.18  % CPULimit : 300
% 0.06/0.18  % WCLimit  : 300
% 0.06/0.18  % DateTime : Mon Sep 28 18:48:17 UTC 2026
% 0.06/0.18  % CPUTime  : 
% 0.06/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.21  Running first-order model finding
% 0.06/0.21  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.06/0.24  % (1036331)Will run a generic schedule for satisfiability detection.
% 0.06/0.24  % (1036342)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1246036448:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.06/0.24  % (1036337)% WARNING: option uhcvi not known.
% 0.06/0.24  % (1036342) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1036331-1036342"...
% 0.06/0.24  % (1036342)...printing done.
% 0.06/0.24  % (1036342)Refutation found. Thanks to Tanya!
% 0.06/0.24  % SZS status Unsatisfiable for theBenchmark
% 0.06/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.24  % (1036342)------------------------------
% 0.06/0.24  % (1036342)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.24  % (1036342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.24  % (1036342)CaDiCaL version: 2.1.3
% 0.06/0.24  % (1036342)Termination reason: Refutation
% 0.06/0.24  % (1036342)Time elapsed: 0.005 s
% 0.06/0.24  % (1036342)Peak memory usage: 11 MB
% 0.06/0.24  % (1036342)Instructions burned: 12 (million)
% 0.06/0.24  % (1036331)Success in time 0.021 s
% 0.06/0.24  % Vampire exiting
%------------------------------------------------------------------------------