TSTP Solution File: SET945+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET945+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 : n001.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:10 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 66 ( 8 unt; 0 def)
% Number of atoms : 271 ( 26 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 336 ( 131 ~; 118 |; 65 &)
% ( 8 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 184 ( 156 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f468,plain,
$false,
inference(subsumption_resolution,[],[f467,f75]) ).
fof(f75,plain,
~ disjoint(sF9,sK4),
inference(definition_folding,[],[f58,f74]) ).
fof(f74,plain,
sF9 = union(sK3),
introduced(function_definition,[]) ).
fof(f58,plain,
~ disjoint(union(sK3),sK4),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
( ! [X2] :
( disjoint(X2,sK4)
| ~ in(X2,sK3) )
& ~ disjoint(union(sK3),sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f34,f35]) ).
fof(f35,plain,
( ? [X0,X1] :
( ! [X2] :
( disjoint(X2,X1)
| ~ in(X2,X0) )
& ~ disjoint(union(X0),X1) )
=> ( ! [X2] :
( disjoint(X2,sK4)
| ~ in(X2,sK3) )
& ~ disjoint(union(sK3),sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
? [X0,X1] :
( ! [X2] :
( disjoint(X2,X1)
| ~ in(X2,X0) )
& ~ disjoint(union(X0),X1) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
? [X1,X0] :
( ! [X2] :
( disjoint(X2,X0)
| ~ in(X2,X1) )
& ~ disjoint(union(X1),X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X1,X0] :
( ! [X2] :
( in(X2,X1)
=> disjoint(X2,X0) )
=> disjoint(union(X1),X0) ),
inference(rectify,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> disjoint(X2,X1) )
=> disjoint(union(X0),X1) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> disjoint(X2,X1) )
=> disjoint(union(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t98_zfmisc_1) ).
fof(f467,plain,
disjoint(sF9,sK4),
inference(resolution,[],[f465,f54]) ).
fof(f54,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X1,X0] :
( ~ disjoint(X1,X0)
| disjoint(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( disjoint(X1,X0)
=> disjoint(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X1,X0] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f465,plain,
disjoint(sK4,sF9),
inference(duplicate_literal_removal,[],[f464]) ).
fof(f464,plain,
( disjoint(sK4,sF9)
| disjoint(sK4,sF9) ),
inference(resolution,[],[f459,f105]) ).
fof(f105,plain,
! [X4,X5] :
( in(sK2(X4,X5),X4)
| disjoint(X4,X5) ),
inference(resolution,[],[f57,f68]) ).
fof(f68,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X0) ),
inference(equality_resolution,[],[f51]) ).
fof(f51,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) ) )
| set_intersection2(X0,X1) != X2 )
& ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK0(X0,X1,X2),X2)
| ~ in(sK0(X0,X1,X2),X0)
| ~ in(sK0(X0,X1,X2),X1) )
& ( in(sK0(X0,X1,X2),X2)
| ( in(sK0(X0,X1,X2),X0)
& in(sK0(X0,X1,X2),X1) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f24,f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( in(X4,X2)
| ( in(X4,X0)
& in(X4,X1) ) ) )
=> ( ( ~ in(sK0(X0,X1,X2),X2)
| ~ in(sK0(X0,X1,X2),X0)
| ~ in(sK0(X0,X1,X2),X1) )
& ( in(sK0(X0,X1,X2),X2)
| ( in(sK0(X0,X1,X2),X0)
& in(sK0(X0,X1,X2),X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) ) )
| set_intersection2(X0,X1) != X2 )
& ( set_intersection2(X0,X1) = X2
| ? [X4] :
( ( ~ in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( in(X4,X2)
| ( in(X4,X0)
& in(X4,X1) ) ) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ( ! [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,[],[f22]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ( ! [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,[],[f16]) ).
fof(f16,plain,
! [X2,X0,X1] :
( ! [X3] :
( ( in(X3,X2)
& in(X3,X0) )
<=> in(X3,X1) )
<=> set_intersection2(X2,X0) = X1 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X2,X0] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( ( in(X3,X0)
& in(X3,X1) )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f57,plain,
! [X0,X1] :
( in(sK2(X0,X1),set_intersection2(X0,X1))
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| in(sK2(X0,X1),set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f31,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2] : in(X2,set_intersection2(X0,X1))
=> in(sK2(X0,X1),set_intersection2(X0,X1)) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X3] : in(X3,set_intersection2(X0,X1)) )
& ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X3] : ~ in(X3,set_intersection2(X0,X1)) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) )
& ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f459,plain,
! [X0] :
( ~ in(sK2(X0,sF9),sK4)
| disjoint(X0,sF9) ),
inference(resolution,[],[f458,f104]) ).
fof(f104,plain,
! [X2,X3] :
( in(sK2(X2,X3),X3)
| disjoint(X2,X3) ),
inference(resolution,[],[f57,f69]) ).
fof(f69,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X1) ),
inference(equality_resolution,[],[f50]) ).
fof(f50,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f458,plain,
! [X0] :
( ~ in(X0,sF9)
| ~ in(X0,sK4) ),
inference(duplicate_literal_removal,[],[f457]) ).
fof(f457,plain,
! [X0] :
( ~ in(X0,sF9)
| ~ in(X0,sK4)
| ~ in(X0,sF9) ),
inference(forward_demodulation,[],[f451,f74]) ).
fof(f451,plain,
! [X0] :
( ~ in(X0,sK4)
| ~ in(X0,sF9)
| ~ in(X0,union(sK3)) ),
inference(resolution,[],[f271,f71]) ).
fof(f71,plain,
! [X2,X0] :
( in(X2,sK6(X0,X2))
| ~ in(X2,union(X0)) ),
inference(equality_resolution,[],[f66]) ).
fof(f66,plain,
! [X2,X0,X1] :
( in(X2,sK6(X0,X2))
| ~ in(X2,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ( ! [X2] :
( ( ( in(X2,sK6(X0,X2))
& in(sK6(X0,X2),X0) )
| ~ in(X2,X1) )
& ( in(X2,X1)
| ! [X4] :
( ~ in(X2,X4)
| ~ in(X4,X0) ) ) )
| union(X0) != X1 )
& ( union(X0) = X1
| ( ( ~ in(sK7(X0,X1),X1)
| ! [X6] :
( ~ in(sK7(X0,X1),X6)
| ~ in(X6,X0) ) )
& ( in(sK7(X0,X1),X1)
| ( in(sK7(X0,X1),sK8(X0,X1))
& in(sK8(X0,X1),X0) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f40,f43,f42,f41]) ).
fof(f41,plain,
! [X0,X2] :
( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
=> ( in(X2,sK6(X0,X2))
& in(sK6(X0,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X0,X1] :
( ? [X5] :
( ( ~ in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( in(X5,X1)
| ? [X7] :
( in(X5,X7)
& in(X7,X0) ) ) )
=> ( ( ~ in(sK7(X0,X1),X1)
| ! [X6] :
( ~ in(sK7(X0,X1),X6)
| ~ in(X6,X0) ) )
& ( in(sK7(X0,X1),X1)
| ? [X7] :
( in(sK7(X0,X1),X7)
& in(X7,X0) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
! [X0,X1] :
( ? [X7] :
( in(sK7(X0,X1),X7)
& in(X7,X0) )
=> ( in(sK7(X0,X1),sK8(X0,X1))
& in(sK8(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
! [X0,X1] :
( ( ! [X2] :
( ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| ~ in(X2,X1) )
& ( in(X2,X1)
| ! [X4] :
( ~ in(X2,X4)
| ~ in(X4,X0) ) ) )
| union(X0) != X1 )
& ( union(X0) = X1
| ? [X5] :
( ( ~ in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( in(X5,X1)
| ? [X7] :
( in(X5,X7)
& in(X7,X0) ) ) ) ) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X1,X0] :
( ( ! [X2] :
( ( ? [X3] :
( in(X2,X3)
& in(X3,X1) )
| ~ in(X2,X0) )
& ( in(X2,X0)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X1) ) ) )
| union(X1) != X0 )
& ( union(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X1) ) )
& ( in(X2,X0)
| ? [X3] :
( in(X2,X3)
& in(X3,X1) ) ) ) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( ! [X2] :
( ? [X3] :
( in(X2,X3)
& in(X3,X1) )
<=> in(X2,X0) )
<=> union(X1) = X0 ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( ! [X2] :
( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
<=> in(X2,X1) )
<=> union(X0) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(f271,plain,
! [X34,X35] :
( ~ in(X34,sK6(sK3,X35))
| ~ in(X34,sK4)
| ~ in(X35,sF9) ),
inference(resolution,[],[f194,f95]) ).
fof(f95,plain,
! [X0] :
( disjoint(sK6(sK3,X0),sK4)
| ~ in(X0,sF9) ),
inference(forward_demodulation,[],[f89,f74]) ).
fof(f89,plain,
! [X0] :
( disjoint(sK6(sK3,X0),sK4)
| ~ in(X0,union(sK3)) ),
inference(resolution,[],[f72,f59]) ).
fof(f59,plain,
! [X2] :
( ~ in(X2,sK3)
| disjoint(X2,sK4) ),
inference(cnf_transformation,[],[f36]) ).
fof(f72,plain,
! [X2,X0] :
( in(sK6(X0,X2),X0)
| ~ in(X2,union(X0)) ),
inference(equality_resolution,[],[f65]) ).
fof(f65,plain,
! [X2,X0,X1] :
( in(sK6(X0,X2),X0)
| ~ in(X2,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f44]) ).
fof(f194,plain,
! [X2,X0,X1] :
( ~ disjoint(X2,X1)
| ~ in(X0,X1)
| ~ in(X0,X2) ),
inference(resolution,[],[f70,f78]) ).
fof(f78,plain,
! [X6,X7,X5] :
( ~ in(X7,set_intersection2(X6,X5))
| ~ disjoint(X5,X6) ),
inference(superposition,[],[f56,f53]) ).
fof(f53,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/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f56,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f70,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ in(X3,X0)
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f49]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET945+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/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 : n001.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:53:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (27716)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.49 % (27724)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.20/0.50 % (27735)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.20/0.51 % (27725)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.51 % (27731)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.20/0.51 % (27728)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.20/0.52 % (27720)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.20/0.52 % (27720)Instruction limit reached!
% 0.20/0.52 % (27720)------------------------------
% 0.20/0.52 % (27720)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (27720)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (27720)Termination reason: Unknown
% 0.20/0.52 % (27720)Termination phase: Equality resolution with deletion
% 0.20/0.52
% 0.20/0.52 % (27720)Memory used [KB]: 895
% 0.20/0.52 % (27720)Time elapsed: 0.002 s
% 0.20/0.52 % (27720)Instructions burned: 2 (million)
% 0.20/0.52 % (27720)------------------------------
% 0.20/0.52 % (27720)------------------------------
% 0.20/0.52 % (27714)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.20/0.52 % (27737)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.52 % (27740)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.20/0.52 % (27721)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.20/0.52 % (27727)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.20/0.52 % (27718)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.20/0.52 % (27717)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.20/0.53 % (27713)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.20/0.53 % (27736)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.20/0.53 % (27713)Refutation not found, incomplete strategy% (27713)------------------------------
% 0.20/0.53 % (27713)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (27713)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (27713)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.53
% 0.20/0.53 % (27713)Memory used [KB]: 5500
% 0.20/0.53 % (27713)Time elapsed: 0.134 s
% 0.20/0.53 % (27713)Instructions burned: 3 (million)
% 0.20/0.53 % (27713)------------------------------
% 0.20/0.53 % (27713)------------------------------
% 0.20/0.53 % (27715)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.20/0.53 % (27726)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.20/0.53 % (27712)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.20/0.53 TRYING [1]
% 0.20/0.53 TRYING [2]
% 0.20/0.53 TRYING [3]
% 0.20/0.54 % (27722)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54 % (27738)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.54 TRYING [1]
% 0.20/0.54 TRYING [2]
% 0.20/0.54 % (27723)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.20/0.54 % (27724)First to succeed.
% 0.20/0.54 % (27739)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.20/0.54 % (27724)Refutation found. Thanks to Tanya!
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54 % (27724)------------------------------
% 0.20/0.54 % (27724)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (27724)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (27724)Termination reason: Refutation
% 0.20/0.54
% 0.20/0.54 % (27724)Memory used [KB]: 5628
% 0.20/0.54 % (27724)Time elapsed: 0.153 s
% 0.20/0.54 % (27724)Instructions burned: 19 (million)
% 0.20/0.54 % (27724)------------------------------
% 0.20/0.54 % (27724)------------------------------
% 0.20/0.54 % (27709)Success in time 0.19 s
%------------------------------------------------------------------------------