TSTP Solution File: SWC387+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC387+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 : n027.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:31 EDT 2022
% Result : Theorem 0.14s 0.50s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 60 ( 13 unt; 3 typ; 0 def)
% Number of atoms : 351 ( 159 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 452 ( 158 ~; 130 |; 140 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 83 ( 40 !; 43 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_27,type,
sQ59_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_28,type,
sQ60_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_29,type,
sQ61_eqProxy: ( $real * $real ) > $o ).
fof(f1392,plain,
$false,
inference(subsumption_resolution,[],[f1391,f1233]) ).
fof(f1233,plain,
memberP(sK33,sK34),
inference(subsumption_resolution,[],[f1232,f984]) ).
fof(f984,plain,
nil != sK33,
inference(subsumption_resolution,[],[f718,f634]) ).
fof(f634,plain,
( nil != sK33
| nil = sK30 ),
inference(literal_reordering,[],[f563]) ).
fof(f563,plain,
( nil != sK33
| nil = sK30 ),
inference(definition_unfolding,[],[f452,f453]) ).
fof(f453,plain,
sK32 = sK30,
inference(cnf_transformation,[],[f294]) ).
fof(f294,plain,
( ssList(sK30)
& ! [X4] :
( ~ memberP(sK31,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK30 )
& ssList(sK33)
& sK32 = sK30
& ( nil != sK33
| nil = sK32 )
& ( ( memberP(sK33,sK34)
& cons(sK34,nil) = sK32
& ssItem(sK34) )
| ~ neq(sK33,nil) )
& sK31 = sK33
& ( nil != sK30
| nil != sK31 )
& ssList(sK32)
& ssList(sK31) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK30,sK31,sK32,sK33,sK34])],[f288,f293,f292,f291,f290,f289]) ).
fof(f289,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ memberP(X1,X4)
| ~ ssItem(X4)
| cons(X4,nil) != X0 )
& ssList(X3)
& X0 = X2
& ( nil != X3
| nil = X2 )
& ( ? [X5] :
( memberP(X3,X5)
& cons(X5,nil) = X2
& ssItem(X5) )
| ~ neq(X3,nil) )
& X1 = X3
& ( nil != X0
| nil != X1 ) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK30)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ memberP(X1,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK30 )
& ssList(X3)
& sK30 = X2
& ( nil != X3
| nil = X2 )
& ( ? [X5] :
( memberP(X3,X5)
& cons(X5,nil) = X2
& ssItem(X5) )
| ~ neq(X3,nil) )
& X1 = X3
& ( nil != sK30
| nil != X1 ) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f290,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ memberP(X1,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK30 )
& ssList(X3)
& sK30 = X2
& ( nil != X3
| nil = X2 )
& ( ? [X5] :
( memberP(X3,X5)
& cons(X5,nil) = X2
& ssItem(X5) )
| ~ neq(X3,nil) )
& X1 = X3
& ( nil != sK30
| nil != X1 ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ memberP(sK31,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK30 )
& ssList(X3)
& sK30 = X2
& ( nil != X3
| nil = X2 )
& ( ? [X5] :
( memberP(X3,X5)
& cons(X5,nil) = X2
& ssItem(X5) )
| ~ neq(X3,nil) )
& sK31 = X3
& ( nil != sK30
| nil != sK31 ) )
& ssList(X2) )
& ssList(sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f291,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ memberP(sK31,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK30 )
& ssList(X3)
& sK30 = X2
& ( nil != X3
| nil = X2 )
& ( ? [X5] :
( memberP(X3,X5)
& cons(X5,nil) = X2
& ssItem(X5) )
| ~ neq(X3,nil) )
& sK31 = X3
& ( nil != sK30
| nil != sK31 ) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ~ memberP(sK31,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK30 )
& ssList(X3)
& sK32 = sK30
& ( nil != X3
| nil = sK32 )
& ( ? [X5] :
( memberP(X3,X5)
& cons(X5,nil) = sK32
& ssItem(X5) )
| ~ neq(X3,nil) )
& sK31 = X3
& ( nil != sK30
| nil != sK31 ) )
& ssList(sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f292,plain,
( ? [X3] :
( ! [X4] :
( ~ memberP(sK31,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK30 )
& ssList(X3)
& sK32 = sK30
& ( nil != X3
| nil = sK32 )
& ( ? [X5] :
( memberP(X3,X5)
& cons(X5,nil) = sK32
& ssItem(X5) )
| ~ neq(X3,nil) )
& sK31 = X3
& ( nil != sK30
| nil != sK31 ) )
=> ( ! [X4] :
( ~ memberP(sK31,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK30 )
& ssList(sK33)
& sK32 = sK30
& ( nil != sK33
| nil = sK32 )
& ( ? [X5] :
( memberP(sK33,X5)
& cons(X5,nil) = sK32
& ssItem(X5) )
| ~ neq(sK33,nil) )
& sK31 = sK33
& ( nil != sK30
| nil != sK31 ) ) ),
introduced(choice_axiom,[]) ).
fof(f293,plain,
( ? [X5] :
( memberP(sK33,X5)
& cons(X5,nil) = sK32
& ssItem(X5) )
=> ( memberP(sK33,sK34)
& cons(sK34,nil) = sK32
& ssItem(sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f288,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ memberP(X1,X4)
| ~ ssItem(X4)
| cons(X4,nil) != X0 )
& ssList(X3)
& X0 = X2
& ( nil != X3
| nil = X2 )
& ( ? [X5] :
( memberP(X3,X5)
& cons(X5,nil) = X2
& ssItem(X5) )
| ~ neq(X3,nil) )
& X1 = X3
& ( nil != X0
| nil != X1 ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(rectify,[],[f195]) ).
fof(f195,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X5] :
( ~ memberP(X1,X5)
| ~ ssItem(X5)
| cons(X5,nil) != X0 )
& ssList(X3)
& X0 = X2
& ( nil != X3
| nil = X2 )
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ neq(X3,nil) )
& X1 = X3
& ( nil != X0
| nil != X1 ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f194]) ).
fof(f194,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ neq(X3,nil) )
& ( nil != X0
| nil != X1 )
& X1 = X3
& ( nil != X3
| nil = X2 )
& X0 = X2
& ! [X5] :
( ~ memberP(X1,X5)
| ~ ssItem(X5)
| cons(X5,nil) != X0 )
& 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)
=> ( ( ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) )
& neq(X3,nil) )
| ( nil = X1
& nil = X0 )
| X1 != X3
| ( nil = X3
& nil != X2 )
| X0 != X2
| ? [X5] :
( ssItem(X5)
& memberP(X1,X5)
& cons(X5,nil) = X0 ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| X0 != X2
| ( nil = X1
& nil = X0 )
| X1 != X3
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ssItem(X4)
& memberP(X1,X4)
& cons(X4,nil) = X0 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| X0 != X2
| ( nil = X1
& nil = X0 )
| X1 != X3
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ssItem(X4)
& memberP(X1,X4)
& cons(X4,nil) = X0 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f452,plain,
( nil != sK33
| nil = sK32 ),
inference(cnf_transformation,[],[f294]) ).
fof(f718,plain,
( nil != sK33
| nil != sK30 ),
inference(literal_reordering,[],[f565]) ).
fof(f565,plain,
( nil != sK30
| nil != sK33 ),
inference(definition_unfolding,[],[f447,f448]) ).
fof(f448,plain,
sK31 = sK33,
inference(cnf_transformation,[],[f294]) ).
fof(f447,plain,
( nil != sK30
| nil != sK31 ),
inference(cnf_transformation,[],[f294]) ).
fof(f1232,plain,
( nil = sK33
| memberP(sK33,sK34) ),
inference(subsumption_resolution,[],[f1231,f692]) ).
fof(f692,plain,
ssList(sK33),
inference(literal_reordering,[],[f454]) ).
fof(f454,plain,
ssList(sK33),
inference(cnf_transformation,[],[f294]) ).
fof(f1231,plain,
( ~ ssList(sK33)
| nil = sK33
| memberP(sK33,sK34) ),
inference(subsumption_resolution,[],[f1225,f748]) ).
fof(f748,plain,
ssList(nil),
inference(literal_reordering,[],[f522]) ).
fof(f522,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f1225,plain,
( ~ ssList(nil)
| memberP(sK33,sK34)
| ~ ssList(sK33)
| nil = sK33 ),
inference(resolution,[],[f688,f669]) ).
fof(f669,plain,
( ~ neq(sK33,nil)
| memberP(sK33,sK34) ),
inference(literal_reordering,[],[f451]) ).
fof(f451,plain,
( ~ neq(sK33,nil)
| memberP(sK33,sK34) ),
inference(cnf_transformation,[],[f294]) ).
fof(f688,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(literal_reordering,[],[f487]) ).
fof(f487,plain,
! [X0,X1] :
( ~ ssList(X0)
| X0 = X1
| ~ ssList(X1)
| neq(X0,X1) ),
inference(cnf_transformation,[],[f311]) ).
fof(f311,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f1391,plain,
~ memberP(sK33,sK34),
inference(subsumption_resolution,[],[f1380,f1239]) ).
fof(f1239,plain,
ssItem(sK34),
inference(subsumption_resolution,[],[f1238,f748]) ).
fof(f1238,plain,
( ~ ssList(nil)
| ssItem(sK34) ),
inference(subsumption_resolution,[],[f1237,f692]) ).
fof(f1237,plain,
( ssItem(sK34)
| ~ ssList(sK33)
| ~ ssList(nil) ),
inference(subsumption_resolution,[],[f1226,f984]) ).
fof(f1226,plain,
( ssItem(sK34)
| nil = sK33
| ~ ssList(nil)
| ~ ssList(sK33) ),
inference(resolution,[],[f688,f663]) ).
fof(f663,plain,
( ~ neq(sK33,nil)
| ssItem(sK34) ),
inference(literal_reordering,[],[f449]) ).
fof(f449,plain,
( ssItem(sK34)
| ~ neq(sK33,nil) ),
inference(cnf_transformation,[],[f294]) ).
fof(f1380,plain,
( ~ ssItem(sK34)
| ~ memberP(sK33,sK34) ),
inference(trivial_inequality_removal,[],[f1370]) ).
fof(f1370,plain,
( ~ memberP(sK33,sK34)
| sK30 != sK30
| ~ ssItem(sK34) ),
inference(superposition,[],[f667,f1236]) ).
fof(f1236,plain,
cons(sK34,nil) = sK30,
inference(subsumption_resolution,[],[f1235,f692]) ).
fof(f1235,plain,
( cons(sK34,nil) = sK30
| ~ ssList(sK33) ),
inference(subsumption_resolution,[],[f1234,f748]) ).
fof(f1234,plain,
( ~ ssList(nil)
| cons(sK34,nil) = sK30
| ~ ssList(sK33) ),
inference(subsumption_resolution,[],[f1224,f984]) ).
fof(f1224,plain,
( nil = sK33
| ~ ssList(nil)
| ~ ssList(sK33)
| cons(sK34,nil) = sK30 ),
inference(resolution,[],[f688,f647]) ).
fof(f647,plain,
( ~ neq(sK33,nil)
| cons(sK34,nil) = sK30 ),
inference(literal_reordering,[],[f564]) ).
fof(f564,plain,
( cons(sK34,nil) = sK30
| ~ neq(sK33,nil) ),
inference(definition_unfolding,[],[f450,f453]) ).
fof(f450,plain,
( cons(sK34,nil) = sK32
| ~ neq(sK33,nil) ),
inference(cnf_transformation,[],[f294]) ).
fof(f667,plain,
! [X4] :
( cons(X4,nil) != sK30
| ~ ssItem(X4)
| ~ memberP(sK33,X4) ),
inference(literal_reordering,[],[f562]) ).
fof(f562,plain,
! [X4] :
( cons(X4,nil) != sK30
| ~ ssItem(X4)
| ~ memberP(sK33,X4) ),
inference(definition_unfolding,[],[f455,f448]) ).
fof(f455,plain,
! [X4] :
( ~ memberP(sK31,X4)
| ~ ssItem(X4)
| cons(X4,nil) != sK30 ),
inference(cnf_transformation,[],[f294]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC387+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.29 % Computer : n027.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Tue Aug 30 19:07:31 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.14/0.40 % (724)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.14/0.43 % (711)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.14/0.43 % (725)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.14/0.43 % (735)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.14/0.44 % (718)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.14/0.44 % (717)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.14/0.45 % (718)Instruction limit reached!
% 0.14/0.45 % (718)------------------------------
% 0.14/0.45 % (718)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.45 % (718)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.45 % (718)Termination reason: Unknown
% 0.14/0.45 % (718)Termination phase: Property scanning
% 0.14/0.45
% 0.14/0.45 % (718)Memory used [KB]: 1279
% 0.14/0.45 % (718)Time elapsed: 0.010 s
% 0.14/0.45 % (718)Instructions burned: 7 (million)
% 0.14/0.45 % (718)------------------------------
% 0.14/0.45 % (718)------------------------------
% 0.14/0.46 % (734)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.14/0.46 % (721)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.14/0.46 % (739)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.14/0.46 % (715)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.14/0.47 % (719)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.14/0.47 % (719)Instruction limit reached!
% 0.14/0.47 % (719)------------------------------
% 0.14/0.47 % (719)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.47 % (719)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.47 % (719)Termination reason: Unknown
% 0.14/0.47 % (719)Termination phase: Unused predicate definition removal
% 0.14/0.47
% 0.14/0.47 % (719)Memory used [KB]: 1023
% 0.14/0.47 % (719)Time elapsed: 0.002 s
% 0.14/0.47 % (719)Instructions burned: 2 (million)
% 0.14/0.47 % (719)------------------------------
% 0.14/0.47 % (719)------------------------------
% 0.14/0.47 % (713)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.14/0.47 % (712)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.14/0.47 % (722)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.14/0.47 TRYING [1]
% 0.14/0.47 TRYING [2]
% 0.14/0.47 % (716)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.14/0.48 % (714)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.14/0.48 % (720)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.14/0.48 % (729)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.14/0.48 % (728)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.14/0.48 % (723)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.14/0.49 % (742)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.14/0.49 % (738)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.14/0.49 % (744)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.14/0.49 % (727)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.14/0.50 % (733)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.14/0.50 % (725)First to succeed.
% 0.14/0.50 % (731)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.14/0.50 % (736)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.14/0.50 % (712)Also succeeded, but the first one will report.
% 0.14/0.50 % (730)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.14/0.50 % (725)Refutation found. Thanks to Tanya!
% 0.14/0.50 % SZS status Theorem for theBenchmark
% 0.14/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.50 % (725)------------------------------
% 0.14/0.50 % (725)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.50 % (725)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.50 % (725)Termination reason: Refutation
% 0.14/0.50
% 0.14/0.50 % (725)Memory used [KB]: 6652
% 0.14/0.50 % (725)Time elapsed: 0.052 s
% 0.14/0.50 % (725)Instructions burned: 37 (million)
% 0.14/0.50 % (725)------------------------------
% 0.14/0.50 % (725)------------------------------
% 0.14/0.50 % (710)Success in time 0.2 s
%------------------------------------------------------------------------------