%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM472+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 : n012.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:26 PM UTC 2026
% Result : Theorem 0.09s 0.36s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 76 ( 10 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 93 ( 40 ~; 35 |; 13 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 30 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(f18,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X0,X1)
<=> ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).
fof(f34,axiom,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324) ).
fof(f39,conjecture,
sdtlseqdt0(xm,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f40,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(negated_conjecture,[status(cth)],[f39]) ).
fof(f43,plain,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(flattening,[],[f40]) ).
fof(f45,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f46,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f45]) ).
fof(f70,plain,
! [X0,X1] :
( ( sdtlseqdt0(X0,X1)
<=> ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f71,plain,
! [X0,X1] :
( ( sdtlseqdt0(X0,X1)
<=> ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(flattening,[],[f70]) ).
fof(f97,plain,
! [X0,X1] :
( ( ( sdtlseqdt0(X0,X1)
| ! [X2] :
( ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1 ) )
& ( ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
| ~ sdtlseqdt0(X0,X1) ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(nnf_transformation,[],[f71]) ).
fof(f98,plain,
! [X0,X1] :
( ( ( sdtlseqdt0(X0,X1)
| ! [X2] :
( ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1 ) )
& ( ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X0,X3) = X1 )
| ~ sdtlseqdt0(X0,X1) ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(rectify,[],[f97]) ).
fof(f99,plain,
! [X0,X1] :
( ( ( sdtlseqdt0(X0,X1)
| ! [X2] :
( ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1 ) )
& ( ( aNaturalNumber0(sK0(X0,X1))
& sdtpldt0(X0,sK0(X0,X1)) = X1 )
| ~ sdtlseqdt0(X0,X1) ) )
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f98]) ).
fof(f110,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f133,plain,
! [X2,X0,X1] :
( sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f99]) ).
fof(f161,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f34]) ).
fof(f162,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f34]) ).
fof(f169,plain,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(cnf_transformation,[],[f43]) ).
fof(f170,plain,
! [X2,X0] :
( sdtlseqdt0(X0,sdtpldt0(X0,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sdtpldt0(X0,X2)) ),
inference(equality_resolution,[],[f133]) ).
fof(f357,plain,
! [X2,X0] :
( sdtlseqdt0(X0,sdtpldt0(X0,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X0) ),
inference(forward_subsumption_resolution,[],[f170,f110]) ).
fof(f358,plain,
( ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm) ),
inference(resolution,[],[f357,f169]) ).
fof(f371,plain,
~ aNaturalNumber0(xm),
inference(forward_subsumption_resolution,[],[f358,f161]) ).
fof(f375,plain,
$false,
inference(forward_subsumption_resolution,[],[f371,f162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM472+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Sun Sep 27 20:04:19 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.33 Running first-order model finding
% 0.09/0.33 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.09/0.36 % (2699127)Will run a generic schedule for satisfiability detection.
% 0.09/0.36 % (2699133)% WARNING: option uhcvi not known.
% 0.09/0.36 % (2699133)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2965273016:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.36 % (2699135)dis+10_1_sil=32000:sp=arity:random_seed=633204331:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.36 % (2699134)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3652584699:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.36 % (2699132)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4177296317_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.36 % (2699136)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3054364088:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.36 % (2699137)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=841361333:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.36 % (2699138)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2327948075:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.36 % TRYING [1]
% 0.09/0.36 % TRYING [2]
% 0.09/0.36 % TRYING [3]
% 0.09/0.36 % (2699135) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2699127-2699135"...
% 0.09/0.36 % (2699135)...printing done.
% 0.09/0.36 % (2699135)Refutation found. Thanks to Tanya!
% 0.09/0.36 % SZS status Theorem for theBenchmark
% 0.09/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.36 % (2699135)------------------------------
% 0.09/0.36 % (2699135)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.36 % (2699135)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.36 % (2699135)CaDiCaL version: 2.1.3
% 0.09/0.36 % (2699135)Termination reason: Refutation
% 0.09/0.36 % (2699135)Time elapsed: 0.004 s
% 0.09/0.36 % (2699135)Peak memory usage: 12 MB
% 0.09/0.36 % (2699135)Instructions burned: 9 (million)
% 0.09/0.36 % (2699127)Success in time 0.03 s
% 0.09/0.36 % Vampire exiting
%------------------------------------------------------------------------------