TSTP Solution File: SET935+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET935+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n004.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 : Sun May 5 09:19:44 EDT 2024
% Result : Theorem 0.15s 0.35s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 95 ( 19 unt; 0 def)
% Number of atoms : 293 ( 37 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 316 ( 118 ~; 124 |; 49 &)
% ( 19 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 11 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 129 ( 118 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1162,plain,
$false,
inference(avatar_sat_refutation,[],[f124,f949,f977,f1012,f1016,f1028,f1081,f1160]) ).
fof(f1160,plain,
~ spl7_10,
inference(avatar_contradiction_clause,[],[f1159]) ).
fof(f1159,plain,
( $false
| ~ spl7_10 ),
inference(subsumption_resolution,[],[f1130,f88]) ).
fof(f88,plain,
~ subset(sK1,sK2),
inference(resolution,[],[f63,f49]) ).
fof(f49,plain,
~ inclusion_comparable(sK1,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( ~ inclusion_comparable(sK1,sK2)
& set_union2(powerset(sK1),powerset(sK2)) = powerset(set_union2(sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f21,f28]) ).
fof(f28,plain,
( ? [X0,X1] :
( ~ inclusion_comparable(X0,X1)
& set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1)) )
=> ( ~ inclusion_comparable(sK1,sK2)
& set_union2(powerset(sK1),powerset(sK2)) = powerset(set_union2(sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1] :
( ~ inclusion_comparable(X0,X1)
& set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1)) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,negated_conjecture,
~ ! [X0,X1] :
( set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1))
=> inclusion_comparable(X0,X1) ),
inference(negated_conjecture,[],[f16]) ).
fof(f16,conjecture,
! [X0,X1] :
( set_union2(powerset(X0),powerset(X1)) = powerset(set_union2(X0,X1))
=> inclusion_comparable(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t82_zfmisc_1) ).
fof(f63,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( inclusion_comparable(X0,X1)
| ( ~ subset(X1,X0)
& ~ subset(X0,X1) ) )
& ( subset(X1,X0)
| subset(X0,X1)
| ~ inclusion_comparable(X0,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( inclusion_comparable(X0,X1)
| ( ~ subset(X1,X0)
& ~ subset(X0,X1) ) )
& ( subset(X1,X0)
| subset(X0,X1)
| ~ inclusion_comparable(X0,X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( inclusion_comparable(X0,X1)
<=> ( subset(X1,X0)
| subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_xboole_0) ).
fof(f1130,plain,
( subset(sK1,sK2)
| ~ spl7_10 ),
inference(superposition,[],[f96,f1117]) ).
fof(f1117,plain,
( sK2 = set_union2(sK2,sK1)
| ~ spl7_10 ),
inference(resolution,[],[f1113,f499]) ).
fof(f499,plain,
! [X0,X1] :
( ~ subset(set_union2(X1,X0),X0)
| set_union2(X0,X1) = X0 ),
inference(superposition,[],[f126,f54]) ).
fof(f54,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f126,plain,
! [X0,X1] :
( ~ subset(set_union2(X0,X1),X0)
| set_union2(X0,X1) = X0 ),
inference(resolution,[],[f61,f53]) ).
fof(f53,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f61,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f1113,plain,
( subset(set_union2(sK1,sK2),sK2)
| ~ spl7_10 ),
inference(resolution,[],[f1027,f82]) ).
fof(f82,plain,
! [X3,X0] :
( ~ in(X3,powerset(X0))
| subset(X3,X0) ),
inference(equality_resolution,[],[f65]) ).
fof(f65,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK3(X0,X1),X0)
| ~ in(sK3(X0,X1),X1) )
& ( subset(sK3(X0,X1),X0)
| in(sK3(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f35,f36]) ).
fof(f36,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK3(X0,X1),X0)
| ~ in(sK3(X0,X1),X1) )
& ( subset(sK3(X0,X1),X0)
| in(sK3(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f1027,plain,
( in(set_union2(sK1,sK2),powerset(sK2))
| ~ spl7_10 ),
inference(avatar_component_clause,[],[f1025]) ).
fof(f1025,plain,
( spl7_10
<=> in(set_union2(sK1,sK2),powerset(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_10])]) ).
fof(f96,plain,
! [X0,X1] : subset(X0,set_union2(X1,X0)),
inference(superposition,[],[f53,f54]) ).
fof(f1081,plain,
~ spl7_9,
inference(avatar_contradiction_clause,[],[f1080]) ).
fof(f1080,plain,
( $false
| ~ spl7_9 ),
inference(subsumption_resolution,[],[f1044,f90]) ).
fof(f90,plain,
~ subset(sK2,sK1),
inference(resolution,[],[f64,f49]) ).
fof(f64,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f1044,plain,
( subset(sK2,sK1)
| ~ spl7_9 ),
inference(superposition,[],[f53,f1038]) ).
fof(f1038,plain,
( sK1 = set_union2(sK2,sK1)
| ~ spl7_9 ),
inference(resolution,[],[f1034,f626]) ).
fof(f626,plain,
! [X0,X1] :
( ~ subset(set_union2(X1,X0),X1)
| set_union2(X0,X1) = X1 ),
inference(superposition,[],[f127,f54]) ).
fof(f127,plain,
! [X0,X1] :
( ~ subset(set_union2(X0,X1),X1)
| set_union2(X0,X1) = X1 ),
inference(resolution,[],[f61,f96]) ).
fof(f1034,plain,
( subset(set_union2(sK1,sK2),sK1)
| ~ spl7_9 ),
inference(resolution,[],[f1023,f82]) ).
fof(f1023,plain,
( in(set_union2(sK1,sK2),powerset(sK1))
| ~ spl7_9 ),
inference(avatar_component_clause,[],[f1021]) ).
fof(f1021,plain,
( spl7_9
<=> in(set_union2(sK1,sK2),powerset(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_9])]) ).
fof(f1028,plain,
( spl7_9
| spl7_10 ),
inference(avatar_split_clause,[],[f965,f1025,f1021]) ).
fof(f965,plain,
( in(set_union2(sK1,sK2),powerset(sK2))
| in(set_union2(sK1,sK2),powerset(sK1)) ),
inference(resolution,[],[f952,f50]) ).
fof(f50,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f952,plain,
! [X0] :
( ~ subset(X0,set_union2(sK1,sK2))
| in(X0,powerset(sK2))
| in(X0,powerset(sK1)) ),
inference(resolution,[],[f233,f81]) ).
fof(f81,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f66]) ).
fof(f66,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f37]) ).
fof(f233,plain,
! [X0] :
( ~ in(X0,powerset(set_union2(sK1,sK2)))
| in(X0,powerset(sK1))
| in(X0,powerset(sK2)) ),
inference(resolution,[],[f69,f113]) ).
fof(f113,plain,
sP0(powerset(sK2),powerset(sK1),powerset(set_union2(sK1,sK2))),
inference(superposition,[],[f83,f48]) ).
fof(f48,plain,
set_union2(powerset(sK1),powerset(sK2)) = powerset(set_union2(sK1,sK2)),
inference(cnf_transformation,[],[f29]) ).
fof(f83,plain,
! [X0,X1] : sP0(X1,X0,set_union2(X0,X1)),
inference(equality_resolution,[],[f75]) ).
fof(f75,plain,
! [X2,X0,X1] :
( sP0(X1,X0,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ~ sP0(X1,X0,X2) )
& ( sP0(X1,X0,X2)
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> sP0(X1,X0,X2) ),
inference(definition_folding,[],[f5,f26]) ).
fof(f26,plain,
! [X1,X0,X2] :
( sP0(X1,X0,X2)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f5,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f69,plain,
! [X2,X0,X1,X4] :
( ~ sP0(X0,X1,X2)
| in(X4,X1)
| ~ in(X4,X2)
| in(X4,X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ( ( ( ~ in(sK4(X0,X1,X2),X0)
& ~ in(sK4(X0,X1,X2),X1) )
| ~ in(sK4(X0,X1,X2),X2) )
& ( in(sK4(X0,X1,X2),X0)
| in(sK4(X0,X1,X2),X1)
| in(sK4(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f40,f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK4(X0,X1,X2),X0)
& ~ in(sK4(X0,X1,X2),X1) )
| ~ in(sK4(X0,X1,X2),X2) )
& ( in(sK4(X0,X1,X2),X0)
| in(sK4(X0,X1,X2),X1)
| in(sK4(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ? [X3] :
( ( ( ~ in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) )
& ( in(X3,X0)
| in(X3,X1)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X0)
& ~ in(X4,X1) ) )
& ( in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X1,X0,X2] :
( ( sP0(X1,X0,X2)
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| ~ sP0(X1,X0,X2) ) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
! [X1,X0,X2] :
( ( sP0(X1,X0,X2)
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| ~ sP0(X1,X0,X2) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f1016,plain,
~ spl7_7,
inference(avatar_contradiction_clause,[],[f1015]) ).
fof(f1015,plain,
( $false
| ~ spl7_7 ),
inference(subsumption_resolution,[],[f1013,f90]) ).
fof(f1013,plain,
( subset(sK2,sK1)
| ~ spl7_7 ),
inference(resolution,[],[f1007,f82]) ).
fof(f1007,plain,
( in(sK2,powerset(sK1))
| ~ spl7_7 ),
inference(avatar_component_clause,[],[f1005]) ).
fof(f1005,plain,
( spl7_7
<=> in(sK2,powerset(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_7])]) ).
fof(f1012,plain,
( spl7_7
| spl7_8 ),
inference(avatar_split_clause,[],[f964,f1009,f1005]) ).
fof(f1009,plain,
( spl7_8
<=> in(sK2,powerset(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_8])]) ).
fof(f964,plain,
( in(sK2,powerset(sK2))
| in(sK2,powerset(sK1)) ),
inference(resolution,[],[f952,f96]) ).
fof(f977,plain,
( spl7_5
| spl7_6 ),
inference(avatar_split_clause,[],[f963,f974,f970]) ).
fof(f970,plain,
( spl7_5
<=> in(sK1,powerset(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f974,plain,
( spl7_6
<=> in(sK1,powerset(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
fof(f963,plain,
( in(sK1,powerset(sK2))
| in(sK1,powerset(sK1)) ),
inference(resolution,[],[f952,f53]) ).
fof(f949,plain,
( ~ spl7_3
| spl7_4 ),
inference(avatar_split_clause,[],[f128,f946,f942]) ).
fof(f942,plain,
( spl7_3
<=> subset(powerset(set_union2(sK1,sK2)),powerset(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f946,plain,
( spl7_4
<=> powerset(sK1) = powerset(set_union2(sK1,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f128,plain,
( powerset(sK1) = powerset(set_union2(sK1,sK2))
| ~ subset(powerset(set_union2(sK1,sK2)),powerset(sK1)) ),
inference(resolution,[],[f61,f110]) ).
fof(f110,plain,
subset(powerset(sK1),powerset(set_union2(sK1,sK2))),
inference(superposition,[],[f53,f48]) ).
fof(f124,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f111,f121,f117]) ).
fof(f117,plain,
( spl7_1
<=> empty(powerset(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f121,plain,
( spl7_2
<=> empty(powerset(set_union2(sK1,sK2))) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f111,plain,
( ~ empty(powerset(set_union2(sK1,sK2)))
| empty(powerset(sK1)) ),
inference(superposition,[],[f55,f48]) ).
fof(f55,plain,
! [X0,X1] :
( ~ empty(set_union2(X0,X1))
| empty(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ empty(set_union2(X0,X1))
| empty(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( ~ empty(X0)
=> ~ empty(set_union2(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SET935+1 : TPTP v8.1.2. Released v3.2.0.
% 0.04/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.09/0.30 % Computer : n004.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 16:25:37 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % (32176)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32 % (32179)WARNING: value z3 for option sas not known
% 0.15/0.32 % (32181)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.32 % (32180)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.32 % (32179)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.32 % (32177)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.32 % (32178)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.32 % (32182)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.32 % (32183)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.32 TRYING [1]
% 0.15/0.32 TRYING [2]
% 0.15/0.32 TRYING [3]
% 0.15/0.33 TRYING [1]
% 0.15/0.33 TRYING [4]
% 0.15/0.33 TRYING [2]
% 0.15/0.33 TRYING [3]
% 0.15/0.34 TRYING [5]
% 0.15/0.35 % (32179)First to succeed.
% 0.15/0.35 % (32179)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32176"
% 0.15/0.35 % (32179)Refutation found. Thanks to Tanya!
% 0.15/0.35 % SZS status Theorem for theBenchmark
% 0.15/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.35 % (32179)------------------------------
% 0.15/0.35 % (32179)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.35 % (32179)Termination reason: Refutation
% 0.15/0.35
% 0.15/0.35 % (32179)Memory used [KB]: 1142
% 0.15/0.35 % (32179)Time elapsed: 0.030 s
% 0.15/0.35 % (32179)Instructions burned: 62 (million)
% 0.15/0.35 % (32176)Success in time 0.044 s
%------------------------------------------------------------------------------