%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU129+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 : n001.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.15s 0.46s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 46 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 20 ~; 14 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 42 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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(f23,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f24,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f26,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f27,conjecture,
! [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,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f50,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(ennf_transformation,[],[f24]) ).
fof(f51,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(ennf_transformation,[],[f26]) ).
fof(f53,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
? [X0,X1,X2] :
( ~ subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f82,plain,
( ~ subset(set_intersection2(sK6,sK8),set_intersection2(sK7,sK8))
& subset(sK6,sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8)],[f54]) ).
fof(f87,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f120,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f23]) ).
fof(f121,plain,
! [X2,X0,X1] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f123,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f124,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f82]) ).
fof(f125,plain,
~ subset(set_intersection2(sK6,sK8),set_intersection2(sK7,sK8)),
inference(cnf_transformation,[],[f82]) ).
fof(f182,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X1),
inference(superposition,[],[f120,f87]) ).
fof(f328,plain,
! [X0] :
( ~ subset(X0,sK6)
| subset(X0,sK7) ),
inference(resolution,[],[f123,f124]) ).
fof(f334,plain,
! [X0] : subset(set_intersection2(sK6,X0),sK7),
inference(resolution,[],[f328,f120]) ).
fof(f388,plain,
( ~ subset(set_intersection2(sK6,sK8),sK7)
| ~ subset(set_intersection2(sK6,sK8),sK8) ),
inference(resolution,[],[f121,f125]) ).
fof(f399,plain,
~ subset(set_intersection2(sK6,sK8),sK8),
inference(forward_subsumption_resolution,[],[f388,f334]) ).
fof(f400,plain,
$false,
inference(forward_subsumption_resolution,[],[f399,f182]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU129+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 : n001.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.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Sep 28 03:45:17 UTC 2026
% 0.15/0.37 % CPUTime :
% 0.15/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.15/0.46 % (4187746)Will run a generic schedule for satisfiability detection.
% 0.15/0.46 % (4187756)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2135545785:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.46 % (4187752)% WARNING: option uhcvi not known.
% 0.15/0.46 % (4187751)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2893111000_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.46 % (4187757)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1684130852:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.46 % (4187753)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=840245942:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.46 % (4187754)dis+10_1_sil=32000:sp=arity:random_seed=697201514:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.46 % (4187755)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3106426493:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.46 % (4187752)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1812441294:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.46 % TRYING [1]
% 0.15/0.46 % TRYING [2]
% 0.15/0.46 % TRYING [3]
% 0.15/0.46 % (4187754) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4187746-4187754"...
% 0.15/0.46 % (4187754)...printing done.
% 0.15/0.46 % (4187755) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4187746-4187755"...
% 0.15/0.46 % (4187754)Refutation found. Thanks to Tanya!
% 0.15/0.46 % SZS status Theorem for theBenchmark
% 0.15/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46 % (4187754)------------------------------
% 0.15/0.46 % (4187754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.46 % (4187754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.46 % (4187754)CaDiCaL version: 2.1.3
% 0.15/0.46 % (4187754)Termination reason: Refutation
% 0.15/0.46 % (4187754)Time elapsed: 0.008 s
% 0.15/0.46 % (4187754)Peak memory usage: 12 MB
% 0.15/0.46 % (4187754)Instructions burned: 9 (million)
% 0.15/0.46 % (4187746)Success in time 0.046 s
% 0.15/0.46 % Vampire exiting
%------------------------------------------------------------------------------