%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU140+2 : 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 : n007.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 3.73s 1.49s
% Output : Refutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 96 ( 39 ~; 24 |; 28 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 45 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f43,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/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f51,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f52,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f51]) ).
fof(f62,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,[],[f43]) ).
fof(f67,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f82,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,[],[f62]) ).
fof(f87,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& subset(X0,X1)
& disjoint(X1,X2) ),
inference(ennf_transformation,[],[f52]) ).
fof(f88,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& subset(X0,X1)
& disjoint(X1,X2) ),
inference(flattening,[],[f87]) ).
fof(f103,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f67]) ).
fof(f104,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f103]) ).
fof(f105,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f104]) ).
fof(f121,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ( in(sK8(X0,X1),X0)
& in(sK8(X0,X1),X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0,X1))],[f82]) ).
fof(f123,plain,
( ~ disjoint(sK10,sK12)
& subset(sK10,sK11)
& disjoint(sK11,sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12)],[f88]) ).
fof(f139,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f186,plain,
! [X3,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X3,X1)
| ~ in(X3,X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f187,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK8(X0,X1),X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f188,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK8(X0,X1),X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f197,plain,
disjoint(sK11,sK12),
inference(cnf_transformation,[],[f123]) ).
fof(f198,plain,
subset(sK10,sK11),
inference(cnf_transformation,[],[f123]) ).
fof(f199,plain,
~ disjoint(sK10,sK12),
inference(cnf_transformation,[],[f123]) ).
fof(f279,plain,
in(sK8(sK10,sK12),sK12),
inference(resolution,[],[f187,f199]) ).
fof(f281,plain,
in(sK8(sK10,sK12),sK10),
inference(resolution,[],[f188,f199]) ).
fof(f313,plain,
! [X0] :
( ~ in(X0,sK12)
| ~ in(X0,sK11) ),
inference(resolution,[],[f186,f197]) ).
fof(f317,plain,
~ in(sK8(sK10,sK12),sK11),
inference(resolution,[],[f313,f279]) ).
fof(f327,plain,
! [X0] :
( in(X0,sK11)
| ~ in(X0,sK10) ),
inference(resolution,[],[f139,f198]) ).
fof(f331,plain,
~ in(sK8(sK10,sK12),sK10),
inference(resolution,[],[f327,f317]) ).
fof(f335,plain,
$false,
inference(resolution,[],[f331,f281]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU140+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 03:40:55 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 3.73/1.49 % (2003848)Detected formulas, will run a generic FOF schedule.
% 3.73/1.49 % (2003857)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2775507070:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.73/1.49 % (2003857)Instruction limit reached!
% 3.73/1.49 % (2003857)------------------------------
% 3.73/1.49 % (2003857)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.49 % (2003857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.49 % (2003857)CaDiCaL version: 2.1.3
% 3.73/1.49 % (2003857)Termination reason: Instruction limit
% 3.73/1.49 % (2003857)Termination phase: Saturation
% 3.73/1.49 % (2003857)Time elapsed: 0.042 s
% 3.73/1.49 % (2003857)Peak memory usage: 89 MB
% 3.73/1.49 % (2003857)Instructions burned: 122 (million)
% 3.73/1.49 % (2003854)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=2814410272:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.73/1.49 % (2003853)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=2557920210:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.73/1.49 % (2003855)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=20246939:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.73/1.49 % (2003856)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1753333799:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.73/1.49 % (2003858)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2606538789:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.73/1.49 % (2003859)dis-21_1_sil=8000:lcm=predicate:random_seed=3786726838: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)
% 3.73/1.49 % (2003859)First to succeed.
% 3.73/1.49 % (2003859)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2003848"
% 3.73/1.49 % (2003858)Also succeeded, but the first one will report.
% 3.73/1.49 % (2003856)Instruction limit reached!
% 3.73/1.49 % (2003856)------------------------------
% 3.73/1.49 % (2003856)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.49 % (2003856)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.49 % (2003856)CaDiCaL version: 2.1.3
% 3.73/1.49 % (2003856)Termination reason: Instruction limit
% 3.73/1.49 % (2003856)Termination phase: Saturation
% 3.73/1.49 % (2003856)Time elapsed: 0.073 s
% 3.73/1.49 % (2003856)Peak memory usage: 89 MB
% 3.73/1.49 % (2003856)Instructions burned: 109 (million)
% 3.73/1.49 % (2003861)lrs+10_1_sil=8000:sp=occurrence:random_seed=2127415890:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.73/1.49 % (2003861)Also succeeded, but the first one will report.
% 3.73/1.49 % (2003868)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3102762573:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.73/1.49 % (2003859)Refutation found. Thanks to Tanya!
% 3.73/1.49 % SZS status Theorem for theBenchmark
% 3.73/1.49 % SZS output start Proof for theBenchmark
% See solution above
% 3.73/1.49 % (2003859)------------------------------
% 3.73/1.49 % (2003859)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.73/1.49 % (2003859)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.73/1.49 % (2003859)CaDiCaL version: 2.1.3
% 3.73/1.49 % (2003859)Termination reason: Refutation
% 3.73/1.49 % (2003859)Time elapsed: 0.005 s
% 3.73/1.49 % (2003859)Peak memory usage: 89 MB
% 3.73/1.49 % (2003859)Instructions burned: 5 (million)
% 3.73/1.49 % (2003859)------------------------------
% 3.73/1.49 % (2003859)------------------------------
% 3.73/1.49 % (2003848)Success in time 0.445 s
% 3.73/1.49 % Vampire exiting
%------------------------------------------------------------------------------