%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET596+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 : n020.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:04 PM UTC 2026
% Result : Theorem 0.13s 15.46s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 33 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 10 ~; 6 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 20 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_of_empty_set_is_empty_set) ).
fof(f2,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(intersection(X0,X2),intersection(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_of_subset) ).
fof(f11,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X1)
& intersection(X1,X2) = empty_set )
=> intersection(X0,X2) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th55) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X1)
& intersection(X1,X2) = empty_set )
=> intersection(X0,X2) = empty_set ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [X0] :
( X0 = empty_set
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1,X2] :
( subset(intersection(X0,X2),intersection(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f16,plain,
? [X0,X1,X2] :
( empty_set != intersection(X0,X2)
& subset(X0,X1)
& intersection(X1,X2) = empty_set ),
inference(ennf_transformation,[],[f12]) ).
fof(f17,plain,
? [X0,X1,X2] :
( empty_set != intersection(X0,X2)
& subset(X0,X1)
& intersection(X1,X2) = empty_set ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X2,X0,X1] :
( subset(intersection(X0,X2),intersection(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f36,plain,
empty_set = intersection(sK3,sK4),
inference(cnf_transformation,[],[f17]) ).
fof(f37,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f17]) ).
fof(f38,plain,
empty_set != intersection(sK2,sK4),
inference(cnf_transformation,[],[f17]) ).
fof(f71,plain,
! [X0] :
( subset(intersection(X0,sK4),empty_set)
| ~ subset(X0,sK3) ),
inference(superposition,[],[f19,f36]) ).
fof(f112,plain,
! [X0] :
( ~ subset(X0,sK3)
| empty_set = intersection(X0,sK4) ),
inference(resolution,[],[f71,f18]) ).
fof(f194,plain,
empty_set = intersection(sK2,sK4),
inference(resolution,[],[f112,f37]) ).
fof(f195,plain,
$false,
inference(forward_subsumption_resolution,[],[f194,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET596+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.10/15.39 % Computer : n020.cluster.edu
% 0.10/15.39 % Model : x86_64 x86_64
% 0.10/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.39 % Memory : 8046.5625MB
% 0.10/15.39 % OS : Linux 6.8.0-71-generic
% 0.10/15.39 % CPULimit : 300
% 0.10/15.39 % WCLimit : 300
% 0.10/15.39 % DateTime : Mon Sep 28 02:18:22 UTC 2026
% 0.10/15.39 % CPUTime :
% 0.10/15.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/15.42 Running first-order model finding
% 0.13/15.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.13/15.46 % (3970971)Will run a generic schedule for satisfiability detection.
% 0.13/15.46 % (3970980)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3341807323:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/15.46 % (3970977)% WARNING: option uhcvi not known.
% 0.13/15.46 % (3970980) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3970971-3970980"...
% 0.13/15.46 % (3970980)...printing done.
% 0.13/15.46 % (3970980)Refutation found. Thanks to Tanya!
% 0.13/15.46 % SZS status Theorem for theBenchmark
% 0.13/15.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/15.46 % (3970980)------------------------------
% 0.13/15.46 % (3970980)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/15.46 % (3970980)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/15.46 % (3970980)CaDiCaL version: 2.1.3
% 0.13/15.46 % (3970980)Termination reason: Refutation
% 0.13/15.46 % (3970980)Time elapsed: 0.003 s
% 0.13/15.46 % (3970980)Peak memory usage: 12 MB
% 0.13/15.46 % (3970980)Instructions burned: 7 (million)
% 0.13/15.46 % (3970971)Success in time 0.028 s
% 0.13/15.46 % Vampire exiting
%------------------------------------------------------------------------------