%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC240+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 : n015.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:05 PM UTC 2026
% Result : Theorem 2.98s 1.08s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 8
% Syntax : Number of formulae : 75 ( 12 unt; 0 def)
% Number of atoms : 344 ( 82 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 452 ( 183 ~; 182 |; 63 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 126 ( 100 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax37) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != 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)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) ) )
| ! [X8] :
( ssItem(X8)
=> ? [X9] :
( ssItem(X9)
& X8 != X9
& memberP(X2,X9) ) ) ) ) ) ) ),
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
| 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)
| ~ lt(X4,X7)
| leq(X4,X7) ) ) ) ) )
| ! [X8] :
( ssItem(X8)
=> ? [X9] :
( ssItem(X9)
& X8 != X9
& memberP(X2,X9) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = 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)
& lt(X4,X7)
& ~ leq(X4,X7)
& ssItem(X7) ) ) ) )
& ? [X8] :
( ! [X9] :
( ~ ssItem(X9)
| X8 = X9
| ~ memberP(X2,X9) )
& ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = 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)
& lt(X4,X7)
& ~ leq(X4,X7)
& ssItem(X7) ) ) ) )
& ? [X8] :
( ! [X9] :
( ~ ssItem(X9)
| X8 = X9
| ~ memberP(X2,X9) )
& ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f101,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f102,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f115,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f118,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f137,plain,
( sK1 = sK3
& sK0 = 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))
& lt(X4,sK4(X4,X5,X6))
& ~ leq(X4,sK4(X4,X5,X6))
& ssItem(sK4(X4,X5,X6)) ) ) ) )
& ! [X9] :
( ~ ssItem(X9)
| sK5 = X9
| ~ memberP(sK2,X9) )
& ssItem(sK5)
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X7,sK4(X4,X5,X6)),skolemize(X8,sK5)],[f99]) ).
fof(f139,plain,
! [X0] :
( nil = X0
| ( ssList(sK8(X0))
& ssItem(sK9(X0))
& cons(sK9(X0),sK8(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X1,sK8(X0)),skolemize(X2,sK9(X0))],[f102]) ).
fof(f142,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f143,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f142]) ).
fof(f153,plain,
ssList(sK2),
inference(cnf_transformation,[],[f137]) ).
fof(f155,plain,
ssItem(sK5),
inference(cnf_transformation,[],[f137]) ).
fof(f156,plain,
! [X9] :
( ~ memberP(sK2,X9)
| sK5 = X9
| ~ ssItem(X9) ),
inference(cnf_transformation,[],[f137]) ).
fof(f157,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,[],[f137]) ).
fof(f161,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,[],[f137]) ).
fof(f162,plain,
nil != sK0,
inference(cnf_transformation,[],[f137]) ).
fof(f163,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f137]) ).
fof(f169,plain,
! [X0] :
( cons(sK9(X0),sK8(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f170,plain,
! [X0] :
( ssItem(sK9(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f171,plain,
! [X0] :
( ssList(sK8(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f175,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f181,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f184,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f187,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f188,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f191,plain,
! [X2,X0,X1] :
( memberP(cons(X1,X2),X0)
| X0 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f210,plain,
nil != sK2,
inference(definition_unfolding,[],[f162,f163]) ).
fof(f211,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,[],[f161,f163]) ).
fof(f215,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,[],[f157,f163]) ).
fof(f220,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f191]) ).
fof(f224,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f220]) ).
fof(f239,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,[],[f211,f184]) ).
fof(f240,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f215,f184]) ).
fof(f241,plain,
! [X0,X1] :
( sK2 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f240,f187]) ).
fof(f242,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,[],[f239,f187]) ).
fof(f276,plain,
! [X0] :
( memberP(X0,sK9(X0))
| ~ ssList(sK8(X0))
| ~ ssItem(sK9(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f224,f169]) ).
fof(f281,plain,
! [X0] :
( memberP(X0,sK9(X0))
| ~ ssItem(sK9(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f276,f171]) ).
fof(f283,plain,
! [X0] :
( memberP(X0,sK9(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f281,f170]) ).
fof(f284,plain,
( nil = sK2
| ~ ssList(sK2)
| sK5 = sK9(sK2)
| ~ ssItem(sK9(sK2)) ),
inference(resolution,[],[f283,f156]) ).
fof(f286,plain,
( nil = sK2
| ~ ssList(sK2)
| sK5 = sK9(sK2) ),
inference(forward_subsumption_resolution,[],[f284,f170]) ).
fof(f287,plain,
( ~ ssList(sK2)
| sK5 = sK9(sK2) ),
inference(forward_subsumption_resolution,[],[f286,f210]) ).
fof(f288,plain,
sK5 = sK9(sK2),
inference(forward_subsumption_resolution,[],[f287,f153]) ).
fof(f292,plain,
( sK2 = cons(sK5,sK8(sK2))
| nil = sK2
| ~ ssList(sK2) ),
inference(superposition,[],[f169,f288]) ).
fof(f294,plain,
( sK2 = cons(sK5,sK8(sK2))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f292,f210]) ).
fof(f296,plain,
sK2 = cons(sK5,sK8(sK2)),
inference(forward_subsumption_resolution,[],[f294,f153]) ).
fof(f309,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f242,f181]) ).
fof(f310,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f241,f181]) ).
fof(f327,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| ssItem(sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f310]) ).
fof(f328,plain,
! [X0,X1] :
( cons(X0,X1) != sK2
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK4(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f309]) ).
fof(f344,plain,
( sK2 != sK2
| ~ ssList(sK8(sK2))
| ~ ssItem(sK5)
| ssItem(sK4(sK5,nil,sK8(sK2)))
| ~ ssList(cons(sK5,nil)) ),
inference(superposition,[],[f327,f296]) ).
fof(f345,plain,
( ~ ssList(sK8(sK2))
| ~ ssItem(sK5)
| ssItem(sK4(sK5,nil,sK8(sK2)))
| ~ ssList(cons(sK5,nil)) ),
inference(trivial_inequality_removal,[],[f344]) ).
fof(f346,plain,
( ssItem(sK4(sK5,nil,sK8(sK2)))
| ~ ssList(sK8(sK2))
| ~ ssList(cons(sK5,nil)) ),
inference(forward_subsumption_resolution,[],[f345,f155]) ).
fof(f354,plain,
( sK2 != sK2
| ~ ssList(sK8(sK2))
| ~ ssItem(sK5)
| memberP(nil,sK4(sK5,nil,sK8(sK2)))
| ~ ssList(cons(sK5,nil)) ),
inference(superposition,[],[f328,f296]) ).
fof(f355,plain,
( ~ ssList(sK8(sK2))
| ~ ssItem(sK5)
| memberP(nil,sK4(sK5,nil,sK8(sK2)))
| ~ ssList(cons(sK5,nil)) ),
inference(trivial_inequality_removal,[],[f354]) ).
fof(f356,plain,
( memberP(nil,sK4(sK5,nil,sK8(sK2)))
| ~ ssList(sK8(sK2))
| ~ ssList(cons(sK5,nil)) ),
inference(forward_subsumption_resolution,[],[f355,f155]) ).
fof(f359,plain,
( ~ ssList(sK8(sK2))
| ~ ssList(cons(sK5,nil))
| ~ ssItem(sK4(sK5,nil,sK8(sK2))) ),
inference(resolution,[],[f356,f188]) ).
fof(f360,plain,
( ~ ssList(cons(sK5,nil))
| ~ ssList(sK8(sK2)) ),
inference(forward_subsumption_resolution,[],[f359,f346]) ).
fof(f361,plain,
( ~ ssList(sK8(sK2))
| ~ ssItem(sK5)
| ~ ssList(nil) ),
inference(resolution,[],[f360,f175]) ).
fof(f362,plain,
( ~ ssList(sK8(sK2))
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f361,f155]) ).
fof(f363,plain,
~ ssList(sK8(sK2)),
inference(forward_subsumption_resolution,[],[f362,f187]) ).
fof(f369,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(resolution,[],[f363,f171]) ).
fof(f370,plain,
~ ssList(sK2),
inference(forward_subsumption_resolution,[],[f369,f210]) ).
fof(f371,plain,
$false,
inference(forward_subsumption_resolution,[],[f370,f153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC240+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n015.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 08:41:32 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/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.98/1.08 % (2474896)Detected formulas, will run a generic FOF schedule.
% 2.98/1.08 % (2474901)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=4264494020:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.98/1.08 % (2474905)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4266636038:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.98/1.08 % (2474905)First to succeed.
% 2.98/1.08 % (2474904)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3315100519:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.98/1.08 % (2474902)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=1918358771:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.98/1.08 % (2474903)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=2520574752:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.98/1.08 % (2474905)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2474896"
% 2.98/1.08 % (2474906)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2222254676:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.98/1.08 % (2474907)dis-21_1_sil=8000:lcm=predicate:random_seed=2988488492: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.98/1.08 % (2474906)Also succeeded, but the first one will report.
% 2.98/1.08 % (2474904)Instruction limit reached!
% 2.98/1.08 % (2474904)------------------------------
% 2.98/1.08 % (2474904)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.98/1.08 % (2474904)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.98/1.08 % (2474904)CaDiCaL version: 2.1.3
% 2.98/1.08 % (2474904)Termination reason: Instruction limit
% 2.98/1.08 % (2474904)Termination phase: Saturation
% 2.98/1.08 % (2474904)Time elapsed: 0.069 s
% 2.98/1.08 % (2474904)Peak memory usage: 89 MB
% 2.98/1.08 % (2474904)Instructions burned: 110 (million)
% 2.98/1.08 % (2474907)Instruction limit reached!
% 2.98/1.08 % (2474907)------------------------------
% 2.98/1.08 % (2474907)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.98/1.08 % (2474907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.98/1.08 % (2474907)CaDiCaL version: 2.1.3
% 2.98/1.08 % (2474907)Termination reason: Instruction limit
% 2.98/1.08 % (2474907)Termination phase: Saturation
% 2.98/1.08 % (2474907)Time elapsed: 0.072 s
% 2.98/1.08 % (2474907)Peak memory usage: 91 MB
% 2.98/1.08 % (2474907)Instructions burned: 130 (million)
% 2.98/1.08 % (2474915)lrs+10_1_sil=8000:sp=occurrence:random_seed=1147458471:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.98/1.08 % (2474916)lrs+10_1_sil=32000:urr=on:br=off:random_seed=915753141:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.98/1.08 % (2474905)Refutation found. Thanks to Tanya!
% 2.98/1.08 % SZS status Theorem for theBenchmark
% 2.98/1.08 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.28 % (2474905)------------------------------
% 3.48/1.28 % (2474905)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.28 % (2474905)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.28 % (2474905)CaDiCaL version: 2.1.3
% 3.48/1.28 % (2474905)Termination reason: Refutation
% 3.48/1.28 % (2474905)Time elapsed: 0.008 s
% 3.48/1.28 % (2474905)Peak memory usage: 88 MB
% 3.48/1.28 % (2474905)Instructions burned: 11 (million)
% 3.48/1.28 % (2474905)------------------------------
% 3.48/1.28 % (2474905)------------------------------
% 3.48/1.28 % (2474896)Success in time 0.409 s
% 3.48/1.28 % Vampire exiting
%------------------------------------------------------------------------------