TSTP Solution File: SEU144+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU144+2 : 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 : n012.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:07 EDT 2022
% Result : Theorem 1.90s 0.58s
% Output : Refutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of formulae : 84 ( 12 unt; 0 def)
% Number of atoms : 292 ( 71 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 332 ( 124 ~; 135 |; 51 &)
% ( 13 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 136 ( 115 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1059,plain,
$false,
inference(avatar_sat_refutation,[],[f361,f362,f660,f1058]) ).
fof(f1058,plain,
( ~ spl15_1
| spl15_2 ),
inference(avatar_contradiction_clause,[],[f1057]) ).
fof(f1057,plain,
( $false
| ~ spl15_1
| spl15_2 ),
inference(subsumption_resolution,[],[f1056,f359]) ).
fof(f359,plain,
( ~ subset(sF14,sK2)
| spl15_2 ),
inference(avatar_component_clause,[],[f358]) ).
fof(f358,plain,
( spl15_2
<=> subset(sF14,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_2])]) ).
fof(f1056,plain,
( subset(sF14,sK2)
| ~ spl15_1
| spl15_2 ),
inference(subsumption_resolution,[],[f1054,f356]) ).
fof(f356,plain,
( in(sK3,sK2)
| ~ spl15_1 ),
inference(avatar_component_clause,[],[f354]) ).
fof(f354,plain,
( spl15_1
<=> in(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_1])]) ).
fof(f1054,plain,
( ~ in(sK3,sK2)
| subset(sF14,sK2)
| spl15_2 ),
inference(superposition,[],[f267,f1035]) ).
fof(f1035,plain,
( sK8(sF14,sK2) = sK3
| spl15_2 ),
inference(resolution,[],[f625,f359]) ).
fof(f625,plain,
! [X7] :
( subset(sF14,X7)
| sK8(sF14,X7) = sK3 ),
inference(resolution,[],[f266,f529]) ).
fof(f529,plain,
! [X0] :
( ~ in(X0,sF14)
| sK3 = X0 ),
inference(superposition,[],[f344,f347]) ).
fof(f347,plain,
unordered_pair(sK3,sK3) = sF14,
introduced(function_definition,[]) ).
fof(f344,plain,
! [X2,X0] :
( ~ in(X2,unordered_pair(X0,X0))
| X0 = X2 ),
inference(equality_resolution,[],[f324]) ).
fof(f324,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f291,f280]) ).
fof(f280,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f60]) ).
fof(f60,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f291,plain,
! [X2,X0,X1] :
( X0 = X2
| ~ in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f194]) ).
fof(f194,plain,
! [X0,X1] :
( ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ( ( sK11(X0,X1) != X0
| ~ in(sK11(X0,X1),X1) )
& ( sK11(X0,X1) = X0
| in(sK11(X0,X1),X1) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f192,f193]) ).
fof(f193,plain,
! [X0,X1] :
( ? [X3] :
( ( X0 != X3
| ~ in(X3,X1) )
& ( X0 = X3
| in(X3,X1) ) )
=> ( ( sK11(X0,X1) != X0
| ~ in(sK11(X0,X1),X1) )
& ( sK11(X0,X1) = X0
| in(sK11(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f192,plain,
! [X0,X1] :
( ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ? [X3] :
( ( X0 != X3
| ~ in(X3,X1) )
& ( X0 = X3
| in(X3,X1) ) ) ) ),
inference(rectify,[],[f191]) ).
fof(f191,plain,
! [X0,X1] :
( ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 )
& ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
<=> X0 = X2 )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f266,plain,
! [X0,X1] :
( in(sK8(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f179]) ).
fof(f179,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( ~ in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f177,f178]) ).
fof(f178,plain,
! [X0,X1] :
( ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) )
=> ( ~ in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f177,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) ) ) ),
inference(rectify,[],[f176]) ).
fof(f176,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f267,plain,
! [X0,X1] :
( ~ in(sK8(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f179]) ).
fof(f660,plain,
( spl15_1
| ~ spl15_2 ),
inference(avatar_contradiction_clause,[],[f659]) ).
fof(f659,plain,
( $false
| spl15_1
| ~ spl15_2 ),
inference(subsumption_resolution,[],[f658,f355]) ).
fof(f355,plain,
( ~ in(sK3,sK2)
| spl15_1 ),
inference(avatar_component_clause,[],[f354]) ).
fof(f658,plain,
( in(sK3,sK2)
| ~ spl15_2 ),
inference(forward_demodulation,[],[f657,f535]) ).
fof(f535,plain,
sK6(sF14) = sK3,
inference(subsumption_resolution,[],[f532,f373]) ).
fof(f373,plain,
empty_set != sF14,
inference(superposition,[],[f309,f347]) ).
fof(f309,plain,
! [X0] : empty_set != unordered_pair(X0,X0),
inference(definition_unfolding,[],[f221,f280]) ).
fof(f221,plain,
! [X0] : singleton(X0) != empty_set,
inference(cnf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] : singleton(X0) != empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(f532,plain,
( sK6(sF14) = sK3
| empty_set = sF14 ),
inference(resolution,[],[f529,f256]) ).
fof(f256,plain,
! [X0] :
( in(sK6(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f169]) ).
fof(f169,plain,
! [X0] :
( ( empty_set = X0
| in(sK6(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f167,f168]) ).
fof(f168,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK6(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f167,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f166]) ).
fof(f166,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f657,plain,
( in(sK6(sF14),sK2)
| ~ spl15_2 ),
inference(subsumption_resolution,[],[f651,f373]) ).
fof(f651,plain,
( in(sK6(sF14),sK2)
| empty_set = sF14
| ~ spl15_2 ),
inference(resolution,[],[f649,f256]) ).
fof(f649,plain,
( ! [X19] :
( ~ in(X19,sF14)
| in(X19,sK2) )
| ~ spl15_2 ),
inference(superposition,[],[f333,f543]) ).
fof(f543,plain,
( set_union2(sF14,sK2) = sK2
| ~ spl15_2 ),
inference(resolution,[],[f352,f360]) ).
fof(f360,plain,
( subset(sF14,sK2)
| ~ spl15_2 ),
inference(avatar_component_clause,[],[f358]) ).
fof(f352,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| set_union2(X1,X0) = X0 ),
inference(forward_demodulation,[],[f215,f216]) ).
fof(f216,plain,
! [X0,X1] : set_union2(X1,X0) = set_union2(X1,set_difference(X0,X1)),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0,X1] : set_union2(X1,X0) = set_union2(X1,set_difference(X0,X1)),
inference(rectify,[],[f49]) ).
fof(f49,axiom,
! [X1,X0] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_xboole_1) ).
fof(f215,plain,
! [X0,X1] :
( set_union2(X1,set_difference(X0,X1)) = X0
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0,X1] :
( set_union2(X1,set_difference(X0,X1)) = X0
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f94]) ).
fof(f94,plain,
! [X1,X0] :
( subset(X1,X0)
=> set_union2(X1,set_difference(X0,X1)) = X0 ),
inference(rectify,[],[f54]) ).
fof(f54,axiom,
! [X1,X0] :
( subset(X0,X1)
=> set_union2(X0,set_difference(X1,X0)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t45_xboole_1) ).
fof(f333,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X1,X0))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f247]) ).
fof(f247,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X1,X0) != X2 ),
inference(cnf_transformation,[],[f164]) ).
fof(f164,plain,
! [X0,X1,X2] :
( ( set_union2(X1,X0) = X2
| ( ( ~ in(sK5(X0,X1,X2),X2)
| ( ~ in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X0) ) )
& ( in(sK5(X0,X1,X2),X2)
| in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0) ) ) )
& ( ! [X4] :
( ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) )
& ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) ) )
| set_union2(X1,X0) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f162,f163]) ).
fof(f163,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) ) )
=> ( ( ~ in(sK5(X0,X1,X2),X2)
| ( ~ in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X0) ) )
& ( in(sK5(X0,X1,X2),X2)
| in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
! [X0,X1,X2] :
( ( set_union2(X1,X0) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) ) ) )
& ( ! [X4] :
( ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) )
& ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) ) )
| set_union2(X1,X0) != X2 ) ),
inference(rectify,[],[f161]) ).
fof(f161,plain,
! [X0,X2,X1] :
( ( set_union2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) ) )
| set_union2(X2,X0) != X1 ) ),
inference(flattening,[],[f160]) ).
fof(f160,plain,
! [X0,X2,X1] :
( ( set_union2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) ) )
| set_union2(X2,X0) != X1 ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f79,plain,
! [X0,X2,X1] :
( set_union2(X2,X0) = X1
<=> ! [X3] :
( ( in(X3,X2)
| in(X3,X0) )
<=> in(X3,X1) ) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X1,X2,X0] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f362,plain,
( ~ spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f348,f358,f354]) ).
fof(f348,plain,
( ~ subset(sF14,sK2)
| ~ in(sK3,sK2) ),
inference(definition_folding,[],[f307,f347]) ).
fof(f307,plain,
( ~ in(sK3,sK2)
| ~ subset(unordered_pair(sK3,sK3),sK2) ),
inference(definition_unfolding,[],[f220,f280]) ).
fof(f220,plain,
( ~ in(sK3,sK2)
| ~ subset(singleton(sK3),sK2) ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
( ( ~ in(sK3,sK2)
| ~ subset(singleton(sK3),sK2) )
& ( in(sK3,sK2)
| subset(singleton(sK3),sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f141,f142]) ).
fof(f142,plain,
( ? [X0,X1] :
( ( ~ in(X1,X0)
| ~ subset(singleton(X1),X0) )
& ( in(X1,X0)
| subset(singleton(X1),X0) ) )
=> ( ( ~ in(sK3,sK2)
| ~ subset(singleton(sK3),sK2) )
& ( in(sK3,sK2)
| subset(singleton(sK3),sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
? [X0,X1] :
( ( ~ in(X1,X0)
| ~ subset(singleton(X1),X0) )
& ( in(X1,X0)
| subset(singleton(X1),X0) ) ),
inference(rectify,[],[f140]) ).
fof(f140,plain,
? [X1,X0] :
( ( ~ in(X0,X1)
| ~ subset(singleton(X0),X1) )
& ( in(X0,X1)
| subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f106]) ).
fof(f106,plain,
? [X1,X0] :
( subset(singleton(X0),X1)
<~> in(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X1,X0] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X1,X0] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f361,plain,
( spl15_1
| spl15_2 ),
inference(avatar_split_clause,[],[f349,f358,f354]) ).
fof(f349,plain,
( subset(sF14,sK2)
| in(sK3,sK2) ),
inference(definition_folding,[],[f308,f347]) ).
fof(f308,plain,
( in(sK3,sK2)
| subset(unordered_pair(sK3,sK3),sK2) ),
inference(definition_unfolding,[],[f219,f280]) ).
fof(f219,plain,
( in(sK3,sK2)
| subset(singleton(sK3),sK2) ),
inference(cnf_transformation,[],[f143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU144+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/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.13/0.32 % Computer : n012.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue Aug 30 14:42:50 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.49 % (15113)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.18/0.53 % (15105)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.54 % (15115)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.18/0.55 % (15124)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 (2999ds/467Mi)
% 0.18/0.55 % (15129)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.18/0.55 % (15107)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.55 % (15114)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.55 % (15116)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 (2999ds/75Mi)
% 0.18/0.56 % (15108)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.56 TRYING [1]
% 0.18/0.57 % (15123)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.18/0.57 % (15106)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.18/0.57 TRYING [2]
% 0.18/0.58 % (15108)Instruction limit reached!
% 0.18/0.58 % (15108)------------------------------
% 0.18/0.58 % (15108)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.58 % (15108)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.58 % (15108)Termination reason: Unknown
% 0.18/0.58 % (15108)Termination phase: Saturation
% 0.18/0.58
% 0.18/0.58 % (15108)Memory used [KB]: 5628
% 0.18/0.58 % (15108)Time elapsed: 0.100 s
% 0.18/0.58 % (15108)Instructions burned: 8 (million)
% 0.18/0.58 % (15108)------------------------------
% 0.18/0.58 % (15108)------------------------------
% 0.18/0.58 TRYING [3]
% 1.90/0.58 % (15113)First to succeed.
% 1.90/0.58 % (15113)Refutation found. Thanks to Tanya!
% 1.90/0.58 % SZS status Theorem for theBenchmark
% 1.90/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.90/0.58 % (15113)------------------------------
% 1.90/0.58 % (15113)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.90/0.58 % (15113)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.90/0.58 % (15113)Termination reason: Refutation
% 1.90/0.58
% 1.90/0.58 % (15113)Memory used [KB]: 5884
% 1.90/0.58 % (15113)Time elapsed: 0.202 s
% 1.90/0.58 % (15113)Instructions burned: 29 (million)
% 1.90/0.58 % (15113)------------------------------
% 1.90/0.58 % (15113)------------------------------
% 1.90/0.58 % (15100)Success in time 0.252 s
%------------------------------------------------------------------------------