TSTP Solution File: SWC218+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC218+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 : n006.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:39:41 EDT 2022
% Result : Theorem 0.15s 0.49s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of formulae : 89 ( 12 unt; 0 def)
% Number of atoms : 389 ( 117 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 446 ( 146 ~; 126 |; 132 &)
% ( 10 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 116 ( 53 !; 63 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f327,plain,
$false,
inference(avatar_sat_refutation,[],[f197,f231,f269,f275,f286,f290,f326]) ).
fof(f326,plain,
( ~ spl11_1
| ~ spl11_7
| ~ spl11_8
| ~ spl11_10 ),
inference(avatar_contradiction_clause,[],[f325]) ).
fof(f325,plain,
( $false
| ~ spl11_1
| ~ spl11_7
| ~ spl11_8
| ~ spl11_10 ),
inference(subsumption_resolution,[],[f324,f190]) ).
fof(f190,plain,
( ssList(nil)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f189,plain,
( spl11_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f324,plain,
( ~ ssList(nil)
| ~ spl11_7
| ~ spl11_8
| ~ spl11_10 ),
inference(subsumption_resolution,[],[f319,f169]) ).
fof(f169,plain,
ssItem(sK10),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
( ssList(sK6)
& sK7 = app(sK8,sK9)
& ssItem(sK10)
& app(app(sK8,cons(sK10,nil)),sK9) = sK6
& ssList(sK9)
& ssList(sK8)
& ssList(sK7)
& sK7 = sK5
& sK4 = sK6
& ~ neq(sK4,nil)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9,sK10])],[f105,f136,f135,f134,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = X2 )
& ssList(X5) )
& ssList(X4) )
& ssList(X3)
& X1 = X3
& X0 = X2
& ~ neq(X0,nil) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = X2 )
& ssList(X5) )
& ssList(X4) )
& ssList(X3)
& X1 = X3
& sK4 = X2
& ~ neq(sK4,nil) ) )
& ssList(X1) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = X2 )
& ssList(X5) )
& ssList(X4) )
& ssList(X3)
& X1 = X3
& sK4 = X2
& ~ neq(sK4,nil) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = X2 )
& ssList(X5) )
& ssList(X4) )
& ssList(X3)
& sK5 = X3
& sK4 = X2
& ~ neq(sK4,nil) ) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = X2 )
& ssList(X5) )
& ssList(X4) )
& ssList(X3)
& sK5 = X3
& sK4 = X2
& ~ neq(sK4,nil) ) )
=> ( ssList(sK6)
& ? [X3] :
( ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = sK6 )
& ssList(X5) )
& ssList(X4) )
& ssList(X3)
& sK5 = X3
& sK4 = sK6
& ~ neq(sK4,nil) ) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = sK6 )
& ssList(X5) )
& ssList(X4) )
& ssList(X3)
& sK5 = X3
& sK4 = sK6
& ~ neq(sK4,nil) )
=> ( ? [X4] :
( ? [X5] :
( app(X4,X5) = sK7
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = sK6 )
& ssList(X5) )
& ssList(X4) )
& ssList(sK7)
& sK7 = sK5
& sK4 = sK6
& ~ neq(sK4,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X4] :
( ? [X5] :
( app(X4,X5) = sK7
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = sK6 )
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( sK7 = app(sK8,X5)
& ? [X6] :
( ssItem(X6)
& app(app(sK8,cons(X6,nil)),X5) = sK6 )
& ssList(X5) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X5] :
( sK7 = app(sK8,X5)
& ? [X6] :
( ssItem(X6)
& app(app(sK8,cons(X6,nil)),X5) = sK6 )
& ssList(X5) )
=> ( sK7 = app(sK8,sK9)
& ? [X6] :
( ssItem(X6)
& app(app(sK8,cons(X6,nil)),sK9) = sK6 )
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( ? [X6] :
( ssItem(X6)
& app(app(sK8,cons(X6,nil)),sK9) = sK6 )
=> ( ssItem(sK10)
& app(app(sK8,cons(sK10,nil)),sK9) = sK6 ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = X2 )
& ssList(X5) )
& ssList(X4) )
& ssList(X3)
& X1 = X3
& X0 = X2
& ~ neq(X0,nil) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f104]) ).
fof(f104,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ~ neq(X0,nil)
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( ssItem(X6)
& app(app(X4,cons(X6,nil)),X5) = X2 )
& ssList(X5) )
& ssList(X4) )
& 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
| neq(X0,nil)
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,X5) != X3
| ! [X6] :
( ssItem(X6)
=> app(app(X4,cons(X6,nil)),X5) != X2 ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| neq(X0,nil)
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,X5) != X3
| ! [X6] :
( ssItem(X6)
=> app(app(X4,cons(X6,nil)),X5) != X2 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f319,plain,
( ~ ssItem(sK10)
| ~ ssList(nil)
| ~ spl11_7
| ~ spl11_8
| ~ spl11_10 ),
inference(trivial_inequality_removal,[],[f316]) ).
fof(f316,plain,
( ~ ssItem(sK10)
| nil != nil
| ~ ssList(nil)
| ~ spl11_7
| ~ spl11_8
| ~ spl11_10 ),
inference(superposition,[],[f155,f312]) ).
fof(f312,plain,
( nil = cons(sK10,nil)
| ~ spl11_7
| ~ spl11_8
| ~ spl11_10 ),
inference(subsumption_resolution,[],[f309,f284]) ).
fof(f284,plain,
( ssList(cons(sK10,nil))
| ~ spl11_10 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f283,plain,
( spl11_10
<=> ssList(cons(sK10,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_10])]) ).
fof(f309,plain,
( ~ ssList(cons(sK10,nil))
| nil = cons(sK10,nil)
| ~ spl11_7
| ~ spl11_8 ),
inference(superposition,[],[f154,f291]) ).
fof(f291,plain,
( nil = app(nil,cons(sK10,nil))
| ~ spl11_7
| ~ spl11_8 ),
inference(backward_demodulation,[],[f264,f258]) ).
fof(f258,plain,
( nil = sK8
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f256,plain,
( spl11_7
<=> nil = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_7])]) ).
fof(f264,plain,
( nil = app(sK8,cons(sK10,nil))
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f262,plain,
( spl11_8
<=> nil = app(sK8,cons(sK10,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_8])]) ).
fof(f154,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f155,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) != X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax18) ).
fof(f290,plain,
( ~ spl11_1
| spl11_10 ),
inference(avatar_contradiction_clause,[],[f289]) ).
fof(f289,plain,
( $false
| ~ spl11_1
| spl11_10 ),
inference(subsumption_resolution,[],[f288,f169]) ).
fof(f288,plain,
( ~ ssItem(sK10)
| ~ spl11_1
| spl11_10 ),
inference(subsumption_resolution,[],[f287,f190]) ).
fof(f287,plain,
( ~ ssList(nil)
| ~ ssItem(sK10)
| spl11_10 ),
inference(resolution,[],[f285,f174]) ).
fof(f174,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f285,plain,
( ~ ssList(cons(sK10,nil))
| spl11_10 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f286,plain,
( ~ spl11_10
| spl11_7
| ~ spl11_8 ),
inference(avatar_split_clause,[],[f281,f262,f256,f283]) ).
fof(f281,plain,
( nil = sK8
| ~ ssList(cons(sK10,nil))
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f280,f166]) ).
fof(f166,plain,
ssList(sK8),
inference(cnf_transformation,[],[f137]) ).
fof(f280,plain,
( nil = sK8
| ~ ssList(cons(sK10,nil))
| ~ ssList(sK8)
| ~ spl11_8 ),
inference(trivial_inequality_removal,[],[f278]) ).
fof(f278,plain,
( nil = sK8
| nil != nil
| ~ ssList(sK8)
| ~ ssList(cons(sK10,nil))
| ~ spl11_8 ),
inference(superposition,[],[f145,f264]) ).
fof(f145,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f275,plain,
( ~ spl11_1
| spl11_9 ),
inference(avatar_contradiction_clause,[],[f274]) ).
fof(f274,plain,
( $false
| ~ spl11_1
| spl11_9 ),
inference(subsumption_resolution,[],[f273,f169]) ).
fof(f273,plain,
( ~ ssItem(sK10)
| ~ spl11_1
| spl11_9 ),
inference(subsumption_resolution,[],[f272,f190]) ).
fof(f272,plain,
( ~ ssList(nil)
| ~ ssItem(sK10)
| spl11_9 ),
inference(resolution,[],[f271,f174]) ).
fof(f271,plain,
( ~ ssList(cons(sK10,nil))
| spl11_9 ),
inference(subsumption_resolution,[],[f270,f166]) ).
fof(f270,plain,
( ~ ssList(sK8)
| ~ ssList(cons(sK10,nil))
| spl11_9 ),
inference(resolution,[],[f268,f141]) ).
fof(f141,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,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(f268,plain,
( ~ ssList(app(sK8,cons(sK10,nil)))
| spl11_9 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f266,plain,
( spl11_9
<=> ssList(app(sK8,cons(sK10,nil))) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_9])]) ).
fof(f269,plain,
( spl11_8
| ~ spl11_9
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f260,f212,f266,f262]) ).
fof(f212,plain,
( spl11_3
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f260,plain,
( ~ ssList(app(sK8,cons(sK10,nil)))
| nil = app(sK8,cons(sK10,nil))
| ~ spl11_3 ),
inference(subsumption_resolution,[],[f247,f167]) ).
fof(f167,plain,
ssList(sK9),
inference(cnf_transformation,[],[f137]) ).
fof(f247,plain,
( nil = app(sK8,cons(sK10,nil))
| ~ ssList(app(sK8,cons(sK10,nil)))
| ~ ssList(sK9)
| ~ spl11_3 ),
inference(trivial_inequality_removal,[],[f243]) ).
fof(f243,plain,
( ~ ssList(app(sK8,cons(sK10,nil)))
| nil != nil
| nil = app(sK8,cons(sK10,nil))
| ~ ssList(sK9)
| ~ spl11_3 ),
inference(superposition,[],[f145,f233]) ).
fof(f233,plain,
( nil = app(app(sK8,cons(sK10,nil)),sK9)
| ~ spl11_3 ),
inference(backward_demodulation,[],[f168,f214]) ).
fof(f214,plain,
( nil = sK6
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f212]) ).
fof(f168,plain,
app(app(sK8,cons(sK10,nil)),sK9) = sK6,
inference(cnf_transformation,[],[f137]) ).
fof(f231,plain,
( spl11_3
| ~ spl11_1 ),
inference(avatar_split_clause,[],[f230,f189,f212]) ).
fof(f230,plain,
( nil = sK6
| ~ spl11_1 ),
inference(subsumption_resolution,[],[f229,f171]) ).
fof(f171,plain,
ssList(sK6),
inference(cnf_transformation,[],[f137]) ).
fof(f229,plain,
( nil = sK6
| ~ ssList(sK6)
| ~ spl11_1 ),
inference(subsumption_resolution,[],[f224,f190]) ).
fof(f224,plain,
( ~ ssList(nil)
| ~ ssList(sK6)
| nil = sK6 ),
inference(resolution,[],[f152,f179]) ).
fof(f179,plain,
~ neq(sK6,nil),
inference(definition_unfolding,[],[f162,f163]) ).
fof(f163,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f137]) ).
fof(f162,plain,
~ neq(sK4,nil),
inference(cnf_transformation,[],[f137]) ).
fof(f152,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| X0 = X1
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,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/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f197,plain,
spl11_1,
inference(avatar_split_clause,[],[f175,f189]) ).
fof(f175,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC218+1 : TPTP v8.1.0. Released v2.4.0.
% 0.05/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 30 18:34:09 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.15/0.46 % (15210)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)
% 0.15/0.46 % (15211)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)
% 0.15/0.46 % (15202)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)
% 0.15/0.46 % (15203)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)
% 0.15/0.46 % (15210)Instruction limit reached!
% 0.15/0.46 % (15210)------------------------------
% 0.15/0.46 % (15210)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.46 % (15210)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.46 % (15210)Termination reason: Unknown
% 0.15/0.46 % (15210)Termination phase: Naming
% 0.15/0.46
% 0.15/0.46 % (15210)Memory used [KB]: 1535
% 0.15/0.46 % (15210)Time elapsed: 0.005 s
% 0.15/0.46 % (15210)Instructions burned: 3 (million)
% 0.15/0.46 % (15210)------------------------------
% 0.15/0.46 % (15210)------------------------------
% 0.15/0.46 % (15211)Instruction limit reached!
% 0.15/0.46 % (15211)------------------------------
% 0.15/0.46 % (15211)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47 % (15202)First to succeed.
% 0.15/0.48 % (15218)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.15/0.48 % (15220)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.15/0.48 % (15211)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.48 % (15211)Termination reason: Unknown
% 0.15/0.48 % (15211)Termination phase: shuffling
% 0.15/0.48
% 0.15/0.48 % (15211)Memory used [KB]: 1791
% 0.15/0.48 % (15211)Time elapsed: 0.007 s
% 0.15/0.48 % (15211)Instructions burned: 8 (million)
% 0.15/0.48 % (15211)------------------------------
% 0.15/0.48 % (15211)------------------------------
% 0.15/0.49 % (15202)Refutation found. Thanks to Tanya!
% 0.15/0.49 % SZS status Theorem for theBenchmark
% 0.15/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.49 % (15202)------------------------------
% 0.15/0.49 % (15202)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.49 % (15202)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.49 % (15202)Termination reason: Refutation
% 0.15/0.49
% 0.15/0.49 % (15202)Memory used [KB]: 6140
% 0.15/0.49 % (15202)Time elapsed: 0.111 s
% 0.15/0.49 % (15202)Instructions burned: 7 (million)
% 0.15/0.49 % (15202)------------------------------
% 0.15/0.49 % (15202)------------------------------
% 0.15/0.49 % (15195)Success in time 0.173 s
%------------------------------------------------------------------------------