↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---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 THM

% 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:33:48 PM UTC 2026

% Result   : Unsatisfiable 2.64s 1.06s
% Output   : Refutation 2.64s
% 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.03  % Problem  : TOP001-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n005.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Mon Sep 28 18:48:01 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22  Running first-order theorem proving
% 0.07/0.22  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.06  % (1035274)Input is clausal, will run a generic CNF schedule.
% 2.64/1.06  % (1035412)lrs+10_1_sil=8000:sp=occurrence:random_seed=1116697188:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.64/1.06  % (1035412)First to succeed.
% 2.64/1.06  % (1035412)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1035274"
% 2.64/1.06  % (1035409)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3371042861:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.64/1.06  % (1035417)dis-21_1_sil=8000:lcm=predicate:random_seed=703193908:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.64/1.06  % (1035415)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=863116334:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.64/1.06  % (1035414)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3645658007:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.64/1.06  % (1035407)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2486312707:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.64/1.06  % (1035411)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2540522334:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.64/1.06  % (1035415)Also succeeded, but the first one will report.
% 2.64/1.06  % (1035414)Instruction limit reached! 
% 2.64/1.06  % (1035414)------------------------------
% 2.64/1.06  % (1035414)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.06  % (1035414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.06  % (1035414)CaDiCaL version: 2.1.3
% 2.64/1.06  % (1035414)Termination reason: Instruction limit
% 2.64/1.06  % (1035414)Termination phase: Saturation
% 2.64/1.06  % (1035414)Time elapsed: 0.052 s
% 2.64/1.06  % (1035414)Peak memory usage: 87 MB
% 2.64/1.06  % (1035414)Instructions burned: 116 (million)
% 2.64/1.06  % (1035417)Instruction limit reached! 
% 2.64/1.06  % (1035417)------------------------------
% 2.64/1.06  % (1035417)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.06  % (1035417)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.06  % (1035417)CaDiCaL version: 2.1.3
% 2.64/1.06  % (1035417)Termination reason: Instruction limit
% 2.64/1.06  % (1035417)Termination phase: Saturation
% 2.64/1.06  % (1035417)Time elapsed: 0.068 s
% 2.64/1.06  % (1035417)Peak memory usage: 88 MB
% 2.64/1.06  % (1035417)Instructions burned: 118 (million)
% 2.64/1.06  % (1035412)Refutation found. Thanks to Tanya!
% 2.64/1.06  % SZS status Unsatisfiable for theBenchmark
% 2.64/1.06  % SZS output start Proof for theBenchmark
% See solution above
% 2.64/1.06  % (1035412)------------------------------
% 2.64/1.06  % (1035412)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.06  % (1035412)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.06  % (1035412)CaDiCaL version: 2.1.3
% 2.64/1.06  % (1035412)Termination reason: Refutation
% 2.64/1.06  % (1035412)Time elapsed: 0.003 s
% 2.64/1.06  % (1035412)Peak memory usage: 88 MB
% 2.64/1.06  % (1035412)Instructions burned: 5 (million)
% 2.64/1.06  % (1035412)------------------------------
% 2.64/1.06  % (1035412)------------------------------
% 2.64/1.06  % (1035274)Success in time 0.289 s
% 2.64/1.06  % Vampire exiting
%------------------------------------------------------------------------------