TSTP Solution File: SET984+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET984+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n007.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 May 21 03:25:01 EDT 2024
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of formulae : 106 ( 37 unt; 0 def)
% Number of atoms : 241 ( 123 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 211 ( 76 ~; 103 |; 19 &)
% ( 8 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 154 ( 142 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3821,plain,
$false,
inference(avatar_sat_refutation,[],[f56,f1729,f3364,f3390,f3414,f3416,f3452,f3454,f3473,f3812]) ).
fof(f3812,plain,
( spl6_2
| spl6_6
| spl6_7 ),
inference(avatar_contradiction_clause,[],[f3811]) ).
fof(f3811,plain,
( $false
| spl6_2
| spl6_6
| spl6_7 ),
inference(subsumption_resolution,[],[f3792,f55]) ).
fof(f55,plain,
( ~ subset(sK1,sK3)
| spl6_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f53,plain,
( spl6_2
<=> subset(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f3792,plain,
( subset(sK1,sK3)
| spl6_6
| spl6_7 ),
inference(superposition,[],[f58,f3788]) ).
fof(f3788,plain,
( sK1 = set_intersection2(sK1,sK3)
| spl6_6
| spl6_7 ),
inference(subsumption_resolution,[],[f3787,f3358]) ).
fof(f3358,plain,
( empty_set != sK0
| spl6_6 ),
inference(avatar_component_clause,[],[f3357]) ).
fof(f3357,plain,
( spl6_6
<=> empty_set = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f3787,plain,
( empty_set = sK0
| sK1 = set_intersection2(sK1,sK3)
| spl6_7 ),
inference(subsumption_resolution,[],[f3786,f3362]) ).
fof(f3362,plain,
( empty_set != sK1
| spl6_7 ),
inference(avatar_component_clause,[],[f3361]) ).
fof(f3361,plain,
( spl6_7
<=> empty_set = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
fof(f3786,plain,
( empty_set = sK1
| empty_set = sK0
| sK1 = set_intersection2(sK1,sK3) ),
inference(equality_resolution,[],[f1947]) ).
fof(f1947,plain,
! [X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(sK0,sK1)
| empty_set = X1
| empty_set = X0
| set_intersection2(sK1,sK3) = X1 ),
inference(superposition,[],[f321,f65]) ).
fof(f65,plain,
cartesian_product2(sK0,sK1) = set_intersection2(cartesian_product2(sK0,sK1),cartesian_product2(sK2,sK3)),
inference(resolution,[],[f37,f29]) ).
fof(f29,plain,
subset(cartesian_product2(sK0,sK1),cartesian_product2(sK2,sK3)),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( ( ~ subset(sK1,sK3)
| ~ subset(sK0,sK2) )
& empty_set != cartesian_product2(sK0,sK1)
& subset(cartesian_product2(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f17,f21]) ).
fof(f21,plain,
( ? [X0,X1,X2,X3] :
( ( ~ subset(X1,X3)
| ~ subset(X0,X2) )
& empty_set != cartesian_product2(X0,X1)
& subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) )
=> ( ( ~ subset(sK1,sK3)
| ~ subset(sK0,sK2) )
& empty_set != cartesian_product2(sK0,sK1)
& subset(cartesian_product2(sK0,sK1),cartesian_product2(sK2,sK3)) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
? [X0,X1,X2,X3] :
( ( ~ subset(X1,X3)
| ~ subset(X0,X2) )
& empty_set != cartesian_product2(X0,X1)
& subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
? [X0,X1,X2,X3] :
( ( ~ subset(X1,X3)
| ~ subset(X0,X2) )
& empty_set != cartesian_product2(X0,X1)
& subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
=> ( ( subset(X1,X3)
& subset(X0,X2) )
| empty_set = cartesian_product2(X0,X1) ) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X1,X2,X3] :
( subset(cartesian_product2(X0,X1),cartesian_product2(X2,X3))
=> ( ( subset(X1,X3)
& subset(X0,X2) )
| empty_set = cartesian_product2(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t138_zfmisc_1) ).
fof(f37,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f321,plain,
! [X2,X3,X0,X1,X4,X5] :
( set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) != cartesian_product2(X4,X5)
| empty_set = X5
| empty_set = X4
| set_intersection2(X2,X3) = X5 ),
inference(superposition,[],[f43,f41]) ).
fof(f41,plain,
! [X2,X3,X0,X1] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X2,X3] : cartesian_product2(set_intersection2(X0,X1),set_intersection2(X2,X3)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t123_zfmisc_1) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
| empty_set = X1
| empty_set = X0
| X1 = X3 ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1,X2,X3] :
( ( X1 = X3
& X0 = X2 )
| empty_set = X1
| empty_set = X0
| cartesian_product2(X0,X1) != cartesian_product2(X2,X3) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2,X3] :
( ( X1 = X3
& X0 = X2 )
| empty_set = X1
| empty_set = X0
| cartesian_product2(X0,X1) != cartesian_product2(X2,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1,X2,X3] :
( cartesian_product2(X0,X1) = cartesian_product2(X2,X3)
=> ( ( X1 = X3
& X0 = X2 )
| empty_set = X1
| empty_set = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t134_zfmisc_1) ).
fof(f58,plain,
! [X0,X1] : subset(set_intersection2(X1,X0),X0),
inference(superposition,[],[f35,f36]) ).
fof(f36,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f35,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f3473,plain,
( spl6_5
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f3472,f49,f3353]) ).
fof(f3353,plain,
( spl6_5
<=> sK0 = set_intersection2(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f49,plain,
( spl6_1
<=> subset(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f3472,plain,
( sK0 = set_intersection2(sK0,sK2)
| ~ spl6_1 ),
inference(resolution,[],[f50,f37]) ).
fof(f50,plain,
( subset(sK0,sK2)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f3454,plain,
( spl6_2
| ~ spl6_3
| ~ spl6_7 ),
inference(avatar_contradiction_clause,[],[f3453]) ).
fof(f3453,plain,
( $false
| spl6_2
| ~ spl6_3
| ~ spl6_7 ),
inference(subsumption_resolution,[],[f3439,f1739]) ).
fof(f1739,plain,
( ! [X0] : subset(empty_set,X0)
| ~ spl6_3 ),
inference(superposition,[],[f35,f1725]) ).
fof(f1725,plain,
( ! [X1] : empty_set = set_intersection2(X1,empty_set)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f1724]) ).
fof(f1724,plain,
( spl6_3
<=> ! [X1] : empty_set = set_intersection2(X1,empty_set) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f3439,plain,
( ~ subset(empty_set,sK3)
| spl6_2
| ~ spl6_7 ),
inference(superposition,[],[f55,f3363]) ).
fof(f3363,plain,
( empty_set = sK1
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f3361]) ).
fof(f3452,plain,
~ spl6_7,
inference(avatar_contradiction_clause,[],[f3451]) ).
fof(f3451,plain,
( $false
| ~ spl6_7 ),
inference(subsumption_resolution,[],[f3438,f46]) ).
fof(f46,plain,
! [X0] : empty_set = cartesian_product2(X0,empty_set),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
| empty_set != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( empty_set = cartesian_product2(X0,X1)
| ( empty_set != X1
& empty_set != X0 ) )
& ( empty_set = X1
| empty_set = X0
| empty_set != cartesian_product2(X0,X1) ) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( empty_set = cartesian_product2(X0,X1)
| ( empty_set != X1
& empty_set != X0 ) )
& ( empty_set = X1
| empty_set = X0
| empty_set != cartesian_product2(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
<=> ( empty_set = X1
| empty_set = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t113_zfmisc_1) ).
fof(f3438,plain,
( empty_set != cartesian_product2(sK0,empty_set)
| ~ spl6_7 ),
inference(superposition,[],[f30,f3363]) ).
fof(f30,plain,
empty_set != cartesian_product2(sK0,sK1),
inference(cnf_transformation,[],[f22]) ).
fof(f3416,plain,
( spl6_1
| ~ spl6_3
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f3415]) ).
fof(f3415,plain,
( $false
| spl6_1
| ~ spl6_3
| ~ spl6_6 ),
inference(subsumption_resolution,[],[f3401,f1739]) ).
fof(f3401,plain,
( ~ subset(empty_set,sK2)
| spl6_1
| ~ spl6_6 ),
inference(superposition,[],[f51,f3359]) ).
fof(f3359,plain,
( empty_set = sK0
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f3357]) ).
fof(f51,plain,
( ~ subset(sK0,sK2)
| spl6_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f3414,plain,
~ spl6_6,
inference(avatar_contradiction_clause,[],[f3413]) ).
fof(f3413,plain,
( $false
| ~ spl6_6 ),
inference(subsumption_resolution,[],[f3400,f47]) ).
fof(f47,plain,
! [X1] : empty_set = cartesian_product2(empty_set,X1),
inference(equality_resolution,[],[f39]) ).
fof(f39,plain,
! [X0,X1] :
( empty_set = cartesian_product2(X0,X1)
| empty_set != X0 ),
inference(cnf_transformation,[],[f24]) ).
fof(f3400,plain,
( empty_set != cartesian_product2(empty_set,sK1)
| ~ spl6_6 ),
inference(superposition,[],[f30,f3359]) ).
fof(f3390,plain,
( spl6_1
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f3389]) ).
fof(f3389,plain,
( $false
| spl6_1
| ~ spl6_5 ),
inference(subsumption_resolution,[],[f3370,f51]) ).
fof(f3370,plain,
( subset(sK0,sK2)
| ~ spl6_5 ),
inference(superposition,[],[f58,f3355]) ).
fof(f3355,plain,
( sK0 = set_intersection2(sK0,sK2)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f3353]) ).
fof(f3364,plain,
( spl6_5
| spl6_6
| spl6_7 ),
inference(avatar_split_clause,[],[f3350,f3361,f3357,f3353]) ).
fof(f3350,plain,
( empty_set = sK1
| empty_set = sK0
| sK0 = set_intersection2(sK0,sK2) ),
inference(equality_resolution,[],[f1875]) ).
fof(f1875,plain,
! [X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(sK0,sK1)
| empty_set = X1
| empty_set = X0
| set_intersection2(sK0,sK2) = X0 ),
inference(superposition,[],[f208,f65]) ).
fof(f208,plain,
! [X2,X3,X0,X1,X4,X5] :
( set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) != cartesian_product2(X4,X5)
| empty_set = X5
| empty_set = X4
| set_intersection2(X0,X1) = X4 ),
inference(superposition,[],[f42,f41]) ).
fof(f42,plain,
! [X2,X3,X0,X1] :
( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
| empty_set = X1
| empty_set = X0
| X0 = X2 ),
inference(cnf_transformation,[],[f20]) ).
fof(f1729,plain,
( spl6_3
| spl6_4 ),
inference(avatar_split_clause,[],[f1543,f1727,f1724]) ).
fof(f1727,plain,
( spl6_4
<=> ! [X0] : empty_set = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f1543,plain,
! [X0,X1] :
( empty_set = X0
| empty_set = set_intersection2(X1,empty_set) ),
inference(trivial_inequality_removal,[],[f1502]) ).
fof(f1502,plain,
! [X0,X1] :
( empty_set != empty_set
| empty_set = X0
| empty_set = set_intersection2(X1,empty_set) ),
inference(superposition,[],[f38,f1381]) ).
fof(f1381,plain,
! [X0,X1] : empty_set = cartesian_product2(X0,set_intersection2(X1,empty_set)),
inference(superposition,[],[f1339,f34]) ).
fof(f34,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(f1339,plain,
! [X2,X0,X1] : empty_set = cartesian_product2(X0,set_intersection2(X2,set_intersection2(empty_set,X1))),
inference(forward_demodulation,[],[f1338,f753]) ).
fof(f753,plain,
! [X0,X1] : empty_set = set_intersection2(empty_set,cartesian_product2(X0,X1)),
inference(superposition,[],[f730,f74]) ).
fof(f74,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X0,set_intersection2(X0,X1)),
inference(superposition,[],[f64,f36]) ).
fof(f64,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(set_intersection2(X0,X1),X0),
inference(resolution,[],[f37,f35]) ).
fof(f730,plain,
! [X0,X1] : empty_set = set_intersection2(empty_set,set_intersection2(empty_set,cartesian_product2(X0,X1))),
inference(resolution,[],[f710,f37]) ).
fof(f710,plain,
! [X0,X1] : subset(empty_set,set_intersection2(empty_set,cartesian_product2(X0,X1))),
inference(forward_demodulation,[],[f694,f34]) ).
fof(f694,plain,
! [X0,X1] : subset(set_intersection2(empty_set,empty_set),set_intersection2(empty_set,cartesian_product2(X0,X1))),
inference(superposition,[],[f599,f46]) ).
fof(f599,plain,
! [X2,X0,X1] : subset(set_intersection2(empty_set,cartesian_product2(X0,X2)),set_intersection2(empty_set,cartesian_product2(X0,X1))),
inference(forward_demodulation,[],[f598,f47]) ).
fof(f598,plain,
! [X2,X0,X1] : subset(set_intersection2(cartesian_product2(empty_set,X1),cartesian_product2(X0,X2)),set_intersection2(empty_set,cartesian_product2(X0,X1))),
inference(forward_demodulation,[],[f563,f41]) ).
fof(f563,plain,
! [X2,X0,X1] : subset(cartesian_product2(set_intersection2(empty_set,X0),set_intersection2(X1,X2)),set_intersection2(empty_set,cartesian_product2(X0,X1))),
inference(superposition,[],[f166,f327]) ).
fof(f327,plain,
! [X0,X1] : set_intersection2(empty_set,cartesian_product2(X1,X0)) = cartesian_product2(set_intersection2(empty_set,X1),X0),
inference(superposition,[],[f138,f47]) ).
fof(f138,plain,
! [X2,X0,X1] : set_intersection2(cartesian_product2(X1,X0),cartesian_product2(X2,X0)) = cartesian_product2(set_intersection2(X1,X2),X0),
inference(superposition,[],[f41,f34]) ).
fof(f166,plain,
! [X2,X0,X1] : subset(cartesian_product2(X0,set_intersection2(X1,X2)),cartesian_product2(X0,X1)),
inference(superposition,[],[f35,f129]) ).
fof(f129,plain,
! [X2,X0,X1] : set_intersection2(cartesian_product2(X0,X1),cartesian_product2(X0,X2)) = cartesian_product2(X0,set_intersection2(X1,X2)),
inference(superposition,[],[f41,f34]) ).
fof(f1338,plain,
! [X2,X0,X1] : cartesian_product2(X0,set_intersection2(X2,set_intersection2(empty_set,X1))) = set_intersection2(empty_set,cartesian_product2(X0,X2)),
inference(forward_demodulation,[],[f1291,f753]) ).
fof(f1291,plain,
! [X2,X0,X1] : set_intersection2(set_intersection2(empty_set,cartesian_product2(X0,X1)),cartesian_product2(X0,X2)) = cartesian_product2(X0,set_intersection2(X2,set_intersection2(empty_set,X1))),
inference(superposition,[],[f163,f156]) ).
fof(f156,plain,
! [X0,X1] : cartesian_product2(X0,set_intersection2(empty_set,X1)) = set_intersection2(empty_set,cartesian_product2(X0,X1)),
inference(superposition,[],[f129,f46]) ).
fof(f163,plain,
! [X2,X0,X1] : cartesian_product2(X0,set_intersection2(X1,X2)) = set_intersection2(cartesian_product2(X0,X2),cartesian_product2(X0,X1)),
inference(superposition,[],[f129,f36]) ).
fof(f38,plain,
! [X0,X1] :
( empty_set != cartesian_product2(X0,X1)
| empty_set = X0
| empty_set = X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f56,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f31,f53,f49]) ).
fof(f31,plain,
( ~ subset(sK1,sK3)
| ~ subset(sK0,sK2) ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET984+1 : TPTP v8.2.0. Released v3.2.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 11:56:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (24553)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (24559)WARNING: value z3 for option sas not known
% 0.14/0.38 % (24556)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (24558)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (24560)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (24559)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.38 % (24561)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.38 % (24562)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.38 % (24563)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.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.39 TRYING [3]
% 0.14/0.39 TRYING [4]
% 0.14/0.41 TRYING [4]
% 0.14/0.42 TRYING [5]
% 0.20/0.45 TRYING [5]
% 0.20/0.46 % (24559)First to succeed.
% 0.20/0.46 % (24559)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-24553"
% 0.20/0.46 % (24559)Refutation found. Thanks to Tanya!
% 0.20/0.46 % SZS status Theorem for theBenchmark
% 0.20/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.47 % (24559)------------------------------
% 0.20/0.47 % (24559)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.47 % (24559)Termination reason: Refutation
% 0.20/0.47
% 0.20/0.47 % (24559)Memory used [KB]: 1827
% 0.20/0.47 % (24559)Time elapsed: 0.088 s
% 0.20/0.47 % (24559)Instructions burned: 193 (million)
% 0.20/0.47 % (24553)Success in time 0.104 s
%------------------------------------------------------------------------------