TSTP Solution File: KLE007+4 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KLE007+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n006.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 13:11:25 EDT 2024
% Result : Theorem 0.22s 0.42s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 18
% Syntax : Number of formulae : 111 ( 37 unt; 0 def)
% Number of atoms : 240 ( 88 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 214 ( 85 ~; 77 |; 30 &)
% ( 14 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 91 ( 80 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1305,plain,
$false,
inference(avatar_sat_refutation,[],[f248,f257,f829,f1239,f1296,f1304]) ).
fof(f1304,plain,
spl3_6,
inference(avatar_contradiction_clause,[],[f1303]) ).
fof(f1303,plain,
( $false
| spl3_6 ),
inference(subsumption_resolution,[],[f1302,f98]) ).
fof(f98,plain,
! [X0] : leq(X0,X0),
inference(trivial_inequality_removal,[],[f93]) ).
fof(f93,plain,
! [X0] :
( X0 != X0
| leq(X0,X0) ),
inference(superposition,[],[f69,f56]) ).
fof(f56,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_idempotence) ).
fof(f69,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( addition(X0,X1) = X1
=> leq(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f1302,plain,
( ~ leq(one,one)
| spl3_6 ),
inference(forward_demodulation,[],[f1301,f1156]) ).
fof(f1156,plain,
one = addition(sK0,c(sK0)),
inference(superposition,[],[f215,f1119]) ).
fof(f1119,plain,
c(sK0) = sK2(sK0),
inference(subsumption_resolution,[],[f1114,f49]) ).
fof(f49,plain,
test(sK0),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
( ( ~ leq(addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1))),one)
| ~ leq(one,addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1)))) )
& test(sK0)
& test(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f31,f39]) ).
fof(f39,plain,
( ? [X0,X1] :
( ( ~ leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one)
| ~ leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))) )
& test(X0)
& test(X1) )
=> ( ( ~ leq(addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1))),one)
| ~ leq(one,addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1)))) )
& test(sK0)
& test(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
? [X0,X1] :
( ( ~ leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one)
| ~ leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))) )
& test(X0)
& test(X1) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
? [X0,X1] :
( ( ~ leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one)
| ~ leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))) )
& test(X0)
& test(X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0,X1] :
( ( test(X0)
& test(X1) )
=> ( leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one)
& leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))) ) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3,X4] :
( ( test(X3)
& test(X4) )
=> ( leq(addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4))),one)
& leq(one,addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4)))) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3,X4] :
( ( test(X3)
& test(X4) )
=> ( leq(addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4))),one)
& leq(one,addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f1114,plain,
( c(sK0) = sK2(sK0)
| ~ test(sK0) ),
inference(resolution,[],[f1074,f62]) ).
fof(f62,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| c(X0) = X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X3,X4] :
( test(X3)
=> ( c(X3) = X4
<=> complement(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_3) ).
fof(f1074,plain,
complement(sK0,sK2(sK0)),
inference(subsumption_resolution,[],[f1073,f215]) ).
fof(f1073,plain,
( one != addition(sK0,sK2(sK0))
| complement(sK0,sK2(sK0)) ),
inference(forward_demodulation,[],[f1072,f60]) ).
fof(f60,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f1072,plain,
( one != addition(sK2(sK0),sK0)
| complement(sK0,sK2(sK0)) ),
inference(subsumption_resolution,[],[f1008,f112]) ).
fof(f112,plain,
zero = multiplication(sK2(sK0),sK0),
inference(resolution,[],[f87,f49]) ).
fof(f87,plain,
! [X0] :
( ~ test(X0)
| zero = multiplication(sK2(X0),X0) ),
inference(resolution,[],[f66,f58]) ).
fof(f58,plain,
! [X0] :
( complement(sK2(X0),X0)
| ~ test(X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( complement(sK2(X0),X0)
| ~ test(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f42,f43]) ).
fof(f43,plain,
! [X0] :
( ? [X2] : complement(X2,X0)
=> complement(sK2(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X2] : complement(X2,X0)
| ~ test(X0) ) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X1] : complement(X1,X0)
| ~ test(X0) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X3] :
( test(X3)
<=> ? [X4] : complement(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_1) ).
fof(f66,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| zero = multiplication(X1,X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f46]) ).
fof(f46,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3,X4] :
( complement(X4,X3)
<=> ( one = addition(X3,X4)
& zero = multiplication(X4,X3)
& zero = multiplication(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_2) ).
fof(f1008,plain,
( one != addition(sK2(sK0),sK0)
| complement(sK0,sK2(sK0))
| zero != multiplication(sK2(sK0),sK0) ),
inference(trivial_inequality_removal,[],[f985]) ).
fof(f985,plain,
( zero != zero
| one != addition(sK2(sK0),sK0)
| complement(sK0,sK2(sK0))
| zero != multiplication(sK2(sK0),sK0) ),
inference(superposition,[],[f68,f104]) ).
fof(f104,plain,
zero = multiplication(sK0,sK2(sK0)),
inference(resolution,[],[f85,f49]) ).
fof(f85,plain,
! [X0] :
( ~ test(X0)
| zero = multiplication(X0,sK2(X0)) ),
inference(resolution,[],[f65,f58]) ).
fof(f65,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| zero = multiplication(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f68,plain,
! [X0,X1] :
( zero != multiplication(X1,X0)
| addition(X0,X1) != one
| complement(X1,X0)
| zero != multiplication(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f215,plain,
one = addition(sK0,sK2(sK0)),
inference(resolution,[],[f89,f49]) ).
fof(f89,plain,
! [X0] :
( ~ test(X0)
| one = addition(X0,sK2(X0)) ),
inference(resolution,[],[f67,f58]) ).
fof(f67,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f47]) ).
fof(f1301,plain,
( ~ leq(one,addition(sK0,c(sK0)))
| spl3_6 ),
inference(forward_demodulation,[],[f1300,f53]) ).
fof(f53,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f1300,plain,
( ~ leq(one,multiplication(addition(sK0,c(sK0)),one))
| spl3_6 ),
inference(forward_demodulation,[],[f1238,f1196]) ).
fof(f1196,plain,
one = addition(sK1,c(sK1)),
inference(superposition,[],[f216,f1132]) ).
fof(f1132,plain,
c(sK1) = sK2(sK1),
inference(subsumption_resolution,[],[f1127,f48]) ).
fof(f48,plain,
test(sK1),
inference(cnf_transformation,[],[f40]) ).
fof(f1127,plain,
( c(sK1) = sK2(sK1)
| ~ test(sK1) ),
inference(resolution,[],[f1105,f62]) ).
fof(f1105,plain,
complement(sK1,sK2(sK1)),
inference(subsumption_resolution,[],[f1104,f216]) ).
fof(f1104,plain,
( one != addition(sK1,sK2(sK1))
| complement(sK1,sK2(sK1)) ),
inference(forward_demodulation,[],[f1103,f60]) ).
fof(f1103,plain,
( one != addition(sK2(sK1),sK1)
| complement(sK1,sK2(sK1)) ),
inference(subsumption_resolution,[],[f1004,f113]) ).
fof(f113,plain,
zero = multiplication(sK2(sK1),sK1),
inference(resolution,[],[f87,f48]) ).
fof(f1004,plain,
( one != addition(sK2(sK1),sK1)
| complement(sK1,sK2(sK1))
| zero != multiplication(sK2(sK1),sK1) ),
inference(trivial_inequality_removal,[],[f995]) ).
fof(f995,plain,
( zero != zero
| one != addition(sK2(sK1),sK1)
| complement(sK1,sK2(sK1))
| zero != multiplication(sK2(sK1),sK1) ),
inference(superposition,[],[f68,f105]) ).
fof(f105,plain,
zero = multiplication(sK1,sK2(sK1)),
inference(resolution,[],[f85,f48]) ).
fof(f216,plain,
one = addition(sK1,sK2(sK1)),
inference(resolution,[],[f89,f48]) ).
fof(f1238,plain,
( ~ leq(one,multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1))))
| spl3_6 ),
inference(avatar_component_clause,[],[f1236]) ).
fof(f1236,plain,
( spl3_6
<=> leq(one,multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f1296,plain,
spl3_5,
inference(avatar_contradiction_clause,[],[f1295]) ).
fof(f1295,plain,
( $false
| spl3_5 ),
inference(subsumption_resolution,[],[f1294,f98]) ).
fof(f1294,plain,
( ~ leq(one,one)
| spl3_5 ),
inference(forward_demodulation,[],[f1293,f1156]) ).
fof(f1293,plain,
( ~ leq(addition(sK0,c(sK0)),one)
| spl3_5 ),
inference(forward_demodulation,[],[f1292,f53]) ).
fof(f1292,plain,
( ~ leq(multiplication(addition(sK0,c(sK0)),one),one)
| spl3_5 ),
inference(forward_demodulation,[],[f1234,f1196]) ).
fof(f1234,plain,
( ~ leq(multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1))),one)
| spl3_5 ),
inference(avatar_component_clause,[],[f1232]) ).
fof(f1232,plain,
( spl3_5
<=> leq(multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1))),one) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f1239,plain,
( ~ spl3_5
| ~ spl3_6 ),
inference(avatar_split_clause,[],[f1191,f1236,f1232]) ).
fof(f1191,plain,
( ~ leq(one,multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1))))
| ~ leq(multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1))),one) ),
inference(forward_demodulation,[],[f1190,f72]) ).
fof(f72,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_distributivity) ).
fof(f1190,plain,
( ~ leq(multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1))),one)
| ~ leq(one,addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1)))) ),
inference(forward_demodulation,[],[f50,f72]) ).
fof(f50,plain,
( ~ leq(addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1))),one)
| ~ leq(one,addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1)))) ),
inference(cnf_transformation,[],[f40]) ).
fof(f829,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f828]) ).
fof(f828,plain,
( $false
| spl3_1 ),
inference(subsumption_resolution,[],[f827,f242]) ).
fof(f242,plain,
( ~ leq(sK0,one)
| spl3_1 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f241,plain,
( spl3_1
<=> leq(sK0,one) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f827,plain,
leq(sK0,one),
inference(trivial_inequality_removal,[],[f824]) ).
fof(f824,plain,
( one != one
| leq(sK0,one) ),
inference(superposition,[],[f69,f817]) ).
fof(f817,plain,
one = addition(sK0,one),
inference(forward_demodulation,[],[f811,f56]) ).
fof(f811,plain,
addition(one,one) = addition(sK0,one),
inference(superposition,[],[f260,f265]) ).
fof(f265,plain,
one = addition(one,sK2(sK0)),
inference(forward_demodulation,[],[f259,f215]) ).
fof(f259,plain,
addition(sK0,sK2(sK0)) = addition(one,sK2(sK0)),
inference(superposition,[],[f225,f56]) ).
fof(f225,plain,
! [X0] : addition(sK0,addition(sK2(sK0),X0)) = addition(one,X0),
inference(superposition,[],[f71,f215]) ).
fof(f71,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).
fof(f260,plain,
! [X0] : addition(one,X0) = addition(sK0,addition(X0,sK2(sK0))),
inference(superposition,[],[f225,f60]) ).
fof(f257,plain,
( spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f239,f254,f250]) ).
fof(f250,plain,
( spl3_3
<=> leq(sK1,one) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f254,plain,
( spl3_4
<=> one = sK2(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f239,plain,
( one != sK2(sK1)
| leq(sK1,one) ),
inference(inner_rewriting,[],[f238]) ).
fof(f238,plain,
( one != sK2(sK1)
| leq(sK1,sK2(sK1)) ),
inference(superposition,[],[f69,f216]) ).
fof(f248,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f218,f245,f241]) ).
fof(f245,plain,
( spl3_2
<=> one = sK2(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f218,plain,
( one != sK2(sK0)
| leq(sK0,one) ),
inference(inner_rewriting,[],[f217]) ).
fof(f217,plain,
( one != sK2(sK0)
| leq(sK0,sK2(sK0)) ),
inference(superposition,[],[f69,f215]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE007+4 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 04:58:05 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (15598)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (15601)WARNING: value z3 for option sas not known
% 0.15/0.38 % (15599)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (15600)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (15602)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (15603)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.38 % (15601)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.38 % (15605)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.38 % (15604)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.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [3]
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [2]
% 0.22/0.39 TRYING [1]
% 0.22/0.39 TRYING [2]
% 0.22/0.39 TRYING [4]
% 0.22/0.39 TRYING [3]
% 0.22/0.40 TRYING [3]
% 0.22/0.41 TRYING [4]
% 0.22/0.41 % (15601)First to succeed.
% 0.22/0.42 % (15601)Refutation found. Thanks to Tanya!
% 0.22/0.42 % SZS status Theorem for theBenchmark
% 0.22/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.42 % (15601)------------------------------
% 0.22/0.42 % (15601)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.42 % (15601)Termination reason: Refutation
% 0.22/0.42
% 0.22/0.42 % (15601)Memory used [KB]: 1396
% 0.22/0.42 % (15601)Time elapsed: 0.040 s
% 0.22/0.42 % (15601)Instructions burned: 69 (million)
% 0.22/0.42 % (15601)------------------------------
% 0.22/0.42 % (15601)------------------------------
% 0.22/0.42 % (15598)Success in time 0.056 s
%------------------------------------------------------------------------------