TSTP Solution File: SET935+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET935+1 : TPTP v8.1.2. 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 : 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 : Sun May 5 09:09:06 EDT 2024
% Result : Theorem 0.42s 0.58s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 76 ( 13 unt; 0 def)
% Number of atoms : 263 ( 39 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 306 ( 119 ~; 124 |; 48 &)
% ( 10 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 109 ( 98 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f218,plain,
$false,
inference(avatar_sat_refutation,[],[f129,f145,f150,f194,f217]) ).
fof(f217,plain,
~ spl4_6,
inference(avatar_contradiction_clause,[],[f216]) ).
fof(f216,plain,
( $false
| ~ spl4_6 ),
inference(subsumption_resolution,[],[f207,f71]) ).
fof(f71,plain,
~ subset(sK0,sK1),
inference(resolution,[],[f40,f50]) ).
fof(f50,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( inclusion_comparable(X0,X1)
| ( ~ subset(X1,X0)
& ~ subset(X0,X1) ) )
& ( subset(X1,X0)
| subset(X0,X1)
| ~ inclusion_comparable(X0,X1) ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( inclusion_comparable(X0,X1)
| ( ~ subset(X1,X0)
& ~ subset(X0,X1) ) )
& ( subset(X1,X0)
| subset(X0,X1)
| ~ inclusion_comparable(X0,X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( inclusion_comparable(X0,X1)
<=> ( subset(X1,X0)
| subset(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.osL0Xsdjiz/Vampire---4.8_3051',d9_xboole_0) ).
fof(f40,plain,
~ inclusion_comparable(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( ~ inclusion_comparable(sK0,sK1)
& set_union2(powerset(sK0),powerset(sK1)) = powerset(set_union2(sK0,sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f21,f24]) ).
fof(f24,plain,
( ? [X0,X1] :
( ~ inclusion_comparable(X0,X1)
& set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1)) )
=> ( ~ inclusion_comparable(sK0,sK1)
& set_union2(powerset(sK0),powerset(sK1)) = powerset(set_union2(sK0,sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1] :
( ~ inclusion_comparable(X0,X1)
& set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1)) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,negated_conjecture,
~ ! [X0,X1] :
( set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1))
=> inclusion_comparable(X0,X1) ),
inference(negated_conjecture,[],[f16]) ).
fof(f16,conjecture,
! [X0,X1] :
( set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1))
=> inclusion_comparable(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.osL0Xsdjiz/Vampire---4.8_3051',t82_zfmisc_1) ).
fof(f207,plain,
( subset(sK0,sK1)
| ~ spl4_6 ),
inference(superposition,[],[f59,f144]) ).
fof(f144,plain,
( sK1 = set_union2(sK0,sK1)
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f142,plain,
( spl4_6
<=> sK1 = set_union2(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f59,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/tmp/tmp.osL0Xsdjiz/Vampire---4.8_3051',t7_xboole_1) ).
fof(f194,plain,
( ~ spl4_4
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f193]) ).
fof(f193,plain,
( $false
| ~ spl4_4
| ~ spl4_5 ),
inference(subsumption_resolution,[],[f182,f72]) ).
fof(f72,plain,
~ subset(sK1,sK0),
inference(resolution,[],[f40,f51]) ).
fof(f51,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f182,plain,
( subset(sK1,sK0)
| ~ spl4_4
| ~ spl4_5 ),
inference(superposition,[],[f139,f173]) ).
fof(f173,plain,
( sK0 = set_union2(sK0,sK1)
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f172,f59]) ).
fof(f172,plain,
( sK0 = set_union2(sK0,sK1)
| ~ subset(sK0,set_union2(sK0,sK1))
| ~ spl4_4 ),
inference(resolution,[],[f170,f63]) ).
fof(f63,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f37]) ).
fof(f37,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/sandbox/tmp/tmp.osL0Xsdjiz/Vampire---4.8_3051',d10_xboole_0) ).
fof(f170,plain,
( subset(set_union2(sK0,sK1),sK0)
| ~ spl4_4 ),
inference(resolution,[],[f126,f65]) ).
fof(f65,plain,
! [X3,X0] :
( ~ in(X3,powerset(X0))
| subset(X3,X0) ),
inference(equality_resolution,[],[f43]) ).
fof(f43,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK2(X0,X1),X0)
| ~ in(sK2(X0,X1),X1) )
& ( subset(sK2(X0,X1),X0)
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f27,f28]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK2(X0,X1),X0)
| ~ in(sK2(X0,X1),X1) )
& ( subset(sK2(X0,X1),X0)
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.osL0Xsdjiz/Vampire---4.8_3051',d1_zfmisc_1) ).
fof(f126,plain,
( in(set_union2(sK0,sK1),powerset(sK0))
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f124]) ).
fof(f124,plain,
( spl4_4
<=> in(set_union2(sK0,sK1),powerset(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f139,plain,
( subset(sK1,set_union2(sK0,sK1))
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f138,plain,
( spl4_5
<=> subset(sK1,set_union2(sK0,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f150,plain,
spl4_5,
inference(avatar_contradiction_clause,[],[f149]) ).
fof(f149,plain,
( $false
| spl4_5 ),
inference(subsumption_resolution,[],[f148,f70]) ).
fof(f70,plain,
! [X1] : subset(X1,X1),
inference(equality_resolution,[],[f61]) ).
fof(f61,plain,
! [X0,X1] :
( subset(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f38]) ).
fof(f148,plain,
( ~ subset(sK1,sK1)
| spl4_5 ),
inference(resolution,[],[f146,f64]) ).
fof(f64,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f44]) ).
fof(f44,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f146,plain,
( ~ in(sK1,powerset(sK1))
| spl4_5 ),
inference(resolution,[],[f140,f80]) ).
fof(f80,plain,
! [X0] :
( subset(X0,set_union2(sK0,sK1))
| ~ in(X0,powerset(sK1)) ),
inference(resolution,[],[f74,f66]) ).
fof(f66,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f54]) ).
fof(f54,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ( ( ( ~ in(sK3(X0,X1,X2),X1)
& ~ in(sK3(X0,X1,X2),X0) )
| ~ in(sK3(X0,X1,X2),X2) )
& ( in(sK3(X0,X1,X2),X1)
| in(sK3(X0,X1,X2),X0)
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f34,f35]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK3(X0,X1,X2),X1)
& ~ in(sK3(X0,X1,X2),X0) )
| ~ in(sK3(X0,X1,X2),X2) )
& ( in(sK3(X0,X1,X2),X1)
| in(sK3(X0,X1,X2),X0)
| in(sK3(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.osL0Xsdjiz/Vampire---4.8_3051',d2_xboole_0) ).
fof(f74,plain,
! [X0] :
( ~ in(X0,set_union2(powerset(sK0),powerset(sK1)))
| subset(X0,set_union2(sK0,sK1)) ),
inference(superposition,[],[f65,f39]) ).
fof(f39,plain,
set_union2(powerset(sK0),powerset(sK1)) = powerset(set_union2(sK0,sK1)),
inference(cnf_transformation,[],[f25]) ).
fof(f140,plain,
( ~ subset(sK1,set_union2(sK0,sK1))
| spl4_5 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f145,plain,
( ~ spl4_5
| spl4_6
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f136,f120,f142,f138]) ).
fof(f120,plain,
( spl4_3
<=> in(set_union2(sK0,sK1),powerset(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f136,plain,
( sK1 = set_union2(sK0,sK1)
| ~ subset(sK1,set_union2(sK0,sK1))
| ~ spl4_3 ),
inference(resolution,[],[f134,f63]) ).
fof(f134,plain,
( subset(set_union2(sK0,sK1),sK1)
| ~ spl4_3 ),
inference(resolution,[],[f122,f65]) ).
fof(f122,plain,
( in(set_union2(sK0,sK1),powerset(sK1))
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f120]) ).
fof(f129,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f108,f124,f120]) ).
fof(f108,plain,
( in(set_union2(sK0,sK1),powerset(sK0))
| in(set_union2(sK0,sK1),powerset(sK1)) ),
inference(resolution,[],[f89,f60]) ).
fof(f60,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/tmp/tmp.osL0Xsdjiz/Vampire---4.8_3051',reflexivity_r1_tarski) ).
fof(f89,plain,
! [X0] :
( ~ subset(X0,set_union2(sK0,sK1))
| in(X0,powerset(sK0))
| in(X0,powerset(sK1)) ),
inference(resolution,[],[f75,f68]) ).
fof(f68,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f52]) ).
fof(f52,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f36]) ).
fof(f75,plain,
! [X0] :
( in(X0,set_union2(powerset(sK0),powerset(sK1)))
| ~ subset(X0,set_union2(sK0,sK1)) ),
inference(superposition,[],[f64,f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET935+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.10 % 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.29 % Computer : n032.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Fri May 3 16:25:52 EDT 2024
% 0.11/0.29 % CPUTime :
% 0.11/0.29 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.29 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.osL0Xsdjiz/Vampire---4.8_3051
% 0.15/0.57 % (3306)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2997ds/78Mi)
% 0.15/0.57 % (3311)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 (2997ds/56Mi)
% 0.15/0.57 % (3305)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 (2997ds/51Mi)
% 0.15/0.57 % (3307)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2997ds/33Mi)
% 0.15/0.57 % (3311)Refutation not found, incomplete strategy% (3311)------------------------------
% 0.15/0.57 % (3311)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.57 % (3311)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.57
% 0.15/0.57 % (3311)Memory used [KB]: 974
% 0.15/0.57 % (3311)Time elapsed: 0.001 s
% 0.15/0.57 % (3311)Instructions burned: 3 (million)
% 0.15/0.57 % (3304)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 (2997ds/34Mi)
% 0.15/0.57 % (3308)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 (2997ds/34Mi)
% 0.15/0.57 % (3311)------------------------------
% 0.15/0.57 % (3311)------------------------------
% 0.15/0.58 % (3307)Refutation not found, incomplete strategy% (3307)------------------------------
% 0.15/0.58 % (3307)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.58 % (3307)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.58
% 0.15/0.58 % (3307)Memory used [KB]: 974
% 0.15/0.58 % (3307)Time elapsed: 0.004 s
% 0.15/0.58 % (3308)Refutation not found, incomplete strategy% (3308)------------------------------
% 0.15/0.58 % (3308)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.58 % (3308)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.58
% 0.15/0.58 % (3308)Memory used [KB]: 1039
% 0.15/0.58 % (3308)Time elapsed: 0.003 s
% 0.15/0.58 % (3308)Instructions burned: 3 (million)
% 0.15/0.58 % (3307)Instructions burned: 3 (million)
% 0.15/0.58 % (3308)------------------------------
% 0.15/0.58 % (3308)------------------------------
% 0.15/0.58 % (3304)Refutation not found, incomplete strategy% (3304)------------------------------
% 0.15/0.58 % (3304)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.58 % (3304)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.58
% 0.15/0.58 % (3307)------------------------------
% 0.15/0.58 % (3307)------------------------------
% 0.15/0.58 % (3304)Memory used [KB]: 1053
% 0.15/0.58 % (3304)Time elapsed: 0.003 s
% 0.15/0.58 % (3304)Instructions burned: 4 (million)
% 0.15/0.58 % (3309)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2997ds/45Mi)
% 0.15/0.58 % (3304)------------------------------
% 0.15/0.58 % (3304)------------------------------
% 0.42/0.58 % (3310)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 (2997ds/83Mi)
% 0.42/0.58 % (3309)First to succeed.
% 0.42/0.58 % (3309)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3300"
% 0.42/0.58 % (3312)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 (2997ds/55Mi)
% 0.42/0.58 % (3309)Refutation found. Thanks to Tanya!
% 0.42/0.58 % SZS status Theorem for Vampire---4
% 0.42/0.58 % SZS output start Proof for Vampire---4
% See solution above
% 0.42/0.58 % (3309)------------------------------
% 0.42/0.58 % (3309)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.42/0.58 % (3309)Termination reason: Refutation
% 0.42/0.58
% 0.42/0.58 % (3309)Memory used [KB]: 1079
% 0.42/0.58 % (3309)Time elapsed: 0.005 s
% 0.42/0.58 % (3309)Instructions burned: 10 (million)
% 0.42/0.58 % (3300)Success in time 0.279 s
% 0.42/0.58 % Vampire---4.8 exiting
%------------------------------------------------------------------------------