%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET629+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:14 PM UTC 2026
% Result : Theorem 0.16s 0.46s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 12 ~; 6 |; 3 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 30 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( member(X2,X0)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f3,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f4,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f8,conjecture,
! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_and_difference_disjoint) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
=> disjoint(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f11,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f13,plain,
? [X0,X1] : ~ disjoint(intersection(X0,X1),difference(X0,X1)),
inference(ennf_transformation,[],[f9]) ).
fof(f14,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f20,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f3]) ).
fof(f21,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f23,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f30,plain,
~ disjoint(intersection(sK2,sK3),difference(sK2,sK3)),
inference(cnf_transformation,[],[f13]) ).
fof(f33,plain,
intersect(intersection(sK2,sK3),difference(sK2,sK3)),
inference(resolution,[],[f23,f30]) ).
fof(f40,plain,
member(sK0(intersection(sK2,sK3),difference(sK2,sK3)),difference(sK2,sK3)),
inference(resolution,[],[f20,f33]) ).
fof(f43,plain,
~ member(sK0(intersection(sK2,sK3),difference(sK2,sK3)),sK3),
inference(resolution,[],[f40,f17]) ).
fof(f44,plain,
member(sK0(intersection(sK2,sK3),difference(sK2,sK3)),intersection(sK2,sK3)),
inference(resolution,[],[f21,f33]) ).
fof(f54,plain,
member(sK0(intersection(sK2,sK3),difference(sK2,sK3)),sK3),
inference(resolution,[],[f44,f14]) ).
fof(f55,plain,
$false,
inference(forward_subsumption_resolution,[],[f54,f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET629+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 02:26:31 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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.16/0.46 % (2202003)Will run a generic schedule for satisfiability detection.
% 0.16/0.46 % (2202008)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2677217970_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.46 % TRYING [1]
% 0.16/0.46 % TRYING [2]
% 0.16/0.46 % TRYING [3]
% 0.16/0.46 % TRYING [4]
% 0.16/0.46 % (2202009)% WARNING: option uhcvi not known.
% 0.16/0.46 % TRYING [5]
% 0.16/0.46 % (2202010)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=540143222:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.46 % (2202011)dis+10_1_sil=32000:sp=arity:random_seed=524657911:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.46 % (2202012)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1088546006:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.46 % (2202013)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2037535413:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.46 % (2202014)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3682817353:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.46 % (2202009)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3161756132:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.46 % (2202012) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2202003-2202012"...
% 0.16/0.46 % (2202013) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2202003-2202013"...
% 0.16/0.46 % (2202014) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2202003-2202014"...
% 0.16/0.46 % (2202012)...printing done.
% 0.16/0.46 % (2202013)...printing done.
% 0.16/0.46 % (2202009) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2202003-2202009"...
% 0.16/0.46 % (2202014)...printing done.
% 0.16/0.46 % (2202012)Refutation found. Thanks to Tanya!
% 0.16/0.46 % SZS status Theorem for theBenchmark
% 0.16/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.46 % (2202012)------------------------------
% 0.16/0.46 % (2202012)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.46 % (2202012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.46 % (2202012)CaDiCaL version: 2.1.3
% 0.16/0.46 % (2202012)Termination reason: Refutation
% 0.16/0.46 % (2202012)Time elapsed: 0.002 s
% 0.16/0.46 % (2202012)Peak memory usage: 12 MB
% 0.16/0.46 % (2202012)Instructions burned: 2 (million)
% 0.16/0.46 % (2202003)Success in time 0.038 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------