%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWB003+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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 : Tue Sep 29 01:00:28 PM UTC 2026
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 7 unt; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 4 ( 2 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] : iext(uri_ex_p,uri_ex_s,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
fof(f2,negated_conjecture,
~ ? [X0] : iext(uri_ex_p,uri_ex_s,X0),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,axiom,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
fof(f4,plain,
! [X0] : ~ iext(uri_ex_p,uri_ex_s,X0),
inference(ennf_transformation,[],[f2]) ).
fof(f5,plain,
! [X0] : ~ iext(uri_ex_p,uri_ex_s,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f6,plain,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
inference(cnf_transformation,[],[f3]) ).
fof(f7,plain,
$false,
inference(resolution,[],[f6,f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB003+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n006.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 06:54:10 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.46 % (3781540)Will run a generic schedule for satisfiability detection.
% 0.20/0.46 % (3781549)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3013137360:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.46 % (3781549) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3781540-3781549"...
% 0.20/0.46 % (3781549)...printing done.
% 0.20/0.46 % (3781549)Refutation found. Thanks to Tanya!
% 0.20/0.46 % SZS status Theorem for theBenchmark
% 0.20/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.46 % (3781549)------------------------------
% 0.20/0.46 % (3781549)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.46 % (3781549)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.46 % (3781549)CaDiCaL version: 2.1.3
% 0.20/0.46 % (3781549)Termination reason: Refutation
% 0.20/0.46 % (3781549)Time elapsed: 0.0000 s
% 0.20/0.46 % (3781549)Peak memory usage: 11 MB
% 0.20/0.46 % (3781540)Success in time 0.036 s
% 0.20/0.46 % Vampire exiting
%------------------------------------------------------------------------------