TSTP Solution File: SEU135+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU135+1 : TPTP v8.1.2. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n021.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 : Wed May 1 03:50:11 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% 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 : 620 ( 34 equ)
% Maximal formula atoms : 14 ( 10 avg)
% Number of connectives : 314 ( 120 ~; 135 |; 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(f136,plain,
$false,
inference(avatar_sat_refutation,[],[f113,f122,f129,f135]) ).
tff(f135,plain,
( spl5_3
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f134]) ).
tff(f134,plain,
( $false
| spl5_3
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f133,f111]) ).
tff(f111,plain,
( in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f110]) ).
tff(f110,plain,
( spl5_4
<=> in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
tff(f133,plain,
( ~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| spl5_3 ),
inference(subsumption_resolution,[],[f132,f123]) ).
tff(f123,plain,
~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK0),
inference(subsumption_resolution,[],[f116,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/sandbox/tmp/tmp.JN4NPTAHtu/Vampire---4.8_31513',d2_xboole_0) ).
tff(f116,plain,
( ~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK0)
| ~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0))) ),
inference(resolution,[],[f83,f72]) ).
tff(f72,plain,
~ sQ4_eqProxy($i,set_union2(sK0,sK1),set_union2(sK0,set_difference(sK1,sK0))),
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_union2(sK0,sK1) != set_union2(sK0,set_difference(sK1,sK0)),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
set_union2(sK0,sK1) != set_union2(sK0,set_difference(sK1,sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f26,f31]) ).
tff(f31,plain,
( ? [X0,X1] : ( set_union2(X0,X1) != set_union2(X0,set_difference(X1,X0)) )
=> ( set_union2(sK0,sK1) != set_union2(sK0,set_difference(sK1,sK0)) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
? [X0,X1] : ( set_union2(X0,X1) != set_union2(X0,set_difference(X1,X0)) ),
inference(ennf_transformation,[],[f19]) ).
tff(f19,negated_conjecture,
~ ! [X0,X1] : ( set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)) ),
inference(negated_conjecture,[],[f18]) ).
tff(f18,conjecture,
! [X0,X1] : ( set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)) ),
file('/export/starexec/sandbox/tmp/tmp.JN4NPTAHtu/Vampire---4.8_31513',t39_xboole_1) ).
tff(f83,plain,
! [X2: $i,X0: $i,X1: $i] :
( sQ4_eqProxy($i,set_union2(X0,X1),X2)
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) ),
inference(equality_proxy_replacement,[],[f60,f71]) ).
tff(f60,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( set_union2(X0,X1) = X2 )
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f42]) ).
tff(f132,plain,
( in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK0)
| ~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| spl5_3 ),
inference(resolution,[],[f131,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(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/sandbox/tmp/tmp.JN4NPTAHtu/Vampire---4.8_31513',d4_xboole_0) ).
tff(f131,plain,
( ~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_difference(sK1,sK0))
| spl5_3 ),
inference(resolution,[],[f108,f68]) ).
tff(f68,plain,
! [X0: $i,X1: $i,X4: $i] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f58]) ).
tff(f58,plain,
! [X2: $i,X0: $i,X1: $i,X4: $i] :
( in(X4,X2)
| ~ in(X4,X1)
| ( set_union2(X0,X1) != X2 ) ),
inference(cnf_transformation,[],[f42]) ).
tff(f108,plain,
( ~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0)))
| spl5_3 ),
inference(avatar_component_clause,[],[f106]) ).
tff(f106,plain,
( spl5_3
<=> in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
tff(f129,plain,
( ~ spl5_3
| spl5_4 ),
inference(avatar_contradiction_clause,[],[f128]) ).
tff(f128,plain,
( $false
| ~ spl5_3
| spl5_4 ),
inference(subsumption_resolution,[],[f126,f112]) ).
tff(f112,plain,
( ~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| spl5_4 ),
inference(avatar_component_clause,[],[f110]) ).
tff(f126,plain,
( in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| ~ spl5_3 ),
inference(resolution,[],[f125,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(f125,plain,
( in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_difference(sK1,sK0))
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f124,f123]) ).
tff(f124,plain,
( in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK0)
| in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_difference(sK1,sK0))
| ~ spl5_3 ),
inference(resolution,[],[f107,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(f107,plain,
( in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0)))
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f106]) ).
tff(f122,plain,
( spl5_3
| spl5_4 ),
inference(avatar_split_clause,[],[f121,f110,f106]) ).
tff(f121,plain,
( in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0))) ),
inference(subsumption_resolution,[],[f117,f69]) ).
tff(f117,plain,
( in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK0)
| in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0))) ),
inference(resolution,[],[f84,f72]) ).
tff(f84,plain,
! [X2: $i,X0: $i,X1: $i] :
( sQ4_eqProxy($i,set_union2(X0,X1),X2)
| in(sK3(X0,X1,X2),X1)
| in(sK3(X0,X1,X2),X0)
| in(sK3(X0,X1,X2),X2) ),
inference(equality_proxy_replacement,[],[f59,f71]) ).
tff(f59,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( set_union2(X0,X1) = X2 )
| in(sK3(X0,X1,X2),X1)
| in(sK3(X0,X1,X2),X0)
| in(sK3(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f42]) ).
tff(f113,plain,
( ~ spl5_3
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f104,f110,f106]) ).
tff(f104,plain,
( ~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| ~ in(sK3(sK0,sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0))) ),
inference(resolution,[],[f82,f72]) ).
tff(f82,plain,
! [X2: $i,X0: $i,X1: $i] :
( sQ4_eqProxy($i,set_union2(X0,X1),X2)
| ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X2) ),
inference(equality_proxy_replacement,[],[f61,f71]) ).
tff(f61,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( set_union2(X0,X1) = X2 )
| ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SEU135+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % 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.37 % Computer : n021.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 16:21:26 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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.JN4NPTAHtu/Vampire---4.8_31513
% 0.55/0.75 % (31770)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 (2996ds/83Mi)
% 0.55/0.75 % (31764)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 (2996ds/34Mi)
% 0.55/0.75 % (31767)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.55/0.75 % (31765)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 (2996ds/51Mi)
% 0.55/0.75 % (31766)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.75 % (31768)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 (2996ds/34Mi)
% 0.55/0.75 % (31769)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.75 % (31770)Refutation not found, incomplete strategy% (31770)------------------------------
% 0.55/0.75 % (31770)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75 % (31770)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75
% 0.55/0.75 % (31770)Memory used [KB]: 962
% 0.55/0.75 % (31770)Time elapsed: 0.002 s
% 0.55/0.75 % (31770)Instructions burned: 3 (million)
% 0.55/0.75 % (31770)------------------------------
% 0.55/0.75 % (31770)------------------------------
% 0.55/0.75 % (31769)Refutation not found, incomplete strategy% (31769)------------------------------
% 0.55/0.75 % (31769)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75 % (31769)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75
% 0.55/0.75 % (31769)Memory used [KB]: 1027
% 0.55/0.75 % (31769)Time elapsed: 0.003 s
% 0.55/0.75 % (31769)Instructions burned: 3 (million)
% 0.55/0.75 % (31769)------------------------------
% 0.55/0.75 % (31769)------------------------------
% 0.55/0.75 % (31767)Refutation not found, incomplete strategy% (31767)------------------------------
% 0.55/0.75 % (31767)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75 % (31767)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75
% 0.55/0.75 % (31767)Memory used [KB]: 973
% 0.55/0.75 % (31767)Time elapsed: 0.003 s
% 0.55/0.75 % (31767)Instructions burned: 3 (million)
% 0.55/0.75 % (31767)------------------------------
% 0.55/0.75 % (31767)------------------------------
% 0.55/0.75 % (31771)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 (2996ds/56Mi)
% 0.55/0.75 % (31764)First to succeed.
% 0.55/0.76 % (31768)Also succeeded, but the first one will report.
% 0.55/0.76 % (31764)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for Vampire---4
% 0.55/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.76 % (31764)------------------------------
% 0.55/0.76 % (31764)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (31764)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (31764)Memory used [KB]: 1062
% 0.55/0.76 % (31764)Time elapsed: 0.006 s
% 0.55/0.76 % (31764)Instructions burned: 7 (million)
% 0.55/0.76 % (31764)------------------------------
% 0.55/0.76 % (31764)------------------------------
% 0.55/0.76 % (31760)Success in time 0.374 s
% 0.55/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------