↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEV432^1 : TPTP v9.3.1. Released v5.2.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 : Wed Sep 30 08:38:37 AM UTC 2026

% Result   : Theorem 0.21s 0.29s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEV432^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n020.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 15:47:50 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 0.08/0.25  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.29  % (1208642)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.29  % (1208655)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3315543572:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.29  % (1208655) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1208642-1208655"...
% 0.21/0.29  % (1208655)...printing done.
% 0.21/0.29  % (1208655)Refutation found. Thanks to Tanya!
% 0.21/0.29  % SZS status Theorem for theBenchmark
% 0.21/0.29  % SZS output start Proof for theBenchmark
% 0.21/0.29  thf(type_def_5, type, a: $tType).
% 0.21/0.29  thf(type_def_6, type, b: $tType).
% 0.21/0.29  thf(type_def_7, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.29  thf(func_def_0, type, f: (a > b)).
% 0.21/0.29  thf(func_def_2, type, sK0: (b > a)).
% 0.21/0.29  thf(func_def_3, type, sK1: ((b > a) > b)).
% 0.21/0.29  thf(f1,axiom,(
% 0.21/0.29    ! [X0 : b] : ? [X1 : a] : (((f @ X1)) = X0)),
% 0.21/0.29    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fsurj)).
% 0.21/0.29  thf(f2,conjecture,(
% 0.21/0.29    ? [X0 : (b > a)] : ! [X1 : b] : (((f @ (X0 @ X1))) = X1)),
% 0.21/0.29    file('/export/starexec/sandbox/benchmark/theBenchmark.p',invexists)).
% 0.21/0.29  thf(f3,negated_conjecture,(
% 0.21/0.29    ~ ? [X0 : (b > a)] : ! [X1 : b] : (((f @ (X0 @ X1))) = X1)),
% 0.21/0.29    inference(negated_conjecture,[status(cth)],[f2])).
% 0.21/0.29  thf(f4,plain,(
% 0.21/0.29    ! [X0 : (b > a)] : ? [X1 : b] : (((f @ (X0 @ X1))) != X1)),
% 0.21/0.29    inference(ennf_transformation,[],[f3])).
% 0.21/0.29  thf(f5,plain,(
% 0.21/0.29    ! [X0 : b] : (((f @ (sK0 @ X0))) = X0)),
% 0.21/0.29    inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X1,sK0 @ X0)],[f1])).
% 0.21/0.29  thf(f6,plain,(
% 0.21/0.29    ! [X0 : (b > a)] : (((sK1 @ X0)) != ((f @ (X0 @ (sK1 @ X0)))))),
% 0.21/0.29    inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X1,sK0 @ X0)],[f4])).
% 0.21/0.29  thf(f7,plain,(
% 0.21/0.29    ( ! [X0 : b] : ((((f @ (sK0 @ X0))) = X0)) )),
% 0.21/0.29    inference(cnf_transformation,[],[f5])).
% 0.21/0.29  thf(f8,plain,(
% 0.21/0.29    ( ! [X0 : (b > a)] : ((((sK1 @ X0)) != ((f @ (X0 @ (sK1 @ X0)))))) )),
% 0.21/0.29    inference(cnf_transformation,[],[f6])).
% 0.21/0.29  thf(f9,plain,(
% 0.21/0.29    (((sK1 @ sK0)) != ((sK1 @ sK0)))),
% 0.21/0.29    inference(constrained_superposition,[],[f8,f7])).
% 0.21/0.29  thf(f10,plain,(
% 0.21/0.29    $false),
% 0.21/0.29    inference(trivial_inequality_removal,[],[f9])).
% 0.21/0.29  % SZS output end Proof for theBenchmark
% 0.21/0.29  % (1208655)------------------------------
% 0.21/0.29  % (1208655)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (1208655)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (1208655)CaDiCaL version: 2.1.3
% 0.21/0.29  % (1208655)Termination reason: Refutation
% 0.21/0.29  % (1208655)Time elapsed: 0.001 s
% 0.21/0.29  % (1208655)Peak memory usage: 12 MB
% 0.21/0.29  % (1208642)Success in time 0.03 s
% 0.21/0.29  % Vampire exiting
%------------------------------------------------------------------------------