%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET045+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 : n008.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:48 PM UTC 2026
% Result : Theorem 0.16s 5.64s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 38 ( 17 ~; 13 |; 7 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 24 ( 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
? [X1] :
! [X2] :
( element(X2,X1)
<=> ( element(X2,X0)
& ~ element(X2,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel41_1) ).
fof(f2,conjecture,
~ ? [X0] :
! [X1] : element(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel41) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
! [X1] : element(X1,X0),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
? [X0] :
! [X1] : element(X1,X0),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0] :
? [X1] :
! [X2] :
( ( element(X2,X1)
| ~ element(X2,X0)
| element(X2,X2) )
& ( ( element(X2,X0)
& ~ element(X2,X2) )
| ~ element(X2,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f6,plain,
! [X0] :
? [X1] :
! [X2] :
( ( element(X2,X1)
| ~ element(X2,X0)
| element(X2,X2) )
& ( ( element(X2,X0)
& ~ element(X2,X2) )
| ~ element(X2,X1) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
! [X0,X2] :
( ( element(X2,sK0(X0))
| ~ element(X2,X0)
| element(X2,X2) )
& ( ( element(X2,X0)
& ~ element(X2,X2) )
| ~ element(X2,sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f6]) ).
fof(f8,plain,
! [X1] : element(X1,sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f4]) ).
fof(f9,plain,
! [X2,X0] :
( ~ element(X2,sK0(X0))
| ~ element(X2,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2,X0] :
( ~ element(X2,X0)
| element(X2,sK0(X0))
| element(X2,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
! [X1] : element(X1,sK1),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0] :
( element(X0,sK0(sK1))
| element(X0,X0) ),
inference(resolution,[],[f11,f12]) ).
fof(f20,plain,
element(sK0(sK1),sK0(sK1)),
inference(factoring,[],[f13]) ).
fof(f24,plain,
~ element(sK0(sK1),sK0(sK1)),
inference(resolution,[],[f20,f9]) ).
fof(f26,plain,
$false,
inference(forward_subsumption_resolution,[],[f24,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET045+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/5.57 % Computer : n008.cluster.edu
% 0.13/5.57 % Model : x86_64 x86_64
% 0.13/5.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.57 % Memory : 8046.5625MB
% 0.13/5.57 % OS : Linux 6.8.0-71-generic
% 0.13/5.57 % CPULimit : 300
% 0.13/5.57 % WCLimit : 300
% 0.13/5.57 % DateTime : Mon Sep 28 00:22:34 UTC 2026
% 0.13/5.57 % CPUTime :
% 0.13/5.57 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/5.60 Running first-order model finding
% 0.16/5.60 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.16/5.64 % (1752882)Will run a generic schedule for satisfiability detection.
% 0.16/5.64 % (1752890)dis+10_1_sil=32000:sp=arity:random_seed=2364654556:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/5.64 % (1752890) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1752882-1752890"...
% 0.16/5.64 % (1752890)...printing done.
% 0.16/5.64 % (1752890)Refutation found. Thanks to Tanya!
% 0.16/5.64 % SZS status Theorem for theBenchmark
% 0.16/5.64 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/5.64 % (1752890)------------------------------
% 0.16/5.64 % (1752890)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/5.64 % (1752890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/5.64 % (1752890)CaDiCaL version: 2.1.3
% 0.16/5.64 % (1752890)Termination reason: Refutation
% 0.16/5.64 % (1752890)Time elapsed: 0.001 s
% 0.16/5.64 % (1752890)Peak memory usage: 11 MB
% 0.16/5.64 % (1752882)Success in time 0.029 s
% 0.16/5.64 % Vampire exiting
%------------------------------------------------------------------------------