TSTP Solution File: SWC422+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC422+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_uns --cores 0 -t %d %s
% Computer : n017.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:06 EDT 2022
% Result : Theorem 1.36s 0.54s
% Output : Refutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 53 ( 5 unt; 0 def)
% Number of atoms : 399 ( 117 equ)
% Maximal formula atoms : 38 ( 7 avg)
% Number of connectives : 513 ( 167 ~; 146 |; 172 &)
% ( 7 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 138 ( 62 !; 76 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f268,plain,
$false,
inference(avatar_sat_refutation,[],[f223,f233,f244,f249,f250,f252,f254,f262]) ).
fof(f262,plain,
( ~ spl11_3
| ~ spl11_5
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8
| ~ spl11_9 ),
inference(avatar_contradiction_clause,[],[f261]) ).
fof(f261,plain,
( $false
| ~ spl11_3
| ~ spl11_5
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8
| ~ spl11_9 ),
inference(subsumption_resolution,[],[f260,f227]) ).
fof(f227,plain,
( ssList(sK8)
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f225,plain,
( spl11_5
<=> ssList(sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f260,plain,
( ~ ssList(sK8)
| ~ spl11_3
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8
| ~ spl11_9 ),
inference(subsumption_resolution,[],[f259,f248]) ).
fof(f248,plain,
( sK5 = app(app(sK7,cons(sK6,nil)),sK8)
| ~ spl11_9 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f246,plain,
( spl11_9
<=> sK5 = app(app(sK7,cons(sK6,nil)),sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_9])]) ).
fof(f259,plain,
( sK5 != app(app(sK7,cons(sK6,nil)),sK8)
| ~ ssList(sK8)
| ~ spl11_3
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f258,f217]) ).
fof(f217,plain,
( ssItem(sK6)
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f215,plain,
( spl11_3
<=> ssItem(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f258,plain,
( ~ ssItem(sK6)
| sK5 != app(app(sK7,cons(sK6,nil)),sK8)
| ~ ssList(sK8)
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f257,f242]) ).
fof(f242,plain,
( ssList(sK7)
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f240,plain,
( spl11_8
<=> ssList(sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_8])]) ).
fof(f257,plain,
( ~ ssList(sK7)
| ~ ssList(sK8)
| ~ ssItem(sK6)
| sK5 != app(app(sK7,cons(sK6,nil)),sK8)
| ~ spl11_6
| ~ spl11_7 ),
inference(trivial_inequality_removal,[],[f255]) ).
fof(f255,plain,
( sK4 != sK4
| ~ ssItem(sK6)
| ~ ssList(sK8)
| sK5 != app(app(sK7,cons(sK6,nil)),sK8)
| ~ ssList(sK7)
| ~ spl11_6
| ~ spl11_7 ),
inference(superposition,[],[f236,f232]) ).
fof(f232,plain,
( sK4 = app(app(sK8,cons(sK6,nil)),sK7)
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f230]) ).
fof(f230,plain,
( spl11_6
<=> sK4 = app(app(sK8,cons(sK6,nil)),sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
fof(f236,plain,
( ! [X8,X9,X7] :
( app(app(X9,cons(X7,nil)),X8) != sK4
| ~ ssList(X9)
| ~ ssItem(X7)
| ~ ssList(X8)
| app(app(X8,cons(X7,nil)),X9) != sK5 )
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f235]) ).
fof(f235,plain,
( spl11_7
<=> ! [X9,X8,X7] :
( ~ ssList(X8)
| ~ ssList(X9)
| app(app(X8,cons(X7,nil)),X9) != sK5
| app(app(X9,cons(X7,nil)),X8) != sK4
| ~ ssItem(X7) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_7])]) ).
fof(f254,plain,
( ~ spl11_4
| spl11_7 ),
inference(avatar_split_clause,[],[f194,f235,f219]) ).
fof(f219,plain,
( spl11_4
<=> neq(sK5,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f194,plain,
! [X8,X9,X7] :
( app(app(X9,cons(X7,nil)),X8) != sK4
| app(app(X8,cons(X7,nil)),X9) != sK5
| ~ neq(sK5,nil)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssList(X9) ),
inference(definition_unfolding,[],[f151,f167,f165]) ).
fof(f165,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
( sK3 = sK5
& ssList(sK5)
& sK2 = sK4
& ( ( neq(sK3,nil)
& ~ neq(sK5,nil) )
| ( neq(sK3,nil)
& ssItem(sK6)
& ssList(sK7)
& sK5 = app(app(sK7,cons(sK6,nil)),sK8)
& sK4 = app(app(sK8,cons(sK6,nil)),sK7)
& ssList(sK8)
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != sK3
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != sK2 ) )
| ~ ssItem(X7) ) ) )
& ssList(sK4)
& ssList(sK3)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f123,f130,f129,f128,f127,f126,f125,f124]) ).
fof(f124,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& X0 = X2
& ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X3
& app(app(X6,cons(X4,nil)),X5) = X2
& ssList(X6) ) ) )
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != X1
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != X0 ) )
| ~ ssItem(X7) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& sK2 = X2
& ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X3
& app(app(X6,cons(X4,nil)),X5) = X2
& ssList(X6) ) ) )
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != X1
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != sK2 ) )
| ~ ssItem(X7) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& sK2 = X2
& ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X3
& app(app(X6,cons(X4,nil)),X5) = X2
& ssList(X6) ) ) )
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != X1
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != sK2 ) )
| ~ ssItem(X7) ) ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK3 = X3
& ssList(X3)
& sK2 = X2
& ( ( neq(sK3,nil)
& ~ neq(X3,nil) )
| ( neq(sK3,nil)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X3
& app(app(X6,cons(X4,nil)),X5) = X2
& ssList(X6) ) ) )
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != sK3
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != sK2 ) )
| ~ ssItem(X7) ) ) ) )
& ssList(X2) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X2] :
( ? [X3] :
( sK3 = X3
& ssList(X3)
& sK2 = X2
& ( ( neq(sK3,nil)
& ~ neq(X3,nil) )
| ( neq(sK3,nil)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X3
& app(app(X6,cons(X4,nil)),X5) = X2
& ssList(X6) ) ) )
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != sK3
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != sK2 ) )
| ~ ssItem(X7) ) ) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK3 = X3
& ssList(X3)
& sK2 = sK4
& ( ( neq(sK3,nil)
& ~ neq(X3,nil) )
| ( neq(sK3,nil)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X3
& app(app(X6,cons(X4,nil)),X5) = sK4
& ssList(X6) ) ) )
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != sK3
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != sK2 ) )
| ~ ssItem(X7) ) ) ) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X3] :
( sK3 = X3
& ssList(X3)
& sK2 = sK4
& ( ( neq(sK3,nil)
& ~ neq(X3,nil) )
| ( neq(sK3,nil)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X3
& app(app(X6,cons(X4,nil)),X5) = sK4
& ssList(X6) ) ) )
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != sK3
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != sK2 ) )
| ~ ssItem(X7) ) ) ) )
=> ( sK3 = sK5
& ssList(sK5)
& sK2 = sK4
& ( ( neq(sK3,nil)
& ~ neq(sK5,nil) )
| ( neq(sK3,nil)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = sK5
& app(app(X6,cons(X4,nil)),X5) = sK4
& ssList(X6) ) ) )
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != sK3
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != sK2 ) )
| ~ ssItem(X7) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = sK5
& app(app(X6,cons(X4,nil)),X5) = sK4
& ssList(X6) ) ) )
=> ( ssItem(sK6)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(sK6,nil)),X6) = sK5
& sK4 = app(app(X6,cons(sK6,nil)),X5)
& ssList(X6) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(sK6,nil)),X6) = sK5
& sK4 = app(app(X6,cons(sK6,nil)),X5)
& ssList(X6) ) )
=> ( ssList(sK7)
& ? [X6] :
( app(app(sK7,cons(sK6,nil)),X6) = sK5
& sK4 = app(app(X6,cons(sK6,nil)),sK7)
& ssList(X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X6] :
( app(app(sK7,cons(sK6,nil)),X6) = sK5
& sK4 = app(app(X6,cons(sK6,nil)),sK7)
& ssList(X6) )
=> ( sK5 = app(app(sK7,cons(sK6,nil)),sK8)
& sK4 = app(app(sK8,cons(sK6,nil)),sK7)
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& X0 = X2
& ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X5,cons(X4,nil)),X6) = X3
& app(app(X6,cons(X4,nil)),X5) = X2
& ssList(X6) ) ) )
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X8,cons(X7,nil)),X9) != X1
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != X0 ) )
| ~ ssItem(X7) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(rectify,[],[f104]) ).
fof(f104,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& X0 = X2
& ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( neq(X1,nil)
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(app(X9,cons(X7,nil)),X8) = X2
& ssList(X9) ) ) )
& ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X1
| ~ ssList(X6)
| app(app(X6,cons(X4,nil)),X5) != X0 ) )
| ~ ssItem(X4) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f103]) ).
fof(f103,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X1
| ~ ssList(X6)
| app(app(X6,cons(X4,nil)),X5) != X0 ) )
| ~ ssItem(X4) )
& ? [X7] :
( ? [X8] :
( ? [X9] :
( app(app(X8,cons(X7,nil)),X9) = X3
& app(app(X9,cons(X7,nil)),X8) = X2
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) )
& neq(X1,nil) ) )
& 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)
=> ( X1 != X3
| X0 != X2
| ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( app(app(X6,cons(X4,nil)),X5) = X0
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1 )
& ssList(X5) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(app(X9,cons(X7,nil)),X8) != X2 ) ) ) )
| ~ neq(X1,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( app(app(X6,cons(X4,nil)),X5) = X0
& ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1 )
& ssList(X5) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,cons(X7,nil)),X9) != X3
| app(app(X9,cons(X7,nil)),X8) != X2 ) ) ) )
| ~ neq(X1,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f167,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f131]) ).
fof(f151,plain,
! [X8,X9,X7] :
( ~ neq(sK5,nil)
| ~ ssList(X8)
| app(app(X8,cons(X7,nil)),X9) != sK3
| ~ ssList(X9)
| app(app(X9,cons(X7,nil)),X8) != sK2
| ~ ssItem(X7) ),
inference(cnf_transformation,[],[f131]) ).
fof(f252,plain,
( spl11_8
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f155,f219,f240]) ).
fof(f155,plain,
( ~ neq(sK5,nil)
| ssList(sK7) ),
inference(cnf_transformation,[],[f131]) ).
fof(f250,plain,
( ~ spl11_4
| spl11_5 ),
inference(avatar_split_clause,[],[f152,f225,f219]) ).
fof(f152,plain,
( ssList(sK8)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f131]) ).
fof(f249,plain,
( spl11_9
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f154,f219,f246]) ).
fof(f154,plain,
( ~ neq(sK5,nil)
| sK5 = app(app(sK7,cons(sK6,nil)),sK8) ),
inference(cnf_transformation,[],[f131]) ).
fof(f244,plain,
spl11_4,
inference(avatar_split_clause,[],[f201,f219]) ).
fof(f201,plain,
neq(sK5,nil),
inference(duplicate_literal_removal,[],[f186]) ).
fof(f186,plain,
( neq(sK5,nil)
| neq(sK5,nil) ),
inference(definition_unfolding,[],[f164,f167,f167]) ).
fof(f164,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(cnf_transformation,[],[f131]) ).
fof(f233,plain,
( spl11_6
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f153,f219,f230]) ).
fof(f153,plain,
( ~ neq(sK5,nil)
| sK4 = app(app(sK8,cons(sK6,nil)),sK7) ),
inference(cnf_transformation,[],[f131]) ).
fof(f223,plain,
( spl11_3
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f156,f219,f215]) ).
fof(f156,plain,
( ~ neq(sK5,nil)
| ssItem(sK6) ),
inference(cnf_transformation,[],[f131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC422+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:20:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.23/0.51 % (31870)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 1.23/0.51 % (31856)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 1.23/0.52 % (31853)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.23/0.52 % (31859)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.23/0.52 % (31875)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 1.23/0.52 % (31863)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.23/0.52 % (31862)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.23/0.52 % (31847)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.23/0.52 % (31874)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 1.23/0.52 % (31855)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 1.23/0.53 % (31875)Instruction limit reached!
% 1.23/0.53 % (31875)------------------------------
% 1.23/0.53 % (31875)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.53 % (31857)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.36/0.53 % (31851)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.36/0.53 % (31848)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.36/0.53 % (31867)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 1.36/0.53 % (31857)Refutation not found, incomplete strategy% (31857)------------------------------
% 1.36/0.53 % (31857)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.53 % (31857)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.53 % (31857)Termination reason: Refutation not found, incomplete strategy
% 1.36/0.53
% 1.36/0.53 % (31857)Memory used [KB]: 6140
% 1.36/0.53 % (31857)Time elapsed: 0.123 s
% 1.36/0.53 % (31857)Instructions burned: 5 (million)
% 1.36/0.53 % (31857)------------------------------
% 1.36/0.53 % (31857)------------------------------
% 1.36/0.53 % (31861)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.36/0.53 % (31875)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.53 % (31875)Termination reason: Unknown
% 1.36/0.53 % (31875)Termination phase: Function definition elimination
% 1.36/0.53
% 1.36/0.53 % (31875)Memory used [KB]: 1791
% 1.36/0.53 % (31854)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.36/0.53 % (31875)Time elapsed: 0.007 s
% 1.36/0.53 % (31851)First to succeed.
% 1.36/0.53 % (31876)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 1.36/0.53 % (31875)Instructions burned: 8 (million)
% 1.36/0.53 % (31875)------------------------------
% 1.36/0.53 % (31875)------------------------------
% 1.36/0.53 % (31850)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.36/0.53 % (31852)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.36/0.54 % (31858)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.36/0.54 % (31849)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.36/0.54 % (31872)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 1.36/0.54 % (31852)Also succeeded, but the first one will report.
% 1.36/0.54 % (31849)Instruction limit reached!
% 1.36/0.54 % (31849)------------------------------
% 1.36/0.54 % (31849)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (31849)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.54 % (31849)Termination reason: Unknown
% 1.36/0.54 % (31849)Termination phase: Preprocessing 3
% 1.36/0.54
% 1.36/0.54 % (31849)Memory used [KB]: 1663
% 1.36/0.54 % (31849)Time elapsed: 0.004 s
% 1.36/0.54 % (31849)Instructions burned: 4 (million)
% 1.36/0.54 % (31849)------------------------------
% 1.36/0.54 % (31849)------------------------------
% 1.36/0.54 % (31851)Refutation found. Thanks to Tanya!
% 1.36/0.54 % SZS status Theorem for theBenchmark
% 1.36/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 1.36/0.54 % (31851)------------------------------
% 1.36/0.54 % (31851)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (31851)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.54 % (31851)Termination reason: Refutation
% 1.36/0.54
% 1.36/0.54 % (31851)Memory used [KB]: 6140
% 1.36/0.54 % (31851)Time elapsed: 0.123 s
% 1.36/0.54 % (31851)Instructions burned: 6 (million)
% 1.36/0.54 % (31851)------------------------------
% 1.36/0.54 % (31851)------------------------------
% 1.36/0.54 % (31845)Success in time 0.189 s
%------------------------------------------------------------------------------