TSTP Solution File: GRP183-2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP183-2 : 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 : n019.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:57 EDT 2024
% Result : Timeout 291.43s 41.93s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 17
% Syntax : Number of formulae : 97 ( 97 unt; 0 def)
% Number of atoms : 97 ( 96 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 163 ( 163 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1932380,plain,
$false,
inference(trivial_inequality_removal,[],[f1931922]) ).
fof(f1931922,plain,
identity != identity,
inference(superposition,[],[f19,f1869926]) ).
fof(f1869926,plain,
! [X0] : identity = greatest_lower_bound(least_upper_bound(X0,identity),inverse(greatest_lower_bound(X0,identity))),
inference(forward_demodulation,[],[f1869005,f17]) ).
fof(f17,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p20_2) ).
fof(f1869005,plain,
! [X0] : identity = greatest_lower_bound(inverse(inverse(least_upper_bound(X0,identity))),inverse(greatest_lower_bound(X0,identity))),
inference(superposition,[],[f153308,f1866547]) ).
fof(f1866547,plain,
! [X0] : inverse(least_upper_bound(X0,identity)) = greatest_lower_bound(identity,inverse(X0)),
inference(forward_demodulation,[],[f1866546,f26800]) ).
fof(f26800,plain,
! [X0] : least_upper_bound(X0,identity) = multiply(least_upper_bound(identity,inverse(X0)),X0),
inference(superposition,[],[f26278,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
fof(f26278,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f14,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
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/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).
fof(f1866546,plain,
! [X0] : greatest_lower_bound(identity,inverse(X0)) = inverse(multiply(least_upper_bound(identity,inverse(X0)),X0)),
inference(forward_demodulation,[],[f1865640,f28844]) ).
fof(f28844,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X0),X1) = multiply(least_upper_bound(X0,identity),X1),
inference(forward_demodulation,[],[f28796,f1]) ).
fof(f28796,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X0),X1) = multiply(least_upper_bound(X0,identity),multiply(identity,X1)),
inference(superposition,[],[f3,f28576]) ).
fof(f28576,plain,
! [X0] : least_upper_bound(identity,X0) = multiply(least_upper_bound(X0,identity),identity),
inference(superposition,[],[f403,f28146]) ).
fof(f28146,plain,
! [X0] : identity = multiply(inverse(least_upper_bound(X0,identity)),least_upper_bound(identity,X0)),
inference(superposition,[],[f2,f28049]) ).
fof(f28049,plain,
! [X0] : inverse(least_upper_bound(identity,X0)) = inverse(least_upper_bound(X0,identity)),
inference(forward_demodulation,[],[f28048,f267]) ).
fof(f267,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f262,f17]) ).
fof(f262,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f17,f251]) ).
fof(f251,plain,
! [X0] : inverse(X0) = inverse(multiply(X0,identity)),
inference(forward_demodulation,[],[f243,f1]) ).
fof(f243,plain,
! [X0] : inverse(multiply(X0,identity)) = multiply(identity,inverse(X0)),
inference(superposition,[],[f18,f16]) ).
fof(f16,axiom,
identity = inverse(identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p20_1) ).
fof(f18,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p20_3) ).
fof(f28048,plain,
! [X0] : inverse(least_upper_bound(X0,identity)) = inverse(multiply(least_upper_bound(identity,X0),identity)),
inference(forward_demodulation,[],[f28047,f26278]) ).
fof(f28047,plain,
! [X0] : inverse(least_upper_bound(X0,identity)) = inverse(least_upper_bound(identity,multiply(X0,identity))),
inference(forward_demodulation,[],[f28046,f5]) ).
fof(f5,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f28046,plain,
! [X0] : inverse(least_upper_bound(X0,identity)) = inverse(least_upper_bound(multiply(X0,identity),identity)),
inference(forward_demodulation,[],[f28045,f16]) ).
fof(f28045,plain,
! [X0] : inverse(least_upper_bound(multiply(X0,identity),identity)) = inverse(least_upper_bound(X0,inverse(identity))),
inference(forward_demodulation,[],[f28000,f26801]) ).
fof(f26801,plain,
! [X0,X1] : least_upper_bound(X0,inverse(X1)) = multiply(least_upper_bound(identity,inverse(multiply(X0,X1))),X0),
inference(superposition,[],[f26278,f425]) ).
fof(f425,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(multiply(X0,X1)),X0),
inference(superposition,[],[f246,f399]) ).
fof(f399,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f381,f1]) ).
fof(f381,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f3,f2]) ).
fof(f246,plain,
! [X0,X1] : inverse(multiply(inverse(X0),X1)) = multiply(inverse(X1),X0),
inference(superposition,[],[f18,f17]) ).
fof(f28000,plain,
! [X0] : inverse(least_upper_bound(multiply(X0,identity),identity)) = inverse(multiply(least_upper_bound(identity,inverse(multiply(X0,identity))),X0)),
inference(superposition,[],[f266,f26800]) ).
fof(f266,plain,
! [X0,X1] : inverse(multiply(X1,X0)) = inverse(multiply(X1,multiply(X0,identity))),
inference(forward_demodulation,[],[f259,f18]) ).
fof(f259,plain,
! [X0,X1] : multiply(inverse(X0),inverse(X1)) = inverse(multiply(X1,multiply(X0,identity))),
inference(superposition,[],[f18,f251]) ).
fof(f403,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(forward_demodulation,[],[f386,f1]) ).
fof(f386,plain,
! [X0,X1] : multiply(identity,X1) = multiply(X0,multiply(inverse(X0),X1)),
inference(superposition,[],[f3,f22]) ).
fof(f22,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f2,f17]) ).
fof(f3,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
fof(f1865640,plain,
! [X0] : greatest_lower_bound(identity,inverse(X0)) = inverse(multiply(least_upper_bound(inverse(X0),identity),X0)),
inference(superposition,[],[f1858994,f18]) ).
fof(f1858994,plain,
! [X0] : greatest_lower_bound(identity,X0) = multiply(X0,inverse(least_upper_bound(X0,identity))),
inference(superposition,[],[f28162,f1857550]) ).
fof(f1857550,plain,
! [X0] : multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0)) = X0,
inference(forward_demodulation,[],[f1857549,f28]) ).
fof(f28,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f10,f4]) ).
fof(f4,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f10,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
fof(f1857549,plain,
! [X0] : least_upper_bound(X0,greatest_lower_bound(identity,X0)) = multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0)),
inference(forward_demodulation,[],[f1855911,f1663639]) ).
fof(f1663639,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(identity,X0)) = least_upper_bound(X1,multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X1))),
inference(superposition,[],[f43175,f4898]) ).
fof(f4898,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(multiply(X0,X1),X0),
inference(forward_demodulation,[],[f4859,f2498]) ).
fof(f2498,plain,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X2),multiply(X0,least_upper_bound(X1,X2))),
inference(superposition,[],[f92,f12]) ).
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/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
fof(f92,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,least_upper_bound(X0,X1)),
inference(superposition,[],[f45,f5]) ).
fof(f45,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(least_upper_bound(X1,X0),X0),
inference(superposition,[],[f28,f31]) ).
fof(f31,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[],[f11,f5]) ).
fof(f11,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f4859,plain,
! [X0,X1] : least_upper_bound(multiply(X0,X1),X0) = least_upper_bound(multiply(X0,X1),multiply(X0,least_upper_bound(identity,X1))),
inference(superposition,[],[f995,f2455]) ).
fof(f2455,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f12,f267]) ).
fof(f995,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X1,X0)),
inference(superposition,[],[f7,f38]) ).
fof(f38,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(least_upper_bound(X0,X1),X0),
inference(superposition,[],[f28,f11]) ).
fof(f7,axiom,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f43175,plain,
! [X2,X0,X1] : least_upper_bound(X0,X2) = least_upper_bound(X0,least_upper_bound(multiply(greatest_lower_bound(identity,X1),X0),X2)),
inference(superposition,[],[f982,f42775]) ).
fof(f42775,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/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
fof(f982,plain,
! [X2,X0,X1] : least_upper_bound(X0,X2) = least_upper_bound(X0,least_upper_bound(greatest_lower_bound(X0,X1),X2)),
inference(superposition,[],[f7,f10]) ).
fof(f1855911,plain,
! [X0] : multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0)) = least_upper_bound(X0,multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0))),
inference(superposition,[],[f177,f1854652]) ).
fof(f1854652,plain,
! [X0] : greatest_lower_bound(X0,multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0))) = X0,
inference(forward_demodulation,[],[f1852687,f62680]) ).
fof(f62680,plain,
! [X0] : multiply(least_upper_bound(X0,identity),greatest_lower_bound(identity,X0)) = multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0)),
inference(forward_demodulation,[],[f62510,f42818]) ).
fof(f42818,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,X0)) = greatest_lower_bound(least_upper_bound(X0,identity),multiply(X1,least_upper_bound(identity,X0))),
inference(superposition,[],[f15,f9596]) ).
fof(f9596,plain,
! [X0] : multiply(identity,least_upper_bound(identity,X0)) = least_upper_bound(X0,identity),
inference(superposition,[],[f4898,f1]) ).
fof(f62510,plain,
! [X0] : multiply(least_upper_bound(X0,identity),greatest_lower_bound(identity,X0)) = greatest_lower_bound(least_upper_bound(X0,identity),multiply(X0,least_upper_bound(identity,X0))),
inference(superposition,[],[f11587,f29307]) ).
fof(f29307,plain,
! [X0] : multiply(X0,least_upper_bound(identity,X0)) = multiply(least_upper_bound(X0,identity),X0),
inference(superposition,[],[f26310,f4898]) ).
fof(f26310,plain,
! [X0,X1] : multiply(least_upper_bound(X1,identity),X0) = least_upper_bound(multiply(X1,X0),X0),
inference(superposition,[],[f14,f1]) ).
fof(f11587,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f13,f267]) ).
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/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).
fof(f1852687,plain,
! [X0] : greatest_lower_bound(X0,multiply(least_upper_bound(X0,identity),greatest_lower_bound(identity,X0))) = X0,
inference(superposition,[],[f179317,f11587]) ).
fof(f179317,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X0,X2),multiply(least_upper_bound(X1,identity),X0))) = X0,
inference(superposition,[],[f178275,f29462]) ).
fof(f29462,plain,
! [X0,X1] : multiply(least_upper_bound(X0,identity),X1) = least_upper_bound(X1,multiply(X0,X1)),
inference(forward_demodulation,[],[f29461,f26945]) ).
fof(f26945,plain,
! [X0,X1] : multiply(least_upper_bound(X0,identity),X1) = multiply(least_upper_bound(identity,inverse(X0)),multiply(X0,X1)),
inference(forward_demodulation,[],[f26807,f26310]) ).
fof(f26807,plain,
! [X0,X1] : least_upper_bound(multiply(X0,X1),X1) = multiply(least_upper_bound(identity,inverse(X0)),multiply(X0,X1)),
inference(superposition,[],[f26278,f399]) ).
fof(f29461,plain,
! [X0,X1] : least_upper_bound(X1,multiply(X0,X1)) = multiply(least_upper_bound(identity,inverse(X0)),multiply(X0,X1)),
inference(forward_demodulation,[],[f29280,f5]) ).
fof(f29280,plain,
! [X0,X1] : least_upper_bound(X1,multiply(X0,X1)) = multiply(least_upper_bound(inverse(X0),identity),multiply(X0,X1)),
inference(superposition,[],[f26310,f399]) ).
fof(f178275,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X0,X1),least_upper_bound(X0,X2))) = X0,
inference(superposition,[],[f766,f11]) ).
fof(f766,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X1,least_upper_bound(greatest_lower_bound(X0,X1),X2))),
inference(superposition,[],[f6,f11]) ).
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/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).
fof(f177,plain,
! [X0,X1] : least_upper_bound(greatest_lower_bound(X1,X0),X0) = X0,
inference(superposition,[],[f92,f28]) ).
fof(f28162,plain,
! [X0,X1] : multiply(multiply(X1,least_upper_bound(identity,X0)),inverse(least_upper_bound(X0,identity))) = X1,
inference(superposition,[],[f502,f28049]) ).
fof(f502,plain,
! [X0,X1] : multiply(multiply(X1,X0),inverse(X0)) = X1,
inference(forward_demodulation,[],[f501,f17]) ).
fof(f501,plain,
! [X0,X1] : inverse(inverse(X1)) = multiply(multiply(X1,X0),inverse(X0)),
inference(forward_demodulation,[],[f476,f17]) ).
fof(f476,plain,
! [X0,X1] : inverse(inverse(X1)) = multiply(inverse(inverse(multiply(X1,X0))),inverse(X0)),
inference(superposition,[],[f425,f18]) ).
fof(f153308,plain,
! [X0] : identity = greatest_lower_bound(inverse(greatest_lower_bound(identity,inverse(X0))),inverse(greatest_lower_bound(X0,identity))),
inference(forward_demodulation,[],[f152937,f22]) ).
fof(f152937,plain,
! [X0] : multiply(greatest_lower_bound(X0,identity),inverse(greatest_lower_bound(X0,identity))) = greatest_lower_bound(inverse(greatest_lower_bound(identity,inverse(X0))),inverse(greatest_lower_bound(X0,identity))),
inference(superposition,[],[f42824,f44905]) ).
fof(f44905,plain,
! [X0] : inverse(greatest_lower_bound(identity,inverse(X0))) = multiply(X0,inverse(greatest_lower_bound(X0,identity))),
inference(superposition,[],[f436,f43061]) ).
fof(f43061,plain,
! [X0] : greatest_lower_bound(X0,identity) = multiply(greatest_lower_bound(identity,inverse(X0)),X0),
inference(superposition,[],[f42775,f2]) ).
fof(f436,plain,
! [X0,X1] : inverse(X1) = multiply(X0,inverse(multiply(X1,X0))),
inference(forward_demodulation,[],[f423,f17]) ).
fof(f423,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(inverse(X0)),inverse(multiply(X1,X0))),
inference(superposition,[],[f399,f18]) ).
fof(f42824,plain,
! [X0,X1] : multiply(greatest_lower_bound(X1,identity),X0) = greatest_lower_bound(multiply(X1,X0),X0),
inference(superposition,[],[f15,f1]) ).
fof(f19,axiom,
identity != greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p20) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP183-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n019.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 : Fri May 3 20:40:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (27059)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (27062)WARNING: value z3 for option sas not known
% 0.22/0.38 % (27063)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.38 % (27064)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.22/0.38 % (27065)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 % (27066)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.22/0.38 % (27062)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.22/0.38 % (27060)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.38 % (27061)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [2]
% 0.22/0.39 TRYING [1]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [2]
% 0.22/0.40 TRYING [3]
% 0.22/0.41 TRYING [4]
% 0.22/0.45 TRYING [4]
% 0.22/0.48 TRYING [5]
% 1.42/0.56 TRYING [5]
% 1.42/0.61 TRYING [6]
% 2.97/0.81 TRYING [6]
% 4.09/0.94 TRYING [7]
% 7.79/1.48 TRYING [1]
% 7.79/1.48 TRYING [2]
% 7.79/1.48 TRYING [3]
% 7.79/1.50 TRYING [4]
% 8.28/1.54 TRYING [7]
% 8.28/1.55 TRYING [5]
% 8.59/1.65 TRYING [8]
% 9.42/1.70 TRYING [6]
% 12.41/2.13 TRYING [7]
% 19.27/3.16 TRYING [8]
% 21.46/3.41 TRYING [9]
% 21.46/3.44 TRYING [8]
% 36.63/5.57 TRYING [9]
% 45.33/6.85 TRYING [10]
% 66.49/9.88 TRYING [10]
% 75.04/11.05 TRYING [9]
% 78.07/11.50 TRYING [11]
% 139.60/20.23 TRYING [12]
% 142.36/20.67 TRYING [11]
% 230.26/33.18 TRYING [12]
% 252.37/36.40 TRYING [13]
% 291.43/41.93 % (27066)First to succeed.
% 291.86/41.96 % (27066)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27059"
% 291.86/42.00 % (27066)Refutation found. Thanks to Tanya!
% 291.86/42.00 % SZS status Unsatisfiable for theBenchmark
% 291.86/42.00 % SZS output start Proof for theBenchmark
% See solution above
% 291.86/42.00 % (27066)------------------------------
% 291.86/42.00 % (27066)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 291.86/42.00 % (27066)Termination reason: Refutation
% 291.86/42.00
% 291.86/42.00 % (27066)Memory used [KB]: 487856
% 291.86/42.00 % (27066)Time elapsed: 41.585 s
% 291.86/42.00 % (27066)Instructions burned: 134212 (million)
% 291.86/42.00 % (27059)Success in time 41.463 s
%------------------------------------------------------------------------------