%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG072+2 : 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.24s 0.58s
% Output : Refutation 0.24s
% 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(f140,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X0)
| ~ aScalar0(X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f165,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(f213,plain,
aScalar0(xR),
inference(cnf_transformation,[],[f52]) ).
fof(f215,plain,
aScalar0(xP),
inference(cnf_transformation,[],[f53]) ).
fof(f217,plain,
aScalar0(xS),
inference(cnf_transformation,[],[f54]) ).
fof(f225,plain,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnf_transformation,[],[f61]) ).
fof(f227,plain,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(cnf_transformation,[],[f62]) ).
fof(f228,plain,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(cnf_transformation,[],[f70]) ).
fof(f660,definition,
( spl2_20
<=> aScalar0(sdtpldt0(xR,xS)) ),
introduced(definition,[new_symbols(definition,[spl2_20])],[avatar_definition]) ).
fof(f662,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| spl2_20 ),
inference(avatar_component_clause,[],[f660]) ).
fof(f673,definition,
( spl2_23
<=> aScalar0(sdtpldt0(xP,xP)) ),
introduced(definition,[new_symbols(definition,[spl2_23])],[avatar_definition]) ).
fof(f675,plain,
( ~ aScalar0(sdtpldt0(xP,xP))
| spl2_23 ),
inference(avatar_component_clause,[],[f673]) ).
fof(f1158,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,[],[f165,f228]) ).
fof(f1185,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,[],[f1158]) ).
fof(f1202,plain,
( ~ sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(forward_subsumption_resolution,[],[f1185,f225]) ).
fof(f1217,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(forward_subsumption_resolution,[],[f1202,f227]) ).
fof(f1222,plain,
( ~ spl2_23
| ~ spl2_20 ),
inference(avatar_split_clause,[],[f1217,f660,f673]) ).
fof(f1273,plain,
( ~ aScalar0(xR)
| ~ aScalar0(xS)
| spl2_20 ),
inference(resolution,[],[f662,f140]) ).
fof(f1274,plain,
( ~ aScalar0(xS)
| spl2_20 ),
inference(forward_subsumption_resolution,[],[f1273,f213]) ).
fof(f1275,plain,
( $false
| spl2_20 ),
inference(forward_subsumption_resolution,[],[f1274,f217]) ).
fof(f1276,plain,
spl2_20,
inference(avatar_contradiction_clause,[],[f1275]) ).
fof(f1327,plain,
( ~ aScalar0(xP)
| ~ aScalar0(xP)
| spl2_23 ),
inference(resolution,[],[f675,f140]) ).
fof(f1328,plain,
( ~ aScalar0(xP)
| spl2_23 ),
inference(duplicate_literal_removal,[],[f1327]) ).
fof(f1329,plain,
( $false
| spl2_23 ),
inference(forward_subsumption_resolution,[],[f1328,f215]) ).
fof(f1330,plain,
spl2_23,
inference(avatar_contradiction_clause,[],[f1329]) ).
cnf(s40,plain,
( ~ spl2_20
| ~ spl2_23 ),
inference(sat_conversion,[],[f1222]) ).
cnf(s43,plain,
spl2_20,
inference(sat_conversion,[],[f1276]) ).
cnf(s44,plain,
spl2_23,
inference(sat_conversion,[],[f1330]) ).
cnf(s45,plain,
$false,
inference(rat,[],[s40,s44,s43]) ).
fof(f1331,plain,
$false,
inference(avatar_sat_refutation,[],[s45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG072+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.17/0.44 % Computer : n002.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Sun Sep 27 23:11:07 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.24/0.58 % (3997568)Will run a generic schedule for satisfiability detection.
% 0.24/0.58 % (3997578)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4073737106:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.24/0.58 % (3997574)% WARNING: option uhcvi not known.
% 0.24/0.58 % (3997576)dis+10_1_sil=32000:sp=arity:random_seed=3525641490:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.24/0.58 % (3997577)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3760068593:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.24/0.58 % (3997574)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=339579371:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.24/0.58 % (3997573)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3792177542_2999 on theBenchmark for (2999ds/0Mi)
% 0.24/0.58 % (3997579)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3966471901:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.24/0.58 % (3997575)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1909410745:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.24/0.58 % TRYING [1]
% 0.24/0.58 % TRYING [2]
% 0.24/0.58 % TRYING [3]
% 0.24/0.58 % (3997576) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3997568-3997576"...
% 0.24/0.58 % (3997576)...printing done.
% 0.24/0.58 % (3997576)Refutation found. Thanks to Tanya!
% 0.24/0.58 % SZS status Theorem for theBenchmark
% 0.24/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.58 % (3997576)------------------------------
% 0.24/0.58 % (3997576)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.58 % (3997576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.58 % (3997576)CaDiCaL version: 2.1.3
% 0.24/0.58 % (3997576)Termination reason: Refutation
% 0.24/0.58 % (3997576)Time elapsed: 0.038 s
% 0.24/0.58 % (3997576)Peak memory usage: 13 MB
% 0.24/0.58 % (3997576)Instructions burned: 38 (million)
% 0.24/0.58 % (3997568)Success in time 0.081 s
% 0.24/0.58 % Vampire exiting
%------------------------------------------------------------------------------