TSTP Solution File: GRP184-2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GRP184-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n012.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 : Wed Aug 31 16:14:46 EDT 2022
% Result : Unsatisfiable 1.60s 0.56s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of formulae : 39 ( 39 unt; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 20 ( 20 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 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 : 33 ( 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f471,plain,
$false,
inference(trivial_inequality_removal,[],[f470]) ).
fof(f470,plain,
least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(inverse(a),identity))) != least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(inverse(a),identity))),
inference(forward_demodulation,[],[f469,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
fof(f469,plain,
least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(multiply(identity,inverse(a)),identity))) != least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(inverse(a),identity))),
inference(forward_demodulation,[],[f467,f27]) ).
fof(f27,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f2,f17]) ).
fof(f17,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21_2) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
fof(f467,plain,
least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(multiply(identity,inverse(a)),multiply(a,inverse(a))))) != least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(inverse(a),identity))),
inference(backward_demodulation,[],[f111,f433]) ).
fof(f433,plain,
! [X14,X15,X13] : inverse(greatest_lower_bound(multiply(X13,inverse(X15)),multiply(X14,inverse(X15)))) = multiply(X15,inverse(greatest_lower_bound(X13,X14))),
inference(superposition,[],[f43,f15]) ).
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(f43,plain,
! [X2,X1] : multiply(X1,inverse(X2)) = inverse(multiply(X2,inverse(X1))),
inference(superposition,[],[f18,f17]) ).
fof(f18,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21_3) ).
fof(f111,plain,
least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(inverse(a),identity))) != least_upper_bound(inverse(greatest_lower_bound(identity,a)),multiply(a,inverse(greatest_lower_bound(identity,a)))),
inference(superposition,[],[f74,f5]) ).
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(f74,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))) != least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(inverse(a),identity))),
inference(forward_demodulation,[],[f73,f67]) ).
fof(f67,plain,
! [X0] : inverse(X0) = multiply(inverse(X0),identity),
inference(forward_demodulation,[],[f45,f1]) ).
fof(f45,plain,
! [X0] : multiply(inverse(X0),identity) = inverse(multiply(identity,X0)),
inference(superposition,[],[f18,f16]) ).
fof(f16,axiom,
identity = inverse(identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21_1) ).
fof(f73,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))) != least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(multiply(inverse(a),identity),identity))),
inference(forward_demodulation,[],[f72,f2]) ).
fof(f72,plain,
least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(greatest_lower_bound(multiply(inverse(a),identity),multiply(inverse(a),a)))) != least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))),
inference(forward_demodulation,[],[f71,f13]) ).
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(f71,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))) != least_upper_bound(inverse(greatest_lower_bound(identity,a)),inverse(multiply(inverse(a),greatest_lower_bound(identity,a)))),
inference(backward_demodulation,[],[f62,f46]) ).
fof(f46,plain,
! [X2,X1] : inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(superposition,[],[f18,f17]) ).
fof(f62,plain,
least_upper_bound(inverse(greatest_lower_bound(identity,a)),multiply(inverse(greatest_lower_bound(identity,a)),a)) != least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))),
inference(forward_demodulation,[],[f61,f1]) ).
fof(f61,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))) != least_upper_bound(inverse(greatest_lower_bound(multiply(identity,identity),a)),multiply(inverse(greatest_lower_bound(identity,a)),a)),
inference(forward_demodulation,[],[f60,f1]) ).
fof(f60,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))) != least_upper_bound(inverse(greatest_lower_bound(multiply(identity,identity),multiply(identity,a))),multiply(inverse(greatest_lower_bound(identity,a)),a)),
inference(forward_demodulation,[],[f59,f16]) ).
fof(f59,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))) != least_upper_bound(inverse(greatest_lower_bound(multiply(inverse(identity),identity),multiply(inverse(identity),a))),multiply(inverse(greatest_lower_bound(identity,a)),a)),
inference(forward_demodulation,[],[f58,f13]) ).
fof(f58,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))) != least_upper_bound(inverse(multiply(inverse(identity),greatest_lower_bound(identity,a))),multiply(inverse(greatest_lower_bound(identity,a)),a)),
inference(forward_demodulation,[],[f57,f17]) ).
fof(f57,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))) != least_upper_bound(inverse(multiply(inverse(identity),inverse(inverse(greatest_lower_bound(identity,a))))),multiply(inverse(greatest_lower_bound(identity,a)),a)),
inference(backward_demodulation,[],[f24,f52]) ).
fof(f52,plain,
! [X4,X5] : inverse(multiply(inverse(X5),inverse(X4))) = multiply(X4,X5),
inference(superposition,[],[f17,f18]) ).
fof(f24,plain,
least_upper_bound(multiply(inverse(greatest_lower_bound(identity,a)),identity),multiply(inverse(greatest_lower_bound(identity,a)),a)) != least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),inverse(greatest_lower_bound(identity,a))),
inference(backward_demodulation,[],[f23,f1]) ).
fof(f23,plain,
least_upper_bound(multiply(inverse(greatest_lower_bound(identity,a)),identity),multiply(inverse(greatest_lower_bound(identity,a)),a)) != least_upper_bound(multiply(a,inverse(greatest_lower_bound(identity,a))),multiply(identity,inverse(greatest_lower_bound(identity,a)))),
inference(backward_demodulation,[],[f22,f4]) ).
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(f22,plain,
least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),identity),multiply(inverse(greatest_lower_bound(a,identity)),a)) != least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),multiply(identity,inverse(greatest_lower_bound(a,identity)))),
inference(backward_demodulation,[],[f21,f5]) ).
fof(f21,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),multiply(identity,inverse(greatest_lower_bound(a,identity)))) != least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),multiply(inverse(greatest_lower_bound(a,identity)),identity)),
inference(backward_demodulation,[],[f20,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/sandbox2/benchmark/theBenchmark.p',monotony_lub1) ).
fof(f20,plain,
multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)) != least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),multiply(identity,inverse(greatest_lower_bound(a,identity)))),
inference(forward_demodulation,[],[f19,f14]) ).
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(f19,axiom,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p21) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP184-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 29 22:21:06 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.48 % (11239)lrs+1_3:1_ep=RSTC:sos=on:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.49 % (11246)lrs+10_1:128_plsq=on:plsqc=2:s2a=on:ss=axioms:st=1.5:urr=on:i=321:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/321Mi)
% 0.21/0.49 % (11237)lrs+10_1:1_br=off:ep=RSTC:sos=all:urr=on:i=20:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/20Mi)
% 0.21/0.49 % (11261)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.50 % (11253)dis+11_1:64_fd=off:nm=0:nwc=5.0:i=481:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/481Mi)
% 0.21/0.50 % (11255)dis+21_1:8_aac=none:bs=unit_only:er=filter:fd=off:nwc=5.0:s2pl=no:i=111:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/111Mi)
% 0.21/0.50 % (11249)lrs+10_1:1_br=off:flr=on:slsq=on:slsqc=1:sp=frequency:urr=on:i=257:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/257Mi)
% 0.21/0.51 % (11241)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/46Mi)
% 0.21/0.51 % (11232)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99788:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99788Mi)
% 0.21/0.51 % (11236)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.51 % (11233)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=10:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/10Mi)
% 0.21/0.51 % (11260)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=381:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/381Mi)
% 0.21/0.51 % (11247)dis+10_1:7_drc=off:fd=preordered:plsq=on:sp=reverse_frequency:to=lpo:i=212:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/212Mi)
% 0.21/0.52 % (11251)lrs+10_1:128_bd=off:drc=off:fd=preordered:nwc=1.6:urr=on:i=103:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/103Mi)
% 0.21/0.52 % (11254)lrs+10_5:1_br=off:ep=RSTC:sos=all:urr=on:i=267:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/267Mi)
% 0.21/0.52 % (11235)lrs+10_1:1_amm=off:drc=off:sp=reverse_frequency:spb=goal_then_units:to=lpo:i=6:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.21/0.52 % (11256)dis+10_1:1_av=off:drc=off:slsq=on:slsqc=1:slsqr=29,16:sp=reverse_frequency:to=lpo:i=248:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/248Mi)
% 0.21/0.52 % (11233)Instruction limit reached!
% 0.21/0.52 % (11233)------------------------------
% 0.21/0.52 % (11233)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (11233)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (11233)Termination reason: Unknown
% 0.21/0.52 % (11233)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (11233)Memory used [KB]: 5756
% 0.21/0.52 % (11233)Time elapsed: 0.092 s
% 0.21/0.52 % (11233)Instructions burned: 10 (million)
% 0.21/0.52 % (11233)------------------------------
% 0.21/0.52 % (11233)------------------------------
% 0.21/0.52 % (11240)dis+31_8:1_br=off:fd=off:gs=on:lcm=reverse:nm=16:nwc=5.0:sp=reverse_arity:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.52 % (11237)Instruction limit reached!
% 0.21/0.52 % (11237)------------------------------
% 0.21/0.52 % (11237)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (11237)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (11237)Termination reason: Unknown
% 0.21/0.52 % (11237)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (11237)Memory used [KB]: 6012
% 0.21/0.52 % (11237)Time elapsed: 0.105 s
% 0.21/0.52 % (11237)Instructions burned: 20 (million)
% 0.21/0.52 % (11237)------------------------------
% 0.21/0.52 % (11237)------------------------------
% 0.21/0.52 % (11238)lrs+10_1:1_avsq=on:avsql=on:bsr=unit_only:drc=off:fsr=off:inw=on:nwc=10.0:rnwc=on:sgt=16:slsq=on:slsqc=0:slsql=off:slsqr=211,119:sp=reverse_frequency:spb=goal_then_units:ss=included:st=2.0:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.52 % (11248)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.52 % (11235)Instruction limit reached!
% 0.21/0.52 % (11235)------------------------------
% 0.21/0.52 % (11235)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (11235)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (11235)Termination reason: Unknown
% 0.21/0.52 % (11235)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (11235)Memory used [KB]: 5628
% 0.21/0.52 % (11235)Time elapsed: 0.120 s
% 0.21/0.52 % (11235)Instructions burned: 8 (million)
% 0.21/0.52 % (11235)------------------------------
% 0.21/0.52 % (11235)------------------------------
% 0.21/0.53 % (11245)dis+2_1:1024_abs=on:alpa=false:anc=all_dependent:avsq=on:bce=on:drc=off:newcnf=on:slsq=on:slsqc=0:slsqr=1,1:sp=reverse_arity:i=353:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/353Mi)
% 0.21/0.53 % (11234)lrs+1004_1:734_av=off:awrs=converge:awrsf=70:br=off:ep=RSTC:erd=off:gs=on:nwc=3.0:s2a=on:s2agt=16:sp=occurrence:updr=off:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.53 % (11238)Instruction limit reached!
% 0.21/0.53 % (11238)------------------------------
% 0.21/0.53 % (11238)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (11238)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (11238)Termination reason: Unknown
% 0.21/0.53 % (11238)Termination phase: Saturation
% 0.21/0.53
% 0.21/0.53 % (11238)Memory used [KB]: 5628
% 0.21/0.53 % (11238)Time elapsed: 0.132 s
% 0.21/0.53 % (11238)Instructions burned: 8 (million)
% 0.21/0.53 % (11238)------------------------------
% 0.21/0.53 % (11238)------------------------------
% 0.21/0.53 % (11259)lrs+10_1:128_awrs=converge:awrsf=8:bd=off:drc=off:slsq=on:slsqc=1:slsql=off:slsqr=40,29:i=495:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/495Mi)
% 0.21/0.53 % (11250)lrs+1011_1:1_asg=cautious:bsr=on:cond=on:drc=off:etr=on:fd=preordered:gs=on:plsq=on:plsqr=388,511:slsq=on:slsqc=1:slsqr=21,31:urr=on:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.53 % (11242)lrs+1004_1:734_av=off:awrs=converge:awrsf=70:br=off:ep=RSTC:erd=off:gs=on:nwc=3.0:s2a=on:s2agt=16:sp=occurrence:updr=off:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.54 % (11258)dis+10_1:1024_av=off:bd=preordered:drc=off:nwc=3.0:rp=on:thsq=on:thsqc=64:thsqd=32:to=lpo:i=267:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/267Mi)
% 0.21/0.54 % (11257)lrs+10_1:2_bd=preordered:drc=off:fd=preordered:fde=unused:sp=const_min:to=lpo:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.21/0.54 % (11236)First to succeed.
% 0.21/0.54 % (11244)dis+10_1:1024_anc=all:drc=off:flr=on:fsr=off:sac=on:urr=on:i=292:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/292Mi)
% 1.51/0.54 % (11252)lrs+10_1:1024_drc=off:i=388:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/388Mi)
% 1.51/0.54 % (11243)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.51/0.55 % (11239)Instruction limit reached!
% 1.51/0.55 % (11239)------------------------------
% 1.51/0.55 % (11239)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.56 % (11239)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.56 % (11239)Termination reason: Unknown
% 1.51/0.56 % (11239)Termination phase: Saturation
% 1.51/0.56
% 1.51/0.56 % (11239)Memory used [KB]: 6396
% 1.51/0.56 % (11239)Time elapsed: 0.148 s
% 1.51/0.56 % (11239)Instructions burned: 34 (million)
% 1.51/0.56 % (11239)------------------------------
% 1.51/0.56 % (11239)------------------------------
% 1.60/0.56 % (11261)Instruction limit reached!
% 1.60/0.56 % (11261)------------------------------
% 1.60/0.56 % (11261)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.60/0.56 % (11236)Refutation found. Thanks to Tanya!
% 1.60/0.56 % SZS status Unsatisfiable for theBenchmark
% 1.60/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.60/0.56 % (11236)------------------------------
% 1.60/0.56 % (11236)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.60/0.56 % (11236)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.60/0.56 % (11236)Termination reason: Refutation
% 1.60/0.56
% 1.60/0.56 % (11236)Memory used [KB]: 5884
% 1.60/0.56 % (11236)Time elapsed: 0.145 s
% 1.60/0.56 % (11236)Instructions burned: 20 (million)
% 1.60/0.56 % (11236)------------------------------
% 1.60/0.56 % (11236)------------------------------
% 1.60/0.56 % (11231)Success in time 0.209 s
%------------------------------------------------------------------------------