%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET063+4 : 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 : n002.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:42:53 PM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 30 ~; 26 |; 13 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 54 ( 51 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X1)
& member(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(f6,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(f12,conjecture,
! [X0] : equal_set(intersection(X0,empty_set),empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI17) ).
fof(f13,negated_conjecture,
~ ! [X0] : equal_set(intersection(X0,empty_set),empty_set),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f17,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(flattening,[],[f16]) ).
fof(f19,plain,
? [X0] : ~ equal_set(intersection(X0,empty_set),empty_set),
inference(ennf_transformation,[],[f13]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f21,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f21]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) )
& ( ( member(X0,X1)
& member(X0,X2) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) )
& ( ( member(X0,X1)
& member(X0,X2) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(flattening,[],[f24]) ).
fof(f39,plain,
~ equal_set(intersection(sK3,empty_set),empty_set),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f19]) ).
fof(f41,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f43,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f52,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f6]) ).
fof(f67,plain,
~ equal_set(intersection(sK3,empty_set),empty_set),
inference(cnf_transformation,[],[f39]) ).
fof(f73,plain,
! [X0] : subset(empty_set,X0),
inference(resolution,[],[f41,f52]) ).
fof(f79,plain,
! [X2,X0,X1] :
( member(sK0(intersection(X0,X1),X2),X1)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[],[f46,f41]) ).
fof(f92,plain,
! [X0] :
( ~ subset(X0,empty_set)
| equal_set(X0,empty_set) ),
inference(resolution,[],[f43,f73]) ).
fof(f333,plain,
! [X0,X1] : subset(intersection(X0,empty_set),X1),
inference(resolution,[],[f79,f52]) ).
fof(f347,plain,
! [X0] : equal_set(intersection(X0,empty_set),empty_set),
inference(resolution,[],[f333,f92]) ).
fof(f564,plain,
$false,
inference(resolution,[],[f347,f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET063+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.38 % Computer : n002.cluster.edu
% 0.05/0.38 % Model : x86_64 x86_64
% 0.05/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.38 % Memory : 8046.5625MB
% 0.05/0.38 % OS : Linux 6.8.0-71-generic
% 0.05/0.38 % CPULimit : 300
% 0.05/0.38 % WCLimit : 300
% 0.05/0.38 % DateTime : Mon Sep 28 00:30:07 UTC 2026
% 0.05/0.38 % CPUTime :
% 0.05/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.42 Running first-order model finding
% 0.05/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.17/0.46 % (4046242)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (4046250)dis+10_1_sil=32000:sp=arity:random_seed=825162866:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (4046248)% WARNING: option uhcvi not known.
% 0.17/0.46 % (4046250) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4046242-4046250"...
% 0.17/0.46 % (4046248)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3703268681:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (4046247)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=474251346_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % (4046249)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1260427518:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % (4046251)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3146764048:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % (4046250)...printing done.
% 0.17/0.46 % (4046253)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=455383843:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46 % (4046252)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2909345066:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % TRYING [1]
% 0.17/0.46 % TRYING [2]
% 0.17/0.46 % TRYING [3]
% 0.17/0.46 % (4046250)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Theorem for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (4046250)------------------------------
% 0.17/0.46 % (4046250)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (4046250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (4046250)CaDiCaL version: 2.1.3
% 0.17/0.46 % (4046250)Termination reason: Refutation
% 0.17/0.46 % (4046250)Time elapsed: 0.007 s
% 0.17/0.46 % (4046250)Peak memory usage: 11 MB
% 0.17/0.46 % (4046250)Instructions burned: 17 (million)
% 0.17/0.46 % (4046242)Success in time 0.037 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------