↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n010.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:38:58 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ follows(X0,X1)
      | ~ fails(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).

fof(f2,axiom,
    ! [X2,X0,X1] :
      ( fails(X2,X1)
      | fails(X0,X2)
      | ~ fails(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).

fof(f3,axiom,
    ! [X2,X0,X1] :
      ( ~ has(X1,goto(X2))
      | ~ fails(X0,X1)
      | ~ labels(X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).

fof(f8,axiom,
    labels(loop,p3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).

fof(f13,axiom,
    follows(p6,p3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_6) ).

fof(f15,axiom,
    follows(p7,p6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_6_to_7) ).

fof(f17,axiom,
    follows(p8,p7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_7_to_8) ).

fof(f18,axiom,
    has(p8,goto(loop)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).

fof(f19,negated_conjecture,
    fails(p3,p3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).

fof(f23,plain,
    ~ fails(p6,p3),
    inference(resolution,[],[f1,f13]) ).

fof(f24,plain,
    ~ fails(p7,p6),
    inference(resolution,[],[f1,f15]) ).

fof(f25,plain,
    ~ fails(p8,p7),
    inference(resolution,[],[f1,f17]) ).

fof(f30,plain,
    ! [X0] :
      ( fails(X0,p6)
      | ~ fails(X0,p3) ),
    inference(resolution,[],[f2,f23]) ).

fof(f31,plain,
    ! [X0] :
      ( fails(X0,p7)
      | ~ fails(X0,p6) ),
    inference(resolution,[],[f24,f2]) ).

fof(f33,plain,
    ! [X0] :
      ( ~ labels(loop,X0)
      | ~ fails(X0,p8) ),
    inference(resolution,[],[f3,f18]) ).

fof(f34,plain,
    ! [X0] :
      ( fails(X0,p8)
      | ~ fails(X0,p7) ),
    inference(resolution,[],[f25,f2]) ).

fof(f36,plain,
    ~ fails(p3,p8),
    inference(resolution,[],[f33,f8]) ).

fof(f52,plain,
    ~ fails(p3,p7),
    inference(resolution,[],[f34,f36]) ).

fof(f53,plain,
    ~ fails(p3,p6),
    inference(resolution,[],[f52,f31]) ).

fof(f69,plain,
    ~ fails(p3,p3),
    inference(resolution,[],[f53,f30]) ).

fof(f71,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f69,f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COM002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.19  % Computer : n010.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Mon Sep 28 21:43:02 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23  Running first-order theorem proving
% 0.10/0.23  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.75/1.15  % (2388326)Input is clausal, will run a generic CNF schedule.
% 2.75/1.15  % (2388464)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4256419757:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.75/1.15  % (2388464)First to succeed.
% 2.75/1.15  % (2388464)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2388326"
% 2.75/1.15  % (2388466)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3472187981:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.75/1.15  % (2388457)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=3604764426:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.75/1.15  % (2388461)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1466030311:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.75/1.15  % (2388462)lrs+10_1_sil=8000:sp=occurrence:random_seed=2907300493:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.75/1.15  % (2388467)dis-21_1_sil=8000:lcm=predicate:random_seed=2604778970: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.75/1.15  % (2388459)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3241711760:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.75/1.15  % (2388462)Also succeeded, but the first one will report.
% 2.75/1.15  % (2388467)Also succeeded, but the first one will report.
% 2.75/1.15  % (2388466)Also succeeded, but the first one will report.
% 2.75/1.15  % (2388464)Refutation found. Thanks to Tanya!
% 2.75/1.15  % SZS status Unsatisfiable for theBenchmark
% 2.75/1.15  % SZS output start Proof for theBenchmark
% See solution above
% 2.75/1.15  % (2388464)------------------------------
% 2.75/1.15  % (2388464)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/1.15  % (2388464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/1.15  % (2388464)CaDiCaL version: 2.1.3
% 2.75/1.15  % (2388464)Termination reason: Refutation
% 2.75/1.15  % (2388464)Time elapsed: 0.001 s
% 2.75/1.15  % (2388464)Peak memory usage: 88 MB
% 2.75/1.15  % (2388464)Instructions burned: 2 (million)
% 2.75/1.15  % (2388464)------------------------------
% 2.75/1.15  % (2388464)------------------------------
% 2.75/1.15  % (2388326)Success in time 0.286 s
% 2.75/1.15  % Vampire exiting
%------------------------------------------------------------------------------