↑ 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  : TOP001-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 : n012.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:18 PM UTC 2026

% Result   : Unsatisfiable 0.08s 0.15s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   26 (   4 unt;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   72 (  35   ~;  37   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   55 (  55   !;   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(X2,X1)
      | ~ element_of_set(X0,X2)
      | element_of_set(X0,union_of_members(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_of_members_3) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( equal_sets(union_of_members(X1),X0)
      | ~ basis(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',basis_for_topology_28) ).

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

fof(f6,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(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ subset_sets(X0,X1)
      | ~ element_of_set(X2,X0)
      | element_of_set(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_theory_2) ).

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

fof(f10,axiom,
    ! [X0,X1] :
      ( element_of_set(in_1st_set(X0,X1),X0)
      | subset_sets(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_theory_4) ).

fof(f11,axiom,
    ! [X0,X1] :
      ( ~ element_of_set(in_1st_set(X0,X1),X1)
      | subset_sets(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_theory_5) ).

fof(f12,negated_conjecture,
    basis(cx,f),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1a_1) ).

fof(f13,negated_conjecture,
    ~ subset_sets(union_of_members(top_of_basis(f)),cx),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1a_2) ).

fof(f14,plain,
    ! [X0,X1] :
      ( subset_sets(union_of_members(X1),X0)
      | ~ basis(X0,X1) ),
    inference(resolution,[],[f4,f9]) ).

fof(f19,plain,
    ! [X2,X0,X1] :
      ( ~ element_of_set(X0,union_of_members(X1))
      | element_of_set(X0,X2)
      | ~ basis(X2,X1) ),
    inference(resolution,[],[f8,f14]) ).

fof(f22,plain,
    ! [X2,X3,X0,X1] :
      ( ~ element_of_set(X3,f10(X2,X1,X0))
      | ~ element_of_collection(X1,top_of_basis(X2))
      | ~ element_of_set(X0,X1)
      | element_of_set(X3,union_of_members(X2)) ),
    inference(resolution,[],[f6,f3]) ).

fof(f27,plain,
    ! [X2,X0,X1] :
      ( ~ element_of_collection(X0,top_of_basis(X1))
      | ~ element_of_set(X2,X0)
      | element_of_set(X2,union_of_members(X1))
      | ~ element_of_set(X2,X0)
      | ~ element_of_collection(X0,top_of_basis(X1)) ),
    inference(resolution,[],[f22,f5]) ).

fof(f28,plain,
    ! [X2,X0,X1] :
      ( ~ element_of_collection(X0,top_of_basis(X1))
      | ~ element_of_set(X2,X0)
      | element_of_set(X2,union_of_members(X1)) ),
    inference(duplicate_literal_removal,[],[f27]) ).

fof(f29,plain,
    ! [X2,X0,X1] :
      ( ~ element_of_set(X0,f1(top_of_basis(X1),X2))
      | element_of_set(X0,union_of_members(X1))
      | ~ element_of_set(X2,union_of_members(top_of_basis(X1))) ),
    inference(resolution,[],[f28,f2]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( element_of_set(X0,union_of_members(X1))
      | ~ element_of_set(X0,union_of_members(top_of_basis(X1)))
      | ~ element_of_set(X0,union_of_members(top_of_basis(X1))) ),
    inference(resolution,[],[f29,f1]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( ~ element_of_set(X0,union_of_members(top_of_basis(X1)))
      | element_of_set(X0,union_of_members(X1)) ),
    inference(duplicate_literal_removal,[],[f46]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( element_of_set(in_1st_set(union_of_members(top_of_basis(X0)),X1),union_of_members(X0))
      | subset_sets(union_of_members(top_of_basis(X0)),X1) ),
    inference(resolution,[],[f47,f10]) ).

fof(f77,plain,
    ! [X2,X0,X1] :
      ( element_of_set(in_1st_set(union_of_members(top_of_basis(X0)),X1),X2)
      | subset_sets(union_of_members(top_of_basis(X0)),X1)
      | ~ basis(X2,X0) ),
    inference(resolution,[],[f54,f19]) ).

fof(f92,plain,
    ! [X0,X1] :
      ( subset_sets(union_of_members(top_of_basis(X0)),X1)
      | ~ basis(X1,X0)
      | subset_sets(union_of_members(top_of_basis(X0)),X1) ),
    inference(resolution,[],[f77,f11]) ).

fof(f100,plain,
    ! [X0,X1] :
      ( subset_sets(union_of_members(top_of_basis(X0)),X1)
      | ~ basis(X1,X0) ),
    inference(duplicate_literal_removal,[],[f92]) ).

fof(f101,plain,
    ~ basis(cx,f),
    inference(resolution,[],[f100,f13]) ).

fof(f103,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f101,f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : TOP001-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10  % Computer : n012.cluster.edu
% 0.00/0.10  % Model    : x86_64 x86_64
% 0.00/0.10  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10  % Memory   : 8046.5625MB
% 0.00/0.10  % OS       : Linux 6.8.0-71-generic
% 0.00/0.10  % CPULimit : 300
% 0.00/0.10  % WCLimit  : 300
% 0.00/0.10  % DateTime : Mon Sep 28 18:47:49 UTC 2026
% 0.00/0.10  % CPUTime  : 
% 0.00/0.10  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12  Running first-order model finding
% 0.08/0.12  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.08/0.15  % (3635470)Will run a generic schedule for satisfiability detection.
% 0.08/0.15  % (3635476)% WARNING: option uhcvi not known.
% 0.08/0.15  % (3635475)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3107555818_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.15  % (3635478)dis+10_1_sil=32000:sp=arity:random_seed=4153103546:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.15  % (3635476)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=285094430:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.15  % (3635477)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2751310658:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.15  % (3635479)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2252015039:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.15  % (3635480)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=726285122:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.15  % (3635481)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3333511267:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.15  % TRYING [1]
% 0.08/0.15  % TRYING [2]
% 0.08/0.15  % TRYING [3]
% 0.08/0.15  % TRYING [4]
% 0.08/0.15  % (3635478) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3635470-3635478"...
% 0.08/0.15  % (3635478)...printing done.
% 0.08/0.15  % (3635478)Refutation found. Thanks to Tanya!
% 0.08/0.15  % SZS status Unsatisfiable for theBenchmark
% 0.08/0.15  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.15  % (3635478)------------------------------
% 0.08/0.15  % (3635478)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.15  % (3635478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.15  % (3635478)CaDiCaL version: 2.1.3
% 0.08/0.15  % (3635478)Termination reason: Refutation
% 0.08/0.15  % (3635478)Time elapsed: 0.002 s
% 0.08/0.15  % (3635478)Peak memory usage: 11 MB
% 0.08/0.15  % (3635478)Instructions burned: 5 (million)
% 0.08/0.15  % (3635470)Success in time 0.028 s
% 0.08/0.15  % Vampire exiting
%------------------------------------------------------------------------------