TSTP Solution File: SWC288+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC288+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 : n013.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:01:09 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 52 ( 9 unt; 0 def)
% Number of atoms : 372 ( 103 equ)
% Maximal formula atoms : 22 ( 7 avg)
% Number of connectives : 472 ( 152 ~; 128 |; 163 &)
% ( 5 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 124 ( 73 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f419,plain,
$false,
inference(avatar_sat_refutation,[],[f347,f359,f407,f418]) ).
fof(f418,plain,
( ~ spl26_1
| spl26_7 ),
inference(avatar_contradiction_clause,[],[f417]) ).
fof(f417,plain,
( $false
| ~ spl26_1
| spl26_7 ),
inference(subsumption_resolution,[],[f416,f342]) ).
fof(f342,plain,
( sP0(sK7,sK6)
| ~ spl26_1 ),
inference(avatar_component_clause,[],[f340]) ).
fof(f340,plain,
( spl26_1
<=> sP0(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl26_1])]) ).
fof(f416,plain,
( ~ sP0(sK7,sK6)
| spl26_7 ),
inference(resolution,[],[f404,f219]) ).
fof(f219,plain,
! [X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f170,plain,
! [X0,X1] :
( ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1))
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f166,f169,f168,f167]) ).
fof(f167,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f168,plain,
! [X0,X1] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f169,plain,
! [X0,X1] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
=> ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f165]) ).
fof(f165,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
inference(nnf_transformation,[],[f163]) ).
fof(f163,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f404,plain,
( ~ ssItem(sK1(sK7,sK6))
| spl26_7 ),
inference(avatar_component_clause,[],[f402]) ).
fof(f402,plain,
( spl26_7
<=> ssItem(sK1(sK7,sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl26_7])]) ).
fof(f407,plain,
( ~ spl26_7
| ~ spl26_1 ),
inference(avatar_split_clause,[],[f406,f340,f402]) ).
fof(f406,plain,
( ~ ssItem(sK1(sK7,sK6))
| ~ spl26_1 ),
inference(subsumption_resolution,[],[f396,f322]) ).
fof(f322,plain,
~ strictorderedP(sK6),
inference(definition_unfolding,[],[f232,f231]) ).
fof(f231,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f175]) ).
fof(f175,plain,
( ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& ~ strictorderedP(sK4)
& sK4 = sK6
& sK5 = sK7
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f164,f174,f173,f172,f171]) ).
fof(f171,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ strictorderedP(sK4)
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f172,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ strictorderedP(sK4)
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ strictorderedP(sK4)
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ strictorderedP(sK4)
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& ~ strictorderedP(sK4)
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& ~ strictorderedP(sK4)
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
=> ( ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& ~ strictorderedP(sK4)
& sK4 = sK6
& sK5 = sK7
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f163]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& ~ strictorderedP(X0)
& 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] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X7] :
( lt(X7,X4)
& memberP(X6,X7)
& ssItem(X7) )
| ? [X8] :
( lt(X4,X8)
& memberP(X5,X8)
& ssItem(X8) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.8DwUprxUhm/Vampire---4.8_4274',co1) ).
fof(f232,plain,
~ strictorderedP(sK4),
inference(cnf_transformation,[],[f175]) ).
fof(f396,plain,
( strictorderedP(sK6)
| ~ ssItem(sK1(sK7,sK6))
| ~ spl26_1 ),
inference(superposition,[],[f353,f392]) ).
fof(f392,plain,
( sK6 = cons(sK1(sK7,sK6),nil)
| ~ spl26_1 ),
inference(resolution,[],[f342,f222]) ).
fof(f222,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| cons(sK1(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f170]) ).
fof(f353,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f330,f257]) ).
fof(f257,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.8DwUprxUhm/Vampire---4.8_4274',ax17) ).
fof(f330,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f280]) ).
fof(f280,plain,
! [X0,X1] :
( strictorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f196]) ).
fof(f196,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f195]) ).
fof(f195,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f132]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f70]) ).
fof(f70,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.8DwUprxUhm/Vampire---4.8_4274',ax70) ).
fof(f359,plain,
~ spl26_2,
inference(avatar_contradiction_clause,[],[f358]) ).
fof(f358,plain,
( $false
| ~ spl26_2 ),
inference(subsumption_resolution,[],[f357,f282]) ).
fof(f282,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/tmp/tmp.8DwUprxUhm/Vampire---4.8_4274',ax69) ).
fof(f357,plain,
( ~ strictorderedP(nil)
| ~ spl26_2 ),
inference(backward_demodulation,[],[f322,f346]) ).
fof(f346,plain,
( nil = sK6
| ~ spl26_2 ),
inference(avatar_component_clause,[],[f344]) ).
fof(f344,plain,
( spl26_2
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl26_2])]) ).
fof(f347,plain,
( spl26_1
| spl26_2 ),
inference(avatar_split_clause,[],[f234,f344,f340]) ).
fof(f234,plain,
( nil = sK6
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC288+1 : TPTP v8.1.2. Released v2.4.0.
% 0.15/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 : n013.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:12:49 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.36 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.8DwUprxUhm/Vampire---4.8_4274
% 0.58/0.75 % (4539)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.58/0.75 % (4533)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.58/0.75 % (4535)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.58/0.75 % (4534)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.58/0.75 % (4537)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.58/0.75 % (4538)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.58/0.75 % (4540)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.58/0.75 % (4538)Refutation not found, incomplete strategy% (4538)------------------------------
% 0.58/0.75 % (4538)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (4538)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (4538)Memory used [KB]: 1151
% 0.58/0.75 % (4538)Time elapsed: 0.005 s
% 0.58/0.75 % (4538)Instructions burned: 7 (million)
% 0.58/0.75 % (4538)------------------------------
% 0.58/0.75 % (4538)------------------------------
% 0.58/0.76 % (4536)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.58/0.76 % (4535)First to succeed.
% 0.58/0.76 % (4534)Also succeeded, but the first one will report.
% 0.58/0.76 % (4535)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for Vampire---4
% 0.58/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76 % (4535)------------------------------
% 0.58/0.76 % (4535)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.76 % (4535)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (4535)Memory used [KB]: 1324
% 0.58/0.76 % (4535)Time elapsed: 0.011 s
% 0.58/0.76 % (4535)Instructions burned: 15 (million)
% 0.58/0.76 % (4535)------------------------------
% 0.58/0.76 % (4535)------------------------------
% 0.58/0.76 % (4529)Success in time 0.382 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------