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