%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET573+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 : n013.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.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 30 ( 13 ~; 5 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 27 ( 20 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f2,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f4,conjecture,
! [X0,X1,X2] :
( ( member(X0,X1)
& disjoint(X1,X2) )
=> ~ member(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th12) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2] :
( ( member(X0,X1)
& disjoint(X1,X2) )
=> ~ member(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( disjoint(X0,X1)
=> ~ intersect(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f7,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
? [X0,X1,X2] :
( member(X0,X2)
& member(X0,X1)
& disjoint(X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
? [X0,X1,X2] :
( member(X0,X2)
& member(X0,X1)
& disjoint(X1,X2) ),
inference(flattening,[],[f9]) ).
fof(f13,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
disjoint(sK2,sK3),
inference(cnf_transformation,[],[f10]) ).
fof(f17,plain,
member(sK1,sK2),
inference(cnf_transformation,[],[f10]) ).
fof(f18,plain,
member(sK1,sK3),
inference(cnf_transformation,[],[f10]) ).
fof(f19,plain,
~ intersect(sK2,sK3),
inference(resolution,[],[f14,f16]) ).
fof(f23,plain,
! [X0] :
( ~ member(sK1,X0)
| intersect(X0,sK3) ),
inference(resolution,[],[f13,f18]) ).
fof(f32,plain,
intersect(sK2,sK3),
inference(resolution,[],[f23,f17]) ).
fof(f34,plain,
$false,
inference(forward_subsumption_resolution,[],[f32,f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET573+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n013.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Sep 28 02:10:52 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 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.19/0.48 % (741886)Will run a generic schedule for satisfiability detection.
% 0.19/0.48 % (741895)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=861123047:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.48 % (741895) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-741886-741895"...
% 0.19/0.48 % (741895)...printing done.
% 0.19/0.48 % (741895)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (741895)------------------------------
% 0.19/0.48 % (741895)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.48 % (741895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.48 % (741895)CaDiCaL version: 2.1.3
% 0.19/0.48 % (741895)Termination reason: Refutation
% 0.19/0.48 % (741895)Time elapsed: 0.001 s
% 0.19/0.48 % (741895)Peak memory usage: 11 MB
% 0.19/0.48 % (741895)Instructions burned: 1 (million)
% 0.19/0.48 % (741886)Success in time 0.036 s
% 0.19/0.48 % Vampire exiting
%------------------------------------------------------------------------------