%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWX056+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:45:46 PM UTC 2026
% Result : Theorem 5.24s 1.58s
% Output : Refutation 6.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 21
% Syntax : Number of formulae : 140 ( 17 unt; 8 def)
% Number of atoms : 530 ( 107 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 635 ( 245 ~; 295 |; 63 &)
% ( 10 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 14 usr; 10 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-2 aty)
% Number of variables : 228 ( 0 sgn 202 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : '0' != s(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id2) ).
fof(f6,axiom,
! [X0,X1] :
( s(X0) = s(X1)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id6) ).
fof(f25,axiom,
! [X0,X1,X2] :
( delete_terminates(X0,X1,X2)
=> ( delete_succeeds(X0,X1,X2)
| delete_fails(X0,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id25) ).
fof(f60,axiom,
! [X0,X1] :
( permutation_terminates(X0,X1)
<=> ( ! [X2,X3,X4] :
( $true
& ( X1 != cons(X2,X3)
| ( delete_terminates(X2,X0,X4)
& ( delete_fails(X2,X0,X4)
| permutation_terminates(X4,X3) ) ) ) )
& $true
& ( X0 != nil
| $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id60) ).
fof(f216,axiom,
lh(nil) = '0',
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(lh:nil)') ).
fof(f218,axiom,
! [X0] :
( list_succeeds(X0)
=> nat_succeeds(lh(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(lh:types)') ).
fof(f219,axiom,
! [X0] :
( ( list_succeeds(X0)
& lh(X0) = '0' )
=> X0 = nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(lh:zero)') ).
fof(f254,axiom,
! [X0,X1,X2] :
( list_succeeds(X1)
=> delete_terminates(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(delete:termination:1)') ).
fof(f255,axiom,
! [X0,X1,X2] :
( list_succeeds(X2)
=> delete_terminates(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(delete:termination:2)') ).
fof(f256,axiom,
! [X0,X1,X2] :
( ( delete_succeeds(X0,X1,X2)
& list_succeeds(X1) )
=> list_succeeds(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(delete:types:1)') ).
fof(f258,axiom,
! [X0,X1,X2] :
( ( delete_succeeds(X0,X1,X2)
& list_succeeds(X1) )
=> lh(X1) = s(lh(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(delete:length)') ).
fof(f275,axiom,
( ! [X0] :
( ( ? [X1] :
( X0 = s(X1)
& nat_succeeds(X1)
& ! [X2,X3] :
( ( lh(X2) = X1
& list_succeeds(X2) )
=> permutation_terminates(X2,X3) ) )
| X0 = '0' )
=> ! [X2,X3] :
( ( lh(X2) = X0
& list_succeeds(X2) )
=> permutation_terminates(X2,X3) ) )
=> ! [X0] :
( nat_succeeds(X0)
=> ! [X2,X3] :
( ( lh(X2) = X0
& list_succeeds(X2) )
=> permutation_terminates(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',induction) ).
fof(f276,conjecture,
! [X0,X1,X2] :
( ( nat_succeeds(X0)
& list_succeeds(X1)
& lh(X1) = X0 )
=> permutation_terminates(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lemma-(permutation:termination)') ).
fof(f277,negated_conjecture,
~ ! [X0,X1,X2] :
( ( nat_succeeds(X0)
& list_succeeds(X1)
& lh(X1) = X0 )
=> permutation_terminates(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f276]) ).
fof(f281,plain,
! [X0,X1] :
( permutation_terminates(X0,X1)
<=> ! [X2,X3,X4] :
( X1 != cons(X2,X3)
| ( delete_terminates(X2,X0,X4)
& ( delete_fails(X2,X0,X4)
| permutation_terminates(X4,X3) ) ) ) ),
inference(true_and_false_elimination,[],[f60]) ).
fof(f302,plain,
( ! [X0] :
( ( ? [X1] :
( X0 = s(X1)
& nat_succeeds(X1)
& ! [X2,X3] :
( ( lh(X2) = X1
& list_succeeds(X2) )
=> permutation_terminates(X2,X3) ) )
| X0 = '0' )
=> ! [X4,X5] :
( ( lh(X4) = X0
& list_succeeds(X4) )
=> permutation_terminates(X4,X5) ) )
=> ! [X6] :
( nat_succeeds(X6)
=> ! [X7,X8] :
( ( lh(X7) = X6
& list_succeeds(X7) )
=> permutation_terminates(X7,X8) ) ) ),
inference(rectify,[],[f275]) ).
fof(f306,plain,
! [X0,X1] :
( X0 = X1
| s(X0) != s(X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f325,plain,
! [X0,X1,X2] :
( delete_succeeds(X0,X1,X2)
| delete_fails(X0,X1,X2)
| ~ delete_terminates(X0,X1,X2) ),
inference(ennf_transformation,[],[f25]) ).
fof(f326,plain,
! [X0,X1,X2] :
( delete_succeeds(X0,X1,X2)
| delete_fails(X0,X1,X2)
| ~ delete_terminates(X0,X1,X2) ),
inference(flattening,[],[f325]) ).
fof(f548,plain,
! [X0] :
( nat_succeeds(lh(X0))
| ~ list_succeeds(X0) ),
inference(ennf_transformation,[],[f218]) ).
fof(f549,plain,
! [X0] :
( X0 = nil
| ~ list_succeeds(X0)
| '0' != lh(X0) ),
inference(ennf_transformation,[],[f219]) ).
fof(f550,plain,
! [X0] :
( X0 = nil
| ~ list_succeeds(X0)
| '0' != lh(X0) ),
inference(flattening,[],[f549]) ).
fof(f604,plain,
! [X0,X1,X2] :
( delete_terminates(X0,X1,X2)
| ~ list_succeeds(X1) ),
inference(ennf_transformation,[],[f254]) ).
fof(f605,plain,
! [X0,X1,X2] :
( delete_terminates(X0,X1,X2)
| ~ list_succeeds(X2) ),
inference(ennf_transformation,[],[f255]) ).
fof(f606,plain,
! [X0,X1,X2] :
( list_succeeds(X2)
| ~ delete_succeeds(X0,X1,X2)
| ~ list_succeeds(X1) ),
inference(ennf_transformation,[],[f256]) ).
fof(f607,plain,
! [X0,X1,X2] :
( list_succeeds(X2)
| ~ delete_succeeds(X0,X1,X2)
| ~ list_succeeds(X1) ),
inference(flattening,[],[f606]) ).
fof(f610,plain,
! [X0,X1,X2] :
( lh(X1) = s(lh(X2))
| ~ delete_succeeds(X0,X1,X2)
| ~ list_succeeds(X1) ),
inference(ennf_transformation,[],[f258]) ).
fof(f611,plain,
! [X0,X1,X2] :
( lh(X1) = s(lh(X2))
| ~ delete_succeeds(X0,X1,X2)
| ~ list_succeeds(X1) ),
inference(flattening,[],[f610]) ).
fof(f634,plain,
( ! [X6] :
( ! [X7,X8] :
( permutation_terminates(X7,X8)
| lh(X7) != X6
| ~ list_succeeds(X7) )
| ~ nat_succeeds(X6) )
| ? [X0] :
( ? [X4,X5] :
( ~ permutation_terminates(X4,X5)
& lh(X4) = X0
& list_succeeds(X4) )
& ( ? [X1] :
( X0 = s(X1)
& nat_succeeds(X1)
& ! [X2,X3] :
( permutation_terminates(X2,X3)
| lh(X2) != X1
| ~ list_succeeds(X2) ) )
| X0 = '0' ) ) ),
inference(ennf_transformation,[],[f302]) ).
fof(f635,plain,
( ! [X6] :
( ! [X7,X8] :
( permutation_terminates(X7,X8)
| lh(X7) != X6
| ~ list_succeeds(X7) )
| ~ nat_succeeds(X6) )
| ? [X0] :
( ? [X4,X5] :
( ~ permutation_terminates(X4,X5)
& lh(X4) = X0
& list_succeeds(X4) )
& ( ? [X1] :
( X0 = s(X1)
& nat_succeeds(X1)
& ! [X2,X3] :
( permutation_terminates(X2,X3)
| lh(X2) != X1
| ~ list_succeeds(X2) ) )
| X0 = '0' ) ) ),
inference(flattening,[],[f634]) ).
fof(f636,plain,
? [X0,X1,X2] :
( ~ permutation_terminates(X1,X2)
& nat_succeeds(X0)
& list_succeeds(X1)
& lh(X1) = X0 ),
inference(ennf_transformation,[],[f277]) ).
fof(f637,plain,
? [X0,X1,X2] :
( ~ permutation_terminates(X1,X2)
& nat_succeeds(X0)
& list_succeeds(X1)
& lh(X1) = X0 ),
inference(flattening,[],[f636]) ).
fof(f693,plain,
! [X0,X1] :
( ( permutation_terminates(X0,X1)
| ? [X2,X3,X4] :
( cons(X2,X3) = X1
& ( ~ delete_terminates(X2,X0,X4)
| ( ~ delete_fails(X2,X0,X4)
& ~ permutation_terminates(X4,X3) ) ) ) )
& ( ! [X2,X3,X4] :
( X1 != cons(X2,X3)
| ( delete_terminates(X2,X0,X4)
& ( delete_fails(X2,X0,X4)
| permutation_terminates(X4,X3) ) ) )
| ~ permutation_terminates(X0,X1) ) ),
inference(nnf_transformation,[],[f281]) ).
fof(f694,plain,
! [X0,X1] :
( ( permutation_terminates(X0,X1)
| ? [X2,X3,X4] :
( cons(X2,X3) = X1
& ( ~ delete_terminates(X2,X0,X4)
| ( ~ delete_fails(X2,X0,X4)
& ~ permutation_terminates(X4,X3) ) ) ) )
& ( ! [X5,X6,X7] :
( cons(X5,X6) != X1
| ( delete_terminates(X5,X0,X7)
& ( delete_fails(X5,X0,X7)
| permutation_terminates(X7,X6) ) ) )
| ~ permutation_terminates(X0,X1) ) ),
inference(rectify,[],[f693]) ).
fof(f695,plain,
! [X0,X1] :
( ( permutation_terminates(X0,X1)
| ( cons(sK32(X0,X1),sK33(X0,X1)) = X1
& ( ~ delete_terminates(sK32(X0,X1),X0,sK34(X0,X1))
| ( ~ delete_fails(sK32(X0,X1),X0,sK34(X0,X1))
& ~ permutation_terminates(sK34(X0,X1),sK33(X0,X1)) ) ) ) )
& ( ! [X5,X6,X7] :
( cons(X5,X6) != X1
| ( delete_terminates(X5,X0,X7)
& ( delete_fails(X5,X0,X7)
| permutation_terminates(X7,X6) ) ) )
| ~ permutation_terminates(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK32,sK33,sK34]),skolemize(X2,sK32(X0,X1)),skolemize(X3,sK33(X0,X1)),skolemize(X4,sK34(X0,X1))],[f694]) ).
fof(f839,plain,
( ! [X0] :
( ! [X1,X2] :
( permutation_terminates(X1,X2)
| lh(X1) != X0
| ~ list_succeeds(X1) )
| ~ nat_succeeds(X0) )
| ? [X3] :
( ? [X4,X5] :
( ~ permutation_terminates(X4,X5)
& lh(X4) = X3
& list_succeeds(X4) )
& ( ? [X6] :
( s(X6) = X3
& nat_succeeds(X6)
& ! [X7,X8] :
( permutation_terminates(X7,X8)
| lh(X7) != X6
| ~ list_succeeds(X7) ) )
| '0' = X3 ) ) ),
inference(rectify,[],[f635]) ).
fof(f840,plain,
( ! [X0] :
( ! [X1,X2] :
( permutation_terminates(X1,X2)
| lh(X1) != X0
| ~ list_succeeds(X1) )
| ~ nat_succeeds(X0) )
| ( ~ permutation_terminates(sK129,sK130)
& sK128 = lh(sK129)
& list_succeeds(sK129)
& ( ( sK128 = s(sK131)
& nat_succeeds(sK131)
& ! [X7,X8] :
( permutation_terminates(X7,X8)
| lh(X7) != sK131
| ~ list_succeeds(X7) ) )
| '0' = sK128 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK128,sK129,sK130,sK131]),skolemize(X3,sK128),skolemize(X4,sK129),skolemize(X5,sK130),skolemize(X6,sK131)],[f839]) ).
fof(f841,plain,
( ~ permutation_terminates(sK133,sK134)
& nat_succeeds(sK132)
& list_succeeds(sK133)
& sK132 = lh(sK133) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK132,sK133,sK134]),skolemize(X0,sK132),skolemize(X1,sK133),skolemize(X2,sK134)],[f637]) ).
fof(f843,plain,
! [X0] : '0' != s(X0),
inference(cnf_transformation,[],[f2]) ).
fof(f847,plain,
! [X0,X1] :
( s(X0) != s(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f306]) ).
fof(f869,plain,
! [X2,X0,X1] :
( ~ delete_terminates(X0,X1,X2)
| delete_fails(X0,X1,X2)
| delete_succeeds(X0,X1,X2) ),
inference(cnf_transformation,[],[f326]) ).
fof(f975,plain,
! [X0,X1] :
( ~ delete_terminates(sK32(X0,X1),X0,sK34(X0,X1))
| permutation_terminates(X0,X1)
| ~ permutation_terminates(sK34(X0,X1),sK33(X0,X1)) ),
inference(cnf_transformation,[],[f695]) ).
fof(f976,plain,
! [X0,X1] :
( ~ delete_terminates(sK32(X0,X1),X0,sK34(X0,X1))
| permutation_terminates(X0,X1)
| ~ delete_fails(sK32(X0,X1),X0,sK34(X0,X1)) ),
inference(cnf_transformation,[],[f695]) ).
fof(f1281,plain,
'0' = lh(nil),
inference(cnf_transformation,[],[f216]) ).
fof(f1283,plain,
! [X0] :
( nat_succeeds(lh(X0))
| ~ list_succeeds(X0) ),
inference(cnf_transformation,[],[f548]) ).
fof(f1284,plain,
! [X0] :
( '0' != lh(X0)
| ~ list_succeeds(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f550]) ).
fof(f1319,plain,
! [X2,X0,X1] :
( delete_terminates(X0,X1,X2)
| ~ list_succeeds(X1) ),
inference(cnf_transformation,[],[f604]) ).
fof(f1320,plain,
! [X2,X0,X1] :
( delete_terminates(X0,X1,X2)
| ~ list_succeeds(X2) ),
inference(cnf_transformation,[],[f605]) ).
fof(f1321,plain,
! [X2,X0,X1] :
( ~ delete_succeeds(X0,X1,X2)
| list_succeeds(X2)
| ~ list_succeeds(X1) ),
inference(cnf_transformation,[],[f607]) ).
fof(f1323,plain,
! [X2,X0,X1] :
( ~ delete_succeeds(X0,X1,X2)
| lh(X1) = s(lh(X2))
| ~ list_succeeds(X1) ),
inference(cnf_transformation,[],[f611]) ).
fof(f1352,plain,
! [X2,X0,X1,X8,X7] :
( permutation_terminates(X1,X2)
| lh(X1) != X0
| ~ list_succeeds(X1)
| ~ nat_succeeds(X0)
| permutation_terminates(X7,X8)
| lh(X7) != sK131
| ~ list_succeeds(X7)
| '0' = sK128 ),
inference(cnf_transformation,[],[f840]) ).
fof(f1354,plain,
! [X2,X0,X1] :
( permutation_terminates(X1,X2)
| lh(X1) != X0
| ~ list_succeeds(X1)
| ~ nat_succeeds(X0)
| sK128 = s(sK131)
| '0' = sK128 ),
inference(cnf_transformation,[],[f840]) ).
fof(f1355,plain,
! [X2,X0,X1] :
( permutation_terminates(X1,X2)
| lh(X1) != X0
| ~ list_succeeds(X1)
| ~ nat_succeeds(X0)
| list_succeeds(sK129) ),
inference(cnf_transformation,[],[f840]) ).
fof(f1356,plain,
! [X2,X0,X1] :
( permutation_terminates(X1,X2)
| lh(X1) != X0
| ~ list_succeeds(X1)
| ~ nat_succeeds(X0)
| sK128 = lh(sK129) ),
inference(cnf_transformation,[],[f840]) ).
fof(f1357,plain,
! [X2,X0,X1] :
( permutation_terminates(X1,X2)
| lh(X1) != X0
| ~ list_succeeds(X1)
| ~ nat_succeeds(X0)
| ~ permutation_terminates(sK129,sK130) ),
inference(cnf_transformation,[],[f840]) ).
fof(f1359,plain,
list_succeeds(sK133),
inference(cnf_transformation,[],[f841]) ).
fof(f1361,plain,
~ permutation_terminates(sK133,sK134),
inference(cnf_transformation,[],[f841]) ).
fof(f1476,plain,
! [X2,X1] :
( permutation_terminates(X1,X2)
| ~ list_succeeds(X1)
| ~ nat_succeeds(lh(X1))
| ~ permutation_terminates(sK129,sK130) ),
inference(equality_resolution,[],[f1357]) ).
fof(f1477,plain,
! [X2,X1] :
( permutation_terminates(X1,X2)
| ~ list_succeeds(X1)
| ~ nat_succeeds(lh(X1))
| sK128 = lh(sK129) ),
inference(equality_resolution,[],[f1356]) ).
fof(f1478,plain,
! [X2,X1] :
( permutation_terminates(X1,X2)
| ~ list_succeeds(X1)
| ~ nat_succeeds(lh(X1))
| list_succeeds(sK129) ),
inference(equality_resolution,[],[f1355]) ).
fof(f1479,plain,
! [X2,X1] :
( permutation_terminates(X1,X2)
| ~ list_succeeds(X1)
| ~ nat_succeeds(lh(X1))
| sK128 = s(sK131)
| '0' = sK128 ),
inference(equality_resolution,[],[f1354]) ).
fof(f1481,plain,
! [X2,X1,X8,X7] :
( permutation_terminates(X1,X2)
| ~ list_succeeds(X1)
| ~ nat_succeeds(lh(X1))
| permutation_terminates(X7,X8)
| lh(X7) != sK131
| ~ list_succeeds(X7)
| '0' = sK128 ),
inference(equality_resolution,[],[f1352]) ).
fof(f1486,definition,
( spl136_1
<=> '0' = sK128 ),
introduced(definition,[new_symbols(definition,[spl136_1])],[avatar_definition]) ).
fof(f1488,plain,
( '0' = sK128
| ~ spl136_1 ),
inference(avatar_component_clause,[],[f1486]) ).
fof(f1490,definition,
( spl136_2
<=> ! [X8,X7] :
( permutation_terminates(X7,X8)
| ~ list_succeeds(X7)
| lh(X7) != sK131 ) ),
introduced(definition,[new_symbols(definition,[spl136_2])],[avatar_definition]) ).
fof(f1491,plain,
( ! [X8,X7] :
( lh(X7) != sK131
| ~ list_succeeds(X7)
| permutation_terminates(X7,X8) )
| ~ spl136_2 ),
inference(avatar_component_clause,[],[f1490]) ).
fof(f1493,definition,
( spl136_3
<=> ! [X2,X1] :
( permutation_terminates(X1,X2)
| ~ nat_succeeds(lh(X1))
| ~ list_succeeds(X1) ) ),
introduced(definition,[new_symbols(definition,[spl136_3])],[avatar_definition]) ).
fof(f1494,plain,
( ! [X2,X1] :
( permutation_terminates(X1,X2)
| ~ nat_succeeds(lh(X1))
| ~ list_succeeds(X1) )
| ~ spl136_3 ),
inference(avatar_component_clause,[],[f1493]) ).
fof(f1495,plain,
( spl136_1
| spl136_2
| spl136_3 ),
inference(avatar_split_clause,[],[f1481,f1493,f1490,f1486]) ).
fof(f1502,definition,
( spl136_5
<=> sK128 = s(sK131) ),
introduced(definition,[new_symbols(definition,[spl136_5])],[avatar_definition]) ).
fof(f1504,plain,
( sK128 = s(sK131)
| ~ spl136_5 ),
inference(avatar_component_clause,[],[f1502]) ).
fof(f1505,plain,
( spl136_1
| spl136_5
| spl136_3 ),
inference(avatar_split_clause,[],[f1479,f1493,f1502,f1486]) ).
fof(f1507,definition,
( spl136_6
<=> list_succeeds(sK129) ),
introduced(definition,[new_symbols(definition,[spl136_6])],[avatar_definition]) ).
fof(f1509,plain,
( list_succeeds(sK129)
| ~ spl136_6 ),
inference(avatar_component_clause,[],[f1507]) ).
fof(f1510,plain,
( spl136_6
| spl136_3 ),
inference(avatar_split_clause,[],[f1478,f1493,f1507]) ).
fof(f1512,definition,
( spl136_7
<=> sK128 = lh(sK129) ),
introduced(definition,[new_symbols(definition,[spl136_7])],[avatar_definition]) ).
fof(f1514,plain,
( sK128 = lh(sK129)
| ~ spl136_7 ),
inference(avatar_component_clause,[],[f1512]) ).
fof(f1515,plain,
( spl136_7
| spl136_3 ),
inference(avatar_split_clause,[],[f1477,f1493,f1512]) ).
fof(f1517,definition,
( spl136_8
<=> permutation_terminates(sK129,sK130) ),
introduced(definition,[new_symbols(definition,[spl136_8])],[avatar_definition]) ).
fof(f1519,plain,
( ~ permutation_terminates(sK129,sK130)
| spl136_8 ),
inference(avatar_component_clause,[],[f1517]) ).
fof(f1520,plain,
( ~ spl136_8
| spl136_3 ),
inference(avatar_split_clause,[],[f1476,f1493,f1517]) ).
fof(f1522,plain,
( ! [X2,X1] :
( permutation_terminates(X1,X2)
| ~ list_succeeds(X1) )
| ~ spl136_3 ),
inference(forward_subsumption_resolution,[],[f1494,f1283]) ).
fof(f1525,plain,
( ~ list_succeeds(sK133)
| ~ spl136_3 ),
inference(resolution,[],[f1361,f1522]) ).
fof(f1526,plain,
( $false
| ~ spl136_3 ),
inference(forward_subsumption_resolution,[],[f1525,f1359]) ).
fof(f1527,plain,
~ spl136_3,
inference(avatar_contradiction_clause,[],[f1526]) ).
fof(f1528,plain,
( '0' = lh(sK129)
| ~ spl136_1
| ~ spl136_7 ),
inference(forward_demodulation,[],[f1514,f1488]) ).
fof(f1587,plain,
! [X0,X1] :
( ~ delete_fails(sK32(X0,X1),X0,sK34(X0,X1))
| permutation_terminates(X0,X1)
| ~ list_succeeds(X0) ),
inference(resolution,[],[f1319,f976]) ).
fof(f1591,plain,
! [X0,X1] :
( ~ permutation_terminates(sK34(X0,X1),sK33(X0,X1))
| permutation_terminates(X0,X1)
| ~ list_succeeds(sK34(X0,X1)) ),
inference(resolution,[],[f1320,f975]) ).
fof(f1718,plain,
( '0' != '0'
| ~ list_succeeds(sK129)
| nil = sK129
| ~ spl136_1
| ~ spl136_7 ),
inference(superposition,[],[f1284,f1528]) ).
fof(f1720,plain,
( ~ list_succeeds(sK129)
| nil = sK129
| ~ spl136_1
| ~ spl136_7 ),
inference(trivial_inequality_removal,[],[f1718]) ).
fof(f1722,plain,
( nil = sK129
| ~ spl136_1
| ~ spl136_6
| ~ spl136_7 ),
inference(forward_subsumption_resolution,[],[f1720,f1509]) ).
fof(f2631,plain,
! [X2,X0,X1] :
( delete_fails(X0,X1,X2)
| delete_succeeds(X0,X1,X2)
| ~ list_succeeds(X1) ),
inference(resolution,[],[f869,f1319]) ).
fof(f2633,plain,
! [X0,X1] :
( delete_succeeds(sK32(X0,X1),X0,sK34(X0,X1))
| ~ list_succeeds(X0)
| permutation_terminates(X0,X1)
| ~ list_succeeds(X0) ),
inference(resolution,[],[f2631,f1587]) ).
fof(f2634,plain,
! [X0,X1] :
( delete_succeeds(sK32(X0,X1),X0,sK34(X0,X1))
| ~ list_succeeds(X0)
| permutation_terminates(X0,X1) ),
inference(duplicate_literal_removal,[],[f2633]) ).
fof(f2636,plain,
! [X0,X1] :
( ~ list_succeeds(X0)
| permutation_terminates(X0,X1)
| list_succeeds(sK34(X0,X1))
| ~ list_succeeds(X0) ),
inference(resolution,[],[f2634,f1321]) ).
fof(f2638,plain,
! [X0,X1] :
( ~ list_succeeds(X0)
| permutation_terminates(X0,X1)
| lh(X0) = s(lh(sK34(X0,X1)))
| ~ list_succeeds(X0) ),
inference(resolution,[],[f2634,f1323]) ).
fof(f2639,plain,
! [X0,X1] :
( permutation_terminates(X0,X1)
| ~ list_succeeds(X0)
| lh(X0) = s(lh(sK34(X0,X1))) ),
inference(duplicate_literal_removal,[],[f2638]) ).
fof(f2640,plain,
! [X0,X1] :
( list_succeeds(sK34(X0,X1))
| permutation_terminates(X0,X1)
| ~ list_succeeds(X0) ),
inference(duplicate_literal_removal,[],[f2636]) ).
fof(f2655,plain,
( ~ list_succeeds(sK129)
| lh(sK129) = s(lh(sK34(sK129,sK130)))
| spl136_8 ),
inference(resolution,[],[f2639,f1519]) ).
fof(f2659,plain,
( lh(sK129) = s(lh(sK34(sK129,sK130)))
| ~ spl136_6
| spl136_8 ),
inference(forward_subsumption_resolution,[],[f2655,f1509]) ).
fof(f2663,plain,
( lh(nil) = s(lh(sK34(nil,sK130)))
| ~ spl136_1
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(forward_demodulation,[],[f2659,f1722]) ).
fof(f2666,plain,
( '0' = s(lh(sK34(nil,sK130)))
| ~ spl136_1
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(forward_demodulation,[],[f2663,f1281]) ).
fof(f2671,plain,
( $false
| ~ spl136_1
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(forward_subsumption_resolution,[],[f2666,f843]) ).
fof(f2672,plain,
( ~ spl136_1
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(avatar_contradiction_clause,[],[f2671]) ).
fof(f2711,plain,
( sK128 = s(lh(sK34(sK129,sK130)))
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(forward_demodulation,[],[f2659,f1514]) ).
fof(f2862,plain,
( ! [X0] :
( s(X0) != sK128
| lh(sK34(sK129,sK130)) = X0 )
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(superposition,[],[f847,f2711]) ).
fof(f3066,definition,
( spl136_115
<=> list_succeeds(sK34(sK129,sK130)) ),
introduced(definition,[new_symbols(definition,[spl136_115])],[avatar_definition]) ).
fof(f3067,plain,
( list_succeeds(sK34(sK129,sK130))
| ~ spl136_115 ),
inference(avatar_component_clause,[],[f3066]) ).
fof(f3068,plain,
( ~ list_succeeds(sK34(sK129,sK130))
| spl136_115 ),
inference(avatar_component_clause,[],[f3066]) ).
fof(f3300,plain,
( permutation_terminates(sK129,sK130)
| ~ list_succeeds(sK129)
| spl136_115 ),
inference(resolution,[],[f3068,f2640]) ).
fof(f3301,plain,
( ~ list_succeeds(sK129)
| spl136_8
| spl136_115 ),
inference(forward_subsumption_resolution,[],[f3300,f1519]) ).
fof(f3302,plain,
( $false
| ~ spl136_6
| spl136_8
| spl136_115 ),
inference(forward_subsumption_resolution,[],[f3301,f1509]) ).
fof(f3303,plain,
( ~ spl136_6
| spl136_8
| spl136_115 ),
inference(avatar_contradiction_clause,[],[f3302]) ).
fof(f3482,plain,
( sK128 != sK128
| sK131 = lh(sK34(sK129,sK130))
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(superposition,[],[f2862,f1504]) ).
fof(f3483,plain,
( sK131 = lh(sK34(sK129,sK130))
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(trivial_inequality_removal,[],[f3482]) ).
fof(f3493,plain,
( ! [X0] :
( sK131 != sK131
| ~ list_succeeds(sK34(sK129,sK130))
| permutation_terminates(sK34(sK129,sK130),X0) )
| ~ spl136_2
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(superposition,[],[f1491,f3483]) ).
fof(f3496,plain,
( ! [X0] :
( ~ list_succeeds(sK34(sK129,sK130))
| permutation_terminates(sK34(sK129,sK130),X0) )
| ~ spl136_2
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(trivial_inequality_removal,[],[f3493]) ).
fof(f3497,plain,
( ! [X0] : permutation_terminates(sK34(sK129,sK130),X0)
| ~ spl136_2
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8
| ~ spl136_115 ),
inference(forward_subsumption_resolution,[],[f3496,f3067]) ).
fof(f3511,plain,
( permutation_terminates(sK129,sK130)
| ~ list_succeeds(sK34(sK129,sK130))
| ~ spl136_2
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8
| ~ spl136_115 ),
inference(resolution,[],[f3497,f1591]) ).
fof(f3515,plain,
( ~ list_succeeds(sK34(sK129,sK130))
| ~ spl136_2
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8
| ~ spl136_115 ),
inference(forward_subsumption_resolution,[],[f3511,f1519]) ).
fof(f3518,plain,
( $false
| ~ spl136_2
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8
| ~ spl136_115 ),
inference(forward_subsumption_resolution,[],[f3515,f3067]) ).
fof(f3519,plain,
( ~ spl136_2
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8
| ~ spl136_115 ),
inference(avatar_contradiction_clause,[],[f3518]) ).
cnf(s1,plain,
( spl136_1
| spl136_2
| spl136_3 ),
inference(sat_conversion,[],[f1495]) ).
cnf(s3,plain,
( spl136_1
| spl136_3
| spl136_5 ),
inference(sat_conversion,[],[f1505]) ).
cnf(s4,plain,
( spl136_3
| spl136_6 ),
inference(sat_conversion,[],[f1510]) ).
cnf(s5,plain,
( spl136_3
| spl136_7 ),
inference(sat_conversion,[],[f1515]) ).
cnf(s6,plain,
( spl136_3
| ~ spl136_8 ),
inference(sat_conversion,[],[f1520]) ).
cnf(s7,plain,
~ spl136_3,
inference(sat_conversion,[],[f1527]) ).
cnf(s59,plain,
( ~ spl136_1
| ~ spl136_6
| ~ spl136_7
| spl136_8 ),
inference(sat_conversion,[],[f2672]) ).
cnf(s111,plain,
( ~ spl136_6
| spl136_8
| spl136_115 ),
inference(sat_conversion,[],[f3303]) ).
cnf(s126,plain,
( ~ spl136_2
| ~ spl136_5
| ~ spl136_6
| ~ spl136_7
| spl136_8
| ~ spl136_115 ),
inference(sat_conversion,[],[f3519]) ).
cnf(s152,plain,
~ spl136_8,
inference(rat,[],[s6,s7]) ).
cnf(s153,plain,
spl136_7,
inference(rat,[],[s5,s7]) ).
cnf(s154,plain,
spl136_6,
inference(rat,[],[s4,s7]) ).
cnf(s155,plain,
spl136_115,
inference(rat,[],[s111,s152,s154]) ).
cnf(s157,plain,
~ spl136_1,
inference(rat,[],[s59,s152,s153,s154]) ).
cnf(s164,plain,
spl136_5,
inference(rat,[],[s3,s7,s157]) ).
cnf(s165,plain,
~ spl136_2,
inference(rat,[],[s126,s155,s152,s153,s154,s164]) ).
cnf(s167,plain,
$false,
inference(rat,[],[s1,s7,s165,s157]) ).
fof(f3520,plain,
$false,
inference(avatar_sat_refutation,[],[s167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX056+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.18 % Computer : n001.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Mon Sep 28 15:03:19 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.22 Running first-order theorem proving
% 0.06/0.22 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.24/1.58 % (412678)Detected formulas, will run a generic FOF schedule.
% 5.24/1.58 % (412683)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=1139353658:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.24/1.58 % (412689)dis-21_1_sil=8000:lcm=predicate:random_seed=315206727: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.24/1.58 % (412685)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=3446310076:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.24/1.58 % (412684)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=3022940871:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.24/1.58 % (412687)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=311663108:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.24/1.58 % (412686)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1100985835:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.24/1.58 % (412688)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4127574014:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.24/1.58 % (412686)Refutation not found, incomplete strategy
% 5.24/1.58 % (412686)------------------------------
% 5.24/1.58 % (412686)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.58 % (412686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.58 % (412686)CaDiCaL version: 2.1.3
% 5.24/1.58 % (412686)Termination reason: Refutation not found, incomplete strategy
% 5.24/1.58 % (412686)Time elapsed: 0.004 s
% 5.24/1.58 % (412686)Peak memory usage: 89 MB
% 5.24/1.58 % (412686)Instructions burned: 3 (million)
% 5.24/1.58 % (412687)Instruction limit reached!
% 5.24/1.58 % (412687)------------------------------
% 5.24/1.58 % (412687)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.58 % (412687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.58 % (412687)CaDiCaL version: 2.1.3
% 5.24/1.58 % (412687)Termination reason: Instruction limit
% 5.24/1.58 % (412687)Termination phase: Saturation
% 5.24/1.58 % (412687)Time elapsed: 0.077 s
% 5.24/1.58 % (412687)Peak memory usage: 89 MB
% 5.24/1.58 % (412687)Instructions burned: 121 (million)
% 5.24/1.58 % (412689)Instruction limit reached!
% 5.24/1.58 % (412689)------------------------------
% 5.24/1.58 % (412689)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.58 % (412689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.58 % (412689)CaDiCaL version: 2.1.3
% 5.24/1.58 % (412689)Termination reason: Instruction limit
% 5.24/1.58 % (412689)Termination phase: Saturation
% 5.24/1.58 % (412689)Time elapsed: 0.079 s
% 5.24/1.58 % (412689)Peak memory usage: 90 MB
% 5.24/1.58 % (412689)Instructions burned: 130 (million)
% 5.24/1.58 % (412688)Instruction limit reached!
% 5.24/1.58 % (412688)------------------------------
% 5.24/1.58 % (412688)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.58 % (412688)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.58 % (412688)CaDiCaL version: 2.1.3
% 5.24/1.58 % (412688)Termination reason: Instruction limit
% 5.24/1.58 % (412688)Termination phase: Saturation
% 5.24/1.58 % (412688)Time elapsed: 0.103 s
% 5.24/1.58 % (412688)Peak memory usage: 91 MB
% 5.24/1.58 % (412688)Instructions burned: 139 (million)
% 5.24/1.58 % (412697)lrs+10_1_sil=8000:sp=occurrence:random_seed=1664040671:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 5.24/1.58 % (412698)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3416409733:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 5.24/1.58 % (412698)Refutation not found, incomplete strategy
% 5.24/1.58 % (412698)------------------------------
% 5.24/1.58 % (412698)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.58 % (412698)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.58 % (412698)CaDiCaL version: 2.1.3
% 5.24/1.58 % (412698)Termination reason: Refutation not found, incomplete strategy
% 5.24/1.58 % (412698)Time elapsed: 0.016 s
% 5.24/1.58 % (412698)Peak memory usage: 89 MB
% 5.24/1.58 % (412698)Instructions burned: 20 (million)
% 5.24/1.58 % (412699)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3424746601:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 5.24/1.58 % (412686)------------------------------
% 5.24/1.58 % (412686)------------------------------
% 5.24/1.58 % (412699)Refutation not found, incomplete strategy
% 5.24/1.58 % (412699)------------------------------
% 5.24/1.58 % (412699)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.58 % (412699)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.58 % (412699)CaDiCaL version: 2.1.3
% 5.24/1.58 % (412699)Termination reason: Refutation not found, incomplete strategy
% 5.24/1.58 % (412699)Time elapsed: 0.007 s
% 5.24/1.58 % (412699)Peak memory usage: 89 MB
% 5.24/1.58 % (412699)Instructions burned: 7 (million)
% 5.24/1.58 % (412703)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=1040857091:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 5.24/1.58 % (412697)Instruction limit reached!
% 5.24/1.58 % (412697)------------------------------
% 5.24/1.58 % (412697)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.58 % (412697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.58 % (412697)CaDiCaL version: 2.1.3
% 5.24/1.58 % (412697)Termination reason: Instruction limit
% 5.24/1.58 % (412697)Termination phase: Saturation
% 5.24/1.58 % (412697)Time elapsed: 0.193 s
% 5.24/1.58 % (412697)Peak memory usage: 92 MB
% 5.24/1.58 % (412697)Instructions burned: 285 (million)
% 5.24/1.58 % (412698)------------------------------
% 5.24/1.58 % (412698)------------------------------
% 5.24/1.58 % (412699)------------------------------
% 5.24/1.58 % (412699)------------------------------
% 5.24/1.58 % (412683)First to succeed.
% 5.24/1.58 % (412683)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-412678"
% 5.24/1.58 % (412703)Instruction limit reached!
% 5.24/1.58 % (412703)------------------------------
% 5.24/1.58 % (412703)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.58 % (412703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.58 % (412703)CaDiCaL version: 2.1.3
% 5.24/1.58 % (412703)Termination reason: Instruction limit
% 5.24/1.58 % (412703)Termination phase: Saturation
% 5.24/1.58 % (412703)Time elapsed: 0.147 s
% 5.24/1.58 % (412703)Peak memory usage: 94 MB
% 5.24/1.58 % (412703)Instructions burned: 249 (million)
% 5.24/1.58 % (412705)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=4019370914:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 5.24/1.58 % (412706)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2593729919:i=2350_2992 on theBenchmark for (2992ds/2350Mi)
% 5.24/1.58 % (412707)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3188490690:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 5.24/1.58 % (412708)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1445269739:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 5.24/1.58 % (412683)Refutation found. Thanks to Tanya!
% 5.24/1.58 % SZS status Theorem for theBenchmark
% 5.24/1.58 % SZS output start Proof for theBenchmark
% See solution above
% 6.40/1.77 % (412683)------------------------------
% 6.40/1.77 % (412683)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.40/1.77 % (412683)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.40/1.77 % (412683)CaDiCaL version: 2.1.3
% 6.40/1.77 % (412683)Termination reason: Refutation
% 6.40/1.77 % (412683)Time elapsed: 0.512 s
% 6.40/1.77 % (412683)Peak memory usage: 136 MB
% 6.40/1.77 % (412683)Instructions burned: 1389 (million)
% 6.40/1.77 % (412683)------------------------------
% 6.40/1.77 % (412683)------------------------------
% 6.40/1.77 % (412678)Success in time 0.915 s
% 6.40/1.77 % Vampire exiting
%------------------------------------------------------------------------------