TSTP Solution File: SWC351+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC351+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 : n019.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:43:19 EDT 2022
% Result : Theorem 1.53s 0.59s
% Output : Refutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 335 ( 111 equ)
% Maximal formula atoms : 40 ( 10 avg)
% Number of connectives : 462 ( 159 ~; 133 |; 150 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 10 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 130 ( 82 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f650,plain,
$false,
inference(subsumption_resolution,[],[f649,f405]) ).
fof(f405,plain,
ssList(sK22),
inference(cnf_transformation,[],[f263]) ).
fof(f263,plain,
( ssList(sK20)
& neq(sK19,nil)
& sK18 = sK20
& strictorderedP(sK20)
& ssList(sK22)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK22
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& sK21 = app(sK20,sK22)
& ( nil = sK21
| nil != sK20 )
& sK19 = sK21
& ~ frontsegP(sK19,sK18)
& ssList(sK21)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f110,f262,f261,f260,f259,f258]) ).
fof(f258,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( neq(X1,nil)
& X0 = X2
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ~ frontsegP(X1,X0)
& ssList(X3) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( neq(X1,nil)
& sK18 = X2
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ~ frontsegP(X1,sK18)
& ssList(X3) ) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f259,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( neq(X1,nil)
& sK18 = X2
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ~ frontsegP(X1,sK18)
& ssList(X3) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( neq(sK19,nil)
& sK18 = X2
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& sK19 = X3
& ~ frontsegP(sK19,sK18)
& ssList(X3) ) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f260,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( neq(sK19,nil)
& sK18 = X2
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& sK19 = X3
& ~ frontsegP(sK19,sK18)
& ssList(X3) ) )
=> ( ssList(sK20)
& ? [X3] :
( neq(sK19,nil)
& sK18 = sK20
& ? [X4] :
( strictorderedP(sK20)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(sK20,X4) = X3 )
& ( nil = X3
| nil != sK20 )
& sK19 = X3
& ~ frontsegP(sK19,sK18)
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f261,plain,
( ? [X3] :
( neq(sK19,nil)
& sK18 = sK20
& ? [X4] :
( strictorderedP(sK20)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(sK20,X4) = X3 )
& ( nil = X3
| nil != sK20 )
& sK19 = X3
& ~ frontsegP(sK19,sK18)
& ssList(X3) )
=> ( neq(sK19,nil)
& sK18 = sK20
& ? [X4] :
( strictorderedP(sK20)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(sK20,X4) = sK21 )
& ( nil = sK21
| nil != sK20 )
& sK19 = sK21
& ~ frontsegP(sK19,sK18)
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f262,plain,
( ? [X4] :
( strictorderedP(sK20)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(sK20,X4) = sK21 )
=> ( strictorderedP(sK20)
& ssList(sK22)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK22
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& sK21 = app(sK20,sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( neq(X1,nil)
& X0 = X2
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ~ frontsegP(X1,X0)
& ssList(X3) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f109]) ).
fof(f109,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& ~ frontsegP(X1,X0)
& ( nil = X3
| nil != X2 )
& X1 = X3
& ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& app(X2,X4) = X3
& ssList(X4) )
& X0 = 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)
=> ( ~ neq(X1,nil)
| frontsegP(X1,X0)
| ( nil = X2
& nil != X3 )
| X1 != X3
| ! [X4] :
( ssList(X4)
=> ( ~ strictorderedP(X2)
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& ssList(X6)
& ? [X7] :
( ? [X8] :
( lt(X7,X5)
& ssList(X8)
& app(X8,cons(X7,nil)) = X2 )
& ssItem(X7) ) )
& ssItem(X5) )
| app(X2,X4) != X3 ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ neq(X1,nil)
| frontsegP(X1,X0)
| ( nil = X2
& nil != X3 )
| X1 != X3
| ! [X4] :
( ssList(X4)
=> ( ~ strictorderedP(X2)
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& ssList(X6)
& ? [X7] :
( ? [X8] :
( lt(X7,X5)
& ssList(X8)
& app(X8,cons(X7,nil)) = X2 )
& ssItem(X7) ) )
& ssItem(X5) )
| app(X2,X4) != X3 ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f649,plain,
~ ssList(sK22),
inference(subsumption_resolution,[],[f648,f562]) ).
fof(f562,plain,
~ frontsegP(sK21,sK20),
inference(definition_unfolding,[],[f400,f401,f407]) ).
fof(f407,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f263]) ).
fof(f401,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f263]) ).
fof(f400,plain,
~ frontsegP(sK19,sK18),
inference(cnf_transformation,[],[f263]) ).
fof(f648,plain,
( frontsegP(sK21,sK20)
| ~ ssList(sK22) ),
inference(subsumption_resolution,[],[f647,f399]) ).
fof(f399,plain,
ssList(sK21),
inference(cnf_transformation,[],[f263]) ).
fof(f647,plain,
( ~ ssList(sK21)
| frontsegP(sK21,sK20)
| ~ ssList(sK22) ),
inference(subsumption_resolution,[],[f644,f564]) ).
fof(f564,plain,
ssList(sK20),
inference(definition_unfolding,[],[f397,f407]) ).
fof(f397,plain,
ssList(sK18),
inference(cnf_transformation,[],[f263]) ).
fof(f644,plain,
( ~ ssList(sK20)
| ~ ssList(sK22)
| frontsegP(sK21,sK20)
| ~ ssList(sK21) ),
inference(superposition,[],[f574,f403]) ).
fof(f403,plain,
sK21 = app(sK20,sK22),
inference(cnf_transformation,[],[f263]) ).
fof(f574,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(app(X1,X2))
| ~ ssList(X1) ),
inference(equality_resolution,[],[f446]) ).
fof(f446,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f288]) ).
fof(f288,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK35(X0,X1)) = X0
& ssList(sK35(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK35])],[f286,f287]) ).
fof(f287,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK35(X0,X1)) = X0
& ssList(sK35(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f286,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f285]) ).
fof(f285,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f197]) ).
fof(f197,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWC351+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Aug 30 18:52:35 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.22/0.50 % (22141)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.22/0.51 % (22143)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.51 % (22143)Instruction limit reached!
% 0.22/0.51 % (22143)------------------------------
% 0.22/0.51 % (22143)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.51 % (22143)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.51 % (22143)Termination reason: Unknown
% 0.22/0.51 % (22143)Termination phase: Preprocessing 1
% 0.22/0.51
% 0.22/0.51 % (22143)Memory used [KB]: 895
% 0.22/0.51 % (22143)Time elapsed: 0.002 s
% 0.22/0.51 % (22143)Instructions burned: 2 (million)
% 0.22/0.51 % (22143)------------------------------
% 0.22/0.51 % (22143)------------------------------
% 0.22/0.51 % (22138)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)
% 0.22/0.52 % (22149)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.22/0.52 % (22159)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.22/0.53 % (22135)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)
% 0.22/0.53 % (22151)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)
% 0.22/0.54 % (22150)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.22/0.54 % (22136)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)
% 0.22/0.55 TRYING [1]
% 0.22/0.55 % (22157)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.36/0.55 TRYING [2]
% 1.36/0.55 % (22146)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.36/0.55 % (22158)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)
% 1.36/0.56 % (22154)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.36/0.56 % (22140)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.36/0.56 % (22141)Instruction limit reached!
% 1.36/0.56 % (22141)------------------------------
% 1.36/0.56 % (22141)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.56 % (22141)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.56 % (22141)Termination reason: Unknown
% 1.36/0.56 % (22141)Termination phase: Finite model building constraint generation
% 1.36/0.56
% 1.36/0.56 % (22141)Memory used [KB]: 7164
% 1.36/0.56 % (22141)Time elapsed: 0.128 s
% 1.36/0.56 % (22141)Instructions burned: 51 (million)
% 1.36/0.56 % (22141)------------------------------
% 1.36/0.56 % (22141)------------------------------
% 1.36/0.56 % (22162)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.36/0.57 % (22147)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.53/0.57 % (22144)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)
% 1.53/0.57 % (22139)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.53/0.57 % (22152)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.53/0.58 % (22161)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.53/0.58 % (22155)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.53/0.58 % (22153)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.53/0.58 TRYING [1]
% 1.53/0.58 TRYING [2]
% 1.53/0.58 % (22163)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.53/0.58 % (22137)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)
% 1.53/0.59 % (22160)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.53/0.59 % (22136)First to succeed.
% 1.53/0.59 % (22145)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.53/0.59 % (22136)Refutation found. Thanks to Tanya!
% 1.53/0.59 % SZS status Theorem for theBenchmark
% 1.53/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.53/0.59 % (22136)------------------------------
% 1.53/0.59 % (22136)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.59 % (22136)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.59 % (22136)Termination reason: Refutation
% 1.53/0.59
% 1.53/0.59 % (22136)Memory used [KB]: 6012
% 1.53/0.59 % (22136)Time elapsed: 0.166 s
% 1.53/0.59 % (22136)Instructions burned: 18 (million)
% 1.53/0.59 % (22136)------------------------------
% 1.53/0.59 % (22136)------------------------------
% 1.53/0.59 % (22134)Success in time 0.217 s
%------------------------------------------------------------------------------