↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYO296^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

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

% Result   : Theorem 0.20s 0.27s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO296^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n001.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Tue Sep 29 16:50:10 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.27  % (1490676)Will run a generic schedule for satisfiability detection.
% 0.20/0.27  % (1490682)% WARNING: option uhcvi not known.
% 0.20/0.27  % (1490682)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3050570568:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27  % (1490682)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27  % (1490682)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.27  % (1490682) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1490676-1490682"...
% 0.20/0.27  % (1490682)...printing done.
% 0.20/0.27  % (1490682)Refutation found. Thanks to Tanya!
% 0.20/0.27  % SZS status Theorem for theBenchmark
% 0.20/0.27  % SZS output start Proof for theBenchmark
% 0.20/0.27  thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.27  thf(func_def_0, type, q: ($i > $o)).
% 0.20/0.27  thf(func_def_1, type, p: ($i > $o)).
% 0.20/0.27  thf(func_def_5, type, sK0: (($i > $o) > $i)).
% 0.20/0.27  thf(func_def_6, type, sK1: (($i > $o) > $i)).
% 0.20/0.27  thf(func_def_7, type, vNOT: ($o > $o)).
% 0.20/0.27  thf(func_def_8, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.27  thf(func_def_9, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.27  thf(f1,conjecture,(
% 0.20/0.27    ? [X0 : ($i > $o)] : ! [X1 : $i,X2 : $i] : (((X0 @ X2) | (X0 @ X1)) => ((q @ X2) & (p @ X1)))),
% 0.20/0.27    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE5D)).
% 0.20/0.27  thf(f2,negated_conjecture,(
% 0.20/0.27    ~ ? [X0 : ($i > $o)] : ! [X1 : $i,X2 : $i] : (((X0 @ X2) | (X0 @ X1)) => ((q @ X2) & (p @ X1)))),
% 0.20/0.27    inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.27  thf(f3,plain,(
% 0.20/0.27    ~ ? [X0 : ($i > $o)] : ! [X1 : $i,X2 : $i] : (((X0 @ X2) | (X0 @ X1)) => ((q @ X2) & (p @ X1)))),
% 0.20/0.27    inference(rectify,[],[f2])).
% 0.20/0.27  thf(f4,plain,(
% 0.20/0.27    ~ ? [X0 : ($i > $o)] : ! [X1 : $i,X2 : $i] : (((((X0 @ X2)) = $true) | (((X0 @ X1)) = $true)) => ((((q @ X2)) = $true) & (((p @ X1)) = $true)))),
% 0.20/0.27    inference(fool_elimination,[],[f3])).
% 0.20/0.27  thf(f5,plain,(
% 0.20/0.27    ! [X0 : ($i > $o)] : ? [X1 : $i,X2 : $i] : (((((q @ X2)) != $true) | (((p @ X1)) != $true)) & ((((X0 @ X2)) = $true) | (((X0 @ X1)) = $true)))),
% 0.20/0.27    inference(ennf_transformation,[],[f4])).
% 0.20/0.27  thf(f6,plain,(
% 0.20/0.27    ! [X0 : ($i > $o)] : ((($true != ((q @ (sK1 @ X0)))) | ($true != ((p @ (sK0 @ X0))))) & (($true = ((X0 @ (sK1 @ X0)))) | ($true = ((X0 @ (sK0 @ X0))))))),
% 0.20/0.27    inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP]),skolemize(X2,sK1 @ X0),skolemize(X2,sK1 @ X0)],[f5])).
% 0.20/0.27  thf(f7,plain,(
% 0.20/0.27    ( ! [X0 : ($i > $o)] : (($true = ((X0 @ (sK1 @ X0)))) | ($true = ((X0 @ (sK0 @ X0))))) )),
% 0.20/0.27    inference(cnf_transformation,[],[f6])).
% 0.20/0.27  thf(f12,plain,(
% 0.20/0.27    ($true = (((^[Y0 : $i]: ($false)) @ (sK1 @ (^[Y0 : $i]: ($false)))))) | ($true = (((^[Y0 : $i]: ($false)) @ (sK0 @ (^[Y0 : $i]: ($false))))))),
% 0.20/0.27    inference(primitive_instantiation,[],[f7])).
% 0.20/0.27  thf(f24,plain,(
% 0.20/0.27    ($true = $false) | ($true = $false)),
% 0.20/0.27    inference(beta-eta_normalization,[],[f12])).
% 0.20/0.27  thf(f25,plain,(
% 0.20/0.27    ($true = $false)),
% 0.20/0.27    inference(duplicate_literal_removal,[],[f24])).
% 0.20/0.27  thf(f26,plain,(
% 0.20/0.27    $false),
% 0.20/0.27    inference(trivial_inequality_removal,[],[f25])).
% 0.20/0.27  % SZS output end Proof for theBenchmark
% 0.20/0.27  % (1490682)------------------------------
% 0.20/0.27  % (1490682)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27  % (1490682)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27  % (1490682)CaDiCaL version: 2.1.3
% 0.20/0.27  % (1490682)Termination reason: Refutation
% 0.20/0.27  % (1490682)Time elapsed: 0.001 s
% 0.20/0.27  % (1490682)Peak memory usage: 12 MB
% 0.20/0.27  % (1490682)Instructions burned: 1 (million)
% 0.20/0.27  % (1490676)Success in time 0.036 s
% 0.20/0.27  % Vampire exiting
%------------------------------------------------------------------------------