↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n011.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 11:40:28 AM UTC 2026

% Result   : Theorem 5.81s 2.03s
% Output   : Refutation 5.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  18 unt;   0 def)
%            Number of atoms       :   28 (  15 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   14 (   8   ~;   4   |;   1   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   31 (  30   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).

fof(f2,axiom,
    ! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).

fof(f4,axiom,
    ! [X0] : addition(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence) ).

fof(f15,axiom,
    ! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infty_unfold1) ).

fof(f18,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> addition(X0,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).

fof(f19,conjecture,
    ! [X0] : leq(one,strong_iteration(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f20,negated_conjecture,
    ~ ! [X0] : leq(one,strong_iteration(X0)),
    inference(negated_conjecture,[status(cth)],[f19]) ).

fof(f21,plain,
    ? [X0] : ~ leq(one,strong_iteration(X0)),
    inference(ennf_transformation,[],[f20]) ).

fof(f25,plain,
    ~ leq(one,strong_iteration(sK0)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f21]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ( leq(X0,X1)
        | addition(X0,X1) != X1 )
      & ( addition(X0,X1) = X1
        | ~ leq(X0,X1) ) ),
    inference(nnf_transformation,[],[f18]) ).

fof(f27,plain,
    ~ leq(one,strong_iteration(sK0)),
    inference(cnf_transformation,[],[f25]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( addition(X0,X1) != X1
      | leq(X0,X1) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f35,plain,
    ! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
    inference(cnf_transformation,[],[f15]) ).

fof(f36,plain,
    ! [X0] : addition(X0,X0) = X0,
    inference(cnf_transformation,[],[f4]) ).

fof(f37,plain,
    ! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f38,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f53,plain,
    ! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
    inference(forward_demodulation,[],[f35,f38]) ).

fof(f87,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
    inference(superposition,[],[f37,f36]) ).

fof(f235,plain,
    ! [X0,X1] :
      ( addition(X0,X1) != addition(X0,X1)
      | leq(X0,addition(X0,X1)) ),
    inference(superposition,[],[f29,f87]) ).

fof(f243,plain,
    ! [X0,X1] : leq(X0,addition(X0,X1)),
    inference(trivial_inequality_removal,[],[f235]) ).

fof(f314,plain,
    ! [X0] : leq(one,strong_iteration(X0)),
    inference(superposition,[],[f243,f53]) ).

fof(f385,plain,
    $false,
    inference(resolution,[],[f314,f27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KLE146+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.10  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.48  % Computer : n011.cluster.edu
% 0.24/0.48  % Model    : x86_64 x86_64
% 0.24/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.48  % Memory   : 8046.5625MB
% 0.24/0.48  % OS       : Linux 6.8.0-71-generic
% 0.24/0.48  % CPULimit : 300
% 0.24/0.48  % WCLimit  : 300
% 0.24/0.48  % DateTime : Sun Sep 27 13:12:30 UTC 2026
% 0.24/0.49  % CPUTime  : 
% 0.24/0.49  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.54  Running first-order theorem proving
% 0.28/0.54  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
% 5.81/2.03  % (2395180)Detected formulas, will run a generic FOF schedule.
% 5.81/2.03  % (2395186)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=42876180:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.81/2.03  % (2395189)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1260071570:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.81/2.03  % (2395191)dis-21_1_sil=8000:lcm=predicate:random_seed=1491003230:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 5.81/2.03  % (2395190)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=709392302:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.81/2.03  % (2395188)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1404790568:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.81/2.03  % (2395187)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2142028249:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.81/2.03  % (2395185)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=1031934292:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.81/2.03  % (2395188)Refutation not found, incomplete strategy
% 5.81/2.03  % (2395188)------------------------------
% 5.81/2.03  % (2395188)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.81/2.03  % (2395188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.81/2.03  % (2395188)CaDiCaL version: 2.1.3
% 5.81/2.03  % (2395188)Termination reason: Refutation not found, incomplete strategy
% 5.81/2.03  % (2395188)Time elapsed: 0.002 s
% 5.81/2.03  % (2395188)Peak memory usage: 88 MB
% 5.81/2.03  % (2395191)Refutation not found, incomplete strategy
% 5.81/2.03  % (2395191)------------------------------
% 5.81/2.03  % (2395191)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.81/2.03  % (2395191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.81/2.03  % (2395191)CaDiCaL version: 2.1.3
% 5.81/2.03  % (2395191)Termination reason: Refutation not found, incomplete strategy
% 5.81/2.03  % (2395191)Time elapsed: 0.003 s
% 5.81/2.03  % (2395191)Peak memory usage: 88 MB
% 5.81/2.03  % (2395191)Instructions burned: 1 (million)
% 5.81/2.03  % (2395189)First to succeed.
% 5.81/2.03  % (2395189)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2395180"
% 5.81/2.03  % (2395190)Also succeeded, but the first one will report.
% 5.81/2.03  % (2395191)------------------------------
% 5.81/2.03  % (2395191)------------------------------
% 5.81/2.03  % (2395188)------------------------------
% 5.81/2.03  % (2395188)------------------------------
% 5.81/2.03  % (2395189)Refutation found. Thanks to Tanya!
% 5.81/2.03  % SZS status Theorem for theBenchmark
% 5.81/2.03  % SZS output start Proof for theBenchmark
% See solution above
% 5.81/2.03  % (2395189)------------------------------
% 5.81/2.03  % (2395189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.81/2.03  % (2395189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.81/2.03  % (2395189)CaDiCaL version: 2.1.3
% 5.81/2.03  % (2395189)Termination reason: Refutation
% 5.81/2.03  % (2395189)Time elapsed: 0.016 s
% 5.81/2.03  % (2395189)Peak memory usage: 88 MB
% 5.81/2.03  % (2395189)Instructions burned: 13 (million)
% 5.81/2.03  % (2395189)------------------------------
% 5.81/2.03  % (2395189)------------------------------
% 5.81/2.03  % (2395180)Success in time 0.716 s
% 5.81/2.03  % Vampire exiting
%------------------------------------------------------------------------------