%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC122+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 : 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 01:04:45 PM UTC 2026
% Result : Theorem 1.08s 0.61s
% Output : Refutation 1.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 13
% Syntax : Number of formulae : 92 ( 20 unt; 5 def)
% Number of atoms : 290 ( 36 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 340 ( 142 ~; 136 |; 32 &)
% ( 9 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 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 : 83 ( 0 sgn 69 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
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(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ( nil != X2
& nil = X3 )
| ( neq(X0,nil)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ rearsegP(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
| ~ neq(X1,nil)
| ( nil != X2
& nil = X3 )
| ( neq(X0,nil)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
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(f173,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f174,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f173]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ( nil = X2
| nil != X3 )
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(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
& neq(X1,nil)
& ( nil = X2
| nil != X3 )
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f238,plain,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| ~ ssList(X1)
| app(sK6(X0,X1),X1) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f239,plain,
! [X0,X1] :
( ssList(sK6(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
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(f358,plain,
! [X2,X3,X0,X1] :
( ~ segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X0)
| segmentP(app(app(X2,X0),X3),X1) ),
inference(cnf_transformation,[],[f174]) ).
fof(f397,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f411,plain,
( rearsegP(sK50,sK49)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( neq(sK49,nil)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( ~ segmentP(sK48,sK47)
| ~ neq(sK47,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f416,f418]) ).
fof(f425,plain,
( ~ segmentP(sK50,sK49)
| ~ neq(sK49,nil) ),
inference(definition_unfolding,[],[f414,f418,f417,f417]) ).
fof(f431,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(f459,definition,
( spl51_1
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f461,plain,
( ~ neq(sK50,nil)
| spl51_1 ),
inference(avatar_component_clause,[],[f459]) ).
fof(f463,definition,
( spl51_2
<=> rearsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f465,plain,
( rearsegP(sK50,sK49)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f463]) ).
fof(f466,plain,
( ~ spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f411,f463,f459]) ).
fof(f468,definition,
( spl51_3
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f471,plain,
( ~ spl51_1
| spl51_3 ),
inference(avatar_split_clause,[],[f412,f468,f459]) ).
fof(f482,definition,
( spl51_6
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f484,plain,
( ~ segmentP(sK50,sK49)
| spl51_6 ),
inference(avatar_component_clause,[],[f482]) ).
fof(f485,plain,
( ~ spl51_3
| ~ spl51_6 ),
inference(avatar_split_clause,[],[f425,f482,f468]) ).
fof(f518,plain,
( $false
| spl51_1 ),
inference(forward_subsumption_resolution,[],[f461,f424]) ).
fof(f519,plain,
spl51_1,
inference(avatar_contradiction_clause,[],[f518]) ).
fof(f570,plain,
( ~ ssList(sK49)
| sK50 = app(sK6(sK50,sK49),sK49)
| ~ ssList(sK50)
| ~ spl51_2 ),
inference(resolution,[],[f238,f465]) ).
fof(f575,plain,
( sK50 = app(sK6(sK50,sK49),sK49)
| ~ ssList(sK50)
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f570,f419]) ).
fof(f578,plain,
( sK50 = app(sK6(sK50,sK49),sK49)
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f575,f415]) ).
fof(f630,definition,
( spl51_20
<=> ssList(sK6(sK50,sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_20])],[avatar_definition]) ).
fof(f631,plain,
( ssList(sK6(sK50,sK49))
| ~ spl51_20 ),
inference(avatar_component_clause,[],[f630]) ).
fof(f632,plain,
( ~ ssList(sK6(sK50,sK49))
| spl51_20 ),
inference(avatar_component_clause,[],[f630]) ).
fof(f637,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ rearsegP(sK50,sK49)
| spl51_20 ),
inference(resolution,[],[f632,f239]) ).
fof(f638,plain,
( ~ ssList(sK50)
| ~ rearsegP(sK50,sK49)
| spl51_20 ),
inference(forward_subsumption_resolution,[],[f637,f419]) ).
fof(f639,plain,
( ~ rearsegP(sK50,sK49)
| spl51_20 ),
inference(forward_subsumption_resolution,[],[f638,f415]) ).
fof(f640,plain,
( $false
| ~ spl51_2
| spl51_20 ),
inference(forward_subsumption_resolution,[],[f639,f465]) ).
fof(f641,plain,
( ~ spl51_2
| spl51_20 ),
inference(avatar_contradiction_clause,[],[f640]) ).
fof(f1140,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f320,f419]) ).
fof(f1193,plain,
sK49 = app(sK49,nil),
inference(resolution,[],[f397,f419]) ).
fof(f1194,plain,
sK50 = app(sK50,nil),
inference(resolution,[],[f397,f415]) ).
fof(f2531,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK49,X0),sK49) ),
inference(superposition,[],[f431,f1140]) ).
fof(f2563,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK49,X0),sK49) ),
inference(forward_subsumption_resolution,[],[f2531,f419]) ).
fof(f2596,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| segmentP(app(sK49,X0),sK49) ),
inference(forward_subsumption_resolution,[],[f2563,f306]) ).
fof(f2706,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(app(sK49,X0),sK49)
| ~ ssList(X0)
| ~ ssList(sK49) ),
inference(resolution,[],[f2596,f318]) ).
fof(f2708,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(app(sK49,X0),sK49)
| ~ ssList(sK49) ),
inference(duplicate_literal_removal,[],[f2706]) ).
fof(f2709,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2708,f419]) ).
fof(f2714,plain,
( segmentP(sK49,sK49)
| ~ ssList(nil) ),
inference(superposition,[],[f2709,f1193]) ).
fof(f2715,plain,
segmentP(sK49,sK49),
inference(forward_subsumption_resolution,[],[f2714,f306]) ).
fof(f2720,plain,
! [X0,X1] :
( ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(sK49)
| segmentP(app(app(X0,sK49),X1),sK49) ),
inference(resolution,[],[f2715,f358]) ).
fof(f2727,plain,
! [X0,X1] :
( ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(X1)
| segmentP(app(app(X0,sK49),X1),sK49) ),
inference(duplicate_literal_removal,[],[f2720]) ).
fof(f2729,plain,
! [X0,X1] :
( segmentP(app(app(X0,sK49),X1),sK49)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2727,f419]) ).
fof(f3315,plain,
( ! [X0] :
( segmentP(app(sK50,X0),sK49)
| ~ ssList(X0)
| ~ ssList(sK6(sK50,sK49)) )
| ~ spl51_2 ),
inference(superposition,[],[f2729,f578]) ).
fof(f3318,plain,
( ! [X0] :
( segmentP(app(sK50,X0),sK49)
| ~ ssList(X0) )
| ~ spl51_2
| ~ spl51_20 ),
inference(forward_subsumption_resolution,[],[f3315,f631]) ).
fof(f3326,plain,
( segmentP(sK50,sK49)
| ~ ssList(nil)
| ~ spl51_2
| ~ spl51_20 ),
inference(superposition,[],[f3318,f1194]) ).
fof(f3327,plain,
( ~ ssList(nil)
| ~ spl51_2
| spl51_6
| ~ spl51_20 ),
inference(forward_subsumption_resolution,[],[f3326,f484]) ).
fof(f3332,plain,
( $false
| ~ spl51_2
| spl51_6
| ~ spl51_20 ),
inference(forward_subsumption_resolution,[],[f3327,f306]) ).
fof(f3333,plain,
( ~ spl51_2
| spl51_6
| ~ spl51_20 ),
inference(avatar_contradiction_clause,[],[f3332]) ).
cnf(s1,plain,
( ~ spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f466]) ).
cnf(s2,plain,
( ~ spl51_1
| spl51_3 ),
inference(sat_conversion,[],[f471]) ).
cnf(s4,plain,
( ~ spl51_3
| ~ spl51_6 ),
inference(sat_conversion,[],[f485]) ).
cnf(s11,plain,
spl51_1,
inference(sat_conversion,[],[f519]) ).
cnf(s17,plain,
( ~ spl51_2
| spl51_20 ),
inference(sat_conversion,[],[f641]) ).
cnf(s142,plain,
( ~ spl51_2
| spl51_6
| ~ spl51_20 ),
inference(sat_conversion,[],[f3333]) ).
cnf(s165,plain,
spl51_3,
inference(rat,[],[s2,s11]) ).
cnf(s167,plain,
~ spl51_6,
inference(rat,[],[s4,s165]) ).
cnf(s178,plain,
spl51_2,
inference(rat,[],[s1,s11]) ).
cnf(s179,plain,
~ spl51_20,
inference(rat,[],[s142,s167,s178]) ).
cnf(s181,plain,
$false,
inference(rat,[],[s17,s179,s178]) ).
fof(f3334,plain,
$false,
inference(avatar_sat_refutation,[],[s181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC122+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.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 : Mon Sep 28 08:00:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.08/0.61 % (2090196)Will run a generic schedule for satisfiability detection.
% 1.08/0.61 % (2090206)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2345140219:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.08/0.61 % (2090202)% WARNING: option uhcvi not known.
% 1.08/0.61 % (2090201)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1260357722_2999 on theBenchmark for (2999ds/0Mi)
% 1.08/0.61 % (2090203)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1132296733:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.08/0.61 % (2090204)dis+10_1_sil=32000:sp=arity:random_seed=3110824893:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.08/0.61 % (2090205)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3311274565:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.08/0.61 % (2090207)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1104533168:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.08/0.61 % (2090202)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3890610803:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.08/0.61 % TRYING [1]
% 1.08/0.61 % TRYING [2]
% 1.08/0.61 % TRYING [3]
% 1.08/0.61 % (2090206)Instruction limit reached!
% 1.08/0.61 % (2090206)------------------------------
% 1.08/0.61 % (2090206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.08/0.61 % (2090206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.08/0.61 % (2090206)CaDiCaL version: 2.1.3
% 1.08/0.61 % (2090206)Termination reason: Instruction limit
% 1.08/0.61 % (2090206)Termination phase: Saturation
% 1.08/0.61 % (2090206)Time elapsed: 0.042 s
% 1.08/0.61 % (2090206)Peak memory usage: 14 MB
% 1.08/0.61 % (2090206)Instructions burned: 132 (million)
% 1.08/0.61 % TRYING [4]
% 1.08/0.61 % (2090215)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3672271287:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.08/0.61 % TRYING [1]
% 1.08/0.61 % TRYING [2]
% 1.08/0.61 % TRYING [3]
% 1.08/0.61 % (2090204)Instruction limit reached!
% 1.08/0.61 % (2090204)------------------------------
% 1.08/0.61 % (2090204)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.08/0.61 % (2090204)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.08/0.61 % (2090204)CaDiCaL version: 2.1.3
% 1.08/0.61 % (2090204)Termination reason: Instruction limit
% 1.08/0.61 % (2090204)Termination phase: Saturation
% 1.08/0.61 % (2090204)Time elapsed: 0.062 s
% 1.08/0.61 % (2090204)Peak memory usage: 13 MB
% 1.08/0.61 % (2090204)Instructions burned: 104 (million)
% 1.08/0.61 % TRYING [4]
% 1.08/0.61 % (2090205)Instruction limit reached!
% 1.08/0.61 % (2090205)------------------------------
% 1.08/0.61 % (2090205)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.08/0.61 % (2090205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.08/0.61 % (2090205)CaDiCaL version: 2.1.3
% 1.08/0.61 % (2090205)Termination reason: Instruction limit
% 1.08/0.61 % (2090205)Termination phase: Saturation
% 1.08/0.61 % (2090205)Time elapsed: 0.070 s
% 1.08/0.61 % (2090205)Peak memory usage: 13 MB
% 1.08/0.61 % (2090205)Instructions burned: 116 (million)
% 1.08/0.61 % (2090217)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=742407204:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.08/0.61 % TRYING [5]
% 1.08/0.61 % (2090218)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=3562708332:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.08/0.61 % TRYING [5]
% 1.08/0.61 % (2090207)Instruction limit reached!
% 1.08/0.61 % (2090207)------------------------------
% 1.08/0.61 % (2090207)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.08/0.61 % (2090207)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.08/0.61 % (2090207)CaDiCaL version: 2.1.3
% 1.08/0.61 % (2090207)Termination reason: Instruction limit
% 1.08/0.61 % (2090207)Termination phase: Saturation
% 1.08/0.61 % (2090207)Time elapsed: 0.104 s
% 1.08/0.61 % (2090207)Peak memory usage: 15 MB
% 1.08/0.61 % (2090207)Instructions burned: 159 (million)
% 1.08/0.61 % (2090221)ott-21_1_sil=16000:fs=off:random_seed=2518495070:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.08/0.61 % (2090217)Instruction limit reached!
% 1.08/0.61 % (2090217)------------------------------
% 1.08/0.61 % (2090217)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.08/0.61 % (2090217)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.08/0.61 % (2090217)CaDiCaL version: 2.1.3
% 1.08/0.61 % (2090217)Termination reason: Instruction limit
% 1.08/0.61 % (2090217)Termination phase: Saturation
% 1.08/0.61 % (2090217)Time elapsed: 0.070 s
% 1.08/0.61 % (2090217)Peak memory usage: 13 MB
% 1.08/0.61 % (2090217)Instructions burned: 131 (million)
% 1.08/0.61 % (2090218) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2090196-2090218"...
% 1.08/0.61 % (2090218)...printing done.
% 1.08/0.61 % (2090218)Refutation found. Thanks to Tanya!
% 1.08/0.61 % SZS status Theorem for theBenchmark
% 1.08/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 1.08/0.61 % (2090218)------------------------------
% 1.08/0.61 % (2090218)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.08/0.61 % (2090218)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.08/0.61 % (2090218)CaDiCaL version: 2.1.3
% 1.08/0.61 % (2090218)Termination reason: Refutation
% 1.08/0.61 % (2090218)Time elapsed: 0.067 s
% 1.08/0.61 % (2090218)Peak memory usage: 14 MB
% 1.08/0.61 % (2090218)Instructions burned: 103 (million)
% 1.08/0.61 % (2090196)Success in time 0.197 s
% 1.08/0.61 % Vampire exiting
%------------------------------------------------------------------------------