TSTP Solution File: SWC328+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Apr 30 16:20:57 EDT 2024
% Result : Theorem 0.21s 0.39s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 36
% Syntax : Number of formulae : 109 ( 48 unt; 0 def)
% Number of atoms : 318 ( 74 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 312 ( 103 ~; 79 |; 95 &)
% ( 19 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 37 ( 35 usr; 18 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 81 ( 57 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f775,plain,
$false,
inference(avatar_sat_refutation,[],[f698,f703,f708,f713,f718,f723,f728,f733,f738,f743,f747,f751,f756,f760,f764,f768,f772,f774]) ).
fof(f774,plain,
( ~ spl69_2
| spl69_13
| ~ spl69_17 ),
inference(avatar_split_clause,[],[f773,f770,f753,f700]) ).
fof(f700,plain,
( spl69_2
<=> ssList(sK21) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_2])]) ).
fof(f753,plain,
( spl69_13
<=> segmentP(sK21,sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_13])]) ).
fof(f770,plain,
( spl69_17
<=> ! [X0] :
( segmentP(X0,sK20)
| ~ ssList(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_17])]) ).
fof(f773,plain,
( ~ ssList(sK21)
| spl69_13
| ~ spl69_17 ),
inference(resolution,[],[f771,f755]) ).
fof(f755,plain,
( ~ segmentP(sK21,sK20)
| spl69_13 ),
inference(avatar_component_clause,[],[f753]) ).
fof(f771,plain,
( ! [X0] :
( segmentP(X0,sK20)
| ~ ssList(X0) )
| ~ spl69_17 ),
inference(avatar_component_clause,[],[f770]) ).
fof(f772,plain,
spl69_17,
inference(avatar_split_clause,[],[f631,f770]) ).
fof(f631,plain,
! [X0] :
( segmentP(X0,sK20)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f451,f378]) ).
fof(f378,plain,
nil = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& sK18 = sK20
& sK19 = sK21
& nil = sK20
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f99,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(X1,sK18) )
& sK18 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(X1,sK18) )
& sK18 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& sK18 = X2
& sK19 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& sK18 = X2
& sK19 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& sK18 = sK20
& sK19 = X3
& nil = sK20
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& sK18 = sK20
& sK19 = X3
& nil = sK20
& ssList(X3) )
=> ( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& sK18 = sK20
& sK19 = sK21
& nil = sK20
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f451,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).
fof(f768,plain,
spl69_16,
inference(avatar_split_clause,[],[f630,f766]) ).
fof(f766,plain,
( spl69_16
<=> ! [X0] :
( frontsegP(X0,sK20)
| ~ ssList(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_16])]) ).
fof(f630,plain,
! [X0] :
( frontsegP(X0,sK20)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f448,f378]) ).
fof(f448,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f45]) ).
fof(f45,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(f764,plain,
spl69_15,
inference(avatar_split_clause,[],[f629,f762]) ).
fof(f762,plain,
( spl69_15
<=> ! [X0] :
( rearsegP(X0,sK20)
| ~ ssList(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_15])]) ).
fof(f629,plain,
! [X0] :
( rearsegP(X0,sK20)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f446,f378]) ).
fof(f446,plain,
! [X0] :
( rearsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0] :
( rearsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(f760,plain,
spl69_14,
inference(avatar_split_clause,[],[f611,f758]) ).
fof(f758,plain,
( spl69_14
<=> ! [X0] :
( ~ memberP(sK20,X0)
| ~ ssItem(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_14])]) ).
fof(f611,plain,
! [X0] :
( ~ memberP(sK20,X0)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f391,f378]) ).
fof(f391,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f756,plain,
( ~ spl69_13
| ~ spl69_10 ),
inference(avatar_split_clause,[],[f599,f740,f753]) ).
fof(f740,plain,
( spl69_10
<=> equalelemsP(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_10])]) ).
fof(f599,plain,
( ~ equalelemsP(sK20)
| ~ segmentP(sK21,sK20) ),
inference(definition_unfolding,[],[f381,f380,f379,f380]) ).
fof(f379,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f380,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f381,plain,
( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) ),
inference(cnf_transformation,[],[f254]) ).
fof(f751,plain,
spl69_12,
inference(avatar_split_clause,[],[f666,f749]) ).
fof(f749,plain,
( spl69_12
<=> ! [X1] : sP2(sK20,X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_12])]) ).
fof(f666,plain,
! [X1] : sP2(sK20,X1),
inference(equality_resolution,[],[f625]) ).
fof(f625,plain,
! [X0,X1] :
( sP2(X0,X1)
| sK20 != X0 ),
inference(definition_unfolding,[],[f440,f378]) ).
fof(f440,plain,
! [X0,X1] :
( sP2(X0,X1)
| nil != X0 ),
inference(cnf_transformation,[],[f271]) ).
fof(f271,plain,
! [X0,X1] :
( ( sP2(X0,X1)
| ( ( ~ lt(X1,hd(X0))
| ~ strictorderedP(X0)
| nil = X0 )
& nil != X0 ) )
& ( ( lt(X1,hd(X0))
& strictorderedP(X0)
& nil != X0 )
| nil = X0
| ~ sP2(X0,X1) ) ),
inference(rectify,[],[f270]) ).
fof(f270,plain,
! [X1,X0] :
( ( sP2(X1,X0)
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ sP2(X1,X0) ) ),
inference(flattening,[],[f269]) ).
fof(f269,plain,
! [X1,X0] :
( ( sP2(X1,X0)
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ sP2(X1,X0) ) ),
inference(nnf_transformation,[],[f226]) ).
fof(f226,plain,
! [X1,X0] :
( sP2(X1,X0)
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f747,plain,
spl69_11,
inference(avatar_split_clause,[],[f664,f745]) ).
fof(f745,plain,
( spl69_11
<=> ! [X1] : sP0(sK20,X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_11])]) ).
fof(f664,plain,
! [X1] : sP0(sK20,X1),
inference(equality_resolution,[],[f620]) ).
fof(f620,plain,
! [X0,X1] :
( sP0(X0,X1)
| sK20 != X0 ),
inference(definition_unfolding,[],[f432,f378]) ).
fof(f432,plain,
! [X0,X1] :
( sP0(X0,X1)
| nil != X0 ),
inference(cnf_transformation,[],[f267]) ).
fof(f267,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ( ( ~ leq(X1,hd(X0))
| ~ totalorderedP(X0)
| nil = X0 )
& nil != X0 ) )
& ( ( leq(X1,hd(X0))
& totalorderedP(X0)
& nil != X0 )
| nil = X0
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f266]) ).
fof(f266,plain,
! [X1,X0] :
( ( sP0(X1,X0)
| ( ( ~ leq(X0,hd(X1))
| ~ totalorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1
| ~ sP0(X1,X0) ) ),
inference(flattening,[],[f265]) ).
fof(f265,plain,
! [X1,X0] :
( ( sP0(X1,X0)
| ( ( ~ leq(X0,hd(X1))
| ~ totalorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1
| ~ sP0(X1,X0) ) ),
inference(nnf_transformation,[],[f223]) ).
fof(f223,plain,
! [X1,X0] :
( sP0(X1,X0)
<=> ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f743,plain,
spl69_10,
inference(avatar_split_clause,[],[f609,f740]) ).
fof(f609,plain,
equalelemsP(sK20),
inference(definition_unfolding,[],[f389,f378]) ).
fof(f389,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax74) ).
fof(f738,plain,
spl69_9,
inference(avatar_split_clause,[],[f608,f735]) ).
fof(f735,plain,
( spl69_9
<=> totalorderedP(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_9])]) ).
fof(f608,plain,
totalorderedP(sK20),
inference(definition_unfolding,[],[f388,f378]) ).
fof(f388,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f733,plain,
spl69_8,
inference(avatar_split_clause,[],[f607,f730]) ).
fof(f730,plain,
( spl69_8
<=> strictorderedP(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_8])]) ).
fof(f607,plain,
strictorderedP(sK20),
inference(definition_unfolding,[],[f387,f378]) ).
fof(f387,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f728,plain,
spl69_7,
inference(avatar_split_clause,[],[f606,f725]) ).
fof(f725,plain,
( spl69_7
<=> strictorderP(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_7])]) ).
fof(f606,plain,
strictorderP(sK20),
inference(definition_unfolding,[],[f386,f378]) ).
fof(f386,plain,
strictorderP(nil),
inference(cnf_transformation,[],[f64]) ).
fof(f64,axiom,
strictorderP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax64) ).
fof(f723,plain,
spl69_6,
inference(avatar_split_clause,[],[f605,f720]) ).
fof(f720,plain,
( spl69_6
<=> cyclefreeP(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_6])]) ).
fof(f605,plain,
cyclefreeP(sK20),
inference(definition_unfolding,[],[f385,f378]) ).
fof(f385,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).
fof(f718,plain,
spl69_5,
inference(avatar_split_clause,[],[f604,f715]) ).
fof(f715,plain,
( spl69_5
<=> totalorderP(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_5])]) ).
fof(f604,plain,
totalorderP(sK20),
inference(definition_unfolding,[],[f384,f378]) ).
fof(f384,plain,
totalorderP(nil),
inference(cnf_transformation,[],[f62]) ).
fof(f62,axiom,
totalorderP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax62) ).
fof(f713,plain,
spl69_4,
inference(avatar_split_clause,[],[f603,f710]) ).
fof(f710,plain,
( spl69_4
<=> duplicatefreeP(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_4])]) ).
fof(f603,plain,
duplicatefreeP(sK20),
inference(definition_unfolding,[],[f383,f378]) ).
fof(f383,plain,
duplicatefreeP(nil),
inference(cnf_transformation,[],[f72]) ).
fof(f72,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax72) ).
fof(f708,plain,
~ spl69_3,
inference(avatar_split_clause,[],[f602,f705]) ).
fof(f705,plain,
( spl69_3
<=> singletonP(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_3])]) ).
fof(f602,plain,
~ singletonP(sK20),
inference(definition_unfolding,[],[f382,f378]) ).
fof(f382,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f703,plain,
spl69_2,
inference(avatar_split_clause,[],[f377,f700]) ).
fof(f377,plain,
ssList(sK21),
inference(cnf_transformation,[],[f254]) ).
fof(f698,plain,
spl69_1,
inference(avatar_split_clause,[],[f376,f695]) ).
fof(f695,plain,
( spl69_1
<=> ssList(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_1])]) ).
fof(f376,plain,
ssList(sK20),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 03:59:35 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (30139)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.37 % (30142)WARNING: value z3 for option sas not known
% 0.21/0.37 % (30140)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.37 % (30143)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.37 % (30142)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.37 % (30141)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.37 % (30144)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.21/0.37 % (30146)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.37 % (30145)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.21/0.38 % (30144)First to succeed.
% 0.21/0.39 % (30145)Also succeeded, but the first one will report.
% 0.21/0.39 % (30142)Also succeeded, but the first one will report.
% 0.21/0.39 % (30144)Refutation found. Thanks to Tanya!
% 0.21/0.39 % SZS status Theorem for theBenchmark
% 0.21/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.39 % (30144)------------------------------
% 0.21/0.39 % (30144)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.39 % (30144)Termination reason: Refutation
% 0.21/0.39
% 0.21/0.39 % (30144)Memory used [KB]: 1256
% 0.21/0.39 % (30144)Time elapsed: 0.012 s
% 0.21/0.39 % (30144)Instructions burned: 19 (million)
% 0.21/0.39 % (30144)------------------------------
% 0.21/0.39 % (30144)------------------------------
% 0.21/0.39 % (30139)Success in time 0.032 s
%------------------------------------------------------------------------------