%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU154+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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:52:08 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 49 ( 10 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 24 ~; 10 |; 13 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 30 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f33,conjecture,
! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(f34,negated_conjecture,
~ ! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f60,axiom,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X2] :
( in(X2,X0)
& in(X2,X1) )
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f69,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f83,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X3] :
( in(X3,X0)
& in(X3,X1) )
& disjoint(X0,X1) ) ),
inference(rectify,[],[f60]) ).
fof(f95,plain,
? [X0,X1] :
( ~ disjoint(singleton(X0),X1)
& ~ in(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f109,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] :
( in(X2,X0)
& in(X2,X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f133,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f181,plain,
~ in(sK8,sK9),
inference(cnf_transformation,[],[f95]) ).
fof(f182,plain,
~ disjoint(singleton(sK8),sK9),
inference(cnf_transformation,[],[f95]) ).
fof(f214,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK13(X0,X1),X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f215,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK13(X0,X1),X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f226,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f69]) ).
fof(f240,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f133,f226]) ).
fof(f254,plain,
~ disjoint(unordered_pair(sK8,sK8),sK9),
inference(definition_unfolding,[],[f182,f226]) ).
fof(f274,plain,
! [X2,X0] :
( ~ in(X2,unordered_pair(X0,X0))
| X0 = X2 ),
inference(equality_resolution,[],[f240]) ).
fof(f391,plain,
in(sK13(unordered_pair(sK8,sK8),sK9),sK9),
inference(resolution,[],[f214,f254]) ).
fof(f396,plain,
in(sK13(unordered_pair(sK8,sK8),sK9),unordered_pair(sK8,sK8)),
inference(resolution,[],[f215,f254]) ).
fof(f429,plain,
sK8 = sK13(unordered_pair(sK8,sK8),sK9),
inference(resolution,[],[f274,f396]) ).
fof(f435,plain,
in(sK8,sK9),
inference(superposition,[],[f391,f429]) ).
fof(f436,plain,
$false,
inference(forward_subsumption_resolution,[],[f435,f181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU154+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n003.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 03:48:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.16/0.47 % (1165954)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (1165963)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2398426353:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (1165960)% WARNING: option uhcvi not known.
% 0.16/0.47 % (1165963) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1165954-1165963"...
% 0.16/0.47 % (1165963)...printing done.
% 0.16/0.47 % (1165963)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (1165963)------------------------------
% 0.16/0.47 % (1165963)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (1165963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (1165963)CaDiCaL version: 2.1.3
% 0.16/0.47 % (1165963)Termination reason: Refutation
% 0.16/0.47 % (1165963)Time elapsed: 0.005 s
% 0.16/0.47 % (1165963)Peak memory usage: 12 MB
% 0.16/0.47 % (1165963)Instructions burned: 13 (million)
% 0.16/0.47 % (1165954)Success in time 0.04 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------