TSTP Solution File: KLE007+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KLE007+2 : 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 : n021.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.43s
% 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(f1151,plain,
$false,
inference(avatar_sat_refutation,[],[f238,f247,f819,f1088,f1138,f1150]) ).
fof(f1150,plain,
spl3_6,
inference(avatar_contradiction_clause,[],[f1149]) ).
fof(f1149,plain,
( $false
| spl3_6 ),
inference(subsumption_resolution,[],[f1148,f88]) ).
fof(f88,plain,
! [X0] : leq(X0,X0),
inference(trivial_inequality_removal,[],[f83]) ).
fof(f83,plain,
! [X0] :
( X0 != X0
| leq(X0,X0) ),
inference(superposition,[],[f59,f48]) ).
fof(f48,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_idempotence) ).
fof(f59,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,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/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f1148,plain,
( ~ leq(one,one)
| spl3_6 ),
inference(forward_demodulation,[],[f1147,f1013]) ).
fof(f1013,plain,
one = addition(sK0,c(sK0)),
inference(superposition,[],[f205,f980]) ).
fof(f980,plain,
c(sK0) = sK2(sK0),
inference(subsumption_resolution,[],[f975,f41]) ).
fof(f41,plain,
test(sK0),
inference(cnf_transformation,[],[f32]) ).
fof(f32,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])],[f27,f31]) ).
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) )
=> ( ( ~ 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(f27,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,[],[f26]) ).
fof(f26,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,[],[f19]) ).
fof(f19,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,[],[f18]) ).
fof(f18,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,[],[f17]) ).
fof(f17,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/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f975,plain,
( c(sK0) = sK2(sK0)
| ~ test(sK0) ),
inference(resolution,[],[f935,f54]) ).
fof(f54,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| c(X0) = X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,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/sandbox2/benchmark/theBenchmark.p',test_3) ).
fof(f935,plain,
complement(sK0,sK2(sK0)),
inference(subsumption_resolution,[],[f934,f205]) ).
fof(f934,plain,
( one != addition(sK0,sK2(sK0))
| complement(sK0,sK2(sK0)) ),
inference(forward_demodulation,[],[f933,f52]) ).
fof(f52,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/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f933,plain,
( one != addition(sK2(sK0),sK0)
| complement(sK0,sK2(sK0)) ),
inference(subsumption_resolution,[],[f869,f102]) ).
fof(f102,plain,
zero = multiplication(sK2(sK0),sK0),
inference(resolution,[],[f77,f41]) ).
fof(f77,plain,
! [X0] :
( ~ test(X0)
| zero = multiplication(sK2(X0),X0) ),
inference(resolution,[],[f56,f50]) ).
fof(f50,plain,
! [X0] :
( complement(sK2(X0),X0)
| ~ test(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( complement(sK2(X0),X0)
| ~ test(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f34,f35]) ).
fof(f35,plain,
! [X0] :
( ? [X2] : complement(X2,X0)
=> complement(sK2(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X2] : complement(X2,X0)
| ~ test(X0) ) ),
inference(rectify,[],[f33]) ).
fof(f33,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X1] : complement(X1,X0)
| ~ test(X0) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X3] :
( test(X3)
<=> ? [X4] : complement(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_1) ).
fof(f56,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| zero = multiplication(X1,X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,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,[],[f38]) ).
fof(f38,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,[],[f23]) ).
fof(f23,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/sandbox2/benchmark/theBenchmark.p',test_2) ).
fof(f869,plain,
( one != addition(sK2(sK0),sK0)
| complement(sK0,sK2(sK0))
| zero != multiplication(sK2(sK0),sK0) ),
inference(trivial_inequality_removal,[],[f846]) ).
fof(f846,plain,
( zero != zero
| one != addition(sK2(sK0),sK0)
| complement(sK0,sK2(sK0))
| zero != multiplication(sK2(sK0),sK0) ),
inference(superposition,[],[f58,f94]) ).
fof(f94,plain,
zero = multiplication(sK0,sK2(sK0)),
inference(resolution,[],[f75,f41]) ).
fof(f75,plain,
! [X0] :
( ~ test(X0)
| zero = multiplication(X0,sK2(X0)) ),
inference(resolution,[],[f55,f50]) ).
fof(f55,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| zero = multiplication(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f58,plain,
! [X0,X1] :
( zero != multiplication(X1,X0)
| addition(X0,X1) != one
| complement(X1,X0)
| zero != multiplication(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f205,plain,
one = addition(sK0,sK2(sK0)),
inference(resolution,[],[f79,f41]) ).
fof(f79,plain,
! [X0] :
( ~ test(X0)
| one = addition(X0,sK2(X0)) ),
inference(resolution,[],[f57,f50]) ).
fof(f57,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f39]) ).
fof(f1147,plain,
( ~ leq(one,addition(sK0,c(sK0)))
| spl3_6 ),
inference(forward_demodulation,[],[f1146,f45]) ).
fof(f45,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f1146,plain,
( ~ leq(one,multiplication(addition(sK0,c(sK0)),one))
| spl3_6 ),
inference(forward_demodulation,[],[f1087,f1049]) ).
fof(f1049,plain,
one = addition(sK1,c(sK1)),
inference(superposition,[],[f206,f991]) ).
fof(f991,plain,
c(sK1) = sK2(sK1),
inference(subsumption_resolution,[],[f986,f40]) ).
fof(f40,plain,
test(sK1),
inference(cnf_transformation,[],[f32]) ).
fof(f986,plain,
( c(sK1) = sK2(sK1)
| ~ test(sK1) ),
inference(resolution,[],[f966,f54]) ).
fof(f966,plain,
complement(sK1,sK2(sK1)),
inference(subsumption_resolution,[],[f965,f206]) ).
fof(f965,plain,
( one != addition(sK1,sK2(sK1))
| complement(sK1,sK2(sK1)) ),
inference(forward_demodulation,[],[f964,f52]) ).
fof(f964,plain,
( one != addition(sK2(sK1),sK1)
| complement(sK1,sK2(sK1)) ),
inference(subsumption_resolution,[],[f865,f103]) ).
fof(f103,plain,
zero = multiplication(sK2(sK1),sK1),
inference(resolution,[],[f77,f40]) ).
fof(f865,plain,
( one != addition(sK2(sK1),sK1)
| complement(sK1,sK2(sK1))
| zero != multiplication(sK2(sK1),sK1) ),
inference(trivial_inequality_removal,[],[f856]) ).
fof(f856,plain,
( zero != zero
| one != addition(sK2(sK1),sK1)
| complement(sK1,sK2(sK1))
| zero != multiplication(sK2(sK1),sK1) ),
inference(superposition,[],[f58,f95]) ).
fof(f95,plain,
zero = multiplication(sK1,sK2(sK1)),
inference(resolution,[],[f75,f40]) ).
fof(f206,plain,
one = addition(sK1,sK2(sK1)),
inference(resolution,[],[f79,f40]) ).
fof(f1087,plain,
( ~ leq(one,multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1))))
| spl3_6 ),
inference(avatar_component_clause,[],[f1085]) ).
fof(f1085,plain,
( spl3_6
<=> leq(one,multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f1138,plain,
spl3_5,
inference(avatar_contradiction_clause,[],[f1137]) ).
fof(f1137,plain,
( $false
| spl3_5 ),
inference(subsumption_resolution,[],[f1136,f88]) ).
fof(f1136,plain,
( ~ leq(one,one)
| spl3_5 ),
inference(forward_demodulation,[],[f1135,f1013]) ).
fof(f1135,plain,
( ~ leq(addition(sK0,c(sK0)),one)
| spl3_5 ),
inference(forward_demodulation,[],[f1130,f45]) ).
fof(f1130,plain,
( ~ leq(multiplication(addition(sK0,c(sK0)),one),one)
| spl3_5 ),
inference(superposition,[],[f1083,f1049]) ).
fof(f1083,plain,
( ~ leq(multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1))),one)
| spl3_5 ),
inference(avatar_component_clause,[],[f1081]) ).
fof(f1081,plain,
( spl3_5
<=> leq(multiplication(addition(sK0,c(sK0)),addition(sK1,c(sK1))),one) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f1088,plain,
( ~ spl3_5
| ~ spl3_6 ),
inference(avatar_split_clause,[],[f1033,f1085,f1081]) ).
fof(f1033,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,[],[f1032,f62]) ).
fof(f62,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/sandbox2/benchmark/theBenchmark.p',right_distributivity) ).
fof(f1032,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,[],[f42,f62]) ).
fof(f42,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,[],[f32]) ).
fof(f819,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f818]) ).
fof(f818,plain,
( $false
| spl3_1 ),
inference(subsumption_resolution,[],[f817,f232]) ).
fof(f232,plain,
( ~ leq(sK0,one)
| spl3_1 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f231,plain,
( spl3_1
<=> leq(sK0,one) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f817,plain,
leq(sK0,one),
inference(trivial_inequality_removal,[],[f814]) ).
fof(f814,plain,
( one != one
| leq(sK0,one) ),
inference(superposition,[],[f59,f807]) ).
fof(f807,plain,
one = addition(sK0,one),
inference(forward_demodulation,[],[f801,f48]) ).
fof(f801,plain,
addition(one,one) = addition(sK0,one),
inference(superposition,[],[f250,f255]) ).
fof(f255,plain,
one = addition(one,sK2(sK0)),
inference(forward_demodulation,[],[f249,f205]) ).
fof(f249,plain,
addition(sK0,sK2(sK0)) = addition(one,sK2(sK0)),
inference(superposition,[],[f215,f48]) ).
fof(f215,plain,
! [X0] : addition(sK0,addition(sK2(sK0),X0)) = addition(one,X0),
inference(superposition,[],[f61,f205]) ).
fof(f61,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f24]) ).
fof(f24,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/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).
fof(f250,plain,
! [X0] : addition(one,X0) = addition(sK0,addition(X0,sK2(sK0))),
inference(superposition,[],[f215,f52]) ).
fof(f247,plain,
( spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f229,f244,f240]) ).
fof(f240,plain,
( spl3_3
<=> leq(sK1,one) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f244,plain,
( spl3_4
<=> one = sK2(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f229,plain,
( one != sK2(sK1)
| leq(sK1,one) ),
inference(inner_rewriting,[],[f228]) ).
fof(f228,plain,
( one != sK2(sK1)
| leq(sK1,sK2(sK1)) ),
inference(superposition,[],[f59,f206]) ).
fof(f238,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f208,f235,f231]) ).
fof(f235,plain,
( spl3_2
<=> one = sK2(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f208,plain,
( one != sK2(sK0)
| leq(sK0,one) ),
inference(inner_rewriting,[],[f207]) ).
fof(f207,plain,
( one != sK2(sK0)
| leq(sK0,sK2(sK0)) ),
inference(superposition,[],[f59,f205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : KLE007+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Apr 30 05:07:40 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.38 % (11986)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.39 % (11989)WARNING: value z3 for option sas not known
% 0.15/0.39 % (11993)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.39 % (11988)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.39 % (11990)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.39 % (11992)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.39 % (11989)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.39 % (11991)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.40 TRYING [1]
% 0.15/0.40 TRYING [2]
% 0.15/0.40 % (11987)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.40 TRYING [3]
% 0.15/0.40 TRYING [1]
% 0.15/0.40 TRYING [1]
% 0.15/0.40 TRYING [2]
% 0.15/0.40 TRYING [4]
% 0.15/0.40 TRYING [2]
% 0.15/0.41 TRYING [3]
% 0.22/0.42 TRYING [4]
% 0.22/0.42 TRYING [3]
% 0.22/0.42 % (11989)First to succeed.
% 0.22/0.42 % (11992)Also succeeded, but the first one will report.
% 0.22/0.43 % (11989)Refutation found. Thanks to Tanya!
% 0.22/0.43 % SZS status Theorem for theBenchmark
% 0.22/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.43 % (11989)------------------------------
% 0.22/0.43 % (11989)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.43 % (11989)Termination reason: Refutation
% 0.22/0.43
% 0.22/0.43 % (11989)Memory used [KB]: 1276
% 0.22/0.43 % (11989)Time elapsed: 0.032 s
% 0.22/0.43 % (11989)Instructions burned: 63 (million)
% 0.22/0.43 % (11989)------------------------------
% 0.22/0.43 % (11989)------------------------------
% 0.22/0.43 % (11986)Success in time 0.047 s
%------------------------------------------------------------------------------