TSTP Solution File: SWC101+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC101+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n023.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 : Wed Aug 31 18:38:48 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 57 ( 13 unt; 0 def)
% Number of atoms : 390 ( 152 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 521 ( 188 ~; 154 |; 151 &)
% ( 8 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 123 ( 77 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f698,plain,
$false,
inference(avatar_sat_refutation,[],[f250,f259,f260,f597,f690]) ).
fof(f690,plain,
spl14_1,
inference(avatar_contradiction_clause,[],[f689]) ).
fof(f689,plain,
( $false
| spl14_1 ),
inference(subsumption_resolution,[],[f688,f245]) ).
fof(f245,plain,
( ~ frontsegP(sK9,sK8)
| spl14_1 ),
inference(avatar_component_clause,[],[f243]) ).
fof(f243,plain,
( spl14_1
<=> frontsegP(sK9,sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f688,plain,
frontsegP(sK9,sK8),
inference(subsumption_resolution,[],[f687,f226]) ).
fof(f226,plain,
ssList(sK9),
inference(definition_unfolding,[],[f198,f192]) ).
fof(f192,plain,
sK7 = sK9,
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
( ssList(sK7)
& ssList(sK8)
& equalelemsP(sK8)
& ssList(sK10)
& app(sK8,sK10) = sK9
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != sK10
| ! [X7] :
( app(X7,cons(X5,nil)) != sK8
| ~ ssList(X7) )
| ~ ssList(X6) ) )
& sK7 = sK9
& ssList(sK9)
& ( ~ neq(sK6,nil)
| ~ frontsegP(sK7,sK6) )
& sK6 = sK8
& ( nil != sK7
| nil != sK6 )
& ( nil = sK9
| nil != sK8 )
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10])],[f100,f150,f149,f148,f147,f146]) ).
fof(f146,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
& X1 = X3
& ssList(X3)
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& X0 = X2
& ( nil != X1
| nil != X0 )
& ( nil = X3
| nil != X2 ) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
& X1 = X3
& ssList(X3)
& ( ~ neq(sK6,nil)
| ~ frontsegP(X1,sK6) )
& sK6 = X2
& ( nil != X1
| nil != sK6 )
& ( nil = X3
| nil != X2 ) ) ) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
& X1 = X3
& ssList(X3)
& ( ~ neq(sK6,nil)
| ~ frontsegP(X1,sK6) )
& sK6 = X2
& ( nil != X1
| nil != sK6 )
& ( nil = X3
| nil != X2 ) ) ) )
=> ( ssList(sK7)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
& sK7 = X3
& ssList(X3)
& ( ~ neq(sK6,nil)
| ~ frontsegP(sK7,sK6) )
& sK6 = X2
& ( nil != sK7
| nil != sK6 )
& ( nil = X3
| nil != X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
& sK7 = X3
& ssList(X3)
& ( ~ neq(sK6,nil)
| ~ frontsegP(sK7,sK6) )
& sK6 = X2
& ( nil != sK7
| nil != sK6 )
& ( nil = X3
| nil != X2 ) ) )
=> ( ssList(sK8)
& ? [X3] :
( ? [X4] :
( equalelemsP(sK8)
& ssList(X4)
& app(sK8,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != sK8
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
& sK7 = X3
& ssList(X3)
& ( ~ neq(sK6,nil)
| ~ frontsegP(sK7,sK6) )
& sK6 = sK8
& ( nil != sK7
| nil != sK6 )
& ( nil = X3
| nil != sK8 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X3] :
( ? [X4] :
( equalelemsP(sK8)
& ssList(X4)
& app(sK8,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != sK8
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
& sK7 = X3
& ssList(X3)
& ( ~ neq(sK6,nil)
| ~ frontsegP(sK7,sK6) )
& sK6 = sK8
& ( nil != sK7
| nil != sK6 )
& ( nil = X3
| nil != sK8 ) )
=> ( ? [X4] :
( equalelemsP(sK8)
& ssList(X4)
& app(sK8,X4) = sK9
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != sK8
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
& sK7 = sK9
& ssList(sK9)
& ( ~ neq(sK6,nil)
| ~ frontsegP(sK7,sK6) )
& sK6 = sK8
& ( nil != sK7
| nil != sK6 )
& ( nil = sK9
| nil != sK8 ) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X4] :
( equalelemsP(sK8)
& ssList(X4)
& app(sK8,X4) = sK9
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != sK8
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
=> ( equalelemsP(sK8)
& ssList(sK10)
& app(sK8,sK10) = sK9
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != sK10
| ! [X7] :
( app(X7,cons(X5,nil)) != sK8
| ~ ssList(X7) )
| ~ ssList(X6) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6) ) ) )
& X1 = X3
& ssList(X3)
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& X0 = X2
& ( nil != X1
| nil != X0 )
& ( nil = X3
| nil != X2 ) ) ) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ( ~ neq(X0,nil)
| ~ frontsegP(X1,X0) )
& X1 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6) ) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( nil != X1
| nil != X0 )
& 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)
=> ( X0 != X2
| ( neq(X0,nil)
& frontsegP(X1,X0) )
| X1 != X3
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& ssList(X6)
& app(cons(X5,nil),X6) = X4 )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| ( nil != X3
& nil = X2 )
| ( nil = X1
& nil = X0 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( neq(X0,nil)
& frontsegP(X1,X0) )
| X1 != X3
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& ssList(X6)
& app(cons(X5,nil),X6) = X4 )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| ( nil != X3
& nil = X2 )
| ( nil = X1
& nil = X0 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f198,plain,
ssList(sK7),
inference(cnf_transformation,[],[f151]) ).
fof(f687,plain,
( ~ ssList(sK9)
| frontsegP(sK9,sK8) ),
inference(subsumption_resolution,[],[f686,f229]) ).
fof(f229,plain,
ssList(sK8),
inference(definition_unfolding,[],[f186,f189]) ).
fof(f189,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f151]) ).
fof(f186,plain,
ssList(sK6),
inference(cnf_transformation,[],[f151]) ).
fof(f686,plain,
( ~ ssList(sK8)
| ~ ssList(sK9)
| frontsegP(sK9,sK8) ),
inference(subsumption_resolution,[],[f675,f195]) ).
fof(f195,plain,
ssList(sK10),
inference(cnf_transformation,[],[f151]) ).
fof(f675,plain,
( ~ ssList(sK10)
| ~ ssList(sK8)
| ~ ssList(sK9)
| frontsegP(sK9,sK8) ),
inference(superposition,[],[f237,f194]) ).
fof(f194,plain,
app(sK8,sK10) = sK9,
inference(cnf_transformation,[],[f151]) ).
fof(f237,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(app(X1,X2))
| ~ ssList(X1) ),
inference(equality_resolution,[],[f221]) ).
fof(f221,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| frontsegP(X0,X1)
| ~ ssList(X2)
| app(X1,X2) != X0
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK13(X0,X1))
& app(X1,sK13(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f161,f162]) ).
fof(f162,plain,
! [X0,X1] :
( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
=> ( ssList(sK13(X0,X1))
& app(X1,sK13(X0,X1)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(rectify,[],[f160]) ).
fof(f160,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(f597,plain,
( spl14_2
| spl14_4 ),
inference(avatar_contradiction_clause,[],[f596]) ).
fof(f596,plain,
( $false
| spl14_2
| spl14_4 ),
inference(subsumption_resolution,[],[f595,f258]) ).
fof(f258,plain,
( nil != sK8
| spl14_4 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f256,plain,
( spl14_4
<=> nil = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f595,plain,
( nil = sK8
| spl14_2 ),
inference(unit_resulting_resolution,[],[f229,f224,f249,f207]) ).
fof(f207,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f154]) ).
fof(f154,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f249,plain,
( ~ neq(sK8,nil)
| spl14_2 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f247,plain,
( spl14_2
<=> neq(sK8,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f224,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f260,plain,
( spl14_3
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f187,f256,f252]) ).
fof(f252,plain,
( spl14_3
<=> nil = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f187,plain,
( nil != sK8
| nil = sK9 ),
inference(cnf_transformation,[],[f151]) ).
fof(f259,plain,
( ~ spl14_3
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f228,f256,f252]) ).
fof(f228,plain,
( nil != sK8
| nil != sK9 ),
inference(definition_unfolding,[],[f188,f192,f189]) ).
fof(f188,plain,
( nil != sK7
| nil != sK6 ),
inference(cnf_transformation,[],[f151]) ).
fof(f250,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f227,f247,f243]) ).
fof(f227,plain,
( ~ neq(sK8,nil)
| ~ frontsegP(sK9,sK8) ),
inference(definition_unfolding,[],[f190,f189,f192,f189]) ).
fof(f190,plain,
( ~ neq(sK6,nil)
| ~ frontsegP(sK7,sK6) ),
inference(cnf_transformation,[],[f151]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC101+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 18:38:50 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.52 % (5650)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.52 % (5664)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.52 % (5656)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53 % (5648)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.53 % (5643)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (5658)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.53 % (5641)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53 % (5653)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.53 % (5656)Instruction limit reached!
% 0.20/0.53 % (5656)------------------------------
% 0.20/0.53 % (5656)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (5656)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (5656)Termination reason: Unknown
% 0.20/0.53 % (5656)Termination phase: Function definition elimination
% 0.20/0.53
% 0.20/0.53 % (5656)Memory used [KB]: 1791
% 0.20/0.53 % (5656)Time elapsed: 0.009 s
% 0.20/0.53 % (5656)Instructions burned: 8 (million)
% 0.20/0.53 % (5656)------------------------------
% 0.20/0.53 % (5656)------------------------------
% 0.20/0.53 % (5640)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.53 % (5641)Instruction limit reached!
% 0.20/0.53 % (5641)------------------------------
% 0.20/0.53 % (5641)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (5658)Instruction limit reached!
% 0.20/0.54 % (5658)------------------------------
% 0.20/0.54 % (5658)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (5658)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (5658)Termination reason: Unknown
% 0.20/0.54 % (5658)Termination phase: Naming
% 0.20/0.54
% 0.20/0.54 % (5658)Memory used [KB]: 1535
% 0.20/0.54 % (5658)Time elapsed: 0.003 s
% 0.20/0.54 % (5658)Instructions burned: 3 (million)
% 0.20/0.54 % (5658)------------------------------
% 0.20/0.54 % (5658)------------------------------
% 0.20/0.54 % (5641)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (5641)Termination reason: Unknown
% 0.20/0.54 % (5641)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (5641)Memory used [KB]: 6396
% 0.20/0.54 % (5641)Time elapsed: 0.109 s
% 0.20/0.54 % (5641)Instructions burned: 13 (million)
% 0.20/0.54 % (5641)------------------------------
% 0.20/0.54 % (5641)------------------------------
% 0.20/0.54 % (5653)Instruction limit reached!
% 0.20/0.54 % (5653)------------------------------
% 0.20/0.54 % (5653)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (5650)First to succeed.
% 0.20/0.54 % (5651)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.54 % (5669)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.55 % (5660)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.55 % (5670)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.55 % (5644)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.55 % (5650)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (5650)------------------------------
% 0.20/0.55 % (5650)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (5650)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (5650)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (5650)Memory used [KB]: 6524
% 0.20/0.55 % (5650)Time elapsed: 0.109 s
% 0.20/0.55 % (5650)Instructions burned: 25 (million)
% 0.20/0.55 % (5650)------------------------------
% 0.20/0.55 % (5650)------------------------------
% 0.20/0.55 % (5635)Success in time 0.184 s
%------------------------------------------------------------------------------