%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET044+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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 12:42:47 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 69 ( 30 ~; 21 |; 10 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 41 ( 31 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( element(X1,X0)
<=> element(X1,X1) )
=> ~ ! [X2] :
? [X3] :
! [X4] :
( element(X4,X3)
<=> ~ element(X4,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel40) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( element(X1,X0)
<=> element(X1,X1) )
=> ~ ! [X2] :
? [X3] :
! [X4] :
( element(X4,X3)
<=> ~ element(X4,X2) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ! [X2] :
? [X3] :
! [X4] :
( element(X4,X3)
<=> ~ element(X4,X2) )
& ? [X0] :
! [X1] :
( element(X1,X0)
<=> element(X1,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ! [X2] :
? [X3] :
! [X4] :
( ( element(X4,X3)
| element(X4,X2) )
& ( ~ element(X4,X2)
| ~ element(X4,X3) ) )
& ? [X0] :
! [X1] :
( ( element(X1,X0)
| ~ element(X1,X1) )
& ( element(X1,X1)
| ~ element(X1,X0) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X0] :
? [X1] :
! [X2] :
( ( element(X2,X1)
| element(X2,X0) )
& ( ~ element(X2,X0)
| ~ element(X2,X1) ) )
& ? [X3] :
! [X4] :
( ( element(X4,X3)
| ~ element(X4,X4) )
& ( element(X4,X4)
| ~ element(X4,X3) ) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ! [X0,X2] :
( ( element(X2,sK0(X0))
| element(X2,X0) )
& ( ~ element(X2,X0)
| ~ element(X2,sK0(X0)) ) )
& ! [X4] :
( ( element(X4,sK1)
| ~ element(X4,X4) )
& ( element(X4,X4)
| ~ element(X4,sK1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X1,sK0(X0)),skolemize(X3,sK1)],[f5]) ).
fof(f7,plain,
! [X4] :
( element(X4,X4)
| ~ element(X4,sK1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X4] :
( element(X4,sK1)
| ~ element(X4,X4) ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X2,X0] :
( ~ element(X2,X0)
| ~ element(X2,sK0(X0)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X0] :
( element(X2,sK0(X0))
| element(X2,X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
! [X2,X0] :
( ~ element(X2,sK0(X0))
| ~ element(X2,X0) ),
inference(consistent_polarity_flipping,[],[f10]) ).
fof(f12,plain,
! [X2,X0] :
( element(X2,sK0(X0))
| element(X2,X0) ),
inference(consistent_polarity_flipping,[],[f9]) ).
fof(f13,plain,
! [X4] :
( element(X4,X4)
| ~ element(X4,sK1) ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f14,plain,
! [X4] :
( element(X4,sK1)
| ~ element(X4,X4) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f15,plain,
! [X0] :
( ~ element(sK0(X0),X0)
| ~ element(sK0(X0),sK1) ),
inference(resolution,[],[f11,f13]) ).
fof(f19,plain,
~ element(sK0(sK1),sK1),
inference(factoring,[],[f15]) ).
fof(f20,plain,
~ element(sK0(sK1),sK0(sK1)),
inference(resolution,[],[f19,f14]) ).
fof(f21,plain,
element(sK0(sK1),sK1),
inference(resolution,[],[f20,f12]) ).
fof(f23,plain,
$false,
inference(resolution,[],[f21,f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET044+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n013.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 00:21:06 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 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.12/0.45 % (692363)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (692374)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1937216288:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.45 % (692374) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-692363-692374"...
% 0.12/0.45 % (692374)...printing done.
% 0.12/0.45 % (692374)Refutation found. Thanks to Tanya!
% 0.12/0.45 % SZS status Theorem for theBenchmark
% 0.12/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45 % (692374)------------------------------
% 0.12/0.45 % (692374)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (692374)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (692374)CaDiCaL version: 2.1.3
% 0.12/0.45 % (692374)Termination reason: Refutation
% 0.12/0.45 % (692374)Time elapsed: 0.001 s
% 0.12/0.45 % (692374)Peak memory usage: 12 MB
% 0.12/0.45 % (692374)Instructions burned: 1 (million)
% 0.12/0.45 % (692363)Success in time 0.029 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------