TSTP Solution File: SWV487+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV487+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n010.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 Aug 31 18:50:11 EDT 2022
% Result : Theorem 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 80 ( 13 unt; 0 def)
% Number of atoms : 312 ( 60 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 393 ( 161 ~; 150 |; 58 &)
% ( 8 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 121 ( 108 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f258,plain,
$false,
inference(avatar_sat_refutation,[],[f88,f205,f252,f255]) ).
fof(f255,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f254]) ).
fof(f254,plain,
( $false
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f253,f234]) ).
fof(f234,plain,
( int_leq(sK1,n)
| ~ spl3_4 ),
inference(resolution,[],[f230,f57]) ).
fof(f57,plain,
! [X0,X1] :
( ~ int_less(X1,X0)
| int_leq(X1,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( ( X0 = X1
| int_less(X1,X0)
| ~ int_leq(X1,X0) )
& ( int_leq(X1,X0)
| ( X0 != X1
& ~ int_less(X1,X0) ) ) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
! [X0,X1] :
( ( X0 = X1
| int_less(X1,X0)
| ~ int_leq(X1,X0) )
& ( int_leq(X1,X0)
| ( X0 != X1
& ~ int_less(X1,X0) ) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( X0 = X1
| int_less(X1,X0) )
<=> int_leq(X1,X0) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( ( X0 = X1
| int_less(X0,X1) )
<=> int_leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq) ).
fof(f230,plain,
( int_less(sK1,n)
| ~ spl3_4 ),
inference(resolution,[],[f90,f87]) ).
fof(f87,plain,
( int_less(sK2,n)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f85,plain,
( spl3_4
<=> int_less(sK2,n) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f90,plain,
! [X0] :
( ~ int_less(sK2,X0)
| int_less(sK1,X0) ),
inference(resolution,[],[f56,f51]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ int_less(X2,X0)
| ~ int_less(X0,X1)
| int_less(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( int_less(X2,X1)
| ~ int_less(X0,X1)
| ~ int_less(X2,X0) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
! [X2,X1,X0] :
( int_less(X2,X1)
| ~ int_less(X2,X0)
| ~ int_less(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X2,X1,X0] :
( ( int_less(X2,X0)
& int_less(X0,X1) )
=> int_less(X2,X1) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X2,X0] :
( ( int_less(X1,X2)
& int_less(X0,X1) )
=> int_less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_transitive) ).
fof(f56,plain,
int_less(sK1,sK2),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
( int_less(sK1,sK2)
& int_leq(sK2,n)
& real_zero != a(sK2,sK1)
& int_leq(int_one,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f36,f37]) ).
fof(f37,plain,
( ? [X0,X1] :
( int_less(X0,X1)
& int_leq(X1,n)
& real_zero != a(X1,X0)
& int_leq(int_one,X0) )
=> ( int_less(sK1,sK2)
& int_leq(sK2,n)
& real_zero != a(sK2,sK1)
& int_leq(int_one,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
? [X0,X1] :
( int_less(X0,X1)
& int_leq(X1,n)
& real_zero != a(X1,X0)
& int_leq(int_one,X0) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
? [X1,X0] :
( int_less(X1,X0)
& int_leq(X0,n)
& real_zero != a(X0,X1)
& int_leq(int_one,X1) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_less(X1,X0)
& int_leq(X0,n)
& int_leq(int_one,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_less(X1,X0)
& int_leq(X0,n)
& int_leq(int_one,X1) )
=> real_zero = a(X0,X1) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_less(X1,X0)
& int_leq(X0,n)
& int_leq(int_one,X1) )
=> real_zero = a(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ut) ).
fof(f253,plain,
~ int_leq(sK1,n),
inference(subsumption_resolution,[],[f183,f248]) ).
fof(f248,plain,
int_leq(int_one,sK2),
inference(resolution,[],[f216,f43]) ).
fof(f43,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,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/sandbox/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(f216,plain,
int_less(int_zero,sK2),
inference(resolution,[],[f111,f56]) ).
fof(f111,plain,
! [X0] :
( ~ int_less(sK1,X0)
| int_less(int_zero,X0) ),
inference(resolution,[],[f68,f51]) ).
fof(f68,plain,
int_less(int_zero,sK1),
inference(resolution,[],[f53,f44]) ).
fof(f44,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f53,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f38]) ).
fof(f183,plain,
( ~ int_leq(int_one,sK2)
| ~ int_leq(sK1,n) ),
inference(subsumption_resolution,[],[f182,f56]) ).
fof(f182,plain,
( ~ int_less(sK1,sK2)
| ~ int_leq(int_one,sK2)
| ~ int_leq(sK1,n) ),
inference(subsumption_resolution,[],[f181,f55]) ).
fof(f55,plain,
int_leq(sK2,n),
inference(cnf_transformation,[],[f38]) ).
fof(f181,plain,
( ~ int_leq(int_one,sK2)
| ~ int_leq(sK1,n)
| ~ int_leq(sK2,n)
| ~ int_less(sK1,sK2) ),
inference(subsumption_resolution,[],[f180,f53]) ).
fof(f180,plain,
( ~ int_leq(int_one,sK2)
| ~ int_leq(int_one,sK1)
| ~ int_less(sK1,sK2)
| ~ int_leq(sK1,n)
| ~ int_leq(sK2,n) ),
inference(trivial_inequality_removal,[],[f177]) ).
fof(f177,plain,
( ~ int_leq(int_one,sK2)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK2)
| real_zero != real_zero
| ~ int_leq(sK2,n) ),
inference(superposition,[],[f54,f145]) ).
fof(f145,plain,
! [X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(X0,n)
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f144,f65]) ).
fof(f65,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( int_leq(X1,X0)
| X0 != X1 ),
inference(cnf_transformation,[],[f40]) ).
fof(f144,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_less(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| real_zero = a(X1,X0)
| ~ int_leq(int_one,X0) ),
inference(duplicate_literal_removal,[],[f141]) ).
fof(f141,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| ~ int_less(X0,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| real_zero = a(X1,X0) ),
inference(superposition,[],[f99,f49]) ).
fof(f49,plain,
! [X0,X1] :
( plus(X1,sK0(X0,X1)) = X0
| ~ int_less(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ( ( int_less(int_zero,sK0(X0,X1))
& plus(X1,sK0(X0,X1)) = X0 )
| ~ int_less(X1,X0) )
& ( int_less(X1,X0)
| ! [X3] :
( ~ int_less(int_zero,X3)
| plus(X1,X3) != X0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f32,f33]) ).
fof(f33,plain,
! [X0,X1] :
( ? [X2] :
( int_less(int_zero,X2)
& plus(X1,X2) = X0 )
=> ( int_less(int_zero,sK0(X0,X1))
& plus(X1,sK0(X0,X1)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1] :
( ( ? [X2] :
( int_less(int_zero,X2)
& plus(X1,X2) = X0 )
| ~ int_less(X1,X0) )
& ( int_less(X1,X0)
| ! [X3] :
( ~ int_less(int_zero,X3)
| plus(X1,X3) != X0 ) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( ? [X2] :
( int_less(int_zero,X2)
& plus(X1,X2) = X0 )
| ~ int_less(X1,X0) )
& ( int_less(X1,X0)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ? [X2] :
( int_less(int_zero,X2)
& plus(X1,X2) = X0 )
<=> int_less(X1,X0) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] :
( ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 )
<=> int_less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(f99,plain,
! [X2,X0,X1] :
( ~ int_leq(plus(X2,sK0(X1,X0)),n)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,plus(X2,sK0(X1,X0)))
| ~ int_leq(int_one,X0)
| real_zero = a(X1,X0)
| ~ int_less(X0,X1)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2) ),
inference(subsumption_resolution,[],[f95,f50]) ).
fof(f50,plain,
! [X0,X1] :
( int_less(int_zero,sK0(X0,X1))
| ~ int_less(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f95,plain,
! [X2,X0,X1] :
( real_zero = a(X1,X0)
| ~ int_less(X0,X1)
| ~ int_less(int_zero,sK0(X1,X0))
| ~ int_leq(plus(X2,sK0(X1,X0)),n)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,X2)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,plus(X2,sK0(X1,X0))) ),
inference(superposition,[],[f67,f49]) ).
fof(f67,plain,
! [X1,X4,X5] :
( real_zero = a(plus(X5,X4),X5)
| ~ int_leq(X1,n)
| ~ int_less(int_zero,X4)
| ~ int_leq(int_one,X1)
| ~ int_leq(int_one,plus(X1,X4))
| ~ int_leq(X5,X1)
| ~ int_leq(int_one,X5)
| ~ int_leq(plus(X1,X4),n) ),
inference(equality_resolution,[],[f60]) ).
fof(f60,plain,
! [X0,X1,X4,X5] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X5,X1)
| real_zero = a(plus(X5,X4),X5)
| ~ int_leq(int_one,X5)
| plus(X1,X4) != X0
| ~ int_less(int_zero,X4) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ( ! [X2] :
( ! [X3] :
( ~ int_leq(int_one,X3)
| a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2))
| ~ int_leq(X3,X0) )
| plus(X0,X2) != X1
| ~ int_leq(int_zero,X2) )
& ! [X4] :
( ! [X5] :
( ~ int_leq(X5,X1)
| real_zero = a(plus(X5,X4),X5)
| ~ int_leq(int_one,X5) )
| plus(X1,X4) != X0
| ~ int_less(int_zero,X4) ) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ( ! [X4] :
( ! [X5] :
( ~ int_leq(int_one,X5)
| a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4))
| ~ int_leq(X5,X0) )
| plus(X0,X4) != X1
| ~ int_leq(int_zero,X4) )
& ! [X2] :
( ! [X3] :
( ~ int_leq(X3,X1)
| real_zero = a(plus(X3,X2),X3)
| ~ int_leq(int_one,X3) )
| plus(X1,X2) != X0
| ~ int_less(int_zero,X2) ) ) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( real_zero = a(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| plus(X1,X2) != X0
| ~ int_less(int_zero,X2) )
& ! [X4] :
( ! [X5] :
( a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4))
| ~ int_leq(X5,X0)
| ~ int_leq(int_one,X5) )
| ~ int_leq(int_zero,X4)
| plus(X0,X4) != X1 ) )
| ~ int_leq(X0,n)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(int_one,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(X0,n)
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(int_one,X0) )
=> ( ! [X2] :
( ( plus(X1,X2) = X0
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> real_zero = a(plus(X3,X2),X3) ) )
& ! [X4] :
( ( int_leq(int_zero,X4)
& plus(X0,X4) = X1 )
=> ! [X5] :
( ( int_leq(X5,X0)
& int_leq(int_one,X5) )
=> a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4)) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(X0,n)
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(int_one,X0) )
=> ( ! [X7] :
( ( int_less(int_zero,X7)
& plus(X1,X7) = X0 )
=> ! [X2] :
( ( int_leq(int_one,X2)
& int_leq(X2,X1) )
=> real_zero = a(plus(X2,X7),X2) ) )
& ! [X7] :
( ( plus(X0,X7) = X1
& int_leq(int_zero,X7) )
=> ! [X2] :
( ( int_leq(int_one,X2)
& int_leq(X2,X0) )
=> a(X2,plus(X2,X7)) = lu(X2,plus(X2,X7)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qiu) ).
fof(f54,plain,
real_zero != a(sK2,sK1),
inference(cnf_transformation,[],[f38]) ).
fof(f252,plain,
~ spl3_7,
inference(avatar_contradiction_clause,[],[f251]) ).
fof(f251,plain,
( $false
| ~ spl3_7 ),
inference(subsumption_resolution,[],[f248,f226]) ).
fof(f226,plain,
( ~ int_leq(int_one,sK2)
| ~ spl3_7 ),
inference(subsumption_resolution,[],[f183,f197]) ).
fof(f197,plain,
( int_leq(sK1,n)
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f196]) ).
fof(f196,plain,
( spl3_7
<=> int_leq(sK1,n) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_7])]) ).
fof(f205,plain,
( ~ spl3_3
| spl3_7 ),
inference(avatar_contradiction_clause,[],[f204]) ).
fof(f204,plain,
( $false
| ~ spl3_3
| spl3_7 ),
inference(subsumption_resolution,[],[f198,f91]) ).
fof(f91,plain,
( int_leq(sK1,n)
| ~ spl3_3 ),
inference(forward_demodulation,[],[f89,f83]) ).
fof(f83,plain,
( n = sK2
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f81,plain,
( spl3_3
<=> n = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f89,plain,
int_leq(sK1,sK2),
inference(resolution,[],[f56,f57]) ).
fof(f198,plain,
( ~ int_leq(sK1,n)
| spl3_7 ),
inference(avatar_component_clause,[],[f196]) ).
fof(f88,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f79,f85,f81]) ).
fof(f79,plain,
( int_less(sK2,n)
| n = sK2 ),
inference(resolution,[],[f55,f59]) ).
fof(f59,plain,
! [X0,X1] :
( ~ int_leq(X1,X0)
| int_less(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV487+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 19:24:43 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.45 % (6320)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.46 % (6328)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.46 % (6328)Instruction limit reached!
% 0.21/0.46 % (6328)------------------------------
% 0.21/0.46 % (6328)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.46 % (6328)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.46 % (6328)Termination reason: Unknown
% 0.21/0.46 % (6328)Termination phase: Saturation
% 0.21/0.46
% 0.21/0.46 % (6328)Memory used [KB]: 5884
% 0.21/0.46 % (6328)Time elapsed: 0.068 s
% 0.21/0.46 % (6328)Instructions burned: 3 (million)
% 0.21/0.46 % (6328)------------------------------
% 0.21/0.46 % (6328)------------------------------
% 0.21/0.49 % (6320)Instruction limit reached!
% 0.21/0.49 % (6320)------------------------------
% 0.21/0.49 % (6320)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49 % (6320)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.49 % (6320)Termination reason: Unknown
% 0.21/0.49 % (6320)Termination phase: Saturation
% 0.21/0.49
% 0.21/0.49 % (6320)Memory used [KB]: 6396
% 0.21/0.49 % (6320)Time elapsed: 0.103 s
% 0.21/0.49 % (6320)Instructions burned: 39 (million)
% 0.21/0.49 % (6320)------------------------------
% 0.21/0.49 % (6320)------------------------------
% 0.21/0.50 % (6319)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.51 % (6336)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.51 % (6341)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.21/0.51 % (6340)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.52 % (6332)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.52 % (6332)Instruction limit reached!
% 0.21/0.52 % (6332)------------------------------
% 0.21/0.52 % (6332)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (6332)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (6332)Termination reason: Unknown
% 0.21/0.52 % (6332)Termination phase: Preprocessing 3
% 0.21/0.52
% 0.21/0.52 % (6332)Memory used [KB]: 1407
% 0.21/0.52 % (6332)Time elapsed: 0.002 s
% 0.21/0.52 % (6332)Instructions burned: 2 (million)
% 0.21/0.52 % (6332)------------------------------
% 0.21/0.52 % (6332)------------------------------
% 0.21/0.52 % (6325)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.52 % (6333)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.21/0.52 % (6345)lrs+1010_1:1_afq=1.1:anc=none:bd=off:sd=2:sos=on:ss=axioms:i=92:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/92Mi)
% 0.21/0.53 % (6319)Instruction limit reached!
% 0.21/0.53 % (6319)------------------------------
% 0.21/0.53 % (6319)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (6345)First to succeed.
% 0.21/0.53 % (6319)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (6319)Termination reason: Unknown
% 0.21/0.53 % (6319)Termination phase: Saturation
% 0.21/0.53
% 0.21/0.53 % (6319)Memory used [KB]: 1663
% 0.21/0.53 % (6319)Time elapsed: 0.103 s
% 0.21/0.53 % (6319)Instructions burned: 16 (million)
% 0.21/0.53 % (6319)------------------------------
% 0.21/0.53 % (6319)------------------------------
% 0.21/0.53 % (6317)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.54 % (6337)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.54 % (6314)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.54 % (6315)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.54 % (6345)Refutation found. Thanks to Tanya!
% 0.21/0.54 % SZS status Theorem for theBenchmark
% 0.21/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.54 % (6345)------------------------------
% 0.21/0.54 % (6345)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (6345)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (6345)Termination reason: Refutation
% 0.21/0.54
% 0.21/0.54 % (6345)Memory used [KB]: 6012
% 0.21/0.54 % (6345)Time elapsed: 0.033 s
% 0.21/0.54 % (6345)Instructions burned: 9 (million)
% 0.21/0.54 % (6345)------------------------------
% 0.21/0.54 % (6345)------------------------------
% 0.21/0.54 % (6313)Success in time 0.178 s
%------------------------------------------------------------------------------