↑ 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  : SET016-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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:42:37 PM UTC 2026

% Result   : Unsatisfiable 0.24s 0.55s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   35 (  15 unt;   2 def)
%            Number of atoms       :   62 (  21 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   52 (  25   ~;  25   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn  14   !;   0   ?)

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

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

fof(f11,axiom,
    ! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).

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

fof(f13,axiom,
    ! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).

fof(f101,negated_conjecture,
    ordered_pair(w,x) = ordered_pair(y,z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components1_1) ).

fof(f102,negated_conjecture,
    member(w,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components1_2) ).

fof(f103,negated_conjecture,
    w != y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components1_3) ).

fof(f108,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
    inference(definition_unfolding,[],[f13,f12,f12]) ).

fof(f152,plain,
    unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))) = unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),
    inference(definition_unfolding,[],[f101,f108,f108]) ).

fof(f162,plain,
    ( member(unordered_pair(y,y),unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))))
    | ~ member(unordered_pair(y,y),universal_class) ),
    inference(superposition,[],[f9,f152]) ).

fof(f163,plain,
    member(unordered_pair(y,y),unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x)))),
    inference(forward_subsumption_resolution,[],[f162,f11]) ).

fof(f276,plain,
    ( unordered_pair(w,w) = unordered_pair(y,y)
    | unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y) ),
    inference(resolution,[],[f8,f163]) ).

fof(f292,definition,
    ( spl0_17
  <=> unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y) ),
    introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).

fof(f294,plain,
    ( unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y)
    | ~ spl0_17 ),
    inference(avatar_component_clause,[],[f292]) ).

fof(f296,definition,
    ( spl0_18
  <=> unordered_pair(w,w) = unordered_pair(y,y) ),
    introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).

fof(f298,plain,
    ( unordered_pair(w,w) = unordered_pair(y,y)
    | ~ spl0_18 ),
    inference(avatar_component_clause,[],[f296]) ).

fof(f299,plain,
    ( spl0_17
    | spl0_18 ),
    inference(avatar_split_clause,[],[f276,f296,f292]) ).

fof(f307,plain,
    ( member(w,unordered_pair(y,y))
    | ~ member(w,universal_class)
    | ~ spl0_17 ),
    inference(superposition,[],[f9,f294]) ).

fof(f309,plain,
    ( member(w,unordered_pair(y,y))
    | ~ spl0_17 ),
    inference(forward_subsumption_resolution,[],[f307,f102]) ).

fof(f317,plain,
    ( w = y
    | w = y
    | ~ spl0_17 ),
    inference(resolution,[],[f309,f8]) ).

fof(f319,plain,
    ( w = y
    | ~ spl0_17 ),
    inference(duplicate_literal_removal,[],[f317]) ).

fof(f320,plain,
    ( $false
    | ~ spl0_17 ),
    inference(forward_subsumption_resolution,[],[f319,f103]) ).

fof(f321,plain,
    ~ spl0_17,
    inference(avatar_contradiction_clause,[],[f320]) ).

fof(f334,plain,
    ( ! [X0] :
        ( ~ member(X0,unordered_pair(w,w))
        | y = X0
        | y = X0 )
    | ~ spl0_18 ),
    inference(superposition,[],[f8,f298]) ).

fof(f338,plain,
    ( ! [X0] :
        ( ~ member(X0,unordered_pair(w,w))
        | y = X0 )
    | ~ spl0_18 ),
    inference(duplicate_literal_removal,[],[f334]) ).

fof(f351,plain,
    ( w = y
    | ~ member(w,universal_class)
    | ~ spl0_18 ),
    inference(resolution,[],[f338,f9]) ).

fof(f375,plain,
    ( ~ member(w,universal_class)
    | ~ spl0_18 ),
    inference(forward_subsumption_resolution,[],[f351,f103]) ).

fof(f378,plain,
    ( $false
    | ~ spl0_18 ),
    inference(forward_subsumption_resolution,[],[f375,f102]) ).

fof(f379,plain,
    ~ spl0_18,
    inference(avatar_contradiction_clause,[],[f378]) ).

cnf(s10,plain,
    ( spl0_17
    | spl0_18 ),
    inference(sat_conversion,[],[f299]) ).

cnf(s11,plain,
    ~ spl0_17,
    inference(sat_conversion,[],[f321]) ).

cnf(s17,plain,
    ~ spl0_18,
    inference(sat_conversion,[],[f379]) ).

cnf(s18,plain,
    $false,
    inference(rat,[],[s10,s17,s11]) ).

fof(f380,plain,
    $false,
    inference(avatar_sat_refutation,[],[s18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET016-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.17/0.43  % Computer : n019.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Mon Sep 28 00:08:18 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.48  Running first-order model finding
% 0.24/0.48  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.24/0.55  % (3541096)Will run a generic schedule for satisfiability detection.
% 0.24/0.55  % (3541106)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2789177690:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.24/0.55  % (3541101)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2787408706_2999 on theBenchmark for (2999ds/0Mi)
% 0.24/0.55  % (3541102)% WARNING: option uhcvi not known.
% 0.24/0.55  % (3541104)dis+10_1_sil=32000:sp=arity:random_seed=2099600535:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.24/0.55  % (3541103)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1050963765:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.24/0.55  % (3541105)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=300417429:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.24/0.55  % (3541107)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2512359231:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.24/0.55  % (3541102)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3417142923:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.24/0.55  % (3541104) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3541096-3541104"...
% 0.24/0.55  % (3541104)...printing done.
% 0.24/0.55  % (3541104)Refutation found. Thanks to Tanya!
% 0.24/0.55  % SZS status Unsatisfiable for theBenchmark
% 0.24/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.55  % (3541104)------------------------------
% 0.24/0.55  % (3541104)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.55  % (3541104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.55  % (3541104)CaDiCaL version: 2.1.3
% 0.24/0.55  % (3541104)Termination reason: Refutation
% 0.24/0.55  % (3541104)Time elapsed: 0.013 s
% 0.24/0.55  % (3541104)Peak memory usage: 12 MB
% 0.24/0.55  % (3541104)Instructions burned: 11 (million)
% 0.24/0.55  % (3541096)Success in time 0.053 s
% 0.24/0.55  % Vampire exiting
%------------------------------------------------------------------------------