TSTP Solution File: SWC353+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC353+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 : n001.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:20 EDT 2022
% Result : Theorem 2.04s 0.63s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 333 ( 116 equ)
% Maximal formula atoms : 38 ( 8 avg)
% Number of connectives : 453 ( 158 ~; 134 |; 139 &)
% ( 2 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 138 ( 90 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f705,plain,
$false,
inference(subsumption_resolution,[],[f704,f368]) ).
fof(f368,plain,
~ frontsegP(sK10,sK9),
inference(cnf_transformation,[],[f247]) ).
fof(f247,plain,
( ssList(sK10)
& ssList(sK13)
& sK12 = app(sK11,sK13)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK13
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK11)
& sK11 = sK9
& sK12 = sK10
& ssList(sK12)
& ~ frontsegP(sK10,sK9)
& ( nil = sK12
| nil != sK11 )
& ssList(sK11)
& ssList(sK9) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13])],[f134,f246,f245,f244,f243,f242]) ).
fof(f242,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2) )
& X0 = X2
& X1 = X3
& ssList(X3)
& ~ frontsegP(X1,X0)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2) )
& sK9 = X2
& X1 = X3
& ssList(X3)
& ~ frontsegP(X1,sK9)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) )
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f243,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2) )
& sK9 = X2
& X1 = X3
& ssList(X3)
& ~ frontsegP(X1,sK9)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) )
=> ( ssList(sK10)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2) )
& sK9 = X2
& sK10 = X3
& ssList(X3)
& ~ frontsegP(sK10,sK9)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f244,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2) )
& sK9 = X2
& sK10 = X3
& ssList(X3)
& ~ frontsegP(sK10,sK9)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ssList(X4)
& app(sK11,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK11) )
& sK11 = sK9
& sK10 = X3
& ssList(X3)
& ~ frontsegP(sK10,sK9)
& ( nil = X3
| nil != sK11 ) )
& ssList(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f245,plain,
( ? [X3] :
( ? [X4] :
( ssList(X4)
& app(sK11,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK11) )
& sK11 = sK9
& sK10 = X3
& ssList(X3)
& ~ frontsegP(sK10,sK9)
& ( nil = X3
| nil != sK11 ) )
=> ( ? [X4] :
( ssList(X4)
& app(sK11,X4) = sK12
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK11) )
& sK11 = sK9
& sK12 = sK10
& ssList(sK12)
& ~ frontsegP(sK10,sK9)
& ( nil = sK12
| nil != sK11 ) ) ),
introduced(choice_axiom,[]) ).
fof(f246,plain,
( ? [X4] :
( ssList(X4)
& app(sK11,X4) = sK12
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK11) )
=> ( ssList(sK13)
& sK12 = app(sK11,sK13)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK13
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2) )
& X0 = X2
& X1 = X3
& ssList(X3)
& ~ frontsegP(X1,X0)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f133]) ).
fof(f133,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil = X3
| nil != X2 )
& ~ frontsegP(X1,X0)
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& ssList(X4) )
& 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)
=> ( ( nil = X2
& nil != X3 )
| frontsegP(X1,X0)
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& leq(X7,X5) ) )
& ssList(X6) ) )
| ~ totalorderedP(X2) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| frontsegP(X1,X0)
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& leq(X7,X5) ) )
& ssList(X6) ) )
| ~ totalorderedP(X2) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f704,plain,
frontsegP(sK10,sK9),
inference(subsumption_resolution,[],[f703,f604]) ).
fof(f604,plain,
ssList(sK9),
inference(forward_demodulation,[],[f366,f371]) ).
fof(f371,plain,
sK11 = sK9,
inference(cnf_transformation,[],[f247]) ).
fof(f366,plain,
ssList(sK11),
inference(cnf_transformation,[],[f247]) ).
fof(f703,plain,
( ~ ssList(sK9)
| frontsegP(sK10,sK9) ),
inference(subsumption_resolution,[],[f698,f375]) ).
fof(f375,plain,
ssList(sK13),
inference(cnf_transformation,[],[f247]) ).
fof(f698,plain,
( ~ ssList(sK13)
| ~ ssList(sK9)
| frontsegP(sK10,sK9) ),
inference(superposition,[],[f597,f601]) ).
fof(f601,plain,
app(sK9,sK13) = sK10,
inference(backward_demodulation,[],[f599,f371]) ).
fof(f599,plain,
app(sK11,sK13) = sK10,
inference(backward_demodulation,[],[f587,f598]) ).
fof(f598,plain,
sF58 = sK10,
inference(forward_demodulation,[],[f588,f370]) ).
fof(f370,plain,
sK12 = sK10,
inference(cnf_transformation,[],[f247]) ).
fof(f588,plain,
sF58 = sK12,
inference(definition_folding,[],[f374,f587]) ).
fof(f374,plain,
sK12 = app(sK11,sK13),
inference(cnf_transformation,[],[f247]) ).
fof(f587,plain,
sF58 = app(sK11,sK13),
introduced(function_definition,[]) ).
fof(f597,plain,
! [X3,X1] :
( frontsegP(app(X1,X3),X1)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(subsumption_resolution,[],[f565,f533]) ).
fof(f533,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f565,plain,
! [X3,X1] :
( ~ ssList(X1)
| ~ ssList(app(X1,X3))
| frontsegP(app(X1,X3),X1)
| ~ ssList(X3) ),
inference(equality_resolution,[],[f390]) ).
fof(f390,plain,
! [X3,X0,X1] :
( ~ ssList(X0)
| frontsegP(X0,X1)
| ~ ssList(X3)
| app(X1,X3) != X0
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f255]) ).
fof(f255,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( ( ssList(sK14(X0,X1))
& app(X1,sK14(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( ~ ssList(X3)
| app(X1,X3) != X0 ) ) )
| ~ ssList(X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f253,f254]) ).
fof(f254,plain,
! [X0,X1] :
( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
=> ( ssList(sK14(X0,X1))
& app(X1,sK14(X0,X1)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( ~ ssList(X3)
| app(X1,X3) != X0 ) ) )
| ~ ssList(X1) ) ),
inference(rectify,[],[f252]) ).
fof(f252,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f194]) ).
fof(f194,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
<=> frontsegP(X0,X1) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
<=> frontsegP(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC353+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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.14/0.34 % Computer : n001.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 19:11:02 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.57 % (30704)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.21/0.58 % (30721)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.21/0.58 % (30713)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.21/0.59 % (30720)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)
% 0.21/0.59 % (30705)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.59 % (30712)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.79/0.60 % (30706)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.79/0.60 % (30705)Instruction limit reached!
% 1.79/0.60 % (30705)------------------------------
% 1.79/0.60 % (30705)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.79/0.60 % (30702)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.79/0.60 % (30705)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.79/0.60 % (30705)Termination reason: Unknown
% 1.79/0.60 % (30705)Termination phase: Property scanning
% 1.79/0.60
% 1.79/0.60 % (30705)Memory used [KB]: 1279
% 1.79/0.60 % (30705)Time elapsed: 0.013 s
% 1.79/0.60 % (30705)Instructions burned: 7 (million)
% 1.79/0.60 % (30705)------------------------------
% 1.79/0.60 % (30705)------------------------------
% 1.79/0.61 % (30725)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.79/0.61 % (30726)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.79/0.61 % (30698)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.79/0.61 % (30700)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.79/0.61 % (30703)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.79/0.61 TRYING [1]
% 2.04/0.62 % (30701)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)
% 2.04/0.62 TRYING [2]
% 2.04/0.62 % (30699)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)
% 2.04/0.62 % (30706)Instruction limit reached!
% 2.04/0.62 % (30706)------------------------------
% 2.04/0.62 % (30706)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.04/0.62 % (30706)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.04/0.62 % (30706)Termination reason: Unknown
% 2.04/0.62 % (30706)Termination phase: Naming
% 2.04/0.62
% 2.04/0.62 % (30706)Memory used [KB]: 1023
% 2.04/0.62 % (30706)Time elapsed: 0.004 s
% 2.04/0.62 % (30706)Instructions burned: 3 (million)
% 2.04/0.62 % (30706)------------------------------
% 2.04/0.62 % (30706)------------------------------
% 2.04/0.62 % (30724)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)
% 2.04/0.62 % (30718)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)
% 2.04/0.62 % (30713)First to succeed.
% 2.04/0.62 % (30716)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 2.04/0.62 % (30723)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 2.04/0.63 % (30719)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 2.04/0.63 % (30717)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)
% 2.04/0.63 % (30715)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 2.04/0.63 % (30713)Refutation found. Thanks to Tanya!
% 2.04/0.63 % SZS status Theorem for theBenchmark
% 2.04/0.63 % SZS output start Proof for theBenchmark
% See solution above
% 2.04/0.63 % (30713)------------------------------
% 2.04/0.63 % (30713)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.04/0.63 % (30713)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.04/0.63 % (30713)Termination reason: Refutation
% 2.04/0.63
% 2.04/0.63 % (30713)Memory used [KB]: 1535
% 2.04/0.63 % (30713)Time elapsed: 0.136 s
% 2.04/0.63 % (30713)Instructions burned: 22 (million)
% 2.04/0.63 % (30713)------------------------------
% 2.04/0.63 % (30713)------------------------------
% 2.04/0.63 % (30697)Success in time 0.277 s
%------------------------------------------------------------------------------