%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU120+2 : 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 : 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:51:58 PM UTC 2026
% Result : Theorem 0.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 6 unt; 3 def)
% Number of atoms : 96 ( 9 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 105 ( 54 ~; 35 |; 11 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f5,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f14,conjecture,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f18,plain,
~ ! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f22,plain,
? [X0,X1] :
( ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
| ( ? [X3] : in(X3,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f25,plain,
! [X0] :
( in(sK0(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f3]) ).
fof(f26,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f3]) ).
fof(f33,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f5]) ).
fof(f34,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f5]) ).
fof(f43,plain,
! [X2] :
( in(sK7,set_intersection2(sK5,sK6))
| ~ in(X2,set_intersection2(sK5,sK6)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f44,plain,
( in(sK7,set_intersection2(sK5,sK6))
| ~ disjoint(sK5,sK6) ),
inference(cnf_transformation,[],[f22]) ).
fof(f45,plain,
! [X2] :
( disjoint(sK5,sK6)
| ~ in(X2,set_intersection2(sK5,sK6)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f46,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f26]) ).
fof(f51,definition,
( spl8_1
<=> ! [X2] : ~ in(X2,set_intersection2(sK5,sK6)) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f52,plain,
( ! [X2] : ~ in(X2,set_intersection2(sK5,sK6))
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f54,definition,
( spl8_2
<=> in(sK7,set_intersection2(sK5,sK6)) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
fof(f56,plain,
( in(sK7,set_intersection2(sK5,sK6))
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f57,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f43,f54,f51]) ).
fof(f59,definition,
( spl8_3
<=> disjoint(sK5,sK6) ),
introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).
fof(f60,plain,
( disjoint(sK5,sK6)
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f61,plain,
( ~ disjoint(sK5,sK6)
| spl8_3 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f62,plain,
( ~ spl8_3
| spl8_2 ),
inference(avatar_split_clause,[],[f44,f54,f59]) ).
fof(f63,plain,
( spl8_1
| spl8_3 ),
inference(avatar_split_clause,[],[f45,f59,f51]) ).
fof(f72,plain,
( empty_set = set_intersection2(sK5,sK6)
| ~ spl8_3 ),
inference(resolution,[],[f34,f60]) ).
fof(f77,plain,
( in(sK7,empty_set)
| ~ spl8_2
| ~ spl8_3 ),
inference(superposition,[],[f56,f72]) ).
fof(f78,plain,
( $false
| ~ spl8_2
| ~ spl8_3 ),
inference(forward_subsumption_resolution,[],[f77,f46]) ).
fof(f79,plain,
( ~ spl8_2
| ~ spl8_3 ),
inference(avatar_contradiction_clause,[],[f78]) ).
fof(f80,plain,
( empty_set != set_intersection2(sK5,sK6)
| spl8_3 ),
inference(resolution,[],[f61,f33]) ).
fof(f83,plain,
( $false
| ~ spl8_1
| ~ spl8_2 ),
inference(resolution,[],[f52,f56]) ).
fof(f84,plain,
( empty_set = set_intersection2(sK5,sK6)
| ~ spl8_1 ),
inference(resolution,[],[f52,f25]) ).
fof(f85,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(avatar_contradiction_clause,[],[f83]) ).
fof(f86,plain,
( $false
| ~ spl8_1
| spl8_3 ),
inference(forward_subsumption_resolution,[],[f84,f80]) ).
fof(f87,plain,
( ~ spl8_1
| spl8_3 ),
inference(avatar_contradiction_clause,[],[f86]) ).
cnf(s1,plain,
( spl8_1
| spl8_2 ),
inference(sat_conversion,[],[f57]) ).
cnf(s2,plain,
( spl8_2
| ~ spl8_3 ),
inference(sat_conversion,[],[f62]) ).
cnf(s3,plain,
( spl8_1
| spl8_3 ),
inference(sat_conversion,[],[f63]) ).
cnf(s4,plain,
( ~ spl8_2
| ~ spl8_3 ),
inference(sat_conversion,[],[f79]) ).
cnf(s5,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(sat_conversion,[],[f85]) ).
cnf(s6,plain,
( ~ spl8_1
| spl8_3 ),
inference(sat_conversion,[],[f87]) ).
cnf(s7,plain,
spl8_1,
inference(rat,[],[s4,s1,s3]) ).
cnf(s8,plain,
spl8_3,
inference(rat,[],[s6,s7]) ).
cnf(s9,plain,
~ spl8_2,
inference(rat,[],[s5,s7]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s2,s8,s9]) ).
fof(f88,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU120+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n007.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 03:34:56 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.17/0.48 % (2001791)Will run a generic schedule for satisfiability detection.
% 0.17/0.48 % (2001796)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3015410671_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48 % TRYING [1]
% 0.17/0.48 % TRYING [2]
% 0.17/0.48 % TRYING [3]
% 0.17/0.48 % TRYING [4]
% 0.17/0.48 % (2001797)% WARNING: option uhcvi not known.
% 0.17/0.48 % (2001799)dis+10_1_sil=32000:sp=arity:random_seed=4167799035:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48 % TRYING [5]
% 0.17/0.48 % (2001797)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3540413220:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48 % (2001798)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1160794688:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48 % (2001800)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3570146045:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48 % (2001801)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1984285741:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48 % (2001802)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2264894024:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48 % (2001800) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2001791-2001800"...
% 0.17/0.48 % (2001801) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2001791-2001801"...
% 0.17/0.48 % (2001799) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2001791-2001799"...
% 0.17/0.48 % (2001802) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2001791-2001802"...
% 0.17/0.48 % (2001800)...printing done.
% 0.17/0.48 % (2001797) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2001791-2001797"...
% 0.17/0.48 % (2001801)...printing done.
% 0.17/0.48 % (2001799)...printing done.
% 0.17/0.48 % (2001800)Refutation found. Thanks to Tanya!
% 0.17/0.48 % SZS status Theorem for theBenchmark
% 0.17/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48 % (2001800)------------------------------
% 0.17/0.48 % (2001800)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48 % (2001800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48 % (2001800)CaDiCaL version: 2.1.3
% 0.17/0.48 % (2001800)Termination reason: Refutation
% 0.17/0.48 % (2001800)Time elapsed: 0.003 s
% 0.17/0.48 % (2001800)Peak memory usage: 12 MB
% 0.17/0.48 % (2001800)Instructions burned: 3 (million)
% 0.17/0.48 % (2001791)Success in time 0.05 s
% 0.17/0.48 % Vampire exiting
%------------------------------------------------------------------------------