↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN049^5 : 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 : n026.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:41:38 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN049^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n026.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 16:17:27 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.27  % (800334)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.27  % (800340)lrs+10_16_si=on:nwc=1.5:random_seed=2170918352:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.27  % (800340) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-800334-800340"...
% 0.22/0.27  % (800340)...printing done.
% 0.22/0.27  % (800340)Refutation found. Thanks to Tanya!
% 0.22/0.27  % SZS status Theorem for theBenchmark
% 0.22/0.27  % SZS output start Proof for theBenchmark
% 0.22/0.27  thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.27  thf(func_def_0, type, cQ: ($i > $o)).
% 0.22/0.27  thf(func_def_1, type, cP: ($i > $o)).
% 0.22/0.27  thf(func_def_5, type, sK0: ($i > $i)).
% 0.22/0.27  thf(func_def_6, type, sK1: ($i > $i)).
% 0.22/0.27  thf(f1,conjecture,(
% 0.22/0.27    ? [X0 : $i] : ! [X1 : $i,X2 : $i] : (((cP @ X1) => (cQ @ X2)) => ((cP @ X0) => (cQ @ X0)))),
% 0.22/0.27    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPELL19)).
% 0.22/0.27  thf(f2,negated_conjecture,(
% 0.22/0.27    ~ ? [X0 : $i] : ! [X1 : $i,X2 : $i] : (((cP @ X1) => (cQ @ X2)) => ((cP @ X0) => (cQ @ X0)))),
% 0.22/0.27    inference(negated_conjecture,[status(cth)],[f1])).
% 0.22/0.27  thf(f3,plain,(
% 0.22/0.27    ~ ? [X0 : $i] : ! [X1 : $i,X2 : $i] : (((cP @ X1) => (cQ @ X2)) => ((cP @ X0) => (cQ @ X0)))),
% 0.22/0.27    inference(rectify,[],[f2])).
% 0.22/0.27  thf(f4,plain,(
% 0.22/0.27    ~ ? [X0 : $i] : ! [X1 : $i,X2 : $i] : (((((cP @ X1)) = $true) => (((cQ @ X2)) = $true)) => ((((cP @ X0)) = $true) => (((cQ @ X0)) = $true)))),
% 0.22/0.27    inference(fool_elimination,[],[f3])).
% 0.22/0.27  thf(f5,plain,(
% 0.22/0.27    ! [X0 : $i] : ? [X1 : $i,X2 : $i] : (((((cQ @ X0)) != $true) & (((cP @ X0)) = $true)) & ((((cQ @ X2)) = $true) | (((cP @ X1)) != $true)))),
% 0.22/0.27    inference(ennf_transformation,[],[f4])).
% 0.22/0.27  thf(f6,plain,(
% 0.22/0.27    ! [X0 : $i] : ? [X1 : $i,X2 : $i] : (((((cQ @ X2)) = $true) | (((cP @ X1)) != $true)) & (((cQ @ X0)) != $true) & (((cP @ X0)) = $true))),
% 0.22/0.27    inference(flattening,[],[f5])).
% 0.22/0.27  thf(f7,plain,(
% 0.22/0.27    ! [X0 : $i] : ((($true = ((cQ @ (sK1 @ X0)))) | ($true != ((cP @ (sK0 @ X0))))) & (((cQ @ X0)) != $true) & (((cP @ X0)) = $true))),
% 0.22/0.27    inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP]),skolemize(X2,sK1 @ X0),skolemize(X2,sK1 @ X0)],[f6])).
% 0.22/0.27  thf(f8,plain,(
% 0.22/0.27    ( ! [X0 : $i] : ((((cP @ X0)) = $true)) )),
% 0.22/0.27    inference(cnf_transformation,[],[f7])).
% 0.22/0.27  thf(f9,plain,(
% 0.22/0.27    ( ! [X0 : $i] : ((((cQ @ X0)) != $true)) )),
% 0.22/0.27    inference(cnf_transformation,[],[f7])).
% 0.22/0.27  thf(f10,plain,(
% 0.22/0.27    ( ! [X0 : $i] : (($true != ((cP @ (sK0 @ X0)))) | ($true = ((cQ @ (sK1 @ X0))))) )),
% 0.22/0.27    inference(cnf_transformation,[],[f7])).
% 0.22/0.27  thf(f13,plain,(
% 0.22/0.27    ( ! [X0 : $i] : (($true != $true) | ($true = ((cQ @ (sK1 @ X0))))) )),
% 0.22/0.27    inference(constrained_superposition,[],[f10,f8])).
% 0.22/0.27  thf(f14,plain,(
% 0.22/0.27    ( ! [X0 : $i] : (($true = ((cQ @ (sK1 @ X0))))) )),
% 0.22/0.27    inference(trivial_inequality_removal,[],[f13])).
% 0.22/0.27  thf(f15,plain,(
% 0.22/0.27    $false),
% 0.22/0.27    inference(forward_subsumption_resolution,[],[f14,f9])).
% 0.22/0.27  % SZS output end Proof for theBenchmark
% 0.22/0.27  % (800340)------------------------------
% 0.22/0.27  % (800340)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.27  % (800340)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.27  % (800340)CaDiCaL version: 2.1.3
% 0.22/0.27  % (800340)Termination reason: Refutation
% 0.22/0.27  % (800340)Time elapsed: 0.001 s
% 0.22/0.27  % (800340)Peak memory usage: 12 MB
% 0.22/0.27  % (800340)Instructions burned: 1 (million)
% 0.22/0.27  % (800334)Success in time 0.026 s
% 0.22/0.27  % Vampire exiting
%------------------------------------------------------------------------------