TSTP Solution File: SWC254+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC254+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_sat --cores 0 -t %d %s
% Computer : n025.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:42:43 EDT 2022
% Result : Theorem 2.06s 0.64s
% Output : Refutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 15 unt; 0 def)
% Number of atoms : 267 ( 74 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 282 ( 70 ~; 64 |; 124 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 113 ( 66 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1233,plain,
$false,
inference(resolution,[],[f1190,f610]) ).
fof(f610,plain,
sP6(sK33,sK33,sK32,sK32),
inference(subsumption_resolution,[],[f608,f609]) ).
fof(f609,plain,
( sP6(sK33,sK33,sK32,sK32)
| ~ neq(sK33,nil) ),
inference(forward_demodulation,[],[f607,f458]) ).
fof(f458,plain,
sK33 = sK35,
inference(cnf_transformation,[],[f298]) ).
fof(f298,plain,
( ssList(sK32)
& ssList(sK34)
& sK34 = sK32
& ( sP6(sK33,sK35,sK34,sK32)
| ( neq(sK33,nil)
& ~ neq(sK35,nil) ) )
& ssList(sK35)
& sK33 = sK35
& ssList(sK33) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK32,sK33,sK34,sK35])],[f233,f297,f296,f295,f294]) ).
fof(f294,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ( sP6(X1,X3,X2,X0)
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3)
& X1 = X3 ) )
& ssList(X1) ) )
=> ( ssList(sK32)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK32 = X2
& ( sP6(X1,X3,X2,sK32)
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3)
& X1 = X3 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f295,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK32 = X2
& ( sP6(X1,X3,X2,sK32)
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3)
& X1 = X3 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK32 = X2
& ( sP6(sK33,X3,X2,sK32)
| ( neq(sK33,nil)
& ~ neq(X3,nil) ) )
& ssList(X3)
& sK33 = X3 ) )
& ssList(sK33) ) ),
introduced(choice_axiom,[]) ).
fof(f296,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK32 = X2
& ( sP6(sK33,X3,X2,sK32)
| ( neq(sK33,nil)
& ~ neq(X3,nil) ) )
& ssList(X3)
& sK33 = X3 ) )
=> ( ssList(sK34)
& ? [X3] :
( sK34 = sK32
& ( sP6(sK33,X3,sK34,sK32)
| ( neq(sK33,nil)
& ~ neq(X3,nil) ) )
& ssList(X3)
& sK33 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f297,plain,
( ? [X3] :
( sK34 = sK32
& ( sP6(sK33,X3,sK34,sK32)
| ( neq(sK33,nil)
& ~ neq(X3,nil) ) )
& ssList(X3)
& sK33 = X3 )
=> ( sK34 = sK32
& ( sP6(sK33,sK35,sK34,sK32)
| ( neq(sK33,nil)
& ~ neq(sK35,nil) ) )
& ssList(sK35)
& sK33 = sK35 ) ),
introduced(choice_axiom,[]) ).
fof(f233,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ( sP6(X1,X3,X2,X0)
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3)
& X1 = X3 ) )
& ssList(X1) ) ),
inference(definition_folding,[],[f116,f232]) ).
fof(f232,plain,
! [X1,X3,X2,X0] :
( ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ~ singletonP(X0) )
| ~ sP6(X1,X3,X2,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f116,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ( ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ~ singletonP(X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3)
& X1 = X3 ) )
& ssList(X1) ) ),
inference(flattening,[],[f115]) ).
fof(f115,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( cons(X4,nil) = X2
& app(X5,cons(X4,nil)) = X3
& ssList(X5) )
& ssItem(X4) )
& ~ singletonP(X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& X0 = X2
& X1 = X3
& 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)
=> ( ( ( ~ neq(X1,nil)
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( cons(X4,nil) != X2
| app(X5,cons(X4,nil)) != X3 ) ) )
| singletonP(X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ neq(X1,nil)
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( cons(X4,nil) != X2
| app(X5,cons(X4,nil)) != X3 ) ) )
| singletonP(X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f607,plain,
( sP6(sK33,sK33,sK32,sK32)
| ~ neq(sK35,nil) ),
inference(backward_demodulation,[],[f604,f458]) ).
fof(f604,plain,
( ~ neq(sK35,nil)
| sP6(sK33,sK35,sK32,sK32) ),
inference(forward_demodulation,[],[f460,f462]) ).
fof(f462,plain,
sK34 = sK32,
inference(cnf_transformation,[],[f298]) ).
fof(f460,plain,
( sP6(sK33,sK35,sK34,sK32)
| ~ neq(sK35,nil) ),
inference(cnf_transformation,[],[f298]) ).
fof(f608,plain,
( neq(sK33,nil)
| sP6(sK33,sK33,sK32,sK32) ),
inference(backward_demodulation,[],[f603,f458]) ).
fof(f603,plain,
( neq(sK33,nil)
| sP6(sK33,sK35,sK32,sK32) ),
inference(backward_demodulation,[],[f461,f462]) ).
fof(f461,plain,
( sP6(sK33,sK35,sK34,sK32)
| neq(sK33,nil) ),
inference(cnf_transformation,[],[f298]) ).
fof(f1190,plain,
! [X2,X0,X1] : ~ sP6(X0,X1,X2,sK32),
inference(resolution,[],[f1128,f451]) ).
fof(f451,plain,
! [X2,X3,X0,X1] :
( ~ singletonP(X3)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f293]) ).
fof(f293,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& app(sK31(X1,X2),cons(sK30(X1,X2),nil)) = X1
& cons(sK30(X1,X2),nil) = X2
& ssList(sK31(X1,X2))
& ssItem(sK30(X1,X2))
& ~ singletonP(X3) )
| ~ sP6(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK30,sK31])],[f290,f292,f291]) ).
fof(f291,plain,
! [X1,X2] :
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( app(X5,cons(sK30(X1,X2),nil)) = X1
& cons(sK30(X1,X2),nil) = X2
& ssList(X5) )
& ssItem(sK30(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f292,plain,
! [X1,X2] :
( ? [X5] :
( app(X5,cons(sK30(X1,X2),nil)) = X1
& cons(sK30(X1,X2),nil) = X2
& ssList(X5) )
=> ( app(sK31(X1,X2),cons(sK30(X1,X2),nil)) = X1
& cons(sK30(X1,X2),nil) = X2
& ssList(sK31(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f290,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ~ singletonP(X3) )
| ~ sP6(X0,X1,X2,X3) ),
inference(rectify,[],[f289]) ).
fof(f289,plain,
! [X1,X3,X2,X0] :
( ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ~ singletonP(X0) )
| ~ sP6(X1,X3,X2,X0) ),
inference(nnf_transformation,[],[f232]) ).
fof(f1128,plain,
singletonP(sK32),
inference(subsumption_resolution,[],[f1127,f1011]) ).
fof(f1011,plain,
ssItem(hd(sK32)),
inference(backward_demodulation,[],[f697,f1008]) ).
fof(f1008,plain,
sK30(sK33,sK32) = hd(sK32),
inference(backward_demodulation,[],[f746,f1006]) ).
fof(f1006,plain,
sK32 = cons(sK30(sK33,sK32),nil),
inference(resolution,[],[f454,f610]) ).
fof(f454,plain,
! [X2,X3,X0,X1] :
( ~ sP6(X0,X1,X2,X3)
| cons(sK30(X1,X2),nil) = X2 ),
inference(cnf_transformation,[],[f293]) ).
fof(f746,plain,
sK30(sK33,sK32) = hd(cons(sK30(sK33,sK32),nil)),
inference(resolution,[],[f733,f428]) ).
fof(f428,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f733,plain,
! [X20] :
( ~ ssList(X20)
| sK30(sK33,sK32) = hd(cons(sK30(sK33,sK32),X20)) ),
inference(resolution,[],[f363,f697]) ).
fof(f363,plain,
! [X0,X1] :
( ~ ssItem(X1)
| hd(cons(X1,X0)) = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f205]) ).
fof(f205,plain,
! [X0] :
( ! [X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> hd(cons(X1,X0)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax23) ).
fof(f697,plain,
ssItem(sK30(sK33,sK32)),
inference(resolution,[],[f452,f610]) ).
fof(f452,plain,
! [X2,X3,X0,X1] :
( ~ sP6(X0,X1,X2,X3)
| ssItem(sK30(X1,X2)) ),
inference(cnf_transformation,[],[f293]) ).
fof(f1127,plain,
( ~ ssItem(hd(sK32))
| singletonP(sK32) ),
inference(subsumption_resolution,[],[f1115,f464]) ).
fof(f464,plain,
ssList(sK32),
inference(cnf_transformation,[],[f298]) ).
fof(f1115,plain,
( ~ ssList(sK32)
| singletonP(sK32)
| ~ ssItem(hd(sK32)) ),
inference(superposition,[],[f572,f1088]) ).
fof(f1088,plain,
cons(hd(sK32),nil) = sK32,
inference(backward_demodulation,[],[f1006,f1008]) ).
fof(f572,plain,
! [X2] :
( ~ ssList(cons(X2,nil))
| singletonP(cons(X2,nil))
| ~ ssItem(X2) ),
inference(equality_resolution,[],[f372]) ).
fof(f372,plain,
! [X2,X0] :
( singletonP(X0)
| ~ ssItem(X2)
| cons(X2,nil) != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f241]) ).
fof(f241,plain,
! [X0] :
( ( ( ( ssItem(sK7(X0))
& cons(sK7(X0),nil) = X0 )
| ~ singletonP(X0) )
& ( singletonP(X0)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,nil) != X0 ) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f239,f240]) ).
fof(f240,plain,
! [X0] :
( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
=> ( ssItem(sK7(X0))
& cons(sK7(X0),nil) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f239,plain,
! [X0] :
( ( ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) )
& ( singletonP(X0)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,nil) != X0 ) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f238]) ).
fof(f238,plain,
! [X0] :
( ( ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) )
& ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
<=> singletonP(X0) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
<=> singletonP(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC254+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n025.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:48:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.56 % (32211)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.56 % (32210)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.57 % (32227)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.57 % (32221)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.57 % (32229)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.57 % (32218)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.57 % (32219)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.58 % (32213)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.58 % (32206)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.58 % (32208)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.67/0.58 % (32207)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.67/0.58 % (32217)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.67/0.58 % (32211)Instruction limit reached!
% 1.67/0.58 % (32211)------------------------------
% 1.67/0.58 % (32211)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.67/0.58 % (32211)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.67/0.58 % (32211)Termination reason: Unknown
% 1.67/0.58 % (32211)Termination phase: Property scanning
% 1.67/0.58
% 1.67/0.58 % (32211)Memory used [KB]: 1279
% 1.67/0.58 % (32211)Time elapsed: 0.008 s
% 1.67/0.58 % (32211)Instructions burned: 8 (million)
% 1.67/0.58 % (32211)------------------------------
% 1.67/0.58 % (32211)------------------------------
% 1.67/0.58 % (32225)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.67/0.59 % (32205)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.67/0.59 % (32209)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.67/0.59 % (32204)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.67/0.59 % (32214)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.67/0.59 % (32226)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.67/0.59 % (32224)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.67/0.59 % (32222)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.67/0.59 % (32215)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.82/0.60 % (32233)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.82/0.60 TRYING [1]
% 1.82/0.60 TRYING [2]
% 1.82/0.60 % (32230)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.82/0.60 % (32212)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.82/0.60 % (32212)Instruction limit reached!
% 1.82/0.60 % (32212)------------------------------
% 1.82/0.60 % (32212)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.82/0.60 % (32212)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.82/0.60 % (32212)Termination reason: Unknown
% 1.82/0.60 % (32212)Termination phase: Preprocessing 1
% 1.82/0.60
% 1.82/0.60 % (32212)Memory used [KB]: 895
% 1.82/0.60 % (32212)Time elapsed: 0.002 s
% 1.82/0.60 % (32212)Instructions burned: 2 (million)
% 1.82/0.60 % (32212)------------------------------
% 1.82/0.60 % (32212)------------------------------
% 1.82/0.60 % (32220)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.82/0.61 % (32232)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.82/0.61 % (32231)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.82/0.61 TRYING [1]
% 1.82/0.61 % (32216)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.82/0.61 TRYING [2]
% 1.82/0.61 % (32223)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.82/0.62 % (32228)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.82/0.62 TRYING [1]
% 1.82/0.62 TRYING [2]
% 2.03/0.63 TRYING [3]
% 2.06/0.63 % (32219)First to succeed.
% 2.06/0.63 % (32221)Instruction limit reached!
% 2.06/0.63 % (32221)------------------------------
% 2.06/0.63 % (32221)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.06/0.63 % (32205)Refutation not found, incomplete strategy% (32205)------------------------------
% 2.06/0.63 % (32205)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.06/0.63 % (32205)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.06/0.63 % (32205)Termination reason: Refutation not found, incomplete strategy
% 2.06/0.63
% 2.06/0.63 % (32205)Memory used [KB]: 6012
% 2.06/0.63 % (32205)Time elapsed: 0.162 s
% 2.06/0.63 % (32205)Instructions burned: 20 (million)
% 2.06/0.63 % (32205)------------------------------
% 2.06/0.63 % (32205)------------------------------
% 2.06/0.64 TRYING [3]
% 2.06/0.64 % (32210)Instruction limit reached!
% 2.06/0.64 % (32210)------------------------------
% 2.06/0.64 % (32210)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.06/0.64 % (32210)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.06/0.64 % (32210)Termination reason: Unknown
% 2.06/0.64 % (32210)Termination phase: Finite model building constraint generation
% 2.06/0.64
% 2.06/0.64 % (32210)Memory used [KB]: 7547
% 2.06/0.64 % (32210)Time elapsed: 0.179 s
% 2.06/0.64 % (32210)Instructions burned: 52 (million)
% 2.06/0.64 % (32210)------------------------------
% 2.06/0.64 % (32210)------------------------------
% 2.06/0.64 % (32219)Refutation found. Thanks to Tanya!
% 2.06/0.64 % SZS status Theorem for theBenchmark
% 2.06/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 2.06/0.64 % (32219)------------------------------
% 2.06/0.64 % (32219)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.06/0.64 % (32219)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.06/0.64 % (32219)Termination reason: Refutation
% 2.06/0.64
% 2.06/0.64 % (32219)Memory used [KB]: 1918
% 2.06/0.64 % (32219)Time elapsed: 0.198 s
% 2.06/0.64 % (32219)Instructions burned: 53 (million)
% 2.06/0.64 % (32219)------------------------------
% 2.06/0.64 % (32219)------------------------------
% 2.06/0.64 % (32203)Success in time 0.277 s
%------------------------------------------------------------------------------