↑ 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  : SEV054^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n007.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:55 AM UTC 2026

% Result   : Theorem 0.10s 0.25s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV054^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18  % Computer : n007.cluster.edu
% 0.10/0.18  % Model    : x86_64 x86_64
% 0.10/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18  % Memory   : 8046.5625MB
% 0.10/0.18  % OS       : Linux 6.8.0-71-generic
% 0.10/0.18  % CPULimit : 300
% 0.10/0.18  % WCLimit  : 300
% 0.10/0.18  % DateTime : Tue Sep 29 15:03:41 UTC 2026
% 0.10/0.18  % CPUTime  : 
% 0.10/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21  Running first-order model finding
% 0.10/0.22  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.25  % (3476229)Will run a generic schedule for satisfiability detection.
% 0.10/0.25  % (3476236)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=807610306:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.25  % (3476236) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3476229-3476236"...
% 0.10/0.25  % (3476236)...printing done.
% 0.10/0.25  % (3476236)Refutation found. Thanks to Tanya!
% 0.10/0.25  % SZS status Theorem for theBenchmark
% 0.10/0.25  % SZS output start Proof for theBenchmark
% 0.10/0.25  thf(type_def_5, type, a: $tType).
% 0.10/0.25  thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.10/0.25  thf(func_def_3, type, sK0: (a > a > $o)).
% 0.10/0.25  thf(func_def_4, type, sK1: ((a > $o) > a)).
% 0.10/0.25  thf(func_def_5, type, sK2: (a > a)).
% 0.10/0.25  thf(func_def_6, type, sK3: (a > (a > $o) > a)).
% 0.10/0.25  thf(func_def_7, type, vNOT: ($o > $o)).
% 0.10/0.25  thf(func_def_9, type, db0: !>[X0: $tType]:(X0)).
% 0.10/0.25  thf(func_def_10, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.10/0.25  thf(f1,conjecture,(
% 0.10/0.25    ! [X0 : (a > a > $o),X1 : ((a > $o) > a)] : ((! [X5 : (a > $o)] : (! [X6 : a] : (! [X7 : a] : ((X5 @ X7) => (X0 @ X7 @ X6)) => (X0 @ (X1 @ X5) @ X6)) & ! [X4 : a] : ((X5 @ X4) => (X0 @ X4 @ (X1 @ X5)))) & ! [X2 : a,X3 : a,X4 : a] : (((X0 @ X3 @ X4) & (X0 @ X2 @ X3)) => (X0 @ X2 @ X4))) => ! [X8 : (a > a)] : (! [X2 : a,X3 : a] : ((X0 @ X2 @ X3) => (X0 @ (X8 @ X2) @ (X8 @ X3))) => ? [X9 : a] : (X0 @ (X8 @ X9) @ X9)))),
% 0.10/0.25    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM403_pme)).
% 0.10/0.25  thf(f2,negated_conjecture,(
% 0.10/0.25    ~ ! [X0 : (a > a > $o),X1 : ((a > $o) > a)] : ((! [X5 : (a > $o)] : (! [X6 : a] : (! [X7 : a] : ((X5 @ X7) => (X0 @ X7 @ X6)) => (X0 @ (X1 @ X5) @ X6)) & ! [X4 : a] : ((X5 @ X4) => (X0 @ X4 @ (X1 @ X5)))) & ! [X2 : a,X3 : a,X4 : a] : (((X0 @ X3 @ X4) & (X0 @ X2 @ X3)) => (X0 @ X2 @ X4))) => ! [X8 : (a > a)] : (! [X2 : a,X3 : a] : ((X0 @ X2 @ X3) => (X0 @ (X8 @ X2) @ (X8 @ X3))) => ? [X9 : a] : (X0 @ (X8 @ X9) @ X9)))),
% 0.10/0.25    inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.25  thf(f3,plain,(
% 0.10/0.25    ~ ! [X0 : (a > a > $o),X1 : ((a > $o) > a)] : ((! [X2 : (a > $o)] : (! [X3 : a] : (! [X4 : a] : ((X2 @ X4) => (X0 @ X4 @ X3)) => (X0 @ (X1 @ X2) @ X3)) & ! [X5 : a] : ((X2 @ X5) => (X0 @ X5 @ (X1 @ X2)))) & ! [X6 : a,X7 : a,X8 : a] : (((X0 @ X7 @ X8) & (X0 @ X6 @ X7)) => (X0 @ X6 @ X8))) => ! [X9 : (a > a)] : (! [X10 : a,X11 : a] : ((X0 @ X10 @ X11) => (X0 @ (X9 @ X10) @ (X9 @ X11))) => ? [X12 : a] : (X0 @ (X9 @ X12) @ X12)))),
% 0.10/0.25    inference(rectify,[],[f2])).
% 0.10/0.25  thf(f4,plain,(
% 0.10/0.25    ~ ! [X0 : (a > a > $o),X1 : ((a > $o) > a)] : ((! [X2 : (a > $o)] : (! [X3 : a] : (! [X4 : a] : ((((X2 @ X4)) = $true) => (((X0 @ X4 @ X3)) = $true)) => (((X0 @ (X1 @ X2) @ X3)) = $true)) & ! [X5 : a] : ((((X2 @ X5)) = $true) => (((X0 @ X5 @ (X1 @ X2))) = $true))) & ! [X6 : a,X7 : a,X8 : a] : (((((X0 @ X7 @ X8)) = $true) & (((X0 @ X6 @ X7)) = $true)) => (((X0 @ X6 @ X8)) = $true))) => ! [X9 : (a > a)] : (! [X10 : a,X11 : a] : ((((X0 @ X10 @ X11)) = $true) => (((X0 @ (X9 @ X10) @ (X9 @ X11))) = $true)) => ? [X12 : a] : (((X0 @ (X9 @ X12) @ X12)) = $true)))),
% 0.10/0.25    inference(fool_elimination,[],[f3])).
% 0.10/0.25  thf(f5,plain,(
% 0.10/0.25    ? [X0 : (a > a > $o),X1 : ((a > $o) > a)] : (? [X9 : (a > a)] : (! [X12 : a] : (((X0 @ (X9 @ X12) @ X12)) != $true) & ! [X10 : a,X11 : a] : ((((X0 @ (X9 @ X10) @ (X9 @ X11))) = $true) | (((X0 @ X10 @ X11)) != $true))) & (! [X2 : (a > $o)] : (! [X3 : a] : ((((X0 @ (X1 @ X2) @ X3)) = $true) | ? [X4 : a] : ((((X0 @ X4 @ X3)) != $true) & (((X2 @ X4)) = $true))) & ! [X5 : a] : ((((X0 @ X5 @ (X1 @ X2))) = $true) | (((X2 @ X5)) != $true))) & ! [X6 : a,X7 : a,X8 : a] : ((((X0 @ X6 @ X8)) = $true) | ((((X0 @ X7 @ X8)) != $true) | (((X0 @ X6 @ X7)) != $true)))))),
% 0.10/0.25    inference(ennf_transformation,[],[f4])).
% 0.10/0.25  thf(f6,plain,(
% 0.10/0.25    ? [X0 : (a > a > $o),X1 : ((a > $o) > a)] : (? [X9 : (a > a)] : (! [X12 : a] : (((X0 @ (X9 @ X12) @ X12)) != $true) & ! [X10 : a,X11 : a] : ((((X0 @ (X9 @ X10) @ (X9 @ X11))) = $true) | (((X0 @ X10 @ X11)) != $true))) & ! [X2 : (a > $o)] : (! [X3 : a] : ((((X0 @ (X1 @ X2) @ X3)) = $true) | ? [X4 : a] : ((((X0 @ X4 @ X3)) != $true) & (((X2 @ X4)) = $true))) & ! [X5 : a] : ((((X0 @ X5 @ (X1 @ X2))) = $true) | (((X2 @ X5)) != $true))) & ! [X6 : a,X7 : a,X8 : a] : ((((X0 @ X6 @ X8)) = $true) | (((X0 @ X7 @ X8)) != $true) | (((X0 @ X6 @ X7)) != $true)))),
% 0.10/0.25    inference(flattening,[],[f5])).
% 0.10/0.25  thf(f7,plain,(
% 0.10/0.25    ? [X0 : (a > a > $o),X1 : ((a > $o) > a)] : (? [X2 : (a > a)] : (! [X3 : a] : ($true != ((X0 @ (X2 @ X3) @ X3))) & ! [X4 : a,X5 : a] : (($true = ((X0 @ (X2 @ X4) @ (X2 @ X5)))) | ($true != ((X0 @ X4 @ X5))))) & ! [X6 : (a > $o)] : (! [X7 : a] : (($true = ((X0 @ (X1 @ X6) @ X7))) | ? [X8 : a] : (($true != ((X0 @ X8 @ X7))) & ($true = ((X6 @ X8))))) & ! [X9 : a] : (($true = ((X0 @ X9 @ (X1 @ X6)))) | ($true != ((X6 @ X9))))) & ! [X10 : a,X11 : a,X12 : a] : (($true = ((X0 @ X10 @ X12))) | ($true != ((X0 @ X11 @ X12))) | (((X0 @ X10 @ X11)) != $true)))),
% 0.10/0.25    inference(rectify,[],[f6])).
% 0.10/0.25  thf(f8,plain,(
% 0.10/0.25    (! [X3 : a] : ($true != ((sK0 @ (sK2 @ X3) @ X3))) & ! [X4 : a,X5 : a] : (($true = ((sK0 @ (sK2 @ X4) @ (sK2 @ X5)))) | ($true != ((sK0 @ X4 @ X5))))) & ! [X6 : (a > $o)] : (! [X7 : a] : (($true = ((sK0 @ (sK1 @ X6) @ X7))) | (($true != ((sK0 @ (sK3 @ X7 @ X6) @ X7))) & ($true = ((X6 @ (sK3 @ X7 @ X6)))))) & ! [X9 : a] : (($true = ((sK0 @ X9 @ (sK1 @ X6)))) | ($true != ((X6 @ X9))))) & ! [X10 : a,X11 : a,X12 : a] : (($true = ((sK0 @ X10 @ X12))) | ($true != ((sK0 @ X11 @ X12))) | ($true != ((sK0 @ X10 @ X11))))),
% 0.10/0.25    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,vAPP]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X8,sK3 @ X7 @ X6)],[f7])).
% 0.10/0.25  thf(f10,plain,(
% 0.10/0.25    ( ! [X6 : (a > $o),X9 : a] : (($true != ((X6 @ X9))) | ($true = ((sK0 @ X9 @ (sK1 @ X6))))) )),
% 0.10/0.25    inference(cnf_transformation,[],[f8])).
% 0.10/0.25  thf(f14,plain,(
% 0.10/0.25    ( ! [X3 : a] : (($true != ((sK0 @ (sK2 @ X3) @ X3)))) )),
% 0.10/0.25    inference(cnf_transformation,[],[f8])).
% 0.10/0.25  thf(f26,plain,(
% 0.10/0.25    ( ! [X0 : a] : (($true = ((sK0 @ X0 @ (sK1 @ (^[Y0 : a]: ($true))))))) )),
% 0.10/0.25    inference(equality_resolution,[],[f10])).
% 0.10/0.25  thf(f54,plain,(
% 0.10/0.25    ($true != $true)),
% 0.10/0.25    inference(constrained_superposition,[],[f14,f26])).
% 0.10/0.25  thf(f61,plain,(
% 0.10/0.25    $false),
% 0.10/0.25    inference(trivial_inequality_removal,[],[f54])).
% 0.10/0.25  % SZS output end Proof for theBenchmark
% 0.10/0.25  % (3476236)------------------------------
% 0.10/0.25  % (3476236)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25  % (3476236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25  % (3476236)CaDiCaL version: 2.1.3
% 0.10/0.25  % (3476236)Termination reason: Refutation
% 0.10/0.25  % (3476236)Time elapsed: 0.002 s
% 0.10/0.25  % (3476236)Peak memory usage: 12 MB
% 0.10/0.25  % (3476236)Instructions burned: 5 (million)
% 0.10/0.25  % (3476229)Success in time 0.029 s
% 0.10/0.25  % Vampire exiting
%------------------------------------------------------------------------------