TSTP Solution File: SWC104+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC104+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 : n021.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:46 EDT 2022
% Result : Theorem 0.18s 0.57s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 64 ( 12 unt; 0 def)
% Number of atoms : 430 ( 126 equ)
% Maximal formula atoms : 42 ( 6 avg)
% Number of connectives : 569 ( 203 ~; 182 |; 153 &)
% ( 9 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 146 ( 98 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f655,plain,
$false,
inference(avatar_sat_refutation,[],[f609,f626,f634,f640,f642,f654]) ).
fof(f654,plain,
( spl58_2
| ~ spl58_5
| ~ spl58_6 ),
inference(avatar_contradiction_clause,[],[f653]) ).
fof(f653,plain,
( $false
| spl58_2
| ~ spl58_5
| ~ spl58_6 ),
inference(subsumption_resolution,[],[f650,f646]) ).
fof(f646,plain,
( neq(nil,nil)
| ~ spl58_6 ),
inference(backward_demodulation,[],[f526,f625]) ).
fof(f625,plain,
( nil = sK45
| ~ spl58_6 ),
inference(avatar_component_clause,[],[f623]) ).
fof(f623,plain,
( spl58_6
<=> nil = sK45 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_6])]) ).
fof(f526,plain,
neq(sK45,nil),
inference(cnf_transformation,[],[f331]) ).
fof(f331,plain,
( ssList(sK44)
& ssList(sK46)
& ssList(sK48)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != sK48
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != sK46
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(sK46)
& app(sK46,sK48) = sK47
& sK47 = sK45
& neq(sK45,nil)
& ssList(sK47)
& ( nil != sK46
| nil = sK47 )
& sK46 = sK44
& ( ~ frontsegP(sK45,sK44)
| ~ neq(sK44,nil) )
& ssList(sK45) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK44,sK45,sK46,sK47,sK48])],[f164,f330,f329,f328,f327,f326]) ).
fof(f326,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(X2)
& app(X2,X4) = X3 )
& X1 = X3
& neq(X1,nil)
& ssList(X3)
& ( nil != X2
| nil = X3 )
& X0 = X2
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) ) ) )
& ssList(X1) ) )
=> ( ssList(sK44)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(X2)
& app(X2,X4) = X3 )
& X1 = X3
& neq(X1,nil)
& ssList(X3)
& ( nil != X2
| nil = X3 )
& sK44 = X2
& ( ~ frontsegP(X1,sK44)
| ~ neq(sK44,nil) ) ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f327,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(X2)
& app(X2,X4) = X3 )
& X1 = X3
& neq(X1,nil)
& ssList(X3)
& ( nil != X2
| nil = X3 )
& sK44 = X2
& ( ~ frontsegP(X1,sK44)
| ~ neq(sK44,nil) ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(X2)
& app(X2,X4) = X3 )
& sK45 = X3
& neq(sK45,nil)
& ssList(X3)
& ( nil != X2
| nil = X3 )
& sK44 = X2
& ( ~ frontsegP(sK45,sK44)
| ~ neq(sK44,nil) ) ) )
& ssList(sK45) ) ),
introduced(choice_axiom,[]) ).
fof(f328,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(X2)
& app(X2,X4) = X3 )
& sK45 = X3
& neq(sK45,nil)
& ssList(X3)
& ( nil != X2
| nil = X3 )
& sK44 = X2
& ( ~ frontsegP(sK45,sK44)
| ~ neq(sK44,nil) ) ) )
=> ( ssList(sK46)
& ? [X3] :
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != sK46
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(sK46)
& app(sK46,X4) = X3 )
& sK45 = X3
& neq(sK45,nil)
& ssList(X3)
& ( nil != sK46
| nil = X3 )
& sK46 = sK44
& ( ~ frontsegP(sK45,sK44)
| ~ neq(sK44,nil) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f329,plain,
( ? [X3] :
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != sK46
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(sK46)
& app(sK46,X4) = X3 )
& sK45 = X3
& neq(sK45,nil)
& ssList(X3)
& ( nil != sK46
| nil = X3 )
& sK46 = sK44
& ( ~ frontsegP(sK45,sK44)
| ~ neq(sK44,nil) ) )
=> ( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != sK46
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(sK46)
& sK47 = app(sK46,X4) )
& sK47 = sK45
& neq(sK45,nil)
& ssList(sK47)
& ( nil != sK46
| nil = sK47 )
& sK46 = sK44
& ( ~ frontsegP(sK45,sK44)
| ~ neq(sK44,nil) ) ) ),
introduced(choice_axiom,[]) ).
fof(f330,plain,
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != sK46
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(sK46)
& sK47 = app(sK46,X4) )
=> ( ssList(sK48)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != sK48
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != sK46
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(sK46)
& app(sK46,sK48) = sK47 ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ssList(X4)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& totalorderedP(X2)
& app(X2,X4) = X3 )
& X1 = X3
& neq(X1,nil)
& ssList(X3)
& ( nil != X2
| nil = X3 )
& X0 = X2
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) ) ) )
& ssList(X1) ) ),
inference(flattening,[],[f163]) ).
fof(f163,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5)
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssList(X6) ) )
& ssList(X4) )
& X1 = X3
& X0 = X2
& ( nil != X2
| nil = X3 )
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& 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)
=> ( ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& ssList(X6)
& ? [X7] :
( ? [X8] :
( app(X8,cons(X7,nil)) = X2
& leq(X7,X5)
& ssList(X8) )
& ssItem(X7) ) )
& ssItem(X5) ) ) )
| X1 != X3
| X0 != X2
| ( nil = X2
& nil != X3 )
| ( neq(X0,nil)
& frontsegP(X1,X0) )
| ~ neq(X1,nil) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& ssList(X6)
& ? [X7] :
( ? [X8] :
( app(X8,cons(X7,nil)) = X2
& leq(X7,X5)
& ssList(X8) )
& ssItem(X7) ) )
& ssItem(X5) ) ) )
| X1 != X3
| X0 != X2
| ( nil = X2
& nil != X3 )
| ( neq(X0,nil)
& frontsegP(X1,X0) )
| ~ neq(X1,nil) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f650,plain,
( ~ neq(nil,nil)
| spl58_2
| ~ spl58_5 ),
inference(backward_demodulation,[],[f608,f620]) ).
fof(f620,plain,
( nil = sK44
| ~ spl58_5 ),
inference(avatar_component_clause,[],[f619]) ).
fof(f619,plain,
( spl58_5
<=> nil = sK44 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_5])]) ).
fof(f608,plain,
( ~ neq(sK44,nil)
| spl58_2 ),
inference(avatar_component_clause,[],[f606]) ).
fof(f606,plain,
( spl58_2
<=> neq(sK44,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_2])]) ).
fof(f642,plain,
( spl58_2
| ~ spl58_3
| spl58_5 ),
inference(avatar_contradiction_clause,[],[f641]) ).
fof(f641,plain,
( $false
| spl58_2
| ~ spl58_3
| spl58_5 ),
inference(unit_resulting_resolution,[],[f612,f533,f621,f608,f502]) ).
fof(f502,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f313]) ).
fof(f313,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) ) ),
inference(nnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) ) ),
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(f621,plain,
( nil != sK44
| spl58_5 ),
inference(avatar_component_clause,[],[f619]) ).
fof(f533,plain,
ssList(sK44),
inference(cnf_transformation,[],[f331]) ).
fof(f612,plain,
( ssList(nil)
| ~ spl58_3 ),
inference(avatar_component_clause,[],[f611]) ).
fof(f611,plain,
( spl58_3
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_3])]) ).
fof(f640,plain,
spl58_1,
inference(avatar_contradiction_clause,[],[f639]) ).
fof(f639,plain,
( $false
| spl58_1 ),
inference(subsumption_resolution,[],[f638,f531]) ).
fof(f531,plain,
ssList(sK48),
inference(cnf_transformation,[],[f331]) ).
fof(f638,plain,
( ~ ssList(sK48)
| spl58_1 ),
inference(subsumption_resolution,[],[f637,f604]) ).
fof(f604,plain,
( ~ frontsegP(sK45,sK44)
| spl58_1 ),
inference(avatar_component_clause,[],[f602]) ).
fof(f602,plain,
( spl58_1
<=> frontsegP(sK45,sK44) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_1])]) ).
fof(f637,plain,
( ~ ssList(sK48)
| frontsegP(sK45,sK44) ),
inference(subsumption_resolution,[],[f636,f533]) ).
fof(f636,plain,
( ~ ssList(sK44)
| frontsegP(sK45,sK44)
| ~ ssList(sK48) ),
inference(superposition,[],[f632,f564]) ).
fof(f564,plain,
app(sK44,sK48) = sK45,
inference(definition_unfolding,[],[f528,f523,f527]) ).
fof(f527,plain,
sK47 = sK45,
inference(cnf_transformation,[],[f331]) ).
fof(f523,plain,
sK46 = sK44,
inference(cnf_transformation,[],[f331]) ).
fof(f528,plain,
app(sK46,sK48) = sK47,
inference(cnf_transformation,[],[f331]) ).
fof(f632,plain,
! [X3,X1] :
( frontsegP(app(X1,X3),X1)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f568,f385]) ).
fof(f385,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f99]) ).
fof(f99,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(f568,plain,
! [X3,X1] :
( ~ ssList(app(X1,X3))
| ~ ssList(X3)
| frontsegP(app(X1,X3),X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f360]) ).
fof(f360,plain,
! [X3,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X3) != X0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f243]) ).
fof(f243,plain,
! [X0] :
( ! [X1] :
( ( ( ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f241,f242]) ).
fof(f242,plain,
! [X0,X1] :
( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f241,plain,
! [X0] :
( ! [X1] :
( ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f240]) ).
fof(f240,plain,
! [X0] :
( ! [X1] :
( ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f132]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f634,plain,
spl58_3,
inference(avatar_split_clause,[],[f371,f611]) ).
fof(f371,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f626,plain,
( ~ spl58_5
| spl58_6 ),
inference(avatar_split_clause,[],[f566,f623,f619]) ).
fof(f566,plain,
( nil = sK45
| nil != sK44 ),
inference(definition_unfolding,[],[f524,f523,f527]) ).
fof(f524,plain,
( nil != sK46
| nil = sK47 ),
inference(cnf_transformation,[],[f331]) ).
fof(f609,plain,
( ~ spl58_1
| ~ spl58_2 ),
inference(avatar_split_clause,[],[f522,f606,f602]) ).
fof(f522,plain,
( ~ neq(sK44,nil)
| ~ frontsegP(sK45,sK44) ),
inference(cnf_transformation,[],[f331]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWC104+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : n021.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:15:26 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.49 % (16846)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.18/0.49 % (16871)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.18/0.50 % (16873)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.18/0.50 % (16858)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.18/0.50 % (16854)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.50 % (16860)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.18/0.50 % (16863)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.50 % (16847)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.18/0.50 % (16851)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.51 % (16845)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.18/0.51 % (16855)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.18/0.51 % (16851)Instruction limit reached!
% 0.18/0.51 % (16851)------------------------------
% 0.18/0.51 % (16851)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51 % (16851)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51 % (16851)Termination reason: Unknown
% 0.18/0.51 % (16851)Termination phase: Function definition elimination
% 0.18/0.51
% 0.18/0.51 % (16851)Memory used [KB]: 1279
% 0.18/0.51 % (16851)Time elapsed: 0.006 s
% 0.18/0.51 % (16851)Instructions burned: 8 (million)
% 0.18/0.51 % (16851)------------------------------
% 0.18/0.51 % (16851)------------------------------
% 0.18/0.52 % (16844)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.18/0.52 % (16849)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.18/0.52 % (16874)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.18/0.52 % (16848)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.52 % (16872)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.18/0.52 % (16864)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.18/0.52 % (16850)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.18/0.52 % (16869)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.18/0.52 % (16862)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.18/0.53 % (16875)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.18/0.53 % (16865)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)
% 0.18/0.53 % (16859)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.18/0.53 % (16866)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.18/0.53 % (16876)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.18/0.53 % (16856)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.18/0.54 % (16853)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.18/0.54 % (16857)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.54 % (16852)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.18/0.54 % (16852)Instruction limit reached!
% 0.18/0.54 % (16852)------------------------------
% 0.18/0.54 % (16852)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.54 % (16852)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.54 % (16852)Termination reason: Unknown
% 0.18/0.54 % (16852)Termination phase: Preprocessing 2
% 0.18/0.54
% 0.18/0.54 % (16852)Memory used [KB]: 1023
% 0.18/0.54 % (16852)Time elapsed: 0.002 s
% 0.18/0.54 % (16852)Instructions burned: 2 (million)
% 0.18/0.54 % (16852)------------------------------
% 0.18/0.54 % (16852)------------------------------
% 0.18/0.54 % (16868)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.18/0.55 TRYING [1]
% 0.18/0.55 TRYING [1]
% 0.18/0.55 % (16846)Instruction limit reached!
% 0.18/0.55 % (16846)------------------------------
% 0.18/0.55 % (16846)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.55 % (16846)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.55 % (16846)Termination reason: Unknown
% 0.18/0.55 % (16846)Termination phase: Saturation
% 0.18/0.55
% 0.18/0.55 % (16846)Memory used [KB]: 1663
% 0.18/0.55 % (16846)Time elapsed: 0.135 s
% 0.18/0.55 % (16846)Instructions burned: 37 (million)
% 0.18/0.55 % (16846)------------------------------
% 0.18/0.55 % (16846)------------------------------
% 0.18/0.56 % (16845)First to succeed.
% 0.18/0.57 % (16854)Instruction limit reached!
% 0.18/0.57 % (16854)------------------------------
% 0.18/0.57 % (16854)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.57 % (16871)Also succeeded, but the first one will report.
% 0.18/0.57 % (16845)Refutation found. Thanks to Tanya!
% 0.18/0.57 % SZS status Theorem for theBenchmark
% 0.18/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.57 % (16845)------------------------------
% 0.18/0.57 % (16845)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.57 % (16845)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.57 % (16845)Termination reason: Refutation
% 0.18/0.57
% 0.18/0.57 % (16845)Memory used [KB]: 6012
% 0.18/0.57 % (16845)Time elapsed: 0.148 s
% 0.18/0.57 % (16845)Instructions burned: 19 (million)
% 0.18/0.57 % (16845)------------------------------
% 0.18/0.57 % (16845)------------------------------
% 0.18/0.57 % (16838)Success in time 0.224 s
%------------------------------------------------------------------------------