↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SET085-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n004.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:40:02 PM UTC 2026

% Result   : Unsatisfiable 2.54s 1.35s
% Output   : Refutation 2.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   15 (  10 unt;   0 def)
%            Number of atoms       :   23 (  14 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   18 (  10   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    7 (   7   !;   0   ?)

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

fof(f10,axiom,
    ! [X0,X1] :
      ( member(X0,unordered_pair(X1,X0))
      | ~ member(X0,universal_class) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair3) ).

fof(f12,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set) ).

fof(f101,negated_conjecture,
    unordered_pair(y,z) = singleton(x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_1) ).

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

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

fof(f104,plain,
    y != x,
    inference(reorient_equations,[],[f103]) ).

fof(f105,negated_conjecture,
    x != z,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_4) ).

fof(f106,plain,
    z != x,
    inference(reorient_equations,[],[f105]) ).

fof(f111,plain,
    unordered_pair(y,z) = unordered_pair(x,x),
    inference(definition_unfolding,[],[f101,f12]) ).

fof(f188,plain,
    ! [X0] :
      ( ~ member(X0,unordered_pair(x,x))
      | y = X0
      | z = X0 ),
    inference(superposition,[],[f8,f111]) ).

fof(f190,plain,
    ( y = x
    | z = x
    | ~ member(x,universal_class) ),
    inference(resolution,[],[f188,f10]) ).

fof(f192,plain,
    ( z = x
    | ~ member(x,universal_class) ),
    inference(forward_subsumption_resolution,[],[f190,f104]) ).

fof(f194,plain,
    ~ member(x,universal_class),
    inference(forward_subsumption_resolution,[],[f192,f106]) ).

fof(f196,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f194,f102]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET085-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41  % Computer : n004.cluster.edu
% 0.12/0.41  % Model    : x86_64 x86_64
% 0.12/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.41  % Memory   : 8046.5625MB
% 0.12/0.41  % OS       : Linux 6.8.0-71-generic
% 0.12/0.41  % CPULimit : 300
% 0.12/0.41  % WCLimit  : 300
% 0.12/0.41  % DateTime : Mon Sep 28 00:34:52 UTC 2026
% 0.12/0.41  % CPUTime  : 
% 0.12/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.45  Running first-order theorem proving
% 0.12/0.45  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.54/1.35  % (4033996)Input is clausal, will run a generic CNF schedule.
% 2.54/1.35  % (4034005)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=742277863:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.54/1.35  % (4034005)First to succeed.
% 2.54/1.35  % (4034005)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4033996"
% 2.54/1.35  % (4034004)lrs+10_1_sil=8000:sp=occurrence:random_seed=779137453:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.54/1.35  % (4034004)Also succeeded, but the first one will report.
% 2.54/1.35  % (4034003)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3006211127:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.54/1.35  % (4034002)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2330386738:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.54/1.35  % (4034001)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=3009914820:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.54/1.35  % (4034007)dis-21_1_sil=8000:lcm=predicate:random_seed=2957862994: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.54/1.35  % (4034006)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1936171055:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.54/1.35  % (4034006)Also succeeded, but the first one will report.
% 2.54/1.35  % (4034007)Instruction limit reached! 
% 2.54/1.35  % (4034007)------------------------------
% 2.54/1.35  % (4034007)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.35  % (4034007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.35  % (4034007)CaDiCaL version: 2.1.3
% 2.54/1.35  % (4034007)Termination reason: Instruction limit
% 2.54/1.35  % (4034007)Termination phase: Saturation
% 2.54/1.35  % (4034007)Time elapsed: 0.064 s
% 2.54/1.35  % (4034007)Peak memory usage: 89 MB
% 2.54/1.35  % (4034007)Instructions burned: 118 (million)
% 2.54/1.35  % (4034005)Refutation found. Thanks to Tanya!
% 2.54/1.35  % SZS status Unsatisfiable for theBenchmark
% 2.54/1.35  % SZS output start Proof for theBenchmark
% See solution above
% 2.54/1.35  % (4034005)------------------------------
% 2.54/1.35  % (4034005)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.35  % (4034005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.35  % (4034005)CaDiCaL version: 2.1.3
% 2.54/1.35  % (4034005)Termination reason: Refutation
% 2.54/1.35  % (4034005)Time elapsed: 0.003 s
% 2.54/1.35  % (4034005)Peak memory usage: 89 MB
% 2.54/1.35  % (4034005)Instructions burned: 4 (million)
% 2.54/1.35  % (4034005)------------------------------
% 2.54/1.35  % (4034005)------------------------------
% 2.54/1.35  % (4033996)Success in time 0.272 s
% 2.54/1.35  % Vampire exiting
%------------------------------------------------------------------------------