%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU130+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:01 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 19 unt; 0 def)
% Number of atoms : 39 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 8 ~; 4 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 40 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f17,axiom,
! [X0,X1] : set_intersection2(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(f22,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f23,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f27,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f28,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f29,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f41,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(rectify,[],[f17]) ).
fof(f50,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f55,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f56,plain,
? [X0,X1] :
( set_intersection2(X0,X1) != X0
& subset(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f84,plain,
( sK6 != set_intersection2(sK6,sK7)
& subset(sK6,sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f56]) ).
fof(f88,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f89,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f116,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(cnf_transformation,[],[f41]) ).
fof(f121,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f50]) ).
fof(f122,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f23]) ).
fof(f126,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f55]) ).
fof(f127,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f84]) ).
fof(f128,plain,
sK6 != set_intersection2(sK6,sK7),
inference(cnf_transformation,[],[f84]) ).
fof(f208,plain,
! [X0,X1] : set_union2(set_intersection2(X0,X1),X0) = X0,
inference(resolution,[],[f121,f122]) ).
fof(f213,plain,
! [X0,X1] : set_union2(X0,set_intersection2(X0,X1)) = X0,
inference(forward_demodulation,[],[f208,f88]) ).
fof(f340,plain,
! [X0] : subset(set_intersection2(sK6,X0),set_intersection2(sK7,X0)),
inference(resolution,[],[f126,f127]) ).
fof(f417,plain,
subset(sK6,set_intersection2(sK7,sK6)),
inference(superposition,[],[f340,f116]) ).
fof(f425,plain,
subset(sK6,set_intersection2(sK6,sK7)),
inference(forward_demodulation,[],[f417,f89]) ).
fof(f431,plain,
set_intersection2(sK6,sK7) = set_union2(sK6,set_intersection2(sK6,sK7)),
inference(resolution,[],[f425,f121]) ).
fof(f436,plain,
sK6 = set_intersection2(sK6,sK7),
inference(forward_demodulation,[],[f431,f213]) ).
fof(f438,plain,
$false,
inference(forward_subsumption_resolution,[],[f436,f128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU130+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n019.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:40:18 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.16/0.47 % (3637609)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (3637636)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4217400880:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (3637632)% WARNING: option uhcvi not known.
% 0.16/0.47 % (3637634)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3051287022:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (3637631)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1552704575_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % (3637632)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=620058132:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (3637635)dis+10_1_sil=32000:sp=arity:random_seed=3731280446:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (3637637)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1433324803:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % (3637638)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1714759154:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % TRYING [2]
% 0.16/0.47 % TRYING [3]
% 0.16/0.47 % (3637637) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3637609-3637637"...
% 0.16/0.47 % TRYING [4]
% 0.16/0.47 % (3637637)...printing done.
% 0.16/0.47 % (3637637)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (3637637)------------------------------
% 0.16/0.47 % (3637637)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (3637637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (3637637)CaDiCaL version: 2.1.3
% 0.16/0.47 % (3637637)Termination reason: Refutation
% 0.16/0.47 % (3637637)Time elapsed: 0.010 s
% 0.16/0.47 % (3637637)Peak memory usage: 12 MB
% 0.16/0.47 % (3637637)Instructions burned: 12 (million)
% 0.16/0.47 % (3637609)Success in time 0.052 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------