%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC412+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:52 PM UTC 2026
% Result : Theorem 2.05s 1.84s
% Output : Refutation 6.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 49 ( 6 unt; 2 def)
% Number of atoms : 284 ( 74 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 359 ( 124 ~; 122 |; 91 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 16 ( 16 usr; 8 con; 0-2 aty)
% Number of variables : 191 ( 141 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(app(cons(X4,nil),cons(X5,nil)),X6) = X3 ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> app(app(cons(X7,nil),cons(X8,nil)),X9) != X1 ) ) ) )
& ( ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(app(cons(X11,nil),X12),cons(X10,nil)) != X2
& app(app(cons(X10,nil),X12),cons(X11,nil)) = X3 ) ) )
| ! [X13] :
( ssItem(X13)
=> ! [X14] :
( ssItem(X14)
=> ! [X15] :
( ssList(X15)
=> app(app(cons(X13,nil),cons(X14,nil)),X15) != X1 ) ) )
| ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssItem(X17)
=> ! [X18] :
( ~ ssList(X18)
| app(app(cons(X16,nil),X18),cons(X17,nil)) != X1
| app(app(cons(X17,nil),X18),cons(X16,nil)) = X0 ) ) ) ) ) ) ) ) ),
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
| ( ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(app(cons(X4,nil),cons(X5,nil)),X6) = X3 ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> app(app(cons(X7,nil),cons(X8,nil)),X9) != X1 ) ) ) )
& ( ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(app(cons(X11,nil),X12),cons(X10,nil)) != X2
& app(app(cons(X10,nil),X12),cons(X11,nil)) = X3 ) ) )
| ! [X13] :
( ssItem(X13)
=> ! [X14] :
( ssItem(X14)
=> ! [X15] :
( ssList(X15)
=> app(app(cons(X13,nil),cons(X14,nil)),X15) != X1 ) ) )
| ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssItem(X17)
=> ! [X18] :
( ~ ssList(X18)
| app(app(cons(X16,nil),X18),cons(X17,nil)) != X1
| app(app(cons(X17,nil),X18),cons(X16,nil)) = X0 ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ( ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(cons(X4,nil),cons(X5,nil)),X6) != X3 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(cons(X7,nil),cons(X8,nil)),X9) = X1
& ssList(X9) )
& ssItem(X8) )
& ssItem(X7) ) )
| ( ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssItem(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(cons(X11,nil),X12),cons(X10,nil)) = X2
| app(app(cons(X10,nil),X12),cons(X11,nil)) != X3 ) ) )
& ? [X13] :
( ? [X14] :
( ? [X15] :
( app(app(cons(X13,nil),cons(X14,nil)),X15) = X1
& ssList(X15) )
& ssItem(X14) )
& ssItem(X13) )
& ? [X16] :
( ? [X17] :
( ? [X18] :
( ssList(X18)
& app(app(cons(X16,nil),X18),cons(X17,nil)) = X1
& app(app(cons(X17,nil),X18),cons(X16,nil)) != X0 )
& ssItem(X17) )
& ssItem(X16) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f117,definition,
! [X1,X0] :
( ? [X16] :
( ? [X17] :
( ? [X18] :
( ssList(X18)
& app(app(cons(X16,nil),X18),cons(X17,nil)) = X1
& app(app(cons(X17,nil),X18),cons(X16,nil)) != X0 )
& ssItem(X17) )
& ssItem(X16) )
| ~ sP0(X1,X0) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f118,definition,
! [X2,X3,X1,X0] :
( ( ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssItem(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(cons(X11,nil),X12),cons(X10,nil)) = X2
| app(app(cons(X10,nil),X12),cons(X11,nil)) != X3 ) ) )
& ? [X13] :
( ? [X14] :
( ? [X15] :
( app(app(cons(X13,nil),cons(X14,nil)),X15) = X1
& ssList(X15) )
& ssItem(X14) )
& ssItem(X13) )
& sP0(X1,X0) )
| ~ sP1(X2,X3,X1,X0) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f119,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ( ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(cons(X4,nil),cons(X5,nil)),X6) != X3 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(cons(X7,nil),cons(X8,nil)),X9) = X1
& ssList(X9) )
& ssItem(X8) )
& ssItem(X7) ) )
| sP1(X2,X3,X1,X0) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f98,f118,f117]) ).
fof(f120,plain,
! [X2,X3,X1,X0] :
( ( ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssItem(X11)
| ! [X12] :
( ~ ssList(X12)
| app(app(cons(X11,nil),X12),cons(X10,nil)) = X2
| app(app(cons(X10,nil),X12),cons(X11,nil)) != X3 ) ) )
& ? [X13] :
( ? [X14] :
( ? [X15] :
( app(app(cons(X13,nil),cons(X14,nil)),X15) = X1
& ssList(X15) )
& ssItem(X14) )
& ssItem(X13) )
& sP0(X1,X0) )
| ~ sP1(X2,X3,X1,X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f121,plain,
! [X0,X1,X2,X3] :
( ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(cons(X5,nil),X6),cons(X4,nil)) = X0
| app(app(cons(X4,nil),X6),cons(X5,nil)) != X1 ) ) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(cons(X7,nil),cons(X8,nil)),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& ssItem(X7) )
& sP0(X2,X3) )
| ~ sP1(X0,X1,X2,X3) ),
inference(rectify,[],[f120]) ).
fof(f122,plain,
! [X0,X1,X2,X3] :
( ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(cons(X5,nil),X6),cons(X4,nil)) = X0
| app(app(cons(X4,nil),X6),cons(X5,nil)) != X1 ) ) )
& app(app(cons(sK2(X2),nil),cons(sK3(X2),nil)),sK4(X2)) = X2
& ssList(sK4(X2))
& ssItem(sK3(X2))
& ssItem(sK2(X2))
& sP0(X2,X3) )
| ~ sP1(X0,X1,X2,X3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X7,sK2(X2)),skolemize(X8,sK3(X2)),skolemize(X9,sK4(X2))],[f121]) ).
fof(f123,plain,
! [X1,X0] :
( ? [X16] :
( ? [X17] :
( ? [X18] :
( ssList(X18)
& app(app(cons(X16,nil),X18),cons(X17,nil)) = X1
& app(app(cons(X17,nil),X18),cons(X16,nil)) != X0 )
& ssItem(X17) )
& ssItem(X16) )
| ~ sP0(X1,X0) ),
inference(nnf_transformation,[],[f117]) ).
fof(f124,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& app(app(cons(X2,nil),X4),cons(X3,nil)) = X0
& app(app(cons(X3,nil),X4),cons(X2,nil)) != X1 )
& ssItem(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f123]) ).
fof(f125,plain,
! [X0,X1] :
( ( ssList(sK7(X0,X1))
& app(app(cons(sK5(X0,X1),nil),sK7(X0,X1)),cons(sK6(X0,X1),nil)) = X0
& app(app(cons(sK6(X0,X1),nil),sK7(X0,X1)),cons(sK5(X0,X1),nil)) != X1
& ssItem(sK6(X0,X1))
& ssItem(sK5(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X2,sK5(X0,X1)),skolemize(X3,sK6(X0,X1)),skolemize(X4,sK7(X0,X1))],[f124]) ).
fof(f126,plain,
( ssList(sK11)
& sK9 = sK11
& sK8 = sK10
& ( ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(cons(X4,nil),cons(X5,nil)),X6) != sK11 ) ) )
& sK9 = app(app(cons(sK12,nil),cons(sK13,nil)),sK14)
& ssList(sK14)
& ssItem(sK13)
& ssItem(sK12) )
| sP1(sK10,sK11,sK9,sK8) )
& ssList(sK10)
& ssList(sK9)
& ssList(sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12,sK13,sK14]),skolemize(X0,sK8),skolemize(X1,sK9),skolemize(X2,sK10),skolemize(X3,sK11),skolemize(X7,sK12),skolemize(X8,sK13),skolemize(X9,sK14)],[f119]) ).
fof(f131,plain,
! [X2,X3,X0,X1] :
( ~ sP1(X0,X1,X2,X3)
| sP0(X2,X3) ),
inference(cnf_transformation,[],[f122]) ).
fof(f136,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssItem(X5)
| ~ ssList(X6)
| app(app(cons(X5,nil),X6),cons(X4,nil)) = X0
| app(app(cons(X4,nil),X6),cons(X5,nil)) != X1
| ~ sP1(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f122]) ).
fof(f137,plain,
! [X0,X1] :
( ssItem(sK5(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f138,plain,
! [X0,X1] :
( ssItem(sK6(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f139,plain,
! [X0,X1] :
( app(app(cons(sK6(X0,X1),nil),sK7(X0,X1)),cons(sK5(X0,X1),nil)) != X1
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f140,plain,
! [X0,X1] :
( app(app(cons(sK5(X0,X1),nil),sK7(X0,X1)),cons(sK6(X0,X1),nil)) = X0
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f141,plain,
! [X0,X1] :
( ssList(sK7(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f145,plain,
( ssItem(sK12)
| sP1(sK10,sK11,sK9,sK8) ),
inference(cnf_transformation,[],[f126]) ).
fof(f146,plain,
( ssItem(sK13)
| sP1(sK10,sK11,sK9,sK8) ),
inference(cnf_transformation,[],[f126]) ).
fof(f147,plain,
( ssList(sK14)
| sP1(sK10,sK11,sK9,sK8) ),
inference(cnf_transformation,[],[f126]) ).
fof(f148,plain,
( sK9 = app(app(cons(sK12,nil),cons(sK13,nil)),sK14)
| sP1(sK10,sK11,sK9,sK8) ),
inference(cnf_transformation,[],[f126]) ).
fof(f149,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssItem(X5)
| ~ ssList(X6)
| app(app(cons(X4,nil),cons(X5,nil)),X6) != sK11
| sP1(sK10,sK11,sK9,sK8) ),
inference(cnf_transformation,[],[f126]) ).
fof(f150,plain,
sK8 = sK10,
inference(cnf_transformation,[],[f126]) ).
fof(f151,plain,
sK9 = sK11,
inference(cnf_transformation,[],[f126]) ).
fof(f176,plain,
! [X6,X4,X5] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != sK11
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| sP1(sK10,sK11,sK11,sK10) ),
inference(definition_unfolding,[],[f149,f151,f150]) ).
fof(f177,plain,
( sK11 = app(app(cons(sK12,nil),cons(sK13,nil)),sK14)
| sP1(sK10,sK11,sK11,sK10) ),
inference(definition_unfolding,[],[f148,f151,f151,f150]) ).
fof(f178,plain,
( sP1(sK10,sK11,sK11,sK10)
| ssList(sK14) ),
inference(definition_unfolding,[],[f147,f151,f150]) ).
fof(f179,plain,
( sP1(sK10,sK11,sK11,sK10)
| ssItem(sK13) ),
inference(definition_unfolding,[],[f146,f151,f150]) ).
fof(f180,plain,
( sP1(sK10,sK11,sK11,sK10)
| ssItem(sK12) ),
inference(definition_unfolding,[],[f145,f151,f150]) ).
fof(f183,plain,
! [X2,X3,X0,X6,X4,X5] :
( ~ sP1(X0,app(app(cons(X4,nil),X6),cons(X5,nil)),X2,X3)
| ~ ssItem(X5)
| ~ ssList(X6)
| app(app(cons(X5,nil),X6),cons(X4,nil)) = X0
| ~ ssItem(X4) ),
inference(equality_resolution,[],[f136]) ).
fof(f187,plain,
( sK11 != sK11
| ~ ssItem(sK13)
| ~ ssList(sK14)
| ~ ssItem(sK12)
| sP1(sK10,sK11,sK11,sK10)
| sP1(sK10,sK11,sK11,sK10) ),
inference(superposition,[],[f176,f177]) ).
fof(f188,plain,
( sK11 != sK11
| ~ ssItem(sK13)
| ~ ssList(sK14)
| ~ ssItem(sK12)
| sP1(sK10,sK11,sK11,sK10) ),
inference(duplicate_literal_removal,[],[f187]) ).
fof(f189,plain,
( ~ ssItem(sK13)
| ~ ssList(sK14)
| ~ ssItem(sK12)
| sP1(sK10,sK11,sK11,sK10) ),
inference(trivial_inequality_removal,[],[f188]) ).
fof(f190,plain,
( ~ ssList(sK14)
| ~ ssItem(sK12)
| sP1(sK10,sK11,sK11,sK10) ),
inference(forward_subsumption_resolution,[],[f189,f179]) ).
fof(f191,plain,
( ~ ssList(sK14)
| sP1(sK10,sK11,sK11,sK10) ),
inference(forward_subsumption_resolution,[],[f190,f180]) ).
fof(f192,plain,
sP1(sK10,sK11,sK11,sK10),
inference(forward_subsumption_resolution,[],[f191,f178]) ).
fof(f194,plain,
sP0(sK11,sK10),
inference(resolution,[],[f131,f192]) ).
fof(f651,plain,
! [X2,X3,X0,X1,X4] :
( ~ sP1(X1,X0,X3,X4)
| ~ ssItem(sK6(X0,X2))
| ~ ssList(sK7(X0,X2))
| app(app(cons(sK6(X0,X2),nil),sK7(X0,X2)),cons(sK5(X0,X2),nil)) = X1
| ~ ssItem(sK5(X0,X2))
| ~ sP0(X0,X2) ),
inference(superposition,[],[f183,f140]) ).
fof(f656,plain,
! [X2,X3,X0,X1,X4] :
( ~ sP1(X1,X0,X3,X4)
| ~ ssList(sK7(X0,X2))
| app(app(cons(sK6(X0,X2),nil),sK7(X0,X2)),cons(sK5(X0,X2),nil)) = X1
| ~ ssItem(sK5(X0,X2))
| ~ sP0(X0,X2) ),
inference(forward_subsumption_resolution,[],[f651,f138]) ).
fof(f659,plain,
! [X2,X3,X0,X1,X4] :
( ~ sP1(X1,X0,X3,X4)
| app(app(cons(sK6(X0,X2),nil),sK7(X0,X2)),cons(sK5(X0,X2),nil)) = X1
| ~ ssItem(sK5(X0,X2))
| ~ sP0(X0,X2) ),
inference(forward_subsumption_resolution,[],[f656,f141]) ).
fof(f660,plain,
! [X2,X3,X0,X1,X4] :
( app(app(cons(sK6(X0,X2),nil),sK7(X0,X2)),cons(sK5(X0,X2),nil)) = X1
| ~ sP1(X1,X0,X3,X4)
| ~ sP0(X0,X2) ),
inference(forward_subsumption_resolution,[],[f659,f137]) ).
fof(f2987,plain,
! [X2,X3,X0,X1,X4] :
( X0 != X2
| ~ sP0(X1,X2)
| ~ sP1(X0,X1,X3,X4)
| ~ sP0(X1,X2) ),
inference(superposition,[],[f139,f660]) ).
fof(f3025,plain,
! [X2,X3,X0,X1,X4] :
( X0 != X2
| ~ sP0(X1,X2)
| ~ sP1(X0,X1,X3,X4) ),
inference(duplicate_literal_removal,[],[f2987]) ).
fof(f3038,plain,
! [X2,X3,X0,X1] :
( ~ sP1(X1,X0,X2,X3)
| ~ sP0(X0,X1) ),
inference(equality_resolution,[],[f3025]) ).
fof(f3039,plain,
~ sP0(sK11,sK10),
inference(resolution,[],[f3038,f192]) ).
fof(f3046,plain,
$false,
inference(forward_subsumption_resolution,[],[f3039,f194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC412+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.28 % Computer : n017.cluster.edu
% 0.23/0.28 % Model : x86_64 x86_64
% 0.23/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.28 % Memory : 8046.5625MB
% 0.23/0.28 % OS : Linux 6.8.0-71-generic
% 0.23/0.28 % CPULimit : 300
% 0.23/0.28 % WCLimit : 300
% 0.23/0.28 % DateTime : Mon Sep 28 09:27:21 UTC 2026
% 0.23/0.28 % CPUTime :
% 0.23/0.28 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.32 Running first-order theorem proving
% 0.23/0.32 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.05/1.84 % (3427034)Detected formulas, will run a generic FOF schedule.
% 2.05/1.84 % (3427039)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=889445748:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.05/1.84 % (3427044)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2655370323:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.05/1.84 % (3427042)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1382515912:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.05/1.84 % (3427041)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=2210316440:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.05/1.84 % (3427040)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=631176977:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.05/1.84 % (3427045)dis-21_1_sil=8000:lcm=predicate:random_seed=431854615: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.05/1.84 % (3427043)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4185557854:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.05/1.84 % (3427044)Instruction limit reached!
% 2.05/1.84 % (3427044)------------------------------
% 2.05/1.84 % (3427044)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.05/1.84 % (3427044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/1.84 % (3427044)CaDiCaL version: 2.1.3
% 2.05/1.84 % (3427044)Termination reason: Instruction limit
% 2.05/1.84 % (3427044)Termination phase: Saturation
% 2.05/1.84 % (3427044)Time elapsed: 0.111 s
% 2.05/1.84 % (3427044)Peak memory usage: 90 MB
% 2.05/1.84 % (3427044)Instructions burned: 139 (million)
% 2.05/1.84 % (3427042)Instruction limit reached!
% 2.05/1.84 % (3427042)------------------------------
% 2.05/1.84 % (3427042)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.05/1.84 % (3427042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/1.84 % (3427042)CaDiCaL version: 2.1.3
% 2.05/1.84 % (3427042)Termination reason: Instruction limit
% 2.05/1.84 % (3427042)Termination phase: Saturation
% 2.05/1.84 % (3427042)Time elapsed: 0.112 s
% 2.05/1.84 % (3427042)Peak memory usage: 90 MB
% 2.05/1.84 % (3427042)Instructions burned: 109 (million)
% 2.05/1.84 % (3427043)First to succeed.
% 2.05/1.84 % (3427043)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3427034"
% 2.05/1.84 % (3427045)Instruction limit reached!
% 2.05/1.84 % (3427045)------------------------------
% 2.05/1.84 % (3427045)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.05/1.84 % (3427045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/1.84 % (3427045)CaDiCaL version: 2.1.3
% 2.05/1.84 % (3427045)Termination reason: Instruction limit
% 2.05/1.84 % (3427045)Termination phase: Saturation
% 2.05/1.84 % (3427045)Time elapsed: 0.114 s
% 2.05/1.84 % (3427045)Peak memory usage: 90 MB
% 2.05/1.84 % (3427045)Instructions burned: 129 (million)
% 2.05/1.84 % (3427053)lrs+10_1_sil=8000:sp=occurrence:random_seed=953013062:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.05/1.84 % (3427055)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2670947845:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 2.05/1.84 % (3427054)lrs+10_1_sil=32000:urr=on:br=off:random_seed=855784700:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 2.05/1.84 % (3427054)Instruction limit reached!
% 2.05/1.84 % (3427054)------------------------------
% 2.05/1.84 % (3427054)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.05/1.84 % (3427054)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.05/1.84 % (3427054)CaDiCaL version: 2.1.3
% 2.05/1.84 % (3427054)Termination reason: Instruction limit
% 2.05/1.84 % (3427054)Termination phase: Saturation
% 2.05/1.84 % (3427054)Time elapsed: 0.133 s
% 2.05/1.84 % (3427054)Peak memory usage: 92 MB
% 2.05/1.84 % (3427054)Instructions burned: 157 (million)
% 2.05/1.84 % (3427043)Refutation found. Thanks to Tanya!
% 2.05/1.84 % SZS status Theorem for theBenchmark
% 2.05/1.84 % SZS output start Proof for theBenchmark
% See solution above
% 6.78/2.15 % (3427043)------------------------------
% 6.78/2.15 % (3427043)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.78/2.15 % (3427043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/2.15 % (3427043)CaDiCaL version: 2.1.3
% 6.78/2.15 % (3427043)Termination reason: Refutation
% 6.78/2.15 % (3427043)Time elapsed: 0.107 s
% 6.78/2.15 % (3427043)Peak memory usage: 89 MB
% 6.78/2.15 % (3427043)Instructions burned: 115 (million)
% 6.78/2.15 % (3427043)------------------------------
% 6.78/2.15 % (3427043)------------------------------
% 6.78/2.15 % (3427034)Success in time 0.802 s
% 6.78/2.15 % Vampire exiting
%------------------------------------------------------------------------------