TSTP Solution File: SET916+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET916+1 : 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_sat --cores 0 -t %d %s
% Computer : n005.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:05 EDT 2022
% Result : Theorem 1.76s 0.60s
% Output : Refutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 17 unt; 0 def)
% Number of atoms : 238 ( 81 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 309 ( 124 ~; 98 |; 75 &)
% ( 8 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 137 ( 115 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f126,plain,
$false,
inference(subsumption_resolution,[],[f121,f56]) ).
fof(f56,plain,
~ in(sK3,sK2),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
( ~ disjoint(unordered_pair(sK4,sK3),sK2)
& ~ in(sK4,sK2)
& ~ in(sK3,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f33,f34]) ).
fof(f34,plain,
( ? [X0,X1,X2] :
( ~ disjoint(unordered_pair(X2,X1),X0)
& ~ in(X2,X0)
& ~ in(X1,X0) )
=> ( ~ disjoint(unordered_pair(sK4,sK3),sK2)
& ~ in(sK4,sK2)
& ~ in(sK3,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
? [X0,X1,X2] :
( ~ disjoint(unordered_pair(X2,X1),X0)
& ~ in(X2,X0)
& ~ in(X1,X0) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
? [X1,X0,X2] :
( ~ disjoint(unordered_pair(X2,X0),X1)
& ~ in(X2,X1)
& ~ in(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
~ ! [X2,X1,X0] :
~ ( ~ disjoint(unordered_pair(X2,X0),X1)
& ~ in(X2,X1)
& ~ in(X0,X1) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X2,X1,X0] :
~ ( ~ in(X2,X1)
& ~ disjoint(unordered_pair(X0,X2),X1)
& ~ in(X0,X1) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X2,X1,X0] :
~ ( ~ in(X2,X1)
& ~ disjoint(unordered_pair(X0,X2),X1)
& ~ in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t57_zfmisc_1) ).
fof(f121,plain,
in(sK3,sK2),
inference(backward_demodulation,[],[f102,f118]) ).
fof(f118,plain,
sK3 = sK1(sK2,unordered_pair(sK3,sK4)),
inference(subsumption_resolution,[],[f113,f57]) ).
fof(f57,plain,
~ in(sK4,sK2),
inference(cnf_transformation,[],[f35]) ).
fof(f113,plain,
( sK3 = sK1(sK2,unordered_pair(sK3,sK4))
| in(sK4,sK2) ),
inference(superposition,[],[f102,f108]) ).
fof(f108,plain,
( sK4 = sK1(sK2,unordered_pair(sK3,sK4))
| sK3 = sK1(sK2,unordered_pair(sK3,sK4)) ),
inference(resolution,[],[f76,f101]) ).
fof(f101,plain,
in(sK1(sK2,unordered_pair(sK3,sK4)),unordered_pair(sK3,sK4)),
inference(resolution,[],[f100,f78]) ).
fof(f78,plain,
! [X2,X3,X0] :
( ~ in(X3,set_intersection2(X0,X2))
| in(X3,X2) ),
inference(equality_resolution,[],[f70]) ).
fof(f70,plain,
! [X2,X3,X0,X1] :
( in(X3,X2)
| ~ in(X3,X1)
| set_intersection2(X0,X2) != X1 ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X2) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) ) )
| set_intersection2(X0,X2) != X1 )
& ( set_intersection2(X0,X2) = X1
| ( ( ~ in(sK7(X0,X1,X2),X1)
| ~ in(sK7(X0,X1,X2),X0)
| ~ in(sK7(X0,X1,X2),X2) )
& ( in(sK7(X0,X1,X2),X1)
| ( in(sK7(X0,X1,X2),X0)
& in(sK7(X0,X1,X2),X2) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f45,f46]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X1)
| ~ in(X4,X0)
| ~ in(X4,X2) )
& ( in(X4,X1)
| ( in(X4,X0)
& in(X4,X2) ) ) )
=> ( ( ~ in(sK7(X0,X1,X2),X1)
| ~ in(sK7(X0,X1,X2),X0)
| ~ in(sK7(X0,X1,X2),X2) )
& ( in(sK7(X0,X1,X2),X1)
| ( in(sK7(X0,X1,X2),X0)
& in(sK7(X0,X1,X2),X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X2) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) ) )
| set_intersection2(X0,X2) != X1 )
& ( set_intersection2(X0,X2) = X1
| ? [X4] :
( ( ~ in(X4,X1)
| ~ in(X4,X0)
| ~ in(X4,X2) )
& ( in(X4,X1)
| ( in(X4,X0)
& in(X4,X2) ) ) ) ) ),
inference(rectify,[],[f44]) ).
fof(f44,plain,
! [X2,X1,X0] :
( ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) ) )
| set_intersection2(X2,X0) != X1 )
& ( set_intersection2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( in(X3,X1)
| ( in(X3,X2)
& in(X3,X0) ) ) ) ) ),
inference(flattening,[],[f43]) ).
fof(f43,plain,
! [X2,X1,X0] :
( ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) ) )
| set_intersection2(X2,X0) != X1 )
& ( set_intersection2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) )
& ( in(X3,X1)
| ( in(X3,X2)
& in(X3,X0) ) ) ) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X2,X1,X0] :
( ! [X3] :
( ( in(X3,X2)
& in(X3,X0) )
<=> in(X3,X1) )
<=> set_intersection2(X2,X0) = X1 ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X2,X0] :
( ! [X3] :
( ( in(X3,X1)
& in(X3,X0) )
<=> in(X3,X2) )
<=> set_intersection2(X0,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f100,plain,
in(sK1(sK2,unordered_pair(sK3,sK4)),set_intersection2(sK2,unordered_pair(sK3,sK4))),
inference(forward_demodulation,[],[f99,f55]) ).
fof(f55,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f99,plain,
in(sK1(sK2,unordered_pair(sK3,sK4)),set_intersection2(unordered_pair(sK3,sK4),sK2)),
inference(resolution,[],[f53,f82]) ).
fof(f82,plain,
~ disjoint(unordered_pair(sK3,sK4),sK2),
inference(backward_demodulation,[],[f58,f50]) ).
fof(f50,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f58,plain,
~ disjoint(unordered_pair(sK4,sK3),sK2),
inference(cnf_transformation,[],[f35]) ).
fof(f53,plain,
! [X0,X1] :
( disjoint(X1,X0)
| in(sK1(X0,X1),set_intersection2(X1,X0)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( ~ disjoint(X1,X0)
| ! [X2] : ~ in(X2,set_intersection2(X1,X0)) )
& ( disjoint(X1,X0)
| in(sK1(X0,X1),set_intersection2(X1,X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f29,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X3] : in(X3,set_intersection2(X1,X0))
=> in(sK1(X0,X1),set_intersection2(X1,X0)) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( ~ disjoint(X1,X0)
| ! [X2] : ~ in(X2,set_intersection2(X1,X0)) )
& ( disjoint(X1,X0)
| ? [X3] : in(X3,set_intersection2(X1,X0)) ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( ~ disjoint(X1,X0)
| ! [X3] : ~ in(X3,set_intersection2(X1,X0)) )
& ( disjoint(X1,X0)
| ? [X2] : in(X2,set_intersection2(X1,X0)) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ~ ( disjoint(X1,X0)
& ? [X3] : in(X3,set_intersection2(X1,X0)) )
& ~ ( ~ disjoint(X1,X0)
& ! [X2] : ~ in(X2,set_intersection2(X1,X0)) ) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X1,X0] :
( ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f76,plain,
! [X2,X3,X0] :
( ~ in(X3,unordered_pair(X2,X0))
| X0 = X3
| X2 = X3 ),
inference(equality_resolution,[],[f62]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( X2 = X3
| X0 = X3
| ~ in(X3,X1)
| unordered_pair(X2,X0) != X1 ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X1)
| ( X2 != X3
& X0 != X3 ) )
& ( X2 = X3
| X0 = X3
| ~ in(X3,X1) ) )
| unordered_pair(X2,X0) != X1 )
& ( unordered_pair(X2,X0) = X1
| ( ( ( sK5(X0,X1,X2) != X2
& sK5(X0,X1,X2) != X0 )
| ~ in(sK5(X0,X1,X2),X1) )
& ( sK5(X0,X1,X2) = X2
| sK5(X0,X1,X2) = X0
| in(sK5(X0,X1,X2),X1) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f38,f39]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ( X2 != X4
& X0 != X4 )
| ~ in(X4,X1) )
& ( X2 = X4
| X0 = X4
| in(X4,X1) ) )
=> ( ( ( sK5(X0,X1,X2) != X2
& sK5(X0,X1,X2) != X0 )
| ~ in(sK5(X0,X1,X2),X1) )
& ( sK5(X0,X1,X2) = X2
| sK5(X0,X1,X2) = X0
| in(sK5(X0,X1,X2),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X1)
| ( X2 != X3
& X0 != X3 ) )
& ( X2 = X3
| X0 = X3
| ~ in(X3,X1) ) )
| unordered_pair(X2,X0) != X1 )
& ( unordered_pair(X2,X0) = X1
| ? [X4] :
( ( ( X2 != X4
& X0 != X4 )
| ~ in(X4,X1) )
& ( X2 = X4
| X0 = X4
| in(X4,X1) ) ) ) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X0)
| ( X1 != X3
& X2 != X3 ) )
& ( X1 = X3
| X2 = X3
| ~ in(X3,X0) ) )
| unordered_pair(X1,X2) != X0 )
& ( unordered_pair(X1,X2) = X0
| ? [X3] :
( ( ( X1 != X3
& X2 != X3 )
| ~ in(X3,X0) )
& ( X1 = X3
| X2 = X3
| in(X3,X0) ) ) ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ( ! [X3] :
( ( in(X3,X0)
| ( X1 != X3
& X2 != X3 ) )
& ( X1 = X3
| X2 = X3
| ~ in(X3,X0) ) )
| unordered_pair(X1,X2) != X0 )
& ( unordered_pair(X1,X2) = X0
| ? [X3] :
( ( ( X1 != X3
& X2 != X3 )
| ~ in(X3,X0) )
& ( X1 = X3
| X2 = X3
| in(X3,X0) ) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ! [X3] :
( in(X3,X0)
<=> ( X1 = X3
| X2 = X3 ) )
<=> unordered_pair(X1,X2) = X0 ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X0,X1] :
( ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) )
<=> unordered_pair(X0,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f102,plain,
in(sK1(sK2,unordered_pair(sK3,sK4)),sK2),
inference(resolution,[],[f100,f77]) ).
fof(f77,plain,
! [X2,X3,X0] :
( ~ in(X3,set_intersection2(X0,X2))
| in(X3,X0) ),
inference(equality_resolution,[],[f71]) ).
fof(f71,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X1)
| set_intersection2(X0,X2) != X1 ),
inference(cnf_transformation,[],[f47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET916+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14 % 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.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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:29:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.48 % (26040)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.48 % (26046)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.48 % (26052)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.50 % (26040)Instruction limit reached!
% 0.21/0.50 % (26040)------------------------------
% 0.21/0.50 % (26040)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50 % (26040)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (26040)Termination reason: Unknown
% 0.21/0.50 % (26040)Termination phase: Saturation
% 0.21/0.50
% 0.21/0.50 % (26040)Memory used [KB]: 5500
% 0.21/0.50 % (26040)Time elapsed: 0.085 s
% 0.21/0.50 % (26040)Instructions burned: 7 (million)
% 0.21/0.50 % (26040)------------------------------
% 0.21/0.50 % (26040)------------------------------
% 0.21/0.50 % (26060)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)
% 0.21/0.50 % (26044)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.21/0.51 % (26038)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.21/0.52 % (26057)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.52 % (26056)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.21/0.53 % (26048)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.21/0.55 % (26050)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.55 % (26053)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.21/0.55 % (26034)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.21/0.55 % (26034)Refutation not found, incomplete strategy% (26034)------------------------------
% 0.21/0.55 % (26034)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (26034)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (26034)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.55
% 0.21/0.55 % (26034)Memory used [KB]: 5500
% 0.21/0.55 % (26034)Time elapsed: 0.132 s
% 0.21/0.55 % (26034)Instructions burned: 4 (million)
% 0.21/0.55 % (26034)------------------------------
% 0.21/0.55 % (26034)------------------------------
% 0.21/0.55 % (26039)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.21/0.55 TRYING [1]
% 0.21/0.55 TRYING [2]
% 0.21/0.55 TRYING [3]
% 0.21/0.56 % (26061)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.56 % (26047)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.21/0.56 TRYING [4]
% 0.21/0.56 % (26041)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.21/0.56 % (26058)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.21/0.56 % (26036)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.21/0.56 % (26054)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.56 % (26033)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.21/0.56 TRYING [1]
% 0.21/0.56 TRYING [2]
% 0.21/0.56 % (26037)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.56 TRYING [3]
% 0.21/0.56 TRYING [1]
% 0.21/0.56 TRYING [2]
% 0.21/0.57 % (26043)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.57 TRYING [3]
% 0.21/0.57 % (26045)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.21/0.57 TRYING [4]
% 0.21/0.57 % (26055)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.21/0.57 % (26055)First to succeed.
% 0.21/0.57 % (26059)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.21/0.58 % (26035)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.21/0.58 % (26049)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.21/0.58 % (26041)Instruction limit reached!
% 0.21/0.58 % (26041)------------------------------
% 0.21/0.58 % (26041)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.58 % (26041)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.58 % (26041)Termination reason: Unknown
% 0.21/0.58 % (26041)Termination phase: Preprocessing 3
% 0.21/0.58
% 0.21/0.58 % (26041)Memory used [KB]: 895
% 0.21/0.58 % (26041)Time elapsed: 0.003 s
% 0.21/0.58 % (26041)Instructions burned: 2 (million)
% 0.21/0.58 % (26041)------------------------------
% 0.21/0.58 % (26041)------------------------------
% 0.21/0.58 % (26062)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)
% 0.21/0.59 % (26042)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.21/0.59 TRYING [4]
% 0.21/0.59 % (26051)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.59 % (26046)Instruction limit reached!
% 0.21/0.59 % (26046)------------------------------
% 0.21/0.59 % (26046)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.76/0.59 % (26046)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.76/0.59 % (26046)Termination reason: Unknown
% 1.76/0.59 % (26046)Termination phase: Saturation
% 1.76/0.59
% 1.76/0.59 % (26046)Memory used [KB]: 6140
% 1.76/0.59 % (26046)Time elapsed: 0.177 s
% 1.76/0.59 % (26046)Instructions burned: 100 (million)
% 1.76/0.59 % (26046)------------------------------
% 1.76/0.59 % (26046)------------------------------
% 1.76/0.60 % (26055)Refutation found. Thanks to Tanya!
% 1.76/0.60 % SZS status Theorem for theBenchmark
% 1.76/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.76/0.60 % (26055)------------------------------
% 1.76/0.60 % (26055)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.76/0.60 % (26055)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.76/0.60 % (26055)Termination reason: Refutation
% 1.76/0.60
% 1.76/0.60 % (26055)Memory used [KB]: 1023
% 1.76/0.60 % (26055)Time elapsed: 0.158 s
% 1.76/0.60 % (26055)Instructions burned: 3 (million)
% 1.76/0.60 % (26055)------------------------------
% 1.76/0.60 % (26055)------------------------------
% 1.76/0.60 % (26032)Success in time 0.234 s
%------------------------------------------------------------------------------