%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET639+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 : n013.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:17 PM UTC 2026
% Result : Theorem 0.21s 0.48s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 30 ( 20 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 7 ~; 2 |; 8 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_intersection) ).
fof(f6,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f10,conjecture,
! [X0,X1] :
( ( subset(X0,X1)
& intersection(X1,X0) = empty_set )
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th121) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] :
( ( subset(X0,X1)
& intersection(X1,X0) = empty_set )
=> X0 = empty_set ),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( intersection(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f14,plain,
? [X0,X1] :
( empty_set != X0
& subset(X0,X1)
& intersection(X1,X0) = empty_set ),
inference(ennf_transformation,[],[f11]) ).
fof(f15,plain,
? [X0,X1] :
( empty_set != X0
& subset(X0,X1)
& intersection(X1,X0) = empty_set ),
inference(flattening,[],[f14]) ).
fof(f26,plain,
( empty_set != sK2
& subset(sK2,sK3)
& empty_set = intersection(sK3,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f15]) ).
fof(f27,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| intersection(X0,X1) = X0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f38,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f44,plain,
empty_set = intersection(sK3,sK2),
inference(cnf_transformation,[],[f26]) ).
fof(f45,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f26]) ).
fof(f46,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f26]) ).
fof(f51,plain,
empty_set = intersection(sK2,sK3),
inference(superposition,[],[f44,f38]) ).
fof(f52,plain,
sK2 = intersection(sK2,sK3),
inference(resolution,[],[f27,f45]) ).
fof(f54,plain,
empty_set = sK2,
inference(forward_demodulation,[],[f52,f51]) ).
fof(f55,plain,
$false,
inference(forward_subsumption_resolution,[],[f54,f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET639+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.16/0.41 % Computer : n013.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Mon Sep 28 02:23:37 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.45 Running first-order model finding
% 0.16/0.45 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.21/0.48 % (749337)Will run a generic schedule for satisfiability detection.
% 0.21/0.48 % (749346)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3673135889_3000 on theBenchmark for (3000ds/0Mi)
% 0.21/0.48 % TRYING [1]
% 0.21/0.48 % TRYING [2]
% 0.21/0.48 % TRYING [3]
% 0.21/0.48 % TRYING [4]
% 0.21/0.48 % TRYING [5]
% 0.21/0.48 % (749347)% WARNING: option uhcvi not known.
% 0.21/0.48 % TRYING [6]
% 0.21/0.48 % (749350)dis+10_1_sil=32000:sp=arity:random_seed=489995931:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.21/0.48 % (749352)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2622012662:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.21/0.48 % (749349)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=50719681:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.21/0.48 % (749347)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=94548802:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.21/0.48 % (749351)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3439792865:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.21/0.48 % TRYING [7]
% 0.21/0.48 % (749353)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1167255989:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.21/0.48 % (749350) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-749337-749350"...
% 0.21/0.48 % (749352) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-749337-749352"...
% 0.21/0.48 % (749351) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-749337-749351"...
% 0.21/0.48 % (749349) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-749337-749349"...
% 0.21/0.48 % (749353) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-749337-749353"...
% 0.21/0.48 % (749347) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-749337-749347"...
% 0.21/0.48 % (749352)...printing done.
% 0.21/0.48 % (749350)...printing done.
% 0.21/0.48 % (749351)...printing done.
% 0.21/0.48 % (749349)...printing done.
% 0.21/0.48 % (749353)...printing done.
% 0.21/0.48 % (749352)Refutation found. Thanks to Tanya!
% 0.21/0.48 % SZS status Theorem for theBenchmark
% 0.21/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.48 % (749352)------------------------------
% 0.21/0.48 % (749352)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.48 % (749352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.48 % (749352)CaDiCaL version: 2.1.3
% 0.21/0.48 % (749352)Termination reason: Refutation
% 0.21/0.48 % (749352)Time elapsed: 0.002 s
% 0.21/0.48 % (749352)Peak memory usage: 11 MB
% 0.21/0.48 % (749352)Instructions burned: 1 (million)
% 0.21/0.48 % (749337)Success in time 0.026 s
% 0.21/0.48 % Vampire exiting
%------------------------------------------------------------------------------