%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU153+1 : 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.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 52 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 23 ~; 15 |; 4 &)
% ( 6 <=>; 1 =>; 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; 3 con; 0-2 aty)
% Number of variables : 43 ( 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f4,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f6,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f12,conjecture,
! [X0,X1] :
~ ( disjoint(singleton(X0),X1)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_zfmisc_1) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] :
~ ( disjoint(singleton(X0),X1)
& in(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f16,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f19,plain,
? [X0,X1] :
( disjoint(singleton(X0),X1)
& in(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f20,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f23,plain,
! [X2,X0,X1] :
( X0 != X2
| in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f3]) ).
fof(f28,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f4]) ).
fof(f34,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f5]) ).
fof(f36,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f6]) ).
fof(f39,plain,
in(sK3,sK4),
inference(cnf_transformation,[],[f19]) ).
fof(f40,plain,
disjoint(singleton(sK3),sK4),
inference(cnf_transformation,[],[f19]) ).
fof(f43,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f45,plain,
! [X2,X1] :
( in(X2,X1)
| singleton(X2) != X1 ),
inference(equality_resolution,[],[f23]) ).
fof(f46,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f45]) ).
fof(f47,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f28]) ).
fof(f48,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ in(X3,X0)
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f34]) ).
fof(f51,plain,
disjoint(sK4,singleton(sK3)),
inference(resolution,[],[f43,f40]) ).
fof(f63,plain,
empty_set = set_intersection2(sK4,singleton(sK3)),
inference(resolution,[],[f36,f51]) ).
fof(f84,plain,
! [X0] :
( in(X0,empty_set)
| ~ in(X0,sK4)
| ~ in(X0,singleton(sK3)) ),
inference(superposition,[],[f48,f63]) ).
fof(f86,plain,
! [X0] :
( ~ in(X0,singleton(sK3))
| ~ in(X0,sK4) ),
inference(forward_subsumption_resolution,[],[f84,f47]) ).
fof(f87,plain,
~ in(sK3,sK4),
inference(resolution,[],[f86,f46]) ).
fof(f98,plain,
$false,
inference(forward_subsumption_resolution,[],[f87,f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU153+1 : 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.36 % Computer : n003.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 28 03:47:57 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.11/0.45 % (1165160)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (1165165)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4153717997_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % TRYING [1]
% 0.11/0.45 % TRYING [2]
% 0.11/0.45 % TRYING [3]
% 0.11/0.45 % TRYING [4]
% 0.11/0.45 % TRYING [5]
% 0.11/0.45 % (1165167)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=840734897:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (1165168)dis+10_1_sil=32000:sp=arity:random_seed=475259974:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (1165169)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1426686408:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (1165170)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=279213823:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (1165171)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2267448519:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % (1165168) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1165160-1165168"...
% 0.11/0.45 % (1165169) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1165160-1165169"...
% 0.11/0.45 % TRYING [6]
% 0.11/0.45 % (1165166)% WARNING: option uhcvi not known.
% 0.11/0.45 % (1165171) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1165160-1165171"...
% 0.11/0.45 % (1165169)...printing done.
% 0.11/0.45 % (1165168)...printing done.
% 0.11/0.45 % (1165170) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1165160-1165170"...
% 0.11/0.45 % (1165169)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (1165169)------------------------------
% 0.11/0.45 % (1165169)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (1165169)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (1165169)CaDiCaL version: 2.1.3
% 0.11/0.45 % (1165169)Termination reason: Refutation
% 0.11/0.45 % (1165169)Time elapsed: 0.003 s
% 0.11/0.45 % (1165169)Peak memory usage: 12 MB
% 0.11/0.45 % (1165169)Instructions burned: 3 (million)
% 0.11/0.45 % (1165160)Success in time 0.041 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------