↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n020.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:49:20 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] :
      ( equalish(add(additive_identity,X0),X0)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_identity_addition) ).

fof(f17,axiom,
    ! [X2,X0,X1] :
      ( less_or_equal(X0,X1)
      | ~ less_or_equal(X0,X2)
      | ~ less_or_equal(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_order_relation) ).

fof(f19,axiom,
    ! [X2,X0,X1] :
      ( less_or_equal(add(X0,X1),add(X2,X1))
      | ~ defined(X1)
      | ~ less_or_equal(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',compatibility_of_order_relation_and_addition) ).

fof(f26,axiom,
    ! [X2,X0,X1] :
      ( less_or_equal(X0,X1)
      | ~ less_or_equal(X2,X1)
      | ~ equalish(X2,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',compatibility_of_equality_and_order_relation) ).

fof(f29,axiom,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).

fof(f30,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).

fof(f31,negated_conjecture,
    less_or_equal(additive_identity,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).

fof(f32,negated_conjecture,
    ~ less_or_equal(additive_identity,add(a,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_5) ).

fof(f50,plain,
    ! [X0] :
      ( ~ less_or_equal(X0,add(a,b))
      | ~ less_or_equal(additive_identity,X0) ),
    inference(resolution,[],[f17,f32]) ).

fof(f104,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(X1,add(a,b))
      | ~ less_or_equal(additive_identity,X0)
      | ~ equalish(X1,X0) ),
    inference(resolution,[],[f50,f26]) ).

fof(f230,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(additive_identity,X0)
      | ~ equalish(add(X1,b),X0)
      | ~ defined(b)
      | ~ less_or_equal(X1,a) ),
    inference(resolution,[],[f104,f19]) ).

fof(f238,plain,
    ! [X0,X1] :
      ( ~ equalish(add(X1,b),X0)
      | ~ less_or_equal(additive_identity,X0)
      | ~ less_or_equal(X1,a) ),
    inference(forward_subsumption_resolution,[],[f230,f29]) ).

fof(f978,plain,
    ( ~ less_or_equal(additive_identity,b)
    | ~ less_or_equal(additive_identity,a)
    | ~ defined(b) ),
    inference(resolution,[],[f238,f2]) ).

fof(f997,plain,
    ( ~ less_or_equal(additive_identity,a)
    | ~ defined(b) ),
    inference(forward_subsumption_resolution,[],[f978,f31]) ).

fof(f998,plain,
    ~ defined(b),
    inference(forward_subsumption_resolution,[],[f997,f30]) ).

fof(f999,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f998,f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD070-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n020.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 00:49:50 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running first-order theorem proving
% 0.08/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
% 0.20/1.30  % (739316)Input is clausal, will run a generic CNF schedule.
% 0.20/1.30  % (739327)dis-21_1_sil=8000:lcm=predicate:random_seed=875250911: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)
% 0.20/1.30  % (739327)Instruction limit reached! 
% 0.20/1.30  % (739327)------------------------------
% 0.20/1.30  % (739327)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.30  % (739327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.30  % (739327)CaDiCaL version: 2.1.3
% 0.20/1.30  % (739327)Termination reason: Instruction limit
% 0.20/1.30  % (739327)Termination phase: Saturation
% 0.20/1.30  % (739327)Time elapsed: 0.028 s
% 0.20/1.30  % (739327)Peak memory usage: 88 MB
% 0.20/1.30  % (739327)Instructions burned: 118 (million)
% 0.20/1.30  % (739326)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=144566853:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.20/1.30  % (739325)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=769701751:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.20/1.30  % (739322)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1116988253:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.20/1.30  % (739321)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=2974553712:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.20/1.30  % (739324)lrs+10_1_sil=8000:sp=occurrence:random_seed=1027621896:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.20/1.30  % (739323)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2304144290:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.20/1.30  % (739325)First to succeed.
% 0.20/1.30  % (739325)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-739316"
% 0.20/1.30  % (739326)Also succeeded, but the first one will report.
% 0.20/1.30  % (739324)Instruction limit reached! 
% 0.20/1.30  % (739324)------------------------------
% 0.20/1.30  % (739324)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.30  % (739324)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.30  % (739324)CaDiCaL version: 2.1.3
% 0.20/1.30  % (739324)Termination reason: Instruction limit
% 0.20/1.30  % (739324)Termination phase: Saturation
% 0.20/1.30  % (739324)Time elapsed: 0.068 s
% 0.20/1.30  % (739324)Peak memory usage: 89 MB
% 0.20/1.30  % (739324)Instructions burned: 108 (million)
% 0.20/1.30  % (739335)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=3989576022:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 0.20/1.30  % (739335)Instruction limit reached! 
% 0.20/1.30  % (739335)------------------------------
% 0.20/1.30  % (739335)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.30  % (739335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.30  % (739335)CaDiCaL version: 2.1.3
% 0.20/1.30  % (739335)Termination reason: Instruction limit
% 0.20/1.30  % (739335)Termination phase: Saturation
% 0.20/1.30  % (739335)Time elapsed: 0.045 s
% 0.20/1.30  % (739335)Peak memory usage: 89 MB
% 0.20/1.30  % (739335)Instructions burned: 146 (million)
% 0.20/1.30  % (739336)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1087225268:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 0.20/1.30  % (739336)Also succeeded, but the first one will report.
% 0.20/1.30  % (739325)Refutation found. Thanks to Tanya!
% 0.20/1.30  % SZS status Unsatisfiable for theBenchmark
% 0.20/1.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.30  % (739325)------------------------------
% 0.20/1.30  % (739325)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.30  % (739325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.30  % (739325)CaDiCaL version: 2.1.3
% 0.20/1.30  % (739325)Termination reason: Refutation
% 0.20/1.30  % (739325)Time elapsed: 0.017 s
% 0.20/1.30  % (739325)Peak memory usage: 88 MB
% 0.20/1.30  % (739325)Instructions burned: 23 (million)
% 0.20/1.30  % (739325)------------------------------
% 0.20/1.30  % (739325)------------------------------
% 0.20/1.30  % (739316)Success in time 0.45 s
% 0.20/1.30  % Vampire exiting
%------------------------------------------------------------------------------