%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU187+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:52:18 PM UTC 2026
% Result : Theorem 0.38s 0.49s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 19
% Syntax : Number of formulae : 96 ( 22 unt; 5 def)
% Number of atoms : 221 ( 43 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 233 ( 108 ~; 98 |; 5 &)
% ( 14 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 83 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f11,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f19,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
fof(f23,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( X1 = relation_rng(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X3,X2),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_relat_1) ).
fof(f25,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f49,axiom,
! [X0,X1] :
( ( relation(X0)
& relation(X1) )
=> relation(relation_composition(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_relat_1) ).
fof(f57,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f64,axiom,
( empty(empty_set)
& relation(empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_relat_1) ).
fof(f66,axiom,
! [X0] :
( ( ~ empty(X0)
& relation(X0) )
=> ~ empty(relation_dom(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc5_relat_1) ).
fof(f131,axiom,
! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f134,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( relation(X1)
=> subset(relation_dom(relation_composition(X0,X1)),relation_dom(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t44_relat_1) ).
fof(f151,conjecture,
( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_relat_1) ).
fof(f152,negated_conjecture,
~ ( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
inference(negated_conjecture,[status(cth)],[f151]) ).
fof(f156,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f157,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f187,plain,
! [X0] :
( ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f188,plain,
! [X0] :
( ! [X1] :
( X1 = relation_rng(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X3,X2),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f198,plain,
! [X0,X1] :
( relation(relation_composition(X0,X1))
| ~ relation(X0)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f199,plain,
! [X0,X1] :
( relation(relation_composition(X0,X1))
| ~ relation(X0)
| ~ relation(X1) ),
inference(flattening,[],[f198]) ).
fof(f211,plain,
! [X0] :
( ~ empty(relation_dom(X0))
| empty(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f66]) ).
fof(f212,plain,
! [X0] :
( ~ empty(relation_dom(X0))
| empty(X0)
| ~ relation(X0) ),
inference(flattening,[],[f211]) ).
fof(f260,plain,
! [X0] :
( X0 = empty_set
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f131]) ).
fof(f262,plain,
! [X0] :
( ! [X1] :
( subset(relation_dom(relation_composition(X0,X1)),relation_dom(X0))
| ~ relation(X1) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f134]) ).
fof(f286,plain,
( empty_set != relation_dom(empty_set)
| empty_set != relation_rng(empty_set) ),
inference(ennf_transformation,[],[f152]) ).
fof(f290,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f157]) ).
fof(f304,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f325,plain,
! [X0] :
( in(sK7(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f326,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f365,plain,
! [X2,X0,X1] :
( ~ relation(X0)
| in(ordered_pair(X2,sK19(X0,X2)),X0)
| ~ in(X2,X1)
| relation_dom(X0) != X1 ),
inference(cnf_transformation,[],[f187]) ).
fof(f382,plain,
! [X2,X0,X1] :
( ~ relation(X0)
| in(ordered_pair(sK26(X0,X2),X2),X0)
| ~ in(X2,X1)
| relation_rng(X0) != X1 ),
inference(cnf_transformation,[],[f188]) ).
fof(f386,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f25]) ).
fof(f409,plain,
! [X0,X1] :
( relation(relation_composition(X0,X1))
| ~ relation(X0)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f199]) ).
fof(f416,plain,
empty(empty_set),
inference(cnf_transformation,[],[f57]) ).
fof(f423,plain,
relation(empty_set),
inference(cnf_transformation,[],[f64]) ).
fof(f426,plain,
! [X0] :
( ~ empty(relation_dom(X0))
| empty(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f212]) ).
fof(f522,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f260]) ).
fof(f526,plain,
! [X0,X1] :
( subset(relation_dom(relation_composition(X0,X1)),relation_dom(X0))
| ~ relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f262]) ).
fof(f544,plain,
( empty_set != relation_rng(empty_set)
| empty_set != relation_dom(empty_set) ),
inference(cnf_transformation,[],[f286]) ).
fof(f549,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f156]) ).
fof(f550,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f290]) ).
fof(f566,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f386,f549]) ).
fof(f586,plain,
! [X2,X0,X1] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(X2,sK19(X0,X2)),unordered_pair(X2,X2)),X0)
| ~ in(X2,X1)
| relation_dom(X0) != X1 ),
inference(definition_unfolding,[],[f365,f566]) ).
fof(f590,plain,
! [X2,X0,X1] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(sK26(X0,X2),X2),unordered_pair(sK26(X0,X2),sK26(X0,X2))),X0)
| ~ in(X2,X1)
| relation_rng(X0) != X1 ),
inference(definition_unfolding,[],[f382,f566]) ).
fof(f661,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f326]) ).
fof(f680,plain,
! [X2,X0] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(X2,sK19(X0,X2)),unordered_pair(X2,X2)),X0)
| ~ in(X2,relation_dom(X0)) ),
inference(equality_resolution,[],[f586]) ).
fof(f688,plain,
! [X2,X0] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(sK26(X0,X2),X2),unordered_pair(sK26(X0,X2),sK26(X0,X2))),X0)
| ~ in(X2,relation_rng(X0)) ),
inference(equality_resolution,[],[f590]) ).
fof(f717,definition,
( spl51_1
<=> empty_set = relation_dom(empty_set) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f718,plain,
( empty_set = relation_dom(empty_set)
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f717]) ).
fof(f721,definition,
( spl51_2
<=> empty_set = relation_rng(empty_set) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f723,plain,
( empty_set != relation_rng(empty_set)
| spl51_2 ),
inference(avatar_component_clause,[],[f721]) ).
fof(f724,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f544,f721,f717]) ).
fof(f2268,plain,
! [X2,X0] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,sK19(X0,X2))),X0)
| ~ in(X2,relation_dom(X0)) ),
inference(forward_demodulation,[],[f680,f304]) ).
fof(f2285,plain,
! [X0] :
( in(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,sK19(empty_set,X0))),empty_set)
| ~ in(X0,relation_dom(empty_set)) ),
inference(resolution,[],[f2268,f423]) ).
fof(f2301,plain,
! [X0] : ~ in(X0,relation_dom(empty_set)),
inference(forward_subsumption_resolution,[],[f2285,f661]) ).
fof(f2316,plain,
empty_set = relation_dom(empty_set),
inference(resolution,[],[f2301,f325]) ).
fof(f2327,plain,
spl51_1,
inference(avatar_split_clause,[],[f2316,f717]) ).
fof(f2338,plain,
( ! [X0] :
( subset(relation_dom(relation_composition(empty_set,X0)),empty_set)
| ~ relation(X0)
| ~ relation(empty_set) )
| ~ spl51_1 ),
inference(superposition,[],[f526,f718]) ).
fof(f2343,plain,
( ! [X0] :
( subset(relation_dom(relation_composition(empty_set,X0)),empty_set)
| ~ relation(X0) )
| ~ spl51_1 ),
inference(forward_subsumption_resolution,[],[f2338,f423]) ).
fof(f2351,plain,
( ! [X0] :
( ~ relation(X0)
| empty_set = relation_dom(relation_composition(empty_set,X0)) )
| ~ spl51_1 ),
inference(resolution,[],[f2343,f522]) ).
fof(f2373,plain,
( empty_set = relation_dom(relation_composition(empty_set,empty_set))
| ~ spl51_1 ),
inference(resolution,[],[f2351,f423]) ).
fof(f2513,plain,
( ~ empty(empty_set)
| empty(relation_composition(empty_set,empty_set))
| ~ relation(relation_composition(empty_set,empty_set))
| ~ spl51_1 ),
inference(superposition,[],[f426,f2373]) ).
fof(f2523,definition,
( spl51_15
<=> relation(relation_composition(empty_set,empty_set)) ),
introduced(definition,[new_symbols(definition,[spl51_15])],[avatar_definition]) ).
fof(f2524,plain,
( relation(relation_composition(empty_set,empty_set))
| ~ spl51_15 ),
inference(avatar_component_clause,[],[f2523]) ).
fof(f2525,plain,
( ~ relation(relation_composition(empty_set,empty_set))
| spl51_15 ),
inference(avatar_component_clause,[],[f2523]) ).
fof(f2543,plain,
( empty(relation_composition(empty_set,empty_set))
| ~ relation(relation_composition(empty_set,empty_set))
| ~ spl51_1 ),
inference(forward_subsumption_resolution,[],[f2513,f416]) ).
fof(f2549,definition,
( spl51_21
<=> empty(relation_composition(empty_set,empty_set)) ),
introduced(definition,[new_symbols(definition,[spl51_21])],[avatar_definition]) ).
fof(f2551,plain,
( empty(relation_composition(empty_set,empty_set))
| ~ spl51_21 ),
inference(avatar_component_clause,[],[f2549]) ).
fof(f2552,plain,
( ~ spl51_15
| spl51_21
| ~ spl51_1 ),
inference(avatar_split_clause,[],[f2543,f717,f2549,f2523]) ).
fof(f2553,plain,
( ~ relation(empty_set)
| ~ relation(empty_set)
| spl51_15 ),
inference(resolution,[],[f2525,f409]) ).
fof(f2555,plain,
( ~ relation(empty_set)
| spl51_15 ),
inference(duplicate_literal_removal,[],[f2553]) ).
fof(f2556,plain,
( $false
| spl51_15 ),
inference(forward_subsumption_resolution,[],[f2555,f423]) ).
fof(f2557,plain,
spl51_15,
inference(avatar_contradiction_clause,[],[f2556]) ).
fof(f2734,definition,
( spl51_24
<=> empty_set = relation_composition(empty_set,empty_set) ),
introduced(definition,[new_symbols(definition,[spl51_24])],[avatar_definition]) ).
fof(f2736,plain,
( empty_set = relation_composition(empty_set,empty_set)
| ~ spl51_24 ),
inference(avatar_component_clause,[],[f2734]) ).
fof(f2827,plain,
( empty_set = relation_composition(empty_set,empty_set)
| ~ spl51_21 ),
inference(resolution,[],[f2551,f550]) ).
fof(f2829,plain,
( spl51_24
| ~ spl51_21 ),
inference(avatar_split_clause,[],[f2827,f2549,f2734]) ).
fof(f2982,plain,
! [X2,X0] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(X2,sK26(X0,X2)),unordered_pair(sK26(X0,X2),sK26(X0,X2))),X0)
| ~ in(X2,relation_rng(X0)) ),
inference(forward_demodulation,[],[f688,f304]) ).
fof(f2991,plain,
( ! [X0] :
( in(unordered_pair(unordered_pair(X0,sK26(relation_composition(empty_set,empty_set),X0)),unordered_pair(sK26(relation_composition(empty_set,empty_set),X0),sK26(relation_composition(empty_set,empty_set),X0))),relation_composition(empty_set,empty_set))
| ~ in(X0,relation_rng(relation_composition(empty_set,empty_set))) )
| ~ spl51_15 ),
inference(resolution,[],[f2982,f2524]) ).
fof(f3001,plain,
( ! [X0] :
( in(unordered_pair(unordered_pair(X0,sK26(empty_set,X0)),unordered_pair(sK26(empty_set,X0),sK26(empty_set,X0))),empty_set)
| ~ in(X0,relation_rng(relation_composition(empty_set,empty_set))) )
| ~ spl51_15
| ~ spl51_24 ),
inference(forward_demodulation,[],[f2991,f2736]) ).
fof(f3009,plain,
( ! [X0] : ~ in(X0,relation_rng(relation_composition(empty_set,empty_set)))
| ~ spl51_15
| ~ spl51_24 ),
inference(forward_subsumption_resolution,[],[f3001,f661]) ).
fof(f3014,plain,
( ! [X0] : ~ in(X0,relation_rng(empty_set))
| ~ spl51_15
| ~ spl51_24 ),
inference(forward_demodulation,[],[f3009,f2736]) ).
fof(f3019,plain,
( empty_set = relation_rng(empty_set)
| ~ spl51_15
| ~ spl51_24 ),
inference(resolution,[],[f3014,f325]) ).
fof(f3037,plain,
( $false
| spl51_2
| ~ spl51_15
| ~ spl51_24 ),
inference(forward_subsumption_resolution,[],[f3019,f723]) ).
fof(f3038,plain,
( spl51_2
| ~ spl51_15
| ~ spl51_24 ),
inference(avatar_contradiction_clause,[],[f3037]) ).
cnf(s1,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f724]) ).
cnf(s12,plain,
spl51_1,
inference(sat_conversion,[],[f2327]) ).
cnf(s20,plain,
( ~ spl51_1
| ~ spl51_15
| spl51_21 ),
inference(sat_conversion,[],[f2552]) ).
cnf(s21,plain,
spl51_15,
inference(sat_conversion,[],[f2557]) ).
cnf(s26,plain,
( ~ spl51_21
| spl51_24 ),
inference(sat_conversion,[],[f2829]) ).
cnf(s27,plain,
( spl51_2
| ~ spl51_15
| ~ spl51_24 ),
inference(sat_conversion,[],[f3038]) ).
cnf(s28,plain,
( ~ spl51_1
| spl51_21 ),
inference(rat,[],[s20,s21]) ).
cnf(s34,plain,
spl51_21,
inference(rat,[],[s28,s12]) ).
cnf(s41,plain,
spl51_24,
inference(rat,[],[s26,s34]) ).
cnf(s42,plain,
spl51_2,
inference(rat,[],[s27,s21,s41]) ).
cnf(s48,plain,
$false,
inference(rat,[],[s1,s42,s12]) ).
fof(f3040,plain,
$false,
inference(avatar_sat_refutation,[],[s48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU187+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:59:27 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.38/0.49 % (1171356)Will run a generic schedule for satisfiability detection.
% 0.38/0.49 % (1171362)% WARNING: option uhcvi not known.
% 0.38/0.49 % (1171362)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4039964929:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.38/0.49 % (1171361)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=955077118_2999 on theBenchmark for (2999ds/0Mi)
% 0.38/0.49 % (1171363)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=407550273:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.38/0.49 % (1171364)dis+10_1_sil=32000:sp=arity:random_seed=1763357703:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.38/0.49 % (1171365)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3847440222:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.38/0.49 % (1171366)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1639537004:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.38/0.49 % (1171367)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1633813580:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.38/0.49 % TRYING [1]
% 0.38/0.49 % TRYING [2]
% 0.38/0.49 % (1171362) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1171356-1171362"...
% 0.38/0.49 % (1171362)...printing done.
% 0.38/0.49 % TRYING [3]
% 0.38/0.49 % (1171362)Refutation found. Thanks to Tanya!
% 0.38/0.49 % SZS status Theorem for theBenchmark
% 0.38/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.38/0.49 % (1171362)------------------------------
% 0.38/0.49 % (1171362)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.49 % (1171362)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.49 % (1171362)CaDiCaL version: 2.1.3
% 0.38/0.49 % (1171362)Termination reason: Refutation
% 0.38/0.49 % (1171362)Time elapsed: 0.045 s
% 0.38/0.49 % (1171362)Peak memory usage: 14 MB
% 0.38/0.49 % (1171362)Instructions burned: 120 (million)
% 0.38/0.49 % (1171356)Success in time 0.082 s
% 0.38/0.49 % Vampire exiting
%------------------------------------------------------------------------------