↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : CAT011-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n017.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 09:36:37 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0] :
      ( ~ there_exists(domain(X0))
      | there_exists(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_has_elements) ).

fof(f5,axiom,
    ! [X0] :
      ( ~ there_exists(codomain(X0))
      | there_exists(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',codomain_has_elements) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( ~ there_exists(compose(X0,X1))
      | there_exists(domain(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_implies_domain) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( domain(X0) = codomain(X1)
      | ~ there_exists(compose(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_codomain_composition1) ).

fof(f10,axiom,
    ! [X0] : compose(X0,domain(X0)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',compose_domain) ).

fof(f11,axiom,
    ! [X0] : compose(codomain(X0),X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',compose_codomain) ).

fof(f12,axiom,
    there_exists(domain(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assume_domain_exists) ).

fof(f13,negated_conjecture,
    domain(domain(a)) != domain(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_is_idempotent) ).

fof(f14,plain,
    domain(a) != domain(domain(a)),
    inference(reorient_equations,[],[f13]) ).

fof(f15,plain,
    there_exists(a),
    inference(resolution,[],[f4,f12]) ).

fof(f23,plain,
    ! [X0] :
      ( ~ there_exists(compose(domain(a),X0))
      | codomain(X0) != domain(a) ),
    inference(superposition,[],[f14,f7]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( compose(domain(X0),X1) = X1
      | ~ there_exists(compose(X0,X1)) ),
    inference(superposition,[],[f11,f7]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ~ there_exists(domain(X0))
      | there_exists(X1)
      | ~ there_exists(compose(X0,X1)) ),
    inference(superposition,[],[f5,f7]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ~ there_exists(compose(X0,X1))
      | there_exists(X1) ),
    inference(forward_subsumption_resolution,[],[f28,f6]) ).

fof(f98,plain,
    ! [X0] :
      ( ~ there_exists(X0)
      | codomain(X0) != domain(a)
      | ~ there_exists(compose(a,X0)) ),
    inference(superposition,[],[f23,f27]) ).

fof(f108,plain,
    ! [X0] :
      ( codomain(X0) != domain(a)
      | ~ there_exists(compose(a,X0)) ),
    inference(forward_subsumption_resolution,[],[f98,f29]) ).

fof(f109,plain,
    ! [X0] : ~ there_exists(compose(a,X0)),
    inference(forward_subsumption_resolution,[],[f108,f7]) ).

fof(f110,plain,
    ~ there_exists(a),
    inference(superposition,[],[f109,f10]) ).

fof(f112,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f110,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT011-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18  % Computer : n017.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 21:08:51 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running first-order theorem proving
% 0.09/0.22  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.93/1.19  % (4034314)Input is clausal, will run a generic CNF schedule.
% 2.93/1.19  % (4034401)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3051233516:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.93/1.19  % (4034396)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1093182738:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.93/1.19  % (4034398)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1285532197:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.93/1.19  % (4034395)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=2175422683:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.93/1.19  % (4034401)First to succeed.
% 2.93/1.19  % (4034401)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4034314"
% 2.93/1.19  % (4034399)lrs+10_1_sil=8000:sp=occurrence:random_seed=2288124115:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.93/1.19  % (4034404)dis-21_1_sil=8000:lcm=predicate:random_seed=3278073510: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.93/1.19  % (4034403)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=574864029:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.93/1.19  % (4034404)Refutation not found, incomplete strategy
% 2.93/1.19  % (4034404)------------------------------
% 2.93/1.19  % (4034404)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.93/1.19  % (4034404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.93/1.19  % (4034404)CaDiCaL version: 2.1.3
% 2.93/1.19  % (4034404)Termination reason: Refutation not found, incomplete strategy
% 2.93/1.19  % (4034404)Time elapsed: 0.002 s
% 2.93/1.19  % (4034404)Peak memory usage: 88 MB
% 2.93/1.19  % (4034404)Instructions burned: 1 (million)
% 2.93/1.19  % (4034399)Also succeeded, but the first one will report.
% 2.93/1.19  % (4034403)Also succeeded, but the first one will report.
% 2.93/1.19  % (4034401)Refutation found. Thanks to Tanya!
% 2.93/1.19  % SZS status Unsatisfiable for theBenchmark
% 2.93/1.19  % SZS output start Proof for theBenchmark
% See solution above
% 2.93/1.19  % (4034401)------------------------------
% 2.93/1.19  % (4034401)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.93/1.19  % (4034401)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.93/1.19  % (4034401)CaDiCaL version: 2.1.3
% 2.93/1.19  % (4034401)Termination reason: Refutation
% 2.93/1.19  % (4034401)Time elapsed: 0.003 s
% 2.93/1.19  % (4034401)Peak memory usage: 88 MB
% 2.93/1.19  % (4034401)Instructions burned: 5 (million)
% 2.93/1.19  % (4034401)------------------------------
% 2.93/1.19  % (4034401)------------------------------
% 2.93/1.19  % (4034314)Success in time 0.328 s
% 2.93/1.19  % Vampire exiting
%------------------------------------------------------------------------------