TSTP Solution File: SEU154+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU154+1 : TPTP v8.1.2. Released v3.3.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.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:50:18 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 9 unt; 0 def)
% Number of atoms : 226 ( 61 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 272 ( 101 ~; 102 |; 54 &)
% ( 8 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 132 ( 118 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f410,plain,
$false,
inference(resolution,[],[f408,f71]) ).
fof(f71,plain,
~ disjoint(singleton(sK3),sK4),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
( ~ disjoint(singleton(sK3),sK4)
& ~ in(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f24,f42]) ).
fof(f42,plain,
( ? [X0,X1] :
( ~ disjoint(singleton(X0),X1)
& ~ in(X0,X1) )
=> ( ~ disjoint(singleton(sK3),sK4)
& ~ in(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
? [X0,X1] :
( ~ disjoint(singleton(X0),X1)
& ~ in(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fAd3Dl5mRe/Vampire---4.8_19992',l28_zfmisc_1) ).
fof(f408,plain,
disjoint(singleton(sK3),sK4),
inference(trivial_inequality_removal,[],[f401]) ).
fof(f401,plain,
( empty_set != empty_set
| disjoint(singleton(sK3),sK4) ),
inference(superposition,[],[f100,f396]) ).
fof(f396,plain,
empty_set = set_intersection2(sK4,singleton(sK3)),
inference(resolution,[],[f376,f70]) ).
fof(f70,plain,
~ in(sK3,sK4),
inference(cnf_transformation,[],[f43]) ).
fof(f376,plain,
! [X0,X1] :
( in(X1,X0)
| empty_set = set_intersection2(X0,singleton(X1)) ),
inference(duplicate_literal_removal,[],[f362]) ).
fof(f362,plain,
! [X0,X1] :
( in(X1,X0)
| empty_set = set_intersection2(X0,singleton(X1))
| empty_set = set_intersection2(X0,singleton(X1)) ),
inference(superposition,[],[f162,f174]) ).
fof(f174,plain,
! [X0,X1] :
( sK1(set_intersection2(X0,singleton(X1)),empty_set) = X1
| empty_set = set_intersection2(X0,singleton(X1)) ),
inference(resolution,[],[f154,f81]) ).
fof(f81,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f53]) ).
fof(f53,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f29,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.fAd3Dl5mRe/Vampire---4.8_19992',d1_tarski) ).
fof(f154,plain,
! [X0,X1] :
( in(sK1(set_intersection2(X0,X1),empty_set),X1)
| set_intersection2(X0,X1) = empty_set ),
inference(resolution,[],[f105,f134]) ).
fof(f134,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(resolution,[],[f52,f76]) ).
fof(f76,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f19]) ).
fof(f19,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox2/tmp/tmp.fAd3Dl5mRe/Vampire---4.8_19992',t2_xboole_1) ).
fof(f52,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,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fAd3Dl5mRe/Vampire---4.8_19992',d10_xboole_0) ).
fof(f105,plain,
! [X2,X0,X1] :
( subset(set_intersection2(X0,X1),X2)
| in(sK1(set_intersection2(X0,X1),X2),X1) ),
inference(resolution,[],[f83,f58]) ).
fof(f58,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f33,f34]) ).
fof(f34,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fAd3Dl5mRe/Vampire---4.8_19992',d3_tarski) ).
fof(f83,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f61]) ).
fof(f61,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( in(sK2(X0,X1,X2),X1)
& in(sK2(X0,X1,X2),X0) )
| in(sK2(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f38,f39]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( ~ in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( in(sK2(X0,X1,X2),X1)
& in(sK2(X0,X1,X2),X0) )
| in(sK2(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fAd3Dl5mRe/Vampire---4.8_19992',d3_xboole_0) ).
fof(f162,plain,
! [X0,X1] :
( in(sK1(set_intersection2(X0,X1),empty_set),X0)
| set_intersection2(X0,X1) = empty_set ),
inference(resolution,[],[f110,f134]) ).
fof(f110,plain,
! [X2,X0,X1] :
( subset(set_intersection2(X0,X1),X2)
| in(sK1(set_intersection2(X0,X1),X2),X0) ),
inference(resolution,[],[f84,f58]) ).
fof(f84,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f60]) ).
fof(f60,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f100,plain,
! [X0,X1] :
( set_intersection2(X1,X0) != empty_set
| disjoint(X0,X1) ),
inference(superposition,[],[f67,f49]) ).
fof(f49,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/tmp/tmp.fAd3Dl5mRe/Vampire---4.8_19992',commutativity_k3_xboole_0) ).
fof(f67,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.fAd3Dl5mRe/Vampire---4.8_19992',d7_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU154+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Apr 30 16:18:03 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.fAd3Dl5mRe/Vampire---4.8_19992
% 0.57/0.75 % (20198)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.57/0.75 % (20198)Refutation not found, incomplete strategy% (20198)------------------------------
% 0.57/0.75 % (20198)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (20198)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75 % (20194)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.57/0.75
% 0.57/0.75 % (20198)Memory used [KB]: 1040
% 0.57/0.75 % (20198)Time elapsed: 0.002 s
% 0.57/0.75 % (20198)Instructions burned: 3 (million)
% 0.57/0.75 % (20198)------------------------------
% 0.57/0.75 % (20198)------------------------------
% 0.57/0.75 % (20195)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.57/0.75 % (20197)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.57/0.75 % (20199)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.57/0.75 % (20201)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.57/0.75 % (20200)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.57/0.75 % (20201)Refutation not found, incomplete strategy% (20201)------------------------------
% 0.57/0.75 % (20201)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (20201)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (20201)Memory used [KB]: 972
% 0.57/0.75 % (20201)Time elapsed: 0.002 s
% 0.57/0.75 % (20201)Instructions burned: 3 (million)
% 0.57/0.75 % (20201)------------------------------
% 0.57/0.75 % (20201)------------------------------
% 0.57/0.75 % (20196)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.57/0.75 % (20199)Refutation not found, incomplete strategy% (20199)------------------------------
% 0.57/0.75 % (20199)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (20197)Refutation not found, incomplete strategy% (20197)------------------------------
% 0.57/0.75 % (20197)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (20197)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (20197)Memory used [KB]: 971
% 0.57/0.75 % (20197)Time elapsed: 0.003 s
% 0.57/0.75 % (20197)Instructions burned: 3 (million)
% 0.57/0.75 % (20197)------------------------------
% 0.57/0.75 % (20197)------------------------------
% 0.57/0.75 % (20199)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (20199)Memory used [KB]: 1038
% 0.57/0.75 % (20199)Time elapsed: 0.003 s
% 0.57/0.75 % (20199)Instructions burned: 3 (million)
% 0.57/0.75 % (20199)------------------------------
% 0.57/0.75 % (20199)------------------------------
% 0.57/0.75 % (20203)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.57/0.75 % (20204)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.57/0.75 % (20205)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.57/0.75 % (20206)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2996ds/52Mi)
% 0.57/0.76 % (20195)First to succeed.
% 0.57/0.76 % (20195)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (20195)------------------------------
% 0.57/0.76 % (20195)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (20195)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (20195)Memory used [KB]: 1078
% 0.57/0.76 % (20195)Time elapsed: 0.012 s
% 0.57/0.76 % (20195)Instructions burned: 17 (million)
% 0.57/0.76 % (20195)------------------------------
% 0.57/0.76 % (20195)------------------------------
% 0.57/0.76 % (20172)Success in time 0.396 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------