%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU107+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 : n011.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:56 PM UTC 2026
% Result : Theorem 0.14s 0.46s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 14 unt; 0 def)
% Number of atoms : 105 ( 12 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 113 ( 48 ~; 47 |; 12 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 57 ( 54 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1,X2] :
( ( ~ empty(X0)
& preboolean(X0)
& element(X1,X0)
& element(X2,X0) )
=> element(prebool_difference(X0,X1,X2),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_finsub_1) ).
fof(f7,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f20,axiom,
! [X0,X1,X2] :
( ( ~ empty(X0)
& preboolean(X0)
& element(X1,X0)
& element(X2,X0) )
=> prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k2_finsub_1) ).
fof(f21,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f22,conjecture,
! [X0] :
( ( ~ empty(X0)
& preboolean(X0) )
=> in(empty_set,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_finsub_1) ).
fof(f23,negated_conjecture,
~ ! [X0] :
( ( ~ empty(X0)
& preboolean(X0) )
=> in(empty_set,X0) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f25,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f26,axiom,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f35,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f21]) ).
fof(f50,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f51,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(flattening,[],[f50]) ).
fof(f56,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f57,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(flattening,[],[f56]) ).
fof(f58,plain,
? [X0] :
( ~ in(empty_set,X0)
& ~ empty(X0)
& preboolean(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f59,plain,
? [X0] :
( ~ in(empty_set,X0)
& ~ empty(X0)
& preboolean(X0) ),
inference(flattening,[],[f58]) ).
fof(f61,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f62,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f61]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0)
| empty(X0)
| element(prebool_difference(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f76,plain,
! [X0] : element(sK0(X0),X0),
inference(cnf_transformation,[],[f7]) ).
fof(f101,plain,
! [X2,X0,X1] :
( ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0)
| empty(X0)
| prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f102,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f35]) ).
fof(f103,plain,
preboolean(sK10),
inference(cnf_transformation,[],[f59]) ).
fof(f104,plain,
~ empty(sK10),
inference(cnf_transformation,[],[f59]) ).
fof(f105,plain,
~ in(empty_set,sK10),
inference(cnf_transformation,[],[f59]) ).
fof(f107,plain,
! [X0,X1] :
( in(X0,X1)
| ~ element(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f62]) ).
fof(f108,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_difference(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f26]) ).
fof(f158,plain,
( ~ element(empty_set,sK10)
| empty(sK10) ),
inference(resolution,[],[f107,f105]) ).
fof(f161,plain,
~ element(empty_set,sK10),
inference(forward_subsumption_resolution,[],[f158,f104]) ).
fof(f162,plain,
! [X0] : empty_set = set_difference(X0,X0),
inference(resolution,[],[f108,f102]) ).
fof(f172,plain,
! [X0,X1] :
( ~ element(X0,sK10)
| ~ element(X1,sK10)
| empty(sK10)
| element(prebool_difference(sK10,X0,X1),sK10) ),
inference(resolution,[],[f75,f103]) ).
fof(f175,plain,
! [X0,X1] :
( element(prebool_difference(sK10,X0,X1),sK10)
| ~ element(X1,sK10)
| ~ element(X0,sK10) ),
inference(forward_subsumption_resolution,[],[f172,f104]) ).
fof(f176,plain,
! [X0,X1] :
( ~ element(X0,sK10)
| ~ element(X1,sK10)
| empty(sK10)
| set_difference(X0,X1) = prebool_difference(sK10,X0,X1) ),
inference(resolution,[],[f101,f103]) ).
fof(f179,plain,
! [X0,X1] :
( ~ element(X0,sK10)
| ~ element(X1,sK10)
| set_difference(X0,X1) = prebool_difference(sK10,X0,X1) ),
inference(forward_subsumption_resolution,[],[f176,f104]) ).
fof(f181,plain,
! [X0] :
( ~ element(X0,sK10)
| set_difference(sK0(sK10),X0) = prebool_difference(sK10,sK0(sK10),X0) ),
inference(resolution,[],[f179,f76]) ).
fof(f186,plain,
set_difference(sK0(sK10),sK0(sK10)) = prebool_difference(sK10,sK0(sK10),sK0(sK10)),
inference(resolution,[],[f181,f76]) ).
fof(f187,plain,
empty_set = prebool_difference(sK10,sK0(sK10),sK0(sK10)),
inference(forward_demodulation,[],[f186,f162]) ).
fof(f189,plain,
( element(empty_set,sK10)
| ~ element(sK0(sK10),sK10)
| ~ element(sK0(sK10),sK10) ),
inference(superposition,[],[f175,f187]) ).
fof(f190,plain,
( element(empty_set,sK10)
| ~ element(sK0(sK10),sK10) ),
inference(duplicate_literal_removal,[],[f189]) ).
fof(f191,plain,
~ element(sK0(sK10),sK10),
inference(forward_subsumption_resolution,[],[f190,f161]) ).
fof(f192,plain,
$false,
inference(forward_subsumption_resolution,[],[f191,f76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU107+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n011.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 03:35:46 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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.14/0.46 % (2992114)Will run a generic schedule for satisfiability detection.
% 0.14/0.46 % (2992121)% WARNING: option uhcvi not known.
% 0.14/0.46 % (2992120)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1888821871_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.46 % (2992124)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4189846491:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.46 % (2992121)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1884923239:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.46 % (2992123)dis+10_1_sil=32000:sp=arity:random_seed=1294894441:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.46 % (2992125)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=464187921:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.46 % (2992126)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4174257891:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.46 % TRYING [1]
% 0.14/0.46 % TRYING [2]
% 0.14/0.46 % TRYING [3]
% 0.14/0.46 % (2992122)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2893345314:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.46 % (2992124) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2992114-2992124"...
% 0.14/0.46 % TRYING [4]
% 0.14/0.46 % (2992124)...printing done.
% 0.14/0.46 % (2992125) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2992114-2992125"...
% 0.14/0.46 % (2992124)Refutation found. Thanks to Tanya!
% 0.14/0.46 % SZS status Theorem for theBenchmark
% 0.14/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.46 % (2992124)------------------------------
% 0.14/0.46 % (2992124)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.46 % (2992124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.46 % (2992124)CaDiCaL version: 2.1.3
% 0.14/0.46 % (2992124)Termination reason: Refutation
% 0.14/0.46 % (2992124)Time elapsed: 0.008 s
% 0.14/0.46 % (2992124)Peak memory usage: 12 MB
% 0.14/0.46 % (2992124)Instructions burned: 6 (million)
% 0.14/0.46 % (2992114)Success in time 0.042 s
% 0.14/0.46 % Vampire exiting
%------------------------------------------------------------------------------