%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG125+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 : n003.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:36:08 PM UTC 2026
% Result : ContradictoryAxioms 0.15s 0.47s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 13 unt; 0 def)
% Number of atoms : 164 ( 7 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 191 ( 69 ~; 61 |; 46 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 57 ( 48 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f20,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(f24,axiom,
! [X0] :
( aIdeal0(X0)
<=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefIdeal) ).
fof(f34,axiom,
! [X0] :
( aElement0(X0)
=> ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( aElement0(X1)
& doDivides0(X1,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDvs) ).
fof(f39,axiom,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(f42,axiom,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(f45,axiom,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X0] :
( ( aElementOf0(X0,xI)
& X0 != sz00 )
=> ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(f46,axiom,
~ ( aDivisorOf0(xu,xa)
& aDivisorOf0(xu,xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2383) ).
fof(f48,axiom,
doDivides0(xu,xa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2479) ).
fof(f49,axiom,
doDivides0(xu,xb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2612) ).
fof(f55,plain,
! [X0] :
( aIdeal0(X0)
<=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X1),X0) ) ) ) ) ),
inference(rectify,[],[f24]) ).
fof(f83,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f90,plain,
! [X0] :
( aIdeal0(X0)
<=> ( aSet0(X0)
& ! [X1] :
( ( ! [X2] :
( aElementOf0(sdtpldt0(X1,X2),X0)
| ~ aElementOf0(X2,X0) )
& ! [X3] :
( aElementOf0(sdtasdt0(X3,X1),X0)
| ~ aElement0(X3) ) )
| ~ aElementOf0(X1,X0) ) ) ),
inference(ennf_transformation,[],[f55]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( aElement0(X1)
& doDivides0(X1,X0) ) )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f34]) ).
fof(f110,plain,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X0] :
( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
| ~ aElementOf0(X0,xI)
| sz00 = X0 ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f111,plain,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X0] :
( ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu))
| ~ aElementOf0(X0,xI)
| sz00 = X0 ) ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
( ~ aDivisorOf0(xu,xa)
| ~ aDivisorOf0(xu,xb) ),
inference(ennf_transformation,[],[f46]) ).
fof(f127,plain,
! [X0] :
( ( aIdeal0(X0)
| ~ aSet0(X0)
| ? [X1] :
( ( ? [X2] :
( ~ aElementOf0(sdtpldt0(X1,X2),X0)
& aElementOf0(X2,X0) )
| ? [X3] :
( ~ aElementOf0(sdtasdt0(X3,X1),X0)
& aElement0(X3) ) )
& aElementOf0(X1,X0) ) )
& ( ( aSet0(X0)
& ! [X1] :
( ( ! [X2] :
( aElementOf0(sdtpldt0(X1,X2),X0)
| ~ aElementOf0(X2,X0) )
& ! [X3] :
( aElementOf0(sdtasdt0(X3,X1),X0)
| ~ aElement0(X3) ) )
| ~ aElementOf0(X1,X0) ) )
| ~ aIdeal0(X0) ) ),
inference(nnf_transformation,[],[f90]) ).
fof(f128,plain,
! [X0] :
( ( aIdeal0(X0)
| ~ aSet0(X0)
| ? [X1] :
( ( ? [X2] :
( ~ aElementOf0(sdtpldt0(X1,X2),X0)
& aElementOf0(X2,X0) )
| ? [X3] :
( ~ aElementOf0(sdtasdt0(X3,X1),X0)
& aElement0(X3) ) )
& aElementOf0(X1,X0) ) )
& ( ( aSet0(X0)
& ! [X1] :
( ( ! [X2] :
( aElementOf0(sdtpldt0(X1,X2),X0)
| ~ aElementOf0(X2,X0) )
& ! [X3] :
( aElementOf0(sdtasdt0(X3,X1),X0)
| ~ aElement0(X3) ) )
| ~ aElementOf0(X1,X0) ) )
| ~ aIdeal0(X0) ) ),
inference(flattening,[],[f127]) ).
fof(f129,plain,
! [X0] :
( ( aIdeal0(X0)
| ~ aSet0(X0)
| ? [X1] :
( ( ? [X2] :
( ~ aElementOf0(sdtpldt0(X1,X2),X0)
& aElementOf0(X2,X0) )
| ? [X3] :
( ~ aElementOf0(sdtasdt0(X3,X1),X0)
& aElement0(X3) ) )
& aElementOf0(X1,X0) ) )
& ( ( aSet0(X0)
& ! [X4] :
( ( ! [X5] :
( aElementOf0(sdtpldt0(X4,X5),X0)
| ~ aElementOf0(X5,X0) )
& ! [X6] :
( aElementOf0(sdtasdt0(X6,X4),X0)
| ~ aElement0(X6) ) )
| ~ aElementOf0(X4,X0) ) )
| ~ aIdeal0(X0) ) ),
inference(rectify,[],[f128]) ).
fof(f130,plain,
! [X0] :
( ( aIdeal0(X0)
| ~ aSet0(X0)
| ( ( ( ~ aElementOf0(sdtpldt0(sK10(X0),sK11(X0)),X0)
& aElementOf0(sK11(X0),X0) )
| ( ~ aElementOf0(sdtasdt0(sK12(X0),sK10(X0)),X0)
& aElement0(sK12(X0)) ) )
& aElementOf0(sK10(X0),X0) ) )
& ( ( aSet0(X0)
& ! [X4] :
( ( ! [X5] :
( aElementOf0(sdtpldt0(X4,X5),X0)
| ~ aElementOf0(X5,X0) )
& ! [X6] :
( aElementOf0(sdtasdt0(X6,X4),X0)
| ~ aElement0(X6) ) )
| ~ aElementOf0(X4,X0) ) )
| ~ aIdeal0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12]),skolemize(X1,sK10(X0)),skolemize(X2,sK11(X0)),skolemize(X3,sK12(X0))],[f129]) ).
fof(f138,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aElement0(X1)
| ~ doDivides0(X1,X0) )
& ( ( aElement0(X1)
& doDivides0(X1,X0) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aElement0(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aElement0(X1)
| ~ doDivides0(X1,X0) )
& ( ( aElement0(X1)
& doDivides0(X1,X0) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aElement0(X0) ),
inference(flattening,[],[f138]) ).
fof(f174,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f200,plain,
! [X0] :
( ~ aIdeal0(X0)
| aSet0(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f225,plain,
! [X0,X1] :
( ~ doDivides0(X1,X0)
| ~ aElement0(X1)
| aDivisorOf0(X1,X0)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f242,plain,
aElement0(xb),
inference(cnf_transformation,[],[f39]) ).
fof(f243,plain,
aElement0(xa),
inference(cnf_transformation,[],[f39]) ).
fof(f247,plain,
aIdeal0(xI),
inference(cnf_transformation,[],[f42]) ).
fof(f256,plain,
aElementOf0(xu,xI),
inference(cnf_transformation,[],[f111]) ).
fof(f257,plain,
( ~ aDivisorOf0(xu,xa)
| ~ aDivisorOf0(xu,xb) ),
inference(cnf_transformation,[],[f112]) ).
fof(f261,plain,
doDivides0(xu,xa),
inference(cnf_transformation,[],[f48]) ).
fof(f262,plain,
doDivides0(xu,xb),
inference(cnf_transformation,[],[f49]) ).
fof(f299,plain,
aSet0(xI),
inference(resolution,[],[f200,f247]) ).
fof(f607,plain,
( aElement0(xu)
| ~ aSet0(xI) ),
inference(resolution,[],[f174,f256]) ).
fof(f614,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[],[f607,f299]) ).
fof(f894,plain,
( ~ aElement0(xu)
| aDivisorOf0(xu,xa)
| ~ aElement0(xa) ),
inference(resolution,[],[f225,f261]) ).
fof(f895,plain,
( ~ aElement0(xu)
| aDivisorOf0(xu,xb)
| ~ aElement0(xb) ),
inference(resolution,[],[f225,f262]) ).
fof(f896,plain,
( aDivisorOf0(xu,xb)
| ~ aElement0(xb) ),
inference(forward_subsumption_resolution,[],[f895,f614]) ).
fof(f897,plain,
( aDivisorOf0(xu,xa)
| ~ aElement0(xa) ),
inference(forward_subsumption_resolution,[],[f894,f614]) ).
fof(f899,plain,
aDivisorOf0(xu,xa),
inference(forward_subsumption_resolution,[],[f897,f243]) ).
fof(f906,plain,
aDivisorOf0(xu,xb),
inference(forward_subsumption_resolution,[],[f896,f242]) ).
fof(f907,plain,
$false,
inference(global_subsumption,[],[f906,f899,f257]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG125+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.39 % Computer : n003.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 23:24:42 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.15/0.47 % (1043235)Will run a generic schedule for satisfiability detection.
% 0.15/0.47 % (1043242)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2210821933:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.47 % (1043241)% WARNING: option uhcvi not known.
% 0.15/0.47 % (1043241)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3126581223:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.47 % (1043243)dis+10_1_sil=32000:sp=arity:random_seed=10244207:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.47 % (1043244)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3911864513:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.47 % (1043245)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1735992815:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.47 % (1043242) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1043235-1043242"...
% 0.15/0.47 % (1043242)...printing done.
% 0.15/0.47 % (1043242)Refutation found. Thanks to Tanya!
% 0.15/0.47 % SZS status ContradictoryAxioms for theBenchmark
% 0.15/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47 % (1043242)------------------------------
% 0.15/0.47 % (1043242)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.47 % (1043242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.47 % (1043242)CaDiCaL version: 2.1.3
% 0.15/0.47 % (1043242)Termination reason: Refutation
% 0.15/0.47 % (1043242)Time elapsed: 0.011 s
% 0.15/0.47 % (1043242)Peak memory usage: 12 MB
% 0.15/0.47 % (1043242)Instructions burned: 27 (million)
% 0.15/0.47 % (1043235)Success in time 0.038 s
% 0.15/0.47 % Vampire exiting
%------------------------------------------------------------------------------