%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC070+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:04:32 PM UTC 2026
% Result : Theorem 1.50s 0.71s
% Output : Refutation 1.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 13
% Syntax : Number of formulae : 92 ( 12 unt; 5 def)
% Number of atoms : 298 ( 49 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 363 ( 157 ~; 144 |; 36 &)
% ( 9 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn 51 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f175,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f235,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| app(X1,sK5(X0,X1)) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f236,plain,
! [X0,X1] :
( ssList(sK5(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f318,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f320,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f357,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f359,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f411,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( neq(sK49,nil)
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( neq(sK49,nil)
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( frontsegP(sK50,sK49)
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( nil != sK47
| nil != sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
( nil != sK49
| nil != sK50 ),
inference(definition_unfolding,[],[f416,f418,f419]) ).
fof(f426,plain,
! [X4] :
( ~ segmentP(sK50,X4)
| ~ segmentP(sK49,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f411,f418,f419]) ).
fof(f432,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f241]) ).
fof(f460,definition,
( spl51_1
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f462,plain,
( nil = sK49
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f460]) ).
fof(f464,definition,
( spl51_2
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f466,plain,
( neq(sK49,nil)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f467,plain,
( spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f412,f464,f460]) ).
fof(f469,definition,
( spl51_3
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f472,plain,
( spl51_3
| spl51_2 ),
inference(avatar_split_clause,[],[f413,f464,f469]) ).
fof(f474,definition,
( spl51_4
<=> frontsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f476,plain,
( frontsegP(sK50,sK49)
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f474]) ).
fof(f477,plain,
( spl51_1
| spl51_4 ),
inference(avatar_split_clause,[],[f414,f474,f460]) ).
fof(f479,plain,
( ~ spl51_3
| ~ spl51_1 ),
inference(avatar_split_clause,[],[f425,f460,f469]) ).
fof(f512,plain,
( ssList(nil)
| ~ spl51_1 ),
inference(superposition,[],[f420,f462]) ).
fof(f513,plain,
( neq(nil,nil)
| ~ spl51_1
| ~ spl51_2 ),
inference(forward_demodulation,[],[f466,f462]) ).
fof(f515,plain,
( ! [X4] :
( ~ segmentP(sK50,X4)
| ~ segmentP(nil,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
| ~ spl51_1 ),
inference(forward_demodulation,[],[f426,f462]) ).
fof(f528,plain,
( ~ ssList(sK50)
| ~ segmentP(nil,nil)
| ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl51_1 ),
inference(resolution,[],[f359,f515]) ).
fof(f529,plain,
( ~ segmentP(nil,nil)
| ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl51_1 ),
inference(forward_subsumption_resolution,[],[f528,f417]) ).
fof(f536,plain,
( ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl51_1 ),
inference(forward_subsumption_resolution,[],[f529,f357]) ).
fof(f537,plain,
( ~ ssList(nil)
| ~ spl51_1
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f536,f513]) ).
fof(f538,plain,
( $false
| ~ spl51_1
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f537,f512]) ).
fof(f539,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(avatar_contradiction_clause,[],[f538]) ).
fof(f629,plain,
( ~ ssList(sK49)
| sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_4 ),
inference(resolution,[],[f235,f476]) ).
fof(f634,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f629,f420]) ).
fof(f637,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f634,f417]) ).
fof(f704,definition,
( spl51_25
<=> ssList(sK5(sK50,sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_25])],[avatar_definition]) ).
fof(f705,plain,
( ssList(sK5(sK50,sK49))
| ~ spl51_25 ),
inference(avatar_component_clause,[],[f704]) ).
fof(f706,plain,
( ~ ssList(sK5(sK50,sK49))
| spl51_25 ),
inference(avatar_component_clause,[],[f704]) ).
fof(f727,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_25 ),
inference(resolution,[],[f706,f236]) ).
fof(f728,plain,
( ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_25 ),
inference(forward_subsumption_resolution,[],[f727,f420]) ).
fof(f729,plain,
( ~ frontsegP(sK50,sK49)
| spl51_25 ),
inference(forward_subsumption_resolution,[],[f728,f417]) ).
fof(f730,plain,
( $false
| ~ spl51_4
| spl51_25 ),
inference(forward_subsumption_resolution,[],[f729,f476]) ).
fof(f731,plain,
( ~ spl51_4
| spl51_25 ),
inference(avatar_contradiction_clause,[],[f730]) ).
fof(f1260,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f320,f420]) ).
fof(f2558,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK49,X0),sK49) ),
inference(superposition,[],[f432,f1260]) ).
fof(f2581,plain,
! [X0] :
( ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK49,X0),sK49) ),
inference(forward_subsumption_resolution,[],[f2558,f318]) ).
fof(f2605,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK49,X0),sK49) ),
inference(forward_subsumption_resolution,[],[f2581,f420]) ).
fof(f2648,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2605,f306]) ).
fof(f3642,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK5(sK50,sK49))
| ~ spl51_4 ),
inference(superposition,[],[f2648,f637]) ).
fof(f3647,plain,
( segmentP(sK50,sK49)
| ~ spl51_4
| ~ spl51_25 ),
inference(forward_subsumption_resolution,[],[f3642,f705]) ).
fof(f3666,plain,
( ~ segmentP(sK49,sK49)
| ~ neq(sK49,nil)
| ~ ssList(sK49)
| ~ spl51_4
| ~ spl51_25 ),
inference(resolution,[],[f3647,f426]) ).
fof(f3674,plain,
( ~ neq(sK49,nil)
| ~ ssList(sK49)
| ~ spl51_4
| ~ spl51_25 ),
inference(forward_subsumption_resolution,[],[f3666,f357]) ).
fof(f3678,plain,
( ~ ssList(sK49)
| ~ spl51_2
| ~ spl51_4
| ~ spl51_25 ),
inference(forward_subsumption_resolution,[],[f3674,f466]) ).
fof(f3679,plain,
( $false
| ~ spl51_2
| ~ spl51_4
| ~ spl51_25 ),
inference(forward_subsumption_resolution,[],[f3678,f420]) ).
fof(f3680,plain,
( ~ spl51_2
| ~ spl51_4
| ~ spl51_25 ),
inference(avatar_contradiction_clause,[],[f3679]) ).
cnf(s1,plain,
( spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f467]) ).
cnf(s2,plain,
( spl51_2
| spl51_3 ),
inference(sat_conversion,[],[f472]) ).
cnf(s3,plain,
( spl51_1
| spl51_4 ),
inference(sat_conversion,[],[f477]) ).
cnf(s5,plain,
( ~ spl51_1
| ~ spl51_3 ),
inference(sat_conversion,[],[f479]) ).
cnf(s15,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f539]) ).
cnf(s27,plain,
( ~ spl51_4
| spl51_25 ),
inference(sat_conversion,[],[f731]) ).
cnf(s205,plain,
( ~ spl51_2
| ~ spl51_4
| ~ spl51_25 ),
inference(sat_conversion,[],[f3680]) ).
cnf(s226,plain,
spl51_1,
inference(rat,[],[s205,s27,s1,s3]) ).
cnf(s227,plain,
~ spl51_2,
inference(rat,[],[s15,s226]) ).
cnf(s228,plain,
~ spl51_3,
inference(rat,[],[s5,s226]) ).
cnf(s229,plain,
$false,
inference(rat,[],[s2,s228,s227]) ).
fof(f3681,plain,
$false,
inference(avatar_sat_refutation,[],[s229]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC070+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n009.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Sep 28 07:43:16 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.50/0.71 % (2866586)Will run a generic schedule for satisfiability detection.
% 1.50/0.71 % (2866597)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3769298993:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.50/0.71 % (2866592)% WARNING: option uhcvi not known.
% 1.50/0.71 % (2866591)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1225729591_2999 on theBenchmark for (2999ds/0Mi)
% 1.50/0.71 % (2866595)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1535111298:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.50/0.71 % (2866596)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=868350320:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.50/0.71 % (2866593)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=399548034:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.50/0.71 % (2866594)dis+10_1_sil=32000:sp=arity:random_seed=1868105821:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.50/0.71 % (2866592)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3170205444:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.50/0.71 % TRYING [1]
% 1.50/0.71 % TRYING [2]
% 1.50/0.71 % TRYING [3]
% 1.50/0.71 % TRYING [4]
% 1.50/0.71 % (2866597)Instruction limit reached!
% 1.50/0.71 % (2866597)------------------------------
% 1.50/0.71 % (2866597)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.50/0.71 % (2866597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.50/0.71 % (2866597)CaDiCaL version: 2.1.3
% 1.50/0.71 % (2866597)Termination reason: Instruction limit
% 1.50/0.71 % (2866597)Termination phase: Saturation
% 1.50/0.71 % (2866597)Time elapsed: 0.084 s
% 1.50/0.71 % (2866597)Peak memory usage: 15 MB
% 1.50/0.71 % (2866597)Instructions burned: 159 (million)
% 1.50/0.71 % (2866608)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1107064015:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.50/0.71 % TRYING [1]
% 1.50/0.71 % TRYING [2]
% 1.50/0.71 % TRYING [3]
% 1.50/0.71 % TRYING [4]
% 1.50/0.71 % (2866594)Instruction limit reached!
% 1.50/0.71 % (2866594)------------------------------
% 1.50/0.71 % (2866594)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.50/0.71 % (2866594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.50/0.71 % (2866594)CaDiCaL version: 2.1.3
% 1.50/0.71 % (2866594)Termination reason: Instruction limit
% 1.50/0.71 % (2866594)Termination phase: Saturation
% 1.50/0.71 % (2866594)Time elapsed: 0.105 s
% 1.50/0.71 % (2866594)Peak memory usage: 13 MB
% 1.50/0.71 % (2866594)Instructions burned: 104 (million)
% 1.50/0.71 % (2866595)Instruction limit reached!
% 1.50/0.71 % (2866595)------------------------------
% 1.50/0.71 % (2866595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.50/0.71 % (2866595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.50/0.71 % (2866595)CaDiCaL version: 2.1.3
% 1.50/0.71 % (2866595)Termination reason: Instruction limit
% 1.50/0.71 % (2866595)Termination phase: Saturation
% 1.50/0.71 % (2866595)Time elapsed: 0.111 s
% 1.50/0.71 % (2866595)Peak memory usage: 13 MB
% 1.50/0.71 % (2866595)Instructions burned: 116 (million)
% 1.50/0.71 % (2866596)Instruction limit reached!
% 1.50/0.71 % (2866596)------------------------------
% 1.50/0.71 % (2866596)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.50/0.71 % (2866596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.50/0.71 % (2866596)CaDiCaL version: 2.1.3
% 1.50/0.71 % (2866596)Termination reason: Instruction limit
% 1.50/0.71 % (2866596)Termination phase: Saturation
% 1.50/0.71 % (2866596)Time elapsed: 0.122 s
% 1.50/0.71 % (2866596)Peak memory usage: 14 MB
% 1.50/0.71 % (2866596)Instructions burned: 131 (million)
% 1.50/0.71 % (2866612)ott-21_1_sil=16000:fs=off:random_seed=2642984235:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.50/0.71 % (2866610)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1210636665:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.50/0.71 % (2866611)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=4191834003:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.50/0.71 % TRYING [5]
% 1.50/0.71 % TRYING [5]
% 1.50/0.71 % (2866612)Instruction limit reached!
% 1.50/0.71 % (2866612)------------------------------
% 1.50/0.71 % (2866612)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.50/0.71 % (2866612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.50/0.71 % (2866612)CaDiCaL version: 2.1.3
% 1.50/0.71 % (2866612)Termination reason: Instruction limit
% 1.50/0.71 % (2866612)Termination phase: Saturation
% 1.50/0.71 % (2866612)Time elapsed: 0.053 s
% 1.50/0.71 % (2866612)Peak memory usage: 13 MB
% 1.50/0.71 % (2866612)Instructions burned: 181 (million)
% 1.50/0.71 % (2866611) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2866586-2866611"...
% 1.50/0.71 % (2866616)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=890967687:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.50/0.71 % (2866611)...printing done.
% 1.50/0.71 % (2866611)Refutation found. Thanks to Tanya!
% 1.50/0.71 % SZS status Theorem for theBenchmark
% 1.50/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 1.50/0.71 % (2866611)------------------------------
% 1.50/0.71 % (2866611)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.50/0.71 % (2866611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.50/0.71 % (2866611)CaDiCaL version: 2.1.3
% 1.50/0.71 % (2866611)Termination reason: Refutation
% 1.50/0.71 % (2866611)Time elapsed: 0.070 s
% 1.50/0.71 % (2866611)Peak memory usage: 15 MB
% 1.50/0.71 % (2866611)Instructions burned: 107 (million)
% 1.50/0.71 % (2866586)Success in time 0.252 s
% 1.50/0.71 % Vampire exiting
%------------------------------------------------------------------------------