TSTP Solution File: SWC069+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC069+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 : n011.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:41:31 EDT 2022
% Result : Theorem 0.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 9 unt; 0 def)
% Number of atoms : 348 ( 108 equ)
% Maximal formula atoms : 38 ( 8 avg)
% Number of connectives : 467 ( 160 ~; 126 |; 157 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 80 ( 37 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f861,plain,
$false,
inference(subsumption_resolution,[],[f860,f544]) ).
fof(f544,plain,
ssList(sK56),
inference(cnf_transformation,[],[f347]) ).
fof(f347,plain,
( ssList(sK53)
& ssList(sK55)
& ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& ssList(sK56)
& sK55 = sK53
& sK54 = sK56
& ( ( segmentP(sK55,sK57)
& segmentP(sK56,sK57)
& ssList(sK57)
& neq(sK57,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 )
& ssList(sK54) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f341,f346,f345,f344,f343,f342]) ).
fof(f342,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ssList(X3)
& X0 = X2
& X1 = X3
& ( ? [X5] :
( segmentP(X2,X5)
& segmentP(X3,X5)
& ssList(X5)
& neq(X5,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 ) ) )
& ssList(X1) ) )
=> ( ssList(sK53)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != sK53
| nil != X1 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(sK53,X4) )
& ssList(X3)
& sK53 = X2
& X1 = X3
& ( ? [X5] :
( segmentP(X2,X5)
& segmentP(X3,X5)
& ssList(X5)
& neq(X5,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 ) ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != sK53
| nil != X1 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(sK53,X4) )
& ssList(X3)
& sK53 = X2
& X1 = X3
& ( ? [X5] :
( segmentP(X2,X5)
& segmentP(X3,X5)
& ssList(X5)
& neq(X5,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& ssList(X3)
& sK53 = X2
& sK54 = X3
& ( ? [X5] :
( segmentP(X2,X5)
& segmentP(X3,X5)
& ssList(X5)
& neq(X5,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 ) ) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& ssList(X3)
& sK53 = X2
& sK54 = X3
& ( ? [X5] :
( segmentP(X2,X5)
& segmentP(X3,X5)
& ssList(X5)
& neq(X5,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 ) ) )
=> ( ssList(sK55)
& ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& ssList(X3)
& sK55 = sK53
& sK54 = X3
& ( ? [X5] :
( segmentP(sK55,X5)
& segmentP(X3,X5)
& ssList(X5)
& neq(X5,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK55 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& ssList(X3)
& sK55 = sK53
& sK54 = X3
& ( ? [X5] :
( segmentP(sK55,X5)
& segmentP(X3,X5)
& ssList(X5)
& neq(X5,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = sK55 ) )
=> ( ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& ssList(sK56)
& sK55 = sK53
& sK54 = sK56
& ( ? [X5] :
( segmentP(sK55,X5)
& segmentP(sK56,X5)
& ssList(X5)
& neq(X5,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 ) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X5] :
( segmentP(sK55,X5)
& segmentP(sK56,X5)
& ssList(X5)
& neq(X5,nil) )
=> ( segmentP(sK55,sK57)
& segmentP(sK56,sK57)
& ssList(sK57)
& neq(sK57,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f341,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ssList(X3)
& X0 = X2
& X1 = X3
& ( ? [X5] :
( segmentP(X2,X5)
& segmentP(X3,X5)
& ssList(X5)
& neq(X5,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 ) ) )
& ssList(X1) ) ),
inference(rectify,[],[f182]) ).
fof(f182,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X1,X5)
| ~ segmentP(X0,X5) )
& ssList(X3)
& X0 = X2
& X1 = X3
& ( ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& ssList(X4)
& neq(X4,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 ) ) )
& ssList(X1) ) ),
inference(flattening,[],[f181]) ).
fof(f181,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ~ neq(X3,nil)
| ? [X4] :
( neq(X4,nil)
& segmentP(X2,X4)
& segmentP(X3,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X1,X5)
| ~ segmentP(X0,X5) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ segmentP(X2,X4)
| ~ segmentP(X3,X4) ) ) )
| ? [X5] :
( neq(X5,nil)
& segmentP(X1,X5)
& segmentP(X0,X5)
& ssList(X5) )
| ( nil = X1
& nil = X0 )
| ( nil = X3
& nil != X2 )
| X0 != X2 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X1
& nil = X0 )
| X0 != X2
| ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X3,X5) ) ) )
| X1 != X3
| ? [X4] :
( neq(X4,nil)
& ssList(X4)
& segmentP(X0,X4)
& segmentP(X1,X4) )
| ( nil = X3
& nil != X2 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X1
& nil = X0 )
| X0 != X2
| ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X3,X5) ) ) )
| X1 != X3
| ? [X4] :
( neq(X4,nil)
& ssList(X4)
& segmentP(X0,X4)
& segmentP(X1,X4) )
| ( nil = X3
& nil != X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f860,plain,
~ ssList(sK56),
inference(subsumption_resolution,[],[f859,f603]) ).
fof(f603,plain,
nil != sK56,
inference(subsumption_resolution,[],[f567,f564]) ).
fof(f564,plain,
( nil != sK53
| nil != sK56 ),
inference(definition_unfolding,[],[f546,f542]) ).
fof(f542,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f546,plain,
( nil != sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f347]) ).
fof(f567,plain,
( nil = sK53
| nil != sK56 ),
inference(definition_unfolding,[],[f537,f543]) ).
fof(f543,plain,
sK55 = sK53,
inference(cnf_transformation,[],[f347]) ).
fof(f537,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f859,plain,
( nil = sK56
| ~ ssList(sK56) ),
inference(subsumption_resolution,[],[f825,f427]) ).
fof(f427,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f825,plain,
( ~ ssList(nil)
| nil = sK56
| ~ ssList(sK56) ),
inference(resolution,[],[f411,f607]) ).
fof(f607,plain,
~ neq(sK56,nil),
inference(subsumption_resolution,[],[f606,f566]) ).
fof(f566,plain,
( ~ neq(sK56,nil)
| segmentP(sK53,sK57) ),
inference(definition_unfolding,[],[f541,f543]) ).
fof(f541,plain,
( segmentP(sK55,sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f606,plain,
( ~ segmentP(sK53,sK57)
| ~ neq(sK56,nil) ),
inference(subsumption_resolution,[],[f605,f540]) ).
fof(f540,plain,
( ~ neq(sK56,nil)
| segmentP(sK56,sK57) ),
inference(cnf_transformation,[],[f347]) ).
fof(f605,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK53,sK57)
| ~ segmentP(sK56,sK57) ),
inference(subsumption_resolution,[],[f604,f539]) ).
fof(f539,plain,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f347]) ).
fof(f604,plain,
( ~ segmentP(sK56,sK57)
| ~ segmentP(sK53,sK57)
| ~ neq(sK56,nil)
| ~ ssList(sK57) ),
inference(resolution,[],[f565,f538]) ).
fof(f538,plain,
( neq(sK57,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f565,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ ssList(X4)
| ~ segmentP(sK56,X4)
| ~ segmentP(sK53,X4) ),
inference(definition_unfolding,[],[f545,f542]) ).
fof(f545,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f411,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f265]) ).
fof(f265,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f187]) ).
fof(f187,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
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) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC069+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/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.35 % Computer : n011.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 Aug 30 18:04:10 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.52 % (27656)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.20/0.52 % (27640)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.52 % (27633)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.20/0.52 % (27649)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.52 % (27650)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.20/0.52 % (27637)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (27648)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.53 % (27640)Instruction limit reached!
% 0.20/0.53 % (27640)------------------------------
% 0.20/0.53 % (27640)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (27634)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.20/0.53 % (27636)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.20/0.53 % (27654)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)
% 0.20/0.53 % (27640)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (27640)Termination reason: Unknown
% 0.20/0.53 % (27640)Termination phase: Function definition elimination
% 0.20/0.53
% 0.20/0.53 % (27640)Memory used [KB]: 1279
% 0.20/0.53 % (27640)Time elapsed: 0.007 s
% 0.20/0.53 % (27640)Instructions burned: 8 (million)
% 0.20/0.53 % (27640)------------------------------
% 0.20/0.53 % (27640)------------------------------
% 0.20/0.53 % (27663)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)
% 0.20/0.54 % (27659)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.54 % (27658)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.54 % (27641)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.20/0.54 % (27641)Instruction limit reached!
% 0.20/0.54 % (27641)------------------------------
% 0.20/0.54 % (27641)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (27641)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (27641)Termination reason: Unknown
% 0.20/0.54 % (27641)Termination phase: Preprocessing 2
% 0.20/0.54
% 0.20/0.54 % (27641)Memory used [KB]: 1023
% 0.20/0.54 % (27641)Time elapsed: 0.002 s
% 0.20/0.54 % (27641)Instructions burned: 2 (million)
% 0.20/0.54 % (27641)------------------------------
% 0.20/0.54 % (27641)------------------------------
% 0.20/0.54 % (27646)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.54 % (27638)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)
% 0.20/0.54 % (27653)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)
% 0.20/0.54 % (27651)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.54 % (27652)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.54 % (27635)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.54 % (27647)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.55 % (27660)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.55 % (27642)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.55 % (27661)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)
% 0.20/0.55 % (27639)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.55 % (27657)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.55 % (27644)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)
% 0.20/0.55 % (27643)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.56 % (27656)First to succeed.
% 0.20/0.56 % (27662)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.56 % (27655)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.58 TRYING [1]
% 0.20/0.58 TRYING [2]
% 0.20/0.58 % (27656)Refutation found. Thanks to Tanya!
% 0.20/0.58 % SZS status Theorem for theBenchmark
% 0.20/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.58 % (27656)------------------------------
% 0.20/0.58 % (27656)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (27656)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (27656)Termination reason: Refutation
% 0.20/0.58
% 0.20/0.58 % (27656)Memory used [KB]: 1535
% 0.20/0.58 % (27656)Time elapsed: 0.105 s
% 0.20/0.58 % (27656)Instructions burned: 24 (million)
% 0.20/0.58 % (27656)------------------------------
% 0.20/0.58 % (27656)------------------------------
% 0.20/0.58 % (27632)Success in time 0.227 s
%------------------------------------------------------------------------------