TSTP Solution File: SEU119+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU119+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 : n025.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:31:59 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 67 ( 4 unt; 0 def)
% Number of atoms : 254 ( 40 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 317 ( 130 ~; 112 |; 62 &)
% ( 9 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 120 ( 99 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f315,plain,
$false,
inference(avatar_sat_refutation,[],[f77,f82,f88,f289,f295,f314]) ).
fof(f314,plain,
( spl7_4
| ~ spl7_1 ),
inference(avatar_split_clause,[],[f313,f70,f84]) ).
fof(f84,plain,
( spl7_4
<=> ! [X3] :
( ~ in(X3,sK4)
| ~ in(X3,sK3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f70,plain,
( spl7_1
<=> disjoint(sK4,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f313,plain,
( ! [X0] :
( ~ in(X0,sK3)
| ~ in(X0,sK4) )
| ~ spl7_1 ),
inference(subsumption_resolution,[],[f304,f65]) ).
fof(f65,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0] :
( ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 )
& ( empty_set = X0
| in(sK2(X0),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f26,f27]) ).
fof(f27,plain,
! [X0] :
( ? [X2] : in(X2,X0)
=> in(sK2(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0] :
( ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 )
& ( empty_set = X0
| ? [X2] : in(X2,X0) ) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
! [X0] :
( ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 )
& ( empty_set = X0
| ? [X1] : in(X1,X0) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( ! [X1] : ~ in(X1,X0)
<=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f304,plain,
( ! [X0] :
( ~ in(X0,sK3)
| in(X0,empty_set)
| ~ in(X0,sK4) )
| ~ spl7_1 ),
inference(superposition,[],[f66,f290]) ).
fof(f290,plain,
( empty_set = set_intersection2(sK4,sK3)
| ~ spl7_1 ),
inference(resolution,[],[f71,f55]) ).
fof(f55,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) )
& ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ) ),
inference(rectify,[],[f34]) ).
fof(f34,plain,
! [X1,X0] :
( ( set_intersection2(X1,X0) = empty_set
| ~ disjoint(X1,X0) )
& ( disjoint(X1,X0)
| set_intersection2(X1,X0) != empty_set ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( set_intersection2(X1,X0) = empty_set
<=> disjoint(X1,X0) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f71,plain,
( disjoint(sK4,sK3)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f66,plain,
! [X2,X1,X4] :
( in(X4,set_intersection2(X2,X1))
| ~ in(X4,X2)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f58]) ).
fof(f58,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X2,X1) != X0 ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( set_intersection2(X2,X1) = X0
| ( ( ~ in(sK6(X0,X1,X2),X1)
| ~ in(sK6(X0,X1,X2),X2)
| ~ in(sK6(X0,X1,X2),X0) )
& ( ( in(sK6(X0,X1,X2),X1)
& in(sK6(X0,X1,X2),X2) )
| in(sK6(X0,X1,X2),X0) ) ) )
& ( ! [X4] :
( ( in(X4,X0)
| ~ in(X4,X1)
| ~ in(X4,X2) )
& ( ( in(X4,X1)
& in(X4,X2) )
| ~ in(X4,X0) ) )
| set_intersection2(X2,X1) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f38,f39]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X2) )
| in(X3,X0) ) )
=> ( ( ~ in(sK6(X0,X1,X2),X1)
| ~ in(sK6(X0,X1,X2),X2)
| ~ in(sK6(X0,X1,X2),X0) )
& ( ( in(sK6(X0,X1,X2),X1)
& in(sK6(X0,X1,X2),X2) )
| in(sK6(X0,X1,X2),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( set_intersection2(X2,X1) = X0
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X2) )
| in(X3,X0) ) ) )
& ( ! [X4] :
( ( in(X4,X0)
| ~ in(X4,X1)
| ~ in(X4,X2) )
& ( ( in(X4,X1)
& in(X4,X2) )
| ~ in(X4,X0) ) )
| set_intersection2(X2,X1) != X0 ) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X2,X1,X0] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X2,X1,X0] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X2,X1,X0] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f295,plain,
( ~ spl7_2
| ~ spl7_3
| ~ spl7_4 ),
inference(avatar_contradiction_clause,[],[f294]) ).
fof(f294,plain,
( $false
| ~ spl7_2
| ~ spl7_3
| ~ spl7_4 ),
inference(subsumption_resolution,[],[f292,f81]) ).
fof(f81,plain,
( in(sK5,sK3)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f79,plain,
( spl7_3
<=> in(sK5,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f292,plain,
( ~ in(sK5,sK3)
| ~ spl7_2
| ~ spl7_4 ),
inference(resolution,[],[f76,f85]) ).
fof(f85,plain,
( ! [X3] :
( ~ in(X3,sK4)
| ~ in(X3,sK3) )
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f76,plain,
( in(sK5,sK4)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f74,plain,
( spl7_2
<=> in(sK5,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f289,plain,
( spl7_1
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f286,f84,f70]) ).
fof(f286,plain,
( disjoint(sK4,sK3)
| ~ spl7_4 ),
inference(trivial_inequality_removal,[],[f281]) ).
fof(f281,plain,
( empty_set != empty_set
| disjoint(sK4,sK3)
| ~ spl7_4 ),
inference(superposition,[],[f102,f275]) ).
fof(f275,plain,
( empty_set = set_intersection2(sK3,sK4)
| ~ spl7_4 ),
inference(duplicate_literal_removal,[],[f270]) ).
fof(f270,plain,
( empty_set = set_intersection2(sK3,sK4)
| empty_set = set_intersection2(sK3,sK4)
| ~ spl7_4 ),
inference(resolution,[],[f140,f111]) ).
fof(f111,plain,
! [X0,X1] :
( in(sK2(set_intersection2(X0,X1)),X0)
| set_intersection2(X0,X1) = empty_set ),
inference(resolution,[],[f68,f44]) ).
fof(f44,plain,
! [X0] :
( in(sK2(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f28]) ).
fof(f68,plain,
! [X2,X1,X4] :
( ~ in(X4,set_intersection2(X2,X1))
| in(X4,X2) ),
inference(equality_resolution,[],[f56]) ).
fof(f56,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_intersection2(X2,X1) != X0 ),
inference(cnf_transformation,[],[f40]) ).
fof(f140,plain,
( ! [X9] :
( ~ in(sK2(set_intersection2(X9,sK4)),sK3)
| empty_set = set_intersection2(X9,sK4) )
| ~ spl7_4 ),
inference(resolution,[],[f107,f85]) ).
fof(f107,plain,
! [X0,X1] :
( in(sK2(set_intersection2(X0,X1)),X1)
| set_intersection2(X0,X1) = empty_set ),
inference(resolution,[],[f67,f44]) ).
fof(f67,plain,
! [X2,X1,X4] :
( ~ in(X4,set_intersection2(X2,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f57]) ).
fof(f57,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X2,X1) != X0 ),
inference(cnf_transformation,[],[f40]) ).
fof(f102,plain,
! [X2,X1] :
( empty_set != set_intersection2(X2,X1)
| disjoint(X1,X2) ),
inference(superposition,[],[f54,f62]) ).
fof(f62,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f54,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f88,plain,
( spl7_1
| spl7_4 ),
inference(avatar_split_clause,[],[f47,f84,f70]) ).
fof(f47,plain,
! [X3] :
( ~ in(X3,sK4)
| ~ in(X3,sK3)
| disjoint(sK4,sK3) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
( ( in(sK5,sK3)
& in(sK5,sK4)
& disjoint(sK4,sK3) )
| ( ~ disjoint(sK4,sK3)
& ! [X3] :
( ~ in(X3,sK3)
| ~ in(X3,sK4) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f29,f31,f30]) ).
fof(f30,plain,
( ? [X0,X1] :
( ( ? [X2] :
( in(X2,X0)
& in(X2,X1) )
& disjoint(X1,X0) )
| ( ~ disjoint(X1,X0)
& ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) ) ) )
=> ( ( ? [X2] :
( in(X2,sK3)
& in(X2,sK4) )
& disjoint(sK4,sK3) )
| ( ~ disjoint(sK4,sK3)
& ! [X3] :
( ~ in(X3,sK3)
| ~ in(X3,sK4) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
( ? [X2] :
( in(X2,sK3)
& in(X2,sK4) )
=> ( in(sK5,sK3)
& in(sK5,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
? [X0,X1] :
( ( ? [X2] :
( in(X2,X0)
& in(X2,X1) )
& disjoint(X1,X0) )
| ( ~ disjoint(X1,X0)
& ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) ) ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
? [X1,X0] :
( ( ? [X3] :
( in(X3,X1)
& in(X3,X0) )
& disjoint(X0,X1) )
| ( ~ disjoint(X0,X1)
& ! [X2] :
( ~ in(X2,X1)
| ~ in(X2,X0) ) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
~ ! [X1,X0] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X0) )
& disjoint(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X0)
& in(X2,X1) ) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X0)
& in(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f82,plain,
( ~ spl7_1
| spl7_3 ),
inference(avatar_split_clause,[],[f52,f79,f70]) ).
fof(f52,plain,
( in(sK5,sK3)
| ~ disjoint(sK4,sK3) ),
inference(cnf_transformation,[],[f32]) ).
fof(f77,plain,
( ~ spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f50,f74,f70]) ).
fof(f50,plain,
( in(sK5,sK4)
| ~ disjoint(sK4,sK3) ),
inference(cnf_transformation,[],[f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU119+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 14:48:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.50 % (21794)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (21794)Refutation not found, incomplete strategy% (21794)------------------------------
% 0.19/0.51 % (21794)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (21802)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (21798)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.19/0.52 % (21797)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (21810)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.52 % (21795)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 (2999ds/37Mi)
% 0.19/0.52 % (21796)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (21806)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.52 TRYING [1]
% 0.19/0.52 TRYING [2]
% 0.19/0.52 % (21794)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (21794)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.52
% 0.19/0.52 % (21794)Memory used [KB]: 5500
% 0.19/0.52 % (21794)Time elapsed: 0.121 s
% 0.19/0.52 % (21794)Instructions burned: 2 (million)
% 0.19/0.52 % (21794)------------------------------
% 0.19/0.52 % (21794)------------------------------
% 0.19/0.52 % (21805)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.19/0.52 % (21817)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.52 % (21803)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52 % (21804)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.52 % (21809)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 (2999ds/99Mi)
% 0.19/0.52 % (21801)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.52 % (21801)Instruction limit reached!
% 0.19/0.52 % (21801)------------------------------
% 0.19/0.52 % (21801)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (21801)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (21801)Termination reason: Unknown
% 0.19/0.52 % (21801)Termination phase: Preprocessing 3
% 0.19/0.52
% 0.19/0.52 % (21801)Memory used [KB]: 895
% 0.19/0.52 % (21801)Time elapsed: 0.003 s
% 0.19/0.52 % (21801)Instructions burned: 2 (million)
% 0.19/0.52 % (21801)------------------------------
% 0.19/0.52 % (21801)------------------------------
% 0.19/0.52 % (21816)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.19/0.52 % (21806)First to succeed.
% 0.19/0.53 % (21793)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 (2999ds/191324Mi)
% 0.19/0.53 % (21806)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (21806)------------------------------
% 0.19/0.53 % (21806)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (21806)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (21806)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (21806)Memory used [KB]: 5500
% 0.19/0.53 % (21806)Time elapsed: 0.132 s
% 0.19/0.53 % (21806)Instructions burned: 10 (million)
% 0.19/0.53 % (21806)------------------------------
% 0.19/0.53 % (21806)------------------------------
% 0.19/0.53 % (21792)Success in time 0.186 s
%------------------------------------------------------------------------------