%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET148+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:43:16 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 10 unt; 0 def)
% Number of atoms : 16 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 7 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 12 ( 11 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_intersection) ).
fof(f6,axiom,
! [X0] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset) ).
fof(f8,conjecture,
! [X0] : intersection(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_idempotency_of_intersection) ).
fof(f9,negated_conjecture,
~ ! [X0] : intersection(X0,X0) = X0,
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( intersection(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
? [X0] : intersection(X0,X0) != X0,
inference(ennf_transformation,[],[f9]) ).
fof(f23,plain,
sK2 != intersection(sK2,sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f12]) ).
fof(f24,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| intersection(X0,X1) = X0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f35,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f40,plain,
sK2 != intersection(sK2,sK2),
inference(cnf_transformation,[],[f23]) ).
fof(f51,plain,
! [X0] : intersection(X0,X0) = X0,
inference(resolution,[],[f24,f35]) ).
fof(f61,plain,
sK2 != sK2,
inference(superposition,[],[f40,f51]) ).
fof(f62,plain,
$false,
inference(trivial_inequality_removal,[],[f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET148+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 00:50:05 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/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.10/0.44 % (3119875)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (3119882)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2289888009:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.44 % (3119882) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3119875-3119882"...
% 0.10/0.44 % (3119882)...printing done.
% 0.10/0.44 % (3119882)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Theorem for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44 % (3119882)------------------------------
% 0.10/0.44 % (3119882)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (3119882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (3119882)CaDiCaL version: 2.1.3
% 0.10/0.44 % (3119882)Termination reason: Refutation
% 0.10/0.44 % (3119882)Time elapsed: 0.001 s
% 0.10/0.44 % (3119882)Peak memory usage: 12 MB
% 0.10/0.44 % (3119882)Instructions burned: 1 (million)
% 0.10/0.44 % (3119875)Success in time 0.03 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------