TSTP Solution File: SWV492+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV492+1 : TPTP v8.1.2. Released v4.0.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 : n005.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 : Sun May 5 10:35:00 EDT 2024
% Result : Theorem 0.58s 0.82s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 24
% Syntax : Number of formulae : 132 ( 4 unt; 0 def)
% Number of atoms : 536 ( 92 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 681 ( 277 ~; 270 |; 96 &)
% ( 16 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 15 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 143 ( 119 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1045,plain,
$false,
inference(avatar_sat_refutation,[],[f80,f89,f94,f99,f104,f275,f336,f342,f465,f695,f741,f910,f915,f1044]) ).
fof(f1044,plain,
( ~ spl6_10
| spl6_11
| ~ spl6_17 ),
inference(avatar_contradiction_clause,[],[f1043]) ).
fof(f1043,plain,
( $false
| ~ spl6_10
| spl6_11
| ~ spl6_17 ),
inference(subsumption_resolution,[],[f1037,f917]) ).
fof(f917,plain,
( ~ int_less(sK1,n)
| spl6_11 ),
inference(resolution,[],[f254,f61]) ).
fof(f61,plain,
! [X0,X1] :
( int_leq(X0,X1)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( X0 != X1
& ~ int_less(X0,X1) ) )
& ( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( X0 != X1
& ~ int_less(X0,X1) ) )
& ( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( X0 = X1
| int_less(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8DoVMU3mbH/Vampire---4.8_23499',int_leq) ).
fof(f254,plain,
( ~ int_leq(sK1,n)
| spl6_11 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f252,plain,
( spl6_11
<=> int_leq(sK1,n) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_11])]) ).
fof(f1037,plain,
( int_less(sK1,n)
| ~ spl6_10
| ~ spl6_17 ),
inference(superposition,[],[f249,f335]) ).
fof(f335,plain,
( n = sK2
| ~ spl6_17 ),
inference(avatar_component_clause,[],[f333]) ).
fof(f333,plain,
( spl6_17
<=> n = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_17])]) ).
fof(f249,plain,
( int_less(sK1,sK2)
| ~ spl6_10 ),
inference(avatar_component_clause,[],[f248]) ).
fof(f248,plain,
( spl6_10
<=> int_less(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_10])]) ).
fof(f915,plain,
( ~ spl6_11
| ~ spl6_12
| ~ spl6_3
| ~ spl6_10
| ~ spl6_13
| ~ spl6_14 ),
inference(avatar_split_clause,[],[f914,f264,f260,f248,f82,f256,f252]) ).
fof(f256,plain,
( spl6_12
<=> int_leq(int_one,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_12])]) ).
fof(f82,plain,
( spl6_3
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f260,plain,
( spl6_13
<=> int_leq(sK2,n) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_13])]) ).
fof(f264,plain,
( spl6_14
<=> int_leq(int_one,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_14])]) ).
fof(f914,plain,
( ~ int_leq(int_one,sK2)
| ~ int_leq(sK1,n)
| ~ spl6_3
| ~ spl6_10
| ~ spl6_13
| ~ spl6_14 ),
inference(subsumption_resolution,[],[f913,f249]) ).
fof(f913,plain,
( ~ int_leq(int_one,sK2)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK2)
| ~ spl6_3
| ~ spl6_13
| ~ spl6_14 ),
inference(subsumption_resolution,[],[f912,f261]) ).
fof(f261,plain,
( int_leq(sK2,n)
| ~ spl6_13 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f912,plain,
( ~ int_leq(sK2,n)
| ~ int_leq(int_one,sK2)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK2)
| ~ spl6_3
| ~ spl6_14 ),
inference(subsumption_resolution,[],[f911,f265]) ).
fof(f265,plain,
( int_leq(int_one,sK1)
| ~ spl6_14 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f911,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK2,n)
| ~ int_leq(int_one,sK2)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK2)
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f240,f84]) ).
fof(f84,plain,
( sP0
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f240,plain,
( ~ sP0
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK2,n)
| ~ int_leq(int_one,sK2)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK2) ),
inference(trivial_inequality_removal,[],[f226]) ).
fof(f226,plain,
( real_zero != real_zero
| ~ sP0
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK2,n)
| ~ int_leq(int_one,sK2)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK2) ),
inference(superposition,[],[f48,f162]) ).
fof(f162,plain,
! [X0,X1] :
( real_zero = a(X0,X1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f161,f73]) ).
fof(f73,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f62]) ).
fof(f62,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f40]) ).
fof(f161,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_less(X0,X1) ),
inference(duplicate_literal_removal,[],[f158]) ).
fof(f158,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_less(X0,X1)
| ~ int_less(X0,X1) ),
inference(superposition,[],[f115,f54]) ).
fof(f54,plain,
! [X0,X1] :
( plus(X0,sK5(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ( int_less(int_zero,sK5(X0,X1))
& plus(X0,sK5(X0,X1)) = X1 )
| ~ int_less(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f36,f37]) ).
fof(f37,plain,
! [X0,X1] :
( ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 )
=> ( int_less(int_zero,sK5(X0,X1))
& plus(X0,sK5(X0,X1)) = X1 ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 )
| ~ int_less(X0,X1) ) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 )
| ~ int_less(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( int_less(X0,X1)
<=> ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.8DoVMU3mbH/Vampire---4.8_23499',plus_and_inverse) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ int_leq(plus(X2,sK5(X0,X1)),n)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,plus(X2,sK5(X0,X1)))
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f110,f55]) ).
fof(f55,plain,
! [X0,X1] :
( int_less(int_zero,sK5(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f110,plain,
! [X2,X0,X1] :
( real_zero = a(X0,X1)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| ~ int_less(int_zero,sK5(X0,X1))
| ~ int_leq(plus(X2,sK5(X0,X1)),n)
| ~ int_leq(int_one,plus(X2,sK5(X0,X1)))
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_less(X0,X1) ),
inference(superposition,[],[f69,f54]) ).
fof(f69,plain,
! [X2,X3,X0] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3)
| ~ int_less(int_zero,X2)
| ~ int_leq(plus(X0,X2),n)
| ~ int_leq(int_one,plus(X0,X2))
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(equality_resolution,[],[f44]) ).
fof(f44,plain,
! [X2,X3,X0,X1] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3)
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) )
& ! [X5] :
( ! [X6] :
( a(plus(X6,X5),X6) = qr(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6) )
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) )
& ! [X5] :
( ! [X6] :
( a(plus(X6,X5),X6) = qr(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6) )
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X2] :
( ( plus(X0,X2) = X1
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X0)
& int_leq(int_one,X3) )
=> real_zero = a(X3,plus(X3,X2)) ) )
& ! [X4] :
( ( int_leq(X4,X1)
& int_leq(int_one,X4) )
=> real_one = a(X4,X4) )
& ! [X5] :
( ( plus(X1,X5) = X0
& int_less(int_zero,X5) )
=> ! [X6] :
( ( int_leq(X6,X1)
& int_leq(int_one,X6) )
=> a(plus(X6,X5),X6) = qr(plus(X6,X5),X6) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X7] :
( ( plus(X0,X7) = X1
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X0)
& int_leq(int_one,X2) )
=> real_zero = a(X2,plus(X2,X7)) ) )
& ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> real_one = a(X2,X2) )
& ! [X7] :
( ( plus(X1,X7) = X0
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> a(plus(X2,X7),X2) = qr(plus(X2,X7),X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8DoVMU3mbH/Vampire---4.8_23499',qih) ).
fof(f48,plain,
( real_zero != a(sK1,sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
( ( real_zero != a(sK1,sK2)
& int_leq(sK2,n)
& int_less(sK1,sK2)
& int_leq(int_one,sK1) )
| ~ sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f30,f31]) ).
fof(f31,plain,
( ? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0) )
=> ( real_zero != a(sK1,sK2)
& int_leq(sK2,n)
& int_less(sK1,sK2)
& int_leq(int_one,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
( ? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0) )
| ~ sP0 ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
( ? [X2,X3] :
( real_zero != a(X2,X3)
& int_leq(X3,n)
& int_less(X2,X3)
& int_leq(int_one,X2) )
| ~ sP0 ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
( ? [X2,X3] :
( real_zero != a(X2,X3)
& int_leq(X3,n)
& int_less(X2,X3)
& int_leq(int_one,X2) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f910,plain,
( ~ spl6_3
| spl6_12
| ~ spl6_14 ),
inference(avatar_contradiction_clause,[],[f909]) ).
fof(f909,plain,
( $false
| ~ spl6_3
| spl6_12
| ~ spl6_14 ),
inference(subsumption_resolution,[],[f908,f84]) ).
fof(f908,plain,
( ~ sP0
| spl6_12
| ~ spl6_14 ),
inference(subsumption_resolution,[],[f900,f265]) ).
fof(f900,plain,
( ~ int_leq(int_one,sK1)
| ~ sP0
| spl6_12 ),
inference(resolution,[],[f863,f46]) ).
fof(f46,plain,
( int_less(sK1,sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f32]) ).
fof(f863,plain,
( ! [X0] :
( ~ int_less(X0,sK2)
| ~ int_leq(int_one,X0) )
| spl6_12 ),
inference(resolution,[],[f827,f64]) ).
fof(f64,plain,
! [X0] :
( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0] :
( ( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) )
& ( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] :
( int_less(int_zero,X0)
<=> int_leq(int_one,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.8DoVMU3mbH/Vampire---4.8_23499',one_successor_of_zero) ).
fof(f827,plain,
( ! [X0] :
( ~ int_less(int_zero,X0)
| ~ int_less(X0,sK2) )
| spl6_12 ),
inference(resolution,[],[f547,f68]) ).
fof(f68,plain,
! [X2,X0,X1] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( int_less(X1,X2)
& int_less(X0,X1) )
=> int_less(X0,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.8DoVMU3mbH/Vampire---4.8_23499',int_less_transitive) ).
fof(f547,plain,
( ~ int_less(int_zero,sK2)
| spl6_12 ),
inference(resolution,[],[f258,f63]) ).
fof(f63,plain,
! [X0] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f258,plain,
( ~ int_leq(int_one,sK2)
| spl6_12 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f741,plain,
( ~ spl6_1
| ~ spl6_5
| ~ spl6_6
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f740]) ).
fof(f740,plain,
( $false
| ~ spl6_1
| ~ spl6_5
| ~ spl6_6
| ~ spl6_7 ),
inference(subsumption_resolution,[],[f733,f681]) ).
fof(f681,plain,
( int_leq(sK3,n)
| ~ spl6_5
| ~ spl6_6 ),
inference(superposition,[],[f98,f93]) ).
fof(f93,plain,
( sK3 = sK4
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f91,plain,
( spl6_5
<=> sK3 = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f98,plain,
( int_leq(sK4,n)
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f96,plain,
( spl6_6
<=> int_leq(sK4,n) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f733,plain,
( ~ int_leq(sK3,n)
| ~ spl6_1
| ~ spl6_7 ),
inference(resolution,[],[f76,f103]) ).
fof(f103,plain,
( int_leq(int_one,sK3)
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f101,plain,
( spl6_7
<=> int_leq(int_one,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
fof(f76,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,n) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f75,plain,
( spl6_1
<=> ! [X0] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f695,plain,
( ~ spl6_2
| ~ spl6_4
| ~ spl6_5
| ~ spl6_6
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f682]) ).
fof(f682,plain,
( $false
| ~ spl6_2
| ~ spl6_4
| ~ spl6_5
| ~ spl6_6
| ~ spl6_7 ),
inference(unit_resulting_resolution,[],[f73,f103,f681,f103,f680,f106]) ).
fof(f106,plain,
( ! [X0,X1] :
( real_zero != a(X0,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,X1) )
| ~ spl6_2 ),
inference(superposition,[],[f53,f79]) ).
fof(f79,plain,
( ! [X1,X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f78,plain,
( spl6_2
<=> ! [X4,X1] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f53,plain,
real_zero != real_one,
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
real_zero != real_one,
file('/export/starexec/sandbox2/tmp/tmp.8DoVMU3mbH/Vampire---4.8_23499',real_constants) ).
fof(f680,plain,
( real_zero = a(sK3,sK3)
| ~ spl6_4
| ~ spl6_5 ),
inference(forward_demodulation,[],[f88,f93]) ).
fof(f88,plain,
( real_zero = a(sK3,sK4)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f86,plain,
( spl6_4
<=> real_zero = a(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f465,plain,
( ~ spl6_3
| spl6_14 ),
inference(avatar_contradiction_clause,[],[f464]) ).
fof(f464,plain,
( $false
| ~ spl6_3
| spl6_14 ),
inference(subsumption_resolution,[],[f460,f84]) ).
fof(f460,plain,
( ~ sP0
| spl6_14 ),
inference(resolution,[],[f266,f45]) ).
fof(f45,plain,
( int_leq(int_one,sK1)
| ~ sP0 ),
inference(cnf_transformation,[],[f32]) ).
fof(f266,plain,
( ~ int_leq(int_one,sK1)
| spl6_14 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f342,plain,
( ~ spl6_3
| spl6_13 ),
inference(avatar_contradiction_clause,[],[f341]) ).
fof(f341,plain,
( $false
| ~ spl6_3
| spl6_13 ),
inference(subsumption_resolution,[],[f338,f84]) ).
fof(f338,plain,
( ~ sP0
| spl6_13 ),
inference(resolution,[],[f262,f47]) ).
fof(f47,plain,
( int_leq(sK2,n)
| ~ sP0 ),
inference(cnf_transformation,[],[f32]) ).
fof(f262,plain,
( ~ int_leq(sK2,n)
| spl6_13 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f336,plain,
( ~ spl6_13
| spl6_17
| ~ spl6_10
| spl6_11 ),
inference(avatar_split_clause,[],[f331,f252,f248,f333,f260]) ).
fof(f331,plain,
( n = sK2
| ~ int_leq(sK2,n)
| ~ spl6_10
| spl6_11 ),
inference(resolution,[],[f315,f60]) ).
fof(f60,plain,
! [X0,X1] :
( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f315,plain,
( ~ int_less(sK2,n)
| ~ spl6_10
| spl6_11 ),
inference(resolution,[],[f299,f249]) ).
fof(f299,plain,
( ! [X0] :
( ~ int_less(sK1,X0)
| ~ int_less(X0,n) )
| spl6_11 ),
inference(resolution,[],[f293,f68]) ).
fof(f293,plain,
( ~ int_less(sK1,n)
| spl6_11 ),
inference(resolution,[],[f254,f61]) ).
fof(f275,plain,
( ~ spl6_3
| spl6_10 ),
inference(avatar_contradiction_clause,[],[f274]) ).
fof(f274,plain,
( $false
| ~ spl6_3
| spl6_10 ),
inference(subsumption_resolution,[],[f269,f84]) ).
fof(f269,plain,
( ~ sP0
| spl6_10 ),
inference(resolution,[],[f250,f46]) ).
fof(f250,plain,
( ~ int_less(sK1,sK2)
| spl6_10 ),
inference(avatar_component_clause,[],[f248]) ).
fof(f104,plain,
( spl6_3
| spl6_7 ),
inference(avatar_split_clause,[],[f49,f101,f82]) ).
fof(f49,plain,
( int_leq(int_one,sK3)
| sP0 ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
( ( real_zero = a(sK3,sK4)
& sK3 = sK4
& int_leq(sK4,n)
& int_leq(int_one,sK3) )
| sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f28,f33]) ).
fof(f33,plain,
( ? [X0,X1] :
( real_zero = a(X0,X1)
& X0 = X1
& int_leq(X1,n)
& int_leq(int_one,X0) )
=> ( real_zero = a(sK3,sK4)
& sK3 = sK4
& int_leq(sK4,n)
& int_leq(int_one,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
( ? [X0,X1] :
( real_zero = a(X0,X1)
& X0 = X1
& int_leq(X1,n)
& int_leq(int_one,X0) )
| sP0 ),
inference(definition_folding,[],[f21,f27]) ).
fof(f21,plain,
( ? [X0,X1] :
( real_zero = a(X0,X1)
& X0 = X1
& int_leq(X1,n)
& int_leq(int_one,X0) )
| ? [X2,X3] :
( real_zero != a(X2,X3)
& int_leq(X3,n)
& int_less(X2,X3)
& int_leq(int_one,X2) ) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
( ? [X0,X1] :
( real_zero = a(X0,X1)
& X0 = X1
& int_leq(X1,n)
& int_leq(int_one,X0) )
| ? [X2,X3] :
( real_zero != a(X2,X3)
& int_leq(X3,n)
& int_less(X2,X3)
& int_leq(int_one,X2) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ( ! [X0,X1] :
( ( X0 = X1
& int_leq(X1,n)
& int_leq(int_one,X0) )
=> real_zero != a(X0,X1) )
& ! [X2,X3] :
( ( int_leq(X3,n)
& int_less(X2,X3)
& int_leq(int_one,X2) )
=> real_zero = a(X2,X3) ) ),
inference(rectify,[],[f14]) ).
fof(f14,negated_conjecture,
~ ( ! [X0,X1] :
( ( X0 = X1
& int_leq(X1,n)
& int_leq(int_one,X0) )
=> real_zero != a(X0,X1) )
& ! [X0,X1] :
( ( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0) )
=> real_zero = a(X0,X1) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
( ! [X0,X1] :
( ( X0 = X1
& int_leq(X1,n)
& int_leq(int_one,X0) )
=> real_zero != a(X0,X1) )
& ! [X0,X1] :
( ( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0) )
=> real_zero = a(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8DoVMU3mbH/Vampire---4.8_23499',lti) ).
fof(f99,plain,
( spl6_3
| spl6_6 ),
inference(avatar_split_clause,[],[f50,f96,f82]) ).
fof(f50,plain,
( int_leq(sK4,n)
| sP0 ),
inference(cnf_transformation,[],[f34]) ).
fof(f94,plain,
( spl6_3
| spl6_5 ),
inference(avatar_split_clause,[],[f51,f91,f82]) ).
fof(f51,plain,
( sK3 = sK4
| sP0 ),
inference(cnf_transformation,[],[f34]) ).
fof(f89,plain,
( spl6_3
| spl6_4 ),
inference(avatar_split_clause,[],[f52,f86,f82]) ).
fof(f52,plain,
( real_zero = a(sK3,sK4)
| sP0 ),
inference(cnf_transformation,[],[f34]) ).
fof(f80,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f43,f78,f75]) ).
fof(f43,plain,
! [X0,X1,X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.15 % Problem : SWV492+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.17 % 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.15/0.38 % Computer : n005.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Fri May 3 21:17:08 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.15/0.38 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.38 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/tmp/tmp.8DoVMU3mbH/Vampire---4.8_23499
% 0.55/0.76 % (23610)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.76 % (23612)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.76 % (23616)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.76 % (23614)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.76 % (23613)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.76 % (23611)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.76 % (23617)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.76 % (23618)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.76 % (23614)Refutation not found, incomplete strategy% (23614)------------------------------
% 0.55/0.76 % (23614)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (23614)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76
% 0.55/0.76 % (23614)Memory used [KB]: 1050
% 0.55/0.76 % (23614)Time elapsed: 0.003 s
% 0.55/0.76 % (23614)Instructions burned: 4 (million)
% 0.55/0.76 % (23614)------------------------------
% 0.55/0.76 % (23614)------------------------------
% 0.55/0.76 % (23618)Refutation not found, incomplete strategy% (23618)------------------------------
% 0.55/0.76 % (23618)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (23618)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76
% 0.55/0.76 % (23618)Memory used [KB]: 1047
% 0.55/0.76 % (23618)Time elapsed: 0.004 s
% 0.55/0.76 % (23618)Instructions burned: 3 (million)
% 0.55/0.76 % (23618)------------------------------
% 0.55/0.76 % (23618)------------------------------
% 0.58/0.76 % (23619)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.58/0.77 % (23620)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.58/0.77 % (23610)Instruction limit reached!
% 0.58/0.77 % (23610)------------------------------
% 0.58/0.77 % (23610)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.77 % (23610)Termination reason: Unknown
% 0.58/0.77 % (23610)Termination phase: Saturation
% 0.58/0.77
% 0.58/0.77 % (23610)Memory used [KB]: 1204
% 0.58/0.77 % (23610)Time elapsed: 0.012 s
% 0.58/0.77 % (23610)Instructions burned: 36 (million)
% 0.58/0.77 % (23610)------------------------------
% 0.58/0.77 % (23610)------------------------------
% 0.58/0.77 % (23621)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.58/0.77 % (23613)Instruction limit reached!
% 0.58/0.77 % (23613)------------------------------
% 0.58/0.77 % (23613)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.78 % (23613)Termination reason: Unknown
% 0.58/0.78 % (23613)Termination phase: Saturation
% 0.58/0.78
% 0.58/0.78 % (23613)Memory used [KB]: 1480
% 0.58/0.78 % (23613)Time elapsed: 0.019 s
% 0.58/0.78 % (23613)Instructions burned: 33 (million)
% 0.58/0.78 % (23613)------------------------------
% 0.58/0.78 % (23613)------------------------------
% 0.58/0.78 % (23616)Instruction limit reached!
% 0.58/0.78 % (23616)------------------------------
% 0.58/0.78 % (23616)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.78 % (23616)Termination reason: Unknown
% 0.58/0.78 % (23616)Termination phase: Saturation
% 0.58/0.78
% 0.58/0.78 % (23616)Memory used [KB]: 1296
% 0.58/0.78 % (23616)Time elapsed: 0.021 s
% 0.58/0.78 % (23616)Instructions burned: 46 (million)
% 0.58/0.78 % (23616)------------------------------
% 0.58/0.78 % (23616)------------------------------
% 0.58/0.78 % (23623)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on Vampire---4 for (2996ds/518Mi)
% 0.58/0.78 % (23622)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2996ds/52Mi)
% 0.58/0.79 % (23611)Instruction limit reached!
% 0.58/0.79 % (23611)------------------------------
% 0.58/0.79 % (23611)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.79 % (23611)Termination reason: Unknown
% 0.58/0.79 % (23611)Termination phase: Saturation
% 0.58/0.79
% 0.58/0.79 % (23611)Memory used [KB]: 1414
% 0.58/0.79 % (23611)Time elapsed: 0.030 s
% 0.58/0.79 % (23611)Instructions burned: 52 (million)
% 0.58/0.79 % (23611)------------------------------
% 0.58/0.79 % (23611)------------------------------
% 0.58/0.79 % (23624)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on Vampire---4 for (2996ds/42Mi)
% 0.58/0.79 % (23620)Instruction limit reached!
% 0.58/0.79 % (23620)------------------------------
% 0.58/0.79 % (23620)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.79 % (23620)Termination reason: Unknown
% 0.58/0.79 % (23620)Termination phase: Saturation
% 0.58/0.79
% 0.58/0.79 % (23620)Memory used [KB]: 1323
% 0.58/0.79 % (23620)Time elapsed: 0.026 s
% 0.58/0.79 % (23620)Instructions burned: 51 (million)
% 0.58/0.79 % (23620)------------------------------
% 0.58/0.79 % (23620)------------------------------
% 0.58/0.79 % (23619)Instruction limit reached!
% 0.58/0.79 % (23619)------------------------------
% 0.58/0.79 % (23619)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.79 % (23619)Termination reason: Unknown
% 0.58/0.79 % (23619)Termination phase: Saturation
% 0.58/0.79
% 0.58/0.79 % (23619)Memory used [KB]: 1726
% 0.58/0.79 % (23619)Time elapsed: 0.032 s
% 0.58/0.79 % (23619)Instructions burned: 56 (million)
% 0.58/0.79 % (23619)------------------------------
% 0.58/0.79 % (23619)------------------------------
% 0.58/0.80 % (23626)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on Vampire---4 for (2995ds/117Mi)
% 0.58/0.80 % (23612)Instruction limit reached!
% 0.58/0.80 % (23612)------------------------------
% 0.58/0.80 % (23612)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.80 % (23612)Termination reason: Unknown
% 0.58/0.80 % (23612)Termination phase: Saturation
% 0.58/0.80
% 0.58/0.80 % (23612)Memory used [KB]: 1551
% 0.58/0.80 % (23612)Time elapsed: 0.042 s
% 0.58/0.80 % (23612)Instructions burned: 78 (million)
% 0.58/0.80 % (23612)------------------------------
% 0.58/0.80 % (23612)------------------------------
% 0.58/0.80 % (23617)Instruction limit reached!
% 0.58/0.80 % (23617)------------------------------
% 0.58/0.80 % (23617)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.80 % (23617)Termination reason: Unknown
% 0.58/0.80 % (23617)Termination phase: Saturation
% 0.58/0.80
% 0.58/0.80 % (23617)Memory used [KB]: 1870
% 0.58/0.80 % (23617)Time elapsed: 0.042 s
% 0.58/0.80 % (23617)Instructions burned: 84 (million)
% 0.58/0.80 % (23617)------------------------------
% 0.58/0.80 % (23617)------------------------------
% 0.58/0.80 % (23627)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on Vampire---4 for (2995ds/143Mi)
% 0.58/0.80 % (23628)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on Vampire---4 for (2995ds/93Mi)
% 0.58/0.80 % (23625)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on Vampire---4 for (2995ds/243Mi)
% 0.58/0.81 % (23622)Instruction limit reached!
% 0.58/0.81 % (23622)------------------------------
% 0.58/0.81 % (23622)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.81 % (23622)Termination reason: Unknown
% 0.58/0.81 % (23622)Termination phase: Saturation
% 0.58/0.81
% 0.58/0.81 % (23622)Memory used [KB]: 1271
% 0.58/0.81 % (23622)Time elapsed: 0.027 s
% 0.58/0.81 % (23622)Instructions burned: 53 (million)
% 0.58/0.81 % (23622)------------------------------
% 0.58/0.81 % (23622)------------------------------
% 0.58/0.81 % (23629)lrs+1666_1:1_sil=4000:sp=occurrence:sos=on:urr=on:newcnf=on:i=62:amm=off:ep=R:erd=off:nm=0:plsq=on:plsqr=14,1_0 on Vampire---4 for (2995ds/62Mi)
% 0.58/0.81 % (23624)Instruction limit reached!
% 0.58/0.81 % (23624)------------------------------
% 0.58/0.81 % (23624)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.81 % (23624)Termination reason: Unknown
% 0.58/0.81 % (23624)Termination phase: Saturation
% 0.58/0.81
% 0.58/0.81 % (23624)Memory used [KB]: 1770
% 0.58/0.81 % (23624)Time elapsed: 0.025 s
% 0.58/0.81 % (23624)Instructions burned: 43 (million)
% 0.58/0.81 % (23624)------------------------------
% 0.58/0.81 % (23624)------------------------------
% 0.58/0.82 % (23623)First to succeed.
% 0.58/0.82 % (23630)lrs+21_2461:262144_anc=none:drc=off:sil=2000:sp=occurrence:nwc=6.0:updr=off:st=3.0:i=32:sd=2:afp=4000:erml=3:nm=14:afq=2.0:uhcvi=on:ss=included:er=filter:abs=on:nicw=on:ile=on:sims=off:s2a=on:s2agt=50:s2at=-1.0:plsq=on:plsql=on:plsqc=2:plsqr=1,32:newcnf=on:bd=off:to=lpo_0 on Vampire---4 for (2995ds/32Mi)
% 0.58/0.82 % (23623)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-23609"
% 0.58/0.82 % (23623)Refutation found. Thanks to Tanya!
% 0.58/0.82 % SZS status Theorem for Vampire---4
% 0.58/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.82 % (23623)------------------------------
% 0.58/0.82 % (23623)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.82 % (23623)Termination reason: Refutation
% 0.58/0.82
% 0.58/0.82 % (23623)Memory used [KB]: 1407
% 0.58/0.82 % (23623)Time elapsed: 0.044 s
% 0.58/0.82 % (23623)Instructions burned: 96 (million)
% 0.58/0.82 % (23609)Success in time 0.431 s
% 0.58/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------