TSTP Solution File: SYN549+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN549+1 : TPTP v8.1.0. Released v2.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 : n021.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 19:38:53 EDT 2022
% Result : Theorem 0.15s 0.54s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 69 ( 5 unt; 0 def)
% Number of atoms : 297 ( 0 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 362 ( 134 ~; 145 |; 67 &)
% ( 5 <=>; 9 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 147 ( 105 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f410,plain,
$false,
inference(resolution,[],[f409,f40]) ).
fof(f40,plain,
! [X0] : reachable(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : reachable(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_reachable) ).
fof(f409,plain,
! [X0] : ~ reachable(initial_world,X0),
inference(subsumption_resolution,[],[f38,f402]) ).
fof(f402,plain,
! [X0] : ~ sP1(X0),
inference(subsumption_resolution,[],[f401,f137]) ).
fof(f137,plain,
! [X0] :
( q(sK3(X0))
| ~ sP1(X0) ),
inference(subsumption_resolution,[],[f105,f133]) ).
fof(f133,plain,
! [X0] :
( ~ sP1(X0)
| ~ sP0(X0) ),
inference(subsumption_resolution,[],[f131,f92]) ).
fof(f92,plain,
! [X0] :
( ~ sP7(X0)
| ~ sP1(X0)
| ~ sP0(X0) ),
inference(resolution,[],[f42,f40]) ).
fof(f42,plain,
! [X0,X1] :
( ~ reachable(X0,X1)
| ~ sP7(X1)
| ~ sP1(X0)
| ~ sP0(X0) ),
inference(general_splitting,[],[f30,f41_D]) ).
fof(f41,plain,
! [X2,X1] :
( ~ reachable(X1,X2)
| ~ q(X2)
| sP7(X1) ),
inference(cnf_transformation,[],[f41_D]) ).
fof(f41_D,plain,
! [X1] :
( ! [X2] :
( ~ reachable(X1,X2)
| ~ q(X2) )
<=> ~ sP7(X1) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP7])]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ q(X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| ~ sP0(X0)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0] :
( ( ( ! [X1] :
( ( ! [X2] :
( ~ q(X2)
| ~ reachable(X1,X2) )
& ~ p(X1) )
| ~ reachable(X0,X1) )
| ~ sP0(X0) )
& ( ( ( ( q(sK3(X0))
& reachable(sK2(X0),sK3(X0)) )
| p(sK2(X0)) )
& reachable(X0,sK2(X0)) )
| sP0(X0) ) )
| ~ sP1(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f13,f15,f14]) ).
fof(f14,plain,
! [X0] :
( ? [X3] :
( ( ? [X4] :
( q(X4)
& reachable(X3,X4) )
| p(X3) )
& reachable(X0,X3) )
=> ( ( ? [X4] :
( q(X4)
& reachable(sK2(X0),X4) )
| p(sK2(X0)) )
& reachable(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ? [X4] :
( q(X4)
& reachable(sK2(X0),X4) )
=> ( q(sK3(X0))
& reachable(sK2(X0),sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0] :
( ( ( ! [X1] :
( ( ! [X2] :
( ~ q(X2)
| ~ reachable(X1,X2) )
& ~ p(X1) )
| ~ reachable(X0,X1) )
| ~ sP0(X0) )
& ( ? [X3] :
( ( ? [X4] :
( q(X4)
& reachable(X3,X4) )
| p(X3) )
& reachable(X0,X3) )
| sP0(X0) ) )
| ~ sP1(X0) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X1] :
( ( ( ! [X2] :
( ( ! [X3] :
( ~ q(X3)
| ~ reachable(X2,X3) )
& ~ p(X2) )
| ~ reachable(X1,X2) )
| ~ sP0(X1) )
& ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
| sP0(X1) ) )
| ~ sP1(X1) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X1] :
( ( sP0(X1)
<~> ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) ) )
| ~ sP1(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f131,plain,
! [X0] :
( ~ sP1(X0)
| ~ sP0(X0)
| sP7(X0) ),
inference(duplicate_literal_removal,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ~ sP0(X0)
| ~ sP1(X0)
| ~ sP0(X0)
| sP7(X0) ),
inference(resolution,[],[f127,f66]) ).
fof(f66,plain,
! [X1] :
( p(sK4(X1))
| ~ sP0(X1)
| sP7(X1) ),
inference(subsumption_resolution,[],[f63,f32]) ).
fof(f32,plain,
! [X0] :
( q(sK5(X0))
| p(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X1] :
( ~ reachable(X0,X1)
| ~ p(X1) )
& ! [X2] :
( ~ q(X2)
| ~ reachable(X0,X2) ) ) )
& ( ( reachable(X0,sK4(X0))
& p(sK4(X0)) )
| ( q(sK5(X0))
& reachable(X0,sK5(X0)) )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f19,f21,f20]) ).
fof(f20,plain,
! [X0] :
( ? [X3] :
( reachable(X0,X3)
& p(X3) )
=> ( reachable(X0,sK4(X0))
& p(sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0] :
( ? [X4] :
( q(X4)
& reachable(X0,X4) )
=> ( q(sK5(X0))
& reachable(X0,sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X1] :
( ~ reachable(X0,X1)
| ~ p(X1) )
& ! [X2] :
( ~ q(X2)
| ~ reachable(X0,X2) ) ) )
& ( ? [X3] :
( reachable(X0,X3)
& p(X3) )
| ? [X4] :
( q(X4)
& reachable(X0,X4) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X1] :
( ( sP0(X1)
| ( ! [X4] :
( ~ reachable(X1,X4)
| ~ p(X4) )
& ! [X5] :
( ~ q(X5)
| ~ reachable(X1,X5) ) ) )
& ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( q(X5)
& reachable(X1,X5) )
| ~ sP0(X1) ) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X1] :
( ( sP0(X1)
| ( ! [X4] :
( ~ reachable(X1,X4)
| ~ p(X4) )
& ! [X5] :
( ~ q(X5)
| ~ reachable(X1,X5) ) ) )
& ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( q(X5)
& reachable(X1,X5) )
| ~ sP0(X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1] :
( sP0(X1)
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( q(X5)
& reachable(X1,X5) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f63,plain,
! [X1] :
( p(sK4(X1))
| sP7(X1)
| ~ q(sK5(X1))
| ~ sP0(X1) ),
inference(resolution,[],[f31,f41]) ).
fof(f31,plain,
! [X0] :
( reachable(X0,sK5(X0))
| p(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f127,plain,
! [X8] :
( ~ p(sK4(X8))
| ~ sP1(X8)
| ~ sP0(X8) ),
inference(subsumption_resolution,[],[f123,f92]) ).
fof(f123,plain,
! [X8] :
( ~ p(sK4(X8))
| ~ sP1(X8)
| ~ sP0(X8)
| sP7(X8) ),
inference(resolution,[],[f116,f55]) ).
fof(f55,plain,
! [X0,X1] :
( ~ reachable(X0,X1)
| ~ p(X1)
| ~ sP1(X0) ),
inference(subsumption_resolution,[],[f29,f36]) ).
fof(f36,plain,
! [X0,X1] :
( ~ reachable(X0,X1)
| sP0(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f29,plain,
! [X0,X1] :
( ~ sP1(X0)
| ~ reachable(X0,X1)
| ~ sP0(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f116,plain,
! [X6] :
( reachable(X6,sK4(X6))
| ~ sP0(X6)
| sP7(X6) ),
inference(subsumption_resolution,[],[f112,f34]) ).
fof(f34,plain,
! [X0] :
( reachable(X0,sK4(X0))
| q(sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f112,plain,
! [X6] :
( sP7(X6)
| ~ q(sK5(X6))
| reachable(X6,sK4(X6))
| ~ sP0(X6) ),
inference(resolution,[],[f33,f41]) ).
fof(f33,plain,
! [X0] :
( reachable(X0,sK5(X0))
| ~ sP0(X0)
| reachable(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f105,plain,
! [X0] :
( q(sK3(X0))
| sP0(X0)
| ~ sP1(X0) ),
inference(subsumption_resolution,[],[f28,f53]) ).
fof(f53,plain,
! [X1] :
( ~ p(sK2(X1))
| ~ sP1(X1)
| sP0(X1) ),
inference(duplicate_literal_removal,[],[f50]) ).
fof(f50,plain,
! [X1] :
( sP0(X1)
| ~ sP1(X1)
| ~ p(sK2(X1))
| sP0(X1) ),
inference(resolution,[],[f26,f36]) ).
fof(f26,plain,
! [X0] :
( reachable(X0,sK2(X0))
| ~ sP1(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
! [X0] :
( q(sK3(X0))
| p(sK2(X0))
| ~ sP1(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f401,plain,
! [X0] :
( ~ q(sK3(X0))
| ~ sP1(X0) ),
inference(duplicate_literal_removal,[],[f379]) ).
fof(f379,plain,
! [X0] :
( ~ q(sK3(X0))
| ~ sP1(X0)
| ~ sP1(X0) ),
inference(resolution,[],[f378,f333]) ).
fof(f333,plain,
! [X6,X7] :
( ~ reachable(sK2(X6),X7)
| ~ sP1(X6)
| ~ q(X7) ),
inference(subsumption_resolution,[],[f312,f133]) ).
fof(f312,plain,
! [X6,X7] :
( ~ sP1(X6)
| sP0(X6)
| ~ q(X7)
| ~ reachable(sK2(X6),X7) ),
inference(resolution,[],[f79,f134]) ).
fof(f134,plain,
! [X0] :
( reachable(X0,sK2(X0))
| ~ sP1(X0) ),
inference(subsumption_resolution,[],[f26,f133]) ).
fof(f79,plain,
! [X18,X19,X17] :
( ~ reachable(X17,X18)
| ~ reachable(X18,X19)
| sP0(X17)
| ~ q(X19) ),
inference(resolution,[],[f39,f35]) ).
fof(f35,plain,
! [X2,X0] :
( ~ reachable(X0,X2)
| sP0(X0)
| ~ q(X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
! [X2,X0,X1] :
( reachable(X1,X2)
| ~ reachable(X1,X0)
| ~ reachable(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ~ reachable(X0,X2)
| reachable(X1,X2)
| ~ reachable(X1,X0) ),
inference(rectify,[],[f7]) ).
fof(f7,plain,
! [X1,X0,X2] :
( ~ reachable(X1,X2)
| reachable(X0,X2)
| ~ reachable(X0,X1) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
! [X1,X2,X0] :
( reachable(X0,X2)
| ~ reachable(X0,X1)
| ~ reachable(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X1,X2,X0] :
( ( reachable(X0,X1)
& reachable(X1,X2) )
=> reachable(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_reachable) ).
fof(f378,plain,
! [X0] :
( reachable(sK2(X0),sK3(X0))
| ~ sP1(X0) ),
inference(subsumption_resolution,[],[f377,f136]) ).
fof(f136,plain,
! [X1] :
( ~ p(sK2(X1))
| ~ sP1(X1) ),
inference(subsumption_resolution,[],[f53,f133]) ).
fof(f377,plain,
! [X0] :
( ~ sP1(X0)
| reachable(sK2(X0),sK3(X0))
| p(sK2(X0)) ),
inference(subsumption_resolution,[],[f27,f133]) ).
fof(f27,plain,
! [X0] :
( p(sK2(X0))
| ~ sP1(X0)
| sP0(X0)
| reachable(sK2(X0),sK3(X0)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f38,plain,
! [X0] :
( sP1(sK6(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| ( sP1(sK6(X0))
& reachable(X0,sK6(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f11,f23]) ).
fof(f23,plain,
! [X0] :
( ? [X1] :
( sP1(X1)
& reachable(X0,X1) )
=> ( sP1(sK6(X0))
& reachable(X0,sK6(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| ? [X1] :
( sP1(X1)
& reachable(X0,X1) ) ),
inference(definition_folding,[],[f8,f10,f9]) ).
fof(f8,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| ? [X1] :
( ( ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( q(X5)
& reachable(X1,X5) ) )
<~> ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) ) )
& reachable(X0,X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,plain,
~ ? [X0] :
( reachable(initial_world,X0)
& ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X5] :
( q(X5)
& reachable(X1,X5) ) ) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X4] :
( reachable(X1,X4)
& q(X4) ) ) ) )
& reachable(initial_world,X0) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
<=> ( ? [X4] :
( reachable(X1,X4)
& p(X4) )
| ? [X4] :
( reachable(X1,X4)
& q(X4) ) ) ) )
& reachable(initial_world,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN549+1 : TPTP v8.1.0. Released v2.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.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 30 22:03:41 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.15/0.46 % (13084)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 % (13093)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.47 TRYING [1]
% 0.15/0.47 TRYING [2]
% 0.15/0.47 TRYING [3]
% 0.15/0.47 TRYING [4]
% 0.15/0.47 % (13102)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.48 % (13101)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 % (13087)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.48 % (13094)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.49 % (13082)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.49 % (13085)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.50 % (13078)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 % (13081)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 % (13083)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 % (13079)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 % (13079)Refutation not found, incomplete strategy% (13079)------------------------------
% 0.15/0.50 % (13079)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.50 % (13079)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.50 % (13079)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.50
% 0.15/0.50 % (13079)Memory used [KB]: 5373
% 0.15/0.50 % (13079)Time elapsed: 0.134 s
% 0.15/0.50 % (13079)Instructions burned: 1 (million)
% 0.15/0.50 % (13079)------------------------------
% 0.15/0.50 % (13079)------------------------------
% 0.15/0.50 TRYING [5]
% 0.15/0.51 % (13090)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.51 % (13085)Instruction limit reached!
% 0.15/0.51 % (13085)------------------------------
% 0.15/0.51 % (13085)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.51 % (13085)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.51 % (13085)Termination reason: Unknown
% 0.15/0.51 % (13085)Termination phase: Saturation
% 0.15/0.51
% 0.15/0.51 % (13089)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.51 % (13085)Memory used [KB]: 5500
% 0.15/0.51 % (13085)Time elapsed: 0.091 s
% 0.15/0.51 % (13085)Instructions burned: 7 (million)
% 0.15/0.51 % (13085)------------------------------
% 0.15/0.51 % (13085)------------------------------
% 0.15/0.51 % (13086)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.51 % (13086)Instruction limit reached!
% 0.15/0.51 % (13086)------------------------------
% 0.15/0.51 % (13086)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.51 % (13099)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.51 % (13100)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.52 % (13086)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.52 % (13086)Termination reason: Unknown
% 0.15/0.52 % (13086)Termination phase: Saturation
% 0.15/0.52
% 0.15/0.52 % (13086)Memory used [KB]: 5373
% 0.15/0.52 % (13086)Time elapsed: 0.141 s
% 0.15/0.52 % (13086)Instructions burned: 3 (million)
% 0.15/0.52 % (13086)------------------------------
% 0.15/0.52 % (13086)------------------------------
% 0.15/0.52 TRYING [1]
% 0.15/0.52 % (13092)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.52 % (13080)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.53 TRYING [2]
% 0.15/0.53 TRYING [3]
% 0.15/0.53 % (13103)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.53 TRYING [4]
% 0.15/0.53 % (13106)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 % (13105)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.53 % (13084)Instruction limit reached!
% 0.15/0.53 % (13084)------------------------------
% 0.15/0.53 % (13084)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.53 % (13084)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.53 % (13084)Termination reason: Unknown
% 0.15/0.53 % (13084)Termination phase: Finite model building SAT solving
% 0.15/0.53
% 0.15/0.53 % (13084)Memory used [KB]: 5756
% 0.15/0.53 % (13084)Time elapsed: 0.131 s
% 0.15/0.53 % (13084)Instructions burned: 51 (million)
% 0.15/0.53 % (13084)------------------------------
% 0.15/0.53 % (13084)------------------------------
% 0.15/0.53 % (13095)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.53 % (13083)First to succeed.
% 0.15/0.54 % (13083)Refutation found. Thanks to Tanya!
% 0.15/0.54 % SZS status Theorem for theBenchmark
% 0.15/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.54 % (13083)------------------------------
% 0.15/0.54 % (13083)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.54 % (13083)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.54 % (13083)Termination reason: Refutation
% 0.15/0.54
% 0.15/0.54 % (13083)Memory used [KB]: 5628
% 0.15/0.54 % (13083)Time elapsed: 0.169 s
% 0.15/0.54 % (13083)Instructions burned: 17 (million)
% 0.15/0.54 % (13083)------------------------------
% 0.15/0.54 % (13083)------------------------------
% 0.15/0.54 % (13077)Success in time 0.219 s
%------------------------------------------------------------------------------