%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET914+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:44:58 PM UTC 2026
% Result : Theorem 0.15s 0.47s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 50 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 41 ( 18 ~; 13 |; 4 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 47 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f4,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f13,conjecture,
! [X0,X1,X2] :
~ ( disjoint(unordered_pair(X0,X1),X2)
& in(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_zfmisc_1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( disjoint(unordered_pair(X0,X1),X2)
& in(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f18,plain,
? [X0,X1,X2] :
( disjoint(unordered_pair(X0,X1),X2)
& in(X0,X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f21,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f23,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f4]) ).
fof(f29,plain,
! [X2,X3,X0,X1] :
( X0 != X3
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f5]) ).
fof(f35,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f37,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f43,plain,
in(sK5,sK7),
inference(cnf_transformation,[],[f18]) ).
fof(f44,plain,
disjoint(unordered_pair(sK5,sK6),sK7),
inference(cnf_transformation,[],[f18]) ).
fof(f45,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f23]) ).
fof(f46,plain,
! [X2,X3,X1] :
( in(X3,X2)
| unordered_pair(X3,X1) != X2 ),
inference(equality_resolution,[],[f29]) ).
fof(f47,plain,
! [X3,X1] : in(X3,unordered_pair(X3,X1)),
inference(equality_resolution,[],[f46]) ).
fof(f51,plain,
! [X3,X0,X1] :
( ~ in(X3,X0)
| ~ in(X3,X1)
| in(X3,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f35]) ).
fof(f54,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(consistent_polarity_flipping,[],[f37]) ).
fof(f57,plain,
~ disjoint(unordered_pair(sK5,sK6),sK7),
inference(consistent_polarity_flipping,[],[f44]) ).
fof(f79,plain,
empty_set = set_intersection2(unordered_pair(sK5,sK6),sK7),
inference(resolution,[],[f54,f57]) ).
fof(f81,plain,
empty_set = set_intersection2(sK7,unordered_pair(sK5,sK6)),
inference(superposition,[],[f79,f21]) ).
fof(f95,plain,
! [X0] :
( ~ in(sK5,X0)
| in(sK5,set_intersection2(sK7,X0)) ),
inference(resolution,[],[f51,f43]) ).
fof(f140,plain,
! [X0] : in(sK5,set_intersection2(sK7,unordered_pair(sK5,X0))),
inference(resolution,[],[f95,f47]) ).
fof(f150,plain,
in(sK5,empty_set),
inference(superposition,[],[f140,f81]) ).
fof(f151,plain,
$false,
inference(forward_subsumption_resolution,[],[f150,f45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET914+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 % Computer : n026.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Mon Sep 28 03:12:12 UTC 2026
% 0.10/0.40 % CPUTime :
% 0.10/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.15/0.47 % (3431468)Will run a generic schedule for satisfiability detection.
% 0.15/0.47 % (3431474)% WARNING: option uhcvi not known.
% 0.15/0.47 % (3431474)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=887898225:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.47 % (3431474) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3431468-3431474"...
% 0.15/0.47 % (3431474)...printing done.
% 0.15/0.47 % (3431474)Refutation found. Thanks to Tanya!
% 0.15/0.47 % SZS status Theorem for theBenchmark
% 0.15/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47 % (3431474)------------------------------
% 0.15/0.47 % (3431474)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.47 % (3431474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.47 % (3431474)CaDiCaL version: 2.1.3
% 0.15/0.47 % (3431474)Termination reason: Refutation
% 0.15/0.47 % (3431474)Time elapsed: 0.003 s
% 0.15/0.47 % (3431474)Peak memory usage: 12 MB
% 0.15/0.47 % (3431474)Instructions burned: 6 (million)
% 0.15/0.47 % (3431468)Success in time 0.034 s
% 0.15/0.47 % Vampire exiting
%------------------------------------------------------------------------------