%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU112+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:51:57 PM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 15 unt; 2 def)
% Number of atoms : 55 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 21 ~; 17 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 32 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f30,axiom,
! [X0,X1] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_finsub_1) ).
fof(f31,conjecture,
! [X0,X1] : subset(set_union2(finite_subsets(X0),finite_subsets(X1)),finite_subsets(set_union2(X0,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_finsub_1) ).
fof(f32,negated_conjecture,
~ ! [X0,X1] : subset(set_union2(finite_subsets(X0),finite_subsets(X1)),finite_subsets(set_union2(X0,X1))),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f39,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f41,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X2,X1) )
=> subset(set_union2(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(f67,plain,
! [X0,X1] :
( subset(finite_subsets(X0),finite_subsets(X1))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f68,plain,
? [X0,X1] : ~ subset(set_union2(finite_subsets(X0),finite_subsets(X1)),finite_subsets(set_union2(X0,X1))),
inference(ennf_transformation,[],[f32]) ).
fof(f77,plain,
! [X0,X1,X2] :
( subset(set_union2(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f78,plain,
! [X0,X1,X2] :
( subset(set_union2(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(flattening,[],[f77]) ).
fof(f86,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f7]) ).
fof(f127,plain,
! [X0,X1] :
( subset(finite_subsets(X0),finite_subsets(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f128,plain,
~ subset(set_union2(finite_subsets(sK10),finite_subsets(sK11)),finite_subsets(set_union2(sK10,sK11))),
inference(cnf_transformation,[],[f68]) ).
fof(f136,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f39]) ).
fof(f138,plain,
! [X2,X0,X1] :
( subset(set_union2(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f164,plain,
! [X0,X1] : subset(X1,set_union2(X0,X1)),
inference(superposition,[],[f136,f86]) ).
fof(f233,plain,
( ~ subset(finite_subsets(sK10),finite_subsets(set_union2(sK10,sK11)))
| ~ subset(finite_subsets(sK11),finite_subsets(set_union2(sK10,sK11))) ),
inference(resolution,[],[f138,f128]) ).
fof(f242,definition,
( spl12_1
<=> subset(finite_subsets(sK11),finite_subsets(set_union2(sK10,sK11))) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
fof(f244,plain,
( ~ subset(finite_subsets(sK11),finite_subsets(set_union2(sK10,sK11)))
| spl12_1 ),
inference(avatar_component_clause,[],[f242]) ).
fof(f246,definition,
( spl12_2
<=> subset(finite_subsets(sK10),finite_subsets(set_union2(sK10,sK11))) ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
fof(f248,plain,
( ~ subset(finite_subsets(sK10),finite_subsets(set_union2(sK10,sK11)))
| spl12_2 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f249,plain,
( ~ spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f233,f246,f242]) ).
fof(f250,plain,
( ~ subset(sK11,set_union2(sK10,sK11))
| spl12_1 ),
inference(resolution,[],[f244,f127]) ).
fof(f252,plain,
( $false
| spl12_1 ),
inference(forward_subsumption_resolution,[],[f250,f164]) ).
fof(f253,plain,
spl12_1,
inference(avatar_contradiction_clause,[],[f252]) ).
fof(f255,plain,
( ~ subset(sK10,set_union2(sK10,sK11))
| spl12_2 ),
inference(resolution,[],[f248,f127]) ).
fof(f257,plain,
( $false
| spl12_2 ),
inference(forward_subsumption_resolution,[],[f255,f136]) ).
fof(f258,plain,
spl12_2,
inference(avatar_contradiction_clause,[],[f257]) ).
cnf(s1,plain,
( ~ spl12_1
| ~ spl12_2 ),
inference(sat_conversion,[],[f249]) ).
cnf(s2,plain,
spl12_1,
inference(sat_conversion,[],[f253]) ).
cnf(s3,plain,
spl12_2,
inference(sat_conversion,[],[f258]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f259,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU112+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n005.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 03:35:02 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.46 % (410836)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (410841)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3687168937_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % TRYING [1]
% 0.17/0.46 % TRYING [2]
% 0.17/0.46 % TRYING [3]
% 0.17/0.46 % TRYING [4]
% 0.17/0.46 % (410842)% WARNING: option uhcvi not known.
% 0.17/0.46 % TRYING [5]
% 0.17/0.46 % TRYING [6]
% 0.17/0.46 % (410845)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3053334044:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % (410842)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1031753797:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (410843)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3515036016:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % (410846)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2079882379:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % (410844)dis+10_1_sil=32000:sp=arity:random_seed=4199858778:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (410847)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3214647166:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46 % (410845) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-410836-410845"...
% 0.17/0.46 % (410842) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-410836-410842"...
% 0.17/0.46 % (410844) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-410836-410844"...
% 0.17/0.46 % (410845)...printing done.
% 0.17/0.46 % (410842)...printing done.
% 0.17/0.46 % (410844)...printing done.
% 0.17/0.46 % (410845)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Theorem for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (410845)------------------------------
% 0.17/0.46 % (410845)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (410845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (410845)CaDiCaL version: 2.1.3
% 0.17/0.46 % (410845)Termination reason: Refutation
% 0.17/0.46 % (410845)Time elapsed: 0.006 s
% 0.17/0.46 % (410845)Peak memory usage: 12 MB
% 0.17/0.46 % (410845)Instructions burned: 6 (million)
% 0.17/0.46 % (410836)Success in time 0.043 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------