%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN957+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:22:57 PM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 9 ~; 2 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 ( 5 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
~ ? [X0] :
! [X1] :
( a(X1,X0)
<=> ~ a(X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ~ ? [X0] :
! [X1] :
( a(X1,X0)
<=> ~ a(X1,X1) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0] :
! [X1] :
( a(X1,X0)
<=> ~ a(X1,X1) ),
inference(flattening,[],[f2]) ).
fof(f4,plain,
! [X1] :
( a(X1,X1)
| a(X1,sK0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f5,plain,
! [X1] :
( ~ a(X1,X1)
| ~ a(X1,sK0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f6,plain,
a(sK0,sK0),
inference(factoring,[],[f4]) ).
fof(f10,plain,
~ a(sK0,sK0),
inference(resolution,[],[f6,f5]) ).
fof(f11,plain,
$false,
inference(forward_subsumption_resolution,[],[f10,f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN957+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.17 % Computer : n018.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 17:18:55 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 Running first-order model finding
% 0.09/0.20 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.09/0.25 % (3551935)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (3551944)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=658555463:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.25 % (3551944) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3551935-3551944"...
% 0.09/0.25 % (3551944)...printing done.
% 0.09/0.25 % (3551944)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (3551944)------------------------------
% 0.09/0.25 % (3551944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (3551944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (3551944)CaDiCaL version: 2.1.3
% 0.09/0.25 % (3551944)Termination reason: Refutation
% 0.09/0.25 % (3551944)Time elapsed: 0.001 s
% 0.09/0.25 % (3551944)Peak memory usage: 11 MB
% 0.09/0.25 % (3551935)Success in time 0.037 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------