TSTP Solution File: SYN551+2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN551+2 : TPTP v8.1.0. Bugfixed v3.1.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 : n011.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 19:27:43 EDT 2022
% Result : Theorem 0.17s 0.52s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 93 ( 1 unt; 0 def)
% Number of atoms : 387 ( 229 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 516 ( 222 ~; 247 |; 23 &)
% ( 19 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 93 ( 73 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f167,plain,
$false,
inference(avatar_sat_refutation,[],[f30,f37,f41,f46,f50,f51,f56,f57,f71,f91,f124,f141,f166]) ).
fof(f166,plain,
( ~ spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[],[f165]) ).
fof(f165,plain,
( $false
| ~ spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f164]) ).
fof(f164,plain,
( f(sK3) != f(sK3)
| ~ spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_8 ),
inference(forward_demodulation,[],[f163,f55]) ).
fof(f55,plain,
( sK3 = g(f(sK3))
| ~ spl4_8 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f53,plain,
( spl4_8
<=> sK3 = g(f(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_8])]) ).
fof(f163,plain,
( f(g(f(sK3))) != f(sK3)
| ~ spl4_2
| ~ spl4_3
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f162]) ).
fof(f162,plain,
( f(sK3) != f(sK3)
| f(g(f(sK3))) != f(sK3)
| ~ spl4_2
| ~ spl4_3
| ~ spl4_5 ),
inference(superposition,[],[f29,f159]) ).
fof(f159,plain,
( sK0(f(sK3)) = f(sK3)
| ~ spl4_3
| ~ spl4_5 ),
inference(equality_resolution,[],[f156]) ).
fof(f156,plain,
( ! [X0] :
( f(sK3) != X0
| sK0(X0) = X0 )
| ~ spl4_3
| ~ spl4_5 ),
inference(equality_factoring,[],[f152]) ).
fof(f152,plain,
( ! [X0] :
( sK0(X0) = f(sK3)
| sK0(X0) = X0 )
| ~ spl4_3
| ~ spl4_5 ),
inference(duplicate_literal_removal,[],[f150]) ).
fof(f150,plain,
( ! [X0] :
( sK0(X0) = f(sK3)
| sK0(X0) = X0
| sK0(X0) = X0 )
| ~ spl4_3
| ~ spl4_5 ),
inference(superposition,[],[f40,f149]) ).
fof(f149,plain,
( ! [X1] :
( g(sK0(X1)) = sK3
| sK0(X1) = X1 )
| ~ spl4_3
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f148]) ).
fof(f148,plain,
( ! [X1] :
( g(sK0(X1)) = sK3
| sK0(X1) = X1
| g(sK0(X1)) != g(sK0(X1)) )
| ~ spl4_3
| ~ spl4_5 ),
inference(superposition,[],[f33,f40]) ).
fof(f33,plain,
( ! [X7] :
( g(f(X7)) != X7
| sK3 = X7 )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl4_3
<=> ! [X7] :
( g(f(X7)) != X7
| sK3 = X7 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f40,plain,
( ! [X0] :
( sK0(X0) = f(g(sK0(X0)))
| sK0(X0) = X0 )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f39,plain,
( spl4_5
<=> ! [X0] :
( sK0(X0) = f(g(sK0(X0)))
| sK0(X0) = X0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f29,plain,
( ! [X0] :
( sK0(X0) != f(g(sK0(X0)))
| sK0(X0) != X0 )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl4_2
<=> ! [X0] :
( sK0(X0) != X0
| sK0(X0) != f(g(sK0(X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f141,plain,
( ~ spl4_1
| ~ spl4_3
| ~ spl4_7
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f140,plain,
( $false
| ~ spl4_1
| ~ spl4_3
| ~ spl4_7
| ~ spl4_8 ),
inference(subsumption_resolution,[],[f139,f55]) ).
fof(f139,plain,
( sK3 != g(f(sK3))
| ~ spl4_1
| ~ spl4_3
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f138]) ).
fof(f138,plain,
( sK3 != sK3
| sK3 != g(f(sK3))
| ~ spl4_1
| ~ spl4_3
| ~ spl4_7 ),
inference(superposition,[],[f26,f136]) ).
fof(f136,plain,
( sK3 = sK1(sK3)
| ~ spl4_3
| ~ spl4_7 ),
inference(equality_resolution,[],[f134]) ).
fof(f134,plain,
( ! [X0] :
( sK3 != X0
| sK1(X0) = X0 )
| ~ spl4_3
| ~ spl4_7 ),
inference(equality_factoring,[],[f131]) ).
fof(f131,plain,
( ! [X1] :
( sK1(X1) = sK3
| sK1(X1) = X1 )
| ~ spl4_3
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f130]) ).
fof(f130,plain,
( ! [X1] :
( sK1(X1) = X1
| sK1(X1) != sK1(X1)
| sK1(X1) = sK3 )
| ~ spl4_3
| ~ spl4_7 ),
inference(superposition,[],[f33,f49]) ).
fof(f49,plain,
( ! [X2] :
( g(f(sK1(X2))) = sK1(X2)
| sK1(X2) = X2 )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f48,plain,
( spl4_7
<=> ! [X2] :
( sK1(X2) = X2
| g(f(sK1(X2))) = sK1(X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
fof(f26,plain,
( ! [X2] :
( g(f(sK1(X2))) != sK1(X2)
| sK1(X2) != X2 )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f25,plain,
( spl4_1
<=> ! [X2] :
( g(f(sK1(X2))) != sK1(X2)
| sK1(X2) != X2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f124,plain,
( ~ spl4_4
| spl4_6
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[],[f123]) ).
fof(f123,plain,
( $false
| ~ spl4_4
| spl4_6
| ~ spl4_8 ),
inference(subsumption_resolution,[],[f118,f116]) ).
fof(f116,plain,
( sK2 = f(sK3)
| ~ spl4_4
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f115]) ).
fof(f115,plain,
( f(sK3) != f(sK3)
| sK2 = f(sK3)
| ~ spl4_4
| ~ spl4_8 ),
inference(superposition,[],[f36,f55]) ).
fof(f36,plain,
( ! [X5] :
( f(g(X5)) != X5
| sK2 = X5 )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl4_4
<=> ! [X5] :
( f(g(X5)) != X5
| sK2 = X5 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f118,plain,
( sK2 != f(sK3)
| ~ spl4_4
| spl4_6
| ~ spl4_8 ),
inference(backward_demodulation,[],[f44,f117]) ).
fof(f117,plain,
( sK3 = g(sK2)
| ~ spl4_4
| ~ spl4_8 ),
inference(backward_demodulation,[],[f55,f116]) ).
fof(f44,plain,
( f(g(sK2)) != sK2
| spl4_6 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f43,plain,
( spl4_6
<=> f(g(sK2)) = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f91,plain,
( ~ spl4_1
| ~ spl4_4
| ~ spl4_6
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f90]) ).
fof(f90,plain,
( $false
| ~ spl4_1
| ~ spl4_4
| ~ spl4_6
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f89]) ).
fof(f89,plain,
( g(sK2) != g(sK2)
| ~ spl4_1
| ~ spl4_4
| ~ spl4_6
| ~ spl4_7 ),
inference(forward_demodulation,[],[f88,f45]) ).
fof(f45,plain,
( f(g(sK2)) = sK2
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f88,plain,
( g(sK2) != g(f(g(sK2)))
| ~ spl4_1
| ~ spl4_4
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f87]) ).
fof(f87,plain,
( g(sK2) != g(f(g(sK2)))
| g(sK2) != g(sK2)
| ~ spl4_1
| ~ spl4_4
| ~ spl4_7 ),
inference(superposition,[],[f26,f84]) ).
fof(f84,plain,
( g(sK2) = sK1(g(sK2))
| ~ spl4_4
| ~ spl4_7 ),
inference(equality_resolution,[],[f81]) ).
fof(f81,plain,
( ! [X0] :
( g(sK2) != X0
| sK1(X0) = X0 )
| ~ spl4_4
| ~ spl4_7 ),
inference(equality_factoring,[],[f77]) ).
fof(f77,plain,
( ! [X0] :
( g(sK2) = sK1(X0)
| sK1(X0) = X0 )
| ~ spl4_4
| ~ spl4_7 ),
inference(duplicate_literal_removal,[],[f75]) ).
fof(f75,plain,
( ! [X0] :
( g(sK2) = sK1(X0)
| sK1(X0) = X0
| sK1(X0) = X0 )
| ~ spl4_4
| ~ spl4_7 ),
inference(superposition,[],[f49,f74]) ).
fof(f74,plain,
( ! [X1] :
( sK2 = f(sK1(X1))
| sK1(X1) = X1 )
| ~ spl4_4
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f73]) ).
fof(f73,plain,
( ! [X1] :
( sK2 = f(sK1(X1))
| f(sK1(X1)) != f(sK1(X1))
| sK1(X1) = X1 )
| ~ spl4_4
| ~ spl4_7 ),
inference(superposition,[],[f36,f49]) ).
fof(f71,plain,
( ~ spl4_2
| ~ spl4_4
| ~ spl4_5
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f70]) ).
fof(f70,plain,
( $false
| ~ spl4_2
| ~ spl4_4
| ~ spl4_5
| ~ spl4_6 ),
inference(subsumption_resolution,[],[f69,f45]) ).
fof(f69,plain,
( f(g(sK2)) != sK2
| ~ spl4_2
| ~ spl4_4
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f68]) ).
fof(f68,plain,
( sK2 != sK2
| f(g(sK2)) != sK2
| ~ spl4_2
| ~ spl4_4
| ~ spl4_5 ),
inference(superposition,[],[f29,f66]) ).
fof(f66,plain,
( sK0(sK2) = sK2
| ~ spl4_4
| ~ spl4_5 ),
inference(equality_resolution,[],[f64]) ).
fof(f64,plain,
( ! [X0] :
( sK2 != X0
| sK0(X0) = X0 )
| ~ spl4_4
| ~ spl4_5 ),
inference(equality_factoring,[],[f61]) ).
fof(f61,plain,
( ! [X1] :
( sK2 = sK0(X1)
| sK0(X1) = X1 )
| ~ spl4_4
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f60]) ).
fof(f60,plain,
( ! [X1] :
( sK0(X1) != sK0(X1)
| sK2 = sK0(X1)
| sK0(X1) = X1 )
| ~ spl4_4
| ~ spl4_5 ),
inference(superposition,[],[f36,f40]) ).
fof(f57,plain,
( spl4_8
| spl4_4 ),
inference(avatar_split_clause,[],[f20,f35,f53]) ).
fof(f20,plain,
! [X5] :
( sK2 = X5
| f(g(X5)) != X5
| sK3 = g(f(sK3)) ),
inference(equality_resolution,[],[f14]) ).
fof(f14,plain,
! [X7,X5] :
( sK2 = X5
| f(g(X5)) != X5
| g(f(X7)) = X7
| sK3 != X7 ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( ! [X0] :
( ( sK0(X0) != f(g(sK0(X0)))
| sK0(X0) != X0 )
& ( sK0(X0) = f(g(sK0(X0)))
| sK0(X0) = X0 ) )
| ! [X2] :
( ( g(f(sK1(X2))) != sK1(X2)
| sK1(X2) != X2 )
& ( g(f(sK1(X2))) = sK1(X2)
| sK1(X2) = X2 ) ) )
& ( ! [X5] :
( ( sK2 = X5
| f(g(X5)) != X5 )
& ( f(g(X5)) = X5
| sK2 != X5 ) )
| ! [X7] :
( ( sK3 = X7
| g(f(X7)) != X7 )
& ( g(f(X7)) = X7
| sK3 != X7 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f6,f10,f9,f8,f7]) ).
fof(f7,plain,
! [X0] :
( ? [X1] :
( ( f(g(X1)) != X1
| X0 != X1 )
& ( f(g(X1)) = X1
| X0 = X1 ) )
=> ( ( sK0(X0) != f(g(sK0(X0)))
| sK0(X0) != X0 )
& ( sK0(X0) = f(g(sK0(X0)))
| sK0(X0) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2] :
( ? [X3] :
( ( g(f(X3)) != X3
| X2 != X3 )
& ( g(f(X3)) = X3
| X2 = X3 ) )
=> ( ( g(f(sK1(X2))) != sK1(X2)
| sK1(X2) != X2 )
& ( g(f(sK1(X2))) = sK1(X2)
| sK1(X2) = X2 ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] :
! [X5] :
( ( X4 = X5
| f(g(X5)) != X5 )
& ( f(g(X5)) = X5
| X4 != X5 ) )
=> ! [X5] :
( ( sK2 = X5
| f(g(X5)) != X5 )
& ( f(g(X5)) = X5
| sK2 != X5 ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X6] :
! [X7] :
( ( X6 = X7
| g(f(X7)) != X7 )
& ( g(f(X7)) = X7
| X6 != X7 ) )
=> ! [X7] :
( ( sK3 = X7
| g(f(X7)) != X7 )
& ( g(f(X7)) = X7
| sK3 != X7 ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ! [X0] :
? [X1] :
( ( f(g(X1)) != X1
| X0 != X1 )
& ( f(g(X1)) = X1
| X0 = X1 ) )
| ! [X2] :
? [X3] :
( ( g(f(X3)) != X3
| X2 != X3 )
& ( g(f(X3)) = X3
| X2 = X3 ) ) )
& ( ? [X4] :
! [X5] :
( ( X4 = X5
| f(g(X5)) != X5 )
& ( f(g(X5)) = X5
| X4 != X5 ) )
| ? [X6] :
! [X7] :
( ( X6 = X7
| g(f(X7)) != X7 )
& ( g(f(X7)) = X7
| X6 != X7 ) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ! [X0] :
? [X1] :
( ( f(g(X1)) != X1
| X0 != X1 )
& ( f(g(X1)) = X1
| X0 = X1 ) )
| ! [X2] :
? [X3] :
( ( g(f(X3)) != X3
| X2 != X3 )
& ( g(f(X3)) = X3
| X2 = X3 ) ) )
& ( ? [X0] :
! [X1] :
( ( X0 = X1
| f(g(X1)) != X1 )
& ( f(g(X1)) = X1
| X0 != X1 ) )
| ? [X2] :
! [X3] :
( ( X2 = X3
| g(f(X3)) != X3 )
& ( g(f(X3)) = X3
| X2 != X3 ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ? [X2] :
! [X3] :
( X2 = X3
<=> g(f(X3)) = X3 )
<~> ? [X0] :
! [X1] :
( X0 = X1
<=> f(g(X1)) = X1 ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
! [X1] :
( X0 = X1
<=> f(g(X1)) = X1 )
<=> ? [X2] :
! [X3] :
( X2 = X3
<=> g(f(X3)) = X3 ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( X0 = X1
<=> f(g(X1)) = X1 )
<=> ? [X0] :
! [X1] :
( g(f(X1)) = X1
<=> X0 = X1 ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( X0 = X1
<=> f(g(X1)) = X1 )
<=> ? [X0] :
! [X1] :
( g(f(X1)) = X1
<=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_cute_thing) ).
fof(f56,plain,
( spl4_8
| spl4_6 ),
inference(avatar_split_clause,[],[f23,f43,f53]) ).
fof(f23,plain,
( f(g(sK2)) = sK2
| sK3 = g(f(sK3)) ),
inference(equality_resolution,[],[f22]) ).
fof(f22,plain,
! [X7] :
( f(g(sK2)) = sK2
| g(f(X7)) = X7
| sK3 != X7 ),
inference(equality_resolution,[],[f12]) ).
fof(f12,plain,
! [X7,X5] :
( f(g(X5)) = X5
| sK2 != X5
| g(f(X7)) = X7
| sK3 != X7 ),
inference(cnf_transformation,[],[f11]) ).
fof(f51,plain,
( spl4_2
| spl4_7 ),
inference(avatar_split_clause,[],[f18,f48,f28]) ).
fof(f18,plain,
! [X2,X0] :
( g(f(sK1(X2))) = sK1(X2)
| sK1(X2) = X2
| sK0(X0) != f(g(sK0(X0)))
| sK0(X0) != X0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f50,plain,
( spl4_5
| spl4_7 ),
inference(avatar_split_clause,[],[f16,f48,f39]) ).
fof(f16,plain,
! [X2,X0] :
( sK1(X2) = X2
| sK0(X0) = X0
| sK0(X0) = f(g(sK0(X0)))
| g(f(sK1(X2))) = sK1(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f46,plain,
( spl4_6
| spl4_3 ),
inference(avatar_split_clause,[],[f21,f32,f43]) ).
fof(f21,plain,
! [X7] :
( sK3 = X7
| g(f(X7)) != X7
| f(g(sK2)) = sK2 ),
inference(equality_resolution,[],[f13]) ).
fof(f13,plain,
! [X7,X5] :
( f(g(X5)) = X5
| sK2 != X5
| sK3 = X7
| g(f(X7)) != X7 ),
inference(cnf_transformation,[],[f11]) ).
fof(f41,plain,
( spl4_1
| spl4_5 ),
inference(avatar_split_clause,[],[f17,f39,f25]) ).
fof(f17,plain,
! [X2,X0] :
( sK0(X0) = f(g(sK0(X0)))
| sK0(X0) = X0
| g(f(sK1(X2))) != sK1(X2)
| sK1(X2) != X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f37,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f15,f35,f32]) ).
fof(f15,plain,
! [X7,X5] :
( f(g(X5)) != X5
| sK2 = X5
| g(f(X7)) != X7
| sK3 = X7 ),
inference(cnf_transformation,[],[f11]) ).
fof(f30,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f19,f28,f25]) ).
fof(f19,plain,
! [X2,X0] :
( sK0(X0) != X0
| g(f(sK1(X2))) != sK1(X2)
| sK0(X0) != f(g(sK0(X0)))
| sK1(X2) != X2 ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN551+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.32 % CPULimit : 300
% 0.17/0.32 % WCLimit : 300
% 0.17/0.32 % DateTime : Tue Aug 30 22:04:55 EDT 2022
% 0.17/0.32 % CPUTime :
% 0.17/0.48 % (21997)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.17/0.49 % (21988)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.17/0.49 % (21979)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.17/0.49 % (21997)Refutation not found, incomplete strategy% (21997)------------------------------
% 0.17/0.49 % (21997)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49 % (21997)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.49 % (21997)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.49
% 0.17/0.49 % (21997)Memory used [KB]: 5884
% 0.17/0.49 % (21997)Time elapsed: 0.060 s
% 0.17/0.49 % (21997)Instructions burned: 3 (million)
% 0.17/0.49 % (21997)------------------------------
% 0.17/0.49 % (21997)------------------------------
% 0.17/0.50 % (21980)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.17/0.50 % (21988)Instruction limit reached!
% 0.17/0.50 % (21988)------------------------------
% 0.17/0.50 % (21988)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.50 % (21988)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.50 % (21988)Termination reason: Unknown
% 0.17/0.50 % (21988)Termination phase: Saturation
% 0.17/0.50
% 0.17/0.50 % (21988)Memory used [KB]: 6012
% 0.17/0.50 % (21988)Time elapsed: 0.066 s
% 0.17/0.50 % (21988)Instructions burned: 8 (million)
% 0.17/0.50 % (21988)------------------------------
% 0.17/0.50 % (21988)------------------------------
% 0.17/0.50 % (21987)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.17/0.50 % (21987)Instruction limit reached!
% 0.17/0.50 % (21987)------------------------------
% 0.17/0.50 % (21987)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.50 % (21987)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.50 % (21987)Termination reason: Unknown
% 0.17/0.50 % (21987)Termination phase: Saturation
% 0.17/0.50
% 0.17/0.50 % (21987)Memory used [KB]: 5884
% 0.17/0.50 % (21987)Time elapsed: 0.123 s
% 0.17/0.50 % (21987)Instructions burned: 3 (million)
% 0.17/0.50 % (21987)------------------------------
% 0.17/0.50 % (21987)------------------------------
% 0.17/0.50 % (21996)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.17/0.50 % (21979)First to succeed.
% 0.17/0.52 % (21980)Also succeeded, but the first one will report.
% 0.17/0.52 % (21979)Refutation found. Thanks to Tanya!
% 0.17/0.52 % SZS status Theorem for theBenchmark
% 0.17/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.52 % (21979)------------------------------
% 0.17/0.52 % (21979)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.52 % (21979)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.52 % (21979)Termination reason: Refutation
% 0.17/0.52
% 0.17/0.52 % (21979)Memory used [KB]: 6012
% 0.17/0.52 % (21979)Time elapsed: 0.106 s
% 0.17/0.52 % (21979)Instructions burned: 7 (million)
% 0.17/0.52 % (21979)------------------------------
% 0.17/0.52 % (21979)------------------------------
% 0.17/0.52 % (21972)Success in time 0.185 s
%------------------------------------------------------------------------------