TSTP Solution File: SET995+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET995+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 : n026.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:13 EDT 2024
% Result : Theorem 0.14s 0.50s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 73 ( 25 unt; 0 def)
% Number of atoms : 313 ( 107 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 357 ( 117 ~; 110 |; 98 &)
% ( 15 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 131 ( 104 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9926,plain,
$false,
inference(subsumption_resolution,[],[f9921,f5711]) ).
fof(f5711,plain,
in(apply(sK5,sK8(sK5,sK6)),singleton(sK4)),
inference(unit_resulting_resolution,[],[f390,f5657,f140]) ).
fof(f140,plain,
! [X3,X0,X1] :
( ~ sP1(X0,X1)
| ~ sP0(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
! [X0,X1] :
( ( sP1(X0,X1)
| ( ( ~ sP0(sK9(X0,X1),X0)
| ~ in(sK9(X0,X1),X1) )
& ( sP0(sK9(X0,X1),X0)
| in(sK9(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ sP0(X3,X0) )
& ( sP0(X3,X0)
| ~ in(X3,X1) ) )
| ~ sP1(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f81,f82]) ).
fof(f82,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ sP0(X2,X0)
| ~ in(X2,X1) )
& ( sP0(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ sP0(sK9(X0,X1),X0)
| ~ in(sK9(X0,X1),X1) )
& ( sP0(sK9(X0,X1),X0)
| in(sK9(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f81,plain,
! [X0,X1] :
( ( sP1(X0,X1)
| ? [X2] :
( ( ~ sP0(X2,X0)
| ~ in(X2,X1) )
& ( sP0(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ sP0(X3,X0) )
& ( sP0(X3,X0)
| ~ in(X3,X1) ) )
| ~ sP1(X0,X1) ) ),
inference(rectify,[],[f80]) ).
fof(f80,plain,
! [X0,X1] :
( ( sP1(X0,X1)
| ? [X2] :
( ( ~ sP0(X2,X0)
| ~ in(X2,X1) )
& ( sP0(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ sP0(X2,X0) )
& ( sP0(X2,X0)
| ~ in(X2,X1) ) )
| ~ sP1(X0,X1) ) ),
inference(nnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0,X1] :
( sP1(X0,X1)
<=> ! [X2] :
( in(X2,X1)
<=> sP0(X2,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f5657,plain,
sP0(apply(sK5,sK8(sK5,sK6)),sK5),
inference(unit_resulting_resolution,[],[f5609,f175]) ).
fof(f175,plain,
! [X2,X1] :
( ~ in(X2,relation_dom(X1))
| sP0(apply(X1,X2),X1) ),
inference(equality_resolution,[],[f145]) ).
fof(f145,plain,
! [X2,X0,X1] :
( sP0(X0,X1)
| apply(X1,X2) != X0
| ~ in(X2,relation_dom(X1)) ),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ! [X2] :
( apply(X1,X2) != X0
| ~ in(X2,relation_dom(X1)) ) )
& ( ( apply(X1,sK10(X0,X1)) = X0
& in(sK10(X0,X1),relation_dom(X1)) )
| ~ sP0(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f85,f86]) ).
fof(f86,plain,
! [X0,X1] :
( ? [X3] :
( apply(X1,X3) = X0
& in(X3,relation_dom(X1)) )
=> ( apply(X1,sK10(X0,X1)) = X0
& in(sK10(X0,X1),relation_dom(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ! [X2] :
( apply(X1,X2) != X0
| ~ in(X2,relation_dom(X1)) ) )
& ( ? [X3] :
( apply(X1,X3) = X0
& in(X3,relation_dom(X1)) )
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f84]) ).
fof(f84,plain,
! [X2,X0] :
( ( sP0(X2,X0)
| ! [X3] :
( apply(X0,X3) != X2
| ~ in(X3,relation_dom(X0)) ) )
& ( ? [X3] :
( apply(X0,X3) = X2
& in(X3,relation_dom(X0)) )
| ~ sP0(X2,X0) ) ),
inference(nnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X2,X0] :
( sP0(X2,X0)
<=> ? [X3] :
( apply(X0,X3) = X2
& in(X3,relation_dom(X0)) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f5609,plain,
in(sK8(sK5,sK6),relation_dom(sK5)),
inference(unit_resulting_resolution,[],[f109,f110,f111,f112,f116,f113,f135]) ).
fof(f135,plain,
! [X0,X1] :
( ~ relation(X1)
| in(sK8(X0,X1),relation_dom(X0))
| relation_dom(X0) != relation_dom(X1)
| ~ function(X1)
| X0 = X1
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ( apply(X0,sK8(X0,X1)) != apply(X1,sK8(X0,X1))
& in(sK8(X0,X1),relation_dom(X0)) )
| relation_dom(X0) != relation_dom(X1)
| ~ function(X1)
| ~ relation(X1) )
| ~ function(X0)
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f53,f77]) ).
fof(f77,plain,
! [X0,X1] :
( ? [X2] :
( apply(X0,X2) != apply(X1,X2)
& in(X2,relation_dom(X0)) )
=> ( apply(X0,sK8(X0,X1)) != apply(X1,sK8(X0,X1))
& in(sK8(X0,X1),relation_dom(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ? [X2] :
( apply(X0,X2) != apply(X1,X2)
& in(X2,relation_dom(X0)) )
| relation_dom(X0) != relation_dom(X1)
| ~ function(X1)
| ~ relation(X1) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f52]) ).
fof(f52,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ? [X2] :
( apply(X0,X2) != apply(X1,X2)
& in(X2,relation_dom(X0)) )
| relation_dom(X0) != relation_dom(X1)
| ~ function(X1)
| ~ relation(X1) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f35]) ).
fof(f35,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ! [X1] :
( ( function(X1)
& relation(X1) )
=> ( ( ! [X2] :
( in(X2,relation_dom(X0))
=> apply(X0,X2) = apply(X1,X2) )
& relation_dom(X0) = relation_dom(X1) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_funct_1) ).
fof(f113,plain,
relation_dom(sK5) = relation_dom(sK6),
inference(cnf_transformation,[],[f74]) ).
fof(f74,plain,
( sK5 != sK6
& singleton(sK4) = relation_rng(sK6)
& singleton(sK4) = relation_rng(sK5)
& relation_dom(sK5) = relation_dom(sK6)
& function(sK6)
& relation(sK6)
& function(sK5)
& relation(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f41,f73,f72]) ).
fof(f72,plain,
( ? [X0,X1] :
( ? [X2] :
( X1 != X2
& singleton(X0) = relation_rng(X2)
& singleton(X0) = relation_rng(X1)
& relation_dom(X1) = relation_dom(X2)
& function(X2)
& relation(X2) )
& function(X1)
& relation(X1) )
=> ( ? [X2] :
( sK5 != X2
& relation_rng(X2) = singleton(sK4)
& singleton(sK4) = relation_rng(sK5)
& relation_dom(X2) = relation_dom(sK5)
& function(X2)
& relation(X2) )
& function(sK5)
& relation(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f73,plain,
( ? [X2] :
( sK5 != X2
& relation_rng(X2) = singleton(sK4)
& singleton(sK4) = relation_rng(sK5)
& relation_dom(X2) = relation_dom(sK5)
& function(X2)
& relation(X2) )
=> ( sK5 != sK6
& singleton(sK4) = relation_rng(sK6)
& singleton(sK4) = relation_rng(sK5)
& relation_dom(sK5) = relation_dom(sK6)
& function(sK6)
& relation(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
? [X0,X1] :
( ? [X2] :
( X1 != X2
& singleton(X0) = relation_rng(X2)
& singleton(X0) = relation_rng(X1)
& relation_dom(X1) = relation_dom(X2)
& function(X2)
& relation(X2) )
& function(X1)
& relation(X1) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
? [X0,X1] :
( ? [X2] :
( X1 != X2
& singleton(X0) = relation_rng(X2)
& singleton(X0) = relation_rng(X1)
& relation_dom(X1) = relation_dom(X2)
& function(X2)
& relation(X2) )
& function(X1)
& relation(X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,negated_conjecture,
~ ! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( ( singleton(X0) = relation_rng(X2)
& singleton(X0) = relation_rng(X1)
& relation_dom(X1) = relation_dom(X2) )
=> X1 = X2 ) ) ),
inference(negated_conjecture,[],[f25]) ).
fof(f25,conjecture,
! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( ( singleton(X0) = relation_rng(X2)
& singleton(X0) = relation_rng(X1)
& relation_dom(X1) = relation_dom(X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_funct_1) ).
fof(f116,plain,
sK5 != sK6,
inference(cnf_transformation,[],[f74]) ).
fof(f112,plain,
function(sK6),
inference(cnf_transformation,[],[f74]) ).
fof(f111,plain,
relation(sK6),
inference(cnf_transformation,[],[f74]) ).
fof(f110,plain,
function(sK5),
inference(cnf_transformation,[],[f74]) ).
fof(f109,plain,
relation(sK5),
inference(cnf_transformation,[],[f74]) ).
fof(f390,plain,
sP1(sK5,singleton(sK4)),
inference(forward_demodulation,[],[f382,f114]) ).
fof(f114,plain,
singleton(sK4) = relation_rng(sK5),
inference(cnf_transformation,[],[f74]) ).
fof(f382,plain,
sP1(sK5,relation_rng(sK5)),
inference(unit_resulting_resolution,[],[f349,f174]) ).
fof(f174,plain,
! [X0] :
( ~ sP2(X0)
| sP1(X0,relation_rng(X0)) ),
inference(equality_resolution,[],[f137]) ).
fof(f137,plain,
! [X0,X1] :
( sP1(X0,X1)
| relation_rng(X0) != X1
| ~ sP2(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f79,plain,
! [X0] :
( ! [X1] :
( ( relation_rng(X0) = X1
| ~ sP1(X0,X1) )
& ( sP1(X0,X1)
| relation_rng(X0) != X1 ) )
| ~ sP2(X0) ),
inference(nnf_transformation,[],[f68]) ).
fof(f68,plain,
! [X0] :
( ! [X1] :
( relation_rng(X0) = X1
<=> sP1(X0,X1) )
| ~ sP2(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f349,plain,
sP2(sK5),
inference(unit_resulting_resolution,[],[f110,f109,f146]) ).
fof(f146,plain,
! [X0] :
( ~ relation(X0)
| ~ function(X0)
| sP2(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
! [X0] :
( sP2(X0)
| ~ function(X0)
| ~ relation(X0) ),
inference(definition_folding,[],[f55,f68,f67,f66]) ).
fof(f55,plain,
! [X0] :
( ! [X1] :
( relation_rng(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( apply(X0,X3) = X2
& in(X3,relation_dom(X0)) ) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f54]) ).
fof(f54,plain,
! [X0] :
( ! [X1] :
( relation_rng(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( apply(X0,X3) = X2
& in(X3,relation_dom(X0)) ) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ! [X1] :
( relation_rng(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( apply(X0,X3) = X2
& in(X3,relation_dom(X0)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_funct_1) ).
fof(f9921,plain,
~ in(apply(sK5,sK8(sK5,sK6)),singleton(sK4)),
inference(unit_resulting_resolution,[],[f9914,f2328]) ).
fof(f2328,plain,
! [X0,X1] :
( ~ in(X0,singleton(X1))
| X0 = X1 ),
inference(resolution,[],[f154,f177]) ).
fof(f177,plain,
! [X0] : sP3(X0,singleton(X0)),
inference(equality_resolution,[],[f158]) ).
fof(f158,plain,
! [X0,X1] :
( sP3(X0,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ~ sP3(X0,X1) )
& ( sP3(X0,X1)
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f71]) ).
fof(f71,plain,
! [X0,X1] :
( singleton(X0) = X1
<=> sP3(X0,X1) ),
inference(definition_folding,[],[f4,f70]) ).
fof(f70,plain,
! [X0,X1] :
( sP3(X0,X1)
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f4,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f154,plain,
! [X3,X0,X1] :
( ~ sP3(X0,X1)
| ~ in(X3,X1)
| X0 = X3 ),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ( ( sK13(X0,X1) != X0
| ~ in(sK13(X0,X1),X1) )
& ( sK13(X0,X1) = X0
| in(sK13(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| ~ sP3(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f93,f94]) ).
fof(f94,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK13(X0,X1) != X0
| ~ in(sK13(X0,X1),X1) )
& ( sK13(X0,X1) = X0
| in(sK13(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| ~ sP3(X0,X1) ) ),
inference(rectify,[],[f92]) ).
fof(f92,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| ~ sP3(X0,X1) ) ),
inference(nnf_transformation,[],[f70]) ).
fof(f9914,plain,
sK4 != apply(sK5,sK8(sK5,sK6)),
inference(superposition,[],[f6279,f9892]) ).
fof(f9892,plain,
sK4 = apply(sK6,sK8(sK5,sK6)),
inference(unit_resulting_resolution,[],[f177,f5699,f154]) ).
fof(f5699,plain,
in(apply(sK6,sK8(sK5,sK6)),singleton(sK4)),
inference(unit_resulting_resolution,[],[f389,f5656,f140]) ).
fof(f5656,plain,
sP0(apply(sK6,sK8(sK5,sK6)),sK6),
inference(unit_resulting_resolution,[],[f5609,f2599]) ).
fof(f2599,plain,
! [X0] :
( ~ in(X0,relation_dom(sK5))
| sP0(apply(sK6,X0),sK6) ),
inference(superposition,[],[f175,f113]) ).
fof(f389,plain,
sP1(sK6,singleton(sK4)),
inference(forward_demodulation,[],[f383,f115]) ).
fof(f115,plain,
singleton(sK4) = relation_rng(sK6),
inference(cnf_transformation,[],[f74]) ).
fof(f383,plain,
sP1(sK6,relation_rng(sK6)),
inference(unit_resulting_resolution,[],[f350,f174]) ).
fof(f350,plain,
sP2(sK6),
inference(unit_resulting_resolution,[],[f112,f111,f146]) ).
fof(f6279,plain,
apply(sK6,sK8(sK5,sK6)) != apply(sK5,sK8(sK5,sK6)),
inference(unit_resulting_resolution,[],[f109,f110,f111,f112,f116,f113,f136]) ).
fof(f136,plain,
! [X0,X1] :
( ~ relation(X1)
| apply(X0,sK8(X0,X1)) != apply(X1,sK8(X0,X1))
| relation_dom(X0) != relation_dom(X1)
| ~ function(X1)
| X0 = X1
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET995+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30 % Computer : n026.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Apr 30 01:24:04 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.31 % (26725)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.32 % (26730)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.32 % (26727)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.32 % (26732)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.32 % (26729)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.32 % (26731)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.33 TRYING [1]
% 0.14/0.33 TRYING [2]
% 0.14/0.33 TRYING [3]
% 0.14/0.33 TRYING [4]
% 0.14/0.33 % (26726)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.34 % (26728)WARNING: value z3 for option sas not known
% 0.14/0.34 % (26728)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.35 TRYING [5]
% 0.14/0.36 TRYING [1]
% 0.14/0.36 TRYING [2]
% 0.14/0.36 TRYING [1]
% 0.14/0.36 TRYING [3]
% 0.14/0.36 TRYING [4]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [6]
% 0.14/0.38 TRYING [5]
% 0.14/0.40 TRYING [3]
% 0.14/0.41 TRYING [6]
% 0.14/0.42 TRYING [7]
% 0.14/0.46 TRYING [7]
% 0.14/0.46 TRYING [4]
% 0.14/0.50 TRYING [8]
% 0.14/0.50 % (26732)First to succeed.
% 0.14/0.50 % (26732)Refutation found. Thanks to Tanya!
% 0.14/0.50 % SZS status Theorem for theBenchmark
% 0.14/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.50 % (26732)------------------------------
% 0.14/0.50 % (26732)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.50 % (26732)Termination reason: Refutation
% 0.14/0.50
% 0.14/0.50 % (26732)Memory used [KB]: 3607
% 0.14/0.50 % (26732)Time elapsed: 0.177 s
% 0.14/0.50 % (26732)Instructions burned: 366 (million)
% 0.14/0.50 % (26732)------------------------------
% 0.14/0.50 % (26732)------------------------------
% 0.14/0.50 % (26725)Success in time 0.192 s
%------------------------------------------------------------------------------