%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU119+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 : 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:51:58 PM UTC 2026
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 65 ( 7 unt; 4 def)
% Number of atoms : 167 ( 18 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 180 ( 78 ~; 75 |; 19 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 59 ( 0 sgn 53 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f4,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(f5,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f13,conjecture,
! [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/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X2] :
( in(X2,X0)
& in(X2,X1) )
& disjoint(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f16,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,[],[f14]) ).
fof(f19,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,[],[f16]) ).
fof(f23,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f3]) ).
fof(f25,plain,
! [X2,X0,X1] :
( in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X2)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f26,plain,
! [X2,X0,X1] :
( in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f29,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f30,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f31,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f37,plain,
! [X2] :
( disjoint(sK4,sK5)
| ~ in(X2,sK5)
| ~ in(X2,sK4) ),
inference(cnf_transformation,[],[f19]) ).
fof(f38,plain,
! [X2] :
( in(sK6,sK4)
| ~ in(X2,sK5)
| ~ in(X2,sK4) ),
inference(cnf_transformation,[],[f19]) ).
fof(f39,plain,
! [X2] :
( in(sK6,sK5)
| ~ in(X2,sK5)
| ~ in(X2,sK4) ),
inference(cnf_transformation,[],[f19]) ).
fof(f40,plain,
( in(sK6,sK5)
| ~ disjoint(sK4,sK5) ),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
( in(sK6,sK4)
| ~ disjoint(sK4,sK5) ),
inference(cnf_transformation,[],[f19]) ).
fof(f42,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f23]) ).
fof(f43,plain,
! [X3,X0,X1] :
( ~ in(X3,X0)
| ~ in(X3,X1)
| in(X3,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f29]) ).
fof(f46,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f47,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(consistent_polarity_flipping,[],[f30]) ).
fof(f49,plain,
( in(sK6,sK4)
| disjoint(sK4,sK5) ),
inference(consistent_polarity_flipping,[],[f41]) ).
fof(f50,plain,
( in(sK6,sK5)
| disjoint(sK4,sK5) ),
inference(consistent_polarity_flipping,[],[f40]) ).
fof(f51,plain,
! [X2] :
( ~ disjoint(sK4,sK5)
| ~ in(X2,sK5)
| ~ in(X2,sK4) ),
inference(consistent_polarity_flipping,[],[f37]) ).
fof(f53,definition,
( spl7_1
<=> ! [X2] :
( ~ in(X2,sK5)
| ~ in(X2,sK4) ) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f54,plain,
( ! [X2] :
( ~ in(X2,sK5)
| ~ in(X2,sK4) )
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f56,definition,
( spl7_2
<=> disjoint(sK4,sK5) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f57,plain,
( disjoint(sK4,sK5)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f58,plain,
( ~ disjoint(sK4,sK5)
| spl7_2 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f59,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f51,f56,f53]) ).
fof(f61,definition,
( spl7_3
<=> in(sK6,sK4) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f63,plain,
( in(sK6,sK4)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f61]) ).
fof(f64,plain,
( spl7_1
| spl7_3 ),
inference(avatar_split_clause,[],[f38,f61,f53]) ).
fof(f66,definition,
( spl7_4
<=> in(sK6,sK5) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f68,plain,
( in(sK6,sK5)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f69,plain,
( spl7_1
| spl7_4 ),
inference(avatar_split_clause,[],[f39,f66,f53]) ).
fof(f70,plain,
( spl7_2
| spl7_4 ),
inference(avatar_split_clause,[],[f50,f66,f56]) ).
fof(f71,plain,
( spl7_2
| spl7_3 ),
inference(avatar_split_clause,[],[f49,f61,f56]) ).
fof(f84,plain,
( empty_set = set_intersection2(sK4,sK5)
| spl7_2 ),
inference(resolution,[],[f46,f58]) ).
fof(f89,plain,
( ! [X0] :
( ~ in(sK6,X0)
| in(sK6,set_intersection2(sK4,X0)) )
| ~ spl7_3 ),
inference(resolution,[],[f43,f63]) ).
fof(f119,plain,
( in(sK6,set_intersection2(sK4,sK5))
| ~ spl7_3
| ~ spl7_4 ),
inference(resolution,[],[f89,f68]) ).
fof(f120,plain,
( in(sK6,empty_set)
| spl7_2
| ~ spl7_3
| ~ spl7_4 ),
inference(forward_demodulation,[],[f119,f84]) ).
fof(f122,plain,
( $false
| spl7_2
| ~ spl7_3
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f120,f42]) ).
fof(f123,plain,
( spl7_2
| ~ spl7_3
| ~ spl7_4 ),
inference(avatar_contradiction_clause,[],[f122]) ).
fof(f124,plain,
( empty_set != set_intersection2(sK4,sK5)
| ~ spl7_2 ),
inference(resolution,[],[f57,f47]) ).
fof(f128,plain,
( ! [X0,X1] :
( ~ in(sK1(X0,sK5,X1),sK4)
| in(sK1(X0,sK5,X1),X1)
| set_intersection2(X0,sK5) = X1 )
| ~ spl7_1 ),
inference(resolution,[],[f54,f25]) ).
fof(f146,plain,
( ! [X0] :
( in(sK1(sK4,sK5,X0),X0)
| set_intersection2(sK4,sK5) = X0
| in(sK1(sK4,sK5,X0),X0)
| set_intersection2(sK4,sK5) = X0 )
| ~ spl7_1 ),
inference(resolution,[],[f128,f26]) ).
fof(f147,plain,
( ! [X0] :
( in(sK1(sK4,sK5,X0),X0)
| set_intersection2(sK4,sK5) = X0 )
| ~ spl7_1 ),
inference(duplicate_literal_removal,[],[f146]) ).
fof(f173,plain,
( empty_set = set_intersection2(sK4,sK5)
| ~ spl7_1 ),
inference(resolution,[],[f147,f42]) ).
fof(f186,plain,
( $false
| ~ spl7_1
| ~ spl7_2 ),
inference(forward_subsumption_resolution,[],[f173,f124]) ).
fof(f187,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_contradiction_clause,[],[f186]) ).
cnf(s1,plain,
( spl7_1
| ~ spl7_2 ),
inference(sat_conversion,[],[f59]) ).
cnf(s2,plain,
( spl7_1
| spl7_3 ),
inference(sat_conversion,[],[f64]) ).
cnf(s3,plain,
( spl7_1
| spl7_4 ),
inference(sat_conversion,[],[f69]) ).
cnf(s4,plain,
( spl7_2
| spl7_4 ),
inference(sat_conversion,[],[f70]) ).
cnf(s5,plain,
( spl7_2
| spl7_3 ),
inference(sat_conversion,[],[f71]) ).
cnf(s6,plain,
( spl7_2
| ~ spl7_3
| ~ spl7_4 ),
inference(sat_conversion,[],[f123]) ).
cnf(s10,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(sat_conversion,[],[f187]) ).
cnf(s11,plain,
spl7_1,
inference(rat,[],[s6,s1,s2,s3]) ).
cnf(s12,plain,
~ spl7_2,
inference(rat,[],[s10,s11]) ).
cnf(s13,plain,
spl7_3,
inference(rat,[],[s5,s12]) ).
cnf(s14,plain,
spl7_4,
inference(rat,[],[s4,s12]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s6,s14,s12,s13]) ).
fof(f188,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU119+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n011.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 28 03:36:00 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 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.19/0.48 % (2992875)Will run a generic schedule for satisfiability detection.
% 0.19/0.48 % (2992886)% WARNING: option uhcvi not known.
% 0.19/0.48 % (2992886)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2723031097:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.48 % (2992887)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1728919381:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.48 % (2992890)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=27085165:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.48 % (2992885)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2182213496_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.48 % TRYING [1]
% 0.19/0.48 % TRYING [2]
% 0.19/0.48 % (2992889)dis+10_1_sil=32000:sp=arity:random_seed=3148636681:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.48 % TRYING [3]
% 0.19/0.48 % (2992891)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1775176413:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.48 % (2992886) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2992875-2992886"...
% 0.19/0.48 % TRYING [4]
% 0.19/0.48 % (2992890) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2992875-2992890"...
% 0.19/0.48 % (2992889) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2992875-2992889"...
% 0.19/0.48 % (2992886)...printing done.
% 0.19/0.48 % (2992890)...printing done.
% 0.19/0.48 % (2992886)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (2992886)------------------------------
% 0.19/0.48 % (2992886)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.48 % (2992886)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.48 % (2992886)CaDiCaL version: 2.1.3
% 0.19/0.48 % (2992886)Termination reason: Refutation
% 0.19/0.48 % (2992886)Time elapsed: 0.007 s
% 0.19/0.48 % (2992886)Peak memory usage: 12 MB
% 0.19/0.48 % (2992886)Instructions burned: 7 (million)
% 0.19/0.48 % (2992875)Success in time 0.047 s
% 0.19/0.48 % Vampire exiting
%------------------------------------------------------------------------------