%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU140+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:04 PM UTC 2026
% Result : Theorem 0.11s 5.47s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 50 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 41 ( 16 ~; 11 |; 9 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 28 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f12,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f14,axiom,
! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f15,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f25,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f26,plain,
! [X0] :
( X0 = empty_set
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f14]) ).
fof(f27,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& subset(X0,X1)
& disjoint(X1,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f28,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& subset(X0,X1)
& disjoint(X1,X2) ),
inference(flattening,[],[f27]) ).
fof(f31,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f34,plain,
( ~ disjoint(sK2,sK4)
& subset(sK2,sK3)
& disjoint(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f28]) ).
fof(f36,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f31]) ).
fof(f37,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f44,plain,
! [X2,X0,X1] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f47,plain,
disjoint(sK3,sK4),
inference(cnf_transformation,[],[f34]) ).
fof(f48,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f34]) ).
fof(f49,plain,
~ disjoint(sK2,sK4),
inference(cnf_transformation,[],[f34]) ).
fof(f200,plain,
empty_set = set_intersection2(sK3,sK4),
inference(resolution,[],[f36,f47]) ).
fof(f280,plain,
! [X0] :
( subset(set_intersection2(X0,sK4),empty_set)
| ~ subset(X0,sK3) ),
inference(superposition,[],[f44,f200]) ).
fof(f316,plain,
! [X0] :
( ~ subset(X0,sK3)
| empty_set = set_intersection2(X0,sK4) ),
inference(resolution,[],[f280,f46]) ).
fof(f364,plain,
empty_set = set_intersection2(sK2,sK4),
inference(resolution,[],[f316,f48]) ).
fof(f405,plain,
( empty_set != empty_set
| disjoint(sK2,sK4) ),
inference(superposition,[],[f37,f364]) ).
fof(f406,plain,
disjoint(sK2,sK4),
inference(trivial_inequality_removal,[],[f405]) ).
fof(f408,plain,
$false,
inference(forward_subsumption_resolution,[],[f406,f49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU140+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/5.40 % Computer : n011.cluster.edu
% 0.11/5.40 % Model : x86_64 x86_64
% 0.11/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.40 % Memory : 8046.5625MB
% 0.11/5.40 % OS : Linux 6.8.0-71-generic
% 0.11/5.40 % CPULimit : 300
% 0.11/5.40 % WCLimit : 300
% 0.11/5.40 % DateTime : Mon Sep 28 03:42:06 UTC 2026
% 0.11/5.40 % CPUTime :
% 0.11/5.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/5.43 Running first-order model finding
% 0.11/5.43 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.11/5.47 % (2995373)Will run a generic schedule for satisfiability detection.
% 0.11/5.47 % (2995380)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=593055463:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/5.47 % (2995379)% WARNING: option uhcvi not known.
% 0.11/5.47 % (2995380) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2995373-2995380"...
% 0.11/5.47 % (2995380)...printing done.
% 0.11/5.47 % (2995380)Refutation found. Thanks to Tanya!
% 0.11/5.47 % SZS status Theorem for theBenchmark
% 0.11/5.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/5.47 % (2995380)------------------------------
% 0.11/5.47 % (2995380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/5.47 % (2995380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/5.47 % (2995380)CaDiCaL version: 2.1.3
% 0.11/5.47 % (2995380)Termination reason: Refutation
% 0.11/5.47 % (2995380)Time elapsed: 0.004 s
% 0.11/5.47 % (2995380)Peak memory usage: 12 MB
% 0.11/5.47 % (2995380)Instructions burned: 8 (million)
% 0.11/5.47 % (2995373)Success in time 0.028 s
% 0.11/5.47 % Vampire exiting
%------------------------------------------------------------------------------