↑ 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  : SET131-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 : n026.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:13 PM UTC 2026

% Result   : Unsatisfiable 0.16s 0.47s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   22 (  15 unt;   0 def)
%            Number of atoms       :   30 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  13   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :   11 (   3 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   19 (  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(f21,axiom,
    ! [X2,X0,X1] :
      ( ~ member(X0,intersection(X1,X2))
      | member(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).

fof(f22,axiom,
    ! [X2,X0,X1] :
      ( ~ member(X0,intersection(X1,X2))
      | member(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).

fof(f24,axiom,
    ! [X0,X1] :
      ( ~ member(X0,complement(X1))
      | ~ member(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).

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

fof(f26,axiom,
    ! [X0,X1] : complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).

fof(f101,axiom,
    ! [X0,X1] : union(singleton(X0),X1) = set_builder(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_of_set_builder) ).

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

fof(f103,negated_conjecture,
    ~ member(u,set_builder(x,set_builder(u,set_builder(z,null_class)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_member_of_triple2_2) ).

fof(f109,plain,
    ! [X0,X1] : set_builder(X0,X1) = complement(intersection(complement(unordered_pair(X0,X0)),complement(X1))),
    inference(definition_unfolding,[],[f101,f26,f12]) ).

fof(f153,plain,
    ~ member(u,complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))),
    inference(definition_unfolding,[],[f103,f109,f109,f109]) ).

fof(f249,plain,
    ( ~ member(u,universal_class)
    | member(u,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))) ),
    inference(resolution,[],[f25,f153]) ).

fof(f253,plain,
    member(u,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))),
    inference(forward_subsumption_resolution,[],[f249,f102]) ).

fof(f254,plain,
    member(u,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))),
    inference(resolution,[],[f253,f22]) ).

fof(f289,plain,
    ~ member(u,complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))),
    inference(resolution,[],[f254,f24]) ).

fof(f292,plain,
    ( ~ member(u,universal_class)
    | member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))) ),
    inference(resolution,[],[f289,f25]) ).

fof(f293,plain,
    member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))),
    inference(forward_subsumption_resolution,[],[f292,f102]) ).

fof(f296,plain,
    member(u,complement(unordered_pair(u,u))),
    inference(resolution,[],[f293,f21]) ).

fof(f299,plain,
    ~ member(u,unordered_pair(u,u)),
    inference(resolution,[],[f296,f24]) ).

fof(f304,plain,
    ~ member(u,universal_class),
    inference(resolution,[],[f299,f10]) ).

fof(f305,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f304,f102]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET131-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.12/0.37  % Computer : n026.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 00:54:27 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.16/0.47  % (3373683)Will run a generic schedule for satisfiability detection.
% 0.16/0.47  % (3373688)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1339887950_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47  % (3373689)% WARNING: option uhcvi not known.
% 0.16/0.47  % (3373689)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2238062722:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47  % (3373690)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1386436306:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47  % (3373691)dis+10_1_sil=32000:sp=arity:random_seed=946584540:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47  % (3373692)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1368987674:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47  % (3373694)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=53778857:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47  % (3373693)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=147401317:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47  % (3373691) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3373683-3373691"...
% 0.16/0.47  % (3373692) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3373683-3373692"...
% 0.16/0.47  % (3373691)...printing done.
% 0.16/0.47  % (3373692)...printing done.
% 0.16/0.47  % (3373691)Refutation found. Thanks to Tanya!
% 0.16/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47  % (3373691)------------------------------
% 0.16/0.47  % (3373691)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47  % (3373691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47  % (3373691)CaDiCaL version: 2.1.3
% 0.16/0.47  % (3373691)Termination reason: Refutation
% 0.16/0.47  % (3373691)Time elapsed: 0.008 s
% 0.16/0.47  % (3373691)Peak memory usage: 12 MB
% 0.16/0.47  % (3373691)Instructions burned: 10 (million)
% 0.16/0.47  % (3373683)Success in time 0.047 s
% 0.16/0.47  % Vampire exiting
%------------------------------------------------------------------------------