%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC039+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 01:02:09 PM UTC 2026
% Result : Theorem 4.13s 1.67s
% Output : Refutation 6.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 82 ( 17 unt; 7 def)
% Number of atoms : 333 ( 98 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 397 ( 146 ~; 137 |; 88 &)
% ( 8 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 7 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 62 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| X1 != X3
| X0 != X2
| nil = X0
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f137,definition,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X2,X3) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f138,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& X1 = X3
& X0 = X2
& nil != X0
& ( sP0(X2,X3)
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f137]) ).
fof(f139,plain,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X2,X3) ),
inference(nnf_transformation,[],[f137]) ).
fof(f140,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( cons(X2,nil) = X0
& app(app(X3,X0),X4) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ lt(X2,X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(X4,X6)
| ~ lt(X6,X2) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f139]) ).
fof(f141,plain,
! [X0,X1] :
( ( cons(sK1(X0,X1),nil) = X0
& app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(sK2(X0,X1),X5)
| ~ lt(sK1(X0,X1),X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(sK3(X0,X1),X6)
| ~ lt(X6,sK1(X0,X1)) )
& ssList(sK3(X0,X1))
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1)),skolemize(X4,sK3(X0,X1))],[f140]) ).
fof(f142,plain,
( nil = sK5
& sK5 = sK7
& sK4 = sK6
& nil != sK4
& ( sP0(sK6,sK7)
| ( nil = sK7
& nil = sK6 ) )
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f138]) ).
fof(f145,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f145]) ).
fof(f157,plain,
! [X0,X1] :
( ssList(sK2(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f141]) ).
fof(f158,plain,
! [X0,X1] :
( ssList(sK3(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f141]) ).
fof(f161,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f141]) ).
fof(f163,plain,
ssList(sK4),
inference(cnf_transformation,[],[f142]) ).
fof(f167,plain,
( sP0(sK6,sK7)
| nil = sK6 ),
inference(cnf_transformation,[],[f142]) ).
fof(f169,plain,
nil != sK4,
inference(cnf_transformation,[],[f142]) ).
fof(f170,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f142]) ).
fof(f171,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f142]) ).
fof(f172,plain,
nil = sK5,
inference(cnf_transformation,[],[f142]) ).
fof(f185,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f186,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f194,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f218,plain,
nil = sK7,
inference(definition_unfolding,[],[f172,f171]) ).
fof(f220,plain,
sK6 != sK7,
inference(definition_unfolding,[],[f169,f218,f170]) ).
fof(f222,plain,
( sP0(sK6,sK7)
| sK6 = sK7 ),
inference(definition_unfolding,[],[f167,f218]) ).
fof(f224,plain,
ssList(sK6),
inference(definition_unfolding,[],[f163,f170]) ).
fof(f231,plain,
! [X0,X1] :
( app(X0,X1) != sK7
| sK7 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f186,f218,f218]) ).
fof(f232,plain,
! [X0,X1] :
( app(X0,X1) != sK7
| sK7 = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f185,f218,f218]) ).
fof(f246,definition,
( spl14_1
<=> sK6 = sK7 ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f247,plain,
( sK6 != sK7
| spl14_1 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f250,definition,
( spl14_2
<=> sP0(sK6,sK7) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f252,plain,
( sP0(sK6,sK7)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f253,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f222,f250,f246]) ).
fof(f254,plain,
~ spl14_1,
inference(avatar_split_clause,[],[f220,f246]) ).
fof(f486,plain,
( sK7 = app(app(sK2(sK6,sK7),sK6),sK3(sK6,sK7))
| ~ spl14_2 ),
inference(resolution,[],[f161,f252]) ).
fof(f938,plain,
( sK7 != sK7
| sK7 = app(sK2(sK6,sK7),sK6)
| ~ ssList(sK3(sK6,sK7))
| ~ ssList(app(sK2(sK6,sK7),sK6))
| ~ spl14_2 ),
inference(superposition,[],[f232,f486]) ).
fof(f939,plain,
( sK7 = app(sK2(sK6,sK7),sK6)
| ~ ssList(sK3(sK6,sK7))
| ~ ssList(app(sK2(sK6,sK7),sK6))
| ~ spl14_2 ),
inference(trivial_inequality_removal,[],[f938]) ).
fof(f942,definition,
( spl14_21
<=> ssList(app(sK2(sK6,sK7),sK6)) ),
introduced(definition,[new_symbols(definition,[spl14_21])],[avatar_definition]) ).
fof(f944,plain,
( ~ ssList(app(sK2(sK6,sK7),sK6))
| spl14_21 ),
inference(avatar_component_clause,[],[f942]) ).
fof(f946,definition,
( spl14_22
<=> ssList(sK3(sK6,sK7)) ),
introduced(definition,[new_symbols(definition,[spl14_22])],[avatar_definition]) ).
fof(f948,plain,
( ~ ssList(sK3(sK6,sK7))
| spl14_22 ),
inference(avatar_component_clause,[],[f946]) ).
fof(f950,definition,
( spl14_23
<=> sK7 = app(sK2(sK6,sK7),sK6) ),
introduced(definition,[new_symbols(definition,[spl14_23])],[avatar_definition]) ).
fof(f952,plain,
( sK7 = app(sK2(sK6,sK7),sK6)
| ~ spl14_23 ),
inference(avatar_component_clause,[],[f950]) ).
fof(f953,plain,
( ~ spl14_21
| ~ spl14_22
| spl14_23
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f939,f250,f950,f946,f942]) ).
fof(f979,plain,
( ~ ssList(sK6)
| ~ ssList(sK2(sK6,sK7))
| spl14_21 ),
inference(resolution,[],[f944,f194]) ).
fof(f980,plain,
( ~ ssList(sK2(sK6,sK7))
| spl14_21 ),
inference(forward_subsumption_resolution,[],[f979,f224]) ).
fof(f1002,plain,
( ~ sP0(sK6,sK7)
| spl14_21 ),
inference(resolution,[],[f980,f157]) ).
fof(f1003,plain,
( $false
| ~ spl14_2
| spl14_21 ),
inference(forward_subsumption_resolution,[],[f1002,f252]) ).
fof(f1004,plain,
( ~ spl14_2
| spl14_21 ),
inference(avatar_contradiction_clause,[],[f1003]) ).
fof(f1006,plain,
( ~ sP0(sK6,sK7)
| spl14_22 ),
inference(resolution,[],[f948,f158]) ).
fof(f1007,plain,
( $false
| ~ spl14_2
| spl14_22 ),
inference(forward_subsumption_resolution,[],[f1006,f252]) ).
fof(f1008,plain,
( ~ spl14_2
| spl14_22 ),
inference(avatar_contradiction_clause,[],[f1007]) ).
fof(f1080,plain,
( sK7 != sK7
| sK6 = sK7
| ~ ssList(sK6)
| ~ ssList(sK2(sK6,sK7))
| ~ spl14_23 ),
inference(superposition,[],[f231,f952]) ).
fof(f1083,plain,
( sK6 = sK7
| ~ ssList(sK6)
| ~ ssList(sK2(sK6,sK7))
| ~ spl14_23 ),
inference(trivial_inequality_removal,[],[f1080]) ).
fof(f1085,plain,
( ~ ssList(sK6)
| ~ ssList(sK2(sK6,sK7))
| spl14_1
| ~ spl14_23 ),
inference(forward_subsumption_resolution,[],[f1083,f247]) ).
fof(f1094,definition,
( spl14_29
<=> ssList(sK2(sK6,sK7)) ),
introduced(definition,[new_symbols(definition,[spl14_29])],[avatar_definition]) ).
fof(f1096,plain,
( ~ ssList(sK2(sK6,sK7))
| spl14_29 ),
inference(avatar_component_clause,[],[f1094]) ).
fof(f1102,plain,
( ~ ssList(sK2(sK6,sK7))
| spl14_1
| ~ spl14_23 ),
inference(forward_subsumption_resolution,[],[f1085,f224]) ).
fof(f1115,plain,
( ~ spl14_29
| spl14_1
| ~ spl14_23 ),
inference(avatar_split_clause,[],[f1102,f950,f246,f1094]) ).
fof(f1144,plain,
( ~ sP0(sK6,sK7)
| spl14_29 ),
inference(resolution,[],[f1096,f157]) ).
fof(f1145,plain,
( $false
| ~ spl14_2
| spl14_29 ),
inference(forward_subsumption_resolution,[],[f1144,f252]) ).
fof(f1146,plain,
( ~ spl14_2
| spl14_29 ),
inference(avatar_contradiction_clause,[],[f1145]) ).
cnf(s1,plain,
( spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f253]) ).
cnf(s2,plain,
~ spl14_1,
inference(sat_conversion,[],[f254]) ).
cnf(s26,plain,
( ~ spl14_2
| ~ spl14_21
| ~ spl14_22
| spl14_23 ),
inference(sat_conversion,[],[f953]) ).
cnf(s34,plain,
( ~ spl14_2
| spl14_21 ),
inference(sat_conversion,[],[f1004]) ).
cnf(s35,plain,
( ~ spl14_2
| spl14_22 ),
inference(sat_conversion,[],[f1008]) ).
cnf(s41,plain,
( spl14_1
| ~ spl14_23
| ~ spl14_29 ),
inference(sat_conversion,[],[f1115]) ).
cnf(s44,plain,
( ~ spl14_2
| spl14_29 ),
inference(sat_conversion,[],[f1146]) ).
cnf(s60,plain,
spl14_2,
inference(rat,[],[s1,s2]) ).
cnf(s61,plain,
spl14_29,
inference(rat,[],[s44,s60]) ).
cnf(s62,plain,
spl14_22,
inference(rat,[],[s35,s60]) ).
cnf(s63,plain,
spl14_21,
inference(rat,[],[s34,s60]) ).
cnf(s65,plain,
~ spl14_23,
inference(rat,[],[s41,s2,s61]) ).
cnf(s71,plain,
$false,
inference(rat,[],[s26,s60,s62,s65,s63]) ).
fof(f1147,plain,
$false,
inference(avatar_sat_refutation,[],[s71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC039+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n011.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 28 07:33:45 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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
% 4.13/1.67 % (3229899)Detected formulas, will run a generic FOF schedule.
% 4.13/1.67 % (3229920)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=233607712:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.13/1.67 % (3229920)Instruction limit reached!
% 4.13/1.67 % (3229920)------------------------------
% 4.13/1.67 % (3229920)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.13/1.67 % (3229920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.13/1.67 % (3229920)CaDiCaL version: 2.1.3
% 4.13/1.67 % (3229920)Termination reason: Instruction limit
% 4.13/1.67 % (3229920)Termination phase: Saturation
% 4.13/1.67 % (3229920)Time elapsed: 0.038 s
% 4.13/1.67 % (3229920)Peak memory usage: 89 MB
% 4.13/1.67 % (3229920)Instructions burned: 110 (million)
% 4.13/1.67 % (3229917)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=2716088793:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.13/1.67 % (3229919)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=2769860167:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.13/1.67 % (3229922)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1712323984:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.13/1.67 % (3229923)dis-21_1_sil=8000:lcm=predicate:random_seed=1032585774: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)
% 4.13/1.67 % (3229918)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=4267593690:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.13/1.67 % (3229921)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4156356347:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.13/1.67 % (3229923)Instruction limit reached!
% 4.13/1.67 % (3229923)------------------------------
% 4.13/1.67 % (3229923)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.13/1.67 % (3229923)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.13/1.67 % (3229923)CaDiCaL version: 2.1.3
% 4.13/1.67 % (3229923)Termination reason: Instruction limit
% 4.13/1.67 % (3229923)Termination phase: Saturation
% 4.13/1.67 % (3229923)Time elapsed: 0.100 s
% 4.13/1.67 % (3229923)Peak memory usage: 90 MB
% 4.13/1.67 % (3229923)Instructions burned: 129 (million)
% 4.13/1.67 % (3229921)Instruction limit reached!
% 4.13/1.67 % (3229921)------------------------------
% 4.13/1.67 % (3229921)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.13/1.67 % (3229921)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.13/1.67 % (3229921)CaDiCaL version: 2.1.3
% 4.13/1.67 % (3229921)Termination reason: Instruction limit
% 4.13/1.67 % (3229921)Termination phase: Saturation
% 4.13/1.67 % (3229921)Time elapsed: 0.081 s
% 4.13/1.67 % (3229921)Peak memory usage: 88 MB
% 4.13/1.67 % (3229921)Instructions burned: 120 (million)
% 4.13/1.67 % (3229922)Instruction limit reached!
% 4.13/1.67 % (3229922)------------------------------
% 4.13/1.67 % (3229922)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.13/1.67 % (3229922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.13/1.67 % (3229922)CaDiCaL version: 2.1.3
% 4.13/1.67 % (3229922)Termination reason: Instruction limit
% 4.13/1.67 % (3229922)Termination phase: Saturation
% 4.13/1.67 % (3229922)Time elapsed: 0.135 s
% 4.13/1.67 % (3229922)Peak memory usage: 90 MB
% 4.13/1.67 % (3229922)Instructions burned: 140 (million)
% 4.13/1.67 % (3229933)lrs+10_1_sil=8000:sp=occurrence:random_seed=3094904487:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.13/1.67 % (3229933)First to succeed.
% 4.13/1.67 % (3229933)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3229899"
% 4.13/1.67 % (3229942)lrs+1011_1_sil=32000:sp=occurrence:random_seed=51808966:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.13/1.67 % (3229940)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2410886930:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.13/1.67 % (3229943)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=3087990410:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 4.13/1.67 % (3229940)Instruction limit reached!
% 4.13/1.67 % (3229940)------------------------------
% 4.13/1.67 % (3229940)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.13/1.67 % (3229940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.13/1.67 % (3229940)CaDiCaL version: 2.1.3
% 4.13/1.67 % (3229940)Termination reason: Instruction limit
% 4.13/1.67 % (3229940)Termination phase: Saturation
% 4.13/1.67 % (3229940)Time elapsed: 0.139 s
% 4.13/1.67 % (3229940)Peak memory usage: 91 MB
% 4.13/1.67 % (3229940)Instructions burned: 158 (million)
% 4.13/1.67 % (3229942)Also succeeded, but the first one will report.
% 4.13/1.67 % (3229943)Instruction limit reached!
% 4.13/1.67 % (3229943)------------------------------
% 4.13/1.67 % (3229943)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.13/1.67 % (3229943)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.13/1.67 % (3229943)CaDiCaL version: 2.1.3
% 4.13/1.67 % (3229943)Termination reason: Instruction limit
% 4.13/1.67 % (3229943)Termination phase: Saturation
% 4.13/1.67 % (3229943)Time elapsed: 0.191 s
% 4.13/1.67 % (3229943)Peak memory usage: 94 MB
% 4.13/1.67 % (3229943)Instructions burned: 249 (million)
% 4.13/1.67 % (3229933)Refutation found. Thanks to Tanya!
% 4.13/1.67 % SZS status Theorem for theBenchmark
% 4.13/1.67 % SZS output start Proof for theBenchmark
% See solution above
% 6.33/1.88 % (3229933)------------------------------
% 6.33/1.88 % (3229933)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.33/1.88 % (3229933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.33/1.88 % (3229933)CaDiCaL version: 2.1.3
% 6.33/1.88 % (3229933)Termination reason: Refutation
% 6.33/1.88 % (3229933)Time elapsed: 0.037 s
% 6.33/1.88 % (3229933)Peak memory usage: 90 MB
% 6.33/1.88 % (3229933)Instructions burned: 32 (million)
% 6.33/1.88 % (3229933)------------------------------
% 6.33/1.88 % (3229933)------------------------------
% 6.33/1.88 % (3229899)Success in time 0.828 s
% 6.33/1.88 % Vampire exiting
%------------------------------------------------------------------------------