%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:52:03 PM UTC 2026
% Result : Theorem 0.09s 0.44s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 45 ( 14 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 36 ( 16 ~; 9 |; 9 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 26 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f12,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( subset(X0,X1)
& X0 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f22,axiom,
! [X0,X1] : ~ proper_subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_r2_xboole_0) ).
fof(f28,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f50,conjecture,
! [X0,X1] :
~ ( subset(X0,X1)
& proper_subset(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(f51,negated_conjecture,
~ ! [X0,X1] :
~ ( subset(X0,X1)
& proper_subset(X1,X0) ),
inference(negated_conjecture,[status(cth)],[f50]) ).
fof(f59,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(rectify,[],[f22]) ).
fof(f69,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f82,plain,
? [X0,X1] :
( subset(X0,X1)
& proper_subset(X1,X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f109,plain,
! [X0,X1] :
( ( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 )
& ( ( subset(X0,X1)
& X0 != X1 )
| ~ proper_subset(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f110,plain,
! [X0,X1] :
( ( proper_subset(X0,X1)
| ~ subset(X0,X1)
| X0 = X1 )
& ( ( subset(X0,X1)
& X0 != X1 )
| ~ proper_subset(X0,X1) ) ),
inference(flattening,[],[f109]) ).
fof(f119,plain,
( subset(sK10,sK11)
& proper_subset(sK11,sK10) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X0,sK10),skolemize(X1,sK11)],[f82]) ).
fof(f122,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f153,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f160,plain,
! [X0] : ~ proper_subset(X0,X0),
inference(cnf_transformation,[],[f59]) ).
fof(f167,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f69]) ).
fof(f194,plain,
proper_subset(sK11,sK10),
inference(cnf_transformation,[],[f119]) ).
fof(f195,plain,
subset(sK10,sK11),
inference(cnf_transformation,[],[f119]) ).
fof(f242,plain,
subset(sK11,sK10),
inference(resolution,[],[f153,f194]) ).
fof(f303,plain,
sK11 = set_union2(sK10,sK11),
inference(resolution,[],[f167,f195]) ).
fof(f304,plain,
sK10 = set_union2(sK11,sK10),
inference(resolution,[],[f167,f242]) ).
fof(f305,plain,
sK10 = set_union2(sK10,sK11),
inference(forward_demodulation,[],[f304,f122]) ).
fof(f326,plain,
sK10 = sK11,
inference(superposition,[],[f305,f303]) ).
fof(f340,plain,
proper_subset(sK10,sK10),
inference(superposition,[],[f194,f326]) ).
fof(f349,plain,
$false,
inference(forward_subsumption_resolution,[],[f340,f160]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 03:42:07 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.39 Running first-order model finding
% 0.09/0.39 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.09/0.44 % (4125553)Will run a generic schedule for satisfiability detection.
% 0.09/0.44 % (4125558)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1813644420_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.44 % TRYING [1]
% 0.09/0.44 % TRYING [2]
% 0.09/0.44 % TRYING [3]
% 0.09/0.44 % (4125559)% WARNING: option uhcvi not known.
% 0.09/0.44 % (4125560)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=948802510:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.44 % (4125564)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1253388686:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.44 % (4125561)dis+10_1_sil=32000:sp=arity:random_seed=3197513372:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.44 % (4125562)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=817948203:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.44 % (4125563)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=191685809:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.44 % TRYING [4]
% 0.09/0.44 % (4125559)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=203798333:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.44 % (4125561) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4125553-4125561"...
% 0.09/0.44 % (4125562) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4125553-4125562"...
% 0.09/0.44 % (4125563) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4125553-4125563"...
% 0.09/0.44 % (4125561)...printing done.
% 0.09/0.44 % (4125559) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4125553-4125559"...
% 0.09/0.44 % (4125563)...printing done.
% 0.09/0.44 % (4125562)...printing done.
% 0.09/0.44 % (4125561)Refutation found. Thanks to Tanya!
% 0.09/0.44 % SZS status Theorem for theBenchmark
% 0.09/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.45 % (4125561)------------------------------
% 0.09/0.45 % (4125561)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.45 % (4125561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.45 % (4125561)CaDiCaL version: 2.1.3
% 0.09/0.45 % (4125561)Termination reason: Refutation
% 0.09/0.45 % (4125561)Time elapsed: 0.006 s
% 0.09/0.45 % (4125561)Peak memory usage: 12 MB
% 0.09/0.45 % (4125561)Instructions burned: 7 (million)
% 0.09/0.45 % (4125553)Success in time 0.042 s
% 0.09/0.45 % Vampire exiting
%------------------------------------------------------------------------------