%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET581+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:44:00 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 39 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 15 ~; 7 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f2,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f4,axiom,
! [X0,X1] :
( not_equal(X0,X1)
<=> X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_equal_defn) ).
fof(f7,conjecture,
! [X0,X1,X2] :
( ( member(X0,X1)
& member(X0,X2) )
=> not_equal(intersection(X1,X2),empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th24) ).
fof(f8,negated_conjecture,
~ ! [X0,X1,X2] :
( ( member(X0,X1)
& member(X0,X2) )
=> not_equal(intersection(X1,X2),empty_set) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( X0 != X1
=> not_equal(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f10,plain,
! [X0,X1] :
( not_equal(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f9]) ).
fof(f11,plain,
? [X0,X1,X2] :
( ~ not_equal(intersection(X1,X2),empty_set)
& member(X0,X1)
& member(X0,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f12,plain,
? [X0,X1,X2] :
( ~ not_equal(intersection(X1,X2),empty_set)
& member(X0,X1)
& member(X0,X2) ),
inference(flattening,[],[f11]) ).
fof(f15,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f2]) ).
fof(f21,plain,
! [X0,X1] :
( not_equal(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f10]) ).
fof(f23,plain,
member(sK1,sK3),
inference(cnf_transformation,[],[f12]) ).
fof(f24,plain,
member(sK1,sK2),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
~ not_equal(intersection(sK2,sK3),empty_set),
inference(cnf_transformation,[],[f12]) ).
fof(f28,plain,
empty_set = intersection(sK2,sK3),
inference(resolution,[],[f21,f25]) ).
fof(f41,plain,
! [X0] :
( member(X0,empty_set)
| ~ member(X0,sK2)
| ~ member(X0,sK3) ),
inference(superposition,[],[f15,f28]) ).
fof(f42,plain,
! [X0] :
( ~ member(X0,sK3)
| ~ member(X0,sK2) ),
inference(forward_subsumption_resolution,[],[f41,f16]) ).
fof(f50,plain,
~ member(sK1,sK2),
inference(resolution,[],[f42,f23]) ).
fof(f53,plain,
$false,
inference(forward_subsumption_resolution,[],[f50,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET581+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 28 02:12:40 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 Running first-order model finding
% 0.11/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.11/0.44 % (3521056)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (3521065)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2930581905:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.44 % (3521065) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3521056-3521065"...
% 0.11/0.44 % (3521065)...printing done.
% 0.11/0.44 % (3521065)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (3521065)------------------------------
% 0.11/0.44 % (3521065)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (3521065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (3521065)CaDiCaL version: 2.1.3
% 0.11/0.44 % (3521065)Termination reason: Refutation
% 0.11/0.44 % (3521065)Time elapsed: 0.001 s
% 0.11/0.44 % (3521065)Peak memory usage: 12 MB
% 0.11/0.44 % (3521065)Instructions burned: 2 (million)
% 0.11/0.44 % (3521056)Success in time 0.034 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------