TSTP Solution File: SWC213+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC213+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.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 May 1 04:00:39 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 12 unt; 0 def)
% Number of atoms : 434 ( 162 equ)
% Maximal formula atoms : 48 ( 10 avg)
% Number of connectives : 612 ( 218 ~; 176 |; 188 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 182 ( 116 !; 66 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f247,plain,
$false,
inference(avatar_sat_refutation,[],[f219,f238,f246]) ).
fof(f246,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_contradiction_clause,[],[f245]) ).
fof(f245,plain,
( $false
| ~ spl14_1
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f242,f240]) ).
fof(f240,plain,
( neq(nil,nil)
| ~ spl14_1 ),
inference(superposition,[],[f200,f214]) ).
fof(f214,plain,
( nil = sK3
| ~ spl14_1 ),
inference(avatar_component_clause,[],[f212]) ).
fof(f212,plain,
( spl14_1
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f200,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f154,f152]) ).
fof(f152,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
( ( nil != sK2
| nil = sK3 )
& ~ neq(sK0,nil)
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK2)
& sK3 = app(app(sK4,sK2),sK5)
& ssList(sK5)
& ssList(sK4)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f100,f129,f128,f127,f126,f125,f124]) ).
fof(f124,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK2)
& app(app(X4,sK2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK2)
& app(app(X4,sK2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( nil != sK2
| nil = sK3 )
& ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK2)
& app(app(X4,sK2),X5) = sK3
& ssList(X5) )
& ssList(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK2)
& app(app(X4,sK2),X5) = sK3
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK2)
& sK3 = app(app(sK4,sK2),X5)
& ssList(X5) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK2)
& sK3 = app(app(sK4,sK2),X5)
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK2)
& sK3 = app(app(sK4,sK2),sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X2
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ? [X9] :
( ? [X10] :
( ? [X11] :
( app(cons(X9,nil),X11) = X2
& ssList(X11) )
& app(X10,cons(X9,nil)) = X4
& ssList(X10) )
& ssItem(X9) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X11,cons(X9,nil)) = X2
& ssList(X11) )
& app(cons(X9,nil),X10) = X5
& ssList(X10) )
& ssItem(X9) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X11,cons(X9,nil)) = X2
& ssList(X11) )
& app(cons(X9,nil),X10) = X5
& ssList(X10) )
& ssItem(X9) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6TpLgIGjmV/Vampire---4.8_18886',co1) ).
fof(f154,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f130]) ).
fof(f242,plain,
( ~ neq(nil,nil)
| ~ spl14_2 ),
inference(superposition,[],[f199,f217]) ).
fof(f217,plain,
( nil = sK2
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f216,plain,
( spl14_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f199,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f161,f153]) ).
fof(f153,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f161,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f130]) ).
fof(f238,plain,
spl14_2,
inference(avatar_split_clause,[],[f237,f216]) ).
fof(f237,plain,
nil = sK2,
inference(subsumption_resolution,[],[f236,f150]) ).
fof(f150,plain,
ssList(sK2),
inference(cnf_transformation,[],[f130]) ).
fof(f236,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f221,f189]) ).
fof(f189,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.6TpLgIGjmV/Vampire---4.8_18886',ax17) ).
fof(f221,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f199,f186]) ).
fof(f186,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6TpLgIGjmV/Vampire---4.8_18886',ax15) ).
fof(f219,plain,
( spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f162,f216,f212]) ).
fof(f162,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC213+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n015.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 18:41:03 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.6TpLgIGjmV/Vampire---4.8_18886
% 0.54/0.75 % (19147)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.54/0.75 % (19141)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.54/0.75 % (19143)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.54/0.75 % (19142)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.54/0.75 % (19146)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.54/0.75 % (19144)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.54/0.75 % (19148)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.54/0.75 % (19145)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.54/0.76 % (19146)First to succeed.
% 0.60/0.76 % (19143)Also succeeded, but the first one will report.
% 0.60/0.76 % (19146)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for Vampire---4
% 0.60/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76 % (19146)------------------------------
% 0.60/0.76 % (19146)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.76 % (19146)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (19146)Memory used [KB]: 1152
% 0.60/0.76 % (19146)Time elapsed: 0.006 s
% 0.60/0.76 % (19146)Instructions burned: 8 (million)
% 0.60/0.76 % (19146)------------------------------
% 0.60/0.76 % (19146)------------------------------
% 0.60/0.76 % (19136)Success in time 0.383 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------