%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM436+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:15:10 PM UTC 2026
% Result : Theorem 2.90s 1.33s
% Output : Refutation 4.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 88 ( 19 unt; 6 def)
% Number of atoms : 273 ( 51 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 309 ( 124 ~; 135 |; 36 &)
% ( 11 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 46 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( ( aInteger0(X0)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntMult) ).
fof(f18,axiom,
! [X0] :
( aInteger0(X0)
=> ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivisor) ).
fof(f19,axiom,
! [X0,X1,X2] :
( ( aInteger0(X0)
& aInteger0(X1)
& aInteger0(X2)
& X2 != sz00 )
=> ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEquMod) ).
fof(f23,axiom,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& xp != sz00
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__979) ).
fof(f25,axiom,
( aInteger0(xm)
& sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1032) ).
fof(f26,axiom,
( sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1071) ).
fof(f27,conjecture,
( sdteqdtlpzmzozddtrp0(xa,xb,xp)
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f33,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f34,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(flattening,[],[f33]) ).
fof(f52,plain,
! [X0] :
( ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = X0 ) ) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sz00 = X2 ),
inference(ennf_transformation,[],[f19]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sz00 = X2 ),
inference(flattening,[],[f53]) ).
fof(f61,plain,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(ennf_transformation,[],[f28]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ! [X2] :
( ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0 ) )
& ( ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = X0 ) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(nnf_transformation,[],[f52]) ).
fof(f63,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ! [X2] :
( ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0 ) )
& ( ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = X0 ) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(flattening,[],[f62]) ).
fof(f64,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ! [X2] :
( ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0 ) )
& ( ( aInteger0(X1)
& X1 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X1,X3) = X0 ) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(rectify,[],[f63]) ).
fof(f65,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ! [X2] :
( ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0 ) )
& ( ( aInteger0(X1)
& X1 != sz00
& aInteger0(sK0(X0,X1))
& sdtasdt0(X1,sK0(X0,X1)) = X0 )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f64]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
& ( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2) ) )
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sz00 = X2 ),
inference(nnf_transformation,[],[f54]) ).
fof(f71,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f93,plain,
! [X2,X0,X1] :
( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f95,plain,
! [X2,X0,X1] :
( ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sz00 = X2 ),
inference(cnf_transformation,[],[f66]) ).
fof(f99,plain,
sz00 != xq,
inference(cnf_transformation,[],[f23]) ).
fof(f100,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f23]) ).
fof(f101,plain,
sz00 != xp,
inference(cnf_transformation,[],[f23]) ).
fof(f102,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f23]) ).
fof(f103,plain,
aInteger0(xb),
inference(cnf_transformation,[],[f23]) ).
fof(f104,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f23]) ).
fof(f107,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f108,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(cnf_transformation,[],[f26]) ).
fof(f109,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cnf_transformation,[],[f26]) ).
fof(f110,plain,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(cnf_transformation,[],[f61]) ).
fof(f111,plain,
! [X2,X1] :
( aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X1)
| sz00 = X1
| ~ aInteger0(X2)
| ~ aInteger0(sdtasdt0(X1,X2)) ),
inference(equality_resolution,[],[f93]) ).
fof(f114,definition,
( spl1_1
<=> sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f118,definition,
( spl1_2
<=> sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f120,plain,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| spl1_2 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f121,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f110,f118,f114]) ).
fof(f199,definition,
( spl1_3
<=> aInteger0(sdtasdt0(xp,xm)) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f201,plain,
( ~ aInteger0(sdtasdt0(xp,xm))
| spl1_3 ),
inference(avatar_component_clause,[],[f199]) ).
fof(f208,definition,
( spl1_5
<=> aInteger0(sdtasdt0(xq,xm)) ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f210,plain,
( ~ aInteger0(sdtasdt0(xq,xm))
| spl1_5 ),
inference(avatar_component_clause,[],[f208]) ).
fof(f474,plain,
! [X2,X1] :
( aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X1)
| sz00 = X1
| ~ aInteger0(X2) ),
inference(forward_subsumption_resolution,[],[f111,f71]) ).
fof(f499,plain,
( aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(xp)
| sz00 = xp
| ~ aInteger0(sdtasdt0(xq,xm)) ),
inference(superposition,[],[f474,f109]) ).
fof(f500,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(xq)
| sz00 = xq
| ~ aInteger0(sdtasdt0(xp,xm)) ),
inference(superposition,[],[f474,f108]) ).
fof(f506,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sz00 = xq
| ~ aInteger0(sdtasdt0(xp,xm)) ),
inference(forward_subsumption_resolution,[],[f500,f100]) ).
fof(f507,plain,
( aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sz00 = xp
| ~ aInteger0(sdtasdt0(xq,xm)) ),
inference(forward_subsumption_resolution,[],[f499,f102]) ).
fof(f521,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sdtasdt0(xp,xm)) ),
inference(forward_subsumption_resolution,[],[f506,f99]) ).
fof(f522,plain,
( aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sdtasdt0(xq,xm)) ),
inference(forward_subsumption_resolution,[],[f507,f101]) ).
fof(f538,definition,
( spl1_24
<=> aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
introduced(definition,[new_symbols(definition,[spl1_24])],[avatar_definition]) ).
fof(f540,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ spl1_24 ),
inference(avatar_component_clause,[],[f538]) ).
fof(f541,plain,
( ~ spl1_3
| spl1_24 ),
inference(avatar_split_clause,[],[f521,f538,f199]) ).
fof(f543,definition,
( spl1_25
<=> aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))) ),
introduced(definition,[new_symbols(definition,[spl1_25])],[avatar_definition]) ).
fof(f545,plain,
( aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ spl1_25 ),
inference(avatar_component_clause,[],[f543]) ).
fof(f546,plain,
( ~ spl1_5
| spl1_25 ),
inference(avatar_split_clause,[],[f522,f543,f208]) ).
fof(f766,plain,
( ~ aInteger0(xp)
| ~ aInteger0(xm)
| spl1_3 ),
inference(resolution,[],[f201,f71]) ).
fof(f768,plain,
( ~ aInteger0(xm)
| spl1_3 ),
inference(forward_subsumption_resolution,[],[f766,f102]) ).
fof(f769,plain,
( $false
| spl1_3 ),
inference(forward_subsumption_resolution,[],[f768,f107]) ).
fof(f770,plain,
spl1_3,
inference(avatar_contradiction_clause,[],[f769]) ).
fof(f794,plain,
( ~ aInteger0(xq)
| ~ aInteger0(xm)
| spl1_5 ),
inference(resolution,[],[f210,f71]) ).
fof(f796,plain,
( ~ aInteger0(xm)
| spl1_5 ),
inference(forward_subsumption_resolution,[],[f794,f100]) ).
fof(f797,plain,
( $false
| spl1_5 ),
inference(forward_subsumption_resolution,[],[f796,f107]) ).
fof(f798,plain,
spl1_5,
inference(avatar_contradiction_clause,[],[f797]) ).
fof(f1012,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ aInteger0(xa)
| ~ aInteger0(xb)
| ~ aInteger0(xq)
| sz00 = xq
| ~ spl1_24 ),
inference(resolution,[],[f540,f95]) ).
fof(f1021,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ aInteger0(xb)
| ~ aInteger0(xq)
| sz00 = xq
| ~ spl1_24 ),
inference(forward_subsumption_resolution,[],[f1012,f104]) ).
fof(f1022,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ aInteger0(xq)
| sz00 = xq
| ~ spl1_24 ),
inference(forward_subsumption_resolution,[],[f1021,f103]) ).
fof(f1023,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| sz00 = xq
| ~ spl1_24 ),
inference(forward_subsumption_resolution,[],[f1022,f100]) ).
fof(f1024,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ spl1_24 ),
inference(forward_subsumption_resolution,[],[f1023,f99]) ).
fof(f1025,plain,
( spl1_1
| ~ spl1_24 ),
inference(avatar_split_clause,[],[f1024,f538,f114]) ).
fof(f1105,plain,
( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aInteger0(xa)
| ~ aInteger0(xb)
| ~ aInteger0(xp)
| sz00 = xp
| ~ spl1_25 ),
inference(resolution,[],[f545,f95]) ).
fof(f1108,plain,
( ~ aInteger0(xa)
| ~ aInteger0(xb)
| ~ aInteger0(xp)
| sz00 = xp
| spl1_2
| ~ spl1_25 ),
inference(forward_subsumption_resolution,[],[f1105,f120]) ).
fof(f1109,plain,
( ~ aInteger0(xb)
| ~ aInteger0(xp)
| sz00 = xp
| spl1_2
| ~ spl1_25 ),
inference(forward_subsumption_resolution,[],[f1108,f104]) ).
fof(f1110,plain,
( ~ aInteger0(xp)
| sz00 = xp
| spl1_2
| ~ spl1_25 ),
inference(forward_subsumption_resolution,[],[f1109,f103]) ).
fof(f1111,plain,
( sz00 = xp
| spl1_2
| ~ spl1_25 ),
inference(forward_subsumption_resolution,[],[f1110,f102]) ).
fof(f1112,plain,
( $false
| spl1_2
| ~ spl1_25 ),
inference(forward_subsumption_resolution,[],[f1111,f101]) ).
fof(f1113,plain,
( spl1_2
| ~ spl1_25 ),
inference(avatar_contradiction_clause,[],[f1112]) ).
cnf(s1,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(sat_conversion,[],[f121]) ).
cnf(s31,plain,
( ~ spl1_3
| spl1_24 ),
inference(sat_conversion,[],[f541]) ).
cnf(s32,plain,
( ~ spl1_5
| spl1_25 ),
inference(sat_conversion,[],[f546]) ).
cnf(s35,plain,
spl1_3,
inference(sat_conversion,[],[f770]) ).
cnf(s36,plain,
spl1_5,
inference(sat_conversion,[],[f798]) ).
cnf(s40,plain,
( spl1_1
| ~ spl1_24 ),
inference(sat_conversion,[],[f1025]) ).
cnf(s41,plain,
( spl1_2
| ~ spl1_25 ),
inference(sat_conversion,[],[f1113]) ).
cnf(s42,plain,
spl1_25,
inference(rat,[],[s32,s36]) ).
cnf(s43,plain,
spl1_2,
inference(rat,[],[s41,s42]) ).
cnf(s44,plain,
spl1_24,
inference(rat,[],[s31,s35]) ).
cnf(s45,plain,
spl1_1,
inference(rat,[],[s40,s44]) ).
cnf(s56,plain,
$false,
inference(rat,[],[s1,s43,s45]) ).
fof(f1114,plain,
$false,
inference(avatar_sat_refutation,[],[s56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM436+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 19:54:54 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.90/1.33 % (1561084)Detected formulas, will run a generic FOF schedule.
% 2.90/1.33 % (1561093)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2482924009:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.90/1.33 % (1561090)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=813350309:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.90/1.33 % (1561092)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3744499435:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.90/1.33 % (1561089)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=3958689570:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.90/1.33 % (1561091)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=290043130:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.90/1.33 % (1561095)dis-21_1_sil=8000:lcm=predicate:random_seed=1466327880: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.90/1.33 % (1561093)Instruction limit reached!
% 2.90/1.33 % (1561093)------------------------------
% 2.90/1.33 % (1561093)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.33 % (1561093)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.33 % (1561093)CaDiCaL version: 2.1.3
% 2.90/1.33 % (1561093)Termination reason: Instruction limit
% 2.90/1.33 % (1561093)Termination phase: Saturation
% 2.90/1.33 % (1561093)Time elapsed: 0.036 s
% 2.90/1.33 % (1561093)Peak memory usage: 88 MB
% 2.90/1.33 % (1561093)Instructions burned: 121 (million)
% 2.90/1.33 % (1561094)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=690799034:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.90/1.33 % (1561094)First to succeed.
% 2.90/1.33 % (1561094)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1561084"
% 2.90/1.33 % (1561092)Instruction limit reached!
% 2.90/1.33 % (1561092)------------------------------
% 2.90/1.33 % (1561092)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.33 % (1561092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.33 % (1561092)CaDiCaL version: 2.1.3
% 2.90/1.33 % (1561092)Termination reason: Instruction limit
% 2.90/1.33 % (1561092)Termination phase: Saturation
% 2.90/1.33 % (1561092)Time elapsed: 0.063 s
% 2.90/1.33 % (1561092)Peak memory usage: 89 MB
% 2.90/1.33 % (1561092)Instructions burned: 110 (million)
% 2.90/1.33 % (1561095)Instruction limit reached!
% 2.90/1.33 % (1561095)------------------------------
% 2.90/1.33 % (1561095)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.33 % (1561095)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.33 % (1561095)CaDiCaL version: 2.1.3
% 2.90/1.33 % (1561095)Termination reason: Instruction limit
% 2.90/1.33 % (1561095)Termination phase: Saturation
% 2.90/1.33 % (1561095)Time elapsed: 0.068 s
% 2.90/1.33 % (1561095)Peak memory usage: 89 MB
% 2.90/1.33 % (1561095)Instructions burned: 129 (million)
% 2.90/1.33 % (1561102)lrs+10_1_sil=8000:sp=occurrence:random_seed=4063331445:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.90/1.33 % (1561102)Also succeeded, but the first one will report.
% 2.90/1.33 % (1561105)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1189150347:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.90/1.33 % (1561104)lrs+10_1_sil=32000:urr=on:br=off:random_seed=208773777:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.90/1.33 % (1561104)Refutation not found, incomplete strategy
% 2.90/1.33 % (1561104)------------------------------
% 2.90/1.33 % (1561104)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.90/1.33 % (1561104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/1.33 % (1561104)CaDiCaL version: 2.1.3
% 2.90/1.33 % (1561104)Termination reason: Refutation not found, incomplete strategy
% 2.90/1.33 % (1561104)Time elapsed: 0.004 s
% 2.90/1.33 % (1561104)Peak memory usage: 88 MB
% 2.90/1.33 % (1561104)Instructions burned: 5 (million)
% 2.90/1.33 % (1561105)Also succeeded, but the first one will report.
% 2.90/1.33 % (1561094)Refutation found. Thanks to Tanya!
% 2.90/1.33 % SZS status Theorem for theBenchmark
% 2.90/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 4.01/1.53 % (1561094)------------------------------
% 4.01/1.53 % (1561094)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.01/1.53 % (1561094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.01/1.53 % (1561094)CaDiCaL version: 2.1.3
% 4.01/1.53 % (1561094)Termination reason: Refutation
% 4.01/1.53 % (1561094)Time elapsed: 0.029 s
% 4.01/1.53 % (1561094)Peak memory usage: 90 MB
% 4.01/1.53 % (1561094)Instructions burned: 45 (million)
% 4.01/1.53 % (1561094)------------------------------
% 4.01/1.53 % (1561094)------------------------------
% 4.01/1.53 % (1561084)Success in time 0.48 s
% 4.01/1.53 % Vampire exiting
%------------------------------------------------------------------------------