%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM489+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 : n026.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:31 PM UTC 2026
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 16 unt; 0 def)
% Number of atoms : 55 ( 20 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 49 ( 19 ~; 19 |; 6 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X0,X1)
=> ! [X2] :
( X2 = sdtmndt0(X1,X0)
<=> ( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
fof(f39,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(f42,axiom,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1870) ).
fof(f43,axiom,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1883) ).
fof(f45,conjecture,
xn = sdtpldt0(xp,xr),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f46,negated_conjecture,
xn != sdtpldt0(xp,xr),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
xn != sdtpldt0(xp,xr),
inference(flattening,[],[f46]) ).
fof(f76,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtmndt0(X1,X0)
<=> ( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f77,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtmndt0(X1,X0)
<=> ( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) )
| ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f76]) ).
fof(f144,plain,
! [X2,X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ sdtlseqdt0(X0,X1)
| sdtpldt0(X0,X2) = X1
| sdtmndt0(X1,X0) != X2 ),
inference(cnf_transformation,[],[f77]) ).
fof(f184,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f186,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f190,plain,
sdtlseqdt0(xp,xn),
inference(cnf_transformation,[],[f42]) ).
fof(f191,plain,
xr = sdtmndt0(xn,xp),
inference(cnf_transformation,[],[f43]) ).
fof(f194,plain,
xn != sdtpldt0(xp,xr),
inference(cnf_transformation,[],[f47]) ).
fof(f198,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ sdtlseqdt0(X0,X1)
| sdtpldt0(X0,sdtmndt0(X1,X0)) = X1 ),
inference(equality_resolution,[],[f144]) ).
fof(f234,plain,
! [X0,X1] :
( sdtlseqdt0(X0,X1)
| aNaturalNumber0(X0)
| aNaturalNumber0(X1)
| sdtpldt0(X0,sdtmndt0(X1,X0)) = X1 ),
inference(consistent_polarity_flipping,[],[f198]) ).
fof(f272,plain,
~ aNaturalNumber0(xn),
inference(consistent_polarity_flipping,[],[f186]) ).
fof(f274,plain,
~ aNaturalNumber0(xp),
inference(consistent_polarity_flipping,[],[f184]) ).
fof(f278,plain,
~ sdtlseqdt0(xp,xn),
inference(consistent_polarity_flipping,[],[f190]) ).
fof(f545,plain,
( aNaturalNumber0(xp)
| aNaturalNumber0(xn)
| xn = sdtpldt0(xp,sdtmndt0(xn,xp)) ),
inference(resolution,[],[f234,f278]) ).
fof(f555,plain,
( aNaturalNumber0(xn)
| xn = sdtpldt0(xp,sdtmndt0(xn,xp)) ),
inference(forward_subsumption_resolution,[],[f545,f274]) ).
fof(f561,plain,
xn = sdtpldt0(xp,sdtmndt0(xn,xp)),
inference(forward_subsumption_resolution,[],[f555,f272]) ).
fof(f562,plain,
xn = sdtpldt0(xp,xr),
inference(forward_demodulation,[],[f561,f191]) ).
fof(f563,plain,
$false,
inference(forward_subsumption_resolution,[],[f562,f194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM489+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.40 % Computer : n026.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sun Sep 27 20:12:42 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.43 Running first-order model finding
% 0.14/0.43 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.18/0.48 % (3178109)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (3178116)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3056879786:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48 % (3178115)% WARNING: option uhcvi not known.
% 0.18/0.48 % (3178115)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2296527032:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48 % (3178114)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=874367343_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48 % (3178117)dis+10_1_sil=32000:sp=arity:random_seed=1511198393:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48 % (3178118)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4104920736:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48 % (3178119)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3291248235:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48 % (3178120)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=663509783:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.48 % TRYING [1]
% 0.18/0.48 % TRYING [2]
% 0.18/0.48 % TRYING [3]
% 0.18/0.48 % (3178115) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3178109-3178115"...
% 0.18/0.48 % (3178115)...printing done.
% 0.18/0.48 % (3178115)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (3178115)------------------------------
% 0.18/0.49 % (3178115)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49 % (3178115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49 % (3178115)CaDiCaL version: 2.1.3
% 0.18/0.49 % (3178115)Termination reason: Refutation
% 0.18/0.49 % (3178115)Time elapsed: 0.009 s
% 0.18/0.49 % (3178115)Peak memory usage: 12 MB
% 0.18/0.49 % (3178115)Instructions burned: 13 (million)
% 0.18/0.49 % (3178109)Success in time 0.042 s
% 0.18/0.49 % Vampire exiting
%------------------------------------------------------------------------------