↑ 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  : SYO107^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 : n004.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:48:58 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO107^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.16  % Computer : n004.cluster.edu
% 0.10/0.16  % Model    : x86_64 x86_64
% 0.10/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16  % Memory   : 8046.5625MB
% 0.10/0.16  % OS       : Linux 6.8.0-71-generic
% 0.10/0.16  % CPULimit : 300
% 0.10/0.16  % WCLimit  : 300
% 0.10/0.16  % DateTime : Tue Sep 29 16:33:57 UTC 2026
% 0.10/0.16  % CPUTime  : 
% 0.10/0.16  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20  Running first-order model finding
% 0.10/0.20  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.24  % (1518327)Will run a generic schedule for satisfiability detection.
% 0.10/0.24  % (1518346)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3222377240:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.24  % (1518346) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1518327-1518346"...
% 0.10/0.24  % (1518346)...printing done.
% 0.10/0.24  % (1518346)Refutation found. Thanks to Tanya!
% 0.10/0.24  % SZS status Theorem for theBenchmark
% 0.10/0.24  % SZS output start Proof for theBenchmark
% 0.10/0.24  thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.10/0.24  thf(func_def_0, type, cP: ($i > $o)).
% 0.10/0.24  thf(func_def_5, type, sK1: ($i > $i)).
% 0.10/0.24  thf(f1,conjecture,(
% 0.10/0.24    ? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) => (cP @ X1)) <=> ? [X0 : $i] : ((cP @ X0) => ! [X1 : $i] : (cP @ X1))),
% 0.10/0.24    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM66)).
% 0.10/0.24  thf(f2,negated_conjecture,(
% 0.10/0.24    ~(? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) => (cP @ X1)) <=> ? [X0 : $i] : ((cP @ X0) => ! [X1 : $i] : (cP @ X1)))),
% 0.10/0.24    inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.24  thf(f3,plain,(
% 0.10/0.24    ~(? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) => (cP @ X1)) <=> ? [X2 : $i] : ((cP @ X2) => ! [X3 : $i] : (cP @ X3)))),
% 0.10/0.24    inference(rectify,[],[f2])).
% 0.10/0.24  thf(f4,plain,(
% 0.10/0.24    ~(? [X0 : $i] : ! [X1 : $i] : ((((cP @ X0)) = $true) => (((cP @ X1)) = $true)) <=> ? [X2 : $i] : ((((cP @ X2)) = $true) => ! [X3 : $i] : (((cP @ X3)) = $true)))),
% 0.10/0.24    inference(fool_elimination,[],[f3])).
% 0.10/0.24  thf(f5,plain,(
% 0.10/0.24    ? [X0 : $i] : ! [X1 : $i] : ((((cP @ X1)) = $true) | (((cP @ X0)) != $true)) <~> ? [X2 : $i] : (! [X3 : $i] : (((cP @ X3)) = $true) | (((cP @ X2)) != $true))),
% 0.10/0.24    inference(ennf_transformation,[],[f4])).
% 0.10/0.24  thf(f6,plain,(
% 0.10/0.24    (! [X2 : $i] : (? [X3 : $i] : (((cP @ X3)) != $true) & (((cP @ X2)) = $true)) | ! [X0 : $i] : ? [X1 : $i] : ((((cP @ X1)) != $true) & (((cP @ X0)) = $true))) & (? [X2 : $i] : (! [X3 : $i] : (((cP @ X3)) = $true) | (((cP @ X2)) != $true)) | ? [X0 : $i] : ! [X1 : $i] : ((((cP @ X1)) = $true) | (((cP @ X0)) != $true)))),
% 0.10/0.24    inference(nnf_transformation,[],[f5])).
% 0.10/0.24  thf(f7,plain,(
% 0.10/0.24    (! [X0 : $i] : (? [X1 : $i] : (((cP @ X1)) != $true) & (((cP @ X0)) = $true)) | ! [X2 : $i] : ? [X3 : $i] : ((((cP @ X3)) != $true) & (((cP @ X2)) = $true))) & (? [X4 : $i] : (! [X5 : $i] : ($true = ((cP @ X5))) | ($true != ((cP @ X4)))) | ? [X6 : $i] : ! [X7 : $i] : (($true = ((cP @ X7))) | ($true != ((cP @ X6)))))),
% 0.10/0.24    inference(rectify,[],[f6])).
% 0.10/0.24  thf(f8,plain,(
% 0.10/0.24    (! [X0 : $i] : (($true != ((cP @ sK0))) & (((cP @ X0)) = $true)) | ! [X2 : $i] : (($true != ((cP @ (sK1 @ X2)))) & (((cP @ X2)) = $true))) & ((! [X5 : $i] : ($true = ((cP @ X5))) | ($true != ((cP @ sK2)))) | ! [X7 : $i] : (($true = ((cP @ X7))) | ($true != ((cP @ sK3)))))),
% 0.10/0.24    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP,sK2,sK3]),skolemize(X1,sK0),skolemize(X3,sK1 @ X2),skolemize(X4,sK2),skolemize(X6,sK3)],[f7])).
% 0.10/0.24  thf(f10,plain,(
% 0.10/0.24    ( ! [X2 : $i,X0 : $i] : ((((cP @ X0)) = $true) | (((cP @ X2)) = $true)) )),
% 0.10/0.24    inference(cnf_transformation,[],[f8])).
% 0.10/0.24  thf(f13,plain,(
% 0.10/0.24    ( ! [X2 : $i] : (($true != ((cP @ sK0))) | ($true != ((cP @ (sK1 @ X2))))) )),
% 0.10/0.24    inference(cnf_transformation,[],[f8])).
% 0.10/0.24  thf(f21,definition,(
% 0.10/0.24    spl4_2 <=> ! [X7 : $i] : ($true = ((cP @ X7)))),
% 0.10/0.24    introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition])).
% 0.10/0.24  thf(f22,plain,(
% 0.10/0.24    ( ! [X7 : $i] : (($true = ((cP @ X7)))) ) | ~spl4_2),
% 0.10/0.24    inference(avatar_component_clause,[],[f21])).
% 0.10/0.24  thf(f28,plain,(
% 0.10/0.24    spl4_2 | spl4_2),
% 0.10/0.24    inference(avatar_split_clause,[],[f10,f21,f21])).
% 0.10/0.24  thf(f30,definition,(
% 0.10/0.24    spl4_4 <=> ! [X2 : $i] : ($true != ((cP @ (sK1 @ X2))))),
% 0.10/0.24    introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition])).
% 0.10/0.24  thf(f31,plain,(
% 0.10/0.24    ( ! [X2 : $i] : (($true != ((cP @ (sK1 @ X2))))) ) | ~spl4_4),
% 0.10/0.24    inference(avatar_component_clause,[],[f30])).
% 0.10/0.24  thf(f34,definition,(
% 0.10/0.24    spl4_5 <=> ($true = ((cP @ sK0)))),
% 0.10/0.24    introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition])).
% 0.10/0.24  thf(f36,plain,(
% 0.10/0.24    ($true != ((cP @ sK0))) | spl4_5),
% 0.10/0.24    inference(avatar_component_clause,[],[f34])).
% 0.10/0.24  thf(f38,plain,(
% 0.10/0.24    spl4_4 | ~spl4_5),
% 0.10/0.24    inference(avatar_split_clause,[],[f13,f34,f30])).
% 0.10/0.24  thf(f45,plain,(
% 0.10/0.24    ($true != $true) | (~spl4_2 | spl4_5)),
% 0.10/0.24    inference(constrained_superposition,[],[f36,f22])).
% 0.10/0.24  thf(f46,plain,(
% 0.10/0.24    $false | (~spl4_2 | spl4_5)),
% 0.10/0.24    inference(trivial_inequality_removal,[],[f45])).
% 0.10/0.24  thf(f47,plain,(
% 0.10/0.24    ~spl4_2 | spl4_5),
% 0.10/0.24    inference(avatar_contradiction_clause,[],[f46])).
% 0.10/0.24  thf(f48,plain,(
% 0.10/0.24    ($true != $true) | (~spl4_2 | ~spl4_4)),
% 0.10/0.24    inference(constrained_superposition,[],[f31,f22])).
% 0.10/0.24  thf(f49,plain,(
% 0.10/0.24    $false | (~spl4_2 | ~spl4_4)),
% 0.10/0.24    inference(trivial_inequality_removal,[],[f48])).
% 0.10/0.24  thf(f50,plain,(
% 0.10/0.24    ~spl4_2 | ~spl4_4),
% 0.10/0.24    inference(avatar_contradiction_clause,[],[f49])).
% 0.10/0.24  cnf(s3, plain, spl4_2 | spl4_2, inference(sat_conversion,[],[f28])).
% 0.10/0.24  cnf(s4, plain, spl4_2, inference(rat,[],[s3])).
% 0.10/0.24  cnf(s7, plain, spl4_4 | ~spl4_5, inference(sat_conversion,[],[f38])).
% 0.10/0.24  cnf(s10, plain, ~spl4_2 | spl4_5, inference(sat_conversion,[],[f47])).
% 0.10/0.24  cnf(s11, plain, ~spl4_2 | ~spl4_4, inference(sat_conversion,[],[f50])).
% 0.10/0.24  cnf(s12, plain, ~spl4_4, inference(rat,[],[s11,s4])).
% 0.10/0.24  cnf(s13, plain, spl4_5, inference(rat,[],[s10,s4])).
% 0.10/0.24  cnf(s16, plain, $false, inference(rat,[],[s7,s13,s12])).
% 0.10/0.24  thf(f51,plain,(
% 0.10/0.24    $false),
% 0.10/0.24    inference(avatar_sat_refutation,[],[s16])).
% 0.10/0.24  % SZS output end Proof for theBenchmark
% 0.10/0.24  % (1518346)------------------------------
% 0.10/0.24  % (1518346)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.24  % (1518346)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.24  % (1518346)CaDiCaL version: 2.1.3
% 0.10/0.24  % (1518346)Termination reason: Refutation
% 0.10/0.24  % (1518346)Time elapsed: 0.002 s
% 0.10/0.24  % (1518346)Peak memory usage: 12 MB
% 0.10/0.24  % (1518346)Instructions burned: 2 (million)
% 0.10/0.24  % (1518327)Success in time 0.032 s
% 0.10/0.24  % Vampire exiting
%------------------------------------------------------------------------------