TSTP Solution File: SEU110+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU110+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_uns --cores 0 -t %d %s
% Computer : n014.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:42 EDT 2022
% Result : Theorem 1.55s 0.57s
% Output : Refutation 1.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 9 unt; 0 def)
% Number of atoms : 195 ( 13 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 238 ( 92 ~; 86 |; 44 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 96 ( 83 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f245,plain,
$false,
inference(unit_resulting_resolution,[],[f149,f216,f165]) ).
fof(f165,plain,
! [X0,X1] :
( ~ in(sK11(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ( in(sK11(X0,X1),X1)
& ~ in(sK11(X0,X1),X0) ) )
& ( ! [X3] :
( ~ in(X3,X1)
| in(X3,X0) )
| ~ subset(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f108,f109]) ).
fof(f109,plain,
! [X0,X1] :
( ? [X2] :
( in(X2,X1)
& ~ in(X2,X0) )
=> ( in(sK11(X0,X1),X1)
& ~ in(sK11(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( in(X2,X1)
& ~ in(X2,X0) ) )
& ( ! [X3] :
( ~ in(X3,X1)
| in(X3,X0) )
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f107]) ).
fof(f107,plain,
! [X1,X0] :
( ( subset(X0,X1)
| ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) ) )
& ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f216,plain,
in(sK11(finite_subsets(sK8),finite_subsets(sK7)),finite_subsets(sK8)),
inference(subsumption_resolution,[],[f215,f144]) ).
fof(f144,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0] :
( ~ empty(finite_subsets(X0))
& diff_closed(finite_subsets(X0))
& cup_closed(finite_subsets(X0))
& preboolean(finite_subsets(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_finsub_1) ).
fof(f215,plain,
( ~ preboolean(finite_subsets(sK8))
| in(sK11(finite_subsets(sK8),finite_subsets(sK7)),finite_subsets(sK8)) ),
inference(subsumption_resolution,[],[f211,f201]) ).
fof(f201,plain,
finite(sK11(finite_subsets(sK8),finite_subsets(sK7))),
inference(subsumption_resolution,[],[f196,f144]) ).
fof(f196,plain,
( ~ preboolean(finite_subsets(sK7))
| finite(sK11(finite_subsets(sK8),finite_subsets(sK7))) ),
inference(resolution,[],[f187,f181]) ).
fof(f181,plain,
! [X3,X0] :
( ~ in(X3,finite_subsets(X0))
| ~ preboolean(finite_subsets(X0))
| finite(X3) ),
inference(equality_resolution,[],[f125]) ).
fof(f125,plain,
! [X3,X0,X1] :
( ~ preboolean(X1)
| finite(X3)
| ~ in(X3,X1)
| finite_subsets(X0) != X1 ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
! [X0,X1] :
( ~ preboolean(X1)
| ( ( finite_subsets(X0) = X1
| ( ( ~ subset(sK1(X0,X1),X0)
| ~ finite(sK1(X0,X1))
| ~ in(sK1(X0,X1),X1) )
& ( ( subset(sK1(X0,X1),X0)
& finite(sK1(X0,X1)) )
| in(sK1(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( ( subset(X3,X0)
& finite(X3) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f82,f83]) ).
fof(f83,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) )
=> ( ( ~ subset(sK1(X0,X1),X0)
| ~ finite(sK1(X0,X1))
| ~ in(sK1(X0,X1),X1) )
& ( ( subset(sK1(X0,X1),X0)
& finite(sK1(X0,X1)) )
| in(sK1(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f82,plain,
! [X0,X1] :
( ~ preboolean(X1)
| ( ( finite_subsets(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( ( subset(X3,X0)
& finite(X3) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) ) ),
inference(rectify,[],[f81]) ).
fof(f81,plain,
! [X0,X1] :
( ~ preboolean(X1)
| ( ( finite_subsets(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) ) ),
inference(flattening,[],[f80]) ).
fof(f80,plain,
! [X0,X1] :
( ~ preboolean(X1)
| ( ( finite_subsets(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) ) ),
inference(nnf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0,X1] :
( ~ preboolean(X1)
| ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f187,plain,
in(sK11(finite_subsets(sK8),finite_subsets(sK7)),finite_subsets(sK7)),
inference(resolution,[],[f149,f166]) ).
fof(f166,plain,
! [X0,X1] :
( subset(X1,X0)
| in(sK11(X0,X1),X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f211,plain,
( ~ finite(sK11(finite_subsets(sK8),finite_subsets(sK7)))
| in(sK11(finite_subsets(sK8),finite_subsets(sK7)),finite_subsets(sK8))
| ~ preboolean(finite_subsets(sK8)) ),
inference(resolution,[],[f206,f179]) ).
fof(f179,plain,
! [X3,X0] :
( ~ subset(X3,X0)
| ~ preboolean(finite_subsets(X0))
| in(X3,finite_subsets(X0))
| ~ finite(X3) ),
inference(equality_resolution,[],[f127]) ).
fof(f127,plain,
! [X3,X0,X1] :
( ~ preboolean(X1)
| in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3)
| finite_subsets(X0) != X1 ),
inference(cnf_transformation,[],[f84]) ).
fof(f206,plain,
subset(sK11(finite_subsets(sK8),finite_subsets(sK7)),sK8),
inference(resolution,[],[f202,f184]) ).
fof(f184,plain,
! [X0] :
( ~ subset(X0,sK7)
| subset(X0,sK8) ),
inference(resolution,[],[f150,f117]) ).
fof(f117,plain,
! [X2,X0,X1] :
( ~ subset(X2,X1)
| subset(X0,X1)
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f75]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| subset(X0,X1)
| ~ subset(X0,X2) ),
inference(rectify,[],[f64]) ).
fof(f64,plain,
! [X2,X1,X0] :
( ~ subset(X0,X1)
| subset(X2,X1)
| ~ subset(X2,X0) ),
inference(flattening,[],[f63]) ).
fof(f63,plain,
! [X1,X0,X2] :
( subset(X2,X1)
| ~ subset(X0,X1)
| ~ subset(X2,X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
! [X1,X0,X2] :
( ( subset(X0,X1)
& subset(X2,X0) )
=> subset(X2,X1) ),
inference(rectify,[],[f26]) ).
fof(f26,axiom,
! [X1,X2,X0] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f150,plain,
subset(sK7,sK8),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
( subset(sK7,sK8)
& ~ subset(finite_subsets(sK7),finite_subsets(sK8)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f96,f97]) ).
fof(f97,plain,
( ? [X0,X1] :
( subset(X0,X1)
& ~ subset(finite_subsets(X0),finite_subsets(X1)) )
=> ( subset(sK7,sK8)
& ~ subset(finite_subsets(sK7),finite_subsets(sK8)) ) ),
introduced(choice_axiom,[]) ).
fof(f96,plain,
? [X0,X1] :
( subset(X0,X1)
& ~ subset(finite_subsets(X0),finite_subsets(X1)) ),
inference(rectify,[],[f55]) ).
fof(f55,plain,
? [X1,X0] :
( subset(X1,X0)
& ~ subset(finite_subsets(X1),finite_subsets(X0)) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,plain,
~ ! [X1,X0] :
( subset(X1,X0)
=> subset(finite_subsets(X1),finite_subsets(X0)) ),
inference(rectify,[],[f28]) ).
fof(f28,negated_conjecture,
~ ! [X1,X0] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
inference(negated_conjecture,[],[f27]) ).
fof(f27,conjecture,
! [X1,X0] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_finsub_1) ).
fof(f202,plain,
subset(sK11(finite_subsets(sK8),finite_subsets(sK7)),sK7),
inference(subsumption_resolution,[],[f197,f144]) ).
fof(f197,plain,
( subset(sK11(finite_subsets(sK8),finite_subsets(sK7)),sK7)
| ~ preboolean(finite_subsets(sK7)) ),
inference(resolution,[],[f187,f180]) ).
fof(f180,plain,
! [X3,X0] :
( ~ in(X3,finite_subsets(X0))
| subset(X3,X0)
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f126]) ).
fof(f126,plain,
! [X3,X0,X1] :
( ~ preboolean(X1)
| subset(X3,X0)
| ~ in(X3,X1)
| finite_subsets(X0) != X1 ),
inference(cnf_transformation,[],[f84]) ).
fof(f149,plain,
~ subset(finite_subsets(sK7),finite_subsets(sK8)),
inference(cnf_transformation,[],[f98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : SEU110+1 : TPTP v8.1.0. Released v3.2.0.
% 0.14/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.15/0.37 % Computer : n014.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Aug 30 14:40:03 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.23/0.53 % (5580)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.23/0.54 % (5596)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.23/0.55 % (5583)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.23/0.55 % (5591)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.23/0.55 % (5591)Instruction limit reached!
% 0.23/0.55 % (5591)------------------------------
% 0.23/0.55 % (5591)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.23/0.55 % (5591)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.23/0.55 % (5591)Termination reason: Unknown
% 0.23/0.55 % (5591)Termination phase: Saturation
% 0.23/0.55
% 0.23/0.55 % (5591)Memory used [KB]: 1407
% 0.23/0.55 % (5591)Time elapsed: 0.003 s
% 0.23/0.55 % (5591)Instructions burned: 2 (million)
% 0.23/0.55 % (5591)------------------------------
% 0.23/0.55 % (5591)------------------------------
% 0.23/0.55 % (5573)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.33/0.56 % (5601)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 1.33/0.56 % (5595)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 1.33/0.56 % (5599)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)
% 1.33/0.56 % (5577)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)
% 1.33/0.56 % (5576)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.33/0.56 % (5596)First to succeed.
% 1.33/0.56 % (5602)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 1.33/0.56 % (5578)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)
% 1.33/0.56 % (5575)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.33/0.56 % (5574)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.33/0.56 % (5587)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)
% 1.33/0.56 % (5582)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 1.33/0.56 % (5600)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)
% 1.33/0.56 % (5577)Instruction limit reached!
% 1.33/0.56 % (5577)------------------------------
% 1.33/0.56 % (5577)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.56 % (5581)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 1.33/0.56 % (5593)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 1.33/0.57 % (5592)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 1.33/0.57 % (5578)Instruction limit reached!
% 1.33/0.57 % (5578)------------------------------
% 1.33/0.57 % (5578)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.57 % (5598)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)
% 1.33/0.57 % (5575)Instruction limit reached!
% 1.33/0.57 % (5575)------------------------------
% 1.33/0.57 % (5575)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.57 % (5594)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)
% 1.33/0.57 % (5584)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)
% 1.33/0.57 % (5585)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.33/0.57 % (5597)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.33/0.57 % (5590)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.33/0.57 % (5575)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.57 % (5575)Termination reason: Unknown
% 1.33/0.57 % (5575)Termination phase: Saturation
% 1.33/0.57
% 1.33/0.57 % (5575)Memory used [KB]: 6012
% 1.33/0.57 % (5575)Time elapsed: 0.135 s
% 1.33/0.57 % (5575)Instructions burned: 4 (million)
% 1.33/0.57 % (5575)------------------------------
% 1.33/0.57 % (5575)------------------------------
% 1.33/0.57 % (5574)Refutation not found, incomplete strategy% (5574)------------------------------
% 1.33/0.57 % (5574)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.57 % (5574)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.57 % (5574)Termination reason: Refutation not found, incomplete strategy
% 1.33/0.57
% 1.33/0.57 % (5574)Memory used [KB]: 6012
% 1.33/0.57 % (5574)Time elapsed: 0.143 s
% 1.33/0.57 % (5574)Instructions burned: 2 (million)
% 1.33/0.57 % (5574)------------------------------
% 1.33/0.57 % (5574)------------------------------
% 1.55/0.57 % (5596)Refutation found. Thanks to Tanya!
% 1.55/0.57 % SZS status Theorem for theBenchmark
% 1.55/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.55/0.58 % (5596)------------------------------
% 1.55/0.58 % (5596)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.55/0.58 % (5596)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.55/0.58 % (5596)Termination reason: Refutation
% 1.55/0.58
% 1.55/0.58 % (5596)Memory used [KB]: 1535
% 1.55/0.58 % (5596)Time elapsed: 0.127 s
% 1.55/0.58 % (5596)Instructions burned: 5 (million)
% 1.55/0.58 % (5596)------------------------------
% 1.55/0.58 % (5596)------------------------------
% 1.55/0.58 % (5572)Success in time 0.191 s
%------------------------------------------------------------------------------