%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC227+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:01 PM UTC 2026
% Result : Theorem 5.99s 1.76s
% Output : Refutation 7.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 8
% Syntax : Number of formulae : 63 ( 13 unt; 1 def)
% Number of atoms : 332 ( 103 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 458 ( 189 ~; 175 |; 78 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 141 ( 0 sgn 106 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/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)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(X8,X2),X9) != X3
| ~ totalorderedP(X2)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(X11,cons(X10,nil)) = X8
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(cons(X12,nil),X13) = X2
& leq(X10,X12) ) ) ) )
| ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& app(cons(X14,nil),X15) = X9
& ? [X16] :
( ssItem(X16)
& ? [X17] :
( ssList(X17)
& app(X17,cons(X16,nil)) = X2
& leq(X16,X14) ) ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ),
file('/export/starexec/sandbox/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)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(X8,X2),X9) != X3
| ~ totalorderedP(X2)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(X11,cons(X10,nil)) = X8
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(cons(X12,nil),X13) = X2
& leq(X10,X12) ) ) ) )
| ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& app(cons(X14,nil),X15) = X9
& ? [X16] :
( ssItem(X16)
& ? [X17] :
( ssList(X17)
& app(X17,cons(X16,nil)) = X2
& leq(X16,X14) ) ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [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)
& leq(X4,X7)
& ~ leq(X7,X4) ) ) ) )
& ? [X8] :
( ? [X9] :
( ssList(X9)
& app(app(X8,X2),X9) = X3
& totalorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X8
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != X2
| ~ leq(X10,X12) ) ) ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| app(cons(X14,nil),X15) != X9
| ! [X16] :
( ~ ssItem(X16)
| ! [X17] :
( ~ ssList(X17)
| app(X17,cons(X16,nil)) != X2
| ~ leq(X16,X14) ) ) ) ) )
& ssList(X8) )
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f117,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f118,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f117]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f157,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f162,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f183,plain,
( ssList(sK9)
& sK7 = sK9
& sK6 = sK8
& nil != sK6
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK6
| ( ssItem(sK10(X4,X5,X6))
& memberP(X5,sK10(X4,X5,X6))
& memberP(X6,sK10(X4,X5,X6))
& leq(X4,sK10(X4,X5,X6))
& ~ leq(sK10(X4,X5,X6),X4) ) ) ) )
& ssList(sK12)
& sK9 = app(app(sK11,sK8),sK12)
& totalorderedP(sK8)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != sK11
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != sK8
| ~ leq(X10,X12) ) ) ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| app(cons(X14,nil),X15) != sK12
| ! [X16] :
( ~ ssItem(X16)
| ! [X17] :
( ~ ssList(X17)
| app(X17,cons(X16,nil)) != sK8
| ~ leq(X16,X14) ) ) ) )
& ssList(sK11)
& ( nil = sK9
| nil != sK8 )
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11,sK12]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9),skolemize(X7,sK10(X4,X5,X6)),skolemize(X8,sK11),skolemize(X9,sK12)],[f98]) ).
fof(f193,plain,
! [X0] :
( nil = X0
| ( ssList(sK15(X0))
& ssItem(sK16(X0))
& cons(sK16(X0),sK15(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16]),skolemize(X1,sK15(X0)),skolemize(X2,sK16(X0))],[f118]) ).
fof(f240,plain,
ssList(sK6),
inference(cnf_transformation,[],[f183]) ).
fof(f253,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK6
| memberP(X5,sK10(X4,X5,X6)) ),
inference(cnf_transformation,[],[f183]) ).
fof(f254,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK6
| ssItem(sK10(X4,X5,X6)) ),
inference(cnf_transformation,[],[f183]) ).
fof(f255,plain,
nil != sK6,
inference(cnf_transformation,[],[f183]) ).
fof(f256,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f183]) ).
fof(f262,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f291,plain,
! [X0] :
( cons(sK16(X0),sK15(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f193]) ).
fof(f292,plain,
! [X0] :
( ssItem(sK16(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f193]) ).
fof(f293,plain,
! [X0] :
( ssList(sK15(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f193]) ).
fof(f297,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f387,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f399,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f400,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f412,plain,
nil != sK8,
inference(definition_unfolding,[],[f255,f256]) ).
fof(f413,plain,
! [X6,X4,X5] :
( ssItem(sK10(X4,X5,X6))
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK8
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f254,f256]) ).
fof(f414,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK8
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| memberP(X5,sK10(X4,X5,X6)) ),
inference(definition_unfolding,[],[f253,f256]) ).
fof(f419,plain,
ssList(sK8),
inference(definition_unfolding,[],[f240,f256]) ).
fof(f448,definition,
( spl58_1
<=> nil = sK8 ),
introduced(definition,[new_symbols(definition,[spl58_1])],[avatar_definition]) ).
fof(f450,plain,
( nil != sK8
| spl58_1 ),
inference(avatar_component_clause,[],[f448]) ).
fof(f456,plain,
~ spl58_1,
inference(avatar_split_clause,[],[f412,f448]) ).
fof(f474,plain,
! [X0,X1] :
( sK8 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK10(X0,nil,X1))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f414,f387]) ).
fof(f475,plain,
! [X0,X1] :
( sK8 != app(cons(X0,nil),X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssItem(X0)
| memberP(nil,sK10(X0,nil,X1)) ),
inference(forward_subsumption_resolution,[],[f474,f297]) ).
fof(f479,plain,
! [X0,X1] :
( memberP(nil,sK10(X0,nil,X1))
| ~ ssList(X1)
| ~ ssItem(X0)
| sK8 != app(cons(X0,nil),X1) ),
inference(forward_subsumption_resolution,[],[f475,f399]) ).
fof(f483,plain,
! [X0,X1] :
( ~ ssItem(sK10(X1,nil,X0))
| ~ ssItem(X1)
| app(cons(X1,nil),X0) != sK8
| ~ ssList(X0) ),
inference(resolution,[],[f479,f400]) ).
fof(f484,plain,
! [X0,X1] :
( ~ ssItem(X0)
| sK8 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X1)
| sK8 != app(app(nil,cons(X0,nil)),X1)
| ~ ssItem(X0) ),
inference(resolution,[],[f483,f413]) ).
fof(f485,plain,
! [X0,X1] :
( ~ ssItem(X0)
| sK8 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssList(nil)
| sK8 != app(app(nil,cons(X0,nil)),X1) ),
inference(duplicate_literal_removal,[],[f484]) ).
fof(f486,plain,
! [X0,X1] :
( sK8 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| sK8 != app(app(nil,cons(X0,nil)),X1) ),
inference(forward_subsumption_resolution,[],[f485,f399]) ).
fof(f554,plain,
! [X0,X1] :
( cons(X0,X1) != sK8
| ~ ssItem(X0)
| ~ ssList(X1)
| sK8 != app(app(nil,cons(X0,nil)),X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f486,f262]) ).
fof(f573,plain,
! [X0,X1] :
( sK8 != app(app(nil,cons(X0,nil)),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) != sK8 ),
inference(duplicate_literal_removal,[],[f554]) ).
fof(f578,plain,
! [X0,X1] :
( ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) != sK8
| sK8 != app(cons(X0,nil),X1) ),
inference(superposition,[],[f573,f387]) ).
fof(f594,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) != sK8
| sK8 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(nil) ),
inference(resolution,[],[f578,f297]) ).
fof(f595,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) != sK8
| sK8 != app(cons(X0,nil),X1)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f594]) ).
fof(f596,plain,
! [X0,X1] :
( sK8 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| cons(X0,X1) != sK8
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[],[f595,f399]) ).
fof(f611,plain,
! [X0,X1] :
( cons(X0,X1) != sK8
| ~ ssList(X1)
| cons(X0,X1) != sK8
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f596,f262]) ).
fof(f614,plain,
! [X0,X1] :
( cons(X0,X1) != sK8
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f611]) ).
fof(f3344,plain,
! [X0] :
( sK8 != X0
| ~ ssList(sK15(X0))
| ~ ssItem(sK16(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f614,f291]) ).
fof(f3345,plain,
! [X0] :
( sK8 != X0
| ~ ssItem(sK16(X0))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f3344,f293]) ).
fof(f3347,plain,
! [X0] :
( sK8 != X0
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f3345,f292]) ).
fof(f4358,plain,
( nil = sK8
| ~ ssList(sK8) ),
inference(equality_resolution,[],[f3347]) ).
fof(f4359,plain,
( ~ ssList(sK8)
| spl58_1 ),
inference(forward_subsumption_resolution,[],[f4358,f450]) ).
fof(f4360,plain,
( $false
| spl58_1 ),
inference(forward_subsumption_resolution,[],[f4359,f419]) ).
fof(f4361,plain,
spl58_1,
inference(avatar_contradiction_clause,[],[f4360]) ).
cnf(s2,plain,
~ spl58_1,
inference(sat_conversion,[],[f456]) ).
cnf(s153,plain,
spl58_1,
inference(sat_conversion,[],[f4361]) ).
cnf(s203,plain,
$false,
inference(rat,[],[s2,s153]) ).
fof(f4362,plain,
$false,
inference(avatar_sat_refutation,[],[s203]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC227+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n010.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 08:34:43 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running first-order theorem proving
% 0.10/0.21 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.99/1.76 % (1773315)Detected formulas, will run a generic FOF schedule.
% 5.99/1.76 % (1773348)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=2445344453:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.99/1.76 % (1773352)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2739720619:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.99/1.76 % (1773349)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=3824698973:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.99/1.76 % (1773350)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=881080191:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.99/1.76 % (1773351)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1488916865:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.99/1.76 % (1773353)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2206318075:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.99/1.76 % (1773354)dis-21_1_sil=8000:lcm=predicate:random_seed=1271864769: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)
% 5.99/1.76 % (1773352)Instruction limit reached!
% 5.99/1.76 % (1773352)------------------------------
% 5.99/1.76 % (1773352)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/1.76 % (1773352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/1.76 % (1773352)CaDiCaL version: 2.1.3
% 5.99/1.76 % (1773352)Termination reason: Instruction limit
% 5.99/1.76 % (1773352)Termination phase: Saturation
% 5.99/1.76 % (1773352)Time elapsed: 0.127 s
% 5.99/1.76 % (1773352)Peak memory usage: 88 MB
% 5.99/1.76 % (1773352)Instructions burned: 119 (million)
% 5.99/1.76 % (1773351)Instruction limit reached!
% 5.99/1.76 % (1773351)------------------------------
% 5.99/1.76 % (1773351)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/1.76 % (1773351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/1.76 % (1773351)CaDiCaL version: 2.1.3
% 5.99/1.76 % (1773351)Termination reason: Instruction limit
% 5.99/1.76 % (1773351)Termination phase: Saturation
% 5.99/1.76 % (1773351)Time elapsed: 0.098 s
% 5.99/1.76 % (1773351)Peak memory usage: 89 MB
% 5.99/1.76 % (1773351)Instructions burned: 110 (million)
% 5.99/1.76 % (1773353)Instruction limit reached!
% 5.99/1.76 % (1773353)------------------------------
% 5.99/1.76 % (1773353)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/1.76 % (1773353)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/1.76 % (1773353)CaDiCaL version: 2.1.3
% 5.99/1.76 % (1773353)Termination reason: Instruction limit
% 5.99/1.76 % (1773353)Termination phase: Saturation
% 5.99/1.76 % (1773353)Time elapsed: 0.124 s
% 5.99/1.76 % (1773353)Peak memory usage: 90 MB
% 5.99/1.76 % (1773353)Instructions burned: 139 (million)
% 5.99/1.76 % (1773354)Instruction limit reached!
% 5.99/1.76 % (1773354)------------------------------
% 5.99/1.76 % (1773354)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/1.76 % (1773354)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/1.76 % (1773354)CaDiCaL version: 2.1.3
% 5.99/1.76 % (1773354)Termination reason: Instruction limit
% 5.99/1.76 % (1773354)Termination phase: Saturation
% 5.99/1.76 % (1773354)Time elapsed: 0.122 s
% 5.99/1.76 % (1773354)Peak memory usage: 91 MB
% 5.99/1.76 % (1773354)Instructions burned: 130 (million)
% 5.99/1.76 % (1773370)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3641183945:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 5.99/1.76 % (1773368)lrs+10_1_sil=8000:sp=occurrence:random_seed=3724714001:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 5.99/1.76 % (1773371)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2409242061:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 5.99/1.76 % (1773372)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1600533649:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 5.99/1.76 % (1773370)Instruction limit reached!
% 5.99/1.76 % (1773370)------------------------------
% 5.99/1.76 % (1773370)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/1.76 % (1773370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/1.76 % (1773370)CaDiCaL version: 2.1.3
% 5.99/1.76 % (1773370)Termination reason: Instruction limit
% 5.99/1.76 % (1773370)Termination phase: Saturation
% 5.99/1.76 % (1773370)Time elapsed: 0.144 s
% 5.99/1.76 % (1773370)Peak memory usage: 94 MB
% 5.99/1.76 % (1773370)Instructions burned: 158 (million)
% 5.99/1.76 % (1773371)First to succeed.
% 5.99/1.76 % (1773371)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1773315"
% 5.99/1.76 % (1773368)Instruction limit reached!
% 5.99/1.76 % (1773368)------------------------------
% 5.99/1.76 % (1773368)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/1.76 % (1773368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/1.76 % (1773368)CaDiCaL version: 2.1.3
% 5.99/1.76 % (1773368)Termination reason: Instruction limit
% 5.99/1.76 % (1773368)Termination phase: Saturation
% 5.99/1.76 % (1773368)Time elapsed: 0.236 s
% 5.99/1.76 % (1773368)Peak memory usage: 93 MB
% 5.99/1.76 % (1773368)Instructions burned: 285 (million)
% 5.99/1.76 % (1773372)Instruction limit reached!
% 5.99/1.76 % (1773372)------------------------------
% 5.99/1.76 % (1773372)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/1.76 % (1773372)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/1.76 % (1773372)CaDiCaL version: 2.1.3
% 5.99/1.76 % (1773372)Termination reason: Instruction limit
% 5.99/1.76 % (1773372)Termination phase: Saturation
% 5.99/1.76 % (1773372)Time elapsed: 0.182 s
% 5.99/1.76 % (1773372)Peak memory usage: 96 MB
% 5.99/1.76 % (1773372)Instructions burned: 250 (million)
% 5.99/1.76 % (1773382)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=401960066:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 5.99/1.76 % (1773384)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1197043170:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 5.99/1.76 % (1773383)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=936912211:i=2350_2992 on theBenchmark for (2992ds/2350Mi)
% 5.99/1.76 % (1773349)Also succeeded, but the first one will report.
% 5.99/1.76 % (1773384)Instruction limit reached!
% 5.99/1.76 % (1773384)------------------------------
% 5.99/1.76 % (1773384)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/1.76 % (1773384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/1.76 % (1773384)CaDiCaL version: 2.1.3
% 5.99/1.76 % (1773384)Termination reason: Instruction limit
% 5.99/1.76 % (1773384)Termination phase: Saturation
% 5.99/1.76 % (1773384)Time elapsed: 0.072 s
% 5.99/1.76 % (1773384)Peak memory usage: 90 MB
% 5.99/1.76 % (1773384)Instructions burned: 114 (million)
% 5.99/1.76 % (1773371)Refutation found. Thanks to Tanya!
% 5.99/1.76 % SZS status Theorem for theBenchmark
% 5.99/1.76 % SZS output start Proof for theBenchmark
% See solution above
% 7.72/1.95 % (1773371)------------------------------
% 7.72/1.95 % (1773371)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.72/1.95 % (1773371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.72/1.95 % (1773371)CaDiCaL version: 2.1.3
% 7.72/1.95 % (1773371)Termination reason: Refutation
% 7.72/1.95 % (1773371)Time elapsed: 0.178 s
% 7.72/1.95 % (1773371)Peak memory usage: 92 MB
% 7.72/1.95 % (1773371)Instructions burned: 188 (million)
% 7.72/1.95 % (1773371)------------------------------
% 7.72/1.95 % (1773371)------------------------------
% 7.72/1.95 % (1773315)Success in time 0.999 s
% 7.72/1.95 % Vampire exiting
%------------------------------------------------------------------------------