TSTP Solution File: SEU136+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU136+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 : n008.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:44:57 EDT 2024
% Result : Theorem 0.53s 0.73s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 61 ( 8 unt; 1 typ; 0 def)
% Number of atoms : 621 ( 34 equ)
% Maximal formula atoms : 14 ( 10 avg)
% Number of connectives : 316 ( 121 ~; 136 |; 49 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 366 ( 366 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 119 ( 106 !; 12 ?; 57 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_4,type,
sQ4_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f131,plain,
$false,
inference(avatar_sat_refutation,[],[f115,f118,f124,f130]) ).
tff(f130,plain,
( spl5_3
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f129]) ).
tff(f129,plain,
( $false
| spl5_3
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f127,f114]) ).
tff(f114,plain,
( in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK0)
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f112]) ).
tff(f112,plain,
( spl5_4
<=> in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
tff(f127,plain,
( ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK0)
| spl5_3 ),
inference(resolution,[],[f126,f69]) ).
tff(f69,plain,
! [X0: $i,X1: $i,X4: $i] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f57]) ).
tff(f57,plain,
! [X2: $i,X0: $i,X1: $i,X4: $i] :
( in(X4,X2)
| ~ in(X4,X0)
| ( set_union2(X0,X1) != X2 ) ),
inference(cnf_transformation,[],[f42]) ).
tff(f42,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])],[f40,f41]) ).
tff(f41,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,[]) ).
tff(f40,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,[],[f39]) ).
tff(f39,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,[],[f38]) ).
tff(f38,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,[],[f4]) ).
tff(f4,axiom,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2 )
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
tff(f126,plain,
( ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_union2(sK0,sK1))
| spl5_3 ),
inference(subsumption_resolution,[],[f125,f105]) ).
tff(f105,plain,
~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK1),
inference(subsumption_resolution,[],[f104,f66]) ).
tff(f66,plain,
! [X0: $i,X1: $i,X4: $i] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f51]) ).
tff(f51,plain,
! [X2: $i,X0: $i,X1: $i,X4: $i] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| ( set_difference(X0,X1) != X2 ) ),
inference(cnf_transformation,[],[f37]) ).
tff(f37,plain,
! [X0,X1,X2] :
( ( ( set_difference(X0,X1) = X2 )
| ( ( in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( ~ in(sK2(X0,X1,X2),X1)
& in(sK2(X0,X1,X2),X0) )
| in(sK2(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0) )
& ( ( ~ in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| ( set_difference(X0,X1) != X2 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f35,f36]) ).
tff(f36,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( ~ in(sK2(X0,X1,X2),X1)
& in(sK2(X0,X1,X2),X0) )
| in(sK2(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
tff(f35,plain,
! [X0,X1,X2] :
( ( ( set_difference(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_difference(X0,X1) != X2 ) ) ),
inference(rectify,[],[f34]) ).
tff(f34,plain,
! [X0,X1,X2] :
( ( ( set_difference(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_difference(X0,X1) != X2 ) ) ),
inference(flattening,[],[f33]) ).
tff(f33,plain,
! [X0,X1,X2] :
( ( ( set_difference(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_difference(X0,X1) != X2 ) ) ),
inference(nnf_transformation,[],[f6]) ).
tff(f6,axiom,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2 )
<=> ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
tff(f104,plain,
( ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK1)
| in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_difference(set_union2(sK0,sK1),sK1)) ),
inference(resolution,[],[f80,f72]) ).
tff(f72,plain,
~ sQ4_eqProxy($i,set_difference(sK0,sK1),set_difference(set_union2(sK0,sK1),sK1)),
inference(equality_proxy_replacement,[],[f43,f71]) ).
tff(f71,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ4_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).
tff(f43,plain,
set_difference(sK0,sK1) != set_difference(set_union2(sK0,sK1),sK1),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
set_difference(sK0,sK1) != set_difference(set_union2(sK0,sK1),sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f26,f31]) ).
tff(f31,plain,
( ? [X0,X1] : ( set_difference(X0,X1) != set_difference(set_union2(X0,X1),X1) )
=> ( set_difference(sK0,sK1) != set_difference(set_union2(sK0,sK1),sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
? [X0,X1] : ( set_difference(X0,X1) != set_difference(set_union2(X0,X1),X1) ),
inference(ennf_transformation,[],[f20]) ).
tff(f20,negated_conjecture,
~ ! [X0,X1] : ( set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1) ),
inference(negated_conjecture,[],[f19]) ).
tff(f19,conjecture,
! [X0,X1] : ( set_difference(X0,X1) = set_difference(set_union2(X0,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_xboole_1) ).
tff(f80,plain,
! [X2: $i,X0: $i,X1: $i] :
( sQ4_eqProxy($i,set_difference(X0,X1),X2)
| ~ in(sK2(X0,X1,X2),X1)
| in(sK2(X0,X1,X2),X2) ),
inference(equality_proxy_replacement,[],[f54,f71]) ).
tff(f54,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( set_difference(X0,X1) = X2 )
| ~ in(sK2(X0,X1,X2),X1)
| in(sK2(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f37]) ).
tff(f125,plain,
( in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK1)
| ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_union2(sK0,sK1))
| spl5_3 ),
inference(resolution,[],[f109,f65]) ).
tff(f65,plain,
! [X0: $i,X1: $i,X4: $i] :
( in(X4,set_difference(X0,X1))
| in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f52]) ).
tff(f52,plain,
! [X2: $i,X0: $i,X1: $i,X4: $i] :
( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0)
| ( set_difference(X0,X1) != X2 ) ),
inference(cnf_transformation,[],[f37]) ).
tff(f109,plain,
( ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_difference(set_union2(sK0,sK1),sK1))
| spl5_3 ),
inference(avatar_component_clause,[],[f108]) ).
tff(f108,plain,
( spl5_3
<=> in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_difference(set_union2(sK0,sK1),sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
tff(f124,plain,
( ~ spl5_3
| spl5_4 ),
inference(avatar_contradiction_clause,[],[f123]) ).
tff(f123,plain,
( $false
| ~ spl5_3
| spl5_4 ),
inference(subsumption_resolution,[],[f122,f105]) ).
tff(f122,plain,
( in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK1)
| ~ spl5_3
| spl5_4 ),
inference(subsumption_resolution,[],[f121,f113]) ).
tff(f113,plain,
( ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK0)
| spl5_4 ),
inference(avatar_component_clause,[],[f112]) ).
tff(f121,plain,
( in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK0)
| in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK1)
| ~ spl5_3 ),
inference(resolution,[],[f119,f70]) ).
tff(f70,plain,
! [X0: $i,X1: $i,X4: $i] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f56]) ).
tff(f56,plain,
! [X2: $i,X0: $i,X1: $i,X4: $i] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2)
| ( set_union2(X0,X1) != X2 ) ),
inference(cnf_transformation,[],[f42]) ).
tff(f119,plain,
( in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_union2(sK0,sK1))
| ~ spl5_3 ),
inference(resolution,[],[f110,f67]) ).
tff(f67,plain,
! [X0: $i,X1: $i,X4: $i] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f50]) ).
tff(f50,plain,
! [X2: $i,X0: $i,X1: $i,X4: $i] :
( in(X4,X0)
| ~ in(X4,X2)
| ( set_difference(X0,X1) != X2 ) ),
inference(cnf_transformation,[],[f37]) ).
tff(f110,plain,
( in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_difference(set_union2(sK0,sK1),sK1))
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f108]) ).
tff(f118,plain,
( ~ spl5_3
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f117,f112,f108]) ).
tff(f117,plain,
( ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK0)
| ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_difference(set_union2(sK0,sK1),sK1)) ),
inference(subsumption_resolution,[],[f116,f105]) ).
tff(f116,plain,
( in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK1)
| ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK0)
| ~ in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_difference(set_union2(sK0,sK1),sK1)) ),
inference(resolution,[],[f79,f72]) ).
tff(f79,plain,
! [X2: $i,X0: $i,X1: $i] :
( sQ4_eqProxy($i,set_difference(X0,X1),X2)
| in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X2) ),
inference(equality_proxy_replacement,[],[f55,f71]) ).
tff(f55,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( set_difference(X0,X1) = X2 )
| in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f37]) ).
tff(f115,plain,
( spl5_3
| spl5_4 ),
inference(avatar_split_clause,[],[f106,f112,f108]) ).
tff(f106,plain,
( in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),sK0)
| in(sK2(sK0,sK1,set_difference(set_union2(sK0,sK1),sK1)),set_difference(set_union2(sK0,sK1),sK1)) ),
inference(resolution,[],[f81,f72]) ).
tff(f81,plain,
! [X2: $i,X0: $i,X1: $i] :
( sQ4_eqProxy($i,set_difference(X0,X1),X2)
| in(sK2(X0,X1,X2),X0)
| in(sK2(X0,X1,X2),X2) ),
inference(equality_proxy_replacement,[],[f53,f71]) ).
tff(f53,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( set_difference(X0,X1) = X2 )
| in(sK2(X0,X1,X2),X0)
| in(sK2(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU136+1 : TPTP v8.2.0. Released v3.3.0.
% 0.06/0.13 % 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.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 17:31:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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.53/0.72 % (10518)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.53/0.72 % (10513)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.53/0.72 % (10516)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.53/0.72 % (10515)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.53/0.72 % (10517)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.53/0.72 % (10512)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.53/0.72 % (10518)Refutation not found, incomplete strategy% (10518)------------------------------
% 0.53/0.72 % (10518)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.72 % (10518)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.72
% 0.53/0.72 % (10518)Memory used [KB]: 962
% 0.53/0.72 % (10518)Time elapsed: 0.002 s
% 0.53/0.72 % (10518)Instructions burned: 3 (million)
% 0.53/0.72 % (10518)------------------------------
% 0.53/0.72 % (10518)------------------------------
% 0.53/0.73 % (10517)Refutation not found, incomplete strategy% (10517)------------------------------
% 0.53/0.73 % (10517)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.73 % (10514)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.73 % (10517)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.73
% 0.53/0.73 % (10517)Memory used [KB]: 1027
% 0.53/0.73 % (10517)Time elapsed: 0.003 s
% 0.53/0.73 % (10517)Instructions burned: 3 (million)
% 0.53/0.73 % (10515)Refutation not found, incomplete strategy% (10515)------------------------------
% 0.53/0.73 % (10515)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.73 % (10515)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.73
% 0.53/0.73 % (10515)Memory used [KB]: 982
% 0.53/0.73 % (10515)Time elapsed: 0.003 s
% 0.53/0.73 % (10515)Instructions burned: 3 (million)
% 0.53/0.73 % (10517)------------------------------
% 0.53/0.73 % (10517)------------------------------
% 0.53/0.73 % (10515)------------------------------
% 0.53/0.73 % (10515)------------------------------
% 0.53/0.73 % (10519)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.53/0.73 % (10512)First to succeed.
% 0.53/0.73 % (10516)Also succeeded, but the first one will report.
% 0.53/0.73 % (10512)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-10511"
% 0.53/0.73 % (10519)Also succeeded, but the first one will report.
% 0.53/0.73 % (10512)Refutation found. Thanks to Tanya!
% 0.53/0.73 % SZS status Theorem for theBenchmark
% 0.53/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.73 % (10512)------------------------------
% 0.53/0.73 % (10512)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.73 % (10512)Termination reason: Refutation
% 0.53/0.73
% 0.53/0.73 % (10512)Memory used [KB]: 1062
% 0.53/0.73 % (10512)Time elapsed: 0.006 s
% 0.53/0.73 % (10512)Instructions burned: 7 (million)
% 0.53/0.73 % (10511)Success in time 0.374 s
% 0.53/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------