TSTP Solution File: SEU225+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU225+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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:47 EDT 2024
% Result : Theorem 0.62s 0.78s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 73 ( 7 unt; 0 def)
% Number of atoms : 326 ( 72 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 418 ( 165 ~; 168 |; 55 &)
% ( 16 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 106 ( 93 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f206,plain,
$false,
inference(avatar_sat_refutation,[],[f165,f171,f179,f184,f200]) ).
fof(f200,plain,
( spl10_3
| spl10_4 ),
inference(avatar_contradiction_clause,[],[f199]) ).
fof(f199,plain,
( $false
| spl10_3
| spl10_4 ),
inference(subsumption_resolution,[],[f198,f94]) ).
fof(f94,plain,
relation(sK2),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
( apply(relation_dom_restriction(sK2,sK0),sK1) != apply(sK2,sK1)
& in(sK1,sK0)
& function(sK2)
& relation(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f51,f72]) ).
fof(f72,plain,
( ? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& function(X2)
& relation(X2) )
=> ( apply(relation_dom_restriction(sK2,sK0),sK1) != apply(sK2,sK1)
& in(sK1,sK0)
& function(sK2)
& relation(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f51,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& function(X2)
& relation(X2) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& function(X2)
& relation(X2) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t72_funct_1) ).
fof(f198,plain,
( ~ relation(sK2)
| spl10_3
| spl10_4 ),
inference(subsumption_resolution,[],[f197,f95]) ).
fof(f95,plain,
function(sK2),
inference(cnf_transformation,[],[f73]) ).
fof(f197,plain,
( ~ function(sK2)
| ~ relation(sK2)
| spl10_3
| spl10_4 ),
inference(subsumption_resolution,[],[f196,f190]) ).
fof(f190,plain,
( in(sK1,relation_dom(sK2))
| spl10_4 ),
inference(subsumption_resolution,[],[f189,f94]) ).
fof(f189,plain,
( in(sK1,relation_dom(sK2))
| ~ relation(sK2)
| spl10_4 ),
inference(subsumption_resolution,[],[f188,f95]) ).
fof(f188,plain,
( in(sK1,relation_dom(sK2))
| ~ function(sK2)
| ~ relation(sK2)
| spl10_4 ),
inference(trivial_inequality_removal,[],[f185]) ).
fof(f185,plain,
( empty_set != empty_set
| in(sK1,relation_dom(sK2))
| ~ function(sK2)
| ~ relation(sK2)
| spl10_4 ),
inference(superposition,[],[f169,f143]) ).
fof(f143,plain,
! [X0,X1] :
( apply(X0,X1) = empty_set
| in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f113]) ).
fof(f113,plain,
! [X2,X0,X1] :
( empty_set = X2
| apply(X0,X1) != X2
| in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
! [X0] :
( ! [X1,X2] :
( ( ( ( apply(X0,X1) = X2
| empty_set != X2 )
& ( empty_set = X2
| apply(X0,X1) != X2 ) )
| in(X1,relation_dom(X0)) )
& ( ( ( apply(X0,X1) = X2
| ~ in(ordered_pair(X1,X2),X0) )
& ( in(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2 ) )
| ~ in(X1,relation_dom(X0)) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(nnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0] :
( ! [X1,X2] :
( ( ( apply(X0,X1) = X2
<=> empty_set = X2 )
| in(X1,relation_dom(X0)) )
& ( ( apply(X0,X1) = X2
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f58]) ).
fof(f58,plain,
! [X0] :
( ! [X1,X2] :
( ( ( apply(X0,X1) = X2
<=> empty_set = X2 )
| in(X1,relation_dom(X0)) )
& ( ( apply(X0,X1) = X2
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ! [X1,X2] :
( ( ~ in(X1,relation_dom(X0))
=> ( apply(X0,X1) = X2
<=> empty_set = X2 ) )
& ( in(X1,relation_dom(X0))
=> ( apply(X0,X1) = X2
<=> in(ordered_pair(X1,X2),X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_funct_1) ).
fof(f169,plain,
( empty_set != apply(sK2,sK1)
| spl10_4 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f167,plain,
( spl10_4
<=> empty_set = apply(sK2,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f196,plain,
( ~ in(sK1,relation_dom(sK2))
| ~ function(sK2)
| ~ relation(sK2)
| spl10_3 ),
inference(subsumption_resolution,[],[f194,f96]) ).
fof(f96,plain,
in(sK1,sK0),
inference(cnf_transformation,[],[f73]) ).
fof(f194,plain,
( ~ in(sK1,sK0)
| ~ in(sK1,relation_dom(sK2))
| ~ function(sK2)
| ~ relation(sK2)
| spl10_3 ),
inference(resolution,[],[f164,f131]) ).
fof(f131,plain,
! [X2,X0,X1] :
( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,X0)
| ~ in(X1,relation_dom(X2))
| ~ function(X2)
| ~ relation(X2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,X0)
| ~ in(X1,relation_dom(X2)) )
& ( ( in(X1,X0)
& in(X1,relation_dom(X2)) )
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) )
| ~ function(X2)
| ~ relation(X2) ),
inference(flattening,[],[f92]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,X0)
| ~ in(X1,relation_dom(X2)) )
& ( ( in(X1,X0)
& in(X1,relation_dom(X2)) )
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) )
| ~ function(X2)
| ~ relation(X2) ),
inference(nnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) )
| ~ function(X2)
| ~ relation(X2) ),
inference(flattening,[],[f66]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) )
| ~ function(X2)
| ~ relation(X2) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,axiom,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l82_funct_1) ).
fof(f164,plain,
( ~ in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| spl10_3 ),
inference(avatar_component_clause,[],[f162]) ).
fof(f162,plain,
( spl10_3
<=> in(sK1,relation_dom(relation_dom_restriction(sK2,sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f184,plain,
spl10_2,
inference(avatar_contradiction_clause,[],[f183]) ).
fof(f183,plain,
( $false
| spl10_2 ),
inference(subsumption_resolution,[],[f182,f94]) ).
fof(f182,plain,
( ~ relation(sK2)
| spl10_2 ),
inference(subsumption_resolution,[],[f180,f95]) ).
fof(f180,plain,
( ~ function(sK2)
| ~ relation(sK2)
| spl10_2 ),
inference(resolution,[],[f160,f121]) ).
fof(f121,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f61]) ).
fof(f61,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0,X1] :
( ( function(X0)
& relation(X0) )
=> ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(f160,plain,
( ~ function(relation_dom_restriction(sK2,sK0))
| spl10_2 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f158,plain,
( spl10_2
<=> function(relation_dom_restriction(sK2,sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f179,plain,
spl10_1,
inference(avatar_contradiction_clause,[],[f178]) ).
fof(f178,plain,
( $false
| spl10_1 ),
inference(subsumption_resolution,[],[f177,f94]) ).
fof(f177,plain,
( ~ relation(sK2)
| spl10_1 ),
inference(subsumption_resolution,[],[f173,f95]) ).
fof(f173,plain,
( ~ function(sK2)
| ~ relation(sK2)
| spl10_1 ),
inference(resolution,[],[f156,f120]) ).
fof(f120,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f156,plain,
( ~ relation(relation_dom_restriction(sK2,sK0))
| spl10_1 ),
inference(avatar_component_clause,[],[f154]) ).
fof(f154,plain,
( spl10_1
<=> relation(relation_dom_restriction(sK2,sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f171,plain,
( ~ spl10_1
| ~ spl10_2
| spl10_3
| ~ spl10_4 ),
inference(avatar_split_clause,[],[f149,f167,f162,f158,f154]) ).
fof(f149,plain,
( empty_set != apply(sK2,sK1)
| in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ function(relation_dom_restriction(sK2,sK0))
| ~ relation(relation_dom_restriction(sK2,sK0)) ),
inference(superposition,[],[f97,f142]) ).
fof(f142,plain,
! [X0,X1] :
( apply(X0,X1) = empty_set
| in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f114]) ).
fof(f114,plain,
! [X2,X0,X1] :
( apply(X0,X1) = X2
| empty_set != X2
| in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f97,plain,
apply(relation_dom_restriction(sK2,sK0),sK1) != apply(sK2,sK1),
inference(cnf_transformation,[],[f73]) ).
fof(f165,plain,
( ~ spl10_1
| ~ spl10_2
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f152,f162,f158,f154]) ).
fof(f152,plain,
( ~ in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ function(relation_dom_restriction(sK2,sK0))
| ~ relation(relation_dom_restriction(sK2,sK0)) ),
inference(subsumption_resolution,[],[f151,f94]) ).
fof(f151,plain,
( ~ in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ relation(sK2)
| ~ function(relation_dom_restriction(sK2,sK0))
| ~ relation(relation_dom_restriction(sK2,sK0)) ),
inference(subsumption_resolution,[],[f150,f95]) ).
fof(f150,plain,
( ~ in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ function(sK2)
| ~ relation(sK2)
| ~ function(relation_dom_restriction(sK2,sK0))
| ~ relation(relation_dom_restriction(sK2,sK0)) ),
inference(trivial_inequality_removal,[],[f147]) ).
fof(f147,plain,
( apply(sK2,sK1) != apply(sK2,sK1)
| ~ in(sK1,relation_dom(relation_dom_restriction(sK2,sK0)))
| ~ function(sK2)
| ~ relation(sK2)
| ~ function(relation_dom_restriction(sK2,sK0))
| ~ relation(relation_dom_restriction(sK2,sK0)) ),
inference(superposition,[],[f97,f140]) ).
fof(f140,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ function(X2)
| ~ relation(X2)
| ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0)) ),
inference(equality_resolution,[],[f108]) ).
fof(f108,plain,
! [X2,X0,X1,X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1))
| relation_dom_restriction(X2,X0) != X1
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f82,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ( apply(X1,sK5(X1,X2)) != apply(X2,sK5(X1,X2))
& in(sK5(X1,X2),relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f80,f81]) ).
fof(f81,plain,
! [X1,X2] :
( ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
=> ( apply(X1,sK5(X1,X2)) != apply(X2,sK5(X1,X2))
& in(sK5(X1,X2),relation_dom(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f80,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(rectify,[],[f79]) ).
fof(f79,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f78]) ).
fof(f78,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(nnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,axiom,
! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU225+1 : TPTP v8.2.0. Released v3.3.0.
% 0.10/0.11 % 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.11/0.31 % Computer : n006.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 17:38:53 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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/benchmark/theBenchmark.p
% 0.62/0.77 % (28483)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 (2995ds/34Mi)
% 0.62/0.77 % (28485)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.62/0.77 % (28486)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.62/0.77 % (28488)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.62/0.77 % (28484)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 (2995ds/51Mi)
% 0.62/0.77 % (28487)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 (2995ds/34Mi)
% 0.62/0.77 % (28489)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 (2995ds/83Mi)
% 0.62/0.78 % (28490)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 (2995ds/56Mi)
% 0.62/0.78 % (28490)Refutation not found, incomplete strategy% (28490)------------------------------
% 0.62/0.78 % (28490)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.78 % (28490)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.78
% 0.62/0.78 % (28490)Memory used [KB]: 1067
% 0.62/0.78 % (28490)Time elapsed: 0.003 s
% 0.62/0.78 % (28490)Instructions burned: 4 (million)
% 0.62/0.78 % (28490)------------------------------
% 0.62/0.78 % (28490)------------------------------
% 0.62/0.78 % (28488)First to succeed.
% 0.62/0.78 % (28488)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28480"
% 0.62/0.78 % (28487)Refutation not found, incomplete strategy% (28487)------------------------------
% 0.62/0.78 % (28487)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.78 % (28487)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.78
% 0.62/0.78 % (28487)Memory used [KB]: 1153
% 0.62/0.78 % (28487)Time elapsed: 0.006 s
% 0.62/0.78 % (28487)Instructions burned: 9 (million)
% 0.62/0.78 % (28488)Refutation found. Thanks to Tanya!
% 0.62/0.78 % SZS status Theorem for theBenchmark
% 0.62/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.78 % (28488)------------------------------
% 0.62/0.78 % (28488)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.78 % (28488)Termination reason: Refutation
% 0.62/0.78
% 0.62/0.78 % (28488)Memory used [KB]: 1081
% 0.62/0.78 % (28488)Time elapsed: 0.005 s
% 0.62/0.78 % (28488)Instructions burned: 8 (million)
% 0.62/0.78 % (28480)Success in time 0.457 s
% 0.62/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------