%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET916+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:44:59 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 15 unt; 2 def)
% Number of atoms : 85 ( 19 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 88 ( 44 ~; 24 |; 14 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 50 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f10,axiom,
! [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(f11,conjecture,
! [X0,X1,X2] :
~ ( ~ in(X0,X1)
& ~ in(X2,X1)
& ~ disjoint(unordered_pair(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t57_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( ~ in(X0,X1)
& ~ in(X2,X1)
& ~ disjoint(unordered_pair(X0,X2),X1) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f14,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,[],[f10]) ).
fof(f17,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,[],[f14]) ).
fof(f18,plain,
? [X0,X1,X2] :
( ~ in(X0,X1)
& ~ in(X2,X1)
& ~ disjoint(unordered_pair(X0,X2),X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f21,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f25,plain,
! [X2,X3,X0,X1] :
( X1 = X3
| X0 = X3
| ~ in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f31,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f5]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f5]) ).
fof(f38,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK4(X0,X1),set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f40,plain,
~ disjoint(unordered_pair(sK5,sK7),sK6),
inference(cnf_transformation,[],[f18]) ).
fof(f41,plain,
~ in(sK7,sK6),
inference(cnf_transformation,[],[f18]) ).
fof(f42,plain,
~ in(sK5,sK6),
inference(cnf_transformation,[],[f18]) ).
fof(f47,plain,
! [X3,X0,X1] :
( ~ in(X3,unordered_pair(X0,X1))
| X0 = X3
| X1 = X3 ),
inference(equality_resolution,[],[f25]) ).
fof(f49,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X0) ),
inference(equality_resolution,[],[f32]) ).
fof(f50,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X1) ),
inference(equality_resolution,[],[f31]) ).
fof(f66,plain,
in(sK4(unordered_pair(sK5,sK7),sK6),set_intersection2(unordered_pair(sK5,sK7),sK6)),
inference(resolution,[],[f38,f40]) ).
fof(f71,plain,
in(sK4(unordered_pair(sK5,sK7),sK6),set_intersection2(sK6,unordered_pair(sK5,sK7))),
inference(forward_demodulation,[],[f66,f21]) ).
fof(f72,plain,
in(sK4(unordered_pair(sK5,sK7),sK6),unordered_pair(sK5,sK7)),
inference(resolution,[],[f71,f50]) ).
fof(f73,plain,
in(sK4(unordered_pair(sK5,sK7),sK6),sK6),
inference(resolution,[],[f71,f49]) ).
fof(f91,plain,
( sK5 = sK4(unordered_pair(sK5,sK7),sK6)
| sK7 = sK4(unordered_pair(sK5,sK7),sK6) ),
inference(resolution,[],[f72,f47]) ).
fof(f95,definition,
( spl8_1
<=> sK7 = sK4(unordered_pair(sK5,sK7),sK6) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f97,plain,
( sK7 = sK4(unordered_pair(sK5,sK7),sK6)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f95]) ).
fof(f99,definition,
( spl8_2
<=> sK5 = sK4(unordered_pair(sK5,sK7),sK6) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
fof(f101,plain,
( sK5 = sK4(unordered_pair(sK5,sK7),sK6)
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f102,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f91,f99,f95]) ).
fof(f106,plain,
( in(sK5,sK6)
| ~ spl8_2 ),
inference(superposition,[],[f73,f101]) ).
fof(f108,plain,
( $false
| ~ spl8_2 ),
inference(forward_subsumption_resolution,[],[f106,f42]) ).
fof(f109,plain,
~ spl8_2,
inference(avatar_contradiction_clause,[],[f108]) ).
fof(f135,plain,
( in(sK7,sK6)
| ~ spl8_1 ),
inference(superposition,[],[f73,f97]) ).
fof(f137,plain,
( $false
| ~ spl8_1 ),
inference(forward_subsumption_resolution,[],[f135,f41]) ).
fof(f138,plain,
~ spl8_1,
inference(avatar_contradiction_clause,[],[f137]) ).
cnf(s1,plain,
( spl8_1
| spl8_2 ),
inference(sat_conversion,[],[f102]) ).
cnf(s2,plain,
~ spl8_2,
inference(sat_conversion,[],[f109]) ).
cnf(s3,plain,
~ spl8_1,
inference(sat_conversion,[],[f138]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f139,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET916+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 03:09:49 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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/0.45 % (3625055)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (3625065)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3731954243:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (3625061)% WARNING: option uhcvi not known.
% 0.11/0.45 % (3625060)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2013433559_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % (3625061)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1142923886:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % (3625062)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4069451957:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (3625063)dis+10_1_sil=32000:sp=arity:random_seed=3335999257:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (3625064)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1543939821:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (3625066)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=142099867:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % TRYING [1]
% 0.11/0.45 % TRYING [2]
% 0.11/0.45 % TRYING [3]
% 0.11/0.45 % TRYING [4]
% 0.11/0.45 % (3625064) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3625055-3625064"...
% 0.11/0.45 % (3625064)...printing done.
% 0.11/0.45 % (3625064)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (3625064)------------------------------
% 0.11/0.45 % (3625064)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (3625064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (3625064)CaDiCaL version: 2.1.3
% 0.11/0.45 % (3625064)Termination reason: Refutation
% 0.11/0.45 % (3625064)Time elapsed: 0.005 s
% 0.11/0.45 % (3625064)Peak memory usage: 12 MB
% 0.11/0.45 % (3625064)Instructions burned: 6 (million)
% 0.11/0.45 % (3625055)Success in time 0.04 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------