%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC010+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 : 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:02:01 PM UTC 2026
% Result : Theorem 4.06s 1.23s
% Output : Refutation 4.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 73 ( 9 unt; 6 def)
% Number of atoms : 325 ( 61 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 409 ( 157 ~; 147 |; 86 &)
% ( 5 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 147 ( 0 sgn 112 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(X5,X6) = X0 ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(X8,X9) != X2
| ? [X10] :
( ssItem(X10)
& X7 != X10
& memberP(X3,X10)
& geq(X10,X7) ) ) ) ) ) )
& ( ~ neq(X1,nil)
| 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
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(X5,X6) = X0 ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(X8,X9) != X2
| ? [X10] :
( ssItem(X10)
& X7 != X10
& memberP(X3,X10)
& geq(X10,X7) ) ) ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(X5,X6) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(X8,X9) = X2
& ! [X10] :
( ~ ssItem(X10)
| X7 = X10
| ~ memberP(X3,X10)
| ~ geq(X10,X7) )
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ( neq(X1,nil)
& ~ 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
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(X5,X6) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(X8,X9) = X2
& ! [X10] :
( ~ ssItem(X10)
| X7 = X10
| ~ memberP(X3,X10)
| ~ geq(X10,X7) )
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f172,definition,
! [X1,X0,X3,X2] :
( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(X5,X6) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(X8,X9) = X2
& ! [X10] :
( ~ ssItem(X10)
| X7 = X10
| ~ memberP(X3,X10)
| ~ geq(X10,X7) )
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ~ sP0(X1,X0,X3,X2) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f173,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( sP0(X1,X0,X3,X2)
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f172]) ).
fof(f183,plain,
! [X1,X0,X3,X2] :
( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(X5,X6) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(X8,X9) = X2
& ! [X10] :
( ~ ssItem(X10)
| X7 = X10
| ~ memberP(X3,X10)
| ~ geq(X10,X7) )
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ~ sP0(X1,X0,X3,X2) ),
inference(nnf_transformation,[],[f172]) ).
fof(f184,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| app(X5,X6) != X1 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X2
& app(X8,X9) = X3
& ! [X10] :
( ~ ssItem(X10)
| X7 = X10
| ~ memberP(X2,X10)
| ~ geq(X10,X7) )
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) ) )
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f183]) ).
fof(f185,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| app(X5,X6) != X1 ) ) )
& app(app(sK8(X2,X3),cons(sK7(X2,X3),nil)),sK9(X2,X3)) = X2
& app(sK8(X2,X3),sK9(X2,X3)) = X3
& ! [X10] :
( ~ ssItem(X10)
| sK7(X2,X3) = X10
| ~ memberP(X2,X10)
| ~ geq(X10,sK7(X2,X3)) )
& ssList(sK9(X2,X3))
& ssList(sK8(X2,X3))
& ssItem(sK7(X2,X3)) )
| ~ sP0(X0,X1,X2,X3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK9]),skolemize(X7,sK7(X2,X3)),skolemize(X8,sK8(X2,X3)),skolemize(X9,sK9(X2,X3))],[f184]) ).
fof(f186,plain,
( sK11 = sK13
& sK10 = sK12
& ( sP0(sK11,sK10,sK13,sK12)
| ( neq(sK11,nil)
& ~ neq(sK13,nil) ) )
& ssList(sK13)
& ssList(sK12)
& ssList(sK11)
& ssList(sK10) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12),skolemize(X3,sK13)],[f173]) ).
fof(f243,plain,
! [X2,X3,X0,X1] :
( ssItem(sK7(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f185]) ).
fof(f244,plain,
! [X2,X3,X0,X1] :
( ssList(sK8(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f185]) ).
fof(f245,plain,
! [X2,X3,X0,X1] :
( ssList(sK9(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f185]) ).
fof(f247,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(sK8(X2,X3),sK9(X2,X3)) = X3 ),
inference(cnf_transformation,[],[f185]) ).
fof(f248,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(app(sK8(X2,X3),cons(sK7(X2,X3),nil)),sK9(X2,X3)) = X2 ),
inference(cnf_transformation,[],[f185]) ).
fof(f249,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| app(X5,X6) != X1
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f185]) ).
fof(f250,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X0,nil) ),
inference(cnf_transformation,[],[f185]) ).
fof(f255,plain,
( sP0(sK11,sK10,sK13,sK12)
| ~ neq(sK13,nil) ),
inference(cnf_transformation,[],[f186]) ).
fof(f256,plain,
( sP0(sK11,sK10,sK13,sK12)
| neq(sK11,nil) ),
inference(cnf_transformation,[],[f186]) ).
fof(f257,plain,
sK10 = sK12,
inference(cnf_transformation,[],[f186]) ).
fof(f258,plain,
sK11 = sK13,
inference(cnf_transformation,[],[f186]) ).
fof(f410,plain,
( sP0(sK13,sK12,sK13,sK12)
| neq(sK13,nil) ),
inference(definition_unfolding,[],[f256,f258,f257,f258]) ).
fof(f411,plain,
( sP0(sK13,sK12,sK13,sK12)
| ~ neq(sK13,nil) ),
inference(definition_unfolding,[],[f255,f258,f257]) ).
fof(f414,plain,
! [X2,X3,X1,X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(X5,X6) != X1
| ~ sP0(app(app(X5,cons(X4,nil)),X6),X1,X2,X3) ),
inference(equality_resolution,[],[f249]) ).
fof(f415,plain,
! [X2,X3,X6,X4,X5] :
( ~ sP0(app(app(X5,cons(X4,nil)),X6),app(X5,X6),X2,X3)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4) ),
inference(equality_resolution,[],[f414]) ).
fof(f446,definition,
( spl59_1
<=> neq(sK13,nil) ),
introduced(definition,[new_symbols(definition,[spl59_1])],[avatar_definition]) ).
fof(f450,definition,
( spl59_2
<=> sP0(sK13,sK12,sK13,sK12) ),
introduced(definition,[new_symbols(definition,[spl59_2])],[avatar_definition]) ).
fof(f452,plain,
( sP0(sK13,sK12,sK13,sK12)
| ~ spl59_2 ),
inference(avatar_component_clause,[],[f450]) ).
fof(f453,plain,
( ~ spl59_1
| spl59_2 ),
inference(avatar_split_clause,[],[f411,f450,f446]) ).
fof(f454,plain,
( spl59_1
| spl59_2 ),
inference(avatar_split_clause,[],[f410,f450,f446]) ).
fof(f455,plain,
( neq(sK13,nil)
| ~ spl59_2 ),
inference(resolution,[],[f250,f452]) ).
fof(f456,plain,
( spl59_1
| ~ spl59_2 ),
inference(avatar_split_clause,[],[f455,f450,f446]) ).
fof(f546,plain,
( sK12 = app(sK8(sK13,sK12),sK9(sK13,sK12))
| ~ spl59_2 ),
inference(resolution,[],[f247,f452]) ).
fof(f553,definition,
( spl59_3
<=> ssList(sK8(sK13,sK12)) ),
introduced(definition,[new_symbols(definition,[spl59_3])],[avatar_definition]) ).
fof(f554,plain,
( ssList(sK8(sK13,sK12))
| ~ spl59_3 ),
inference(avatar_component_clause,[],[f553]) ).
fof(f555,plain,
( ~ ssList(sK8(sK13,sK12))
| spl59_3 ),
inference(avatar_component_clause,[],[f553]) ).
fof(f557,definition,
( spl59_4
<=> ssList(sK9(sK13,sK12)) ),
introduced(definition,[new_symbols(definition,[spl59_4])],[avatar_definition]) ).
fof(f558,plain,
( ssList(sK9(sK13,sK12))
| ~ spl59_4 ),
inference(avatar_component_clause,[],[f557]) ).
fof(f559,plain,
( ~ ssList(sK9(sK13,sK12))
| spl59_4 ),
inference(avatar_component_clause,[],[f557]) ).
fof(f592,plain,
( ! [X0,X1] : ~ sP0(X0,X1,sK13,sK12)
| spl59_3 ),
inference(resolution,[],[f555,f244]) ).
fof(f599,plain,
( $false
| ~ spl59_2
| spl59_3 ),
inference(resolution,[],[f592,f452]) ).
fof(f600,plain,
( ~ spl59_2
| spl59_3 ),
inference(avatar_contradiction_clause,[],[f599]) ).
fof(f612,plain,
( ! [X0,X1] : ~ sP0(X0,X1,sK13,sK12)
| spl59_4 ),
inference(resolution,[],[f559,f245]) ).
fof(f622,plain,
( $false
| ~ spl59_2
| spl59_4 ),
inference(resolution,[],[f612,f452]) ).
fof(f623,plain,
( ~ spl59_2
| spl59_4 ),
inference(avatar_contradiction_clause,[],[f622]) ).
fof(f1389,plain,
( sK13 = app(app(sK8(sK13,sK12),cons(sK7(sK13,sK12),nil)),sK9(sK13,sK12))
| ~ spl59_2 ),
inference(resolution,[],[f248,f452]) ).
fof(f1751,definition,
( spl59_45
<=> ssItem(sK7(sK13,sK12)) ),
introduced(definition,[new_symbols(definition,[spl59_45])],[avatar_definition]) ).
fof(f1752,plain,
( ssItem(sK7(sK13,sK12))
| ~ spl59_45 ),
inference(avatar_component_clause,[],[f1751]) ).
fof(f1753,plain,
( ~ ssItem(sK7(sK13,sK12))
| spl59_45 ),
inference(avatar_component_clause,[],[f1751]) ).
fof(f1762,plain,
( ! [X0,X1] : ~ sP0(X0,X1,sK13,sK12)
| spl59_45 ),
inference(resolution,[],[f1753,f243]) ).
fof(f1764,plain,
( ! [X0,X1] :
( ~ sP0(sK13,app(sK8(sK13,sK12),sK9(sK13,sK12)),X0,X1)
| ~ ssList(sK8(sK13,sK12))
| ~ ssList(sK9(sK13,sK12))
| ~ ssItem(sK7(sK13,sK12)) )
| ~ spl59_2 ),
inference(superposition,[],[f415,f1389]) ).
fof(f1874,plain,
( $false
| ~ spl59_2
| spl59_45 ),
inference(resolution,[],[f1762,f452]) ).
fof(f1875,plain,
( ~ spl59_2
| spl59_45 ),
inference(avatar_contradiction_clause,[],[f1874]) ).
fof(f1876,plain,
( ! [X0,X1] :
( ~ sP0(sK13,app(sK8(sK13,sK12),sK9(sK13,sK12)),X0,X1)
| ~ ssList(sK9(sK13,sK12))
| ~ ssItem(sK7(sK13,sK12)) )
| ~ spl59_2
| ~ spl59_3 ),
inference(forward_subsumption_resolution,[],[f1764,f554]) ).
fof(f1877,plain,
( ! [X0,X1] :
( ~ sP0(sK13,app(sK8(sK13,sK12),sK9(sK13,sK12)),X0,X1)
| ~ ssItem(sK7(sK13,sK12)) )
| ~ spl59_2
| ~ spl59_3
| ~ spl59_4 ),
inference(forward_subsumption_resolution,[],[f1876,f558]) ).
fof(f1878,plain,
( ! [X0,X1] : ~ sP0(sK13,app(sK8(sK13,sK12),sK9(sK13,sK12)),X0,X1)
| ~ spl59_2
| ~ spl59_3
| ~ spl59_4
| ~ spl59_45 ),
inference(forward_subsumption_resolution,[],[f1877,f1752]) ).
fof(f1879,plain,
( ! [X0,X1] : ~ sP0(sK13,sK12,X0,X1)
| ~ spl59_2
| ~ spl59_3
| ~ spl59_4
| ~ spl59_45 ),
inference(forward_demodulation,[],[f1878,f546]) ).
fof(f1897,plain,
( $false
| ~ spl59_2
| ~ spl59_3
| ~ spl59_4
| ~ spl59_45 ),
inference(resolution,[],[f1879,f452]) ).
fof(f1898,plain,
( ~ spl59_2
| ~ spl59_3
| ~ spl59_4
| ~ spl59_45 ),
inference(avatar_contradiction_clause,[],[f1897]) ).
cnf(s1,plain,
( ~ spl59_1
| spl59_2 ),
inference(sat_conversion,[],[f453]) ).
cnf(s2,plain,
( spl59_1
| spl59_2 ),
inference(sat_conversion,[],[f454]) ).
cnf(s3,plain,
( spl59_1
| ~ spl59_2 ),
inference(sat_conversion,[],[f456]) ).
cnf(s8,plain,
( ~ spl59_2
| spl59_3 ),
inference(sat_conversion,[],[f600]) ).
cnf(s9,plain,
( ~ spl59_2
| spl59_4 ),
inference(sat_conversion,[],[f623]) ).
cnf(s73,plain,
( ~ spl59_2
| spl59_45 ),
inference(sat_conversion,[],[f1875]) ).
cnf(s74,plain,
( ~ spl59_2
| ~ spl59_3
| ~ spl59_4
| ~ spl59_45 ),
inference(sat_conversion,[],[f1898]) ).
cnf(s90,plain,
spl59_1,
inference(rat,[],[s2,s3]) ).
cnf(s91,plain,
spl59_2,
inference(rat,[],[s1,s90]) ).
cnf(s92,plain,
spl59_45,
inference(rat,[],[s73,s91]) ).
cnf(s93,plain,
spl59_4,
inference(rat,[],[s9,s91]) ).
cnf(s94,plain,
spl59_3,
inference(rat,[],[s8,s91]) ).
cnf(s95,plain,
$false,
inference(rat,[],[s74,s92,s93,s91,s94]) ).
fof(f1899,plain,
$false,
inference(avatar_sat_refutation,[],[s95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC010+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.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:25:55 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 4.06/1.23 % (2075779)Detected formulas, will run a generic FOF schedule.
% 4.06/1.23 % (2075789)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1524437010:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.06/1.23 % (2075784)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=1267908150:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.06/1.23 % (2075788)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=780701551:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.06/1.23 % (2075790)dis-21_1_sil=8000:lcm=predicate:random_seed=440993496: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)
% 4.06/1.23 % (2075786)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=494191762:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.06/1.23 % (2075787)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2664402852:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.06/1.23 % (2075785)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=2541308853:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.06/1.23 % (2075787)Instruction limit reached!
% 4.06/1.23 % (2075787)------------------------------
% 4.06/1.23 % (2075787)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.06/1.23 % (2075787)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.23 % (2075787)CaDiCaL version: 2.1.3
% 4.06/1.23 % (2075787)Termination reason: Instruction limit
% 4.06/1.23 % (2075787)Termination phase: Saturation
% 4.06/1.23 % (2075787)Time elapsed: 0.068 s
% 4.06/1.23 % (2075787)Peak memory usage: 89 MB
% 4.06/1.23 % (2075787)Instructions burned: 109 (million)
% 4.06/1.23 % (2075790)Instruction limit reached!
% 4.06/1.23 % (2075790)------------------------------
% 4.06/1.23 % (2075790)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.06/1.23 % (2075790)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.23 % (2075790)CaDiCaL version: 2.1.3
% 4.06/1.23 % (2075790)Termination reason: Instruction limit
% 4.06/1.23 % (2075790)Termination phase: Saturation
% 4.06/1.23 % (2075790)Time elapsed: 0.071 s
% 4.06/1.23 % (2075790)Peak memory usage: 90 MB
% 4.06/1.23 % (2075790)Instructions burned: 129 (million)
% 4.06/1.23 % (2075788)Instruction limit reached!
% 4.06/1.23 % (2075788)------------------------------
% 4.06/1.23 % (2075788)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.06/1.23 % (2075788)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.23 % (2075788)CaDiCaL version: 2.1.3
% 4.06/1.23 % (2075788)Termination reason: Instruction limit
% 4.06/1.23 % (2075788)Termination phase: Saturation
% 4.06/1.23 % (2075788)Time elapsed: 0.071 s
% 4.06/1.23 % (2075788)Peak memory usage: 89 MB
% 4.06/1.23 % (2075788)Instructions burned: 120 (million)
% 4.06/1.23 % (2075789)Instruction limit reached!
% 4.06/1.23 % (2075789)------------------------------
% 4.06/1.23 % (2075789)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.06/1.23 % (2075789)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.23 % (2075789)CaDiCaL version: 2.1.3
% 4.06/1.23 % (2075789)Termination reason: Instruction limit
% 4.06/1.23 % (2075789)Termination phase: Saturation
% 4.06/1.23 % (2075789)Time elapsed: 0.088 s
% 4.06/1.23 % (2075789)Peak memory usage: 90 MB
% 4.06/1.23 % (2075789)Instructions burned: 140 (million)
% 4.06/1.23 % (2075799)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2381427190:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.06/1.23 % (2075800)lrs+1011_1_sil=32000:sp=occurrence:random_seed=68189601:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.06/1.23 % (2075798)lrs+10_1_sil=8000:sp=occurrence:random_seed=60167676:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.06/1.23 % (2075801)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=3802413922:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.06/1.23 % (2075800)First to succeed.
% 4.06/1.23 % (2075800)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2075779"
% 4.06/1.23 % (2075799)Instruction limit reached!
% 4.06/1.23 % (2075799)------------------------------
% 4.06/1.23 % (2075799)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.06/1.23 % (2075799)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.23 % (2075799)CaDiCaL version: 2.1.3
% 4.06/1.23 % (2075799)Termination reason: Instruction limit
% 4.06/1.23 % (2075799)Termination phase: Saturation
% 4.06/1.23 % (2075799)Time elapsed: 0.075 s
% 4.06/1.23 % (2075799)Peak memory usage: 92 MB
% 4.06/1.23 % (2075799)Instructions burned: 158 (million)
% 4.06/1.23 % (2075801)Instruction limit reached!
% 4.06/1.23 % (2075801)------------------------------
% 4.06/1.23 % (2075801)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.06/1.23 % (2075801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.23 % (2075801)CaDiCaL version: 2.1.3
% 4.06/1.23 % (2075801)Termination reason: Instruction limit
% 4.06/1.23 % (2075801)Termination phase: Saturation
% 4.06/1.23 % (2075801)Time elapsed: 0.090 s
% 4.06/1.23 % (2075801)Peak memory usage: 94 MB
% 4.06/1.23 % (2075801)Instructions burned: 248 (million)
% 4.06/1.23 % (2075798)Also succeeded, but the first one will report.
% 4.06/1.23 % (2075806)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2017791359:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.06/1.23 % (2075807)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=514234120:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 4.06/1.23 % (2075800)Refutation found. Thanks to Tanya!
% 4.06/1.23 % SZS status Theorem for theBenchmark
% 4.06/1.23 % SZS output start Proof for theBenchmark
% See solution above
% 4.81/1.42 % (2075800)------------------------------
% 4.81/1.42 % (2075800)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.81/1.42 % (2075800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.81/1.42 % (2075800)CaDiCaL version: 2.1.3
% 4.81/1.42 % (2075800)Termination reason: Refutation
% 4.81/1.42 % (2075800)Time elapsed: 0.045 s
% 4.81/1.42 % (2075800)Peak memory usage: 90 MB
% 4.81/1.42 % (2075800)Instructions burned: 69 (million)
% 4.81/1.42 % (2075800)------------------------------
% 4.81/1.42 % (2075800)------------------------------
% 4.81/1.42 % (2075779)Success in time 0.628 s
% 4.81/1.42 % Vampire exiting
%------------------------------------------------------------------------------