%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET594+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 : n012.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:03 PM UTC 2026
% Result : Theorem 0.07s 0.35s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 50 ( 4 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 41 ( 16 ~; 16 |; 2 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 37 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f3,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(f9,conjecture,
! [X0,X1,X2] :
( union(intersection(X0,X1),intersection(X0,X2)) = X0
=> subset(X0,union(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th53) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( union(intersection(X0,X1),intersection(X0,X2)) = X0
=> subset(X0,union(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
? [X0,X1,X2] :
( ~ subset(X0,union(X1,X2))
& union(intersection(X0,X1),intersection(X0,X2)) = X0 ),
inference(ennf_transformation,[],[f10]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f16,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f18,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f19,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f3]) ).
fof(f32,plain,
sK2 = union(intersection(sK2,sK3),intersection(sK2,sK4)),
inference(cnf_transformation,[],[f12]) ).
fof(f33,plain,
~ subset(sK2,union(sK3,sK4)),
inference(cnf_transformation,[],[f12]) ).
fof(f38,plain,
member(sK0(sK2,union(sK3,sK4)),sK2),
inference(resolution,[],[f14,f33]) ).
fof(f39,plain,
~ member(sK0(sK2,union(sK3,sK4)),union(sK3,sK4)),
inference(resolution,[],[f15,f33]) ).
fof(f40,plain,
~ member(sK0(sK2,union(sK3,sK4)),sK4),
inference(resolution,[],[f17,f39]) ).
fof(f44,plain,
~ member(sK0(sK2,union(sK3,sK4)),sK3),
inference(resolution,[],[f18,f39]) ).
fof(f63,plain,
! [X0] :
( member(X0,intersection(sK2,sK4))
| member(X0,intersection(sK2,sK3))
| ~ member(X0,sK2) ),
inference(superposition,[],[f16,f32]) ).
fof(f67,plain,
! [X0] :
( member(X0,intersection(sK2,sK3))
| ~ member(X0,sK2)
| member(X0,sK4) ),
inference(resolution,[],[f63,f19]) ).
fof(f73,plain,
! [X0] :
( member(X0,sK4)
| ~ member(X0,sK2)
| member(X0,sK3) ),
inference(resolution,[],[f67,f19]) ).
fof(f81,plain,
( ~ member(sK0(sK2,union(sK3,sK4)),sK2)
| member(sK0(sK2,union(sK3,sK4)),sK3) ),
inference(resolution,[],[f73,f40]) ).
fof(f82,plain,
member(sK0(sK2,union(sK3,sK4)),sK3),
inference(forward_subsumption_resolution,[],[f81,f38]) ).
fof(f83,plain,
$false,
inference(forward_subsumption_resolution,[],[f82,f44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET594+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 28 02:16:34 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/0.32 Running first-order model finding
% 0.03/0.32 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.07/0.35 % (2944638)Will run a generic schedule for satisfiability detection.
% 0.07/0.35 % (2944644)% WARNING: option uhcvi not known.
% 0.07/0.35 % (2944646)dis+10_1_sil=32000:sp=arity:random_seed=1283217975:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.35 % (2944643)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3967433203_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.35 % (2944648)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1105770109:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.35 % (2944645)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=921598252:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.35 % (2944644)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3558764595:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.35 % (2944647)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2633356042:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.35 % (2944649)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=790266259:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.35 % TRYING [1]
% 0.07/0.35 % TRYING [2]
% 0.07/0.35 % TRYING [3]
% 0.07/0.35 % (2944647) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2944638-2944647"...
% 0.07/0.35 % (2944647)...printing done.
% 0.07/0.35 % TRYING [4]
% 0.07/0.35 % (2944647)Refutation found. Thanks to Tanya!
% 0.07/0.35 % SZS status Theorem for theBenchmark
% 0.07/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.35 % (2944647)------------------------------
% 0.07/0.35 % (2944647)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.35 % (2944647)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.35 % (2944647)CaDiCaL version: 2.1.3
% 0.07/0.35 % (2944647)Termination reason: Refutation
% 0.07/0.35 % (2944647)Time elapsed: 0.002 s
% 0.07/0.35 % (2944647)Peak memory usage: 12 MB
% 0.07/0.35 % (2944647)Instructions burned: 4 (million)
% 0.07/0.35 % (2944638)Success in time 0.028 s
% 0.07/0.35 % Vampire exiting
%------------------------------------------------------------------------------