%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM592+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:24:56 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 8 unt; 0 def)
% Number of atoms : 124 ( 25 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 161 ( 72 ~; 61 |; 25 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 39 ( 33 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f91,axiom,
( xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4448_02) ).
fof(f93,axiom,
( aElementOf0(xu,xT)
& aSubsetOf0(xX,xY)
& isCountable0(xX)
& ! [X0] :
( ( aSet0(X0)
& aElementOf0(X0,slbdtsldtrb0(xX,xk)) )
=> sdtlpdtrp0(xd,X0) = xu ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4545) ).
fof(f94,conjecture,
? [X0] :
( aElementOf0(X0,xT)
& ? [X1] :
( aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& isCountable0(X1)
& ! [X2] :
( ( aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(X1,xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f95,negated_conjecture,
~ ? [X0] :
( aElementOf0(X0,xT)
& ? [X1] :
( aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& isCountable0(X1)
& ! [X2] :
( ( aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(X1,xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) = X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f94]) ).
fof(f218,plain,
( aElementOf0(xu,xT)
& aSubsetOf0(xX,xY)
& isCountable0(xX)
& ! [X0] :
( sdtlpdtrp0(xd,X0) = xu
| ~ aSet0(X0)
| ~ aElementOf0(X0,slbdtsldtrb0(xX,xk)) ) ),
inference(ennf_transformation,[],[f93]) ).
fof(f219,plain,
( aElementOf0(xu,xT)
& aSubsetOf0(xX,xY)
& isCountable0(xX)
& ! [X0] :
( sdtlpdtrp0(xd,X0) = xu
| ~ aSet0(X0)
| ~ aElementOf0(X0,slbdtsldtrb0(xX,xk)) ) ),
inference(flattening,[],[f218]) ).
fof(f220,plain,
! [X0] :
( ~ aElementOf0(X0,xT)
| ! [X1] :
( ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X1)
| ? [X2] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) != X0
& aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(X1,xk)) ) ) ),
inference(ennf_transformation,[],[f95]) ).
fof(f221,plain,
! [X0] :
( ~ aElementOf0(X0,xT)
| ! [X1] :
( ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X1)
| ? [X2] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X2) != X0
& aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(X1,xk)) ) ) ),
inference(flattening,[],[f220]) ).
fof(f288,plain,
! [X0] :
( ~ aElementOf0(X0,xT)
| ! [X1] :
( ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X1)
| ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),sK25(X0,X1)) != X0
& aSet0(sK25(X0,X1))
& aElementOf0(sK25(X0,X1),slbdtsldtrb0(X1,xk)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK25]),skolemize(X2,sK25(X0,X1))],[f221]) ).
fof(f467,plain,
xd = sdtlpdtrp0(xC,xi),
inference(cnf_transformation,[],[f91]) ).
fof(f468,plain,
xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(cnf_transformation,[],[f91]) ).
fof(f474,plain,
! [X0] :
( ~ aElementOf0(X0,slbdtsldtrb0(xX,xk))
| ~ aSet0(X0)
| xu = sdtlpdtrp0(xd,X0) ),
inference(cnf_transformation,[],[f219]) ).
fof(f475,plain,
isCountable0(xX),
inference(cnf_transformation,[],[f219]) ).
fof(f476,plain,
aSubsetOf0(xX,xY),
inference(cnf_transformation,[],[f219]) ).
fof(f477,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f219]) ).
fof(f478,plain,
! [X0,X1] :
( ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X0,xT)
| ~ isCountable0(X1)
| aElementOf0(sK25(X0,X1),slbdtsldtrb0(X1,xk)) ),
inference(cnf_transformation,[],[f288]) ).
fof(f479,plain,
! [X0,X1] :
( ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X0,xT)
| ~ isCountable0(X1)
| aSet0(sK25(X0,X1)) ),
inference(cnf_transformation,[],[f288]) ).
fof(f480,plain,
! [X0,X1] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),sK25(X0,X1)) != X0
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X1)
| ~ aElementOf0(X0,xT) ),
inference(cnf_transformation,[],[f288]) ).
fof(f611,plain,
! [X0,X1] :
( sdtlpdtrp0(xd,sK25(X0,X1)) != X0
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ isCountable0(X1)
| ~ aElementOf0(X0,xT) ),
inference(superposition,[],[f480,f467]) ).
fof(f680,plain,
! [X0,X1] :
( aElementOf0(sK25(X1,X0),slbdtsldtrb0(X0,xk))
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X0)
| ~ aSubsetOf0(X0,xY) ),
inference(superposition,[],[f478,f468]) ).
fof(f681,plain,
! [X0,X1] :
( aSet0(sK25(X1,X0))
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X0)
| ~ aSubsetOf0(X0,xY) ),
inference(superposition,[],[f479,f468]) ).
fof(f708,plain,
! [X0] :
( ~ aElementOf0(X0,xT)
| ~ isCountable0(xX)
| ~ aSubsetOf0(xX,xY)
| ~ aSet0(sK25(X0,xX))
| xu = sdtlpdtrp0(xd,sK25(X0,xX)) ),
inference(resolution,[],[f680,f474]) ).
fof(f710,plain,
! [X0] :
( ~ aElementOf0(X0,xT)
| ~ aSubsetOf0(xX,xY)
| ~ aSet0(sK25(X0,xX))
| xu = sdtlpdtrp0(xd,sK25(X0,xX)) ),
inference(forward_subsumption_resolution,[],[f708,f475]) ).
fof(f712,plain,
! [X0] :
( ~ aSet0(sK25(X0,xX))
| ~ aElementOf0(X0,xT)
| xu = sdtlpdtrp0(xd,sK25(X0,xX)) ),
inference(forward_subsumption_resolution,[],[f710,f476]) ).
fof(f743,plain,
! [X0] :
( ~ aElementOf0(X0,xT)
| xu = sdtlpdtrp0(xd,sK25(X0,xX))
| ~ aElementOf0(X0,xT)
| ~ isCountable0(xX)
| ~ aSubsetOf0(xX,xY) ),
inference(resolution,[],[f712,f681]) ).
fof(f744,plain,
! [X0] :
( ~ aElementOf0(X0,xT)
| xu = sdtlpdtrp0(xd,sK25(X0,xX))
| ~ isCountable0(xX)
| ~ aSubsetOf0(xX,xY) ),
inference(duplicate_literal_removal,[],[f743]) ).
fof(f745,plain,
! [X0] :
( ~ aElementOf0(X0,xT)
| xu = sdtlpdtrp0(xd,sK25(X0,xX))
| ~ aSubsetOf0(xX,xY) ),
inference(forward_subsumption_resolution,[],[f744,f475]) ).
fof(f746,plain,
! [X0] :
( ~ aElementOf0(X0,xT)
| xu = sdtlpdtrp0(xd,sK25(X0,xX)) ),
inference(forward_subsumption_resolution,[],[f745,f476]) ).
fof(f751,plain,
xu = sdtlpdtrp0(xd,sK25(xu,xX)),
inference(resolution,[],[f746,f477]) ).
fof(f754,plain,
! [X0,X1] :
( sdtlpdtrp0(xd,sK25(X0,X1)) != X0
| ~ aSubsetOf0(X1,xY)
| ~ isCountable0(X1)
| ~ aElementOf0(X0,xT) ),
inference(forward_demodulation,[],[f611,f468]) ).
fof(f766,plain,
( xu != xu
| ~ aSubsetOf0(xX,xY)
| ~ isCountable0(xX)
| ~ aElementOf0(xu,xT) ),
inference(superposition,[],[f754,f751]) ).
fof(f767,plain,
( ~ aSubsetOf0(xX,xY)
| ~ isCountable0(xX)
| ~ aElementOf0(xu,xT) ),
inference(trivial_inequality_removal,[],[f766]) ).
fof(f768,plain,
( ~ isCountable0(xX)
| ~ aElementOf0(xu,xT) ),
inference(forward_subsumption_resolution,[],[f767,f476]) ).
fof(f769,plain,
~ aElementOf0(xu,xT),
inference(forward_subsumption_resolution,[],[f768,f475]) ).
fof(f770,plain,
$false,
inference(forward_subsumption_resolution,[],[f769,f477]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM592+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n013.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 : Sun Sep 27 20:38:51 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 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.47 % (531132)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (531139)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2595350393:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (531139) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-531132-531139"...
% 0.17/0.47 % (531138)% WARNING: option uhcvi not known.
% 0.17/0.47 % (531139)...printing done.
% 0.17/0.47 % (531139)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (531139)------------------------------
% 0.17/0.47 % (531139)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (531139)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (531139)CaDiCaL version: 2.1.3
% 0.17/0.47 % (531139)Termination reason: Refutation
% 0.17/0.47 % (531139)Time elapsed: 0.008 s
% 0.17/0.47 % (531139)Peak memory usage: 12 MB
% 0.17/0.47 % (531139)Instructions burned: 20 (million)
% 0.17/0.47 % (531132)Success in time 0.05 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------