TSTP Solution File: SYN551+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN551+2 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Sun May 5 12:11:29 EDT 2024
% Result : Theorem 0.16s 0.38s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 93 ( 3 unt; 0 def)
% Number of atoms : 333 ( 197 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 409 ( 169 ~; 192 |; 26 &)
% ( 16 <=>; 4 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 75 ( 53 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f142,plain,
$false,
inference(avatar_sat_refutation,[],[f37,f67,f69,f114,f117,f119,f122,f139,f141]) ).
fof(f141,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f140,plain,
( $false
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f134,f75]) ).
fof(f75,plain,
( g(sK2) != sK3(g(sK2))
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f72]) ).
fof(f72,plain,
( g(sK2) != g(sK2)
| g(sK2) != sK3(g(sK2))
| ~ spl5_1 ),
inference(superposition,[],[f71,f70]) ).
fof(f70,plain,
( sK2 = f(g(sK2))
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f25,f32]) ).
fof(f32,plain,
( sP0
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f30,plain,
( spl5_1
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f25,plain,
( sK2 = f(g(sK2))
| ~ sP0 ),
inference(equality_resolution,[],[f18]) ).
fof(f18,plain,
! [X3] :
( f(g(X3)) = X3
| sK2 != X3
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( sP0
| ! [X0] :
( ( sK1(X0) != X0
| sK1(X0) != f(g(sK1(X0))) )
& ( sK1(X0) = X0
| sK1(X0) = f(g(sK1(X0))) ) ) )
& ( ! [X3] :
( ( f(g(X3)) = X3
| sK2 != X3 )
& ( sK2 = X3
| f(g(X3)) != X3 ) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f8,f10,f9]) ).
fof(f9,plain,
! [X0] :
( ? [X1] :
( ( X0 != X1
| f(g(X1)) != X1 )
& ( X0 = X1
| f(g(X1)) = X1 ) )
=> ( ( sK1(X0) != X0
| sK1(X0) != f(g(sK1(X0))) )
& ( sK1(X0) = X0
| sK1(X0) = f(g(sK1(X0))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X2] :
! [X3] :
( ( f(g(X3)) = X3
| X2 != X3 )
& ( X2 = X3
| f(g(X3)) != X3 ) )
=> ! [X3] :
( ( f(g(X3)) = X3
| sK2 != X3 )
& ( sK2 = X3
| f(g(X3)) != X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ( sP0
| ! [X0] :
? [X1] :
( ( X0 != X1
| f(g(X1)) != X1 )
& ( X0 = X1
| f(g(X1)) = X1 ) ) )
& ( ? [X2] :
! [X3] :
( ( f(g(X3)) = X3
| X2 != X3 )
& ( X2 = X3
| f(g(X3)) != X3 ) )
| ~ sP0 ) ),
inference(rectify,[],[f7]) ).
fof(f7,plain,
( ( sP0
| ! [X0] :
? [X1] :
( ( X0 != X1
| f(g(X1)) != X1 )
& ( X0 = X1
| f(g(X1)) = X1 ) ) )
& ( ? [X0] :
! [X1] :
( ( f(g(X1)) = X1
| X0 != X1 )
& ( X0 = X1
| f(g(X1)) != X1 ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
( sP0
<=> ? [X0] :
! [X1] :
( f(g(X1)) = X1
<=> X0 = X1 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f71,plain,
( ! [X0] :
( g(f(X0)) != X0
| sK3(X0) != X0 )
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f28,f32]) ).
fof(f28,plain,
! [X0] :
( sK3(X0) != X0
| g(f(X0)) != X0
| ~ sP0 ),
inference(inner_rewriting,[],[f24]) ).
fof(f24,plain,
! [X0] :
( sK3(X0) != X0
| sK3(X0) != g(f(sK3(X0)))
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
( ( ! [X0] :
( ( sK3(X0) != X0
| sK3(X0) != g(f(sK3(X0))) )
& ( sK3(X0) = X0
| sK3(X0) = g(f(sK3(X0))) ) )
| ~ sP0 )
& ( ! [X3] :
( ( g(f(X3)) = X3
| sK4 != X3 )
& ( sK4 = X3
| g(f(X3)) != X3 ) )
| sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f13,f15,f14]) ).
fof(f14,plain,
! [X0] :
( ? [X1] :
( ( X0 != X1
| g(f(X1)) != X1 )
& ( X0 = X1
| g(f(X1)) = X1 ) )
=> ( ( sK3(X0) != X0
| sK3(X0) != g(f(sK3(X0))) )
& ( sK3(X0) = X0
| sK3(X0) = g(f(sK3(X0))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X2] :
! [X3] :
( ( g(f(X3)) = X3
| X2 != X3 )
& ( X2 = X3
| g(f(X3)) != X3 ) )
=> ! [X3] :
( ( g(f(X3)) = X3
| sK4 != X3 )
& ( sK4 = X3
| g(f(X3)) != X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ( ! [X0] :
? [X1] :
( ( X0 != X1
| g(f(X1)) != X1 )
& ( X0 = X1
| g(f(X1)) = X1 ) )
| ~ sP0 )
& ( ? [X2] :
! [X3] :
( ( g(f(X3)) = X3
| X2 != X3 )
& ( X2 = X3
| g(f(X3)) != X3 ) )
| sP0 ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
( ( ! [X2] :
? [X3] :
( ( X2 != X3
| g(f(X3)) != X3 )
& ( X2 = X3
| g(f(X3)) = X3 ) )
| ~ sP0 )
& ( ? [X2] :
! [X3] :
( ( g(f(X3)) = X3
| X2 != X3 )
& ( X2 = X3
| g(f(X3)) != X3 ) )
| sP0 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
( sP0
<~> ? [X2] :
! [X3] :
( g(f(X3)) = X3
<=> X2 = X3 ) ),
inference(definition_folding,[],[f4,f5]) ).
fof(f4,plain,
( ? [X0] :
! [X1] :
( f(g(X1)) = X1
<=> X0 = X1 )
<~> ? [X2] :
! [X3] :
( g(f(X3)) = X3
<=> X2 = X3 ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
! [X1] :
( f(g(X1)) = X1
<=> X0 = X1 )
<=> ? [X2] :
! [X3] :
( g(f(X3)) = X3
<=> X2 = X3 ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( f(g(X1)) = X1
<=> X0 = X1 )
<=> ? [X0] :
! [X1] :
( g(f(X1)) = X1
<=> X0 = X1 ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( f(g(X1)) = X1
<=> X0 = X1 )
<=> ? [X0] :
! [X1] :
( g(f(X1)) = X1
<=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_cute_thing) ).
fof(f134,plain,
( g(sK2) = sK3(g(sK2))
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f131]) ).
fof(f131,plain,
( g(sK2) != g(sK2)
| g(sK2) = sK3(g(sK2))
| ~ spl5_1 ),
inference(superposition,[],[f75,f92]) ).
fof(f92,plain,
( ! [X0] :
( sK3(X0) = g(sK2)
| sK3(X0) = X0 )
| ~ spl5_1 ),
inference(duplicate_literal_removal,[],[f90]) ).
fof(f90,plain,
( ! [X0] :
( sK3(X0) = g(sK2)
| sK3(X0) = X0
| sK3(X0) = X0 )
| ~ spl5_1 ),
inference(superposition,[],[f85,f88]) ).
fof(f88,plain,
( ! [X0] :
( sK2 = f(sK3(X0))
| sK3(X0) = X0 )
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f87]) ).
fof(f87,plain,
( ! [X0] :
( f(sK3(X0)) != f(sK3(X0))
| sK2 = f(sK3(X0))
| sK3(X0) = X0 )
| ~ spl5_1 ),
inference(superposition,[],[f76,f85]) ).
fof(f76,plain,
( ! [X3] :
( f(g(X3)) != X3
| sK2 = X3 )
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f17,f32]) ).
fof(f17,plain,
! [X3] :
( sK2 = X3
| f(g(X3)) != X3
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f85,plain,
( ! [X0] :
( sK3(X0) = g(f(sK3(X0)))
| sK3(X0) = X0 )
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f23,f32]) ).
fof(f23,plain,
! [X0] :
( sK3(X0) = X0
| sK3(X0) = g(f(sK3(X0)))
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f139,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f138]) ).
fof(f138,plain,
( $false
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f135,f75]) ).
fof(f135,plain,
( g(sK2) = sK3(g(sK2))
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f128]) ).
fof(f128,plain,
( g(sK2) != g(sK2)
| g(sK2) = sK3(g(sK2))
| ~ spl5_1 ),
inference(superposition,[],[f75,f92]) ).
fof(f122,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f121]) ).
fof(f121,plain,
( $false
| ~ spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f120,f74]) ).
fof(f74,plain,
( sK4 != sK3(sK4)
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f73]) ).
fof(f73,plain,
( sK4 != sK4
| sK4 != sK3(sK4)
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f71,f36]) ).
fof(f36,plain,
( sK4 = g(f(sK4))
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f34,plain,
( spl5_2
<=> sK4 = g(f(sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f120,plain,
( sK4 = sK3(sK4)
| ~ spl5_1
| ~ spl5_2 ),
inference(forward_demodulation,[],[f108,f80]) ).
fof(f80,plain,
( sK4 = g(sK2)
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f36,f79]) ).
fof(f79,plain,
( sK2 = f(sK4)
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f77]) ).
fof(f77,plain,
( f(sK4) != f(sK4)
| sK2 = f(sK4)
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f76,f36]) ).
fof(f108,plain,
( sK4 = sK3(g(sK2))
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f103]) ).
fof(f103,plain,
( g(sK2) != g(sK2)
| sK4 = sK3(g(sK2))
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f75,f93]) ).
fof(f93,plain,
( ! [X0] :
( sK3(X0) = sK4
| sK3(X0) = X0 )
| ~ spl5_1
| ~ spl5_2 ),
inference(forward_demodulation,[],[f92,f80]) ).
fof(f119,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f118]) ).
fof(f118,plain,
( $false
| ~ spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f109,f74]) ).
fof(f109,plain,
( sK4 = sK3(sK4)
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f102]) ).
fof(f102,plain,
( sK4 != sK4
| sK4 = sK3(sK4)
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f74,f93]) ).
fof(f117,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f116]) ).
fof(f116,plain,
( $false
| ~ spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f115,f75]) ).
fof(f115,plain,
( g(sK2) = sK3(g(sK2))
| ~ spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f99,f80]) ).
fof(f99,plain,
( sK4 != g(sK2)
| g(sK2) = sK3(g(sK2))
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f75,f93]) ).
fof(f114,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f113]) ).
fof(f113,plain,
( $false
| ~ spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f112,f74]) ).
fof(f112,plain,
( sK4 = sK3(sK4)
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f98]) ).
fof(f98,plain,
( sK4 != sK4
| sK4 = sK3(sK4)
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f74,f93]) ).
fof(f69,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f68]) ).
fof(f68,plain,
( $false
| spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f62,f42]) ).
fof(f42,plain,
( f(sK4) != sK1(f(sK4))
| spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f41]) ).
fof(f41,plain,
( f(sK4) != f(sK4)
| f(sK4) != sK1(f(sK4))
| spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f40,f36]) ).
fof(f40,plain,
( ! [X0] :
( f(g(X0)) != X0
| sK1(X0) != X0 )
| spl5_1 ),
inference(subsumption_resolution,[],[f27,f31]) ).
fof(f31,plain,
( ~ sP0
| spl5_1 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f27,plain,
! [X0] :
( sP0
| sK1(X0) != X0
| f(g(X0)) != X0 ),
inference(inner_rewriting,[],[f20]) ).
fof(f20,plain,
! [X0] :
( sP0
| sK1(X0) != X0
| sK1(X0) != f(g(sK1(X0))) ),
inference(cnf_transformation,[],[f11]) ).
fof(f62,plain,
( f(sK4) = sK1(f(sK4))
| spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f57]) ).
fof(f57,plain,
( f(sK4) != f(sK4)
| f(sK4) = sK1(f(sK4))
| spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f42,f50]) ).
fof(f50,plain,
( ! [X0] :
( sK1(X0) = f(sK4)
| sK1(X0) = X0 )
| spl5_1 ),
inference(duplicate_literal_removal,[],[f48]) ).
fof(f48,plain,
( ! [X0] :
( sK1(X0) = f(sK4)
| sK1(X0) = X0
| sK1(X0) = X0 )
| spl5_1 ),
inference(superposition,[],[f43,f46]) ).
fof(f46,plain,
( ! [X0] :
( g(sK1(X0)) = sK4
| sK1(X0) = X0 )
| spl5_1 ),
inference(trivial_inequality_removal,[],[f45]) ).
fof(f45,plain,
( ! [X0] :
( g(sK1(X0)) != g(sK1(X0))
| g(sK1(X0)) = sK4
| sK1(X0) = X0 )
| spl5_1 ),
inference(superposition,[],[f38,f43]) ).
fof(f38,plain,
( ! [X3] :
( g(f(X3)) != X3
| sK4 = X3 )
| spl5_1 ),
inference(subsumption_resolution,[],[f21,f31]) ).
fof(f21,plain,
! [X3] :
( sK4 = X3
| g(f(X3)) != X3
| sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f43,plain,
( ! [X0] :
( sK1(X0) = f(g(sK1(X0)))
| sK1(X0) = X0 )
| spl5_1 ),
inference(subsumption_resolution,[],[f19,f31]) ).
fof(f19,plain,
! [X0] :
( sP0
| sK1(X0) = X0
| sK1(X0) = f(g(sK1(X0))) ),
inference(cnf_transformation,[],[f11]) ).
fof(f67,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f66]) ).
fof(f66,plain,
( $false
| spl5_1
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f65,f42]) ).
fof(f65,plain,
( f(sK4) = sK1(f(sK4))
| spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f54]) ).
fof(f54,plain,
( f(sK4) != f(sK4)
| f(sK4) = sK1(f(sK4))
| spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f42,f50]) ).
fof(f37,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f26,f34,f30]) ).
fof(f26,plain,
( sK4 = g(f(sK4))
| sP0 ),
inference(equality_resolution,[],[f22]) ).
fof(f22,plain,
! [X3] :
( g(f(X3)) = X3
| sK4 != X3
| sP0 ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN551+2 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.36 % Computer : n008.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 17:10:23 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 % (31773)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.38 % (31776)WARNING: value z3 for option sas not known
% 0.16/0.38 % (31776)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.38 % (31774)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.38 % (31775)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.38 % (31777)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.38 % (31778)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.16/0.38 % (31779)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.16/0.38 % (31780)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.16/0.38 % (31776)First to succeed.
% 0.16/0.38 TRYING [1]
% 0.16/0.38 TRYING [2]
% 0.16/0.38 % (31776)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31773"
% 0.16/0.38 TRYING [3]
% 0.16/0.38 % (31776)Refutation found. Thanks to Tanya!
% 0.16/0.38 % SZS status Theorem for theBenchmark
% 0.16/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.38 % (31776)------------------------------
% 0.16/0.38 % (31776)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.38 % (31776)Termination reason: Refutation
% 0.16/0.38
% 0.16/0.38 % (31776)Memory used [KB]: 785
% 0.16/0.38 % (31776)Time elapsed: 0.007 s
% 0.16/0.38 % (31776)Instructions burned: 9 (million)
% 0.16/0.38 % (31773)Success in time 0.02 s
%------------------------------------------------------------------------------