TSTP Solution File: SET928+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET928+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 : n005.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 : Tue Apr 30 15:14:01 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 95 ( 12 unt; 0 def)
% Number of atoms : 238 ( 48 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 236 ( 93 ~; 115 |; 17 &)
% ( 5 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 108 ( 92 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f119,plain,
$false,
inference(avatar_sat_refutation,[],[f49,f98,f107,f109,f111,f113,f116,f118]) ).
fof(f118,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f117]) ).
fof(f117,plain,
( $false
| ~ spl5_1
| ~ spl5_2 ),
inference(global_subsumption,[],[f47,f27,f35,f36,f29,f30,f28,f31,f32,f34,f38,f37,f25,f33,f54,f59,f60,f57,f63,f66,f69,f53,f86,f89,f92,f26,f44,f101,f105,f103,f102,f114]) ).
fof(f114,plain,
( in(sK1,sK2)
| in(sK0,sK2)
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f27,f44]) ).
fof(f102,plain,
( ~ in(sK1,sK2)
| ~ spl5_1 ),
inference(resolution,[],[f101,f37]) ).
fof(f103,plain,
( ~ in(sK0,sK2)
| ~ spl5_1 ),
inference(resolution,[],[f101,f34]) ).
fof(f105,plain,
( disjoint(sK2,unordered_pair(sK0,sK1))
| ~ spl5_1 ),
inference(resolution,[],[f101,f29]) ).
fof(f101,plain,
( disjoint(unordered_pair(sK0,sK1),sK2)
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f100]) ).
fof(f100,plain,
( unordered_pair(sK0,sK1) != unordered_pair(sK0,sK1)
| disjoint(unordered_pair(sK0,sK1),sK2)
| ~ spl5_1 ),
inference(superposition,[],[f32,f44]) ).
fof(f44,plain,
( unordered_pair(sK0,sK1) = set_difference(unordered_pair(sK0,sK1),sK2)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f42,plain,
( spl5_1
<=> unordered_pair(sK0,sK1) = set_difference(unordered_pair(sK0,sK1),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f26,plain,
( ~ in(sK1,sK2)
| unordered_pair(sK0,sK1) = set_difference(unordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( ( in(sK1,sK2)
| in(sK0,sK2)
| unordered_pair(sK0,sK1) != set_difference(unordered_pair(sK0,sK1),sK2) )
& ( ( ~ in(sK1,sK2)
& ~ in(sK0,sK2) )
| unordered_pair(sK0,sK1) = set_difference(unordered_pair(sK0,sK1),sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18]) ).
fof(f18,plain,
( ? [X0,X1,X2] :
( ( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X1,X2)
& ~ in(X0,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) )
=> ( ( in(sK1,sK2)
| in(sK0,sK2)
| unordered_pair(sK0,sK1) != set_difference(unordered_pair(sK0,sK1),sK2) )
& ( ( ~ in(sK1,sK2)
& ~ in(sK0,sK2) )
| unordered_pair(sK0,sK1) = set_difference(unordered_pair(sK0,sK1),sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X1,X2)
& ~ in(X0,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X1,X2)
& ~ in(X0,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<~> ( ~ in(X1,X2)
& ~ in(X0,X2) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<=> ( ~ in(X1,X2)
& ~ in(X0,X2) ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<=> ( ~ in(X1,X2)
& ~ in(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t72_zfmisc_1) ).
fof(f92,plain,
! [X0,X1] :
( in(X0,X1)
| unordered_pair(X0,X0) = set_difference(unordered_pair(X0,X0),X1) ),
inference(factoring,[],[f53]) ).
fof(f89,plain,
! [X2,X0,X1] :
( in(X0,X1)
| unordered_pair(X0,X2) = set_difference(unordered_pair(X0,X2),X1)
| ~ in(X1,X2) ),
inference(resolution,[],[f53,f30]) ).
fof(f86,plain,
! [X2,X0,X1] :
( in(X0,X1)
| unordered_pair(X2,X0) = set_difference(unordered_pair(X2,X0),X1)
| ~ in(X1,X2) ),
inference(resolution,[],[f53,f30]) ).
fof(f53,plain,
! [X2,X0,X1] :
( in(X2,X1)
| in(X0,X1)
| unordered_pair(X2,X0) = set_difference(unordered_pair(X2,X0),X1) ),
inference(resolution,[],[f33,f31]) ).
fof(f69,plain,
! [X0,X1] :
( in(X0,X1)
| set_difference(X1,unordered_pair(X0,X0)) = X1 ),
inference(factoring,[],[f57]) ).
fof(f66,plain,
! [X2,X0,X1] :
( in(X0,X1)
| set_difference(X1,unordered_pair(X2,X0)) = X1
| ~ in(X1,X2) ),
inference(resolution,[],[f57,f30]) ).
fof(f63,plain,
! [X2,X0,X1] :
( in(X0,X1)
| set_difference(X1,unordered_pair(X0,X2)) = X1
| ~ in(X1,X2) ),
inference(resolution,[],[f57,f30]) ).
fof(f57,plain,
! [X2,X0,X1] :
( in(X2,X1)
| in(X0,X1)
| set_difference(X1,unordered_pair(X0,X2)) = X1 ),
inference(resolution,[],[f54,f31]) ).
fof(f60,plain,
! [X2,X3,X0,X1] :
( in(X0,unordered_pair(X1,X2))
| in(X3,unordered_pair(X1,X2))
| ~ in(X1,unordered_pair(X0,X3)) ),
inference(resolution,[],[f54,f34]) ).
fof(f59,plain,
! [X2,X3,X0,X1] :
( in(X0,unordered_pair(X1,X2))
| in(X3,unordered_pair(X1,X2))
| ~ in(X2,unordered_pair(X0,X3)) ),
inference(resolution,[],[f54,f37]) ).
fof(f54,plain,
! [X2,X0,X1] :
( disjoint(X1,unordered_pair(X2,X0))
| in(X2,X1)
| in(X0,X1) ),
inference(resolution,[],[f33,f29]) ).
fof(f33,plain,
! [X2,X0,X1] :
( disjoint(unordered_pair(X0,X2),X1)
| in(X2,X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( disjoint(unordered_pair(X0,X2),X1)
| in(X2,X1)
| in(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X2] :
~ ( ~ disjoint(unordered_pair(X0,X2),X1)
& ~ in(X2,X1)
& ~ in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t57_zfmisc_1) ).
fof(f25,plain,
( ~ in(sK0,sK2)
| unordered_pair(sK0,sK1) = set_difference(unordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ disjoint(unordered_pair(X1,X0),X2)
| ~ in(X0,X2) ),
inference(superposition,[],[f34,f28]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ disjoint(unordered_pair(X1,X0),X2)
| ~ in(X0,X2) ),
inference(superposition,[],[f34,f28]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ disjoint(unordered_pair(X0,X1),X2)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ~ in(X0,X2)
| ~ disjoint(unordered_pair(X0,X1),X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
~ ( in(X0,X2)
& disjoint(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_zfmisc_1) ).
fof(f32,plain,
! [X0,X1] :
( set_difference(X0,X1) != X0
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_difference(X0,X1) != X0 )
& ( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f31,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_difference(X0,X1) = X0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f28,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f30,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f29,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f36,plain,
empty(sK4),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
empty(sK4),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f3,f23]) ).
fof(f23,plain,
( ? [X0] : empty(X0)
=> empty(sK4) ),
introduced(choice_axiom,[]) ).
fof(f3,axiom,
? [X0] : empty(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(f35,plain,
~ empty(sK3),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
~ empty(sK3),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f4,f21]) ).
fof(f21,plain,
( ? [X0] : ~ empty(X0)
=> ~ empty(sK3) ),
introduced(choice_axiom,[]) ).
fof(f4,axiom,
? [X0] : ~ empty(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(f27,plain,
( in(sK1,sK2)
| in(sK0,sK2)
| unordered_pair(sK0,sK1) != set_difference(unordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f47,plain,
( in(sK0,sK2)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f46,plain,
( spl5_2
<=> in(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f116,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f115,plain,
( $false
| ~ spl5_1 ),
inference(global_subsumption,[],[f27,f35,f36,f29,f30,f28,f31,f32,f34,f38,f37,f25,f33,f54,f59,f60,f57,f63,f66,f69,f53,f86,f89,f92,f26,f44,f101,f105,f103,f102,f114]) ).
fof(f113,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f112]) ).
fof(f112,plain,
( $false
| ~ spl5_1 ),
inference(global_subsumption,[],[f27,f35,f36,f29,f30,f28,f31,f32,f34,f38,f37,f25,f33,f54,f59,f60,f57,f63,f66,f69,f53,f86,f89,f92,f26,f44,f101,f105,f103,f102]) ).
fof(f111,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f110]) ).
fof(f110,plain,
( $false
| ~ spl5_1 ),
inference(global_subsumption,[],[f27,f35,f36,f29,f30,f28,f31,f32,f34,f38,f37,f25,f33,f54,f59,f60,f57,f63,f66,f69,f53,f86,f89,f92,f26,f44,f101,f102,f105,f103]) ).
fof(f109,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_contradiction_clause,[],[f108]) ).
fof(f108,plain,
( $false
| ~ spl5_1
| spl5_2 ),
inference(global_subsumption,[],[f27,f35,f36,f29,f30,f28,f31,f32,f34,f38,f37,f25,f48,f33,f54,f59,f60,f57,f63,f66,f67,f69,f64,f70,f71,f75,f77,f80,f53,f86,f87,f89,f90,f92,f99,f26,f44,f101,f102,f105]) ).
fof(f99,plain,
( in(sK1,sK2)
| unordered_pair(sK0,sK1) != set_difference(unordered_pair(sK0,sK1),sK2)
| spl5_2 ),
inference(subsumption_resolution,[],[f27,f48]) ).
fof(f90,plain,
( ! [X0] :
( in(X0,sK2)
| unordered_pair(X0,sK0) = set_difference(unordered_pair(X0,sK0),sK2) )
| spl5_2 ),
inference(resolution,[],[f53,f48]) ).
fof(f87,plain,
( ! [X0] :
( in(X0,sK2)
| unordered_pair(sK0,X0) = set_difference(unordered_pair(sK0,X0),sK2) )
| spl5_2 ),
inference(resolution,[],[f53,f48]) ).
fof(f80,plain,
( unordered_pair(sK0,sK0) = set_difference(unordered_pair(sK0,sK0),sK2)
| spl5_2 ),
inference(resolution,[],[f77,f31]) ).
fof(f77,plain,
( disjoint(unordered_pair(sK0,sK0),sK2)
| spl5_2 ),
inference(resolution,[],[f75,f29]) ).
fof(f75,plain,
( disjoint(sK2,unordered_pair(sK0,sK0))
| spl5_2 ),
inference(trivial_inequality_removal,[],[f74]) ).
fof(f74,plain,
( sK2 != sK2
| disjoint(sK2,unordered_pair(sK0,sK0))
| spl5_2 ),
inference(superposition,[],[f32,f71]) ).
fof(f71,plain,
( sK2 = set_difference(sK2,unordered_pair(sK0,sK0))
| spl5_2 ),
inference(resolution,[],[f64,f48]) ).
fof(f70,plain,
( ! [X0] :
( sK2 = set_difference(sK2,unordered_pair(X0,sK0))
| ~ in(sK2,X0) )
| spl5_2 ),
inference(resolution,[],[f64,f30]) ).
fof(f64,plain,
( ! [X0] :
( in(X0,sK2)
| sK2 = set_difference(sK2,unordered_pair(X0,sK0)) )
| spl5_2 ),
inference(resolution,[],[f57,f48]) ).
fof(f67,plain,
( ! [X0] :
( in(X0,sK2)
| sK2 = set_difference(sK2,unordered_pair(sK0,X0)) )
| spl5_2 ),
inference(resolution,[],[f57,f48]) ).
fof(f48,plain,
( ~ in(sK0,sK2)
| spl5_2 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f107,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_contradiction_clause,[],[f106]) ).
fof(f106,plain,
( $false
| ~ spl5_1
| spl5_2 ),
inference(global_subsumption,[],[f27,f35,f36,f29,f30,f28,f31,f32,f34,f38,f37,f25,f48,f33,f54,f59,f60,f57,f63,f66,f67,f69,f64,f70,f71,f75,f77,f80,f53,f86,f87,f89,f90,f92,f99,f26,f44,f101,f102]) ).
fof(f98,plain,
( spl5_1
| spl5_2 ),
inference(avatar_contradiction_clause,[],[f97]) ).
fof(f97,plain,
( $false
| spl5_1
| spl5_2 ),
inference(subsumption_resolution,[],[f95,f43]) ).
fof(f43,plain,
( unordered_pair(sK0,sK1) != set_difference(unordered_pair(sK0,sK1),sK2)
| spl5_1 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f95,plain,
( unordered_pair(sK0,sK1) = set_difference(unordered_pair(sK0,sK1),sK2)
| spl5_1
| spl5_2 ),
inference(resolution,[],[f85,f31]) ).
fof(f85,plain,
( disjoint(unordered_pair(sK0,sK1),sK2)
| spl5_1
| spl5_2 ),
inference(resolution,[],[f83,f29]) ).
fof(f83,plain,
( disjoint(sK2,unordered_pair(sK0,sK1))
| spl5_1
| spl5_2 ),
inference(trivial_inequality_removal,[],[f82]) ).
fof(f82,plain,
( sK2 != sK2
| disjoint(sK2,unordered_pair(sK0,sK1))
| spl5_1
| spl5_2 ),
inference(superposition,[],[f32,f73]) ).
fof(f73,plain,
( sK2 = set_difference(sK2,unordered_pair(sK0,sK1))
| spl5_1
| spl5_2 ),
inference(forward_demodulation,[],[f72,f28]) ).
fof(f72,plain,
( sK2 = set_difference(sK2,unordered_pair(sK1,sK0))
| spl5_1
| spl5_2 ),
inference(resolution,[],[f64,f50]) ).
fof(f50,plain,
( ~ in(sK1,sK2)
| spl5_1 ),
inference(subsumption_resolution,[],[f26,f43]) ).
fof(f49,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f25,f46,f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SET928+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.17 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.37 % Computer : n005.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Tue Apr 30 01:25:41 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.37 % (4521)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.39 % (4524)WARNING: value z3 for option sas not known
% 0.14/0.39 % (4524)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.14/0.39 % (4525)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.39 % (4523)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.39 % (4528)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.14/0.39 % (4527)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.14/0.39 % (4526)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.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.39 TRYING [3]
% 0.14/0.39 % (4524)First to succeed.
% 0.14/0.39 TRYING [4]
% 0.14/0.39 % (4522)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.39 % (4526)Also succeeded, but the first one will report.
% 0.14/0.39 % (4524)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (4524)------------------------------
% 0.14/0.40 % (4524)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.40 % (4524)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (4524)Memory used [KB]: 852
% 0.14/0.40 % (4524)Time elapsed: 0.007 s
% 0.14/0.40 % (4524)Instructions burned: 9 (million)
% 0.14/0.40 % (4524)------------------------------
% 0.14/0.40 % (4524)------------------------------
% 0.14/0.40 % (4521)Success in time 0.021 s
%------------------------------------------------------------------------------