%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET689+4 : 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 : n016.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:26 PM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 22 ~; 15 |; 12 &)
% ( 3 <=>; 4 =>; 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2)
& subset(X2,X0) )
=> equal_set(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI05) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2)
& subset(X2,X0) )
=> equal_set(X0,X2) ),
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,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X0,X1)
& subset(X1,X2)
& subset(X2,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X0,X1)
& subset(X1,X2)
& subset(X2,X0) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f48,plain,
subset(sK5,sK3),
inference(cnf_transformation,[],[f20]) ).
fof(f49,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f20]) ).
fof(f50,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f20]) ).
fof(f51,plain,
~ equal_set(sK3,sK5),
inference(cnf_transformation,[],[f20]) ).
fof(f65,plain,
! [X0] :
( member(X0,sK4)
| ~ member(X0,sK3) ),
inference(resolution,[],[f21,f50]) ).
fof(f66,plain,
! [X0] :
( ~ member(X0,sK4)
| member(X0,sK5) ),
inference(resolution,[],[f21,f49]) ).
fof(f68,plain,
( ~ subset(sK3,sK5)
| ~ subset(sK5,sK3) ),
inference(resolution,[],[f24,f51]) ).
fof(f69,plain,
~ subset(sK3,sK5),
inference(forward_subsumption_resolution,[],[f68,f48]) ).
fof(f70,plain,
~ member(sK0(sK3,sK5),sK5),
inference(resolution,[],[f69,f23]) ).
fof(f71,plain,
member(sK0(sK3,sK5),sK3),
inference(resolution,[],[f69,f22]) ).
fof(f107,plain,
! [X0] :
( member(X0,sK5)
| ~ member(X0,sK3) ),
inference(resolution,[],[f66,f65]) ).
fof(f145,plain,
~ member(sK0(sK3,sK5),sK3),
inference(resolution,[],[f107,f70]) ).
fof(f146,plain,
$false,
inference(forward_subsumption_resolution,[],[f145,f71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET689+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.35 % Computer : n016.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 28 02:38:47 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 Running first-order model finding
% 0.13/0.38 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/0.43 % (3202350)Will run a generic schedule for satisfiability detection.
% 0.13/0.43 % (3202357)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=694305909:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.43 % (3202356)% WARNING: option uhcvi not known.
% 0.13/0.43 % (3202355)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3342912223_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.43 % (3202356)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1795470488:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.43 % (3202361)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=562518871:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.43 % (3202358)dis+10_1_sil=32000:sp=arity:random_seed=3066612499:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.43 % (3202359)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3644765484:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.43 % (3202360)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=20943399:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.43 % TRYING [1]
% 0.13/0.43 % TRYING [2]
% 0.13/0.43 % TRYING [3]
% 0.13/0.43 % TRYING [4]
% 0.13/0.43 % (3202359) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3202350-3202359"...
% 0.13/0.43 % (3202359)...printing done.
% 0.13/0.43 % (3202359)Refutation found. Thanks to Tanya!
% 0.13/0.43 % SZS status Theorem for theBenchmark
% 0.13/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.43 % (3202359)------------------------------
% 0.13/0.43 % (3202359)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.43 % (3202359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.43 % (3202359)CaDiCaL version: 2.1.3
% 0.13/0.43 % (3202359)Termination reason: Refutation
% 0.13/0.43 % (3202359)Time elapsed: 0.005 s
% 0.13/0.43 % (3202359)Peak memory usage: 11 MB
% 0.13/0.43 % (3202359)Instructions burned: 6 (million)
% 0.13/0.43 % (3202350)Success in time 0.04 s
% 0.13/0.43 % Vampire exiting
%------------------------------------------------------------------------------