TSTP Solution File: SWV417+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n026.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:45:31 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 65 ( 13 unt; 0 def)
% Number of atoms : 154 ( 38 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 147 ( 58 ~; 48 |; 22 &)
% ( 7 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 96 ( 81 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f400,plain,
$false,
inference(avatar_sat_refutation,[],[f338,f380,f390,f394,f395,f399]) ).
fof(f399,plain,
( spl6_6
| ~ spl6_3
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f396,f332,f325,f336]) ).
fof(f336,plain,
( spl6_6
<=> findmin_pqp_res(sK2) = findmin_pq_res(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f325,plain,
( spl6_3
<=> contains_pq(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f332,plain,
( spl6_5
<=> issmallestelement_pq(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f396,plain,
( ~ contains_pq(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2))
| findmin_pqp_res(sK2) = findmin_pq_res(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2))
| ~ spl6_5 ),
inference(resolution,[],[f280,f333]) ).
fof(f333,plain,
( issmallestelement_pq(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2))
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f332]) ).
fof(f280,plain,
! [X0,X1] :
( ~ issmallestelement_pq(X1,X0)
| findmin_pq_res(X1,X0) = X0
| ~ contains_pq(X1,X0) ),
inference(cnf_transformation,[],[f204]) ).
fof(f204,plain,
! [X0,X1] :
( ~ contains_pq(X1,X0)
| ~ issmallestelement_pq(X1,X0)
| findmin_pq_res(X1,X0) = X0 ),
inference(rectify,[],[f121]) ).
fof(f121,plain,
! [X1,X0] :
( ~ contains_pq(X0,X1)
| ~ issmallestelement_pq(X0,X1)
| findmin_pq_res(X0,X1) = X1 ),
inference(flattening,[],[f120]) ).
fof(f120,plain,
! [X0,X1] :
( findmin_pq_res(X0,X1) = X1
| ~ issmallestelement_pq(X0,X1)
| ~ contains_pq(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0,X1] :
( ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) )
=> findmin_pq_res(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax14) ).
fof(f395,plain,
( spl6_3
| ~ spl6_7 ),
inference(avatar_split_clause,[],[f392,f340,f325]) ).
fof(f340,plain,
( spl6_7
<=> pi_sharp_find_min(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
fof(f392,plain,
( contains_pq(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2))
| ~ spl6_7 ),
inference(resolution,[],[f341,f216]) ).
fof(f216,plain,
! [X0,X1] :
( ~ pi_sharp_find_min(X1,X0)
| contains_pq(X1,X0) ),
inference(cnf_transformation,[],[f159]) ).
fof(f159,plain,
! [X0,X1] :
( ( ( contains_pq(X1,X0)
& issmallestelement_pq(X1,X0) )
| ~ pi_sharp_find_min(X1,X0) )
& ( pi_sharp_find_min(X1,X0)
| ~ contains_pq(X1,X0)
| ~ issmallestelement_pq(X1,X0) ) ),
inference(flattening,[],[f158]) ).
fof(f158,plain,
! [X0,X1] :
( ( ( contains_pq(X1,X0)
& issmallestelement_pq(X1,X0) )
| ~ pi_sharp_find_min(X1,X0) )
& ( pi_sharp_find_min(X1,X0)
| ~ contains_pq(X1,X0)
| ~ issmallestelement_pq(X1,X0) ) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0,X1] :
( ( contains_pq(X1,X0)
& issmallestelement_pq(X1,X0) )
<=> pi_sharp_find_min(X1,X0) ),
inference(rectify,[],[f58]) ).
fof(f58,axiom,
! [X1,X0] :
( pi_sharp_find_min(X0,X1)
<=> ( issmallestelement_pq(X0,X1)
& contains_pq(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f341,plain,
( pi_sharp_find_min(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2))
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f340]) ).
fof(f394,plain,
( spl6_5
| ~ spl6_7 ),
inference(avatar_split_clause,[],[f393,f340,f332]) ).
fof(f393,plain,
( issmallestelement_pq(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2))
| ~ spl6_7 ),
inference(resolution,[],[f341,f215]) ).
fof(f215,plain,
! [X0,X1] :
( ~ pi_sharp_find_min(X1,X0)
| issmallestelement_pq(X1,X0) ),
inference(cnf_transformation,[],[f159]) ).
fof(f390,plain,
( spl6_4
| spl6_7 ),
inference(avatar_split_clause,[],[f389,f340,f328]) ).
fof(f328,plain,
( spl6_4
<=> create_slb = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f389,plain,
( pi_sharp_find_min(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2))
| create_slb = sK1 ),
inference(superposition,[],[f293,f217]) ).
fof(f217,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X1) = findmin_cpq_res(triple(X1,X2,X0))
| create_slb = X2 ),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
! [X0,X1,X2] :
( findmin_pqp_res(X1) = findmin_cpq_res(triple(X1,X2,X0))
| create_slb = X2 ),
inference(rectify,[],[f143]) ).
fof(f143,plain,
! [X2,X0,X3] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X3,X2))
| create_slb = X3 ),
inference(ennf_transformation,[],[f79]) ).
fof(f79,plain,
! [X0,X2,X3] :
( create_slb != X3
=> findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X3,X2)) ),
inference(rectify,[],[f51]) ).
fof(f51,axiom,
! [X0,X3,X2,X1] :
( create_slb != X1
=> findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax51) ).
fof(f293,plain,
pi_sharp_find_min(i(triple(sK2,sK1,sK3)),findmin_cpq_res(triple(sK2,sK1,sK3))),
inference(resolution,[],[f235,f226]) ).
fof(f226,plain,
phi(findmin_cpq_eff(triple(sK2,sK1,sK3))),
inference(cnf_transformation,[],[f167]) ).
fof(f167,plain,
( pi_find_min(triple(sK2,sK1,sK3))
& phi(findmin_cpq_eff(triple(sK2,sK1,sK3)))
& ! [X3] :
( findmin_pq_res(i(triple(sK2,sK1,sK3)),X3) != findmin_cpq_res(triple(sK2,sK1,sK3))
| ~ pi_sharp_find_min(i(triple(sK2,sK1,sK3)),X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f165,f166]) ).
fof(f166,plain,
( ? [X0,X1,X2] :
( pi_find_min(triple(X1,X0,X2))
& phi(findmin_cpq_eff(triple(X1,X0,X2)))
& ! [X3] :
( findmin_cpq_res(triple(X1,X0,X2)) != findmin_pq_res(i(triple(X1,X0,X2)),X3)
| ~ pi_sharp_find_min(i(triple(X1,X0,X2)),X3) ) )
=> ( pi_find_min(triple(sK2,sK1,sK3))
& phi(findmin_cpq_eff(triple(sK2,sK1,sK3)))
& ! [X3] :
( findmin_pq_res(i(triple(sK2,sK1,sK3)),X3) != findmin_cpq_res(triple(sK2,sK1,sK3))
| ~ pi_sharp_find_min(i(triple(sK2,sK1,sK3)),X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f165,plain,
? [X0,X1,X2] :
( pi_find_min(triple(X1,X0,X2))
& phi(findmin_cpq_eff(triple(X1,X0,X2)))
& ! [X3] :
( findmin_cpq_res(triple(X1,X0,X2)) != findmin_pq_res(i(triple(X1,X0,X2)),X3)
| ~ pi_sharp_find_min(i(triple(X1,X0,X2)),X3) ) ),
inference(rectify,[],[f138]) ).
fof(f138,plain,
? [X2,X0,X1] :
( pi_find_min(triple(X0,X2,X1))
& phi(findmin_cpq_eff(triple(X0,X2,X1)))
& ! [X3] :
( findmin_cpq_res(triple(X0,X2,X1)) != findmin_pq_res(i(triple(X0,X2,X1)),X3)
| ~ pi_sharp_find_min(i(triple(X0,X2,X1)),X3) ) ),
inference(flattening,[],[f137]) ).
fof(f137,plain,
? [X0,X1,X2] :
( ! [X3] :
( findmin_cpq_res(triple(X0,X2,X1)) != findmin_pq_res(i(triple(X0,X2,X1)),X3)
| ~ pi_sharp_find_min(i(triple(X0,X2,X1)),X3) )
& phi(findmin_cpq_eff(triple(X0,X2,X1)))
& pi_find_min(triple(X0,X2,X1)) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,plain,
~ ! [X0,X1,X2] :
( pi_find_min(triple(X0,X2,X1))
=> ( phi(findmin_cpq_eff(triple(X0,X2,X1)))
=> ? [X3] :
( pi_sharp_find_min(i(triple(X0,X2,X1)),X3)
& findmin_cpq_res(triple(X0,X2,X1)) = findmin_pq_res(i(triple(X0,X2,X1)),X3) ) ) ),
inference(rectify,[],[f65]) ).
fof(f65,negated_conjecture,
~ ! [X0,X2,X1] :
( pi_find_min(triple(X0,X1,X2))
=> ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> ? [X3] :
( pi_sharp_find_min(i(triple(X0,X1,X2)),X3)
& findmin_cpq_res(triple(X0,X1,X2)) = findmin_pq_res(i(triple(X0,X1,X2)),X3) ) ) ),
inference(negated_conjecture,[],[f64]) ).
fof(f64,conjecture,
! [X0,X2,X1] :
( pi_find_min(triple(X0,X1,X2))
=> ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> ? [X3] :
( pi_sharp_find_min(i(triple(X0,X1,X2)),X3)
& findmin_cpq_res(triple(X0,X1,X2)) = findmin_pq_res(i(triple(X0,X1,X2)),X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co4) ).
fof(f235,plain,
! [X2,X0,X1] :
( ~ phi(findmin_cpq_eff(triple(X0,X2,X1)))
| pi_sharp_find_min(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1))) ),
inference(cnf_transformation,[],[f173]) ).
fof(f173,plain,
! [X0,X1,X2] :
( pi_sharp_find_min(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1)))
| ~ phi(findmin_cpq_eff(triple(X0,X2,X1))) ),
inference(rectify,[],[f133]) ).
fof(f133,plain,
! [X2,X0,X1] :
( pi_sharp_find_min(i(triple(X2,X1,X0)),findmin_cpq_res(triple(X2,X1,X0)))
| ~ phi(findmin_cpq_eff(triple(X2,X1,X0))) ),
inference(ennf_transformation,[],[f91]) ).
fof(f91,plain,
! [X1,X2,X0] :
( phi(findmin_cpq_eff(triple(X2,X1,X0)))
=> pi_sharp_find_min(i(triple(X2,X1,X0)),findmin_cpq_res(triple(X2,X1,X0))) ),
inference(rectify,[],[f63]) ).
fof(f63,axiom,
! [X2,X1,X0] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main4_l7) ).
fof(f380,plain,
~ spl6_4,
inference(avatar_contradiction_clause,[],[f378]) ).
fof(f378,plain,
( $false
| ~ spl6_4 ),
inference(resolution,[],[f360,f274]) ).
fof(f274,plain,
! [X0] : ~ contains_pq(create_pq,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] : ~ contains_pq(create_pq,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax8) ).
fof(f360,plain,
( contains_pq(create_pq,bottom)
| ~ spl6_4 ),
inference(forward_demodulation,[],[f359,f240]) ).
fof(f240,plain,
! [X0,X1] : create_pq = i(triple(X1,create_slb,X0)),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
! [X0,X1] : create_pq = i(triple(X1,create_slb,X0)),
inference(rectify,[],[f54]) ).
fof(f54,axiom,
! [X1,X0] : create_pq = i(triple(X0,create_slb,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax54) ).
fof(f359,plain,
( contains_pq(i(triple(sK2,create_slb,sK3)),bottom)
| ~ spl6_4 ),
inference(forward_demodulation,[],[f350,f238]) ).
fof(f238,plain,
! [X0,X1] : bottom = findmin_cpq_res(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f50]) ).
fof(f50,axiom,
! [X0,X1] : bottom = findmin_cpq_res(triple(X0,create_slb,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax50) ).
fof(f350,plain,
( contains_pq(i(triple(sK2,create_slb,sK3)),findmin_cpq_res(triple(sK2,create_slb,sK3)))
| ~ spl6_4 ),
inference(backward_demodulation,[],[f297,f329]) ).
fof(f329,plain,
( create_slb = sK1
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f328]) ).
fof(f297,plain,
contains_pq(i(triple(sK2,sK1,sK3)),findmin_cpq_res(triple(sK2,sK1,sK3))),
inference(resolution,[],[f216,f293]) ).
fof(f338,plain,
( ~ spl6_6
| spl6_4 ),
inference(avatar_split_clause,[],[f319,f328,f336]) ).
fof(f319,plain,
( create_slb = sK1
| findmin_pqp_res(sK2) != findmin_pq_res(i(triple(sK2,sK1,sK3)),findmin_pqp_res(sK2)) ),
inference(superposition,[],[f294,f217]) ).
fof(f294,plain,
findmin_pq_res(i(triple(sK2,sK1,sK3)),findmin_cpq_res(triple(sK2,sK1,sK3))) != findmin_cpq_res(triple(sK2,sK1,sK3)),
inference(resolution,[],[f293,f225]) ).
fof(f225,plain,
! [X3] :
( ~ pi_sharp_find_min(i(triple(sK2,sK1,sK3)),X3)
| findmin_pq_res(i(triple(sK2,sK1,sK3)),X3) != findmin_cpq_res(triple(sK2,sK1,sK3)) ),
inference(cnf_transformation,[],[f167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 19:37:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.51 % (4468)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.51 % (4463)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.51 % (4461)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.51 % (4484)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.51 % (4476)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.51 % (4469)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51 % (4472)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51 % (4472)Instruction limit reached!
% 0.19/0.51 % (4472)------------------------------
% 0.19/0.51 % (4472)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (4472)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (4472)Termination reason: Unknown
% 0.19/0.51 % (4472)Termination phase: shuffling
% 0.19/0.51
% 0.19/0.51 % (4472)Memory used [KB]: 1535
% 0.19/0.51 % (4472)Time elapsed: 0.003 s
% 0.19/0.51 % (4472)Instructions burned: 4 (million)
% 0.19/0.51 % (4472)------------------------------
% 0.19/0.51 % (4472)------------------------------
% 0.19/0.51 % (4457)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.52 % (4479)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.52 % (4485)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.52 % (4476)Instruction limit reached!
% 0.19/0.52 % (4476)------------------------------
% 0.19/0.52 % (4476)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (4476)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (4476)Termination reason: Unknown
% 0.19/0.52 % (4476)Termination phase: Saturation
% 0.19/0.52
% 0.19/0.52 % (4476)Memory used [KB]: 6012
% 0.19/0.52 % (4476)Time elapsed: 0.006 s
% 0.19/0.52 % (4476)Instructions burned: 3 (million)
% 0.19/0.52 % (4476)------------------------------
% 0.19/0.52 % (4476)------------------------------
% 0.19/0.52 % (4481)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.52 % (4485)First to succeed.
% 0.19/0.52 % (4468)Refutation not found, incomplete strategy% (4468)------------------------------
% 0.19/0.52 % (4468)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (4468)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (4468)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.52
% 0.19/0.52 % (4468)Memory used [KB]: 6012
% 0.19/0.52 % (4468)Time elapsed: 0.128 s
% 0.19/0.52 % (4468)Instructions burned: 7 (million)
% 0.19/0.52 % (4468)------------------------------
% 0.19/0.52 % (4468)------------------------------
% 0.19/0.53 % (4483)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.53 % (4464)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.53 % (4485)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (4485)------------------------------
% 0.19/0.53 % (4485)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (4485)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (4485)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (4485)Memory used [KB]: 6140
% 0.19/0.53 % (4485)Time elapsed: 0.121 s
% 0.19/0.53 % (4485)Instructions burned: 8 (million)
% 0.19/0.53 % (4485)------------------------------
% 0.19/0.53 % (4485)------------------------------
% 0.19/0.53 % (4453)Success in time 0.18 s
%------------------------------------------------------------------------------