↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SET103-7 : 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 : n015.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:08 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f12,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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/theBenchmark.p',ordered_pair) ).

fof(f138,axiom,
    ! [X0] :
      ( member(X0,universal_class)
      | singleton(X0) = null_class ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_is_null_class) ).

fof(f166,negated_conjecture,
    unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_1_of_ordered_pair_1) ).

fof(f167,negated_conjecture,
    ~ member(y,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_1_of_ordered_pair_2) ).

fof(f168,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(f169,plain,
    unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class)) != unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),
    inference(definition_unfolding,[],[f166,f12,f168]) ).

fof(f196,plain,
    ! [X0] :
      ( unordered_pair(X0,X0) = null_class
      | member(X0,universal_class) ),
    inference(definition_unfolding,[],[f138,f12]) ).

fof(f199,definition,
    ~ sP0(unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class))),
    introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).

fof(f200,plain,
    sP0(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))),
    inference(inequality_splitting,[],[f169,f199]) ).

fof(f249,plain,
    ( sP0(unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class)))
    | member(y,universal_class) ),
    inference(superposition,[],[f200,f196]) ).

fof(f261,plain,
    member(y,universal_class),
    inference(forward_subsumption_resolution,[],[f249,f199]) ).

fof(f285,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f261,f167]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET103-7 : 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.37  % Computer : n015.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.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 28 00:46:46 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40  Running first-order theorem proving
% 0.12/0.40  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.68/1.34  % (2164588)Input is clausal, will run a generic CNF schedule.
% 2.68/1.34  % (2164597)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3264627664:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.68/1.34  % (2164597)First to succeed.
% 2.68/1.34  % (2164597)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2164588"
% 2.68/1.34  % (2164595)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2333833418:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.68/1.34  % (2164593)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=1297785383:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.68/1.34  % (2164594)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3002366152:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.68/1.34  % (2164596)lrs+10_1_sil=8000:sp=occurrence:random_seed=1096296988:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.68/1.34  % (2164596)Also succeeded, but the first one will report.
% 2.68/1.34  % (2164598)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1615521802:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.68/1.34  % (2164599)dis-21_1_sil=8000:lcm=predicate:random_seed=3492102382: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.68/1.34  % (2164598)Also succeeded, but the first one will report.
% 2.68/1.34  % (2164599)Instruction limit reached! 
% 2.68/1.34  % (2164599)------------------------------
% 2.68/1.34  % (2164599)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.34  % (2164599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.34  % (2164599)CaDiCaL version: 2.1.3
% 2.68/1.34  % (2164599)Termination reason: Instruction limit
% 2.68/1.34  % (2164599)Termination phase: Saturation
% 2.68/1.34  % (2164599)Time elapsed: 0.076 s
% 2.68/1.34  % (2164599)Peak memory usage: 89 MB
% 2.68/1.34  % (2164599)Instructions burned: 118 (million)
% 2.68/1.34  % (2164597)Refutation found. Thanks to Tanya!
% 2.68/1.34  % SZS status Unsatisfiable for theBenchmark
% 2.68/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 2.68/1.34  % (2164597)------------------------------
% 2.68/1.34  % (2164597)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.34  % (2164597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.34  % (2164597)CaDiCaL version: 2.1.3
% 2.68/1.34  % (2164597)Termination reason: Refutation
% 2.68/1.34  % (2164597)Time elapsed: 0.003 s
% 2.68/1.34  % (2164597)Peak memory usage: 88 MB
% 2.68/1.34  % (2164597)Instructions burned: 4 (million)
% 2.68/1.34  % (2164597)------------------------------
% 2.68/1.34  % (2164597)------------------------------
% 2.68/1.34  % (2164588)Success in time 0.295 s
% 2.68/1.34  % Vampire exiting
%------------------------------------------------------------------------------