TSTP Solution File: SEU159+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU159+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 : 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:58 EDT 2022
% Result : Theorem 0.19s 0.57s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 74 ( 7 unt; 0 def)
% Number of atoms : 270 ( 75 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 309 ( 113 ~; 129 |; 48 &)
% ( 14 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 115 ( 93 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f156,plain,
$false,
inference(avatar_sat_refutation,[],[f61,f67,f69,f83,f87,f141,f148,f155]) ).
fof(f155,plain,
( ~ spl5_1
| spl5_2
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f154]) ).
fof(f154,plain,
( $false
| ~ spl5_1
| spl5_2
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f153,f56]) ).
fof(f56,plain,
( in(sK4,sK3)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f54,plain,
( spl5_1
<=> in(sK4,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f153,plain,
( ~ in(sK4,sK3)
| spl5_2
| ~ spl5_4 ),
inference(forward_demodulation,[],[f103,f136]) ).
fof(f136,plain,
( sK4 = sK1(sK3,unordered_pair(sK2,sK4))
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f134]) ).
fof(f134,plain,
( spl5_4
<=> sK4 = sK1(sK3,unordered_pair(sK2,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
fof(f103,plain,
( ~ in(sK1(sK3,unordered_pair(sK2,sK4)),sK3)
| spl5_2 ),
inference(resolution,[],[f59,f41]) ).
fof(f41,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ( ~ in(sK1(X0,X1),X0)
& in(sK1(X0,X1),X1) ) )
& ( ! [X3] :
( in(X3,X0)
| ~ in(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f23,f24]) ).
fof(f24,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) )
=> ( ~ in(sK1(X0,X1),X0)
& in(sK1(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( ~ in(X2,X0)
& in(X2,X1) ) )
& ( ! [X3] :
( in(X3,X0)
| ~ in(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1,X0] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f59,plain,
( ~ subset(unordered_pair(sK2,sK4),sK3)
| spl5_2 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f58,plain,
( spl5_2
<=> subset(unordered_pair(sK2,sK4),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f148,plain,
( spl5_2
| ~ spl5_3
| ~ spl5_5 ),
inference(avatar_contradiction_clause,[],[f147]) ).
fof(f147,plain,
( $false
| spl5_2
| ~ spl5_3
| ~ spl5_5 ),
inference(subsumption_resolution,[],[f145,f66]) ).
fof(f66,plain,
( in(sK2,sK3)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f64,plain,
( spl5_3
<=> in(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f145,plain,
( ~ in(sK2,sK3)
| spl5_2
| ~ spl5_5 ),
inference(backward_demodulation,[],[f103,f140]) ).
fof(f140,plain,
( sK2 = sK1(sK3,unordered_pair(sK2,sK4))
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f138,plain,
( spl5_5
<=> sK2 = sK1(sK3,unordered_pair(sK2,sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
fof(f141,plain,
( spl5_4
| spl5_5
| spl5_2 ),
inference(avatar_split_clause,[],[f126,f58,f138,f134]) ).
fof(f126,plain,
( sK2 = sK1(sK3,unordered_pair(sK2,sK4))
| sK4 = sK1(sK3,unordered_pair(sK2,sK4))
| spl5_2 ),
inference(resolution,[],[f102,f51]) ).
fof(f51,plain,
! [X0,X1,X4] :
( X1 = X4
| ~ in(X4,unordered_pair(X0,X1))
| X0 = X4 ),
inference(equality_resolution,[],[f33]) ).
fof(f33,plain,
! [X2,X0,X1,X4] :
( X1 = X4
| X0 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK0(X0,X1,X2) != X1
& sK0(X0,X1,X2) != X0 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X1
| sK0(X0,X1,X2) = X0
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f20]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK0(X0,X1,X2) != X1
& sK0(X0,X1,X2) != X0 )
| ~ in(sK0(X0,X1,X2),X2) )
& ( sK0(X0,X1,X2) = X1
| sK0(X0,X1,X2) = X0
| in(sK0(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X1,X2,X0] :
( ( unordered_pair(X1,X2) = X0
| ? [X3] :
( ( ( X2 != X3
& X1 != X3 )
| ~ in(X3,X0) )
& ( X2 = X3
| X1 = X3
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X0)
| ( X2 != X3
& X1 != X3 ) )
& ( X2 = X3
| X1 = X3
| ~ in(X3,X0) ) )
| unordered_pair(X1,X2) != X0 ) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X1,X2,X0] :
( ( unordered_pair(X1,X2) = X0
| ? [X3] :
( ( ( X2 != X3
& X1 != X3 )
| ~ in(X3,X0) )
& ( X2 = X3
| X1 = X3
| in(X3,X0) ) ) )
& ( ! [X3] :
( ( in(X3,X0)
| ( X2 != X3
& X1 != X3 ) )
& ( X2 = X3
| X1 = X3
| ~ in(X3,X0) ) )
| unordered_pair(X1,X2) != X0 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1,X2,X0] :
( unordered_pair(X1,X2) = X0
<=> ! [X3] :
( in(X3,X0)
<=> ( X2 = X3
| X1 = X3 ) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X2,X0,X1] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f102,plain,
( in(sK1(sK3,unordered_pair(sK2,sK4)),unordered_pair(sK2,sK4))
| spl5_2 ),
inference(resolution,[],[f59,f40]) ).
fof(f40,plain,
! [X0,X1] :
( subset(X1,X0)
| in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f87,plain,
( ~ spl5_2
| spl5_3 ),
inference(avatar_contradiction_clause,[],[f86]) ).
fof(f86,plain,
( $false
| ~ spl5_2
| spl5_3 ),
inference(subsumption_resolution,[],[f74,f50]) ).
fof(f50,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f49]) ).
fof(f49,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f21]) ).
fof(f74,plain,
( ~ in(sK2,unordered_pair(sK2,sK4))
| ~ spl5_2
| spl5_3 ),
inference(unit_resulting_resolution,[],[f65,f60,f39]) ).
fof(f39,plain,
! [X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f60,plain,
( subset(unordered_pair(sK2,sK4),sK3)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f65,plain,
( ~ in(sK2,sK3)
| spl5_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f83,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f77,f58,f54]) ).
fof(f77,plain,
( in(sK4,sK3)
| ~ spl5_2 ),
inference(unit_resulting_resolution,[],[f48,f60,f39]) ).
fof(f48,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f47]) ).
fof(f47,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f21]) ).
fof(f69,plain,
( ~ spl5_3
| ~ spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f68,f58,f54,f64]) ).
fof(f68,plain,
( ~ subset(unordered_pair(sK2,sK4),sK3)
| ~ in(sK4,sK3)
| ~ in(sK2,sK3) ),
inference(forward_demodulation,[],[f45,f42]) ).
fof(f42,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f11]) ).
fof(f11,plain,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f45,plain,
( ~ in(sK2,sK3)
| ~ subset(unordered_pair(sK4,sK2),sK3)
| ~ in(sK4,sK3) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
( ( ~ subset(unordered_pair(sK4,sK2),sK3)
| ~ in(sK2,sK3)
| ~ in(sK4,sK3) )
& ( subset(unordered_pair(sK4,sK2),sK3)
| ( in(sK2,sK3)
& in(sK4,sK3) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f29,f30]) ).
fof(f30,plain,
( ? [X0,X1,X2] :
( ( ~ subset(unordered_pair(X2,X0),X1)
| ~ in(X0,X1)
| ~ in(X2,X1) )
& ( subset(unordered_pair(X2,X0),X1)
| ( in(X0,X1)
& in(X2,X1) ) ) )
=> ( ( ~ subset(unordered_pair(sK4,sK2),sK3)
| ~ in(sK2,sK3)
| ~ in(sK4,sK3) )
& ( subset(unordered_pair(sK4,sK2),sK3)
| ( in(sK2,sK3)
& in(sK4,sK3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
? [X0,X1,X2] :
( ( ~ subset(unordered_pair(X2,X0),X1)
| ~ in(X0,X1)
| ~ in(X2,X1) )
& ( subset(unordered_pair(X2,X0),X1)
| ( in(X0,X1)
& in(X2,X1) ) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
? [X0,X2,X1] :
( ( ~ subset(unordered_pair(X1,X0),X2)
| ~ in(X0,X2)
| ~ in(X1,X2) )
& ( subset(unordered_pair(X1,X0),X2)
| ( in(X0,X2)
& in(X1,X2) ) ) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
? [X0,X2,X1] :
( ( ~ subset(unordered_pair(X1,X0),X2)
| ~ in(X0,X2)
| ~ in(X1,X2) )
& ( subset(unordered_pair(X1,X0),X2)
| ( in(X0,X2)
& in(X1,X2) ) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
? [X0,X2,X1] :
( ( in(X0,X2)
& in(X1,X2) )
<~> subset(unordered_pair(X1,X0),X2) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
~ ! [X1,X0,X2] :
( subset(unordered_pair(X1,X0),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X1,X0,X2] :
( ( in(X1,X2)
& in(X0,X2) )
<=> subset(unordered_pair(X0,X1),X2) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X1,X0,X2] :
( ( in(X1,X2)
& in(X0,X2) )
<=> subset(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f67,plain,
( spl5_2
| spl5_3 ),
inference(avatar_split_clause,[],[f62,f64,f58]) ).
fof(f62,plain,
( in(sK2,sK3)
| subset(unordered_pair(sK2,sK4),sK3) ),
inference(forward_demodulation,[],[f44,f42]) ).
fof(f44,plain,
( subset(unordered_pair(sK4,sK2),sK3)
| in(sK2,sK3) ),
inference(cnf_transformation,[],[f31]) ).
fof(f61,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f52,f58,f54]) ).
fof(f52,plain,
( subset(unordered_pair(sK2,sK4),sK3)
| in(sK4,sK3) ),
inference(forward_demodulation,[],[f43,f42]) ).
fof(f43,plain,
( subset(unordered_pair(sK4,sK2),sK3)
| in(sK4,sK3) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU159+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/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.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 15:04:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.54 % (29097)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)
% 0.19/0.54 % (29096)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.19/0.55 % (29096)First to succeed.
% 0.19/0.55 % (29103)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.55 % (29095)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.55 % (29113)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)
% 0.19/0.55 % (29112)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.55 % (29095)Refutation not found, incomplete strategy% (29095)------------------------------
% 0.19/0.55 % (29095)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55 % (29095)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55 % (29095)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.55
% 0.19/0.55 % (29095)Memory used [KB]: 5884
% 0.19/0.55 % (29095)Time elapsed: 0.128 s
% 0.19/0.55 % (29095)Instructions burned: 2 (million)
% 0.19/0.55 % (29095)------------------------------
% 0.19/0.55 % (29095)------------------------------
% 0.19/0.56 % (29105)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.56 % (29104)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.56 % (29111)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)
% 0.19/0.56 % (29103)Instruction limit reached!
% 0.19/0.56 % (29103)------------------------------
% 0.19/0.56 % (29103)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (29103)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (29103)Termination reason: Unknown
% 0.19/0.56 % (29103)Termination phase: Saturation
% 0.19/0.56
% 0.19/0.56 % (29103)Memory used [KB]: 5884
% 0.19/0.56 % (29103)Time elapsed: 0.147 s
% 0.19/0.56 % (29103)Instructions burned: 3 (million)
% 0.19/0.56 % (29103)------------------------------
% 0.19/0.56 % (29103)------------------------------
% 0.19/0.56 % (29104)Instruction limit reached!
% 0.19/0.56 % (29104)------------------------------
% 0.19/0.56 % (29104)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (29104)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (29104)Termination reason: Unknown
% 0.19/0.56 % (29104)Termination phase: Saturation
% 0.19/0.56
% 0.19/0.56 % (29104)Memory used [KB]: 6012
% 0.19/0.56 % (29104)Time elapsed: 0.149 s
% 0.19/0.56 % (29104)Instructions burned: 7 (million)
% 0.19/0.56 % (29104)------------------------------
% 0.19/0.56 % (29104)------------------------------
% 0.19/0.56 % (29113)Refutation not found, incomplete strategy% (29113)------------------------------
% 0.19/0.56 % (29113)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (29113)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (29113)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.56
% 0.19/0.56 % (29113)Memory used [KB]: 6012
% 0.19/0.56 % (29113)Time elapsed: 0.147 s
% 0.19/0.56 % (29113)Instructions burned: 4 (million)
% 0.19/0.56 % (29113)------------------------------
% 0.19/0.56 % (29113)------------------------------
% 0.19/0.56 % (29105)Also succeeded, but the first one will report.
% 0.19/0.57 % (29096)Refutation found. Thanks to Tanya!
% 0.19/0.57 % SZS status Theorem for theBenchmark
% 0.19/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.57 % (29096)------------------------------
% 0.19/0.57 % (29096)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (29096)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (29096)Termination reason: Refutation
% 0.19/0.57
% 0.19/0.57 % (29096)Memory used [KB]: 6012
% 0.19/0.57 % (29096)Time elapsed: 0.129 s
% 0.19/0.57 % (29096)Instructions burned: 5 (million)
% 0.19/0.57 % (29096)------------------------------
% 0.19/0.57 % (29096)------------------------------
% 0.19/0.57 % (29088)Success in time 0.212 s
%------------------------------------------------------------------------------