TSTP Solution File: SET980+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET980+1 : TPTP v8.1.0. Bugfixed v4.0.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 : n029.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:26:15 EDT 2022
% Result : Theorem 1.65s 0.60s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 8
% Syntax : Number of formulae : 71 ( 15 unt; 0 def)
% Number of atoms : 203 ( 76 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 236 ( 104 ~; 84 |; 36 &)
% ( 4 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 131 ( 109 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f437,plain,
$false,
inference(resolution,[],[f421,f113]) ).
fof(f113,plain,
in(sK7(sK1,empty_set),sK1),
inference(subsumption_resolution,[],[f100,f72]) ).
fof(f72,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f55]) ).
fof(f55,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0] :
( ( empty_set = X0
| in(sK4(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f31,f32]) ).
fof(f32,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK4(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f100,plain,
( in(sK7(sK1,empty_set),empty_set)
| in(sK7(sK1,empty_set),sK1) ),
inference(extensionality_resolution,[],[f64,f53]) ).
fof(f53,plain,
empty_set != sK1,
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( empty_set != sK1
& cartesian_product2(sK3,sK0) = cartesian_product2(sK1,sK2)
& ( sK3 != sK1
| sK0 != sK2 )
& empty_set != sK2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f27,f28]) ).
fof(f28,plain,
( ? [X0,X1,X2,X3] :
( empty_set != X1
& cartesian_product2(X3,X0) = cartesian_product2(X1,X2)
& ( X1 != X3
| X0 != X2 )
& empty_set != X2 )
=> ( empty_set != sK1
& cartesian_product2(sK3,sK0) = cartesian_product2(sK1,sK2)
& ( sK3 != sK1
| sK0 != sK2 )
& empty_set != sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
? [X0,X1,X2,X3] :
( empty_set != X1
& cartesian_product2(X3,X0) = cartesian_product2(X1,X2)
& ( X1 != X3
| X0 != X2 )
& empty_set != X2 ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
? [X1,X0,X3,X2] :
( empty_set != X0
& cartesian_product2(X2,X1) = cartesian_product2(X0,X3)
& ( X0 != X2
| X1 != X3 )
& empty_set != X3 ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
? [X2,X3,X0,X1] :
( empty_set != X0
& empty_set != X3
& ( X0 != X2
| X1 != X3 )
& cartesian_product2(X2,X1) = cartesian_product2(X0,X3) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X2,X3,X0,X1] :
( cartesian_product2(X2,X1) = cartesian_product2(X0,X3)
=> ( empty_set = X0
| empty_set = X3
| ( X0 = X2
& X1 = X3 ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X3,X2,X1] :
( cartesian_product2(X2,X3) = cartesian_product2(X0,X1)
=> ( empty_set = X1
| empty_set = X0
| ( X0 = X2
& X1 = X3 ) ) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X3,X2,X1] :
( cartesian_product2(X2,X3) = cartesian_product2(X0,X1)
=> ( empty_set = X1
| empty_set = X0
| ( X0 = X2
& X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t134_zfmisc_1) ).
fof(f64,plain,
! [X0,X1] :
( in(sK7(X0,X1),X1)
| in(sK7(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ( ( ~ in(sK7(X0,X1),X1)
| ~ in(sK7(X0,X1),X0) )
& ( in(sK7(X0,X1),X1)
| in(sK7(X0,X1),X0) ) )
| X0 = X1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f42,f43]) ).
fof(f43,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
=> ( ( ~ in(sK7(X0,X1),X1)
| ~ in(sK7(X0,X1),X0) )
& ( in(sK7(X0,X1),X1)
| in(sK7(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
| X0 = X1 ),
inference(nnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] :
( in(X2,X0)
<~> in(X2,X1) )
| X0 = X1 ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
<=> in(X2,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(f421,plain,
! [X0] : ~ in(X0,sK1),
inference(resolution,[],[f420,f237]) ).
fof(f237,plain,
! [X6] :
( in(X6,sK3)
| ~ in(X6,sK1) ),
inference(resolution,[],[f210,f115]) ).
fof(f115,plain,
in(sK7(empty_set,sK2),sK2),
inference(subsumption_resolution,[],[f97,f72]) ).
fof(f97,plain,
( in(sK7(empty_set,sK2),empty_set)
| in(sK7(empty_set,sK2),sK2) ),
inference(extensionality_resolution,[],[f64,f50]) ).
fof(f50,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f29]) ).
fof(f210,plain,
! [X8,X9] :
( ~ in(X8,sK2)
| ~ in(X9,sK1)
| in(X9,sK3) ),
inference(resolution,[],[f66,f189]) ).
fof(f189,plain,
! [X0,X1] :
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(sK1,sK2))
| in(X0,sK3) ),
inference(superposition,[],[f68,f52]) ).
fof(f52,plain,
cartesian_product2(sK3,sK0) = cartesian_product2(sK1,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f68,plain,
! [X2,X3,X0,X1] :
( ~ in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(X3,X0))
| in(X2,X3) ),
inference(definition_unfolding,[],[f57,f54]) ).
fof(f54,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f4,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(f57,plain,
! [X2,X3,X0,X1] :
( in(X2,X3)
| ~ in(ordered_pair(X2,X1),cartesian_product2(X3,X0)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X2,X1),cartesian_product2(X3,X0))
| ~ in(X1,X0)
| ~ in(X2,X3) )
& ( ( in(X1,X0)
& in(X2,X3) )
| ~ in(ordered_pair(X2,X1),cartesian_product2(X3,X0)) ) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
! [X2,X3,X1,X0] :
( ( in(ordered_pair(X1,X3),cartesian_product2(X0,X2))
| ~ in(X3,X2)
| ~ in(X1,X0) )
& ( ( in(X3,X2)
& in(X1,X0) )
| ~ in(ordered_pair(X1,X3),cartesian_product2(X0,X2)) ) ),
inference(flattening,[],[f34]) ).
fof(f34,plain,
! [X2,X3,X1,X0] :
( ( in(ordered_pair(X1,X3),cartesian_product2(X0,X2))
| ~ in(X3,X2)
| ~ in(X1,X0) )
& ( ( in(X3,X2)
& in(X1,X0) )
| ~ in(ordered_pair(X1,X3),cartesian_product2(X0,X2)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X2,X3,X1,X0] :
( in(ordered_pair(X1,X3),cartesian_product2(X0,X2))
<=> ( in(X3,X2)
& in(X1,X0) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X2,X0,X3,X1] :
( ( in(X1,X3)
& in(X0,X2) )
<=> in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l55_zfmisc_1) ).
fof(f66,plain,
! [X2,X3,X0,X1] :
( in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(X3,X0))
| ~ in(X1,X0)
| ~ in(X2,X3) ),
inference(definition_unfolding,[],[f59,f54]) ).
fof(f59,plain,
! [X2,X3,X0,X1] :
( in(ordered_pair(X2,X1),cartesian_product2(X3,X0))
| ~ in(X1,X0)
| ~ in(X2,X3) ),
inference(cnf_transformation,[],[f36]) ).
fof(f420,plain,
! [X0] : ~ in(X0,sK3),
inference(subsumption_resolution,[],[f418,f386]) ).
fof(f386,plain,
~ in(sK7(sK0,sK2),sK2),
inference(subsumption_resolution,[],[f382,f255]) ).
fof(f255,plain,
! [X6] :
( in(X6,sK0)
| ~ in(X6,sK2) ),
inference(resolution,[],[f211,f112]) ).
fof(f112,plain,
in(sK7(empty_set,sK1),sK1),
inference(subsumption_resolution,[],[f99,f72]) ).
fof(f99,plain,
( in(sK7(empty_set,sK1),sK1)
| in(sK7(empty_set,sK1),empty_set) ),
inference(extensionality_resolution,[],[f64,f53]) ).
fof(f211,plain,
! [X10,X11] :
( ~ in(X11,sK1)
| in(X10,sK0)
| ~ in(X10,sK2) ),
inference(resolution,[],[f66,f166]) ).
fof(f166,plain,
! [X0,X1] :
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(sK1,sK2))
| in(X1,sK0) ),
inference(superposition,[],[f67,f52]) ).
fof(f67,plain,
! [X2,X3,X0,X1] :
( ~ in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(X3,X0))
| in(X1,X0) ),
inference(definition_unfolding,[],[f58,f54]) ).
fof(f58,plain,
! [X2,X3,X0,X1] :
( in(X1,X0)
| ~ in(ordered_pair(X2,X1),cartesian_product2(X3,X0)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f382,plain,
( ~ in(sK7(sK0,sK2),sK2)
| ~ in(sK7(sK0,sK2),sK0) ),
inference(extensionality_resolution,[],[f65,f364]) ).
fof(f364,plain,
sK0 != sK2,
inference(resolution,[],[f335,f115]) ).
fof(f335,plain,
! [X0] :
( ~ in(X0,sK2)
| sK0 != sK2 ),
inference(resolution,[],[f334,f255]) ).
fof(f334,plain,
! [X0] :
( ~ in(X0,sK0)
| sK0 != sK2 ),
inference(subsumption_resolution,[],[f329,f248]) ).
fof(f248,plain,
( ~ in(sK7(sK3,sK1),sK1)
| sK0 != sK2 ),
inference(duplicate_literal_removal,[],[f244]) ).
fof(f244,plain,
( ~ in(sK7(sK3,sK1),sK1)
| sK0 != sK2
| ~ in(sK7(sK3,sK1),sK1) ),
inference(resolution,[],[f237,f140]) ).
fof(f140,plain,
( ~ in(sK7(sK3,sK1),sK3)
| sK0 != sK2
| ~ in(sK7(sK3,sK1),sK1) ),
inference(extensionality_resolution,[],[f65,f51]) ).
fof(f51,plain,
( sK3 != sK1
| sK0 != sK2 ),
inference(cnf_transformation,[],[f29]) ).
fof(f329,plain,
! [X0] :
( in(sK7(sK3,sK1),sK1)
| ~ in(X0,sK0)
| sK0 != sK2 ),
inference(resolution,[],[f319,f224]) ).
fof(f224,plain,
! [X4,X5] :
( ~ in(X5,sK3)
| ~ in(X4,sK0)
| in(X5,sK1) ),
inference(resolution,[],[f219,f68]) ).
fof(f219,plain,
! [X0,X1] :
( in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(sK1,sK2))
| ~ in(X1,sK0)
| ~ in(X0,sK3) ),
inference(superposition,[],[f66,f52]) ).
fof(f319,plain,
( in(sK7(sK3,sK1),sK3)
| sK0 != sK2 ),
inference(subsumption_resolution,[],[f316,f51]) ).
fof(f316,plain,
( in(sK7(sK3,sK1),sK3)
| sK0 != sK2
| sK3 = sK1 ),
inference(resolution,[],[f248,f64]) ).
fof(f65,plain,
! [X0,X1] :
( ~ in(sK7(X0,X1),X1)
| ~ in(sK7(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f44]) ).
fof(f418,plain,
! [X0] :
( ~ in(X0,sK3)
| in(sK7(sK0,sK2),sK2) ),
inference(resolution,[],[f387,f225]) ).
fof(f225,plain,
! [X6,X7] :
( ~ in(X6,sK0)
| ~ in(X7,sK3)
| in(X6,sK2) ),
inference(resolution,[],[f219,f67]) ).
fof(f387,plain,
in(sK7(sK0,sK2),sK0),
inference(subsumption_resolution,[],[f384,f255]) ).
fof(f384,plain,
( in(sK7(sK0,sK2),sK0)
| in(sK7(sK0,sK2),sK2) ),
inference(extensionality_resolution,[],[f64,f364]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET980+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/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.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 14:42:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.34/0.55 % (10037)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.34/0.55 % (10035)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)
% 1.34/0.55 % (10053)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.34/0.55 % (10044)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)
% 1.34/0.55 % (10043)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)
% 1.34/0.56 % (10045)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)
% 1.34/0.56 TRYING [1]
% 1.34/0.56 % (10051)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)
% 1.34/0.56 TRYING [2]
% 1.34/0.56 TRYING [3]
% 1.34/0.56 % (10037)Instruction limit reached!
% 1.34/0.56 % (10037)------------------------------
% 1.34/0.56 % (10037)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.34/0.56 % (10037)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.34/0.56 % (10037)Termination reason: Unknown
% 1.34/0.56 % (10037)Termination phase: Preprocessing 3
% 1.34/0.56
% 1.34/0.56 % (10037)Memory used [KB]: 895
% 1.34/0.56 % (10037)Time elapsed: 0.004 s
% 1.34/0.56 % (10037)Instructions burned: 2 (million)
% 1.34/0.56 % (10037)------------------------------
% 1.34/0.56 % (10037)------------------------------
% 1.65/0.57 % (10052)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)
% 1.65/0.57 TRYING [4]
% 1.65/0.57 % (10036)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.65/0.57 % (10036)Instruction limit reached!
% 1.65/0.57 % (10036)------------------------------
% 1.65/0.57 % (10036)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.65/0.57 % (10036)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.65/0.57 % (10036)Termination reason: Unknown
% 1.65/0.57 % (10036)Termination phase: Saturation
% 1.65/0.57
% 1.65/0.57 % (10036)Memory used [KB]: 5500
% 1.65/0.57 % (10036)Time elapsed: 0.144 s
% 1.65/0.57 % (10036)Instructions burned: 7 (million)
% 1.65/0.57 % (10036)------------------------------
% 1.65/0.57 % (10036)------------------------------
% 1.65/0.57 % (10040)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)
% 1.65/0.58 % (10054)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.65/0.58 % (10046)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.65/0.58 % (10051)First to succeed.
% 1.65/0.58 % (10038)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)
% 1.65/0.58 % (10030)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)
% 1.65/0.58 % (10042)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.65/0.58 % (10047)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.65/0.58 % (10056)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.65/0.59 TRYING [1]
% 1.65/0.59 TRYING [2]
% 1.65/0.59 % (10031)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)
% 1.65/0.59 TRYING [3]
% 1.65/0.59 % (10058)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.65/0.59 % (10032)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)
% 1.65/0.59 % (10034)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)
% 1.65/0.59 % (10030)Refutation not found, incomplete strategy% (10030)------------------------------
% 1.65/0.59 % (10030)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.65/0.59 % (10030)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.65/0.59 % (10030)Termination reason: Refutation not found, incomplete strategy
% 1.65/0.59
% 1.65/0.59 % (10030)Memory used [KB]: 5500
% 1.65/0.59 % (10030)Time elapsed: 0.132 s
% 1.65/0.59 % (10030)Instructions burned: 6 (million)
% 1.65/0.59 % (10030)------------------------------
% 1.65/0.59 % (10030)------------------------------
% 1.65/0.59 % (10055)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)
% 1.65/0.59 % (10035)Instruction limit reached!
% 1.65/0.59 % (10035)------------------------------
% 1.65/0.59 % (10035)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.65/0.60 % (10051)Refutation found. Thanks to Tanya!
% 1.65/0.60 % SZS status Theorem for theBenchmark
% 1.65/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.65/0.60 % (10051)------------------------------
% 1.65/0.60 % (10051)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.65/0.60 % (10051)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.65/0.60 % (10051)Termination reason: Refutation
% 1.65/0.60
% 1.65/0.60 % (10051)Memory used [KB]: 1023
% 1.65/0.60 % (10051)Time elapsed: 0.139 s
% 1.65/0.60 % (10051)Instructions burned: 18 (million)
% 1.65/0.60 % (10051)------------------------------
% 1.65/0.60 % (10051)------------------------------
% 1.65/0.60 % (10028)Success in time 0.244 s
%------------------------------------------------------------------------------