%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET585+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:00 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 13 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 9 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 34 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_subset) ).
fof(f2,axiom,
! [X0,X1] : subset(X0,union(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_union) ).
fof(f3,axiom,
! [X0,X1] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
fof(f11,conjecture,
! [X0,X1,X2] : subset(intersection(X0,X1),union(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_subset_of_union) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2] : subset(intersection(X0,X1),union(X0,X2)),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(ennf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(flattening,[],[f13]) ).
fof(f16,plain,
? [X0,X1,X2] : ~ subset(intersection(X0,X1),union(X0,X2)),
inference(ennf_transformation,[],[f12]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f18,plain,
! [X0,X1] : subset(X0,union(X0,X1)),
inference(cnf_transformation,[],[f2]) ).
fof(f19,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[],[f3]) ).
fof(f36,plain,
~ subset(intersection(sK2,sK3),union(sK2,sK4)),
inference(cnf_transformation,[],[f16]) ).
fof(f39,plain,
! [X2,X0,X1] :
( ~ subset(X0,X2)
| subset(X0,X1)
| subset(X1,X2) ),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f40,plain,
! [X0,X1] : ~ subset(X0,union(X0,X1)),
inference(consistent_polarity_flipping,[],[f18]) ).
fof(f41,plain,
! [X0,X1] : ~ subset(intersection(X0,X1),X0),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f56,plain,
subset(intersection(sK2,sK3),union(sK2,sK4)),
inference(consistent_polarity_flipping,[],[f36]) ).
fof(f76,plain,
! [X0] :
( subset(intersection(sK2,sK3),X0)
| subset(X0,union(sK2,sK4)) ),
inference(resolution,[],[f39,f56]) ).
fof(f80,plain,
subset(sK2,union(sK2,sK4)),
inference(resolution,[],[f76,f41]) ).
fof(f87,plain,
$false,
inference(forward_subsumption_resolution,[],[f80,f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET585+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n013.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 02:12:52 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/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.11/0.46 % (742704)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (742709)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2098637816_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46 % TRYING [1]
% 0.11/0.46 % TRYING [2]
% 0.11/0.46 % TRYING [3]
% 0.11/0.46 % TRYING [4]
% 0.11/0.46 % (742710)% WARNING: option uhcvi not known.
% 0.11/0.46 % TRYING [5]
% 0.11/0.46 % (742713)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2689038516:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (742710)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2271055687:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46 % (742712)dis+10_1_sil=32000:sp=arity:random_seed=858739714:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46 % (742711)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1324348676:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46 % (742714)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1599390605:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.46 % (742715)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2506056528:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.46 % TRYING [6]
% 0.11/0.46 % (742712) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-742704-742712"...
% 0.11/0.46 % (742710) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-742704-742710"...
% 0.11/0.46 % (742715) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-742704-742715"...
% 0.11/0.46 % (742711) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-742704-742711"...
% 0.11/0.46 % (742712)...printing done.
% 0.11/0.46 % (742710)...printing done.
% 0.11/0.46 % (742715)...printing done.
% 0.11/0.46 % (742714) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-742704-742714"...
% 0.11/0.46 % (742713) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-742704-742713"...
% 0.11/0.46 % (742711)...printing done.
% 0.11/0.46 % (742710)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (742710)------------------------------
% 0.11/0.46 % (742710)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (742710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (742710)CaDiCaL version: 2.1.3
% 0.11/0.46 % (742710)Termination reason: Refutation
% 0.11/0.46 % (742710)Time elapsed: 0.003 s
% 0.11/0.46 % (742710)Peak memory usage: 12 MB
% 0.11/0.46 % (742710)Instructions burned: 3 (million)
% 0.11/0.46 % (742704)Success in time 0.042 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------