TSTP Solution File: SEU166+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU166+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n003.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:27:03 EDT 2022
% Result : Theorem 1.23s 0.52s
% Output : Refutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 4 unt; 0 def)
% Number of atoms : 227 ( 40 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 254 ( 87 ~; 97 |; 54 &)
% ( 8 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 146 ( 111 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f158,plain,
$false,
inference(avatar_sat_refutation,[],[f57,f107,f157]) ).
fof(f157,plain,
spl9_2,
inference(avatar_contradiction_clause,[],[f156]) ).
fof(f156,plain,
( $false
| spl9_2 ),
inference(subsumption_resolution,[],[f155,f109]) ).
fof(f109,plain,
( ~ in(sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0)),cartesian_product2(sK2,sK0))
| spl9_2 ),
inference(unit_resulting_resolution,[],[f56,f34]) ).
fof(f34,plain,
! [X0,X1] :
( ~ in(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f21,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X3] :
( ~ in(X3,X1)
& in(X3,X0) )
=> ( ~ in(sK3(X0,X1),X1)
& in(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,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,[],[f20]) ).
fof(f20,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,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f56,plain,
( ~ subset(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))
| spl9_2 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f54,plain,
( spl9_2
<=> subset(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f155,plain,
( in(sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0)),cartesian_product2(sK2,sK0))
| spl9_2 ),
inference(forward_demodulation,[],[f148,f112]) ).
fof(f112,plain,
( ordered_pair(sK5(sK1,sK2,sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))),sK4(sK1,sK2,sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0)))) = sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))
| spl9_2 ),
inference(unit_resulting_resolution,[],[f108,f44]) ).
fof(f44,plain,
! [X2,X3,X0] :
( ~ in(X3,cartesian_product2(X2,X0))
| ordered_pair(sK5(X0,X2,X3),sK4(X0,X2,X3)) = X3 ),
inference(equality_resolution,[],[f43]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( ordered_pair(sK5(X0,X2,X3),sK4(X0,X2,X3)) = X3
| ~ in(X3,X1)
| cartesian_product2(X2,X0) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( ordered_pair(sK5(X0,X2,X3),sK4(X0,X2,X3)) = X3
& in(sK4(X0,X2,X3),X0)
& in(sK5(X0,X2,X3),X2) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ! [X6,X7] :
( ordered_pair(X7,X6) != X3
| ~ in(X6,X0)
| ~ in(X7,X2) ) ) )
| cartesian_product2(X2,X0) != X1 )
& ( cartesian_product2(X2,X0) = X1
| ( ( ~ in(sK6(X0,X1,X2),X1)
| ! [X9,X10] :
( ordered_pair(X10,X9) != sK6(X0,X1,X2)
| ~ in(X9,X0)
| ~ in(X10,X2) ) )
& ( in(sK6(X0,X1,X2),X1)
| ( ordered_pair(sK8(X0,X1,X2),sK7(X0,X1,X2)) = sK6(X0,X1,X2)
& in(sK7(X0,X1,X2),X0)
& in(sK8(X0,X1,X2),X2) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8])],[f25,f28,f27,f26]) ).
fof(f26,plain,
! [X0,X2,X3] :
( ? [X4,X5] :
( ordered_pair(X5,X4) = X3
& in(X4,X0)
& in(X5,X2) )
=> ( ordered_pair(sK5(X0,X2,X3),sK4(X0,X2,X3)) = X3
& in(sK4(X0,X2,X3),X0)
& in(sK5(X0,X2,X3),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ? [X8] :
( ( ~ in(X8,X1)
| ! [X9,X10] :
( ordered_pair(X10,X9) != X8
| ~ in(X9,X0)
| ~ in(X10,X2) ) )
& ( in(X8,X1)
| ? [X11,X12] :
( ordered_pair(X12,X11) = X8
& in(X11,X0)
& in(X12,X2) ) ) )
=> ( ( ~ in(sK6(X0,X1,X2),X1)
| ! [X10,X9] :
( ordered_pair(X10,X9) != sK6(X0,X1,X2)
| ~ in(X9,X0)
| ~ in(X10,X2) ) )
& ( in(sK6(X0,X1,X2),X1)
| ? [X12,X11] :
( ordered_pair(X12,X11) = sK6(X0,X1,X2)
& in(X11,X0)
& in(X12,X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ? [X12,X11] :
( ordered_pair(X12,X11) = sK6(X0,X1,X2)
& in(X11,X0)
& in(X12,X2) )
=> ( ordered_pair(sK8(X0,X1,X2),sK7(X0,X1,X2)) = sK6(X0,X1,X2)
& in(sK7(X0,X1,X2),X0)
& in(sK8(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ? [X4,X5] :
( ordered_pair(X5,X4) = X3
& in(X4,X0)
& in(X5,X2) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ! [X6,X7] :
( ordered_pair(X7,X6) != X3
| ~ in(X6,X0)
| ~ in(X7,X2) ) ) )
| cartesian_product2(X2,X0) != X1 )
& ( cartesian_product2(X2,X0) = X1
| ? [X8] :
( ( ~ in(X8,X1)
| ! [X9,X10] :
( ordered_pair(X10,X9) != X8
| ~ in(X9,X0)
| ~ in(X10,X2) ) )
& ( in(X8,X1)
| ? [X11,X12] :
( ordered_pair(X12,X11) = X8
& in(X11,X0)
& in(X12,X2) ) ) ) ) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ? [X5,X4] :
( ordered_pair(X4,X5) = X3
& in(X5,X0)
& in(X4,X2) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ! [X5,X4] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X0)
| ~ in(X4,X2) ) ) )
| cartesian_product2(X2,X0) != X1 )
& ( cartesian_product2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ! [X5,X4] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X0)
| ~ in(X4,X2) ) )
& ( in(X3,X1)
| ? [X5,X4] :
( ordered_pair(X4,X5) = X3
& in(X5,X0)
& in(X4,X2) ) ) ) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ! [X3] :
( ? [X5,X4] :
( ordered_pair(X4,X5) = X3
& in(X5,X0)
& in(X4,X2) )
<=> in(X3,X1) )
<=> cartesian_product2(X2,X0) = X1 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X2,X0] :
( cartesian_product2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(f108,plain,
( in(sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0)),cartesian_product2(sK2,sK1))
| spl9_2 ),
inference(unit_resulting_resolution,[],[f56,f33]) ).
fof(f33,plain,
! [X0,X1] :
( in(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f148,plain,
( in(ordered_pair(sK5(sK1,sK2,sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))),sK4(sK1,sK2,sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0)))),cartesian_product2(sK2,sK0))
| spl9_2 ),
inference(unit_resulting_resolution,[],[f110,f129,f48]) ).
fof(f48,plain,
! [X2,X0,X6,X7] :
( in(ordered_pair(X7,X6),cartesian_product2(X2,X0))
| ~ in(X7,X2)
| ~ in(X6,X0) ),
inference(equality_resolution,[],[f47]) ).
fof(f47,plain,
! [X2,X0,X1,X6,X7] :
( in(ordered_pair(X7,X6),X1)
| ~ in(X6,X0)
| ~ in(X7,X2)
| cartesian_product2(X2,X0) != X1 ),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X6,X7] :
( in(X3,X1)
| ordered_pair(X7,X6) != X3
| ~ in(X6,X0)
| ~ in(X7,X2)
| cartesian_product2(X2,X0) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f129,plain,
( in(sK4(sK1,sK2,sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))),sK0)
| spl9_2 ),
inference(unit_resulting_resolution,[],[f30,f111,f35]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f111,plain,
( in(sK4(sK1,sK2,sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))),sK1)
| spl9_2 ),
inference(unit_resulting_resolution,[],[f108,f45]) ).
fof(f45,plain,
! [X2,X3,X0] :
( in(sK4(X0,X2,X3),X0)
| ~ in(X3,cartesian_product2(X2,X0)) ),
inference(equality_resolution,[],[f42]) ).
fof(f42,plain,
! [X2,X3,X0,X1] :
( in(sK4(X0,X2,X3),X0)
| ~ in(X3,X1)
| cartesian_product2(X2,X0) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f30,plain,
subset(sK1,sK0),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ( ~ subset(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))
| ~ subset(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2)) )
& subset(sK1,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f17]) ).
fof(f17,plain,
( ? [X0,X1,X2] :
( ( ~ subset(cartesian_product2(X2,X1),cartesian_product2(X2,X0))
| ~ subset(cartesian_product2(X1,X2),cartesian_product2(X0,X2)) )
& subset(X1,X0) )
=> ( ( ~ subset(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))
| ~ subset(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2)) )
& subset(sK1,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ( ~ subset(cartesian_product2(X2,X1),cartesian_product2(X2,X0))
| ~ subset(cartesian_product2(X1,X2),cartesian_product2(X0,X2)) )
& subset(X1,X0) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
? [X1,X0,X2] :
( ( ~ subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
| ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) )
& subset(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
& subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
& subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t118_zfmisc_1) ).
fof(f110,plain,
( in(sK5(sK1,sK2,sK3(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))),sK2)
| spl9_2 ),
inference(unit_resulting_resolution,[],[f108,f46]) ).
fof(f46,plain,
! [X2,X3,X0] :
( in(sK5(X0,X2,X3),X2)
| ~ in(X3,cartesian_product2(X2,X0)) ),
inference(equality_resolution,[],[f41]) ).
fof(f41,plain,
! [X2,X3,X0,X1] :
( in(sK5(X0,X2,X3),X2)
| ~ in(X3,X1)
| cartesian_product2(X2,X0) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f107,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f106]) ).
fof(f106,plain,
( $false
| spl9_1 ),
inference(subsumption_resolution,[],[f105,f59]) ).
fof(f59,plain,
( ~ in(sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2)),cartesian_product2(sK0,sK2))
| spl9_1 ),
inference(unit_resulting_resolution,[],[f52,f34]) ).
fof(f52,plain,
( ~ subset(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2))
| spl9_1 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f50,plain,
( spl9_1
<=> subset(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f105,plain,
( in(sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2)),cartesian_product2(sK0,sK2))
| spl9_1 ),
inference(forward_demodulation,[],[f101,f62]) ).
fof(f62,plain,
( ordered_pair(sK5(sK2,sK1,sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2))),sK4(sK2,sK1,sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2)))) = sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2))
| spl9_1 ),
inference(unit_resulting_resolution,[],[f58,f44]) ).
fof(f58,plain,
( in(sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2)),cartesian_product2(sK1,sK2))
| spl9_1 ),
inference(unit_resulting_resolution,[],[f52,f33]) ).
fof(f101,plain,
( in(ordered_pair(sK5(sK2,sK1,sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2))),sK4(sK2,sK1,sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2)))),cartesian_product2(sK0,sK2))
| spl9_1 ),
inference(unit_resulting_resolution,[],[f61,f72,f48]) ).
fof(f72,plain,
( in(sK5(sK2,sK1,sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2))),sK0)
| spl9_1 ),
inference(unit_resulting_resolution,[],[f30,f60,f35]) ).
fof(f60,plain,
( in(sK5(sK2,sK1,sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2))),sK1)
| spl9_1 ),
inference(unit_resulting_resolution,[],[f58,f46]) ).
fof(f61,plain,
( in(sK4(sK2,sK1,sK3(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2))),sK2)
| spl9_1 ),
inference(unit_resulting_resolution,[],[f58,f45]) ).
fof(f57,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f31,f54,f50]) ).
fof(f31,plain,
( ~ subset(cartesian_product2(sK2,sK1),cartesian_product2(sK2,sK0))
| ~ subset(cartesian_product2(sK1,sK2),cartesian_product2(sK0,sK2)) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU166+3 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n003.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 14:45:07 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.50 % (9881)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.51 % (9873)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.51 % (9879)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.51 % (9861)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (9858)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.51 % (9861)First to succeed.
% 0.21/0.51 % (9865)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.23/0.51 % (9870)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.23/0.51 % (9869)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.23/0.52 % (9881)Refutation not found, incomplete strategy% (9881)------------------------------
% 1.23/0.52 % (9881)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.23/0.52 % (9873)Instruction limit reached!
% 1.23/0.52 % (9873)------------------------------
% 1.23/0.52 % (9873)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.23/0.52 % (9873)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.23/0.52 % (9873)Termination reason: Unknown
% 1.23/0.52 % (9873)Termination phase: Saturation
% 1.23/0.52
% 1.23/0.52 % (9873)Memory used [KB]: 6012
% 1.23/0.52 % (9873)Time elapsed: 0.064 s
% 1.23/0.52 % (9873)Instructions burned: 7 (million)
% 1.23/0.52 % (9873)------------------------------
% 1.23/0.52 % (9873)------------------------------
% 1.23/0.52 % (9881)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.23/0.52 % (9881)Termination reason: Refutation not found, incomplete strategy
% 1.23/0.52
% 1.23/0.52 % (9881)Memory used [KB]: 1535
% 1.23/0.52 % (9881)Time elapsed: 0.058 s
% 1.23/0.52 % (9881)Instructions burned: 8 (million)
% 1.23/0.52 % (9881)------------------------------
% 1.23/0.52 % (9881)------------------------------
% 1.23/0.52 % (9862)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.23/0.52 % (9864)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.23/0.52 % (9861)Refutation found. Thanks to Tanya!
% 1.23/0.52 % SZS status Theorem for theBenchmark
% 1.23/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.23/0.52 % (9861)------------------------------
% 1.23/0.52 % (9861)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.23/0.52 % (9861)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.23/0.52 % (9861)Termination reason: Refutation
% 1.23/0.52
% 1.23/0.52 % (9861)Memory used [KB]: 6012
% 1.23/0.52 % (9861)Time elapsed: 0.116 s
% 1.23/0.52 % (9861)Instructions burned: 6 (million)
% 1.23/0.52 % (9861)------------------------------
% 1.23/0.52 % (9861)------------------------------
% 1.23/0.52 % (9855)Success in time 0.168 s
%------------------------------------------------------------------------------