TSTP Solution File: SWC016+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC016+1 : TPTP v8.2.0. Released v2.4.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 04:35:35 EDT 2024
% Result : Theorem 0.77s 0.93s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 61 ( 3 unt; 1 typ; 0 def)
% Number of atoms : 731 ( 97 equ)
% Maximal formula atoms : 40 ( 12 avg)
% Number of connectives : 535 ( 184 ~; 167 |; 155 &)
% ( 9 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 320 ( 320 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 20 ( 18 usr; 15 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 76 ( 37 !; 38 ?; 11 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ10_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f319,plain,
$false,
inference(avatar_sat_refutation,[],[f266,f271,f276,f277,f282,f287,f292,f297,f298,f318]) ).
tff(f318,plain,
( ~ spl11_2
| ~ spl11_5
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(avatar_contradiction_clause,[],[f317]) ).
tff(f317,plain,
( $false
| ~ spl11_2
| ~ spl11_5
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f316,f281]) ).
tff(f281,plain,
( frontsegP(sK2,sK4)
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f279]) ).
tff(f279,plain,
( spl11_5
<=> frontsegP(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
tff(f316,plain,
( ~ frontsegP(sK2,sK4)
| ~ spl11_2
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f315,f291]) ).
tff(f291,plain,
( neq(sK4,nil)
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f289]) ).
tff(f289,plain,
( spl11_7
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_7])]) ).
tff(f315,plain,
( ~ neq(sK4,nil)
| ~ frontsegP(sK2,sK4)
| ~ spl11_2
| ~ spl11_6
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f314,f296]) ).
tff(f296,plain,
( ssList(sK4)
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f294]) ).
tff(f294,plain,
( spl11_8
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_8])]) ).
tff(f314,plain,
( ~ ssList(sK4)
| ~ neq(sK4,nil)
| ~ frontsegP(sK2,sK4)
| ~ spl11_2
| ~ spl11_6 ),
inference(resolution,[],[f265,f286]) ).
tff(f286,plain,
( frontsegP(sK3,sK4)
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f284]) ).
tff(f284,plain,
( spl11_6
<=> frontsegP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
tff(f265,plain,
( ! [X4: $i] :
( ~ frontsegP(sK3,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4) )
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f264]) ).
tff(f264,plain,
( spl11_2
<=> ! [X4] :
( ~ frontsegP(sK2,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK3,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
tff(f298,plain,
( spl11_1
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f228,f268,f260]) ).
tff(f260,plain,
( spl11_1
<=> sQ10_eqProxy($i,nil,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
tff(f268,plain,
( spl11_3
<=> sQ10_eqProxy($i,nil,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
tff(f228,plain,
( ~ sQ10_eqProxy($i,nil,sK3)
| sQ10_eqProxy($i,nil,sK2) ),
inference(equality_proxy_replacement,[],[f161,f223]) ).
tff(f223,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ10_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ10_eqProxy])]) ).
tff(f161,plain,
( ( nil != sK3 )
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f137]) ).
tff(f137,plain,
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(sK3,nil)
| ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& ( ( nil != sK3 )
| ( nil = sK2 ) )
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f136,f135,f134,f133,f132]) ).
tff(f132,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( ( nil != X0 )
& ( nil = X1 ) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( ( nil != sK0 )
& ( nil = X1 ) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f133,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( ( nil != sK0 )
& ( nil = X1 ) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f134,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != X3 )
| ( nil = sK2 ) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f135,plain,
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != X3 )
| ( nil = sK2 ) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
=> ( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(sK3,nil)
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(sK3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != sK3 )
| ( nil = sK2 ) )
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f136,plain,
( ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(sK3,X5)
& neq(X5,nil)
& ssList(X5) )
=> ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( ( nil != X0 )
& ( nil = X1 ) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
tff(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( ( nil != X0 )
& ( nil = X1 ) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
tff(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( ( nil = X0 )
| ( nil != X1 ) ) )
| ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
tff(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( frontsegP(X0,X5)
& frontsegP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( ( nil = X0 )
| ( nil != X1 ) ) )
| ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
tff(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( frontsegP(X0,X5)
& frontsegP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( ( nil = X0 )
| ( nil != X1 ) ) )
| ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f297,plain,
( spl11_8
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f162,f273,f294]) ).
tff(f273,plain,
( spl11_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
tff(f162,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f137]) ).
tff(f292,plain,
( spl11_7
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f163,f273,f289]) ).
tff(f163,plain,
( ~ neq(sK3,nil)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f137]) ).
tff(f287,plain,
( spl11_6
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f164,f273,f284]) ).
tff(f164,plain,
( ~ neq(sK3,nil)
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f137]) ).
tff(f282,plain,
( spl11_5
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f165,f273,f279]) ).
tff(f165,plain,
( ~ neq(sK3,nil)
| frontsegP(sK2,sK4) ),
inference(cnf_transformation,[],[f137]) ).
tff(f277,plain,
( spl11_3
| spl11_4 ),
inference(avatar_split_clause,[],[f227,f273,f268]) ).
tff(f227,plain,
( neq(sK3,nil)
| sQ10_eqProxy($i,nil,sK3) ),
inference(equality_proxy_replacement,[],[f213,f223]) ).
tff(f213,plain,
( neq(sK3,nil)
| ( nil = sK3 ) ),
inference(definition_unfolding,[],[f166,f159,f159]) ).
tff(f159,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f137]) ).
tff(f166,plain,
( neq(sK1,nil)
| ( nil = sK1 ) ),
inference(cnf_transformation,[],[f137]) ).
tff(f276,plain,
( ~ spl11_1
| spl11_4 ),
inference(avatar_split_clause,[],[f226,f273,f260]) ).
tff(f226,plain,
( neq(sK3,nil)
| ~ sQ10_eqProxy($i,nil,sK2) ),
inference(equality_proxy_replacement,[],[f212,f223]) ).
tff(f212,plain,
( neq(sK3,nil)
| ( nil != sK2 ) ),
inference(definition_unfolding,[],[f167,f159,f160]) ).
tff(f160,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f137]) ).
tff(f167,plain,
( neq(sK1,nil)
| ( nil != sK0 ) ),
inference(cnf_transformation,[],[f137]) ).
tff(f271,plain,
( spl11_3
| spl11_2 ),
inference(avatar_split_clause,[],[f225,f264,f268]) ).
tff(f225,plain,
! [X4: $i] :
( ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| sQ10_eqProxy($i,nil,sK3) ),
inference(equality_proxy_replacement,[],[f211,f223]) ).
tff(f211,plain,
! [X4: $i] :
( ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ( nil = sK3 ) ),
inference(definition_unfolding,[],[f168,f160,f159,f159]) ).
tff(f168,plain,
! [X4: $i] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ( nil = sK1 ) ),
inference(cnf_transformation,[],[f137]) ).
tff(f266,plain,
( ~ spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f224,f264,f260]) ).
tff(f224,plain,
! [X4: $i] :
( ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ sQ10_eqProxy($i,nil,sK2) ),
inference(equality_proxy_replacement,[],[f210,f223]) ).
tff(f210,plain,
! [X4: $i] :
( ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ( nil != sK2 ) ),
inference(definition_unfolding,[],[f169,f160,f159,f160]) ).
tff(f169,plain,
! [X4: $i] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ( nil != sK0 ) ),
inference(cnf_transformation,[],[f137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC016+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % 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.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:01:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.74/0.93 % (30676)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 (2994ds/34Mi)
% 0.74/0.93 % (30678)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.74/0.93 % (30679)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.74/0.93 % (30677)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 (2994ds/51Mi)
% 0.74/0.93 % (30680)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 (2994ds/34Mi)
% 0.74/0.93 % (30681)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.74/0.93 % (30682)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 (2994ds/83Mi)
% 0.74/0.93 % (30683)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 (2994ds/56Mi)
% 0.77/0.93 % (30679)Also succeeded, but the first one will report.
% 0.77/0.93 % (30676)First to succeed.
% 0.77/0.93 % (30678)Also succeeded, but the first one will report.
% 0.77/0.93 % (30681)Also succeeded, but the first one will report.
% 0.77/0.93 % (30683)Also succeeded, but the first one will report.
% 0.77/0.93 % (30676)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-30654"
% 0.77/0.93 % (30676)Refutation found. Thanks to Tanya!
% 0.77/0.93 % SZS status Theorem for theBenchmark
% 0.77/0.93 % SZS output start Proof for theBenchmark
% See solution above
% 0.77/0.93 % (30676)------------------------------
% 0.77/0.93 % (30676)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.77/0.93 % (30676)Termination reason: Refutation
% 0.77/0.93
% 0.77/0.93 % (30676)Memory used [KB]: 1168
% 0.77/0.93 % (30676)Time elapsed: 0.006 s
% 0.77/0.93 % (30676)Instructions burned: 8 (million)
% 0.77/0.93 % (30654)Success in time 0.565 s
% 0.77/0.93 % Vampire---4.8 exiting
%------------------------------------------------------------------------------