TSTP Solution File: GRP167-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP167-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n023.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 : Sun May 5 05:53:50 EDT 2024
% Result : Unsatisfiable 20.11s 3.23s
% Output : Refutation 20.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 16
% Syntax : Number of formulae : 103 ( 103 unt; 0 def)
% Number of atoms : 103 ( 102 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 157 ( 157 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f141364,plain,
$false,
inference(trivial_inequality_removal,[],[f141313]) ).
fof(f141313,plain,
a != a,
inference(superposition,[],[f20,f140442]) ).
fof(f140442,plain,
! [X0] : multiply(positive_part(X0),negative_part(X0)) = X0,
inference(forward_demodulation,[],[f140161,f658]) ).
fof(f658,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f647,f612]) ).
fof(f612,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f608,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
fof(f608,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f606,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
fof(f606,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f3,f2]) ).
fof(f3,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).
fof(f647,plain,
! [X0] : multiply(X0,identity) = X0,
inference(superposition,[],[f614,f612]) ).
fof(f614,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(superposition,[],[f608,f608]) ).
fof(f140161,plain,
! [X0] : multiply(inverse(inverse(positive_part(X0))),negative_part(X0)) = X0,
inference(superposition,[],[f59649,f140122]) ).
fof(f140122,plain,
! [X0] : inverse(positive_part(X0)) = negative_part(inverse(X0)),
inference(forward_demodulation,[],[f140021,f647]) ).
fof(f140021,plain,
! [X0] : negative_part(inverse(X0)) = multiply(inverse(positive_part(X0)),identity),
inference(superposition,[],[f608,f139870]) ).
fof(f139870,plain,
! [X0] : identity = multiply(positive_part(X0),negative_part(inverse(X0))),
inference(forward_demodulation,[],[f139869,f72]) ).
fof(f72,plain,
! [X0] : identity = negative_part(positive_part(X0)),
inference(forward_demodulation,[],[f69,f35]) ).
fof(f35,plain,
! [X0] : positive_part(X0) = least_upper_bound(identity,X0),
inference(superposition,[],[f5,f16]) ).
fof(f16,axiom,
! [X0] : positive_part(X0) = least_upper_bound(X0,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lat4_1) ).
fof(f5,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f69,plain,
! [X0] : identity = negative_part(least_upper_bound(identity,X0)),
inference(superposition,[],[f11,f25]) ).
fof(f25,plain,
! [X0] : negative_part(X0) = greatest_lower_bound(identity,X0),
inference(superposition,[],[f4,f17]) ).
fof(f17,axiom,
! [X0] : negative_part(X0) = greatest_lower_bound(X0,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lat4_2) ).
fof(f4,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f11,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f139869,plain,
! [X0] : negative_part(positive_part(inverse(X0))) = multiply(positive_part(X0),negative_part(inverse(X0))),
inference(forward_demodulation,[],[f139868,f42634]) ).
fof(f42634,plain,
! [X0] : positive_part(inverse(X0)) = multiply(positive_part(X0),inverse(X0)),
inference(forward_demodulation,[],[f42633,f875]) ).
fof(f875,plain,
! [X0,X1] : inverse(X0) = multiply(X1,inverse(multiply(X0,X1))),
inference(forward_demodulation,[],[f827,f612]) ).
fof(f827,plain,
! [X0,X1] : multiply(inverse(inverse(inverse(X0))),identity) = multiply(X1,inverse(multiply(X0,X1))),
inference(superposition,[],[f642,f693]) ).
fof(f693,plain,
! [X0,X1] : identity = multiply(X0,multiply(X1,inverse(multiply(X0,X1)))),
inference(superposition,[],[f646,f3]) ).
fof(f646,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f614,f2]) ).
fof(f642,plain,
! [X0,X1] : multiply(inverse(inverse(inverse(X0))),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f640,f1]) ).
fof(f640,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(inverse(inverse(X0))),multiply(X0,X1)),
inference(superposition,[],[f3,f621]) ).
fof(f621,plain,
! [X0] : identity = multiply(inverse(inverse(inverse(X0))),X0),
inference(superposition,[],[f608,f612]) ).
fof(f42633,plain,
! [X0,X1] : positive_part(multiply(X1,inverse(multiply(X0,X1)))) = multiply(positive_part(X0),multiply(X1,inverse(multiply(X0,X1)))),
inference(forward_demodulation,[],[f42501,f16]) ).
fof(f42501,plain,
! [X0,X1] : multiply(positive_part(X0),multiply(X1,inverse(multiply(X0,X1)))) = least_upper_bound(multiply(X1,inverse(multiply(X0,X1))),identity),
inference(superposition,[],[f42386,f693]) ).
fof(f42386,plain,
! [X0,X1] : multiply(positive_part(X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(forward_demodulation,[],[f42246,f35]) ).
fof(f42246,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f14,f1]) ).
fof(f14,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X1,X2),X0) = least_upper_bound(multiply(X1,X0),multiply(X2,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).
fof(f139868,plain,
! [X0] : multiply(positive_part(X0),negative_part(inverse(X0))) = negative_part(multiply(positive_part(X0),inverse(X0))),
inference(forward_demodulation,[],[f139755,f27276]) ).
fof(f27276,plain,
! [X0,X1] : negative_part(multiply(positive_part(X0),X1)) = negative_part(multiply(positive_part(X0),negative_part(X1))),
inference(superposition,[],[f1446,f27141]) ).
fof(f27141,plain,
! [X0,X1] : multiply(X0,negative_part(X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f27140,f25]) ).
fof(f27140,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f27139,f614]) ).
fof(f27139,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f27040,f614]) ).
fof(f27040,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(inverse(inverse(X0)),X1)),
inference(superposition,[],[f13,f612]) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb1) ).
fof(f1446,plain,
! [X0,X1] : negative_part(X1) = negative_part(greatest_lower_bound(positive_part(X0),X1)),
inference(superposition,[],[f1065,f1060]) ).
fof(f1060,plain,
! [X0,X1] : negative_part(X1) = greatest_lower_bound(positive_part(X0),negative_part(X1)),
inference(forward_demodulation,[],[f1013,f25]) ).
fof(f1013,plain,
! [X0,X1] : greatest_lower_bound(identity,X1) = greatest_lower_bound(positive_part(X0),greatest_lower_bound(identity,X1)),
inference(superposition,[],[f6,f196]) ).
fof(f196,plain,
! [X0] : identity = greatest_lower_bound(positive_part(X0),identity),
inference(superposition,[],[f131,f72]) ).
fof(f131,plain,
! [X0] : negative_part(X0) = greatest_lower_bound(X0,negative_part(X0)),
inference(superposition,[],[f108,f4]) ).
fof(f108,plain,
! [X0] : negative_part(X0) = greatest_lower_bound(negative_part(X0),X0),
inference(superposition,[],[f62,f46]) ).
fof(f46,plain,
! [X0] : least_upper_bound(X0,negative_part(X0)) = X0,
inference(superposition,[],[f10,f17]) ).
fof(f10,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lub_absorbtion) ).
fof(f62,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[],[f11,f5]) ).
fof(f6,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_glb) ).
fof(f1065,plain,
! [X0,X1] : negative_part(greatest_lower_bound(X0,X1)) = greatest_lower_bound(X0,negative_part(X1)),
inference(forward_demodulation,[],[f1022,f17]) ).
fof(f1022,plain,
! [X0,X1] : negative_part(greatest_lower_bound(X0,X1)) = greatest_lower_bound(X0,greatest_lower_bound(X1,identity)),
inference(superposition,[],[f6,f17]) ).
fof(f139755,plain,
! [X0] : multiply(positive_part(X0),negative_part(inverse(X0))) = negative_part(multiply(positive_part(X0),negative_part(inverse(X0)))),
inference(superposition,[],[f59098,f139257]) ).
fof(f139257,plain,
! [X0] : positive_part(X0) = greatest_lower_bound(inverse(negative_part(inverse(X0))),positive_part(X0)),
inference(forward_demodulation,[],[f139256,f35]) ).
fof(f139256,plain,
! [X0] : least_upper_bound(identity,X0) = greatest_lower_bound(inverse(negative_part(inverse(X0))),positive_part(X0)),
inference(forward_demodulation,[],[f138773,f18153]) ).
fof(f18153,plain,
! [X0] : identity = negative_part(inverse(negative_part(X0))),
inference(superposition,[],[f72,f17838]) ).
fof(f17838,plain,
! [X0] : inverse(negative_part(X0)) = positive_part(inverse(negative_part(X0))),
inference(forward_demodulation,[],[f17812,f647]) ).
fof(f17812,plain,
! [X0] : positive_part(inverse(negative_part(X0))) = multiply(inverse(negative_part(X0)),identity),
inference(superposition,[],[f17290,f52]) ).
fof(f52,plain,
! [X0] : identity = positive_part(negative_part(X0)),
inference(forward_demodulation,[],[f50,f25]) ).
fof(f50,plain,
! [X0] : identity = positive_part(greatest_lower_bound(identity,X0)),
inference(superposition,[],[f10,f35]) ).
fof(f17290,plain,
! [X0] : multiply(inverse(X0),positive_part(X0)) = positive_part(inverse(X0)),
inference(forward_demodulation,[],[f17209,f16]) ).
fof(f17209,plain,
! [X0] : multiply(inverse(X0),positive_part(X0)) = least_upper_bound(inverse(X0),identity),
inference(superposition,[],[f17157,f2]) ).
fof(f17157,plain,
! [X0,X1] : least_upper_bound(X0,multiply(X0,X1)) = multiply(X0,positive_part(X1)),
inference(forward_demodulation,[],[f17156,f35]) ).
fof(f17156,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f17155,f614]) ).
fof(f17155,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f17063,f614]) ).
fof(f17063,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(inverse(inverse(X0)),X1)),
inference(superposition,[],[f12,f612]) ).
fof(f12,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub1) ).
fof(f138773,plain,
! [X0] : greatest_lower_bound(inverse(negative_part(inverse(X0))),positive_part(X0)) = least_upper_bound(negative_part(inverse(negative_part(inverse(X0)))),X0),
inference(superposition,[],[f102064,f60010]) ).
fof(f60010,plain,
! [X0] : greatest_lower_bound(inverse(negative_part(inverse(X0))),X0) = X0,
inference(superposition,[],[f293,f59380]) ).
fof(f59380,plain,
! [X0] : greatest_lower_bound(X0,inverse(negative_part(inverse(X0)))) = X0,
inference(forward_demodulation,[],[f59379,f27653]) ).
fof(f27653,plain,
! [X0] : multiply(negative_part(X0),inverse(negative_part(inverse(X0)))) = X0,
inference(superposition,[],[f929,f27306]) ).
fof(f27306,plain,
! [X0] : negative_part(X0) = multiply(X0,negative_part(inverse(X0))),
inference(forward_demodulation,[],[f27305,f17]) ).
fof(f27305,plain,
! [X0] : greatest_lower_bound(X0,identity) = multiply(X0,negative_part(inverse(X0))),
inference(forward_demodulation,[],[f27211,f875]) ).
fof(f27211,plain,
! [X0,X1] : greatest_lower_bound(X0,identity) = multiply(X0,negative_part(multiply(X1,inverse(multiply(X0,X1))))),
inference(superposition,[],[f27141,f693]) ).
fof(f929,plain,
! [X0,X1] : multiply(multiply(X0,X1),inverse(X1)) = X0,
inference(forward_demodulation,[],[f894,f658]) ).
fof(f894,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(multiply(X0,X1),inverse(X1)),
inference(superposition,[],[f875,f608]) ).
fof(f59379,plain,
! [X0] : multiply(negative_part(X0),inverse(negative_part(inverse(X0)))) = greatest_lower_bound(X0,inverse(negative_part(inverse(X0)))),
inference(forward_demodulation,[],[f59378,f161]) ).
fof(f161,plain,
! [X0] : negative_part(X0) = negative_part(negative_part(X0)),
inference(superposition,[],[f80,f17]) ).
fof(f80,plain,
! [X0] : negative_part(X0) = greatest_lower_bound(negative_part(X0),identity),
inference(superposition,[],[f64,f52]) ).
fof(f64,plain,
! [X0] : greatest_lower_bound(X0,positive_part(X0)) = X0,
inference(superposition,[],[f11,f16]) ).
fof(f59378,plain,
! [X0] : multiply(negative_part(negative_part(X0)),inverse(negative_part(inverse(X0)))) = greatest_lower_bound(X0,inverse(negative_part(inverse(X0)))),
inference(forward_demodulation,[],[f59225,f4]) ).
fof(f59225,plain,
! [X0] : multiply(negative_part(negative_part(X0)),inverse(negative_part(inverse(X0)))) = greatest_lower_bound(inverse(negative_part(inverse(X0))),X0),
inference(superposition,[],[f59097,f27653]) ).
fof(f59097,plain,
! [X0,X1] : multiply(negative_part(X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(forward_demodulation,[],[f58931,f25]) ).
fof(f58931,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X1,X2),X0) = greatest_lower_bound(multiply(X1,X0),multiply(X2,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb2) ).
fof(f293,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f107,f4]) ).
fof(f107,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = greatest_lower_bound(greatest_lower_bound(X1,X0),X0),
inference(superposition,[],[f62,f47]) ).
fof(f47,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f10,f4]) ).
fof(f102064,plain,
! [X0,X1] : greatest_lower_bound(X0,positive_part(X1)) = least_upper_bound(negative_part(X0),greatest_lower_bound(X0,X1)),
inference(forward_demodulation,[],[f101558,f35]) ).
fof(f101558,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(identity,X1)) = least_upper_bound(negative_part(X0),greatest_lower_bound(X0,X1)),
inference(superposition,[],[f19,f17]) ).
fof(f19,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lat4_4) ).
fof(f59098,plain,
! [X0,X1] : negative_part(multiply(X1,X0)) = multiply(greatest_lower_bound(inverse(X0),X1),X0),
inference(forward_demodulation,[],[f58932,f25]) ).
fof(f58932,plain,
! [X0,X1] : multiply(greatest_lower_bound(inverse(X0),X1),X0) = greatest_lower_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f15,f2]) ).
fof(f59649,plain,
! [X0] : multiply(inverse(negative_part(inverse(X0))),negative_part(X0)) = X0,
inference(superposition,[],[f608,f59341]) ).
fof(f59341,plain,
! [X0] : negative_part(X0) = multiply(negative_part(inverse(X0)),X0),
inference(forward_demodulation,[],[f59198,f17]) ).
fof(f59198,plain,
! [X0] : greatest_lower_bound(X0,identity) = multiply(negative_part(inverse(X0)),X0),
inference(superposition,[],[f59097,f2]) ).
fof(f20,axiom,
a != multiply(positive_part(a),negative_part(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lat4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP167-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri May 3 20:40:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (29158)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.36 % (29161)WARNING: value z3 for option sas not known
% 0.12/0.36 % (29161)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.12/0.36 % (29162)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.12/0.36 % (29159)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.12/0.36 % (29165)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.12/0.36 % (29163)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.12/0.36 % (29164)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.12/0.36 % (29160)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.12/0.36 TRYING [1]
% 0.12/0.36 TRYING [2]
% 0.12/0.36 TRYING [3]
% 0.12/0.37 TRYING [1]
% 0.12/0.37 TRYING [2]
% 0.17/0.39 TRYING [3]
% 0.17/0.39 TRYING [4]
% 0.17/0.44 TRYING [4]
% 0.17/0.47 TRYING [5]
% 1.51/0.62 TRYING [5]
% 2.45/0.72 TRYING [6]
% 6.29/1.25 TRYING [6]
% 7.71/1.45 TRYING [7]
% 7.71/1.46 TRYING [1]
% 7.71/1.46 TRYING [2]
% 7.71/1.46 TRYING [3]
% 7.98/1.50 TRYING [4]
% 8.50/1.61 TRYING [5]
% 11.53/1.99 TRYING [6]
% 19.17/3.13 TRYING [8]
% 20.11/3.22 % (29165)First to succeed.
% 20.11/3.23 % (29165)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29158"
% 20.11/3.23 % (29165)Refutation found. Thanks to Tanya!
% 20.11/3.23 % SZS status Unsatisfiable for theBenchmark
% 20.11/3.23 % SZS output start Proof for theBenchmark
% See solution above
% 20.11/3.23 % (29165)------------------------------
% 20.11/3.23 % (29165)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 20.11/3.23 % (29165)Termination reason: Refutation
% 20.11/3.23
% 20.11/3.23 % (29165)Memory used [KB]: 33299
% 20.11/3.23 % (29165)Time elapsed: 2.869 s
% 20.11/3.23 % (29165)Instructions burned: 6009 (million)
% 20.11/3.23 % (29158)Success in time 2.846 s
%------------------------------------------------------------------------------