%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET576+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 : n026.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:58 PM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 35 ( 18 ~; 8 |; 2 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 23 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f2,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f4,conjecture,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th17) ).
fof(f5,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
=> disjoint(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f7,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
? [X0,X1] :
( ~ disjoint(X0,X1)
& ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f13,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
~ disjoint(sK1,sK2),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
intersect(sK1,sK2),
inference(resolution,[],[f13,f16]) ).
fof(f20,plain,
! [X0] :
( ~ member(sK0(X0,sK2),sK1)
| ~ intersect(X0,sK2) ),
inference(resolution,[],[f10,f15]) ).
fof(f21,plain,
( ~ intersect(sK1,sK2)
| ~ intersect(sK1,sK2) ),
inference(resolution,[],[f11,f20]) ).
fof(f23,plain,
~ intersect(sK1,sK2),
inference(duplicate_literal_removal,[],[f21]) ).
fof(f24,plain,
$false,
inference(forward_subsumption_resolution,[],[f23,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET576+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.11/0.38 % Computer : n026.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 02:15:12 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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 % (3406734)Will run a generic schedule for satisfiability detection.
% 0.15/0.46 % (3406743)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1593430396:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.46 % (3406743) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3406734-3406743"...
% 0.15/0.46 % (3406743)...printing done.
% 0.15/0.46 % (3406743)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 % (3406743)------------------------------
% 0.15/0.46 % (3406743)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.46 % (3406743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.46 % (3406743)CaDiCaL version: 2.1.3
% 0.15/0.46 % (3406743)Termination reason: Refutation
% 0.15/0.46 % (3406743)Time elapsed: 0.001 s
% 0.15/0.46 % (3406743)Peak memory usage: 11 MB
% 0.15/0.46 % (3406743)Instructions burned: 1 (million)
% 0.15/0.46 % (3406734)Success in time 0.035 s
% 0.15/0.46 % Vampire exiting
%------------------------------------------------------------------------------