TSTP Solution File: KLE139+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KLE139+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 : 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 13:12:01 EDT 2024
% Result : Theorem 102.44s 14.96s
% Output : Refutation 102.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 26
% Syntax : Number of formulae : 106 ( 51 unt; 0 def)
% Number of atoms : 165 ( 66 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 110 ( 51 ~; 43 |; 4 &)
% ( 9 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 133 ( 131 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f300771,plain,
$false,
inference(avatar_sat_refutation,[],[f240,f1013,f1096,f40610,f300555,f300557]) ).
fof(f300557,plain,
spl1_3,
inference(avatar_contradiction_clause,[],[f300556]) ).
fof(f300556,plain,
( $false
| spl1_3 ),
inference(subsumption_resolution,[],[f300081,f64]) ).
fof(f64,plain,
! [X0] : leq(X0,X0),
inference(trivial_inequality_removal,[],[f59]) ).
fof(f59,plain,
! [X0] :
( X0 != X0
| leq(X0,X0) ),
inference(superposition,[],[f42,f35]) ).
fof(f35,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',idempotence) ).
fof(f42,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f300081,plain,
( ~ leq(strong_iteration(sK0),strong_iteration(sK0))
| spl1_3 ),
inference(superposition,[],[f1008,f297321]) ).
fof(f297321,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(strong_iteration(X0),X0)),
inference(forward_demodulation,[],[f297320,f39]) ).
fof(f39,plain,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isolation) ).
fof(f297320,plain,
! [X0] : addition(star(X0),multiplication(strong_iteration(X0),zero)) = addition(one,multiplication(strong_iteration(X0),X0)),
inference(forward_demodulation,[],[f297319,f31]) ).
fof(f31,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).
fof(f297319,plain,
! [X0] : addition(one,multiplication(strong_iteration(X0),X0)) = addition(star(X0),multiplication(strong_iteration(X0),multiplication(zero,X0))),
inference(forward_demodulation,[],[f296720,f44]) ).
fof(f44,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f296720,plain,
! [X0] : addition(one,multiplication(strong_iteration(X0),X0)) = addition(star(X0),multiplication(multiplication(strong_iteration(X0),zero),X0)),
inference(superposition,[],[f6432,f39]) ).
fof(f6432,plain,
! [X0,X1] : addition(star(X0),multiplication(X1,X0)) = addition(one,multiplication(addition(star(X0),X1),X0)),
inference(superposition,[],[f180,f46]) ).
fof(f46,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity2) ).
fof(f180,plain,
! [X0,X1] : addition(star(X0),X1) = addition(one,addition(multiplication(star(X0),X0),X1)),
inference(superposition,[],[f43,f37]) ).
fof(f37,plain,
! [X0] : star(X0) = addition(one,multiplication(star(X0),X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0] : star(X0) = addition(one,multiplication(star(X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_unfold2) ).
fof(f43,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f22]) ).
fof(f22,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(f1008,plain,
( ~ leq(addition(one,multiplication(strong_iteration(sK0),sK0)),strong_iteration(sK0))
| spl1_3 ),
inference(avatar_component_clause,[],[f1006]) ).
fof(f1006,plain,
( spl1_3
<=> leq(addition(one,multiplication(strong_iteration(sK0),sK0)),strong_iteration(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
fof(f300555,plain,
spl1_4,
inference(avatar_contradiction_clause,[],[f300554]) ).
fof(f300554,plain,
( $false
| spl1_4 ),
inference(subsumption_resolution,[],[f300079,f64]) ).
fof(f300079,plain,
( ~ leq(strong_iteration(sK0),strong_iteration(sK0))
| spl1_4 ),
inference(superposition,[],[f1012,f297321]) ).
fof(f1012,plain,
( ~ leq(strong_iteration(sK0),addition(one,multiplication(strong_iteration(sK0),sK0)))
| spl1_4 ),
inference(avatar_component_clause,[],[f1010]) ).
fof(f1010,plain,
( spl1_4
<=> leq(strong_iteration(sK0),addition(one,multiplication(strong_iteration(sK0),sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
fof(f40610,plain,
( spl1_7
| ~ spl1_8 ),
inference(avatar_split_clause,[],[f39575,f40607,f40604]) ).
fof(f40604,plain,
( spl1_7
<=> ! [X0] : leq(star(X0),one) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_7])]) ).
fof(f40607,plain,
( spl1_8
<=> one = strong_iteration(one) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_8])]) ).
fof(f39575,plain,
! [X0] :
( one != strong_iteration(one)
| leq(star(X0),one) ),
inference(superposition,[],[f131,f39218]) ).
fof(f39218,plain,
! [X0] : strong_iteration(one) = strong_iteration(star(X0)),
inference(superposition,[],[f4736,f573]) ).
fof(f573,plain,
! [X0] : strong_iteration(one) = addition(strong_iteration(one),X0),
inference(superposition,[],[f567,f40]) ).
fof(f40,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(f567,plain,
! [X0] : strong_iteration(one) = addition(X0,strong_iteration(one)),
inference(resolution,[],[f566,f41]) ).
fof(f41,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f566,plain,
! [X0] : leq(X0,strong_iteration(one)),
inference(superposition,[],[f562,f33]) ).
fof(f33,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(f562,plain,
! [X0,X1] : leq(X0,multiplication(strong_iteration(one),X1)),
inference(subsumption_resolution,[],[f547,f314]) ).
fof(f314,plain,
! [X0,X1] : leq(X0,addition(X0,X1)),
inference(trivial_inequality_removal,[],[f308]) ).
fof(f308,plain,
! [X0,X1] :
( addition(X0,X1) != addition(X0,X1)
| leq(X0,addition(X0,X1)) ),
inference(superposition,[],[f42,f171]) ).
fof(f171,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f43,f35]) ).
fof(f547,plain,
! [X0,X1] :
( ~ leq(X0,addition(X0,X1))
| leq(X0,multiplication(strong_iteration(one),X1)) ),
inference(superposition,[],[f47,f34]) ).
fof(f34,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ leq(X2,addition(multiplication(X0,X2),X1))
| leq(X2,multiplication(strong_iteration(X0),X1)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( leq(X2,multiplication(strong_iteration(X0),X1))
| ~ leq(X2,addition(multiplication(X0,X2),X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(X2,addition(multiplication(X0,X2),X1))
=> leq(X2,multiplication(strong_iteration(X0),X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infty_coinduction) ).
fof(f4736,plain,
! [X0,X1] : strong_iteration(star(X1)) = addition(X0,strong_iteration(star(X1))),
inference(resolution,[],[f4714,f41]) ).
fof(f4714,plain,
! [X0,X1] : leq(X1,strong_iteration(star(X0))),
inference(superposition,[],[f4708,f36]) ).
fof(f36,plain,
! [X0] : star(X0) = addition(one,multiplication(X0,star(X0))),
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0] : star(X0) = addition(one,multiplication(X0,star(X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_unfold1) ).
fof(f4708,plain,
! [X0,X1] : leq(X1,strong_iteration(addition(one,X0))),
inference(superposition,[],[f4373,f33]) ).
fof(f4373,plain,
! [X2,X0,X1] : leq(X1,multiplication(strong_iteration(addition(one,X0)),X2)),
inference(subsumption_resolution,[],[f4372,f314]) ).
fof(f4372,plain,
! [X2,X0,X1] :
( ~ leq(X1,addition(X1,addition(multiplication(X0,X1),X2)))
| leq(X1,multiplication(strong_iteration(addition(one,X0)),X2)) ),
inference(forward_demodulation,[],[f4274,f43]) ).
fof(f4274,plain,
! [X2,X0,X1] :
( ~ leq(X1,addition(addition(X1,multiplication(X0,X1)),X2))
| leq(X1,multiplication(strong_iteration(addition(one,X0)),X2)) ),
inference(superposition,[],[f47,f436]) ).
fof(f436,plain,
! [X0,X1] : multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
inference(superposition,[],[f46,f34]) ).
fof(f131,plain,
! [X0] :
( one != strong_iteration(X0)
| leq(X0,one) ),
inference(forward_demodulation,[],[f130,f33]) ).
fof(f130,plain,
! [X0] :
( one != strong_iteration(X0)
| leq(multiplication(X0,one),one) ),
inference(inner_rewriting,[],[f125]) ).
fof(f125,plain,
! [X0] :
( one != strong_iteration(X0)
| leq(multiplication(X0,strong_iteration(X0)),one) ),
inference(superposition,[],[f42,f38]) ).
fof(f38,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infty_unfold1) ).
fof(f1096,plain,
( ~ spl1_5
| spl1_6 ),
inference(avatar_split_clause,[],[f1086,f1094,f1090]) ).
fof(f1090,plain,
( spl1_5
<=> leq(one,zero) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
fof(f1094,plain,
( spl1_6
<=> ! [X0] : leq(star(X0),zero) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_6])]) ).
fof(f1086,plain,
! [X0] :
( leq(star(X0),zero)
| ~ leq(one,zero) ),
inference(superposition,[],[f688,f34]) ).
fof(f688,plain,
! [X0,X1] :
( leq(multiplication(X1,star(X0)),zero)
| ~ leq(X1,zero) ),
inference(forward_demodulation,[],[f671,f50]) ).
fof(f50,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f40,f32]) ).
fof(f32,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity) ).
fof(f671,plain,
! [X0,X1] :
( ~ leq(addition(zero,X1),zero)
| leq(multiplication(X1,star(X0)),zero) ),
inference(superposition,[],[f48,f31]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ leq(addition(multiplication(X2,X0),X1),X2)
| leq(multiplication(X1,star(X0)),X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( leq(multiplication(X1,star(X0)),X2)
| ~ leq(addition(multiplication(X2,X0),X1),X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X2,X0),X1),X2)
=> leq(multiplication(X1,star(X0)),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_induction2) ).
fof(f1013,plain,
( ~ spl1_3
| ~ spl1_4 ),
inference(avatar_split_clause,[],[f893,f1010,f1006]) ).
fof(f893,plain,
( ~ leq(strong_iteration(sK0),addition(one,multiplication(strong_iteration(sK0),sK0)))
| ~ leq(addition(one,multiplication(strong_iteration(sK0),sK0)),strong_iteration(sK0)) ),
inference(forward_demodulation,[],[f892,f40]) ).
fof(f892,plain,
( ~ leq(addition(one,multiplication(strong_iteration(sK0),sK0)),strong_iteration(sK0))
| ~ leq(strong_iteration(sK0),addition(multiplication(strong_iteration(sK0),sK0),one)) ),
inference(forward_demodulation,[],[f30,f40]) ).
fof(f30,plain,
( ~ leq(addition(multiplication(strong_iteration(sK0),sK0),one),strong_iteration(sK0))
| ~ leq(strong_iteration(sK0),addition(multiplication(strong_iteration(sK0),sK0),one)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( ~ leq(addition(multiplication(strong_iteration(sK0),sK0),one),strong_iteration(sK0))
| ~ leq(strong_iteration(sK0),addition(multiplication(strong_iteration(sK0),sK0),one)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f27]) ).
fof(f27,plain,
( ? [X0] :
( ~ leq(addition(multiplication(strong_iteration(X0),X0),one),strong_iteration(X0))
| ~ leq(strong_iteration(X0),addition(multiplication(strong_iteration(X0),X0),one)) )
=> ( ~ leq(addition(multiplication(strong_iteration(sK0),sK0),one),strong_iteration(sK0))
| ~ leq(strong_iteration(sK0),addition(multiplication(strong_iteration(sK0),sK0),one)) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0] :
( ~ leq(addition(multiplication(strong_iteration(X0),X0),one),strong_iteration(X0))
| ~ leq(strong_iteration(X0),addition(multiplication(strong_iteration(X0),X0),one)) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0] :
( leq(addition(multiplication(strong_iteration(X0),X0),one),strong_iteration(X0))
& leq(strong_iteration(X0),addition(multiplication(strong_iteration(X0),X0),one)) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X3] :
( leq(addition(multiplication(strong_iteration(X3),X3),one),strong_iteration(X3))
& leq(strong_iteration(X3),addition(multiplication(strong_iteration(X3),X3),one)) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X3] :
( leq(addition(multiplication(strong_iteration(X3),X3),one),strong_iteration(X3))
& leq(strong_iteration(X3),addition(multiplication(strong_iteration(X3),X3),one)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f240,plain,
( ~ spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f229,f237,f233]) ).
fof(f233,plain,
( spl1_1
<=> zero = strong_iteration(one) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f237,plain,
( spl1_2
<=> zero = one ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f229,plain,
( zero = one
| zero != strong_iteration(one) ),
inference(inner_rewriting,[],[f213]) ).
fof(f213,plain,
( one = strong_iteration(one)
| zero != strong_iteration(one) ),
inference(superposition,[],[f197,f121]) ).
fof(f121,plain,
strong_iteration(one) = addition(strong_iteration(one),one),
inference(superposition,[],[f38,f34]) ).
fof(f197,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| zero != X0 ),
inference(forward_demodulation,[],[f169,f50]) ).
fof(f169,plain,
! [X0,X1] :
( addition(zero,X1) = addition(X0,addition(zero,X1))
| zero != X0 ),
inference(superposition,[],[f43,f74]) ).
fof(f74,plain,
! [X0] :
( zero = addition(X0,zero)
| zero != X0 ),
inference(resolution,[],[f58,f41]) ).
fof(f58,plain,
! [X0] :
( leq(X0,zero)
| zero != X0 ),
inference(superposition,[],[f42,f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE139+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 04:59:56 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (20095)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (20098)WARNING: value z3 for option sas not known
% 0.21/0.38 % (20096)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38 % (20099)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38 % (20097)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38 % (20098)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.21/0.38 % (20100)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.21/0.38 % (20101)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.21/0.38 % (20102)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.21/0.38 TRYING [1]
% 0.21/0.38 TRYING [2]
% 0.21/0.39 TRYING [3]
% 0.21/0.39 TRYING [1]
% 0.21/0.39 TRYING [2]
% 0.21/0.40 TRYING [4]
% 0.21/0.41 TRYING [3]
% 0.21/0.45 TRYING [5]
% 0.21/0.46 TRYING [4]
% 1.23/0.54 TRYING [6]
% 1.38/0.56 TRYING [5]
% 2.34/0.72 TRYING [7]
% 2.97/0.80 TRYING [6]
% 5.16/1.09 TRYING [8]
% 7.83/1.46 TRYING [7]
% 7.83/1.48 TRYING [1]
% 7.83/1.48 TRYING [2]
% 7.83/1.48 TRYING [3]
% 7.83/1.49 TRYING [4]
% 8.30/1.53 TRYING [5]
% 8.56/1.64 TRYING [6]
% 10.54/1.91 TRYING [7]
% 11.51/1.99 TRYING [9]
% 15.50/2.58 TRYING [8]
% 25.25/3.97 TRYING [8]
% 25.25/3.99 TRYING [10]
% 26.22/4.14 TRYING [9]
% 50.73/7.60 TRYING [10]
% 52.21/7.84 TRYING [11]
% 90.47/13.26 TRYING [11]
% 95.25/13.93 TRYING [12]
% 102.44/14.94 % (20098)First to succeed.
% 102.44/14.96 % (20098)Refutation found. Thanks to Tanya!
% 102.44/14.96 % SZS status Theorem for theBenchmark
% 102.44/14.96 % SZS output start Proof for theBenchmark
% See solution above
% 102.44/14.96 % (20098)------------------------------
% 102.44/14.96 % (20098)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 102.44/14.96 % (20098)Termination reason: Refutation
% 102.44/14.96
% 102.44/14.96 % (20098)Memory used [KB]: 169118
% 102.44/14.96 % (20098)Time elapsed: 14.561 s
% 102.44/14.96 % (20098)Instructions burned: 57827 (million)
% 102.44/14.96 % (20098)------------------------------
% 102.44/14.96 % (20098)------------------------------
% 102.44/14.96 % (20095)Success in time 14.384 s
%------------------------------------------------------------------------------