TSTP Solution File: SWC101+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC101+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:41:45 EDT 2022
% Result : Theorem 1.68s 0.57s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of formulae : 63 ( 14 unt; 0 def)
% Number of atoms : 409 ( 156 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 543 ( 197 ~; 164 |; 151 &)
% ( 9 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 131 ( 85 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1342,plain,
$false,
inference(avatar_sat_refutation,[],[f613,f632,f643,f644,f1235,f1341]) ).
fof(f1341,plain,
( spl62_2
| ~ spl62_4
| spl62_6 ),
inference(avatar_contradiction_clause,[],[f1340]) ).
fof(f1340,plain,
( $false
| spl62_2
| ~ spl62_4
| spl62_6 ),
inference(subsumption_resolution,[],[f1339,f621]) ).
fof(f621,plain,
( ssList(nil)
| ~ spl62_4 ),
inference(avatar_component_clause,[],[f620]) ).
fof(f620,plain,
( spl62_4
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl62_4])]) ).
fof(f1339,plain,
( ~ ssList(nil)
| spl62_2
| spl62_6 ),
inference(subsumption_resolution,[],[f1338,f612]) ).
fof(f612,plain,
( nil != sK36
| spl62_2 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f610,plain,
( spl62_2
<=> nil = sK36 ),
introduced(avatar_definition,[new_symbols(naming,[spl62_2])]) ).
fof(f1338,plain,
( nil = sK36
| ~ ssList(nil)
| spl62_6 ),
inference(subsumption_resolution,[],[f1333,f473]) ).
fof(f473,plain,
ssList(sK36),
inference(cnf_transformation,[],[f305]) ).
fof(f305,plain,
( ssList(sK35)
& ssList(sK36)
& ( ~ frontsegP(sK35,sK34)
| ~ neq(sK34,nil) )
& sK34 = sK36
& ( nil = sK37
| nil != sK36 )
& sK35 = sK37
& ssList(sK37)
& ( nil != sK35
| nil != sK34 )
& app(sK36,sK38) = sK37
& equalelemsP(sK36)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK36
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != sK38 )
| ~ ssItem(X5) )
& ssList(sK38)
& ssList(sK34) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK34,sK35,sK36,sK37,sK38])],[f170,f304,f303,f302,f301,f300]) ).
fof(f300,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& X0 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3
& ssList(X3)
& ( nil != X1
| nil != X0 )
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) ) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ frontsegP(X1,sK34)
| ~ neq(sK34,nil) )
& sK34 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3
& ssList(X3)
& ( nil != X1
| nil != sK34 )
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) ) ) ) )
& ssList(sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f301,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ frontsegP(X1,sK34)
| ~ neq(sK34,nil) )
& sK34 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3
& ssList(X3)
& ( nil != X1
| nil != sK34 )
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) ) ) ) )
=> ( ssList(sK35)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ frontsegP(sK35,sK34)
| ~ neq(sK34,nil) )
& sK34 = X2
& ( nil = X3
| nil != X2 )
& sK35 = X3
& ssList(X3)
& ( nil != sK35
| nil != sK34 )
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f302,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ frontsegP(sK35,sK34)
| ~ neq(sK34,nil) )
& sK34 = X2
& ( nil = X3
| nil != X2 )
& sK35 = X3
& ssList(X3)
& ( nil != sK35
| nil != sK34 )
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) ) ) )
=> ( ssList(sK36)
& ? [X3] :
( ( ~ frontsegP(sK35,sK34)
| ~ neq(sK34,nil) )
& sK34 = sK36
& ( nil = X3
| nil != sK36 )
& sK35 = X3
& ssList(X3)
& ( nil != sK35
| nil != sK34 )
& ? [X4] :
( app(sK36,X4) = X3
& equalelemsP(sK36)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK36
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f303,plain,
( ? [X3] :
( ( ~ frontsegP(sK35,sK34)
| ~ neq(sK34,nil) )
& sK34 = sK36
& ( nil = X3
| nil != sK36 )
& sK35 = X3
& ssList(X3)
& ( nil != sK35
| nil != sK34 )
& ? [X4] :
( app(sK36,X4) = X3
& equalelemsP(sK36)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK36
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) ) )
=> ( ( ~ frontsegP(sK35,sK34)
| ~ neq(sK34,nil) )
& sK34 = sK36
& ( nil = sK37
| nil != sK36 )
& sK35 = sK37
& ssList(sK37)
& ( nil != sK35
| nil != sK34 )
& ? [X4] :
( app(sK36,X4) = sK37
& equalelemsP(sK36)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK36
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f304,plain,
( ? [X4] :
( app(sK36,X4) = sK37
& equalelemsP(sK36)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK36
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) )
=> ( app(sK36,sK38) = sK37
& equalelemsP(sK36)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK36
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != sK38 )
| ~ ssItem(X5) )
& ssList(sK38) ) ),
introduced(choice_axiom,[]) ).
fof(f170,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& X0 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3
& ssList(X3)
& ( nil != X1
| nil != X0 )
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& ssList(X4) ) ) ) )
& ssList(X0) ),
inference(flattening,[],[f169]) ).
fof(f169,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X1
| nil != X0 )
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& X0 = X2
& ( nil = X3
| nil != X2 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& 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 = X0
& nil = X1 )
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| X0 != X2
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) ) ) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X0
& nil = X1 )
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| X0 != X2
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) ) ) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f1333,plain,
( ~ ssList(sK36)
| ~ ssList(nil)
| nil = sK36
| spl62_6 ),
inference(resolution,[],[f373,f631]) ).
fof(f631,plain,
( ~ neq(sK36,nil)
| spl62_6 ),
inference(avatar_component_clause,[],[f629]) ).
fof(f629,plain,
( spl62_6
<=> neq(sK36,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl62_6])]) ).
fof(f373,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f245,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f117]) ).
fof(f117,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(f1235,plain,
spl62_5,
inference(avatar_split_clause,[],[f1234,f625]) ).
fof(f625,plain,
( spl62_5
<=> frontsegP(sK37,sK36) ),
introduced(avatar_definition,[new_symbols(naming,[spl62_5])]) ).
fof(f1234,plain,
frontsegP(sK37,sK36),
inference(subsumption_resolution,[],[f1233,f473]) ).
fof(f1233,plain,
( ~ ssList(sK36)
| frontsegP(sK37,sK36) ),
inference(subsumption_resolution,[],[f1227,f463]) ).
fof(f463,plain,
ssList(sK38),
inference(cnf_transformation,[],[f305]) ).
fof(f1227,plain,
( ~ ssList(sK38)
| ~ ssList(sK36)
| frontsegP(sK37,sK36) ),
inference(superposition,[],[f650,f641]) ).
fof(f641,plain,
app(sK36,sK38) = sK37,
inference(forward_demodulation,[],[f592,f593]) ).
fof(f593,plain,
sF58 = sK37,
inference(definition_folding,[],[f466,f592]) ).
fof(f466,plain,
app(sK36,sK38) = sK37,
inference(cnf_transformation,[],[f305]) ).
fof(f592,plain,
app(sK36,sK38) = sF58,
introduced(function_definition,[]) ).
fof(f650,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(subsumption_resolution,[],[f573,f432]) ).
fof(f432,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f219]) ).
fof(f219,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f573,plain,
! [X2,X1] :
( ~ ssList(X1)
| ~ ssList(app(X1,X2))
| frontsegP(app(X1,X2),X1)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f412]) ).
fof(f412,plain,
! [X2,X0,X1] :
( ~ ssList(X1)
| frontsegP(X0,X1)
| ~ ssList(X2)
| app(X1,X2) != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f277]) ).
fof(f277,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK28(X0,X1))
& app(X1,sK28(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28])],[f275,f276]) ).
fof(f276,plain,
! [X0,X1] :
( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
=> ( ssList(sK28(X0,X1))
& app(X1,sK28(X0,X1)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f275,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
| ~ frontsegP(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f274]) ).
fof(f274,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f141]) ).
fof(f141,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f644,plain,
( ~ spl62_1
| ~ spl62_2 ),
inference(avatar_split_clause,[],[f563,f610,f606]) ).
fof(f606,plain,
( spl62_1
<=> nil = sK37 ),
introduced(avatar_definition,[new_symbols(naming,[spl62_1])]) ).
fof(f563,plain,
( nil != sK36
| nil != sK37 ),
inference(definition_unfolding,[],[f467,f469,f471]) ).
fof(f471,plain,
sK34 = sK36,
inference(cnf_transformation,[],[f305]) ).
fof(f469,plain,
sK35 = sK37,
inference(cnf_transformation,[],[f305]) ).
fof(f467,plain,
( nil != sK35
| nil != sK34 ),
inference(cnf_transformation,[],[f305]) ).
fof(f643,plain,
spl62_4,
inference(avatar_split_clause,[],[f488,f620]) ).
fof(f488,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f632,plain,
( ~ spl62_5
| ~ spl62_6 ),
inference(avatar_split_clause,[],[f562,f629,f625]) ).
fof(f562,plain,
( ~ neq(sK36,nil)
| ~ frontsegP(sK37,sK36) ),
inference(definition_unfolding,[],[f472,f469,f471,f471]) ).
fof(f472,plain,
( ~ frontsegP(sK35,sK34)
| ~ neq(sK34,nil) ),
inference(cnf_transformation,[],[f305]) ).
fof(f613,plain,
( spl62_1
| ~ spl62_2 ),
inference(avatar_split_clause,[],[f470,f610,f606]) ).
fof(f470,plain,
( nil != sK36
| nil = sK37 ),
inference(cnf_transformation,[],[f305]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC101+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % 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.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 18:32:31 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.47 % (17494)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.49 % (17502)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.50 % (17492)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.51 % (17482)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.52 % (17485)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 % (17504)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.52 % (17493)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.52 % (17484)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.52 % (17503)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.53 % (17491)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.53 % (17481)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.53 % (17490)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.53 % (17497)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.53 % (17509)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.53 % (17496)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.53 % (17507)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 % (17486)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 % (17508)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.54 % (17489)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 % (17489)Instruction limit reached!
% 0.20/0.54 % (17489)------------------------------
% 0.20/0.54 % (17489)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (17489)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (17489)Termination reason: Unknown
% 0.20/0.54 % (17489)Termination phase: shuffling
% 0.20/0.54
% 0.20/0.54 % (17489)Memory used [KB]: 1023
% 0.20/0.54 % (17489)Time elapsed: 0.002 s
% 0.20/0.54 % (17489)Instructions burned: 3 (million)
% 0.20/0.54 % (17489)------------------------------
% 0.20/0.54 % (17489)------------------------------
% 0.20/0.54 % (17505)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 % (17500)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 % (17499)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.54 TRYING [1]
% 0.20/0.54 % (17483)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.56/0.54 % (17501)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.56/0.54 % (17495)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.56/0.55 % (17487)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)
% 1.56/0.55 % (17494)First to succeed.
% 1.56/0.55 % (17510)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.56/0.56 % (17488)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.68/0.56 % (17498)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.68/0.56 TRYING [2]
% 1.68/0.57 % (17482)Also succeeded, but the first one will report.
% 1.68/0.57 % (17494)Refutation found. Thanks to Tanya!
% 1.68/0.57 % SZS status Theorem for theBenchmark
% 1.68/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.68/0.57 % (17494)------------------------------
% 1.68/0.57 % (17494)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.68/0.57 % (17494)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.68/0.57 % (17494)Termination reason: Refutation
% 1.68/0.57
% 1.68/0.57 % (17494)Memory used [KB]: 6268
% 1.68/0.57 % (17494)Time elapsed: 0.142 s
% 1.68/0.57 % (17494)Instructions burned: 40 (million)
% 1.68/0.57 % (17494)------------------------------
% 1.68/0.57 % (17494)------------------------------
% 1.68/0.57 % (17480)Success in time 0.225 s
%------------------------------------------------------------------------------