%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM614+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 : n018.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:25:01 PM UTC 2026
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 60 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 59 ( 23 ~; 20 |; 9 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f57,axiom,
! [X0,X1] :
( ( aSet0(X0)
& aElementOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = slbdtsldtrb0(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aSubsetOf0(X3,X0)
& sbrdtbr0(X3) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSel) ).
fof(f80,axiom,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3533) ).
fof(f96,axiom,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4908) ).
fof(f108,axiom,
aSubsetOf0(xP,xO),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5208) ).
fof(f109,axiom,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5217) ).
fof(f110,conjecture,
aElementOf0(xP,slbdtsldtrb0(xO,xk)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f111,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(negated_conjecture,[status(cth)],[f110]) ).
fof(f112,plain,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(flattening,[],[f111]) ).
fof(f197,plain,
! [X0,X1] :
( ! [X2] :
( X2 = slbdtsldtrb0(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aSubsetOf0(X3,X0)
& sbrdtbr0(X3) = X1 ) ) ) )
| ~ aSet0(X0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f198,plain,
! [X0,X1] :
( ! [X2] :
( X2 = slbdtsldtrb0(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aSubsetOf0(X3,X0)
& sbrdtbr0(X3) = X1 ) ) ) )
| ~ aSet0(X0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(flattening,[],[f197]) ).
fof(f343,plain,
! [X2,X3,X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0)
| aElementOf0(X3,X2)
| slbdtsldtrb0(X0,X1) != X2 ),
inference(cnf_transformation,[],[f198]) ).
fof(f399,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f80]) ).
fof(f435,plain,
aSet0(xO),
inference(cnf_transformation,[],[f96]) ).
fof(f451,plain,
aSubsetOf0(xP,xO),
inference(cnf_transformation,[],[f108]) ).
fof(f452,plain,
xk = sbrdtbr0(xP),
inference(cnf_transformation,[],[f109]) ).
fof(f453,plain,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(cnf_transformation,[],[f112]) ).
fof(f480,plain,
! [X2,X3,X0] :
( ~ aElementOf0(sbrdtbr0(X3),szNzAzT0)
| ~ aSet0(X0)
| ~ aSubsetOf0(X3,X0)
| aElementOf0(X3,X2)
| slbdtsldtrb0(X0,sbrdtbr0(X3)) != X2 ),
inference(equality_resolution,[],[f343]) ).
fof(f481,plain,
! [X3,X0] :
( ~ aSubsetOf0(X3,X0)
| ~ aSet0(X0)
| ~ aElementOf0(sbrdtbr0(X3),szNzAzT0)
| aElementOf0(X3,slbdtsldtrb0(X0,sbrdtbr0(X3))) ),
inference(equality_resolution,[],[f480]) ).
fof(f2197,plain,
( ~ aSet0(xO)
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| aElementOf0(xP,slbdtsldtrb0(xO,sbrdtbr0(xP))) ),
inference(resolution,[],[f481,f451]) ).
fof(f2204,plain,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| aElementOf0(xP,slbdtsldtrb0(xO,sbrdtbr0(xP))) ),
inference(forward_subsumption_resolution,[],[f2197,f435]) ).
fof(f2216,plain,
( ~ aElementOf0(xk,szNzAzT0)
| aElementOf0(xP,slbdtsldtrb0(xO,sbrdtbr0(xP))) ),
inference(forward_demodulation,[],[f2204,f452]) ).
fof(f2261,plain,
aElementOf0(xP,slbdtsldtrb0(xO,sbrdtbr0(xP))),
inference(forward_subsumption_resolution,[],[f2216,f399]) ).
fof(f2264,plain,
aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(forward_demodulation,[],[f2261,f452]) ).
fof(f2267,plain,
$false,
inference(forward_subsumption_resolution,[],[f2264,f453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM614+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.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 20:47:54 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/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.19/0.50 % (2707152)Will run a generic schedule for satisfiability detection.
% 0.19/0.50 % (2707160)dis+10_1_sil=32000:sp=arity:random_seed=945022790:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.50 % (2707158)% WARNING: option uhcvi not known.
% 0.19/0.50 % (2707157)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=966515278_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.50 % (2707158)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1612490305:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.50 % (2707159)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=161869831:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.50 % (2707162)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1099451196:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.50 % (2707161)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2440858658:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.50 % (2707163)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1632522367:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.50 % TRYING [1]
% 0.19/0.50 % TRYING [2]
% 0.19/0.50 % (2707160)Instruction limit reached!
% 0.19/0.50 % (2707160)------------------------------
% 0.19/0.50 % (2707160)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.50 % (2707160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.50 % (2707160)CaDiCaL version: 2.1.3
% 0.19/0.50 % (2707160)Termination reason: Instruction limit
% 0.19/0.50 % (2707160)Termination phase: Saturation
% 0.19/0.50 % (2707160)Time elapsed: 0.039 s
% 0.19/0.50 % (2707160)Peak memory usage: 13 MB
% 0.19/0.50 % (2707160)Instructions burned: 104 (million)
% 0.19/0.50 % TRYING [3]
% 0.19/0.50 % (2707161) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2707152-2707161"...
% 0.19/0.50 % (2707161)...printing done.
% 0.19/0.50 % (2707161)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (2707161)------------------------------
% 0.19/0.50 % (2707161)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.50 % (2707161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.50 % (2707161)CaDiCaL version: 2.1.3
% 0.19/0.50 % (2707161)Termination reason: Refutation
% 0.19/0.50 % (2707161)Time elapsed: 0.046 s
% 0.19/0.50 % (2707161)Peak memory usage: 13 MB
% 0.19/0.50 % (2707161)Instructions burned: 69 (million)
% 0.19/0.50 % (2707152)Success in time 0.084 s
% 0.19/0.50 % Vampire exiting
%------------------------------------------------------------------------------