%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC229+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:03:02 PM UTC 2026
% Result : Theorem 2.55s 0.87s
% Output : Refutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 74 ( 13 unt; 0 def)
% Number of atoms : 327 ( 74 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 431 ( 178 ~; 171 |; 59 &)
% ( 6 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 103 ( 83 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ segmentP(X3,X2)
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) ) )
| ( ~ singletonP(X2)
& neq(X3,nil) ) ) ) ) ) ),
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
| ~ segmentP(X3,X2)
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) ) )
| ( ~ singletonP(X2)
& neq(X3,nil) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& segmentP(X3,X2)
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X5,X7)
& memberP(X6,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) ) ) )
& ( singletonP(X2)
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& segmentP(X3,X2)
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X5,X7)
& memberP(X6,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) ) ) )
& ( singletonP(X2)
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f107,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f115,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f124,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f125,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f140,plain,
( sK1 = sK3
& sK0 = sK2
& segmentP(sK3,sK2)
& nil != sK0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| ( memberP(X5,sK4(X4,X5,X6))
& memberP(X6,sK4(X4,X5,X6))
& leq(X4,sK4(X4,X5,X6))
& ~ leq(sK4(X4,X5,X6),X4)
& ssItem(sK4(X4,X5,X6)) ) ) ) )
& ( singletonP(sK2)
| ~ neq(sK3,nil) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X7,sK4(X4,X5,X6))],[f99]) ).
fof(f145,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f154,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f124]) ).
fof(f155,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f154]) ).
fof(f156,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ( ssItem(sK11(X0))
& cons(sK11(X0),nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X2,sK11(X0))],[f155]) ).
fof(f157,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f125]) ).
fof(f163,plain,
ssList(sK2),
inference(cnf_transformation,[],[f140]) ).
fof(f164,plain,
ssList(sK3),
inference(cnf_transformation,[],[f140]) ).
fof(f165,plain,
( ~ neq(sK3,nil)
| singletonP(sK2) ),
inference(cnf_transformation,[],[f140]) ).
fof(f166,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| ssItem(sK4(X4,X5,X6)) ),
inference(cnf_transformation,[],[f140]) ).
fof(f170,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK0
| memberP(X5,sK4(X4,X5,X6)) ),
inference(cnf_transformation,[],[f140]) ).
fof(f171,plain,
nil != sK0,
inference(cnf_transformation,[],[f140]) ).
fof(f172,plain,
segmentP(sK3,sK2),
inference(cnf_transformation,[],[f140]) ).
fof(f173,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f140]) ).
fof(f186,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f194,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f198,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f201,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f202,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f214,plain,
! [X0] :
( cons(sK11(X0),nil) = X0
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f215,plain,
! [X0] :
( ssItem(sK11(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f217,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f231,plain,
nil != sK2,
inference(definition_unfolding,[],[f171,f173]) ).
fof(f232,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| memberP(X5,sK4(X4,X5,X6)) ),
inference(definition_unfolding,[],[f170,f173]) ).
fof(f236,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| ssItem(sK4(X4,X5,X6)) ),
inference(definition_unfolding,[],[f166,f173]) ).
fof(f256,plain,
! [X0,X1] :
( sK2 != app(X0,cons(X1,nil))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssItem(X1)
| ssItem(sK4(X1,X0,nil))
| ~ ssList(app(X0,cons(X1,nil))) ),
inference(superposition,[],[f236,f186]) ).
fof(f257,plain,
! [X0,X1] :
( sK2 != app(X0,cons(X1,nil))
| ~ ssList(X0)
| ~ ssItem(X1)
| ssItem(sK4(X1,X0,nil))
| ~ ssList(app(X0,cons(X1,nil))) ),
inference(forward_subsumption_resolution,[],[f256,f201]) ).
fof(f262,plain,
! [X0] :
( cons(X0,nil) != sK2
| ~ ssList(nil)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,nil))
| ~ ssList(cons(X0,nil))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f257,f194]) ).
fof(f266,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f232,f194]) ).
fof(f268,plain,
! [X0] :
( cons(X0,nil) != sK2
| ~ ssList(nil)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,nil))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f262]) ).
fof(f270,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f266,f201]) ).
fof(f274,plain,
! [X0] :
( cons(X0,nil) != sK2
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,nil))
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f268,f201]) ).
fof(f277,plain,
! [X0] :
( cons(X0,nil) != sK2
| ~ ssList(nil)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,nil))
| ~ ssList(cons(X0,nil))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f270,f186]) ).
fof(f278,plain,
! [X0] :
( cons(X0,nil) != sK2
| ~ ssList(nil)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,nil))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f277]) ).
fof(f279,plain,
! [X0] :
( cons(X0,nil) != sK2
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,nil))
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f278,f201]) ).
fof(f304,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| singletonP(sK2) ),
inference(resolution,[],[f198,f165]) ).
fof(f309,plain,
( nil = sK3
| ~ ssList(sK3)
| singletonP(sK2) ),
inference(forward_subsumption_resolution,[],[f304,f201]) ).
fof(f310,plain,
( nil = sK3
| singletonP(sK2) ),
inference(forward_subsumption_resolution,[],[f309,f164]) ).
fof(f322,plain,
! [X0] :
( ~ segmentP(sK3,X0)
| sK3 = X0
| ~ ssList(X0)
| singletonP(sK2) ),
inference(superposition,[],[f217,f310]) ).
fof(f324,plain,
( sK2 != sK3
| singletonP(sK2) ),
inference(superposition,[],[f231,f310]) ).
fof(f361,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK11(X0))
| ssItem(sK4(sK11(X0),nil,nil))
| ~ ssList(X0)
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f274,f214]) ).
fof(f362,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK11(X0))
| memberP(nil,sK4(sK11(X0),nil,nil))
| ~ ssList(X0)
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f279,f214]) ).
fof(f371,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK11(X0))
| memberP(nil,sK4(sK11(X0),nil,nil))
| ~ ssList(X0)
| ~ singletonP(X0) ),
inference(duplicate_literal_removal,[],[f362]) ).
fof(f372,plain,
! [X0] :
( sK2 != X0
| ~ ssItem(sK11(X0))
| ssItem(sK4(sK11(X0),nil,nil))
| ~ ssList(X0)
| ~ singletonP(X0) ),
inference(duplicate_literal_removal,[],[f361]) ).
fof(f383,plain,
! [X0] :
( sK2 != X0
| memberP(nil,sK4(sK11(X0),nil,nil))
| ~ ssList(X0)
| ~ singletonP(X0) ),
inference(forward_subsumption_resolution,[],[f371,f215]) ).
fof(f384,plain,
! [X0] :
( sK2 != X0
| ssItem(sK4(sK11(X0),nil,nil))
| ~ ssList(X0)
| ~ singletonP(X0) ),
inference(forward_subsumption_resolution,[],[f372,f215]) ).
fof(f474,plain,
( sK2 = sK3
| ~ ssList(sK2)
| singletonP(sK2) ),
inference(resolution,[],[f322,f172]) ).
fof(f480,plain,
( ~ ssList(sK2)
| singletonP(sK2) ),
inference(forward_subsumption_resolution,[],[f474,f324]) ).
fof(f481,plain,
singletonP(sK2),
inference(forward_subsumption_resolution,[],[f480,f163]) ).
fof(f502,plain,
( ssItem(sK4(sK11(sK2),nil,nil))
| ~ ssList(sK2)
| ~ singletonP(sK2) ),
inference(equality_resolution,[],[f384]) ).
fof(f503,plain,
( ssItem(sK4(sK11(sK2),nil,nil))
| ~ singletonP(sK2) ),
inference(forward_subsumption_resolution,[],[f502,f163]) ).
fof(f504,plain,
ssItem(sK4(sK11(sK2),nil,nil)),
inference(forward_subsumption_resolution,[],[f503,f481]) ).
fof(f542,plain,
( memberP(nil,sK4(sK11(sK2),nil,nil))
| ~ ssList(sK2)
| ~ singletonP(sK2) ),
inference(equality_resolution,[],[f383]) ).
fof(f543,plain,
( memberP(nil,sK4(sK11(sK2),nil,nil))
| ~ singletonP(sK2) ),
inference(forward_subsumption_resolution,[],[f542,f163]) ).
fof(f544,plain,
memberP(nil,sK4(sK11(sK2),nil,nil)),
inference(forward_subsumption_resolution,[],[f543,f481]) ).
fof(f557,plain,
~ ssItem(sK4(sK11(sK2),nil,nil)),
inference(resolution,[],[f544,f202]) ).
fof(f559,plain,
$false,
inference(forward_subsumption_resolution,[],[f557,f504]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC229+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n017.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 08:30:06 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running first-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.55/0.87 % (3399697)Detected formulas, will run a generic FOF schedule.
% 2.55/0.87 % (3399708)dis-21_1_sil=8000:lcm=predicate:random_seed=2674724146: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.55/0.87 % (3399708)Instruction limit reached!
% 2.55/0.87 % (3399708)------------------------------
% 2.55/0.87 % (3399708)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/0.87 % (3399708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/0.87 % (3399708)CaDiCaL version: 2.1.3
% 2.55/0.87 % (3399708)Termination reason: Instruction limit
% 2.55/0.87 % (3399708)Termination phase: Saturation
% 2.55/0.87 % (3399708)Time elapsed: 0.042 s
% 2.55/0.87 % (3399708)Peak memory usage: 91 MB
% 2.55/0.87 % (3399708)Instructions burned: 132 (million)
% 2.55/0.87 % (3399707)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=583885840:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.55/0.87 % (3399705)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=127995453:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.55/0.87 % (3399703)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=1157990219:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.55/0.87 % (3399706)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=704399428:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.55/0.87 % (3399704)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=3996518683:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.55/0.87 % (3399702)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=1054056937:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.55/0.87 % (3399706)First to succeed.
% 2.55/0.87 % (3399706)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3399697"
% 2.55/0.87 % (3399707)Also succeeded, but the first one will report.
% 2.55/0.87 % (3399705)Instruction limit reached!
% 2.55/0.87 % (3399705)------------------------------
% 2.55/0.87 % (3399705)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/0.87 % (3399705)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/0.87 % (3399705)CaDiCaL version: 2.1.3
% 2.55/0.87 % (3399705)Termination reason: Instruction limit
% 2.55/0.87 % (3399705)Termination phase: Saturation
% 2.55/0.87 % (3399705)Time elapsed: 0.074 s
% 2.55/0.87 % (3399705)Peak memory usage: 89 MB
% 2.55/0.87 % (3399705)Instructions burned: 110 (million)
% 2.55/0.87 % (3399716)lrs+10_1_sil=8000:sp=occurrence:random_seed=2995451198:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.55/0.87 % (3399716)Instruction limit reached!
% 2.55/0.87 % (3399716)------------------------------
% 2.55/0.87 % (3399716)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/0.87 % (3399716)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/0.87 % (3399716)CaDiCaL version: 2.1.3
% 2.55/0.87 % (3399716)Termination reason: Instruction limit
% 2.55/0.87 % (3399716)Termination phase: Saturation
% 2.55/0.87 % (3399716)Time elapsed: 0.094 s
% 2.55/0.87 % (3399716)Peak memory usage: 93 MB
% 2.55/0.87 % (3399716)Instructions burned: 286 (million)
% 2.55/0.87 % (3399717)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4629365:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.55/0.87 % (3399706)Refutation found. Thanks to Tanya!
% 2.55/0.87 % SZS status Theorem for theBenchmark
% 2.55/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 3.41/0.96 % (3399706)------------------------------
% 3.41/0.96 % (3399706)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.41/0.96 % (3399706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.41/0.96 % (3399706)CaDiCaL version: 2.1.3
% 3.41/0.96 % (3399706)Termination reason: Refutation
% 3.41/0.96 % (3399706)Time elapsed: 0.010 s
% 3.41/0.96 % (3399706)Peak memory usage: 88 MB
% 3.41/0.96 % (3399706)Instructions burned: 15 (million)
% 3.41/0.96 % (3399706)------------------------------
% 3.41/0.96 % (3399706)------------------------------
% 3.41/0.96 % (3399697)Success in time 0.439 s
% 3.41/0.96 % Vampire exiting
%------------------------------------------------------------------------------