%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN389+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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 02:07:33 PM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 16 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 3 ( 2 usr; 3 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ( p
=> q )
=> p )
=> p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel8) ).
fof(f2,negated_conjecture,
~ ( ( ( p
=> q )
=> p )
=> p ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ( ~ p
=> p )
=> p ),
inference(pure_predicate_removal,[],[f2]) ).
fof(f4,plain,
( ~ p
& ( p
| p ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( p
| p ),
inference(cnf_transformation,[],[f4]) ).
fof(f6,plain,
~ p,
inference(cnf_transformation,[],[f4]) ).
fof(f7,plain,
p,
inference(duplicate_literal_removal,[],[f5]) ).
fof(f8,plain,
$false,
inference(resolution,[],[f7,f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN389+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 % Computer : n003.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 15:55:43 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/0.23 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.28 % (1719500)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (1719511)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1489883115:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (1719511) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1719500-1719511"...
% 0.20/0.28 % (1719511)...printing done.
% 0.20/0.28 % (1719511)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (1719511)------------------------------
% 0.20/0.28 % (1719511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1719511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1719511)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1719511)Termination reason: Refutation
% 0.20/0.28 % (1719511)Time elapsed: 0.0000 s
% 0.20/0.28 % (1719511)Peak memory usage: 11 MB
% 0.20/0.28 % (1719500)Success in time 0.039 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------