TSTP Solution File: SET597+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET597+3 : TPTP v8.1.2. Released v2.2.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 : n032.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 03:48:12 EDT 2024
% Result : Theorem 0.47s 0.67s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 71 ( 6 unt; 0 def)
% Number of atoms : 279 ( 38 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 346 ( 138 ~; 141 |; 50 &)
% ( 10 <=>; 5 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 76 ( 52 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f301,plain,
$false,
inference(avatar_sat_refutation,[],[f77,f82,f87,f91,f92,f93,f259,f269,f298,f299,f300]) ).
fof(f300,plain,
( spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f293,f62,f66]) ).
fof(f66,plain,
( spl6_2
<=> subset(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f62,plain,
( spl6_1
<=> sK0 = union(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f293,plain,
( subset(sK1,sK0)
| ~ spl6_1 ),
inference(superposition,[],[f52,f63]) ).
fof(f63,plain,
( sK0 = union(sK1,sK2)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f52,plain,
! [X0,X1] : subset(X0,union(X0,X1)),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : subset(X0,union(X0,X1)),
file('/export/starexec/sandbox/tmp/tmp.xbDKGwZE1z/Vampire---4.8_27154',subset_of_union) ).
fof(f299,plain,
( spl6_3
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f294,f62,f70]) ).
fof(f70,plain,
( spl6_3
<=> subset(sK2,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f294,plain,
( subset(sK2,sK0)
| ~ spl6_1 ),
inference(superposition,[],[f94,f63]) ).
fof(f94,plain,
! [X0,X1] : subset(X0,union(X1,X0)),
inference(superposition,[],[f52,f44]) ).
fof(f44,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox/tmp/tmp.xbDKGwZE1z/Vampire---4.8_27154',commutativity_of_union) ).
fof(f298,plain,
( spl6_7
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f292,f62,f89]) ).
fof(f89,plain,
( spl6_7
<=> ! [X4] :
( subset(sK0,X4)
| ~ subset(sK1,X4)
| ~ subset(sK2,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
fof(f292,plain,
( ! [X0] :
( subset(sK0,X0)
| ~ subset(sK2,X0)
| ~ subset(sK1,X0) )
| ~ spl6_1 ),
inference(superposition,[],[f51,f63]) ).
fof(f51,plain,
! [X2,X0,X1] :
( subset(union(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( subset(union(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( subset(union(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(union(X0,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.xbDKGwZE1z/Vampire---4.8_27154',union_subset) ).
fof(f269,plain,
( spl6_4
| ~ spl6_5
| ~ spl6_6
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f268]) ).
fof(f268,plain,
( $false
| spl6_4
| ~ spl6_5
| ~ spl6_6
| ~ spl6_7 ),
inference(subsumption_resolution,[],[f267,f81]) ).
fof(f81,plain,
( subset(sK2,sK3)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f79,plain,
( spl6_5
<=> subset(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f267,plain,
( ~ subset(sK2,sK3)
| spl6_4
| ~ spl6_6
| ~ spl6_7 ),
inference(subsumption_resolution,[],[f265,f86]) ).
fof(f86,plain,
( subset(sK1,sK3)
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f84,plain,
( spl6_6
<=> subset(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f265,plain,
( ~ subset(sK1,sK3)
| ~ subset(sK2,sK3)
| spl6_4
| ~ spl6_7 ),
inference(resolution,[],[f76,f90]) ).
fof(f90,plain,
( ! [X4] :
( subset(sK0,X4)
| ~ subset(sK1,X4)
| ~ subset(sK2,X4) )
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f89]) ).
fof(f76,plain,
( ~ subset(sK0,sK3)
| spl6_4 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f74,plain,
( spl6_4
<=> subset(sK0,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f259,plain,
( spl6_1
| ~ spl6_2
| ~ spl6_3
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f258]) ).
fof(f258,plain,
( $false
| spl6_1
| ~ spl6_2
| ~ spl6_3
| ~ spl6_7 ),
inference(subsumption_resolution,[],[f257,f67]) ).
fof(f67,plain,
( subset(sK1,sK0)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f257,plain,
( ~ subset(sK1,sK0)
| spl6_1
| ~ spl6_3
| ~ spl6_7 ),
inference(subsumption_resolution,[],[f256,f71]) ).
fof(f71,plain,
( subset(sK2,sK0)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f256,plain,
( ~ subset(sK2,sK0)
| ~ subset(sK1,sK0)
| spl6_1
| ~ spl6_7 ),
inference(resolution,[],[f254,f51]) ).
fof(f254,plain,
( ~ subset(union(sK1,sK2),sK0)
| spl6_1
| ~ spl6_7 ),
inference(subsumption_resolution,[],[f253,f64]) ).
fof(f64,plain,
( sK0 != union(sK1,sK2)
| spl6_1 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f253,plain,
( sK0 = union(sK1,sK2)
| ~ subset(union(sK1,sK2),sK0)
| ~ spl6_7 ),
inference(forward_demodulation,[],[f252,f44]) ).
fof(f252,plain,
( ~ subset(union(sK1,sK2),sK0)
| sK0 = union(sK2,sK1)
| ~ spl6_7 ),
inference(forward_demodulation,[],[f248,f44]) ).
fof(f248,plain,
( ~ subset(union(sK2,sK1),sK0)
| sK0 = union(sK2,sK1)
| ~ spl6_7 ),
inference(resolution,[],[f148,f94]) ).
fof(f148,plain,
( ! [X0] :
( ~ subset(sK1,union(sK2,X0))
| ~ subset(union(sK2,X0),sK0)
| sK0 = union(sK2,X0) )
| ~ spl6_7 ),
inference(resolution,[],[f98,f52]) ).
fof(f98,plain,
( ! [X0] :
( ~ subset(sK2,X0)
| ~ subset(X0,sK0)
| ~ subset(sK1,X0)
| sK0 = X0 )
| ~ spl6_7 ),
inference(resolution,[],[f47,f90]) ).
fof(f47,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.xbDKGwZE1z/Vampire---4.8_27154',equal_defn) ).
fof(f93,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f34,f66,f62]) ).
fof(f34,plain,
( subset(sK1,sK0)
| sK0 = union(sK1,sK2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
( ( ( ~ subset(sK0,sK3)
& subset(sK2,sK3)
& subset(sK1,sK3) )
| ~ subset(sK2,sK0)
| ~ subset(sK1,sK0)
| sK0 != union(sK1,sK2) )
& ( ( ! [X4] :
( subset(sK0,X4)
| ~ subset(sK2,X4)
| ~ subset(sK1,X4) )
& subset(sK2,sK0)
& subset(sK1,sK0) )
| sK0 = union(sK1,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f18,f20,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2] :
( ( ? [X3] :
( ~ subset(X0,X3)
& subset(X2,X3)
& subset(X1,X3) )
| ~ subset(X2,X0)
| ~ subset(X1,X0)
| union(X1,X2) != X0 )
& ( ( ! [X4] :
( subset(X0,X4)
| ~ subset(X2,X4)
| ~ subset(X1,X4) )
& subset(X2,X0)
& subset(X1,X0) )
| union(X1,X2) = X0 ) )
=> ( ( ? [X3] :
( ~ subset(sK0,X3)
& subset(sK2,X3)
& subset(sK1,X3) )
| ~ subset(sK2,sK0)
| ~ subset(sK1,sK0)
| sK0 != union(sK1,sK2) )
& ( ( ! [X4] :
( subset(sK0,X4)
| ~ subset(sK2,X4)
| ~ subset(sK1,X4) )
& subset(sK2,sK0)
& subset(sK1,sK0) )
| sK0 = union(sK1,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
( ? [X3] :
( ~ subset(sK0,X3)
& subset(sK2,X3)
& subset(sK1,X3) )
=> ( ~ subset(sK0,sK3)
& subset(sK2,sK3)
& subset(sK1,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1,X2] :
( ( ? [X3] :
( ~ subset(X0,X3)
& subset(X2,X3)
& subset(X1,X3) )
| ~ subset(X2,X0)
| ~ subset(X1,X0)
| union(X1,X2) != X0 )
& ( ( ! [X4] :
( subset(X0,X4)
| ~ subset(X2,X4)
| ~ subset(X1,X4) )
& subset(X2,X0)
& subset(X1,X0) )
| union(X1,X2) = X0 ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( ? [X3] :
( ~ subset(X0,X3)
& subset(X2,X3)
& subset(X1,X3) )
| ~ subset(X2,X0)
| ~ subset(X1,X0)
| union(X1,X2) != X0 )
& ( ( ! [X3] :
( subset(X0,X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) )
& subset(X2,X0)
& subset(X1,X0) )
| union(X1,X2) = X0 ) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ( ? [X3] :
( ~ subset(X0,X3)
& subset(X2,X3)
& subset(X1,X3) )
| ~ subset(X2,X0)
| ~ subset(X1,X0)
| union(X1,X2) != X0 )
& ( ( ! [X3] :
( subset(X0,X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) )
& subset(X2,X0)
& subset(X1,X0) )
| union(X1,X2) = X0 ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
? [X0,X1,X2] :
( union(X1,X2) = X0
<~> ( ! [X3] :
( subset(X0,X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) )
& subset(X2,X0)
& subset(X1,X0) ) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
? [X0,X1,X2] :
( union(X1,X2) = X0
<~> ( ! [X3] :
( subset(X0,X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) )
& subset(X2,X0)
& subset(X1,X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( union(X1,X2) = X0
<=> ( ! [X3] :
( ( subset(X2,X3)
& subset(X1,X3) )
=> subset(X0,X3) )
& subset(X2,X0)
& subset(X1,X0) ) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( union(X1,X2) = X0
<=> ( ! [X3] :
( ( subset(X2,X3)
& subset(X1,X3) )
=> subset(X0,X3) )
& subset(X2,X0)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.xbDKGwZE1z/Vampire---4.8_27154',prove_th56) ).
fof(f92,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[],[f35,f70,f62]) ).
fof(f35,plain,
( subset(sK2,sK0)
| sK0 = union(sK1,sK2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f91,plain,
( spl6_1
| spl6_7 ),
inference(avatar_split_clause,[],[f36,f89,f62]) ).
fof(f36,plain,
! [X4] :
( subset(sK0,X4)
| ~ subset(sK2,X4)
| ~ subset(sK1,X4)
| sK0 = union(sK1,sK2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f87,plain,
( ~ spl6_1
| ~ spl6_2
| ~ spl6_3
| spl6_6 ),
inference(avatar_split_clause,[],[f37,f84,f70,f66,f62]) ).
fof(f37,plain,
( subset(sK1,sK3)
| ~ subset(sK2,sK0)
| ~ subset(sK1,sK0)
| sK0 != union(sK1,sK2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f82,plain,
( ~ spl6_1
| ~ spl6_2
| ~ spl6_3
| spl6_5 ),
inference(avatar_split_clause,[],[f38,f79,f70,f66,f62]) ).
fof(f38,plain,
( subset(sK2,sK3)
| ~ subset(sK2,sK0)
| ~ subset(sK1,sK0)
| sK0 != union(sK1,sK2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f77,plain,
( ~ spl6_1
| ~ spl6_2
| ~ spl6_3
| ~ spl6_4 ),
inference(avatar_split_clause,[],[f39,f74,f70,f66,f62]) ).
fof(f39,plain,
( ~ subset(sK0,sK3)
| ~ subset(sK2,sK0)
| ~ subset(sK1,sK0)
| sK0 != union(sK1,sK2) ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET597+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.11 % 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.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue Apr 30 17:23:06 EDT 2024
% 0.11/0.30 % CPUTime :
% 0.11/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.30 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.xbDKGwZE1z/Vampire---4.8_27154
% 0.47/0.65 % (27413)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.47/0.65 % (27418)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.47/0.66 % (27412)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.47/0.66 % (27416)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.47/0.66 % (27417)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.47/0.66 % (27414)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.47/0.66 % (27415)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.47/0.66 % (27419)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.47/0.66 % (27416)Refutation not found, incomplete strategy% (27416)------------------------------
% 0.47/0.66 % (27416)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.47/0.66 % (27416)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.66
% 0.47/0.66 % (27416)Memory used [KB]: 1059
% 0.47/0.66 % (27416)Time elapsed: 0.004 s
% 0.47/0.66 % (27416)Instructions burned: 4 (million)
% 0.47/0.66 % (27416)------------------------------
% 0.47/0.66 % (27416)------------------------------
% 0.47/0.66 % (27419)Refutation not found, incomplete strategy% (27419)------------------------------
% 0.47/0.66 % (27419)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.47/0.66 % (27419)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.66
% 0.47/0.66 % (27419)Memory used [KB]: 977
% 0.47/0.66 % (27419)Time elapsed: 0.002 s
% 0.47/0.66 % (27419)Instructions burned: 3 (million)
% 0.47/0.66 % (27419)------------------------------
% 0.47/0.66 % (27419)------------------------------
% 0.47/0.66 % (27417)Refutation not found, incomplete strategy% (27417)------------------------------
% 0.47/0.66 % (27417)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.47/0.66 % (27417)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.66
% 0.47/0.66 % (27417)Memory used [KB]: 1067
% 0.47/0.66 % (27417)Time elapsed: 0.005 s
% 0.47/0.66 % (27417)Instructions burned: 5 (million)
% 0.47/0.66 % (27417)------------------------------
% 0.47/0.66 % (27417)------------------------------
% 0.47/0.66 % (27421)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.47/0.66 % (27420)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.47/0.66 % (27422)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.47/0.66 % (27414)First to succeed.
% 0.47/0.67 % (27414)Refutation found. Thanks to Tanya!
% 0.47/0.67 % SZS status Theorem for Vampire---4
% 0.47/0.67 % SZS output start Proof for Vampire---4
% See solution above
% 0.47/0.67 % (27414)------------------------------
% 0.47/0.67 % (27414)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.47/0.67 % (27414)Termination reason: Refutation
% 0.47/0.67
% 0.47/0.67 % (27414)Memory used [KB]: 1156
% 0.47/0.67 % (27414)Time elapsed: 0.010 s
% 0.47/0.67 % (27414)Instructions burned: 17 (million)
% 0.47/0.67 % (27414)------------------------------
% 0.47/0.67 % (27414)------------------------------
% 0.47/0.67 % (27408)Success in time 0.356 s
% 0.47/0.67 % Vampire---4.8 exiting
%------------------------------------------------------------------------------