TSTP Solution File: SEU166+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU166+1 : TPTP v8.2.0. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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:45:12 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 4 unt; 0 def)
% Number of atoms : 219 ( 38 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 246 ( 85 ~; 96 |; 51 &)
% ( 6 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 137 ( 107 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f141,plain,
$false,
inference(avatar_sat_refutation,[],[f58,f100,f140]) ).
fof(f140,plain,
spl9_2,
inference(avatar_contradiction_clause,[],[f139]) ).
fof(f139,plain,
( $false
| spl9_2 ),
inference(subsumption_resolution,[],[f138,f102]) ).
fof(f102,plain,
( ~ in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK1))
| spl9_2 ),
inference(unit_resulting_resolution,[],[f57,f44]) ).
fof(f44,plain,
! [X0,X1] :
( ~ in(sK8(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f28,f29]) ).
fof(f29,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f28,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,[],[f27]) ).
fof(f27,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,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f57,plain,
( ~ subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))
| spl9_2 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f55,plain,
( spl9_2
<=> subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f138,plain,
( in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK1))
| spl9_2 ),
inference(forward_demodulation,[],[f134,f107]) ).
fof(f107,plain,
( sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)) = ordered_pair(sK6(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),sK7(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))))
| spl9_2 ),
inference(unit_resulting_resolution,[],[f103,f47]) ).
fof(f47,plain,
! [X0,X1,X8] :
( ordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)) = X8
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X2,X0,X1,X8] :
( ordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)) = X8
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ( ( ! [X4,X5] :
( ordered_pair(X4,X5) != sK3(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( sK3(X0,X1,X2) = ordered_pair(sK4(X0,X1,X2),sK5(X0,X1,X2))
& in(sK5(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) ) )
& ( ( ordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)) = X8
& in(sK7(X0,X1,X8),X1)
& in(sK6(X0,X1,X8),X0) )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7])],[f22,f25,f24,f23]) ).
fof(f23,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) != sK3(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(sK3(X0,X1,X2),X2) )
& ( ? [X7,X6] :
( ordered_pair(X6,X7) = sK3(X0,X1,X2)
& in(X7,X1)
& in(X6,X0) )
| in(sK3(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ? [X7,X6] :
( ordered_pair(X6,X7) = sK3(X0,X1,X2)
& in(X7,X1)
& in(X6,X0) )
=> ( sK3(X0,X1,X2) = ordered_pair(sK4(X0,X1,X2),sK5(X0,X1,X2))
& in(sK5(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0,X1,X8] :
( ? [X11,X12] :
( ordered_pair(X11,X12) = X8
& in(X12,X1)
& in(X11,X0) )
=> ( ordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)) = X8
& in(sK7(X0,X1,X8),X1)
& in(sK6(X0,X1,X8),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f22,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,[],[f21]) ).
fof(f21,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,[],[f3]) ).
fof(f3,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(f103,plain,
( in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK0))
| spl9_2 ),
inference(unit_resulting_resolution,[],[f57,f43]) ).
fof(f43,plain,
! [X0,X1] :
( in(sK8(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f134,plain,
( in(ordered_pair(sK6(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),sK7(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)))),cartesian_product2(sK2,sK1))
| spl9_2 ),
inference(unit_resulting_resolution,[],[f108,f126,f46]) ).
fof(f46,plain,
! [X10,X0,X1,X9] :
( in(ordered_pair(X9,X10),cartesian_product2(X0,X1))
| ~ in(X10,X1)
| ~ in(X9,X0) ),
inference(equality_resolution,[],[f45]) ).
fof(f45,plain,
! [X2,X10,X0,X1,X9] :
( in(ordered_pair(X9,X10),X2)
| ~ in(X10,X1)
| ~ in(X9,X0)
| cartesian_product2(X0,X1) != X2 ),
inference(equality_resolution,[],[f36]) ).
fof(f36,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,[],[f26]) ).
fof(f126,plain,
( in(sK7(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),sK1)
| spl9_2 ),
inference(unit_resulting_resolution,[],[f31,f109,f42]) ).
fof(f42,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f109,plain,
( in(sK7(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),sK0)
| spl9_2 ),
inference(unit_resulting_resolution,[],[f103,f48]) ).
fof(f48,plain,
! [X0,X1,X8] :
( in(sK7(X0,X1,X8),X1)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X2,X0,X1,X8] :
( in(sK7(X0,X1,X8),X1)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f31,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( ( ~ subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))
| ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)) )
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f19]) ).
fof(f19,plain,
( ? [X0,X1,X2] :
( ( ~ subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
| ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) )
& subset(X0,X1) )
=> ( ( ~ subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))
| ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)) )
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( ~ subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
| ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) )
& subset(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
& subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ) ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
& subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t118_zfmisc_1) ).
fof(f108,plain,
( in(sK6(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),sK2)
| spl9_2 ),
inference(unit_resulting_resolution,[],[f103,f49]) ).
fof(f49,plain,
! [X0,X1,X8] :
( in(sK6(X0,X1,X8),X0)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f33]) ).
fof(f33,plain,
! [X2,X0,X1,X8] :
( in(sK6(X0,X1,X8),X0)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f100,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f99]) ).
fof(f99,plain,
( $false
| spl9_1 ),
inference(subsumption_resolution,[],[f98,f60]) ).
fof(f60,plain,
( ~ in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK1,sK2))
| spl9_1 ),
inference(unit_resulting_resolution,[],[f53,f44]) ).
fof(f53,plain,
( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))
| spl9_1 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f51,plain,
( spl9_1
<=> subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f98,plain,
( in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK1,sK2))
| spl9_1 ),
inference(forward_demodulation,[],[f92,f71]) ).
fof(f71,plain,
( sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)) = ordered_pair(sK6(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),sK7(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))))
| spl9_1 ),
inference(unit_resulting_resolution,[],[f59,f47]) ).
fof(f59,plain,
( in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK0,sK2))
| spl9_1 ),
inference(unit_resulting_resolution,[],[f53,f43]) ).
fof(f92,plain,
( in(ordered_pair(sK6(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),sK7(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)))),cartesian_product2(sK1,sK2))
| spl9_1 ),
inference(unit_resulting_resolution,[],[f65,f79,f46]) ).
fof(f79,plain,
( in(sK6(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),sK1)
| spl9_1 ),
inference(unit_resulting_resolution,[],[f31,f64,f42]) ).
fof(f64,plain,
( in(sK6(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),sK0)
| spl9_1 ),
inference(unit_resulting_resolution,[],[f59,f49]) ).
fof(f65,plain,
( in(sK7(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),sK2)
| spl9_1 ),
inference(unit_resulting_resolution,[],[f59,f48]) ).
fof(f58,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f32,f55,f51]) ).
fof(f32,plain,
( ~ subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))
| ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU166+1 : TPTP v8.2.0. Released v3.3.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.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 16:05:37 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/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/benchmark/theBenchmark.p
% 0.55/0.73 % (30485)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.55/0.74 % (30478)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.55/0.74 % (30480)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.74 % (30481)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.74 % (30479)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.55/0.74 % (30482)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.55/0.74 % (30483)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.55/0.74 % (30484)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.55/0.74 % (30483)Refutation not found, incomplete strategy% (30483)------------------------------
% 0.55/0.74 % (30483)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (30482)Refutation not found, incomplete strategy% (30482)------------------------------
% 0.55/0.74 % (30482)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (30482)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (30482)Memory used [KB]: 1046
% 0.55/0.74 % (30482)Time elapsed: 0.004 s
% 0.55/0.74 % (30482)Instructions burned: 3 (million)
% 0.55/0.74 % (30483)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (30483)Memory used [KB]: 1040
% 0.55/0.74 % (30483)Time elapsed: 0.004 s
% 0.55/0.74 % (30483)Instructions burned: 3 (million)
% 0.55/0.74 % (30482)------------------------------
% 0.55/0.74 % (30482)------------------------------
% 0.55/0.74 % (30483)------------------------------
% 0.55/0.74 % (30483)------------------------------
% 0.55/0.74 % (30481)First to succeed.
% 0.55/0.74 % (30484)Also succeeded, but the first one will report.
% 0.55/0.74 % (30481)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30477"
% 0.55/0.74 % (30486)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.55/0.74 % (30487)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.55/0.74 % (30481)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for theBenchmark
% 0.55/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.74 % (30481)------------------------------
% 0.55/0.74 % (30481)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (30481)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (30481)Memory used [KB]: 1075
% 0.55/0.74 % (30481)Time elapsed: 0.008 s
% 0.55/0.74 % (30481)Instructions burned: 10 (million)
% 0.55/0.74 % (30477)Success in time 0.373 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------