%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET183+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:43:23 PM UTC 2026
% Result : Theorem 0.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 7 unt; 0 def)
% Number of atoms : 98 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 103 ( 39 ~; 39 |; 18 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 63 ( 59 !; 4 ?)
% 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] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f8,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_intersection) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
? [X0,X1] :
( intersection(X0,X1) != X0
& subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f15,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f18,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f17]) ).
fof(f22,plain,
( sK2 != intersection(sK2,sK3)
& subset(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f11]) ).
fof(f25,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f29,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f39,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f22]) ).
fof(f40,plain,
sK2 != intersection(sK2,sK3),
inference(cnf_transformation,[],[f22]) ).
fof(f57,plain,
! [X0] :
( ~ member(X0,sK2)
| member(X0,sK3) ),
inference(resolution,[],[f27,f39]) ).
fof(f61,plain,
! [X0] :
( member(sK0(sK2,X0),sK3)
| subset(sK2,X0) ),
inference(resolution,[],[f57,f28]) ).
fof(f64,plain,
! [X0,X1] :
( ~ subset(X0,intersection(X0,X1))
| intersection(X0,X1) = X0 ),
inference(resolution,[],[f32,f26]) ).
fof(f77,plain,
! [X2,X0,X1] :
( ~ member(sK0(X0,intersection(X1,X2)),X2)
| ~ member(sK0(X0,intersection(X1,X2)),X1)
| subset(X0,intersection(X1,X2)) ),
inference(resolution,[],[f25,f29]) ).
fof(f142,plain,
! [X0] :
( ~ member(sK0(sK2,intersection(X0,sK3)),X0)
| subset(sK2,intersection(X0,sK3))
| subset(sK2,intersection(X0,sK3)) ),
inference(resolution,[],[f77,f61]) ).
fof(f148,plain,
! [X0] :
( ~ member(sK0(sK2,intersection(X0,sK3)),X0)
| subset(sK2,intersection(X0,sK3)) ),
inference(duplicate_literal_removal,[],[f142]) ).
fof(f419,plain,
( subset(sK2,intersection(sK2,sK3))
| subset(sK2,intersection(sK2,sK3)) ),
inference(resolution,[],[f148,f28]) ).
fof(f425,plain,
subset(sK2,intersection(sK2,sK3)),
inference(duplicate_literal_removal,[],[f419]) ).
fof(f440,plain,
sK2 = intersection(sK2,sK3),
inference(resolution,[],[f425,f64]) ).
fof(f444,plain,
$false,
inference(forward_subsumption_resolution,[],[f440,f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET183+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.11/0.39 % Computer : n015.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 01:05:31 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.17/0.48 % (2172086)Will run a generic schedule for satisfiability detection.
% 0.17/0.48 % (2172094)dis+10_1_sil=32000:sp=arity:random_seed=1148183590:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48 % (2172092)% WARNING: option uhcvi not known.
% 0.17/0.48 % (2172094) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2172086-2172094"...
% 0.17/0.48 % (2172091)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2656130669_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48 % (2172092)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2006624431:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48 % (2172093)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=212491664:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48 % (2172095)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=602871834:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48 % (2172096)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1219546294:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48 % (2172097)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2301595517:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48 % (2172094)...printing done.
% 0.17/0.48 % (2172094)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 % (2172094)------------------------------
% 0.17/0.48 % (2172094)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48 % (2172094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48 % (2172094)CaDiCaL version: 2.1.3
% 0.17/0.48 % (2172094)Termination reason: Refutation
% 0.17/0.48 % (2172094)Time elapsed: 0.007 s
% 0.17/0.48 % (2172094)Peak memory usage: 11 MB
% 0.17/0.48 % (2172094)Instructions burned: 18 (million)
% 0.17/0.48 % (2172086)Success in time 0.043 s
% 0.17/0.48 % Vampire exiting
%------------------------------------------------------------------------------