%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n005.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:47:23 PM UTC 2026
% Result : Theorem 2.64s 11.28s
% Output : Refutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 68 ( 13 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 65 ( 29 ~; 21 |; 9 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 57 ( 51 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
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(f11,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_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(f22,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& subset(X0,X1)
& disjoint(X1,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f23,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& subset(X0,X1)
& disjoint(X1,X2) ),
inference(flattening,[],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f25,plain,
! [X0] :
( X0 = empty_set
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f14]) ).
fof(f26,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f29,plain,
( ~ disjoint(sK0,sK2)
& subset(sK0,sK1)
& disjoint(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f23]) ).
fof(f30,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(f33,plain,
disjoint(sK1,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f34,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f35,plain,
~ disjoint(sK0,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f36,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f37,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f38,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f39,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
! [X2,X0,X1] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f44,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f53,plain,
~ disjoint(sK2,sK0),
inference(resolution,[],[f36,f35]) ).
fof(f76,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X1,X0) ),
inference(superposition,[],[f38,f44]) ).
fof(f91,plain,
! [X2,X0,X1] :
( subset(set_intersection2(X0,X1),empty_set)
| ~ subset(X0,X2)
| ~ disjoint(X2,X1) ),
inference(superposition,[],[f40,f37]) ).
fof(f298,plain,
! [X2,X0,X1] :
( empty_set = set_intersection2(X0,X2)
| ~ disjoint(X1,X2)
| ~ subset(X0,X1) ),
inference(resolution,[],[f91,f39]) ).
fof(f788,plain,
! [X2,X0,X1] :
( empty_set != empty_set
| disjoint(X1,X0)
| ~ disjoint(X2,X1)
| ~ subset(X0,X2) ),
inference(superposition,[],[f76,f298]) ).
fof(f822,plain,
! [X2,X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X2,X1)
| ~ subset(X0,X2) ),
inference(trivial_inequality_removal,[],[f788]) ).
fof(f2112,plain,
! [X0] :
( ~ subset(sK0,X0)
| ~ disjoint(X0,sK2) ),
inference(resolution,[],[f822,f53]) ).
fof(f2126,plain,
~ disjoint(sK1,sK2),
inference(resolution,[],[f2112,f34]) ).
fof(f2137,plain,
$false,
inference(forward_subsumption_resolution,[],[f2126,f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU140+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.40 % Computer : n005.cluster.edu
% 0.13/10.40 % Model : x86_64 x86_64
% 0.13/10.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.40 % Memory : 8046.5625MB
% 0.13/10.40 % OS : Linux 6.8.0-71-generic
% 0.13/10.40 % CPULimit : 300
% 0.13/10.40 % WCLimit : 300
% 0.13/10.40 % DateTime : Mon Sep 28 03:41:59 UTC 2026
% 0.13/10.40 % CPUTime :
% 0.13/10.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.44 Running first-order theorem proving
% 0.13/10.44 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/11.28 % (414144)Detected formulas, will run a generic FOF schedule.
% 2.64/11.28 % (414153)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3504269963:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.64/11.28 % (414153)First to succeed.
% 2.64/11.28 % (414153)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-414144"
% 2.64/11.28 % (414150)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1468411657:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.64/11.28 % (414151)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2391972567:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.64/11.28 % (414155)dis-21_1_sil=8000:lcm=predicate:random_seed=2968643519:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.64/11.28 % (414154)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1169966085:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.64/11.28 % (414152)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=564812745:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.64/11.28 % (414149)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=279848751:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.64/11.28 % (414152)Refutation not found, incomplete strategy
% 2.64/11.28 % (414152)------------------------------
% 2.64/11.28 % (414152)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/11.28 % (414152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/11.28 % (414152)CaDiCaL version: 2.1.3
% 2.64/11.28 % (414152)Termination reason: Refutation not found, incomplete strategy
% 2.64/11.28 % (414152)Time elapsed: 0.001 s
% 2.64/11.28 % (414152)Peak memory usage: 88 MB
% 2.64/11.28 % (414155)Refutation not found, incomplete strategy
% 2.64/11.28 % (414155)------------------------------
% 2.64/11.28 % (414155)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/11.28 % (414155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/11.28 % (414155)CaDiCaL version: 2.1.3
% 2.64/11.28 % (414155)Termination reason: Refutation not found, incomplete strategy
% 2.64/11.28 % (414155)Time elapsed: 0.002 s
% 2.64/11.28 % (414155)Peak memory usage: 88 MB
% 2.64/11.28 % (414155)Instructions burned: 1 (million)
% 2.64/11.28 % (414154)Also succeeded, but the first one will report.
% 2.64/11.28 % (414153)Refutation found. Thanks to Tanya!
% 2.64/11.28 % SZS status Theorem for theBenchmark
% 2.64/11.28 % SZS output start Proof for theBenchmark
% See solution above
% 2.64/11.28 % (414153)------------------------------
% 2.64/11.28 % (414153)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/11.28 % (414153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/11.28 % (414153)CaDiCaL version: 2.1.3
% 2.64/11.28 % (414153)Termination reason: Refutation
% 2.64/11.28 % (414153)Time elapsed: 0.017 s
% 2.64/11.28 % (414153)Peak memory usage: 88 MB
% 2.64/11.28 % (414153)Instructions burned: 51 (million)
% 2.64/11.28 % (414153)------------------------------
% 2.64/11.28 % (414153)------------------------------
% 2.64/11.28 % (414144)Success in time 0.308 s
% 2.64/11.28 % Vampire exiting
%------------------------------------------------------------------------------