%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET626+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 : 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:44:13 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 6 |; 3 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 22 !; 4 ?)
% 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,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f6,conjecture,
! [X0,X1,X2] :
( intersect(X0,intersection(X1,X2))
=> intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th102) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2] :
( intersect(X0,intersection(X1,X2))
=> intersect(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f9,plain,
? [X0,X1,X2] :
( ~ intersect(X0,X1)
& intersect(X0,intersection(X1,X2)) ),
inference(ennf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f1]) ).
fof(f13,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f14,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f15,plain,
! [X2,X0,X1] :
( intersect(X0,X1)
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f22,plain,
intersect(sK2,intersection(sK3,sK4)),
inference(cnf_transformation,[],[f9]) ).
fof(f23,plain,
~ intersect(sK2,sK3),
inference(cnf_transformation,[],[f9]) ).
fof(f32,plain,
member(sK0(sK2,intersection(sK3,sK4)),intersection(sK3,sK4)),
inference(resolution,[],[f13,f22]) ).
fof(f34,plain,
member(sK0(sK2,intersection(sK3,sK4)),sK2),
inference(resolution,[],[f14,f22]) ).
fof(f36,plain,
! [X0] :
( ~ member(X0,sK3)
| ~ member(X0,sK2) ),
inference(resolution,[],[f15,f23]) ).
fof(f44,plain,
member(sK0(sK2,intersection(sK3,sK4)),sK3),
inference(resolution,[],[f32,f11]) ).
fof(f53,plain,
~ member(sK0(sK2,intersection(sK3,sK4)),sK2),
inference(resolution,[],[f44,f36]) ).
fof(f54,plain,
$false,
inference(forward_subsumption_resolution,[],[f53,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET626+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 02:28:32 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/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.10/0.44 % (4156612)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (4156621)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3331572668:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.44 % (4156621) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4156612-4156621"...
% 0.10/0.44 % (4156621)...printing done.
% 0.10/0.44 % (4156621)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 % (4156621)------------------------------
% 0.10/0.44 % (4156621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (4156621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (4156621)CaDiCaL version: 2.1.3
% 0.10/0.44 % (4156621)Termination reason: Refutation
% 0.10/0.44 % (4156621)Time elapsed: 0.002 s
% 0.10/0.44 % (4156621)Peak memory usage: 12 MB
% 0.10/0.44 % (4156621)Instructions burned: 2 (million)
% 0.10/0.44 % (4156612)Success in time 0.028 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------