TSTP Solution File: SET944+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET944+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 : 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:26:10 EDT 2022
% Result : Theorem 0.15s 0.55s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 15
% Syntax : Number of formulae : 72 ( 15 unt; 0 def)
% Number of atoms : 279 ( 28 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 339 ( 132 ~; 134 |; 58 &)
% ( 8 <=>; 7 =>; 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 : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 168 ( 143 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f246,plain,
$false,
inference(subsumption_resolution,[],[f245,f76]) ).
fof(f76,plain,
~ subset(sF10,sF13),
inference(definition_folding,[],[f44,f75,f74,f73,f72,f71]) ).
fof(f71,plain,
sF9 = set_intersection2(sK0,sK1),
introduced(function_definition,[]) ).
fof(f72,plain,
sF10 = union(sF9),
introduced(function_definition,[]) ).
fof(f73,plain,
union(sK0) = sF11,
introduced(function_definition,[]) ).
fof(f74,plain,
sF12 = union(sK1),
introduced(function_definition,[]) ).
fof(f75,plain,
sF13 = set_intersection2(sF11,sF12),
introduced(function_definition,[]) ).
fof(f44,plain,
~ subset(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
~ subset(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f20,f21]) ).
fof(f21,plain,
( ? [X0,X1] : ~ subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1)))
=> ~ subset(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] : ~ subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
inference(rectify,[],[f18]) ).
fof(f18,plain,
? [X1,X0] : ~ subset(union(set_intersection2(X1,X0)),set_intersection2(union(X1),union(X0))),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X1,X0] : subset(union(set_intersection2(X1,X0)),set_intersection2(union(X1),union(X0))),
inference(rectify,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X1,X0] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X1,X0] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t97_zfmisc_1) ).
fof(f245,plain,
subset(sF10,sF13),
inference(duplicate_literal_removal,[],[f240]) ).
fof(f240,plain,
( subset(sF10,sF13)
| subset(sF10,sF13) ),
inference(resolution,[],[f238,f62]) ).
fof(f62,plain,
! [X0,X1] :
( ~ in(sK7(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( ~ in(sK7(X0,X1),X0)
& in(sK7(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f38,f39]) ).
fof(f39,plain,
! [X0,X1] :
( ? [X3] :
( ~ in(X3,X0)
& in(X3,X1) )
=> ( ~ in(sK7(X0,X1),X0)
& in(sK7(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1] :
( ( ! [X2] :
( in(X2,X0)
| ~ in(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( ~ in(X3,X0)
& in(X3,X1) ) ) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X1,X0] :
( ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X1,X0] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f238,plain,
! [X0] :
( in(sK7(X0,sF10),sF13)
| subset(sF10,X0) ),
inference(subsumption_resolution,[],[f234,f213]) ).
fof(f213,plain,
! [X0] :
( in(sK7(X0,sF10),sF11)
| subset(sF10,X0) ),
inference(resolution,[],[f212,f61]) ).
fof(f61,plain,
! [X0,X1] :
( in(sK7(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f212,plain,
! [X2] :
( ~ in(X2,sF10)
| in(X2,sF11) ),
inference(duplicate_literal_removal,[],[f211]) ).
fof(f211,plain,
! [X2] :
( in(X2,sF11)
| ~ in(X2,sF10)
| ~ in(X2,sF10) ),
inference(forward_demodulation,[],[f209,f72]) ).
fof(f209,plain,
! [X2] :
( ~ in(X2,sF10)
| ~ in(X2,union(sF9))
| in(X2,sF11) ),
inference(resolution,[],[f141,f65]) ).
fof(f65,plain,
! [X1,X5] :
( in(X5,sK4(X1,X5))
| ~ in(X5,union(X1)) ),
inference(equality_resolution,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X5] :
( in(X5,sK4(X1,X5))
| ~ in(X5,X0)
| union(X1) != X0 ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( union(X1) = X0
| ( ( ~ in(sK2(X0,X1),X0)
| ! [X3] :
( ~ in(sK2(X0,X1),X3)
| ~ in(X3,X1) ) )
& ( in(sK2(X0,X1),X0)
| ( in(sK2(X0,X1),sK3(X0,X1))
& in(sK3(X0,X1),X1) ) ) ) )
& ( ! [X5] :
( ( ( in(X5,sK4(X1,X5))
& in(sK4(X1,X5),X1) )
| ~ in(X5,X0) )
& ( in(X5,X0)
| ! [X7] :
( ~ in(X5,X7)
| ~ in(X7,X1) ) ) )
| union(X1) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f24,f27,f26,f25]) ).
fof(f25,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X0)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X1) ) )
& ( in(X2,X0)
| ? [X4] :
( in(X2,X4)
& in(X4,X1) ) ) )
=> ( ( ~ in(sK2(X0,X1),X0)
| ! [X3] :
( ~ in(sK2(X0,X1),X3)
| ~ in(X3,X1) ) )
& ( in(sK2(X0,X1),X0)
| ? [X4] :
( in(sK2(X0,X1),X4)
& in(X4,X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0,X1] :
( ? [X4] :
( in(sK2(X0,X1),X4)
& in(X4,X1) )
=> ( in(sK2(X0,X1),sK3(X0,X1))
& in(sK3(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X1,X5] :
( ? [X6] :
( in(X5,X6)
& in(X6,X1) )
=> ( in(X5,sK4(X1,X5))
& in(sK4(X1,X5),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X1] :
( ( union(X1) = X0
| ? [X2] :
( ( ~ in(X2,X0)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X1) ) )
& ( in(X2,X0)
| ? [X4] :
( in(X2,X4)
& in(X4,X1) ) ) ) )
& ( ! [X5] :
( ( ? [X6] :
( in(X5,X6)
& in(X6,X1) )
| ~ in(X5,X0) )
& ( in(X5,X0)
| ! [X7] :
( ~ in(X5,X7)
| ~ in(X7,X1) ) ) )
| union(X1) != X0 ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X1,X0] :
( ( union(X0) = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) ) )
& ( in(X2,X1)
| ? [X3] :
( in(X2,X3)
& in(X3,X0) ) ) ) )
& ( ! [X2] :
( ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| ~ in(X2,X1) )
& ( in(X2,X1)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) ) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( union(X0) = X1
<=> ! [X2] :
( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
<=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(f141,plain,
! [X18,X17] :
( ~ in(X17,sK4(sF9,X18))
| in(X17,sF11)
| ~ in(X18,sF10) ),
inference(forward_demodulation,[],[f138,f73]) ).
fof(f138,plain,
! [X18,X17] :
( in(X17,union(sK0))
| ~ in(X18,sF10)
| ~ in(X17,sK4(sF9,X18)) ),
inference(resolution,[],[f67,f121]) ).
fof(f121,plain,
! [X9] :
( in(sK4(sF9,X9),sK0)
| ~ in(X9,sF10) ),
inference(forward_demodulation,[],[f118,f72]) ).
fof(f118,plain,
! [X9] :
( ~ in(X9,union(sF9))
| in(sK4(sF9,X9),sK0) ),
inference(resolution,[],[f66,f84]) ).
fof(f84,plain,
! [X8] :
( ~ in(X8,sF9)
| in(X8,sK0) ),
inference(superposition,[],[f68,f71]) ).
fof(f68,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f54]) ).
fof(f54,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK5(X0,X1,X2),X2)
| ~ in(sK5(X0,X1,X2),X0)
| ~ in(sK5(X0,X1,X2),X1) )
& ( in(sK5(X0,X1,X2),X2)
| ( in(sK5(X0,X1,X2),X0)
& in(sK5(X0,X1,X2),X1) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) )
& ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f31,f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X2)
| ( in(X3,X0)
& in(X3,X1) ) ) )
=> ( ( ~ in(sK5(X0,X1,X2),X2)
| ~ in(sK5(X0,X1,X2),X0)
| ~ in(sK5(X0,X1,X2),X1) )
& ( in(sK5(X0,X1,X2),X2)
| ( in(sK5(X0,X1,X2),X0)
& in(sK5(X0,X1,X2),X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X2)
| ( in(X3,X0)
& in(X3,X1) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) )
& ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [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) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) ) )
| set_intersection2(X2,X0) != X1 ) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
! [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) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
& in(X3,X0) )
| ~ in(X3,X1) )
& ( in(X3,X1)
| ~ in(X3,X2)
| ~ in(X3,X0) ) )
| set_intersection2(X2,X0) != X1 ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X2,X0,X1] :
( set_intersection2(X2,X0) = X1
<=> ! [X3] :
( ( in(X3,X2)
& in(X3,X0) )
<=> in(X3,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X2,X0] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f66,plain,
! [X1,X5] :
( in(sK4(X1,X5),X1)
| ~ in(X5,union(X1)) ),
inference(equality_resolution,[],[f46]) ).
fof(f46,plain,
! [X0,X1,X5] :
( in(sK4(X1,X5),X1)
| ~ in(X5,X0)
| union(X1) != X0 ),
inference(cnf_transformation,[],[f28]) ).
fof(f67,plain,
! [X1,X7,X5] :
( ~ in(X7,X1)
| in(X5,union(X1))
| ~ in(X5,X7) ),
inference(equality_resolution,[],[f45]) ).
fof(f45,plain,
! [X0,X1,X7,X5] :
( in(X5,X0)
| ~ in(X5,X7)
| ~ in(X7,X1)
| union(X1) != X0 ),
inference(cnf_transformation,[],[f28]) ).
fof(f234,plain,
! [X0] :
( in(sK7(X0,sF10),sF13)
| subset(sF10,X0)
| ~ in(sK7(X0,sF10),sF11) ),
inference(resolution,[],[f231,f175]) ).
fof(f175,plain,
! [X9] :
( ~ in(X9,sF12)
| ~ in(X9,sF11)
| in(X9,sF13) ),
inference(superposition,[],[f70,f75]) ).
fof(f70,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f52]) ).
fof(f52,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f33]) ).
fof(f231,plain,
! [X0] :
( in(sK7(X0,sF10),sF12)
| subset(sF10,X0) ),
inference(resolution,[],[f230,f61]) ).
fof(f230,plain,
! [X2] :
( ~ in(X2,sF10)
| in(X2,sF12) ),
inference(duplicate_literal_removal,[],[f229]) ).
fof(f229,plain,
! [X2] :
( ~ in(X2,sF10)
| in(X2,sF12)
| ~ in(X2,sF10) ),
inference(forward_demodulation,[],[f227,f72]) ).
fof(f227,plain,
! [X2] :
( ~ in(X2,union(sF9))
| ~ in(X2,sF10)
| in(X2,sF12) ),
inference(resolution,[],[f142,f65]) ).
fof(f142,plain,
! [X19,X20] :
( ~ in(X19,sK4(sF9,X20))
| in(X19,sF12)
| ~ in(X20,sF10) ),
inference(forward_demodulation,[],[f139,f74]) ).
fof(f139,plain,
! [X19,X20] :
( ~ in(X19,sK4(sF9,X20))
| in(X19,union(sK1))
| ~ in(X20,sF10) ),
inference(resolution,[],[f67,f122]) ).
fof(f122,plain,
! [X8] :
( in(sK4(sF9,X8),sK1)
| ~ in(X8,sF10) ),
inference(forward_demodulation,[],[f117,f72]) ).
fof(f117,plain,
! [X8] :
( in(sK4(sF9,X8),sK1)
| ~ in(X8,union(sF9)) ),
inference(resolution,[],[f66,f92]) ).
fof(f92,plain,
! [X8] :
( ~ in(X8,sF9)
| in(X8,sK1) ),
inference(superposition,[],[f69,f71]) ).
fof(f69,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f53]) ).
fof(f53,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET944+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.30 % Computer : n025.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Aug 30 14:40:45 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.15/0.46 % (28143)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.15/0.47 % (28160)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 (3000ds/467Mi)
% 0.15/0.47 % (28152)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 (3000ds/75Mi)
% 0.15/0.47 TRYING [1]
% 0.15/0.47 TRYING [2]
% 0.15/0.48 % (28141)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.15/0.48 TRYING [3]
% 0.15/0.48 TRYING [4]
% 0.15/0.48 % (28159)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 (3000ds/498Mi)
% 0.15/0.48 % (28144)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.15/0.49 % (28151)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 (3000ds/68Mi)
% 0.15/0.50 % (28142)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 (3000ds/48Mi)
% 0.15/0.50 % (28137)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 (3000ds/191324Mi)
% 0.15/0.50 % (28138)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.15/0.50 % (28139)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 (3000ds/37Mi)
% 0.15/0.50 % (28140)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.15/0.50 % (28144)Instruction limit reached!
% 0.15/0.50 % (28144)------------------------------
% 0.15/0.50 % (28144)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.50 % (28144)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.50 % (28144)Termination reason: Unknown
% 0.15/0.50 % (28144)Termination phase: Saturation
% 0.15/0.50
% 0.15/0.50 % (28144)Memory used [KB]: 5500
% 0.15/0.50 % (28144)Time elapsed: 0.082 s
% 0.15/0.50 % (28144)Instructions burned: 7 (million)
% 0.15/0.50 % (28144)------------------------------
% 0.15/0.50 % (28144)------------------------------
% 0.15/0.50 % (28145)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.50 % (28145)Instruction limit reached!
% 0.15/0.50 % (28145)------------------------------
% 0.15/0.50 % (28145)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.50 % (28145)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.50 % (28145)Termination reason: Unknown
% 0.15/0.50 % (28145)Termination phase: Saturation
% 0.15/0.50
% 0.15/0.50 % (28145)Memory used [KB]: 5373
% 0.15/0.50 % (28145)Time elapsed: 0.003 s
% 0.15/0.50 % (28145)Instructions burned: 2 (million)
% 0.15/0.50 % (28145)------------------------------
% 0.15/0.50 % (28145)------------------------------
% 0.15/0.50 % (28146)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 (3000ds/51Mi)
% 0.15/0.51 % (28157)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 (3000ds/176Mi)
% 0.15/0.52 % (28156)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 (3000ds/100Mi)
% 0.15/0.52 % (28138)Refutation not found, incomplete strategy% (28138)------------------------------
% 0.15/0.52 % (28138)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.52 % (28138)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.52 % (28138)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.52
% 0.15/0.52 % (28138)Memory used [KB]: 5500
% 0.15/0.52 % (28138)Time elapsed: 0.151 s
% 0.15/0.52 % (28138)Instructions burned: 3 (million)
% 0.15/0.52 % (28138)------------------------------
% 0.15/0.52 % (28138)------------------------------
% 0.15/0.52 % (28149)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.15/0.52 TRYING [1]
% 0.15/0.52 TRYING [2]
% 0.15/0.53 TRYING [3]
% 0.15/0.53 % (28158)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.15/0.53 % (28155)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.15/0.53 % (28164)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 (3000ds/177Mi)
% 0.15/0.53 % (28162)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/500Mi)
% 0.15/0.53 % (28161)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 0.15/0.54 % (28153)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 (3000ds/99Mi)
% 0.15/0.54 % (28154)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 0.15/0.54 % (28150)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.15/0.54 % (28143)Instruction limit reached!
% 0.15/0.54 % (28143)------------------------------
% 0.15/0.54 % (28143)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.54 % (28148)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.15/0.54 % (28143)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.54 % (28143)Termination reason: Unknown
% 0.15/0.54 % (28143)Termination phase: Finite model building SAT solving
% 0.15/0.54
% 0.15/0.54 % (28143)Memory used [KB]: 7547
% 0.15/0.54 % (28143)Time elapsed: 0.147 s
% 0.15/0.54 % (28143)Instructions burned: 52 (million)
% 0.15/0.54 % (28143)------------------------------
% 0.15/0.54 % (28143)------------------------------
% 0.15/0.54 % (28165)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 0.15/0.54 % (28166)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 (3000ds/355Mi)
% 0.15/0.54 % (28163)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 (3000ds/68Mi)
% 0.15/0.55 % (28147)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.15/0.55 % (28149)First to succeed.
% 0.15/0.55 % (28149)Refutation found. Thanks to Tanya!
% 0.15/0.55 % SZS status Theorem for theBenchmark
% 0.15/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.55 % (28149)------------------------------
% 0.15/0.55 % (28149)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.55 % (28149)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.55 % (28149)Termination reason: Refutation
% 0.15/0.55
% 0.15/0.55 % (28149)Memory used [KB]: 5628
% 0.15/0.55 % (28149)Time elapsed: 0.187 s
% 0.15/0.55 % (28149)Instructions burned: 11 (million)
% 0.15/0.55 % (28149)------------------------------
% 0.15/0.55 % (28149)------------------------------
% 0.15/0.55 % (28136)Success in time 0.239 s
%------------------------------------------------------------------------------