%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : RNG044+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:16 PM UTC 2026
% Result : Theorem 2.67s 1.33s
% Output : Refutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 15 unt; 1 def)
% Number of atoms : 83 ( 12 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 94 ( 46 ~; 37 |; 9 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] :
( ( aScalar0(X0)
& aScalar0(X1) )
=> aScalar0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSumSc) ).
fof(f15,axiom,
! [X0,X1,X2] :
( ( aScalar0(X0)
& aScalar0(X1)
& aScalar0(X2) )
=> ( sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2))
& sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDistr) ).
fof(f16,axiom,
( aScalar0(xx)
& aScalar0(xy)
& aScalar0(xu)
& aScalar0(xv) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__674) ).
fof(f17,conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f18,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(flattening,[],[f18]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2))
& sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2)) )
| ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2))
& sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2)) )
| ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(flattening,[],[f21]) ).
fof(f25,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X0)
| ~ aScalar0(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f26,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X0)
| ~ aScalar0(X1) ),
inference(flattening,[],[f25]) ).
fof(f29,plain,
aScalar0(xv),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
aScalar0(xu),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
aScalar0(xy),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
aScalar0(xx),
inference(cnf_transformation,[],[f16]) ).
fof(f33,plain,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
! [X2,X0,X1] :
( sdtasdt0(sdtpldt0(X0,X1),X2) = sdtpldt0(sdtasdt0(X0,X2),sdtasdt0(X1,X2))
| ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f35,plain,
! [X2,X0,X1] :
( sdtasdt0(X0,sdtpldt0(X1,X2)) = sdtpldt0(sdtasdt0(X0,X1),sdtasdt0(X0,X2))
| ~ aScalar0(X0)
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f40,plain,
! [X0,X1] :
( aScalar0(sdtpldt0(X0,X1))
| ~ aScalar0(X0)
| ~ aScalar0(X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f42,definition,
~ sP0(sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))),
introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).
fof(f43,plain,
sP0(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)))),
inference(inequality_splitting,[],[f33,f42]) ).
fof(f49,plain,
( sP0(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))))
| ~ aScalar0(xy)
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(superposition,[],[f43,f35]) ).
fof(f68,plain,
( sP0(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))))
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(forward_subsumption_resolution,[],[f49,f31]) ).
fof(f70,plain,
( sP0(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))))
| ~ aScalar0(xv) ),
inference(forward_subsumption_resolution,[],[f68,f30]) ).
fof(f72,plain,
sP0(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))),
inference(forward_subsumption_resolution,[],[f70,f29]) ).
fof(f128,plain,
( sP0(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))))
| ~ aScalar0(xx)
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(superposition,[],[f72,f35]) ).
fof(f135,plain,
( sP0(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))))
| ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(forward_subsumption_resolution,[],[f128,f32]) ).
fof(f139,plain,
( sP0(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))))
| ~ aScalar0(xv) ),
inference(forward_subsumption_resolution,[],[f135,f30]) ).
fof(f151,plain,
sP0(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))),
inference(forward_subsumption_resolution,[],[f139,f29]) ).
fof(f170,plain,
( sP0(sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)))
| ~ aScalar0(xx)
| ~ aScalar0(xy)
| ~ aScalar0(sdtpldt0(xu,xv)) ),
inference(superposition,[],[f151,f34]) ).
fof(f171,plain,
( ~ aScalar0(xx)
| ~ aScalar0(xy)
| ~ aScalar0(sdtpldt0(xu,xv)) ),
inference(forward_subsumption_resolution,[],[f170,f42]) ).
fof(f172,plain,
( ~ aScalar0(xy)
| ~ aScalar0(sdtpldt0(xu,xv)) ),
inference(forward_subsumption_resolution,[],[f171,f32]) ).
fof(f173,plain,
~ aScalar0(sdtpldt0(xu,xv)),
inference(forward_subsumption_resolution,[],[f172,f31]) ).
fof(f174,plain,
( ~ aScalar0(xu)
| ~ aScalar0(xv) ),
inference(resolution,[],[f173,f40]) ).
fof(f175,plain,
~ aScalar0(xv),
inference(forward_subsumption_resolution,[],[f174,f30]) ).
fof(f176,plain,
$false,
inference(forward_subsumption_resolution,[],[f175,f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG044+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 23:03:19 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.67/1.33 % (3871722)Detected formulas, will run a generic FOF schedule.
% 2.67/1.33 % (3871730)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2656776306:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.67/1.33 % (3871730)First to succeed.
% 2.67/1.33 % (3871730)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3871722"
% 2.67/1.33 % (3871727)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=841884493:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.67/1.33 % (3871728)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2893064170:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.67/1.33 % (3871729)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3885459683:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.67/1.33 % (3871731)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2514751990:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.67/1.33 % (3871733)dis-21_1_sil=8000:lcm=predicate:random_seed=2339578994:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.67/1.33 % (3871732)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3073775672:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.67/1.33 % (3871733)Refutation not found, incomplete strategy
% 2.67/1.33 % (3871733)------------------------------
% 2.67/1.33 % (3871733)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.33 % (3871733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.33 % (3871733)CaDiCaL version: 2.1.3
% 2.67/1.33 % (3871733)Termination reason: Refutation not found, incomplete strategy
% 2.67/1.33 % (3871733)Time elapsed: 0.002 s
% 2.67/1.33 % (3871733)Peak memory usage: 88 MB
% 2.67/1.33 % (3871733)Instructions burned: 2 (million)
% 2.67/1.33 % (3871731)Also succeeded, but the first one will report.
% 2.67/1.33 % (3871732)Instruction limit reached!
% 2.67/1.33 % (3871732)------------------------------
% 2.67/1.33 % (3871732)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.33 % (3871732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.33 % (3871732)CaDiCaL version: 2.1.3
% 2.67/1.33 % (3871732)Termination reason: Instruction limit
% 2.67/1.33 % (3871732)Termination phase: Saturation
% 2.67/1.33 % (3871732)Time elapsed: 0.082 s
% 2.67/1.33 % (3871732)Peak memory usage: 90 MB
% 2.67/1.33 % (3871732)Instructions burned: 141 (million)
% 2.67/1.33 % (3871730)Refutation found. Thanks to Tanya!
% 2.67/1.33 % SZS status Theorem for theBenchmark
% 2.67/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 2.67/1.33 % (3871730)------------------------------
% 2.67/1.33 % (3871730)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.33 % (3871730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.33 % (3871730)CaDiCaL version: 2.1.3
% 2.67/1.33 % (3871730)Termination reason: Refutation
% 2.67/1.33 % (3871730)Time elapsed: 0.003 s
% 2.67/1.33 % (3871730)Peak memory usage: 89 MB
% 2.67/1.33 % (3871730)Instructions burned: 5 (million)
% 2.67/1.33 % (3871730)------------------------------
% 2.67/1.33 % (3871730)------------------------------
% 2.67/1.33 % (3871722)Success in time 0.292 s
% 2.67/1.33 % Vampire exiting
%------------------------------------------------------------------------------