%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET997+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 : n010.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:45:09 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 87 ( 15 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 96 ( 37 ~; 27 |; 18 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 42 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,axiom,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ! [X1] :
( X1 = relation_rng(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,relation_dom(X0))
& X2 = apply(X0,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_funct_1) ).
fof(f24,conjecture,
! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ( ! [X2] :
~ ( in(X2,X0)
& ! [X3] :
~ ( in(X3,relation_dom(X1))
& X2 = apply(X1,X3) ) )
=> subset(X0,relation_rng(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_funct_1) ).
fof(f25,negated_conjecture,
~ ! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ( ! [X2] :
~ ( in(X2,X0)
& ! [X3] :
~ ( in(X3,relation_dom(X1))
& X2 = apply(X1,X3) ) )
=> subset(X0,relation_rng(X1)) ) ),
inference(negated_conjecture,[status(cth)],[f24]) ).
fof(f40,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f41,plain,
! [X0] :
( ! [X1] :
( X1 = relation_rng(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,relation_dom(X0))
& X2 = apply(X0,X3) ) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f42,plain,
! [X0] :
( ! [X1] :
( X1 = relation_rng(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,relation_dom(X0))
& X2 = apply(X0,X3) ) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f41]) ).
fof(f50,plain,
? [X0,X1] :
( ~ subset(X0,relation_rng(X1))
& ! [X2] :
( ~ in(X2,X0)
| ? [X3] :
( in(X3,relation_dom(X1))
& X2 = apply(X1,X3) ) )
& relation(X1)
& function(X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f51,plain,
? [X0,X1] :
( ~ subset(X0,relation_rng(X1))
& ! [X2] :
( ~ in(X2,X0)
| ? [X3] :
( in(X3,relation_dom(X1))
& X2 = apply(X1,X3) ) )
& relation(X1)
& function(X1) ),
inference(flattening,[],[f50]) ).
fof(f65,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f66,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f72,plain,
! [X2,X3,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| apply(X0,X3) != X2
| ~ in(X3,relation_dom(X0))
| in(X2,X1)
| relation_rng(X0) != X1 ),
inference(cnf_transformation,[],[f42]) ).
fof(f100,plain,
! [X2] :
( ~ in(X2,sK13)
| apply(sK14,sK15(X2)) = X2 ),
inference(cnf_transformation,[],[f51]) ).
fof(f101,plain,
! [X2] :
( in(sK15(X2),relation_dom(sK14))
| ~ in(X2,sK13) ),
inference(cnf_transformation,[],[f51]) ).
fof(f102,plain,
function(sK14),
inference(cnf_transformation,[],[f51]) ).
fof(f103,plain,
relation(sK14),
inference(cnf_transformation,[],[f51]) ).
fof(f104,plain,
~ subset(sK13,relation_rng(sK14)),
inference(cnf_transformation,[],[f51]) ).
fof(f114,plain,
! [X3,X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X3,relation_dom(X0))
| in(apply(X0,X3),X1)
| relation_rng(X0) != X1 ),
inference(equality_resolution,[],[f72]) ).
fof(f115,plain,
! [X3,X0] :
( ~ function(X0)
| ~ relation(X0)
| ~ in(X3,relation_dom(X0))
| in(apply(X0,X3),relation_rng(X0)) ),
inference(equality_resolution,[],[f114]) ).
fof(f213,plain,
in(sK0(sK13,relation_rng(sK14)),sK13),
inference(resolution,[],[f65,f104]) ).
fof(f215,plain,
sK0(sK13,relation_rng(sK14)) = apply(sK14,sK15(sK0(sK13,relation_rng(sK14)))),
inference(resolution,[],[f213,f100]) ).
fof(f219,plain,
~ in(sK0(sK13,relation_rng(sK14)),relation_rng(sK14)),
inference(resolution,[],[f66,f104]) ).
fof(f254,plain,
! [X0] :
( ~ relation(sK14)
| ~ in(X0,relation_dom(sK14))
| in(apply(sK14,X0),relation_rng(sK14)) ),
inference(resolution,[],[f115,f102]) ).
fof(f258,plain,
! [X0] :
( in(apply(sK14,X0),relation_rng(sK14))
| ~ in(X0,relation_dom(sK14)) ),
inference(forward_subsumption_resolution,[],[f254,f103]) ).
fof(f262,plain,
( in(sK0(sK13,relation_rng(sK14)),relation_rng(sK14))
| ~ in(sK15(sK0(sK13,relation_rng(sK14))),relation_dom(sK14)) ),
inference(superposition,[],[f258,f215]) ).
fof(f263,plain,
~ in(sK15(sK0(sK13,relation_rng(sK14))),relation_dom(sK14)),
inference(forward_subsumption_resolution,[],[f262,f219]) ).
fof(f269,plain,
~ in(sK0(sK13,relation_rng(sK14)),sK13),
inference(resolution,[],[f263,f101]) ).
fof(f270,plain,
$false,
inference(forward_subsumption_resolution,[],[f269,f213]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET997+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n010.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:21:32 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/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.16/0.47 % (1531160)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (1531165)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3377443733_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % TRYING [2]
% 0.16/0.47 % TRYING [3]
% 0.16/0.47 % (1531166)% WARNING: option uhcvi not known.
% 0.16/0.47 % TRYING [4]
% 0.16/0.47 % TRYING [5]
% 0.16/0.47 % (1531166)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2967904327:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (1531170)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3231195069:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % (1531168)dis+10_1_sil=32000:sp=arity:random_seed=2569589069:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (1531167)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2491114924:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (1531169)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3786693040:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (1531171)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=236180555:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % TRYING [6]
% 0.16/0.47 % (1531169) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1531160-1531169"...
% 0.16/0.47 % (1531168) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1531160-1531168"...
% 0.16/0.47 % (1531169)...printing done.
% 0.16/0.47 % (1531166) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1531160-1531166"...
% 0.16/0.47 % (1531168)...printing done.
% 0.16/0.47 % (1531169)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (1531169)------------------------------
% 0.16/0.47 % (1531169)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (1531169)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (1531169)CaDiCaL version: 2.1.3
% 0.16/0.47 % (1531169)Termination reason: Refutation
% 0.16/0.47 % (1531169)Time elapsed: 0.006 s
% 0.16/0.47 % (1531169)Peak memory usage: 12 MB
% 0.16/0.47 % (1531169)Instructions burned: 7 (million)
% 0.16/0.47 % (1531160)Success in time 0.039 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------