%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC357+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 : n013.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:05:41 PM UTC 2026
% Result : Theorem 2.79s 0.69s
% Output : Refutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 72 ( 17 unt; 3 def)
% Number of atoms : 218 ( 34 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 255 ( 109 ~; 96 |; 24 &)
% ( 7 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 55 !; 10 ?)
% 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(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| segmentP(X1,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
| ~ neq(X1,nil)
| segmentP(X1,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(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
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(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(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ~ segmentP(X1,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
& neq(X1,nil)
& ~ segmentP(X1,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(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
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(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(f414,plain,
( frontsegP(sK50,sK49)
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
~ segmentP(sK48,sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
neq(sK48,nil),
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,
neq(sK50,nil),
inference(definition_unfolding,[],[f417,f419]) ).
fof(f426,plain,
~ segmentP(sK50,sK49),
inference(definition_unfolding,[],[f416,f419,f418]) ).
fof(f441,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f456,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f441]) ).
fof(f469,definition,
( spl51_3
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f471,plain,
( nil = sK50
| ~ spl51_3 ),
inference(avatar_component_clause,[],[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(f478,plain,
( spl51_3
| spl51_4 ),
inference(avatar_split_clause,[],[f414,f474,f469]) ).
fof(f514,plain,
( neq(nil,nil)
| ~ spl51_3 ),
inference(superposition,[],[f425,f471]) ).
fof(f568,plain,
( ~ ssList(sK49)
| sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_4 ),
inference(resolution,[],[f235,f476]) ).
fof(f572,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f568,f420]) ).
fof(f574,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f572,f415]) ).
fof(f637,definition,
( spl51_18
<=> ssList(sK5(sK50,sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_18])],[avatar_definition]) ).
fof(f638,plain,
( ssList(sK5(sK50,sK49))
| ~ spl51_18 ),
inference(avatar_component_clause,[],[f637]) ).
fof(f639,plain,
( ~ ssList(sK5(sK50,sK49))
| spl51_18 ),
inference(avatar_component_clause,[],[f637]) ).
fof(f644,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_18 ),
inference(resolution,[],[f639,f236]) ).
fof(f645,plain,
( ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_18 ),
inference(forward_subsumption_resolution,[],[f644,f420]) ).
fof(f646,plain,
( ~ frontsegP(sK50,sK49)
| spl51_18 ),
inference(forward_subsumption_resolution,[],[f645,f415]) ).
fof(f647,plain,
( $false
| ~ spl51_4
| spl51_18 ),
inference(forward_subsumption_resolution,[],[f646,f476]) ).
fof(f648,plain,
( ~ spl51_4
| spl51_18 ),
inference(avatar_contradiction_clause,[],[f647]) ).
fof(f1350,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f320,f420]) ).
fof(f2516,plain,
( ~ ssList(nil)
| ~ spl51_3 ),
inference(resolution,[],[f514,f456]) ).
fof(f2517,plain,
( $false
| ~ spl51_3 ),
inference(forward_subsumption_resolution,[],[f2516,f306]) ).
fof(f2518,plain,
~ spl51_3,
inference(avatar_contradiction_clause,[],[f2517]) ).
fof(f7090,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| segmentP(app(app(X1,X0),X2),X0)
| ~ ssList(X0) ),
inference(resolution,[],[f358,f357]) ).
fof(f7095,plain,
! [X2,X0,X1] :
( segmentP(app(app(X1,X0),X2),X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f7090]) ).
fof(f18987,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(sK49) ),
inference(superposition,[],[f7095,f1350]) ).
fof(f19006,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0)
| ~ ssList(sK49) ),
inference(forward_subsumption_resolution,[],[f18987,f306]) ).
fof(f19053,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f19006,f420]) ).
fof(f19183,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK5(sK50,sK49))
| ~ spl51_4 ),
inference(superposition,[],[f19053,f574]) ).
fof(f19192,plain,
( ~ ssList(sK5(sK50,sK49))
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f19183,f426]) ).
fof(f19200,plain,
( $false
| ~ spl51_4
| ~ spl51_18 ),
inference(forward_subsumption_resolution,[],[f19192,f638]) ).
fof(f19201,plain,
( ~ spl51_4
| ~ spl51_18 ),
inference(avatar_contradiction_clause,[],[f19200]) ).
cnf(s4,plain,
( spl51_3
| spl51_4 ),
inference(sat_conversion,[],[f478]) ).
cnf(s19,plain,
( ~ spl51_4
| spl51_18 ),
inference(sat_conversion,[],[f648]) ).
cnf(s102,plain,
~ spl51_3,
inference(sat_conversion,[],[f2518]) ).
cnf(s775,plain,
( ~ spl51_4
| ~ spl51_18 ),
inference(sat_conversion,[],[f19201]) ).
cnf(s823,plain,
spl51_4,
inference(rat,[],[s4,s102]) ).
cnf(s824,plain,
~ spl51_18,
inference(rat,[],[s775,s823]) ).
cnf(s828,plain,
$false,
inference(rat,[],[s19,s824,s823]) ).
fof(f19202,plain,
$false,
inference(avatar_sat_refutation,[],[s828]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC357+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n013.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 09:14:51 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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
% 2.79/0.69 % (1043296)Will run a generic schedule for satisfiability detection.
% 2.79/0.69 % (1043306)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=625901238:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.79/0.69 % (1043302)% WARNING: option uhcvi not known.
% 2.79/0.69 % (1043301)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2591479426_2999 on theBenchmark for (2999ds/0Mi)
% 2.79/0.69 % (1043303)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2845243778:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.79/0.69 % (1043302)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2049773338:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.79/0.69 % (1043304)dis+10_1_sil=32000:sp=arity:random_seed=1118365533:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.79/0.69 % (1043305)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2420692287:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.79/0.69 % (1043307)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3200449102:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.79/0.69 % TRYING [1]
% 2.79/0.69 % TRYING [2]
% 2.79/0.69 % TRYING [3]
% 2.79/0.69 % (1043306)Instruction limit reached!
% 2.79/0.69 % (1043306)------------------------------
% 2.79/0.69 % (1043306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/0.69 % (1043306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/0.69 % (1043306)CaDiCaL version: 2.1.3
% 2.79/0.69 % (1043306)Termination reason: Instruction limit
% 2.79/0.69 % (1043306)Termination phase: Saturation
% 2.79/0.69 % (1043306)Time elapsed: 0.041 s
% 2.79/0.69 % (1043306)Peak memory usage: 14 MB
% 2.79/0.69 % (1043306)Instructions burned: 134 (million)
% 2.79/0.69 % TRYING [4]
% 2.79/0.69 % (1043315)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1855447496:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.79/0.69 % TRYING [1]
% 2.79/0.69 % TRYING [2]
% 2.79/0.69 % TRYING [3]
% 2.79/0.69 % (1043304)Instruction limit reached!
% 2.79/0.69 % (1043304)------------------------------
% 2.79/0.69 % (1043304)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/0.69 % (1043304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/0.69 % (1043304)CaDiCaL version: 2.1.3
% 2.79/0.69 % (1043304)Termination reason: Instruction limit
% 2.79/0.69 % (1043304)Termination phase: Saturation
% 2.79/0.69 % (1043304)Time elapsed: 0.060 s
% 2.79/0.69 % (1043304)Peak memory usage: 13 MB
% 2.79/0.69 % (1043304)Instructions burned: 104 (million)
% 2.79/0.69 % TRYING [4]
% 2.79/0.69 % (1043305)Instruction limit reached!
% 2.79/0.69 % (1043305)------------------------------
% 2.79/0.69 % (1043305)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/0.69 % (1043305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/0.69 % (1043305)CaDiCaL version: 2.1.3
% 2.79/0.69 % (1043305)Termination reason: Instruction limit
% 2.79/0.69 % (1043305)Termination phase: Saturation
% 2.79/0.69 % (1043305)Time elapsed: 0.069 s
% 2.79/0.69 % (1043305)Peak memory usage: 13 MB
% 2.79/0.69 % (1043305)Instructions burned: 117 (million)
% 2.79/0.69 % (1043317)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2323008647:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.79/0.69 % TRYING [5]
% 2.79/0.69 % (1043318)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=688204223:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.79/0.69 % TRYING [5]
% 2.79/0.69 % (1043307)Instruction limit reached!
% 2.79/0.69 % (1043307)------------------------------
% 2.79/0.69 % (1043307)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/0.69 % (1043307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/0.69 % (1043307)CaDiCaL version: 2.1.3
% 2.79/0.69 % (1043307)Termination reason: Instruction limit
% 2.79/0.69 % (1043307)Termination phase: Saturation
% 2.79/0.69 % (1043307)Time elapsed: 0.102 s
% 2.79/0.69 % (1043307)Peak memory usage: 15 MB
% 2.79/0.69 % (1043307)Instructions burned: 160 (million)
% 2.79/0.69 % (1043321)ott-21_1_sil=16000:fs=off:random_seed=1531213519:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.79/0.69 % (1043317)Instruction limit reached!
% 2.79/0.69 % (1043317)------------------------------
% 2.79/0.69 % (1043317)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/0.69 % (1043317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/0.69 % (1043317)CaDiCaL version: 2.1.3
% 2.79/0.69 % (1043317)Termination reason: Instruction limit
% 2.79/0.69 % (1043317)Termination phase: Saturation
% 2.79/0.69 % (1043317)Time elapsed: 0.071 s
% 2.79/0.69 % (1043317)Peak memory usage: 13 MB
% 2.79/0.69 % (1043317)Instructions burned: 132 (million)
% 2.79/0.69 % (1043323)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=846103961:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.79/0.69 % TRYING [6]
% 2.79/0.69 % (1043315)Instruction limit reached!
% 2.79/0.69 % (1043315)------------------------------
% 2.79/0.69 % (1043315)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/0.69 % (1043315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/0.69 % (1043315)CaDiCaL version: 2.1.3
% 2.79/0.69 % (1043315)Termination reason: Instruction limit
% 2.79/0.69 % (1043315)Termination phase: Finite model building constraint generation
% 2.79/0.69 % (1043315)Time elapsed: 0.154 s
% 2.79/0.69 % (1043315)Peak memory usage: 28 MB
% 2.79/0.69 % (1043315)Instructions burned: 716 (million)
% 2.79/0.69 % (1043325)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=893890343:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.79/0.69 % TRYING [6]
% 2.79/0.69 % (1043321)Instruction limit reached!
% 2.79/0.69 % (1043321)------------------------------
% 2.79/0.69 % (1043321)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/0.69 % (1043321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/0.69 % (1043321)CaDiCaL version: 2.1.3
% 2.79/0.69 % (1043321)Termination reason: Instruction limit
% 2.79/0.69 % (1043321)Termination phase: Saturation
% 2.79/0.69 % (1043321)Time elapsed: 0.092 s
% 2.79/0.69 % (1043321)Peak memory usage: 13 MB
% 2.79/0.69 % (1043321)Instructions burned: 180 (million)
% 2.79/0.69 % TRYING [1]
% 2.79/0.69 % TRYING [2]
% 2.79/0.69 % TRYING [3]
% 2.79/0.69 % (1043327)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3720393441:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.79/0.69 % TRYING [4]
% 2.79/0.69 % TRYING [5]
% 2.79/0.69 % (1043325)Instruction limit reached!
% 2.79/0.69 % (1043325)------------------------------
% 2.79/0.69 % (1043325)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/0.69 % (1043325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/0.69 % (1043325)CaDiCaL version: 2.1.3
% 2.79/0.69 % (1043325)Termination reason: Instruction limit
% 2.79/0.69 % (1043325)Termination phase: Finite model building SAT solving
% 2.79/0.69 % (1043325)Time elapsed: 0.182 s
% 2.79/0.69 % (1043325)Peak memory usage: 23 MB
% 2.79/0.69 % (1043325)Instructions burned: 866 (million)
% 2.79/0.69 % (1043329)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1757819043:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.79/0.69 % (1043318) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1043296-1043318"...
% 2.79/0.69 % (1043318)...printing done.
% 2.79/0.69 % (1043318)Refutation found. Thanks to Tanya!
% 2.79/0.69 % SZS status Theorem for theBenchmark
% 2.79/0.69 % SZS output start Proof for theBenchmark
% See solution above
% 2.79/0.70 % (1043318)------------------------------
% 2.79/0.70 % (1043318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/0.70 % (1043318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/0.70 % (1043318)CaDiCaL version: 2.1.3
% 2.79/0.70 % (1043318)Termination reason: Refutation
% 2.79/0.70 % (1043318)Time elapsed: 0.321 s
% 2.79/0.70 % (1043318)Peak memory usage: 21 MB
% 2.79/0.70 % (1043318)Instructions burned: 604 (million)
% 2.79/0.70 % (1043296)Success in time 0.454 s
% 2.79/0.70 % Vampire exiting
%------------------------------------------------------------------------------