%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG072+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 : n002.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:35:56 PM UTC 2026
% Result : Theorem 0.62s 0.58s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 16 unt; 2 def)
% Number of atoms : 110 ( 3 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 124 ( 58 ~; 51 |; 10 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] :
( ( aScalar0(X0)
& aScalar0(X1) )
=> aScalar0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSumSc) ).
fof(f24,axiom,
! [X0,X1,X2,X3] :
( ( aScalar0(X0)
& aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3) )
=> ( ( sdtlseqdt0(X0,X1)
& sdtlseqdt0(sz0z00,X2)
& sdtlseqdt0(X2,X3) )
=> sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLEMonM) ).
fof(f52,axiom,
( aScalar0(xR)
& xR = sdtasdt0(xC,xG) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1892) ).
fof(f53,axiom,
( aScalar0(xP)
& xP = sdtasdt0(xE,xH) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1911) ).
fof(f54,axiom,
( aScalar0(xS)
& xS = sdtasdt0(xF,xD) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1930) ).
fof(f61,axiom,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2610) ).
fof(f62,axiom,
( sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
& sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2628) ).
fof(f63,conjecture,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f64,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f70,plain,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(flattening,[],[f64]) ).
fof(f77,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X0)
| ~ aScalar0(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f78,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X0)
| ~ aScalar0(X1) ),
inference(flattening,[],[f77]) ).
fof(f100,plain,
! [X0,X1,X2,X3] :
( sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3))
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X2,X3)
| ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(ennf_transformation,[],[f24]) ).
fof(f101,plain,
! [X0,X1,X2,X3] :
( sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3))
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X2,X3)
| ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(flattening,[],[f100]) ).
fof(f138,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X0)
| ~ aScalar0(X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f163,plain,
! [X2,X3,X0,X1] :
( sdtlseqdt0(sdtasdt0(X0,X2),sdtasdt0(X1,X3))
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(X2,X3)
| ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(cnf_transformation,[],[f101]) ).
fof(f207,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f52]) ).
fof(f209,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f53]) ).
fof(f211,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f54]) ).
fof(f219,plain,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnf_transformation,[],[f61]) ).
fof(f221,plain,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f62]) ).
fof(f222,plain,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(cnf_transformation,[],[f70]) ).
fof(f567,definition,
( spl2_12
<=> aScalar0(sdtpldt0(xR,xS)) ),
introduced(definition,[new_symbols(definition,[spl2_12])],[avatar_definition]) ).
fof(f569,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| spl2_12 ),
inference(avatar_component_clause,[],[f567]) ).
fof(f580,definition,
( spl2_15
<=> aScalar0(sdtpldt0(xP,xP)) ),
introduced(definition,[new_symbols(definition,[spl2_15])],[avatar_definition]) ).
fof(f582,plain,
( ~ aScalar0(sdtpldt0(xP,xP))
| spl2_15 ),
inference(avatar_component_clause,[],[f580]) ).
fof(f1061,plain,
( ~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))
| ~ sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
| ~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(resolution,[],[f163,f222]) ).
fof(f1092,plain,
( ~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP))
| ~ sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(duplicate_literal_removal,[],[f1061]) ).
fof(f1113,plain,
( ~ sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(forward_subsumption_resolution,[],[f1092,f219]) ).
fof(f1132,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(forward_subsumption_resolution,[],[f1113,f221]) ).
fof(f1142,plain,
( ~ spl2_15
| ~ spl2_12 ),
inference(avatar_split_clause,[],[f1132,f567,f580]) ).
fof(f1199,plain,
( ~ aScalar0(xR)
| ~ aScalar0(xS)
| spl2_12 ),
inference(resolution,[],[f569,f138]) ).
fof(f1200,plain,
( ~ aScalar0(xS)
| spl2_12 ),
inference(forward_subsumption_resolution,[],[f1199,f207]) ).
fof(f1201,plain,
( $false
| spl2_12 ),
inference(forward_subsumption_resolution,[],[f1200,f211]) ).
fof(f1202,plain,
spl2_12,
inference(avatar_contradiction_clause,[],[f1201]) ).
fof(f1231,plain,
( ~ aScalar0(xP)
| ~ aScalar0(xP)
| spl2_15 ),
inference(resolution,[],[f582,f138]) ).
fof(f1232,plain,
( ~ aScalar0(xP)
| spl2_15 ),
inference(duplicate_literal_removal,[],[f1231]) ).
fof(f1233,plain,
( $false
| spl2_15 ),
inference(forward_subsumption_resolution,[],[f1232,f209]) ).
fof(f1234,plain,
spl2_15,
inference(avatar_contradiction_clause,[],[f1233]) ).
cnf(s38,plain,
( ~ spl2_12
| ~ spl2_15 ),
inference(sat_conversion,[],[f1142]) ).
cnf(s41,plain,
spl2_12,
inference(sat_conversion,[],[f1202]) ).
cnf(s42,plain,
spl2_15,
inference(sat_conversion,[],[f1234]) ).
cnf(s43,plain,
$false,
inference(rat,[],[s38,s42,s41]) ).
fof(f1235,plain,
$false,
inference(avatar_sat_refutation,[],[s43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG072+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.44 % Computer : n002.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Sun Sep 27 23:11:22 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.50 Running first-order model finding
% 0.23/0.50 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.62/0.58 % (3997975)Will run a generic schedule for satisfiability detection.
% 0.62/0.58 % (3997980)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1981926888_2999 on theBenchmark for (2999ds/0Mi)
% 0.62/0.58 % TRYING [1]
% 0.62/0.58 % TRYING [2]
% 0.62/0.58 % (3997984)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=293736589:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.62/0.58 % TRYING [3]
% 0.62/0.58 % (3997981)% WARNING: option uhcvi not known.
% 0.62/0.58 % (3997985)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2476633866:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.62/0.58 % (3997983)dis+10_1_sil=32000:sp=arity:random_seed=2719378789:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.62/0.58 % (3997982)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=647578875:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.62/0.58 % (3997981)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1149381997:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.62/0.58 % (3997986)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3277822674:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.62/0.58 % TRYING [4]
% 0.62/0.58 % (3997983) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3997975-3997983"...
% 0.62/0.58 % (3997983)...printing done.
% 0.62/0.58 % (3997983)Refutation found. Thanks to Tanya!
% 0.62/0.58 % SZS status Theorem for theBenchmark
% 0.62/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.59 % (3997983)------------------------------
% 0.62/0.59 % (3997983)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.62/0.59 % (3997983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.62/0.59 % (3997983)CaDiCaL version: 2.1.3
% 0.62/0.59 % (3997983)Termination reason: Refutation
% 0.62/0.59 % (3997983)Time elapsed: 0.037 s
% 0.62/0.59 % (3997983)Peak memory usage: 13 MB
% 0.62/0.59 % (3997983)Instructions burned: 35 (million)
% 0.62/0.59 % (3997975)Success in time 0.078 s
% 0.62/0.59 % Vampire exiting
%------------------------------------------------------------------------------