%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET687+4 : TPTP v9.3.1. Released v2.2.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:44:26 PM UTC 2026
% Result : Theorem 0.16s 0.46s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 37 ( 15 ~; 13 |; 6 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 26 ( 23 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f12,conjecture,
! [X0] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI01) ).
fof(f13,negated_conjecture,
~ ! [X0] : subset(X0,X0),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
? [X0] : ~ subset(X0,X0),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f18,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f18]) ).
fof(f36,plain,
~ subset(sK3,sK3),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f16]) ).
fof(f38,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f39,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f63,plain,
~ subset(sK3,sK3),
inference(cnf_transformation,[],[f36]) ).
fof(f70,plain,
! [X0] :
( subset(X0,X0)
| subset(X0,X0) ),
inference(resolution,[],[f39,f38]) ).
fof(f71,plain,
! [X0] : subset(X0,X0),
inference(duplicate_literal_removal,[],[f70]) ).
fof(f72,plain,
$false,
inference(resolution,[],[f71,f63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET687+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n008.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 02:34:55 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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/0.46 % (1815374)Will run a generic schedule for satisfiability detection.
% 0.16/0.46 % (1815384)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2528517584:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.46 % (1815384) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1815374-1815384"...
% 0.16/0.46 % (1815384)...printing done.
% 0.16/0.46 % (1815384)Refutation found. Thanks to Tanya!
% 0.16/0.46 % SZS status Theorem for theBenchmark
% 0.16/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.46 % (1815384)------------------------------
% 0.16/0.46 % (1815384)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.46 % (1815384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.46 % (1815384)CaDiCaL version: 2.1.3
% 0.16/0.46 % (1815384)Termination reason: Refutation
% 0.16/0.46 % (1815384)Time elapsed: 0.001 s
% 0.16/0.46 % (1815384)Peak memory usage: 11 MB
% 0.16/0.46 % (1815384)Instructions burned: 1 (million)
% 0.16/0.46 % (1815374)Success in time 0.032 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------