TSTP Solution File: SET960+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET960+1 : TPTP v8.2.0. Released v3.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 : n005.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 : Tue May 21 03:14:05 EDT 2024
% Result : Theorem 0.56s 0.73s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 70 ( 10 unt; 0 def)
% Number of atoms : 251 ( 110 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 297 ( 116 ~; 113 |; 50 &)
% ( 12 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 143 ( 111 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f161,plain,
$false,
inference(avatar_sat_refutation,[],[f72,f82,f87,f133,f147,f151,f155,f160]) ).
fof(f160,plain,
spl10_1,
inference(avatar_contradiction_clause,[],[f159]) ).
fof(f159,plain,
( $false
| spl10_1 ),
inference(trivial_inequality_removal,[],[f158]) ).
fof(f158,plain,
( empty_set != empty_set
| spl10_1 ),
inference(superposition,[],[f67,f104]) ).
fof(f104,plain,
! [X0] : empty_set = cartesian_product2(X0,empty_set),
inference(resolution,[],[f102,f35]) ).
fof(f35,plain,
! [X0] :
( in(sK0(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0] :
( ( empty_set = X0
| in(sK0(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16]) ).
fof(f16,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f102,plain,
! [X0,X1] : ~ in(X0,cartesian_product2(X1,empty_set)),
inference(resolution,[],[f61,f57]) ).
fof(f57,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f17]) ).
fof(f61,plain,
! [X0,X1,X8] :
( in(sK5(X0,X1,X8),X1)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f37]) ).
fof(f37,plain,
! [X2,X0,X1,X8] :
( in(sK5(X0,X1,X8),X1)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ( ( ! [X4,X5] :
( ordered_pair(X4,X5) != sK1(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( sK1(X0,X1,X2) = ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2))
& in(sK3(X0,X1,X2),X1)
& in(sK2(X0,X1,X2),X0) )
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) ) )
& ( ( ordered_pair(sK4(X0,X1,X8),sK5(X0,X1,X8)) = X8
& in(sK5(X0,X1,X8),X1)
& in(sK4(X0,X1,X8),X0) )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f19,f22,f21,f20]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(X3,X2) )
& ( ? [X6,X7] :
( ordered_pair(X6,X7) = X3
& in(X7,X1)
& in(X6,X0) )
| in(X3,X2) ) )
=> ( ( ! [X5,X4] :
( ordered_pair(X4,X5) != sK1(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( ? [X7,X6] :
( ordered_pair(X6,X7) = sK1(X0,X1,X2)
& in(X7,X1)
& in(X6,X0) )
| in(sK1(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ? [X7,X6] :
( ordered_pair(X6,X7) = sK1(X0,X1,X2)
& in(X7,X1)
& in(X6,X0) )
=> ( sK1(X0,X1,X2) = ordered_pair(sK2(X0,X1,X2),sK3(X0,X1,X2))
& in(sK3(X0,X1,X2),X1)
& in(sK2(X0,X1,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1,X8] :
( ? [X11,X12] :
( ordered_pair(X11,X12) = X8
& in(X12,X1)
& in(X11,X0) )
=> ( ordered_pair(sK4(X0,X1,X8),sK5(X0,X1,X8)) = X8
& in(sK5(X0,X1,X8),X1)
& in(sK4(X0,X1,X8),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ? [X3] :
( ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(X3,X2) )
& ( ? [X6,X7] :
( ordered_pair(X6,X7) = X3
& in(X7,X1)
& in(X6,X0) )
| in(X3,X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) ) )
& ( ? [X11,X12] :
( ordered_pair(X11,X12) = X8
& in(X12,X1)
& in(X11,X0) )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ? [X3] :
( ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(X3,X2) )
& ( ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) ) )
& ( ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) )
| ~ in(X3,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( cartesian_product2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(f67,plain,
( empty_set != cartesian_product2(sK8,empty_set)
| spl10_1 ),
inference(avatar_component_clause,[],[f65]) ).
fof(f65,plain,
( spl10_1
<=> empty_set = cartesian_product2(sK8,empty_set) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f155,plain,
( spl10_2
| ~ spl10_7 ),
inference(avatar_split_clause,[],[f152,f145,f69]) ).
fof(f69,plain,
( spl10_2
<=> empty_set = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f145,plain,
( spl10_7
<=> ! [X0] : ~ in(X0,sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f152,plain,
( empty_set = sK9
| ~ spl10_7 ),
inference(resolution,[],[f146,f35]) ).
fof(f146,plain,
( ! [X0] : ~ in(X0,sK9)
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f151,plain,
( spl10_4
| ~ spl10_6 ),
inference(avatar_split_clause,[],[f148,f142,f79]) ).
fof(f79,plain,
( spl10_4
<=> empty_set = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f142,plain,
( spl10_6
<=> ! [X1] : ~ in(X1,sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f148,plain,
( empty_set = sK8
| ~ spl10_6 ),
inference(resolution,[],[f143,f35]) ).
fof(f143,plain,
( ! [X1] : ~ in(X1,sK8)
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f147,plain,
( spl10_6
| spl10_7
| ~ spl10_5 ),
inference(avatar_split_clause,[],[f135,f84,f145,f142]) ).
fof(f84,plain,
( spl10_5
<=> empty_set = cartesian_product2(sK8,sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f135,plain,
( ! [X0,X1] :
( ~ in(X0,sK9)
| ~ in(X1,sK8) )
| ~ spl10_5 ),
inference(resolution,[],[f134,f57]) ).
fof(f134,plain,
( ! [X0,X1] :
( in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),empty_set)
| ~ in(X1,sK9)
| ~ in(X0,sK8) )
| ~ spl10_5 ),
inference(superposition,[],[f59,f86]) ).
fof(f86,plain,
( empty_set = cartesian_product2(sK8,sK9)
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f59,plain,
! [X10,X0,X1,X9] :
( in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),cartesian_product2(X0,X1))
| ~ in(X10,X1)
| ~ in(X9,X0) ),
inference(equality_resolution,[],[f58]) ).
fof(f58,plain,
! [X2,X10,X0,X1,X9] :
( in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),X2)
| ~ in(X10,X1)
| ~ in(X9,X0)
| cartesian_product2(X0,X1) != X2 ),
inference(equality_resolution,[],[f54]) ).
fof(f54,plain,
! [X2,X10,X0,X1,X8,X9] :
( in(X8,X2)
| unordered_pair(unordered_pair(X9,X10),singleton(X9)) != X8
| ~ in(X10,X1)
| ~ in(X9,X0)
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f39,f44]) ).
fof(f44,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f39,plain,
! [X2,X10,X0,X1,X8,X9] :
( in(X8,X2)
| ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f23]) ).
fof(f133,plain,
spl10_3,
inference(avatar_contradiction_clause,[],[f132]) ).
fof(f132,plain,
( $false
| spl10_3 ),
inference(trivial_inequality_removal,[],[f128]) ).
fof(f128,plain,
( empty_set != empty_set
| spl10_3 ),
inference(superposition,[],[f77,f121]) ).
fof(f121,plain,
! [X0] : empty_set = cartesian_product2(empty_set,X0),
inference(resolution,[],[f109,f35]) ).
fof(f109,plain,
! [X0,X1] : ~ in(X0,cartesian_product2(empty_set,X1)),
inference(resolution,[],[f62,f57]) ).
fof(f62,plain,
! [X0,X1,X8] :
( in(sK4(X0,X1,X8),X0)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f36]) ).
fof(f36,plain,
! [X2,X0,X1,X8] :
( in(sK4(X0,X1,X8),X0)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f23]) ).
fof(f77,plain,
( empty_set != cartesian_product2(empty_set,sK9)
| spl10_3 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f75,plain,
( spl10_3
<=> empty_set = cartesian_product2(empty_set,sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f87,plain,
( spl10_5
| spl10_4
| spl10_2 ),
inference(avatar_split_clause,[],[f49,f69,f79,f84]) ).
fof(f49,plain,
( empty_set = sK9
| empty_set = sK8
| empty_set = cartesian_product2(sK8,sK9) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
( ( ( empty_set != sK9
& empty_set != sK8 )
| empty_set != cartesian_product2(sK8,sK9) )
& ( empty_set = sK9
| empty_set = sK8
| empty_set = cartesian_product2(sK8,sK9) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f29,f30]) ).
fof(f30,plain,
( ? [X0,X1] :
( ( ( empty_set != X1
& empty_set != X0 )
| empty_set != cartesian_product2(X0,X1) )
& ( empty_set = X1
| empty_set = X0
| empty_set = cartesian_product2(X0,X1) ) )
=> ( ( ( empty_set != sK9
& empty_set != sK8 )
| empty_set != cartesian_product2(sK8,sK9) )
& ( empty_set = sK9
| empty_set = sK8
| empty_set = cartesian_product2(sK8,sK9) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
? [X0,X1] :
( ( ( empty_set != X1
& empty_set != X0 )
| empty_set != cartesian_product2(X0,X1) )
& ( empty_set = X1
| empty_set = X0
| empty_set = cartesian_product2(X0,X1) ) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
? [X0,X1] :
( ( ( empty_set != X1
& empty_set != X0 )
| empty_set != cartesian_product2(X0,X1) )
& ( empty_set = X1
| empty_set = X0
| empty_set = cartesian_product2(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
? [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
<~> ( empty_set = X1
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
<=> ( empty_set = X1
| empty_set = X0 ) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
<=> ( empty_set = X1
| empty_set = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t113_zfmisc_1) ).
fof(f82,plain,
( ~ spl10_3
| ~ spl10_4 ),
inference(avatar_split_clause,[],[f73,f79,f75]) ).
fof(f73,plain,
( empty_set != sK8
| empty_set != cartesian_product2(empty_set,sK9) ),
inference(inner_rewriting,[],[f50]) ).
fof(f50,plain,
( empty_set != sK8
| empty_set != cartesian_product2(sK8,sK9) ),
inference(cnf_transformation,[],[f31]) ).
fof(f72,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f63,f69,f65]) ).
fof(f63,plain,
( empty_set != sK9
| empty_set != cartesian_product2(sK8,empty_set) ),
inference(inner_rewriting,[],[f51]) ).
fof(f51,plain,
( empty_set != sK9
| empty_set != cartesian_product2(sK8,sK9) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET960+1 : TPTP v8.2.0. Released v3.2.0.
% 0.12/0.14 % 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.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 11:58:52 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 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/benchmark/theBenchmark.p
% 0.56/0.72 % (307)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.56/0.72 % (302)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 theBenchmark for (2996ds/34Mi)
% 0.56/0.72 % (304)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.72 % (303)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 theBenchmark for (2996ds/51Mi)
% 0.56/0.72 % (307)Refutation not found, incomplete strategy% (307)------------------------------
% 0.56/0.72 % (307)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.72 % (307)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.72
% 0.56/0.72 % (307)Memory used [KB]: 1027
% 0.56/0.72 % (307)Time elapsed: 0.002 s
% 0.56/0.72 % (307)Instructions burned: 3 (million)
% 0.56/0.72 % (307)------------------------------
% 0.56/0.72 % (307)------------------------------
% 0.56/0.72 % (309)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.56/0.72 % (309)Refutation not found, incomplete strategy% (309)------------------------------
% 0.56/0.72 % (309)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.72 % (309)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.72
% 0.56/0.72 % (309)Memory used [KB]: 1041
% 0.56/0.72 % (309)Time elapsed: 0.003 s
% 0.56/0.72 % (309)Instructions burned: 3 (million)
% 0.56/0.72 % (309)------------------------------
% 0.56/0.72 % (309)------------------------------
% 0.56/0.72 % (310)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 theBenchmark for (2996ds/55Mi)
% 0.56/0.72 % (303)First to succeed.
% 0.56/0.72 % (306)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 theBenchmark for (2996ds/34Mi)
% 0.56/0.73 % (303)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-301"
% 0.56/0.73 % (308)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 theBenchmark for (2996ds/83Mi)
% 0.56/0.73 % (311)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 theBenchmark for (2996ds/50Mi)
% 0.56/0.73 % (303)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Theorem for theBenchmark
% 0.56/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.73 % (303)------------------------------
% 0.56/0.73 % (303)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (303)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (303)Memory used [KB]: 1080
% 0.56/0.73 % (303)Time elapsed: 0.007 s
% 0.56/0.73 % (303)Instructions burned: 8 (million)
% 0.56/0.73 % (301)Success in time 0.372 s
% 0.56/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------