↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n018.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 10:20:13 AM UTC 2026

% Result   : Unsatisfiable 3.65s 1.49s
% Output   : Refutation 3.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   17 (  11 unt;   0 def)
%            Number of atoms       :   35 (   7 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   38 (  20   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :    3 (   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,axiom,
    ! [X0] : level(X0) = int_level(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_21) ).

fof(f67,axiom,
    ! [X0] :
      ( p_Reset(X0)
      | ~ p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(int_level(X0),n0)
      | int_level(plus(X0,n1)) = int_level(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_53) ).

fof(f68,plain,
    ! [X0] :
      ( int_level(X0) = int_level(plus(X0,n1))
      | ~ p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(int_level(X0),n0)
      | p_Reset(X0) ),
    inference(reorient_equations,[],[f67]) ).

fof(f113,negated_conjecture,
    gt(level(x_139),n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

fof(f114,negated_conjecture,
    p_Rd(x_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).

fof(f115,negated_conjecture,
    p_Wr(x_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).

fof(f116,negated_conjecture,
    ~ p_Reset(x_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).

fof(f117,negated_conjecture,
    level(plus(x_139,n1)) != level(x_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).

fof(f118,plain,
    level(x_139) != level(plus(x_139,n1)),
    inference(reorient_equations,[],[f117]) ).

fof(f119,plain,
    gt(int_level(x_139),n0),
    inference(definition_unfolding,[],[f113,f26]) ).

fof(f120,plain,
    int_level(x_139) != int_level(plus(x_139,n1)),
    inference(definition_unfolding,[],[f118,f26,f26]) ).

fof(f229,plain,
    ( int_level(x_139) != int_level(x_139)
    | ~ p_Wr(x_139)
    | ~ p_Rd(x_139)
    | ~ gt(int_level(x_139),n0)
    | p_Reset(x_139) ),
    inference(superposition,[],[f120,f68]) ).

fof(f234,plain,
    ( ~ p_Wr(x_139)
    | ~ p_Rd(x_139)
    | ~ gt(int_level(x_139),n0)
    | p_Reset(x_139) ),
    inference(trivial_inequality_removal,[],[f229]) ).

fof(f235,plain,
    ( ~ p_Rd(x_139)
    | ~ gt(int_level(x_139),n0)
    | p_Reset(x_139) ),
    inference(forward_subsumption_resolution,[],[f234,f115]) ).

fof(f237,plain,
    ( ~ gt(int_level(x_139),n0)
    | p_Reset(x_139) ),
    inference(forward_subsumption_resolution,[],[f235,f114]) ).

fof(f244,plain,
    p_Reset(x_139),
    inference(forward_subsumption_resolution,[],[f237,f119]) ).

fof(f245,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f244,f116]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV015-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n018.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 10:55:53 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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
% 3.65/1.49  % (2162714)Input is clausal, will run a generic CNF schedule.
% 3.65/1.49  % (2162725)dis-21_1_sil=8000:lcm=predicate:random_seed=877157116: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)
% 3.65/1.49  % (2162721)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=184015226:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.65/1.49  % (2162723)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1778810805:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.65/1.49  % (2162720)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=80509425:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.65/1.49  % (2162719)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=4108161671:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.65/1.49  % (2162722)lrs+10_1_sil=8000:sp=occurrence:random_seed=3814678486:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.65/1.49  % (2162723)First to succeed.
% 3.65/1.49  % (2162723)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2162714"
% 3.65/1.49  % (2162722)Also succeeded, but the first one will report.
% 3.65/1.49  % (2162725)Instruction limit reached! 
% 3.65/1.49  % (2162725)------------------------------
% 3.65/1.49  % (2162725)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.49  % (2162725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.49  % (2162725)CaDiCaL version: 2.1.3
% 3.65/1.49  % (2162725)Termination reason: Instruction limit
% 3.65/1.49  % (2162725)Termination phase: Saturation
% 3.65/1.49  % (2162725)Time elapsed: 0.039 s
% 3.65/1.49  % (2162725)Peak memory usage: 88 MB
% 3.65/1.49  % (2162725)Instructions burned: 119 (million)
% 3.65/1.49  % (2162724)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3035515838:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.65/1.49  % (2162724)Also succeeded, but the first one will report.
% 3.65/1.49  % (2162732)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2554374213:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.65/1.49  % (2162732)Also succeeded, but the first one will report.
% 3.65/1.49  % (2162723)Refutation found. Thanks to Tanya!
% 3.65/1.49  % SZS status Unsatisfiable for theBenchmark
% 3.65/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.65/1.49  % (2162723)------------------------------
% 3.65/1.49  % (2162723)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.49  % (2162723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.49  % (2162723)CaDiCaL version: 2.1.3
% 3.65/1.49  % (2162723)Termination reason: Refutation
% 3.65/1.49  % (2162723)Time elapsed: 0.006 s
% 3.65/1.49  % (2162723)Peak memory usage: 88 MB
% 3.65/1.49  % (2162723)Instructions burned: 5 (million)
% 3.65/1.49  % (2162723)------------------------------
% 3.65/1.49  % (2162723)------------------------------
% 3.65/1.49  % (2162714)Success in time 0.442 s
% 3.65/1.49  % Vampire exiting
%------------------------------------------------------------------------------