TSTP Solution File: SEU239+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU239+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --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 18:32:46 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 80 ( 11 unt; 0 def)
% Number of atoms : 246 ( 12 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 278 ( 112 ~; 114 |; 30 &)
% ( 10 <=>; 11 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 93 ( 79 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f292,plain,
$false,
inference(avatar_sat_refutation,[],[f145,f154,f159,f247,f291]) ).
fof(f291,plain,
( spl9_2
| ~ spl9_4 ),
inference(avatar_contradiction_clause,[],[f290]) ).
fof(f290,plain,
( $false
| spl9_2
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f289,f270]) ).
fof(f270,plain,
( ~ is_reflexive_in(sK6,set_union2(relation_dom(sK6),relation_rng(sK6)))
| spl9_2 ),
inference(subsumption_resolution,[],[f269,f144]) ).
fof(f144,plain,
( ~ reflexive(sK6)
| spl9_2 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f142,plain,
( spl9_2
<=> reflexive(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f269,plain,
( ~ is_reflexive_in(sK6,set_union2(relation_dom(sK6),relation_rng(sK6)))
| reflexive(sK6) ),
inference(subsumption_resolution,[],[f234,f122]) ).
fof(f122,plain,
relation(sK6),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
( relation(sK6)
& ( ~ reflexive(sK6)
| ( ~ in(ordered_pair(sK7,sK7),sK6)
& in(sK7,relation_field(sK6)) ) )
& ( reflexive(sK6)
| ! [X2] :
( in(ordered_pair(X2,X2),sK6)
| ~ in(X2,relation_field(sK6)) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f85,f87,f86]) ).
fof(f86,plain,
( ? [X0] :
( relation(X0)
& ( ~ reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( reflexive(X0)
| ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) ) ) )
=> ( relation(sK6)
& ( ~ reflexive(sK6)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),sK6)
& in(X1,relation_field(sK6)) ) )
& ( reflexive(sK6)
| ! [X2] :
( in(ordered_pair(X2,X2),sK6)
| ~ in(X2,relation_field(sK6)) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f87,plain,
( ? [X1] :
( ~ in(ordered_pair(X1,X1),sK6)
& in(X1,relation_field(sK6)) )
=> ( ~ in(ordered_pair(sK7,sK7),sK6)
& in(sK7,relation_field(sK6)) ) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
? [X0] :
( relation(X0)
& ( ~ reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( reflexive(X0)
| ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) ) ) ),
inference(rectify,[],[f84]) ).
fof(f84,plain,
? [X0] :
( relation(X0)
& ( ~ reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( reflexive(X0)
| ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) ) ) ),
inference(flattening,[],[f83]) ).
fof(f83,plain,
? [X0] :
( relation(X0)
& ( ~ reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( reflexive(X0)
| ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) ) ) ),
inference(nnf_transformation,[],[f55]) ).
fof(f55,plain,
? [X0] :
( relation(X0)
& ( ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) )
<~> reflexive(X0) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) )
<=> reflexive(X0) ) ),
inference(negated_conjecture,[],[f25]) ).
fof(f25,conjecture,
! [X0] :
( relation(X0)
=> ( ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) )
<=> reflexive(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_wellord1) ).
fof(f234,plain,
( ~ relation(sK6)
| reflexive(sK6)
| ~ is_reflexive_in(sK6,set_union2(relation_dom(sK6),relation_rng(sK6))) ),
inference(superposition,[],[f100,f226]) ).
fof(f226,plain,
set_union2(relation_dom(sK6),relation_rng(sK6)) = relation_field(sK6),
inference(resolution,[],[f131,f122]) ).
fof(f131,plain,
! [X0] :
( ~ relation(X0)
| relation_field(X0) = set_union2(relation_dom(X0),relation_rng(X0)) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0] :
( relation_field(X0) = set_union2(relation_dom(X0),relation_rng(X0))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( relation(X0)
=> relation_field(X0) = set_union2(relation_dom(X0),relation_rng(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_relat_1) ).
fof(f100,plain,
! [X0] :
( ~ is_reflexive_in(X0,relation_field(X0))
| reflexive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0] :
( ~ relation(X0)
| ( ( reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0)) )
& ( is_reflexive_in(X0,relation_field(X0))
| ~ reflexive(X0) ) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0] :
( ~ relation(X0)
| ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_relat_2) ).
fof(f289,plain,
( is_reflexive_in(sK6,set_union2(relation_dom(sK6),relation_rng(sK6)))
| spl9_2
| ~ spl9_4 ),
inference(resolution,[],[f288,f277]) ).
fof(f277,plain,
( in(unordered_pair(singleton(sK3(sK6,set_union2(relation_dom(sK6),relation_rng(sK6)))),unordered_pair(sK3(sK6,set_union2(relation_dom(sK6),relation_rng(sK6))),sK3(sK6,set_union2(relation_dom(sK6),relation_rng(sK6))))),sK6)
| spl9_2
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f272,f270]) ).
fof(f272,plain,
( in(unordered_pair(singleton(sK3(sK6,set_union2(relation_dom(sK6),relation_rng(sK6)))),unordered_pair(sK3(sK6,set_union2(relation_dom(sK6),relation_rng(sK6))),sK3(sK6,set_union2(relation_dom(sK6),relation_rng(sK6))))),sK6)
| is_reflexive_in(sK6,set_union2(relation_dom(sK6),relation_rng(sK6)))
| ~ spl9_4 ),
inference(resolution,[],[f266,f218]) ).
fof(f218,plain,
! [X3] :
( in(sK3(sK6,X3),X3)
| is_reflexive_in(sK6,X3) ),
inference(resolution,[],[f112,f122]) ).
fof(f112,plain,
! [X0,X1] :
( ~ relation(X0)
| is_reflexive_in(X0,X1)
| in(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ( ~ in(ordered_pair(sK3(X0,X1),sK3(X0,X1)),X0)
& in(sK3(X0,X1),X1) ) )
& ( ! [X3] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f76,f77]) ).
fof(f77,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) )
=> ( ~ in(ordered_pair(sK3(X0,X1),sK3(X0,X1)),X0)
& in(sK3(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f76,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) ) )
& ( ! [X3] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(rectify,[],[f75]) ).
fof(f75,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0] :
( ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,X1) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( ! [X2] :
( in(X2,X1)
=> in(ordered_pair(X2,X2),X0) )
<=> is_reflexive_in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_2) ).
fof(f266,plain,
( ! [X2] :
( ~ in(X2,set_union2(relation_dom(sK6),relation_rng(sK6)))
| in(unordered_pair(singleton(X2),unordered_pair(X2,X2)),sK6) )
| ~ spl9_4 ),
inference(forward_demodulation,[],[f158,f226]) ).
fof(f158,plain,
( ! [X2] :
( ~ in(X2,relation_field(sK6))
| in(unordered_pair(singleton(X2),unordered_pair(X2,X2)),sK6) )
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f157,plain,
( spl9_4
<=> ! [X2] :
( ~ in(X2,relation_field(sK6))
| in(unordered_pair(singleton(X2),unordered_pair(X2,X2)),sK6) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f288,plain,
! [X3] :
( ~ in(unordered_pair(singleton(sK3(sK6,X3)),unordered_pair(sK3(sK6,X3),sK3(sK6,X3))),sK6)
| is_reflexive_in(sK6,X3) ),
inference(resolution,[],[f146,f122]) ).
fof(f146,plain,
! [X0,X1] :
( ~ relation(X0)
| is_reflexive_in(X0,X1)
| ~ in(unordered_pair(singleton(sK3(X0,X1)),unordered_pair(sK3(X0,X1),sK3(X0,X1))),X0) ),
inference(forward_demodulation,[],[f132,f128]) ).
fof(f128,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f92]) ).
fof(f92,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f38]) ).
fof(f38,plain,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f132,plain,
! [X0,X1] :
( ~ in(unordered_pair(unordered_pair(sK3(X0,X1),sK3(X0,X1)),singleton(sK3(X0,X1))),X0)
| is_reflexive_in(X0,X1)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f113,f96]) ).
fof(f96,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X1,X0] : unordered_pair(unordered_pair(X1,X0),singleton(X1)) = ordered_pair(X1,X0),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f113,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| ~ in(ordered_pair(sK3(X0,X1),sK3(X0,X1)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f247,plain,
( ~ spl9_1
| ~ spl9_2
| spl9_3 ),
inference(avatar_contradiction_clause,[],[f246]) ).
fof(f246,plain,
( $false
| ~ spl9_1
| ~ spl9_2
| spl9_3 ),
inference(subsumption_resolution,[],[f245,f153]) ).
fof(f153,plain,
( ~ in(unordered_pair(singleton(sK7),unordered_pair(sK7,sK7)),sK6)
| spl9_3 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f151,plain,
( spl9_3
<=> in(unordered_pair(singleton(sK7),unordered_pair(sK7,sK7)),sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).
fof(f245,plain,
( in(unordered_pair(singleton(sK7),unordered_pair(sK7,sK7)),sK6)
| ~ spl9_1
| ~ spl9_2 ),
inference(resolution,[],[f241,f230]) ).
fof(f230,plain,
( in(sK7,set_union2(relation_dom(sK6),relation_rng(sK6)))
| ~ spl9_1 ),
inference(backward_demodulation,[],[f140,f226]) ).
fof(f140,plain,
( in(sK7,relation_field(sK6))
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f138,plain,
( spl9_1
<=> in(sK7,relation_field(sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f241,plain,
( ! [X1] :
( ~ in(X1,set_union2(relation_dom(sK6),relation_rng(sK6)))
| in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),sK6) )
| ~ spl9_2 ),
inference(subsumption_resolution,[],[f239,f122]) ).
fof(f239,plain,
( ! [X1] :
( ~ relation(sK6)
| ~ in(X1,set_union2(relation_dom(sK6),relation_rng(sK6)))
| in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),sK6) )
| ~ spl9_2 ),
inference(resolution,[],[f148,f229]) ).
fof(f229,plain,
( is_reflexive_in(sK6,set_union2(relation_dom(sK6),relation_rng(sK6)))
| ~ spl9_2 ),
inference(backward_demodulation,[],[f210,f226]) ).
fof(f210,plain,
( is_reflexive_in(sK6,relation_field(sK6))
| ~ spl9_2 ),
inference(subsumption_resolution,[],[f209,f122]) ).
fof(f209,plain,
( ~ relation(sK6)
| is_reflexive_in(sK6,relation_field(sK6))
| ~ spl9_2 ),
inference(resolution,[],[f143,f99]) ).
fof(f99,plain,
! [X0] :
( ~ reflexive(X0)
| is_reflexive_in(X0,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f143,plain,
( reflexive(sK6)
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f148,plain,
! [X3,X0,X1] :
( ~ is_reflexive_in(X0,X1)
| ~ in(X3,X1)
| in(unordered_pair(singleton(X3),unordered_pair(X3,X3)),X0)
| ~ relation(X0) ),
inference(forward_demodulation,[],[f133,f128]) ).
fof(f133,plain,
! [X3,X0,X1] :
( ~ is_reflexive_in(X0,X1)
| ~ in(X3,X1)
| ~ relation(X0)
| in(unordered_pair(unordered_pair(X3,X3),singleton(X3)),X0) ),
inference(definition_unfolding,[],[f111,f96]) ).
fof(f111,plain,
! [X3,X0,X1] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1)
| ~ is_reflexive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f159,plain,
( spl9_2
| spl9_4 ),
inference(avatar_split_clause,[],[f155,f157,f142]) ).
fof(f155,plain,
! [X2] :
( ~ in(X2,relation_field(sK6))
| reflexive(sK6)
| in(unordered_pair(singleton(X2),unordered_pair(X2,X2)),sK6) ),
inference(forward_demodulation,[],[f136,f128]) ).
fof(f136,plain,
! [X2] :
( reflexive(sK6)
| in(unordered_pair(unordered_pair(X2,X2),singleton(X2)),sK6)
| ~ in(X2,relation_field(sK6)) ),
inference(definition_unfolding,[],[f119,f96]) ).
fof(f119,plain,
! [X2] :
( reflexive(sK6)
| in(ordered_pair(X2,X2),sK6)
| ~ in(X2,relation_field(sK6)) ),
inference(cnf_transformation,[],[f88]) ).
fof(f154,plain,
( ~ spl9_2
| ~ spl9_3 ),
inference(avatar_split_clause,[],[f149,f151,f142]) ).
fof(f149,plain,
( ~ in(unordered_pair(singleton(sK7),unordered_pair(sK7,sK7)),sK6)
| ~ reflexive(sK6) ),
inference(forward_demodulation,[],[f135,f128]) ).
fof(f135,plain,
( ~ in(unordered_pair(unordered_pair(sK7,sK7),singleton(sK7)),sK6)
| ~ reflexive(sK6) ),
inference(definition_unfolding,[],[f121,f96]) ).
fof(f121,plain,
( ~ reflexive(sK6)
| ~ in(ordered_pair(sK7,sK7),sK6) ),
inference(cnf_transformation,[],[f88]) ).
fof(f145,plain,
( spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f120,f142,f138]) ).
fof(f120,plain,
( ~ reflexive(sK6)
| in(sK7,relation_field(sK6)) ),
inference(cnf_transformation,[],[f88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU239+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 14:53:40 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.49 % (16884)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.20/0.50 % (16892)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.20/0.51 % (16876)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.20/0.52 % (16892)First to succeed.
% 0.20/0.52 % (16871)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.20/0.53 % (16876)Instruction limit reached!
% 0.20/0.53 % (16876)------------------------------
% 0.20/0.53 % (16876)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (16876)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (16876)Termination reason: Unknown
% 0.20/0.53 % (16876)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (16876)Memory used [KB]: 5500
% 0.20/0.53 % (16876)Time elapsed: 0.092 s
% 0.20/0.53 % (16876)Instructions burned: 7 (million)
% 0.20/0.53 % (16876)------------------------------
% 0.20/0.53 % (16876)------------------------------
% 0.20/0.54 % (16885)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.20/0.54 % (16869)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/191324Mi)
% 0.20/0.54 % (16870)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.54 % (16877)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.55 % (16892)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55 % (16892)------------------------------
% 0.20/0.55 % (16892)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (16892)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (16892)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (16892)Memory used [KB]: 5628
% 0.20/0.55 % (16892)Time elapsed: 0.112 s
% 0.20/0.55 % (16892)Instructions burned: 9 (million)
% 0.20/0.55 % (16892)------------------------------
% 0.20/0.55 % (16892)------------------------------
% 0.20/0.55 % (16868)Success in time 0.202 s
%------------------------------------------------------------------------------