TSTP Solution File: SET144+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET144+3 : TPTP v8.2.0. 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 : n007.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:09:15 EDT 2024
% Result : Theorem 0.57s 0.77s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 82 ( 4 unt; 0 def)
% Number of atoms : 245 ( 17 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 268 ( 105 ~; 112 |; 32 &)
% ( 13 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 99 ( 87 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f128,plain,
$false,
inference(avatar_sat_refutation,[],[f74,f75,f96,f106,f116,f119,f122,f124,f127]) ).
fof(f127,plain,
( ~ spl6_6
| spl6_8 ),
inference(avatar_contradiction_clause,[],[f126]) ).
fof(f126,plain,
( $false
| ~ spl6_6
| spl6_8 ),
inference(subsumption_resolution,[],[f125,f105]) ).
fof(f105,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK0)
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f103]) ).
fof(f103,plain,
( spl6_6
<=> member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f125,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK0)
| spl6_8 ),
inference(resolution,[],[f115,f62]) ).
fof(f62,plain,
! [X0] :
( member(X0,sK1)
| ~ member(X0,sK0) ),
inference(resolution,[],[f29,f43]) ).
fof(f43,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f22,f23]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f29,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( union(sK0,intersection(sK2,sK1)) != intersection(union(sK0,sK2),sK1)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f13]) ).
fof(f13,plain,
( ? [X0,X1,X2] :
( union(X0,intersection(X2,X1)) != intersection(union(X0,X2),X1)
& subset(X0,X1) )
=> ( union(sK0,intersection(sK2,sK1)) != intersection(union(sK0,sK2),sK1)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1,X2] :
( union(X0,intersection(X2,X1)) != intersection(union(X0,X2),X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> union(X0,intersection(X2,X1)) = intersection(union(X0,X2),X1) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> union(X0,intersection(X2,X1)) = intersection(union(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th44) ).
fof(f115,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK1)
| spl6_8 ),
inference(avatar_component_clause,[],[f113]) ).
fof(f113,plain,
( spl6_8
<=> member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_8])]) ).
fof(f124,plain,
( ~ spl6_5
| spl6_7 ),
inference(avatar_contradiction_clause,[],[f123]) ).
fof(f123,plain,
( $false
| ~ spl6_5
| spl6_7 ),
inference(subsumption_resolution,[],[f121,f117]) ).
fof(f117,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK2)
| ~ spl6_5 ),
inference(resolution,[],[f101,f36]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f101,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),intersection(sK2,sK1))
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f99,plain,
( spl6_5
<=> member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),intersection(sK2,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f121,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK2)
| spl6_7 ),
inference(resolution,[],[f111,f34]) ).
fof(f34,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f111,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),union(sK0,sK2))
| spl6_7 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f109,plain,
( spl6_7
<=> member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),union(sK0,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
fof(f122,plain,
( ~ spl6_6
| spl6_7 ),
inference(avatar_split_clause,[],[f120,f109,f103]) ).
fof(f120,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK0)
| spl6_7 ),
inference(resolution,[],[f111,f33]) ).
fof(f33,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f119,plain,
( spl6_8
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f118,f99,f113]) ).
fof(f118,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK1)
| ~ spl6_5 ),
inference(resolution,[],[f101,f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f116,plain,
( ~ spl6_7
| ~ spl6_8
| spl6_2 ),
inference(avatar_split_clause,[],[f107,f71,f113,f109]) ).
fof(f71,plain,
( spl6_2
<=> member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),intersection(union(sK0,sK2),sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f107,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK1)
| ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),union(sK0,sK2))
| spl6_2 ),
inference(resolution,[],[f72,f38]) ).
fof(f38,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f72,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),intersection(union(sK0,sK2),sK1))
| spl6_2 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f106,plain,
( spl6_5
| spl6_6
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f97,f67,f103,f99]) ).
fof(f67,plain,
( spl6_1
<=> member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),union(sK0,intersection(sK2,sK1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f97,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK0)
| member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),intersection(sK2,sK1))
| ~ spl6_1 ),
inference(resolution,[],[f69,f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f69,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),union(sK0,intersection(sK2,sK1)))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f96,plain,
( spl6_1
| ~ spl6_2 ),
inference(avatar_contradiction_clause,[],[f95]) ).
fof(f95,plain,
( $false
| spl6_1
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f94,f92]) ).
fof(f92,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK2)
| spl6_1
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f91,f90]) ).
fof(f90,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK1)
| ~ spl6_2 ),
inference(resolution,[],[f73,f37]) ).
fof(f73,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),intersection(union(sK0,sK2),sK1))
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f91,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK1)
| ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK2)
| spl6_1 ),
inference(resolution,[],[f88,f38]) ).
fof(f88,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),intersection(sK2,sK1))
| spl6_1 ),
inference(resolution,[],[f68,f34]) ).
fof(f68,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),union(sK0,intersection(sK2,sK1)))
| spl6_1 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f94,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK2)
| spl6_1
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f93,f87]) ).
fof(f87,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK0)
| spl6_1 ),
inference(resolution,[],[f68,f33]) ).
fof(f93,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK0)
| member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),sK2)
| ~ spl6_2 ),
inference(resolution,[],[f89,f32]) ).
fof(f89,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),union(sK0,sK2))
| ~ spl6_2 ),
inference(resolution,[],[f73,f36]) ).
fof(f75,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f64,f71,f67]) ).
fof(f64,plain,
( ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),intersection(union(sK0,sK2),sK1))
| ~ member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),union(sK0,intersection(sK2,sK1))) ),
inference(resolution,[],[f55,f59]) ).
fof(f59,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| ~ member(sK4(X0,X1),X1)
| ~ member(sK4(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f49,f54]) ).
fof(f54,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).
fof(f49,plain,
! [X0,X1] :
( X0 = X1
| ~ member(sK4(X0,X1),X1)
| ~ member(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK4(X0,X1),X1)
| ~ member(sK4(X0,X1),X0) )
& ( member(sK4(X0,X1),X1)
| member(sK4(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f26,f27]) ).
fof(f27,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) )
=> ( ( ~ member(sK4(X0,X1),X1)
| ~ member(sK4(X0,X1),X0) )
& ( member(sK4(X0,X1),X1)
| member(sK4(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f55,plain,
~ sQ5_eqProxy(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),
inference(equality_proxy_replacement,[],[f30,f54]) ).
fof(f30,plain,
union(sK0,intersection(sK2,sK1)) != intersection(union(sK0,sK2),sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f74,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f63,f71,f67]) ).
fof(f63,plain,
( member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),intersection(union(sK0,sK2),sK1))
| member(sK4(union(sK0,intersection(sK2,sK1)),intersection(union(sK0,sK2),sK1)),union(sK0,intersection(sK2,sK1))) ),
inference(resolution,[],[f55,f60]) ).
fof(f60,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| member(sK4(X0,X1),X1)
| member(sK4(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f48,f54]) ).
fof(f48,plain,
! [X0,X1] :
( X0 = X1
| member(sK4(X0,X1),X1)
| member(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET144+3 : TPTP v8.2.0. Released v2.2.0.
% 0.08/0.16 % 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.16/0.38 % Computer : n007.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon May 20 13:18:53 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.38 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.57/0.77 % (18932)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.57/0.77 % (18925)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.57/0.77 % (18926)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.57/0.77 % (18927)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.77 % (18928)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.57/0.77 % (18929)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.57/0.77 % (18930)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.57/0.77 % (18931)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.57/0.77 % (18932)First to succeed.
% 0.57/0.77 % (18932)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18924"
% 0.57/0.77 % (18930)Refutation not found, incomplete strategy% (18930)------------------------------
% 0.57/0.77 % (18930)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.77 % (18930)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.77 % (18932)Refutation found. Thanks to Tanya!
% 0.57/0.77 % SZS status Theorem for theBenchmark
% 0.57/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.77 % (18932)------------------------------
% 0.57/0.77 % (18932)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.77 % (18932)Termination reason: Refutation
% 0.57/0.77
% 0.57/0.77 % (18932)Memory used [KB]: 1062
% 0.57/0.77 % (18932)Time elapsed: 0.003 s
% 0.57/0.77 % (18932)Instructions burned: 6 (million)
% 0.57/0.77 % (18924)Success in time 0.383 s
% 0.57/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------