TSTP Solution File: SWC213+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC213+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 : n005.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:38 EDT 2022
% Result : Theorem 0.10s 0.47s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 442 ( 162 equ)
% Maximal formula atoms : 48 ( 10 avg)
% Number of connectives : 626 ( 227 ~; 181 |; 193 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 182 ( 116 !; 66 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f293,plain,
$false,
inference(avatar_sat_refutation,[],[f228,f229,f272,f292]) ).
fof(f292,plain,
( ~ spl14_3
| ~ spl14_4 ),
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f291,plain,
( $false
| ~ spl14_3
| ~ spl14_4 ),
inference(subsumption_resolution,[],[f285,f278]) ).
fof(f278,plain,
( ~ neq(nil,nil)
| ~ spl14_3 ),
inference(backward_demodulation,[],[f201,f222]) ).
fof(f222,plain,
( nil = sK10
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f221]) ).
fof(f221,plain,
( spl14_3
<=> nil = sK10 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f201,plain,
~ neq(sK10,nil),
inference(definition_unfolding,[],[f184,f185]) ).
fof(f185,plain,
sK8 = sK10,
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
( ssList(sK9)
& ssList(sK12)
& ssList(sK13)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != sK13
| ! [X8] :
( app(X8,cons(X6,nil)) != sK10
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(sK10)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != sK12
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != sK10 ) )
| ~ ssItem(X9) )
& sK11 = app(app(sK12,sK10),sK13)
& sK9 = sK11
& ( nil = sK11
| nil != sK10 )
& ssList(sK11)
& neq(sK9,nil)
& sK8 = sK10
& ~ neq(sK8,nil)
& ssList(sK10)
& ssList(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12,sK13])],[f140,f146,f145,f144,f143,f142,f141]) ).
fof(f141,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(X2)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != X2 ) )
| ~ ssItem(X9) )
& app(app(X4,X2),X5) = X3 ) )
& X1 = X3
& ( nil = X3
| nil != X2 )
& ssList(X3)
& neq(X1,nil)
& X0 = X2
& ~ neq(X0,nil) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(X2)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != X2 ) )
| ~ ssItem(X9) )
& app(app(X4,X2),X5) = X3 ) )
& X1 = X3
& ( nil = X3
| nil != X2 )
& ssList(X3)
& neq(X1,nil)
& sK8 = X2
& ~ neq(sK8,nil) )
& ssList(X2) ) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(X2)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != X2 ) )
| ~ ssItem(X9) )
& app(app(X4,X2),X5) = X3 ) )
& X1 = X3
& ( nil = X3
| nil != X2 )
& ssList(X3)
& neq(X1,nil)
& sK8 = X2
& ~ neq(sK8,nil) )
& ssList(X2) ) )
=> ( ssList(sK9)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(X2)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != X2 ) )
| ~ ssItem(X9) )
& app(app(X4,X2),X5) = X3 ) )
& sK9 = X3
& ( nil = X3
| nil != X2 )
& ssList(X3)
& neq(sK9,nil)
& sK8 = X2
& ~ neq(sK8,nil) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(X2)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != X2 ) )
| ~ ssItem(X9) )
& app(app(X4,X2),X5) = X3 ) )
& sK9 = X3
& ( nil = X3
| nil != X2 )
& ssList(X3)
& neq(sK9,nil)
& sK8 = X2
& ~ neq(sK8,nil) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != sK10
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(sK10)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != sK10 ) )
| ~ ssItem(X9) )
& app(app(X4,sK10),X5) = X3 ) )
& sK9 = X3
& ( nil = X3
| nil != sK10 )
& ssList(X3)
& neq(sK9,nil)
& sK8 = sK10
& ~ neq(sK8,nil) )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X3] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != sK10
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(sK10)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != sK10 ) )
| ~ ssItem(X9) )
& app(app(X4,sK10),X5) = X3 ) )
& sK9 = X3
& ( nil = X3
| nil != sK10 )
& ssList(X3)
& neq(sK9,nil)
& sK8 = sK10
& ~ neq(sK8,nil) )
=> ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != sK10
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(sK10)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != sK10 ) )
| ~ ssItem(X9) )
& sK11 = app(app(X4,sK10),X5) ) )
& sK9 = sK11
& ( nil = sK11
| nil != sK10 )
& ssList(sK11)
& neq(sK9,nil)
& sK8 = sK10
& ~ neq(sK8,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != sK10
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(sK10)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != sK10 ) )
| ~ ssItem(X9) )
& sK11 = app(app(X4,sK10),X5) ) )
=> ( ssList(sK12)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != sK10
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(sK10)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != sK12
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != sK10 ) )
| ~ ssItem(X9) )
& app(app(sK12,sK10),X5) = sK11 ) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != sK10
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(sK10)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != sK12
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != sK10 ) )
| ~ ssItem(X9) )
& app(app(sK12,sK10),X5) = sK11 )
=> ( ssList(sK13)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != sK13
| ! [X8] :
( app(X8,cons(X6,nil)) != sK10
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(sK10)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != sK12
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != sK10 ) )
| ~ ssItem(X9) )
& sK11 = app(app(sK12,sK10),sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| ~ ssList(X7) ) )
& equalelemsP(X2)
& ! [X9] :
( ! [X10] :
( app(X10,cons(X9,nil)) != X4
| ~ ssList(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X9,nil),X11) != X2 ) )
| ~ ssItem(X9) )
& app(app(X4,X2),X5) = X3 ) )
& X1 = X3
& ( nil = X3
| nil != X2 )
& ssList(X3)
& neq(X1,nil)
& X0 = X2
& ~ neq(X0,nil) )
& ssList(X2) ) )
& ssList(X0) ),
inference(rectify,[],[f111]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( app(cons(X9,nil),X10) != X5
| ! [X11] :
( app(X11,cons(X9,nil)) != X2
| ~ ssList(X11) )
| ~ ssList(X10) ) )
& equalelemsP(X2)
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| app(cons(X6,nil),X8) != X2 ) )
| ~ ssItem(X6) )
& app(app(X4,X2),X5) = X3 ) )
& X1 = X3
& ( nil = X3
| nil != X2 )
& ssList(X3)
& neq(X1,nil)
& X0 = X2
& ~ neq(X0,nil) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f110]) ).
fof(f110,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( app(cons(X9,nil),X10) != X5
| ! [X11] :
( app(X11,cons(X9,nil)) != X2
| ~ ssList(X11) )
| ~ ssList(X10) ) )
& equalelemsP(X2)
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X4
| ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| app(cons(X6,nil),X8) != X2 ) )
| ~ ssItem(X6) )
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& ( nil = X3
| nil != X2 )
& 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)
=> ( neq(X0,nil)
| X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X9] :
( ssItem(X9)
& ? [X10] :
( app(cons(X9,nil),X10) = X5
& ssList(X10)
& ? [X11] :
( ssList(X11)
& app(X11,cons(X9,nil)) = X2 ) ) )
| ~ equalelemsP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) )
& app(X7,cons(X6,nil)) = X4 ) )
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X0,nil)
| X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X9] :
( ssItem(X9)
& ? [X10] :
( app(cons(X9,nil),X10) = X5
& ssList(X10)
& ? [X11] :
( ssList(X11)
& app(X11,cons(X9,nil)) = X2 ) ) )
| ~ equalelemsP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) )
& app(X7,cons(X6,nil)) = X4 ) )
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f184,plain,
~ neq(sK8,nil),
inference(cnf_transformation,[],[f147]) ).
fof(f285,plain,
( neq(nil,nil)
| ~ spl14_4 ),
inference(backward_demodulation,[],[f200,f227]) ).
fof(f227,plain,
( nil = sK11
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f225,plain,
( spl14_4
<=> nil = sK11 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f200,plain,
neq(sK11,nil),
inference(definition_unfolding,[],[f186,f189]) ).
fof(f189,plain,
sK9 = sK11,
inference(cnf_transformation,[],[f147]) ).
fof(f186,plain,
neq(sK9,nil),
inference(cnf_transformation,[],[f147]) ).
fof(f272,plain,
( spl14_3
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f271,f216,f221]) ).
fof(f216,plain,
( spl14_2
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f271,plain,
( nil = sK10
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f267,f183]) ).
fof(f183,plain,
ssList(sK10),
inference(cnf_transformation,[],[f147]) ).
fof(f267,plain,
( nil = sK10
| ~ ssList(sK10)
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f262,f217]) ).
fof(f217,plain,
( ssList(nil)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f262,plain,
( ~ ssList(nil)
| nil = sK10
| ~ ssList(sK10) ),
inference(resolution,[],[f159,f201]) ).
fof(f159,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f99]) ).
fof(f99,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(f229,plain,
spl14_2,
inference(avatar_split_clause,[],[f152,f216]) ).
fof(f152,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f228,plain,
( ~ spl14_3
| spl14_4 ),
inference(avatar_split_clause,[],[f188,f225,f221]) ).
fof(f188,plain,
( nil = sK11
| nil != sK10 ),
inference(cnf_transformation,[],[f147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SWC213+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.07 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.06/0.25 % Computer : n005.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue Aug 30 18:34:33 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.10/0.44 % (24945)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.10/0.44 % (24930)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.10/0.45 % (24937)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.10/0.45 % (24938)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.10/0.45 % (24929)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.10/0.45 % (24929)First to succeed.
% 0.10/0.46 % (24937)Instruction limit reached!
% 0.10/0.46 % (24937)------------------------------
% 0.10/0.46 % (24937)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.10/0.46 % (24946)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)
% 0.10/0.46 % (24938)Instruction limit reached!
% 0.10/0.46 % (24938)------------------------------
% 0.10/0.46 % (24938)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.10/0.46 % (24937)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.10/0.46 % (24937)Termination reason: Unknown
% 0.10/0.46 % (24937)Termination phase: Preprocessing 3
% 0.10/0.46
% 0.10/0.46 % (24937)Memory used [KB]: 1535
% 0.10/0.46 % (24937)Time elapsed: 0.005 s
% 0.10/0.46 % (24937)Instructions burned: 3 (million)
% 0.10/0.46 % (24937)------------------------------
% 0.10/0.46 % (24937)------------------------------
% 0.10/0.47 % (24929)Refutation found. Thanks to Tanya!
% 0.10/0.47 % SZS status Theorem for theBenchmark
% 0.10/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.47 % (24929)------------------------------
% 0.10/0.47 % (24929)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.10/0.47 % (24929)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.10/0.47 % (24929)Termination reason: Refutation
% 0.10/0.47
% 0.10/0.47 % (24929)Memory used [KB]: 6140
% 0.10/0.47 % (24929)Time elapsed: 0.120 s
% 0.10/0.47 % (24929)Instructions burned: 7 (million)
% 0.10/0.47 % (24929)------------------------------
% 0.10/0.47 % (24929)------------------------------
% 0.10/0.47 % (24922)Success in time 0.208 s
%------------------------------------------------------------------------------