TSTP Solution File: SET611+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET611+3 : 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_uns --cores 0 -t %d %s
% Computer : n028.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:21:36 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 82 ( 7 unt; 0 def)
% Number of atoms : 237 ( 55 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 265 ( 110 ~; 103 |; 35 &)
% ( 13 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 114 ( 103 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f182,plain,
$false,
inference(avatar_sat_refutation,[],[f85,f86,f138,f181]) ).
fof(f181,plain,
( ~ spl7_1
| spl7_2 ),
inference(avatar_contradiction_clause,[],[f180]) ).
fof(f180,plain,
( $false
| ~ spl7_1
| spl7_2 ),
inference(subsumption_resolution,[],[f179,f84]) ).
fof(f84,plain,
( empty_set != sF5
| spl7_2 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f82,plain,
( spl7_2
<=> empty_set = sF5 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f179,plain,
( empty_set = sF5
| ~ spl7_1 ),
inference(resolution,[],[f175,f106]) ).
fof(f106,plain,
! [X1] :
( ~ subset(X1,empty_set)
| empty_set = X1 ),
inference(resolution,[],[f60,f100]) ).
fof(f100,plain,
! [X12] : subset(empty_set,X12),
inference(resolution,[],[f64,f50]) ).
fof(f50,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f64,plain,
! [X0,X1] :
( member(sK2(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ( ~ member(sK2(X0,X1),X0)
& member(sK2(X0,X1),X1) ) )
& ( ! [X3] :
( member(X3,X0)
| ~ member(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f38,f39]) ).
fof(f39,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) )
=> ( ~ member(sK2(X0,X1),X0)
& member(sK2(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1] :
( ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) )
& ( ! [X3] :
( member(X3,X0)
| ~ member(X3,X1) )
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X1,X0] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f60,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(flattening,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
<=> X0 = X1 ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f175,plain,
( ! [X0] : subset(sF5,X0)
| ~ spl7_1 ),
inference(resolution,[],[f161,f64]) ).
fof(f161,plain,
( ! [X0] : ~ member(X0,sF5)
| ~ spl7_1 ),
inference(subsumption_resolution,[],[f159,f155]) ).
fof(f155,plain,
! [X1] :
( member(X1,sK3)
| ~ member(X1,sF5) ),
inference(superposition,[],[f49,f73]) ).
fof(f73,plain,
intersection(sK3,sK4) = sF5,
introduced(function_definition,[]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) )
& ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X0,X2,X1] :
( ( ( member(X1,X0)
& member(X1,X2) )
| ~ member(X1,intersection(X0,X2)) )
& ( member(X1,intersection(X0,X2))
| ~ member(X1,X0)
| ~ member(X1,X2) ) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
! [X0,X2,X1] :
( ( ( member(X1,X0)
& member(X1,X2) )
| ~ member(X1,intersection(X0,X2)) )
& ( member(X1,intersection(X0,X2))
| ~ member(X1,X0)
| ~ member(X1,X2) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X2,X1] :
( ( member(X1,X0)
& member(X1,X2) )
<=> member(X1,intersection(X0,X2)) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X0,X2,X1] :
( ( member(X2,X1)
& member(X2,X0) )
<=> member(X2,intersection(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f159,plain,
( ! [X0] :
( ~ member(X0,sK3)
| ~ member(X0,sF5) )
| ~ spl7_1 ),
inference(resolution,[],[f156,f146]) ).
fof(f146,plain,
( ! [X0] :
( ~ member(X0,sK4)
| ~ member(X0,sK3) )
| ~ spl7_1 ),
inference(backward_demodulation,[],[f95,f79]) ).
fof(f79,plain,
( sK3 = sF6
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f78,plain,
( spl7_1
<=> sK3 = sF6 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f95,plain,
! [X0] :
( ~ member(X0,sF6)
| ~ member(X0,sK4) ),
inference(superposition,[],[f57,f74]) ).
fof(f74,plain,
sF6 = difference(sK3,sK4),
introduced(function_definition,[]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( ( ~ member(X0,X1)
& member(X0,X2) )
| ~ member(X0,difference(X2,X1)) )
& ( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X1,X0,X2] :
( ( ( ~ member(X1,X0)
& member(X1,X2) )
| ~ member(X1,difference(X2,X0)) )
& ( member(X1,difference(X2,X0))
| member(X1,X0)
| ~ member(X1,X2) ) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
! [X1,X0,X2] :
( ( ( ~ member(X1,X0)
& member(X1,X2) )
| ~ member(X1,difference(X2,X0)) )
& ( member(X1,difference(X2,X0))
| member(X1,X0)
| ~ member(X1,X2) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X1,X0,X2] :
( ( ~ member(X1,X0)
& member(X1,X2) )
<=> member(X1,difference(X2,X0)) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X2,X0] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f156,plain,
! [X2] :
( member(X2,sK4)
| ~ member(X2,sF5) ),
inference(superposition,[],[f48,f73]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f138,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_contradiction_clause,[],[f137]) ).
fof(f137,plain,
( $false
| spl7_1
| ~ spl7_2 ),
inference(subsumption_resolution,[],[f136,f112]) ).
fof(f112,plain,
( ~ subset(sK3,sF6)
| spl7_1 ),
inference(subsumption_resolution,[],[f111,f80]) ).
fof(f80,plain,
( sK3 != sF6
| spl7_1 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f111,plain,
( ~ subset(sK3,sF6)
| sK3 = sF6 ),
inference(resolution,[],[f110,f60]) ).
fof(f110,plain,
subset(sF6,sK3),
inference(duplicate_literal_removal,[],[f109]) ).
fof(f109,plain,
( subset(sF6,sK3)
| subset(sF6,sK3) ),
inference(resolution,[],[f103,f64]) ).
fof(f103,plain,
! [X1] :
( ~ member(sK2(sK3,X1),sF6)
| subset(X1,sK3) ),
inference(resolution,[],[f65,f94]) ).
fof(f94,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sF6) ),
inference(superposition,[],[f56,f74]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| member(X0,X2) ),
inference(cnf_transformation,[],[f31]) ).
fof(f65,plain,
! [X0,X1] :
( ~ member(sK2(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f136,plain,
( subset(sK3,sF6)
| ~ spl7_2 ),
inference(duplicate_literal_removal,[],[f134]) ).
fof(f134,plain,
( subset(sK3,sF6)
| subset(sK3,sF6)
| ~ spl7_2 ),
inference(resolution,[],[f132,f64]) ).
fof(f132,plain,
( ! [X2] :
( ~ member(sK2(sF6,X2),sK3)
| subset(X2,sF6) )
| ~ spl7_2 ),
inference(resolution,[],[f129,f65]) ).
fof(f129,plain,
( ! [X0] :
( member(X0,sF6)
| ~ member(X0,sK3) )
| ~ spl7_2 ),
inference(subsumption_resolution,[],[f128,f122]) ).
fof(f122,plain,
( ! [X0] :
( ~ member(X0,sK4)
| ~ member(X0,sK3) )
| ~ spl7_2 ),
inference(subsumption_resolution,[],[f119,f50]) ).
fof(f119,plain,
( ! [X0] :
( ~ member(X0,sK3)
| member(X0,empty_set)
| ~ member(X0,sK4) )
| ~ spl7_2 ),
inference(superposition,[],[f47,f87]) ).
fof(f87,plain,
( empty_set = intersection(sK3,sK4)
| ~ spl7_2 ),
inference(forward_demodulation,[],[f73,f83]) ).
fof(f83,plain,
( empty_set = sF5
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f47,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f128,plain,
! [X0] :
( member(X0,sK4)
| member(X0,sF6)
| ~ member(X0,sK3) ),
inference(superposition,[],[f55,f74]) ).
fof(f55,plain,
! [X2,X0,X1] :
( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f31]) ).
fof(f86,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f76,f82,f78]) ).
fof(f76,plain,
( empty_set = sF5
| sK3 = sF6 ),
inference(definition_folding,[],[f67,f74,f73]) ).
fof(f67,plain,
( empty_set = intersection(sK3,sK4)
| sK3 = difference(sK3,sK4) ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
( ( empty_set != intersection(sK3,sK4)
| sK3 != difference(sK3,sK4) )
& ( empty_set = intersection(sK3,sK4)
| sK3 = difference(sK3,sK4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f43,f44]) ).
fof(f44,plain,
( ? [X0,X1] :
( ( intersection(X0,X1) != empty_set
| difference(X0,X1) != X0 )
& ( intersection(X0,X1) = empty_set
| difference(X0,X1) = X0 ) )
=> ( ( empty_set != intersection(sK3,sK4)
| sK3 != difference(sK3,sK4) )
& ( empty_set = intersection(sK3,sK4)
| sK3 = difference(sK3,sK4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
? [X0,X1] :
( ( intersection(X0,X1) != empty_set
| difference(X0,X1) != X0 )
& ( intersection(X0,X1) = empty_set
| difference(X0,X1) = X0 ) ),
inference(rectify,[],[f42]) ).
fof(f42,plain,
? [X1,X0] :
( ( empty_set != intersection(X1,X0)
| difference(X1,X0) != X1 )
& ( empty_set = intersection(X1,X0)
| difference(X1,X0) = X1 ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f21,plain,
? [X1,X0] :
( difference(X1,X0) = X1
<~> empty_set = intersection(X1,X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X1,X0] :
( difference(X1,X0) = X1
<=> empty_set = intersection(X1,X0) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X1,X0] :
( intersection(X0,X1) = empty_set
<=> difference(X0,X1) = X0 ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X1,X0] :
( intersection(X0,X1) = empty_set
<=> difference(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th84) ).
fof(f85,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f75,f82,f78]) ).
fof(f75,plain,
( empty_set != sF5
| sK3 != sF6 ),
inference(definition_folding,[],[f68,f74,f73]) ).
fof(f68,plain,
( empty_set != intersection(sK3,sK4)
| sK3 != difference(sK3,sK4) ),
inference(cnf_transformation,[],[f45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET611+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/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.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 14:16:48 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.19/0.46 % (9857)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.48 % (9862)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.49 % (9867)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.49 % (9853)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)
% 0.19/0.49 % (9867)Refutation not found, incomplete strategy% (9867)------------------------------
% 0.19/0.49 % (9867)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (9867)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (9867)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.49
% 0.19/0.49 % (9867)Memory used [KB]: 6012
% 0.19/0.49 % (9867)Time elapsed: 0.102 s
% 0.19/0.49 % (9867)Instructions burned: 2 (million)
% 0.19/0.49 % (9867)------------------------------
% 0.19/0.49 % (9867)------------------------------
% 0.19/0.49 % (9850)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.49 % (9853)Refutation not found, incomplete strategy% (9853)------------------------------
% 0.19/0.49 % (9853)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (9876)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.49 % (9853)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (9853)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.49
% 0.19/0.49 % (9853)Memory used [KB]: 6012
% 0.19/0.49 % (9853)Time elapsed: 0.088 s
% 0.19/0.49 % (9853)Instructions burned: 3 (million)
% 0.19/0.49 % (9853)------------------------------
% 0.19/0.49 % (9853)------------------------------
% 0.19/0.49 % (9870)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)
% 0.19/0.49 % (9874)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.50 % (9862)Instruction limit reached!
% 0.19/0.50 % (9862)------------------------------
% 0.19/0.50 % (9862)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (9862)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (9862)Termination reason: Unknown
% 0.19/0.50 % (9862)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (9862)Memory used [KB]: 6012
% 0.19/0.50 % (9862)Time elapsed: 0.099 s
% 0.19/0.50 % (9862)Instructions burned: 8 (million)
% 0.19/0.50 % (9862)------------------------------
% 0.19/0.50 % (9862)------------------------------
% 0.19/0.50 % (9863)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)
% 0.19/0.50 % (9863)Refutation not found, incomplete strategy% (9863)------------------------------
% 0.19/0.50 % (9863)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (9863)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (9863)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50
% 0.19/0.50 % (9863)Memory used [KB]: 1407
% 0.19/0.50 % (9863)Time elapsed: 0.099 s
% 0.19/0.50 % (9863)Instructions burned: 3 (million)
% 0.19/0.50 % (9863)------------------------------
% 0.19/0.50 % (9863)------------------------------
% 0.19/0.50 % (9859)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.50 % (9868)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50 % (9870)Instruction limit reached!
% 0.19/0.50 % (9870)------------------------------
% 0.19/0.50 % (9870)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (9870)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (9870)Termination reason: Unknown
% 0.19/0.50 % (9870)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (9870)Memory used [KB]: 6012
% 0.19/0.50 % (9870)Time elapsed: 0.102 s
% 0.19/0.50 % (9870)Instructions burned: 12 (million)
% 0.19/0.50 % (9870)------------------------------
% 0.19/0.50 % (9870)------------------------------
% 0.19/0.50 % (9850)First to succeed.
% 0.19/0.51 % (9850)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (9850)------------------------------
% 0.19/0.51 % (9850)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (9850)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (9850)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (9850)Memory used [KB]: 6012
% 0.19/0.51 % (9850)Time elapsed: 0.105 s
% 0.19/0.51 % (9850)Instructions burned: 4 (million)
% 0.19/0.51 % (9850)------------------------------
% 0.19/0.51 % (9850)------------------------------
% 0.19/0.51 % (9847)Success in time 0.158 s
%------------------------------------------------------------------------------