TSTP Solution File: GRP183-4 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : GRP183-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% 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 : Mon Jun 24 07:16:14 EDT 2024
% Result : Unsatisfiable 2.42s 0.77s
% Output : Refutation 2.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 21
% Syntax : Number of formulae : 122 ( 122 unt; 0 def)
% Number of atoms : 122 ( 121 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 82 ( 82 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13220,plain,
$false,
inference(subsumption_resolution,[],[f13219,f24]) ).
fof(f24,plain,
identity != sF3,
inference(definition_folding,[],[f19,f23,f22,f21,f20]) ).
fof(f20,plain,
least_upper_bound(a,identity) = sF0,
introduced(function_definition,[new_symbols(definition,[sF0])]) ).
fof(f21,plain,
inverse(a) = sF1,
introduced(function_definition,[new_symbols(definition,[sF1])]) ).
fof(f22,plain,
least_upper_bound(sF1,identity) = sF2,
introduced(function_definition,[new_symbols(definition,[sF2])]) ).
fof(f23,plain,
greatest_lower_bound(sF0,sF2) = sF3,
introduced(function_definition,[new_symbols(definition,[sF3])]) ).
fof(f19,axiom,
identity != greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f13219,plain,
identity = sF3,
inference(forward_demodulation,[],[f13181,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f13181,plain,
sF3 = multiply(inverse(sF0),sF0),
inference(backward_demodulation,[],[f3671,f13178]) ).
fof(f13178,plain,
greatest_lower_bound(identity,sF1) = inverse(sF0),
inference(backward_demodulation,[],[f4926,f13121]) ).
fof(f13121,plain,
inverse(sF0) = multiply(inverse(sF0),sF3),
inference(backward_demodulation,[],[f5150,f13118]) ).
fof(f13118,plain,
sF0 = multiply(sF0,sF3),
inference(forward_demodulation,[],[f13117,f3608]) ).
fof(f3608,plain,
sF0 = multiply(a,sF2),
inference(forward_demodulation,[],[f3607,f26]) ).
fof(f26,plain,
sF0 = least_upper_bound(identity,a),
inference(backward_demodulation,[],[f20,f5]) ).
fof(f5,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f3607,plain,
least_upper_bound(identity,a) = multiply(a,sF2),
inference(forward_demodulation,[],[f3606,f28]) ).
fof(f28,plain,
a = inverse(sF1),
inference(superposition,[],[f17,f21]) ).
fof(f17,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f3606,plain,
multiply(inverse(sF1),sF2) = least_upper_bound(identity,inverse(sF1)),
inference(forward_demodulation,[],[f3605,f100]) ).
fof(f100,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f93,f17]) ).
fof(f93,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f17,f65]) ).
fof(f65,plain,
! [X0] : inverse(X0) = inverse(multiply(X0,identity)),
inference(forward_demodulation,[],[f53,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f53,plain,
! [X0] : inverse(multiply(X0,identity)) = multiply(identity,inverse(X0)),
inference(superposition,[],[f18,f16]) ).
fof(f16,axiom,
identity = inverse(identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f18,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f3605,plain,
multiply(inverse(sF1),sF2) = multiply(least_upper_bound(identity,inverse(sF1)),identity),
inference(forward_demodulation,[],[f3495,f239]) ).
fof(f239,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',unknown) ).
fof(f3495,plain,
multiply(inverse(sF1),sF2) = least_upper_bound(identity,multiply(inverse(sF1),identity)),
inference(superposition,[],[f188,f25]) ).
fof(f25,plain,
sF2 = least_upper_bound(identity,sF1),
inference(backward_demodulation,[],[f22,f5]) ).
fof(f188,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f168,f5]) ).
fof(f168,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f12,f2]) ).
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',unknown) ).
fof(f13117,plain,
multiply(sF0,sF3) = multiply(a,sF2),
inference(forward_demodulation,[],[f13116,f6040]) ).
fof(f6040,plain,
sF3 = least_upper_bound(identity,sF3),
inference(forward_demodulation,[],[f6029,f5]) ).
fof(f6029,plain,
sF3 = least_upper_bound(sF3,identity),
inference(superposition,[],[f41,f5994]) ).
fof(f5994,plain,
identity = greatest_lower_bound(identity,sF3),
inference(forward_demodulation,[],[f5963,f48]) ).
fof(f48,plain,
identity = greatest_lower_bound(identity,sF2),
inference(superposition,[],[f11,f25]) ).
fof(f11,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f5963,plain,
greatest_lower_bound(identity,sF2) = greatest_lower_bound(identity,sF3),
inference(superposition,[],[f106,f23]) ).
fof(f106,plain,
! [X0] : greatest_lower_bound(identity,X0) = greatest_lower_bound(identity,greatest_lower_bound(sF0,X0)),
inference(superposition,[],[f6,f49]) ).
fof(f49,plain,
identity = greatest_lower_bound(identity,sF0),
inference(superposition,[],[f11,f26]) ).
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',unknown) ).
fof(f41,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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f10,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f13116,plain,
multiply(a,sF2) = multiply(sF0,least_upper_bound(identity,sF3)),
inference(forward_demodulation,[],[f13115,f162]) ).
fof(f162,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f12,f100]) ).
fof(f13115,plain,
multiply(a,sF2) = least_upper_bound(sF0,multiply(sF0,sF3)),
inference(forward_demodulation,[],[f13114,f151]) ).
fof(f151,plain,
sF2 = least_upper_bound(sF2,sF3),
inference(superposition,[],[f41,f23]) ).
fof(f13114,plain,
least_upper_bound(sF0,multiply(sF0,sF3)) = multiply(a,least_upper_bound(sF2,sF3)),
inference(forward_demodulation,[],[f13113,f3832]) ).
fof(f3832,plain,
! [X0] : multiply(a,least_upper_bound(sF2,X0)) = least_upper_bound(sF0,multiply(a,X0)),
inference(superposition,[],[f12,f3608]) ).
fof(f13113,plain,
least_upper_bound(sF0,multiply(sF0,sF3)) = least_upper_bound(sF0,multiply(a,sF3)),
inference(forward_demodulation,[],[f13057,f5]) ).
fof(f13057,plain,
least_upper_bound(sF0,multiply(sF0,sF3)) = least_upper_bound(multiply(a,sF3),sF0),
inference(superposition,[],[f1363,f1433]) ).
fof(f1433,plain,
! [X0] : least_upper_bound(X0,multiply(a,X0)) = multiply(sF0,X0),
inference(superposition,[],[f239,f26]) ).
fof(f1363,plain,
! [X0] : least_upper_bound(sF0,least_upper_bound(sF3,X0)) = least_upper_bound(X0,sF0),
inference(forward_demodulation,[],[f1257,f134]) ).
fof(f134,plain,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X0,X1)),
inference(superposition,[],[f7,f5]) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f1257,plain,
! [X0] : least_upper_bound(X0,sF0) = least_upper_bound(sF3,least_upper_bound(X0,sF0)),
inference(superposition,[],[f134,f43]) ).
fof(f43,plain,
sF0 = least_upper_bound(sF0,sF3),
inference(superposition,[],[f10,f23]) ).
fof(f5150,plain,
inverse(sF0) = multiply(inverse(multiply(sF0,sF3)),sF3),
inference(superposition,[],[f58,f5054]) ).
fof(f5054,plain,
sF0 = multiply(inverse(sF3),multiply(sF0,sF3)),
inference(forward_demodulation,[],[f5044,f3]) ).
fof(f3,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f5044,plain,
sF0 = multiply(multiply(inverse(sF3),sF0),sF3),
inference(backward_demodulation,[],[f3877,f5027]) ).
fof(f5027,plain,
multiply(inverse(sF3),sF0) = inverse(greatest_lower_bound(identity,sF1)),
inference(superposition,[],[f58,f4926]) ).
fof(f3877,plain,
sF0 = multiply(inverse(greatest_lower_bound(identity,sF1)),sF3),
inference(superposition,[],[f81,f3671]) ).
fof(f81,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f73,f1]) ).
fof(f73,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f3,f2]) ).
fof(f58,plain,
! [X0,X1] : inverse(multiply(inverse(X0),X1)) = multiply(inverse(X1),X0),
inference(superposition,[],[f18,f17]) ).
fof(f4926,plain,
greatest_lower_bound(identity,sF1) = multiply(inverse(sF0),sF3),
inference(backward_demodulation,[],[f3695,f4921]) ).
fof(f4921,plain,
sF1 = multiply(inverse(sF0),sF2),
inference(forward_demodulation,[],[f4903,f21]) ).
fof(f4903,plain,
inverse(a) = multiply(inverse(sF0),sF2),
inference(superposition,[],[f58,f4871]) ).
fof(f4871,plain,
a = multiply(inverse(sF2),sF0),
inference(superposition,[],[f81,f4854]) ).
fof(f4854,plain,
sF0 = multiply(sF2,a),
inference(backward_demodulation,[],[f4802,f4853]) ).
fof(f4853,plain,
sF0 = least_upper_bound(identity,multiply(sF2,a)),
inference(forward_demodulation,[],[f4852,f100]) ).
fof(f4852,plain,
multiply(sF0,identity) = least_upper_bound(identity,multiply(sF2,a)),
inference(forward_demodulation,[],[f4851,f1504]) ).
fof(f1504,plain,
! [X0] : multiply(sF0,X0) = multiply(sF2,multiply(a,X0)),
inference(forward_demodulation,[],[f1503,f1433]) ).
fof(f1503,plain,
! [X0] : least_upper_bound(X0,multiply(a,X0)) = multiply(sF2,multiply(a,X0)),
inference(forward_demodulation,[],[f1502,f25]) ).
fof(f1502,plain,
! [X0] : least_upper_bound(X0,multiply(a,X0)) = multiply(least_upper_bound(identity,sF1),multiply(a,X0)),
inference(forward_demodulation,[],[f1453,f5]) ).
fof(f1453,plain,
! [X0] : multiply(least_upper_bound(identity,sF1),multiply(a,X0)) = least_upper_bound(multiply(a,X0),X0),
inference(superposition,[],[f239,f85]) ).
fof(f85,plain,
! [X0] : multiply(sF1,multiply(a,X0)) = X0,
inference(forward_demodulation,[],[f77,f1]) ).
fof(f77,plain,
! [X0] : multiply(identity,X0) = multiply(sF1,multiply(a,X0)),
inference(superposition,[],[f3,f32]) ).
fof(f32,plain,
identity = multiply(sF1,a),
inference(superposition,[],[f2,f21]) ).
fof(f4851,plain,
least_upper_bound(identity,multiply(sF2,a)) = multiply(sF2,multiply(a,identity)),
inference(forward_demodulation,[],[f4850,f3]) ).
fof(f4850,plain,
least_upper_bound(identity,multiply(sF2,a)) = multiply(multiply(sF2,a),identity),
inference(forward_demodulation,[],[f4849,f17]) ).
fof(f4849,plain,
multiply(inverse(inverse(multiply(sF2,a))),identity) = least_upper_bound(identity,inverse(inverse(multiply(sF2,a)))),
inference(forward_demodulation,[],[f4848,f100]) ).
fof(f4848,plain,
multiply(inverse(inverse(multiply(sF2,a))),identity) = multiply(least_upper_bound(identity,inverse(inverse(multiply(sF2,a)))),identity),
inference(forward_demodulation,[],[f4837,f239]) ).
fof(f4837,plain,
multiply(inverse(inverse(multiply(sF2,a))),identity) = least_upper_bound(identity,multiply(inverse(inverse(multiply(sF2,a))),identity)),
inference(superposition,[],[f188,f4799]) ).
fof(f4799,plain,
identity = least_upper_bound(identity,inverse(multiply(sF2,a))),
inference(forward_demodulation,[],[f4798,f2]) ).
fof(f4798,plain,
multiply(inverse(a),a) = least_upper_bound(identity,inverse(multiply(sF2,a))),
inference(forward_demodulation,[],[f4789,f18]) ).
fof(f4789,plain,
multiply(inverse(a),a) = least_upper_bound(identity,multiply(inverse(a),inverse(sF2))),
inference(superposition,[],[f160,f4758]) ).
fof(f4758,plain,
a = least_upper_bound(a,inverse(sF2)),
inference(forward_demodulation,[],[f4722,f3602]) ).
fof(f3602,plain,
sF2 = multiply(sF1,sF0),
inference(forward_demodulation,[],[f3601,f25]) ).
fof(f3601,plain,
least_upper_bound(identity,sF1) = multiply(sF1,sF0),
inference(forward_demodulation,[],[f3600,f21]) ).
fof(f3600,plain,
multiply(inverse(a),sF0) = least_upper_bound(identity,inverse(a)),
inference(forward_demodulation,[],[f3599,f100]) ).
fof(f3599,plain,
multiply(inverse(a),sF0) = multiply(least_upper_bound(identity,inverse(a)),identity),
inference(forward_demodulation,[],[f3493,f239]) ).
fof(f3493,plain,
multiply(inverse(a),sF0) = least_upper_bound(identity,multiply(inverse(a),identity)),
inference(superposition,[],[f188,f26]) ).
fof(f4722,plain,
a = least_upper_bound(a,inverse(multiply(sF1,sF0))),
inference(superposition,[],[f2485,f60]) ).
fof(f60,plain,
! [X0] : inverse(multiply(sF1,X0)) = multiply(inverse(X0),a),
inference(superposition,[],[f18,f28]) ).
fof(f2485,plain,
! [X0] : least_upper_bound(X0,multiply(inverse(sF0),X0)) = X0,
inference(forward_demodulation,[],[f2475,f1]) ).
fof(f2475,plain,
! [X0] : multiply(identity,X0) = least_upper_bound(X0,multiply(inverse(sF0),X0)),
inference(superposition,[],[f239,f2327]) ).
fof(f2327,plain,
identity = least_upper_bound(identity,inverse(sF0)),
inference(superposition,[],[f10,f1943]) ).
fof(f1943,plain,
inverse(sF0) = greatest_lower_bound(identity,inverse(sF0)),
inference(forward_demodulation,[],[f1918,f4]) ).
fof(f1918,plain,
inverse(sF0) = greatest_lower_bound(inverse(sF0),identity),
inference(superposition,[],[f1725,f31]) ).
fof(f31,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f2,f17]) ).
fof(f1725,plain,
! [X0] : greatest_lower_bound(X0,multiply(sF0,X0)) = X0,
inference(forward_demodulation,[],[f1664,f1]) ).
fof(f1664,plain,
! [X0] : multiply(identity,X0) = greatest_lower_bound(X0,multiply(sF0,X0)),
inference(superposition,[],[f276,f49]) ).
fof(f276,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',unknown) ).
fof(f160,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f12,f2]) ).
fof(f4802,plain,
multiply(sF2,a) = least_upper_bound(identity,multiply(sF2,a)),
inference(forward_demodulation,[],[f4801,f28]) ).
fof(f4801,plain,
multiply(sF2,inverse(sF1)) = least_upper_bound(identity,multiply(sF2,inverse(sF1))),
inference(forward_demodulation,[],[f4800,f54]) ).
fof(f54,plain,
! [X0,X1] : inverse(multiply(X1,inverse(X0))) = multiply(X0,inverse(X1)),
inference(superposition,[],[f18,f17]) ).
fof(f4800,plain,
inverse(multiply(sF1,inverse(sF2))) = least_upper_bound(identity,inverse(multiply(sF1,inverse(sF2)))),
inference(forward_demodulation,[],[f4790,f60]) ).
fof(f4790,plain,
multiply(inverse(inverse(sF2)),a) = least_upper_bound(identity,multiply(inverse(inverse(sF2)),a)),
inference(superposition,[],[f188,f4758]) ).
fof(f3695,plain,
multiply(inverse(sF0),sF3) = greatest_lower_bound(identity,multiply(inverse(sF0),sF2)),
inference(superposition,[],[f199,f23]) ).
fof(f199,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f13,f2]) ).
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',unknown) ).
fof(f3671,plain,
sF3 = multiply(greatest_lower_bound(identity,sF1),sF0),
inference(forward_demodulation,[],[f3660,f23]) ).
fof(f3660,plain,
greatest_lower_bound(sF0,sF2) = multiply(greatest_lower_bound(identity,sF1),sF0),
inference(superposition,[],[f276,f3602]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP183-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 11:32:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.35 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.12/0.35 Running first-order theorem proving
% 0.12/0.35 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.42 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (13977)ott+10_2:5_bsr=unit_only:to=lpo:drc=encompass:sil=256000:sp=reverse_frequency:i=150:ins=1:dpc=on:rawr=on_0 on theBenchmark for (3000ds/150Mi)
% 0.20/0.42 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (13976)lrs+10_3:4_to=lpo:drc=encompass:sil=4000:sp=reverse_frequency:i=126:ss=axioms:sgt=16:s2a=on:s2at=3.0:irc=lazy:bd=off_0 on theBenchmark for (3000ds/126Mi)
% 0.20/0.42 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (13978)lrs+10_1:8_drc=encompass:sil=16000:tgt=ground:i=123:bd=preordered:ss=axioms_0 on theBenchmark for (3000ds/123Mi)
% 0.20/0.42 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (13979)lrs+10_1:1_drc=encompass:sil=4000:i=209:ss=axioms:sgt=8:sp=occurrence_0 on theBenchmark for (3000ds/209Mi)
% 0.20/0.42 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (13975)lrs+10_1:64_drc=encompass:sil=2000:i=105:plsq=on:ss=axioms_0 on theBenchmark for (3000ds/105Mi)
% 0.20/0.42 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (13974)dis+10_5:2_drc=encompass:sil=256000:tgt=ground:sp=reverse_frequency:sos=all:i=207332:bd=off:fsr=off:dpc=on_0 on theBenchmark for (3000ds/207332Mi)
% 0.20/0.42 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (13973)lrs+10_1:12_drc=encompass:sil=256000:tgt=full:spb=intro:i=116130:kws=precedence:awrs=converge:awrsf=500:irc=lazy_0 on theBenchmark for (3000ds/116130Mi)
% 0.20/0.47 % (13975)Instruction limit reached!
% 0.20/0.47 % (13975)------------------------------
% 0.20/0.47 % (13975)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.47 % (13975)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.47 % (13975)Termination reason: Time limit
% 0.20/0.47 % (13975)Termination phase: Saturation
% 0.20/0.47
% 0.20/0.47 % (13975)Memory used [KB]: 1496
% 0.20/0.47 % (13975)Time elapsed: 0.057 s
% 0.20/0.47 % (13975)Instructions burned: 105 (million)
% 0.20/0.48 % (13977)Instruction limit reached!
% 0.20/0.48 % (13977)------------------------------
% 0.20/0.48 % (13977)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.48 % (13977)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.48 % (13977)Termination reason: Time limit
% 0.20/0.48 % (13977)Termination phase: Saturation
% 0.20/0.48
% 0.20/0.48 % (13977)Memory used [KB]: 2237
% 0.20/0.48 % (13977)Time elapsed: 0.066 s
% 0.20/0.48 % (13977)Instructions burned: 152 (million)
% 0.20/0.48 % (13976)Instruction limit reached!
% 0.20/0.48 % (13976)------------------------------
% 0.20/0.48 % (13976)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.48 % (13976)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.48 % (13976)Termination reason: Time limit
% 0.20/0.48 % (13976)Termination phase: Saturation
% 0.20/0.48
% 0.20/0.48 % (13976)Memory used [KB]: 1969
% 0.20/0.48 % (13976)Time elapsed: 0.067 s
% 0.20/0.48 % (13976)Instructions burned: 128 (million)
% 0.20/0.48 % (13978)Instruction limit reached!
% 0.20/0.48 % (13978)------------------------------
% 0.20/0.48 % (13978)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.48 % (13978)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.48 % (13978)Termination reason: Time limit
% 0.20/0.48 % (13978)Termination phase: Saturation
% 0.20/0.48
% 0.20/0.48 % (13978)Memory used [KB]: 2198
% 0.20/0.48 % (13978)Time elapsed: 0.069 s
% 0.20/0.48 % (13978)Instructions burned: 125 (million)
% 0.20/0.50 % (13979)Instruction limit reached!
% 0.20/0.50 % (13979)------------------------------
% 0.20/0.50 % (13979)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.50 % (13979)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.50 % (13979)Termination reason: Time limit
% 0.20/0.50 % (13979)Termination phase: Saturation
% 0.20/0.50
% 0.20/0.50 % (13979)Memory used [KB]: 2725
% 0.20/0.50 % (13979)Time elapsed: 0.089 s
% 0.20/0.50 % (13979)Instructions burned: 209 (million)
% 0.20/0.51 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.51 % (13980)lrs+10_1:4_drc=encompass:sil=16000:tgt=ground:lwlo=on:s2a=on:i=192:s2at=2.0_0 on theBenchmark for (2998ds/192Mi)
% 0.20/0.51 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.51 % (13981)lrs+10_1:7_drc=encompass:sil=64000:tgt=full:spb=non_intro:i=454:awrs=converge:awrsf=67:sp=reverse_frequency:nwc=1.5_0 on theBenchmark for (2998ds/454Mi)
% 0.20/0.52 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.52 % (13982)lrs+10_1:2_sil=2000:tgt=ground:spb=goal:i=359:kws=precedence:irc=eager_0 on theBenchmark for (2998ds/359Mi)
% 0.20/0.52 % (13972)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.52 % (13983)lrs+10_1:1_sil=4000:sp=occurrence:i=163:ss=axioms:st=3.0:sd=2_0 on theBenchmark for (2998ds/163Mi)
% 1.36/0.54 % (13972)Running in auto input_syntax mode. Trying TPTP
% 1.36/0.54 % (13984)lrs+10_1:1024_drc=encompass:sil=4000:tgt=full:i=1030:kws=inv_frequency:awrs=converge_0 on theBenchmark for (2998ds/1030Mi)
% 1.36/0.57 % (13980)Instruction limit reached!
% 1.36/0.57 % (13980)------------------------------
% 1.36/0.57 % (13980)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.36/0.57 % (13980)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.36/0.57 % (13980)Termination reason: Time limit
% 1.36/0.57 % (13980)Termination phase: Saturation
% 1.36/0.57
% 1.36/0.57 % (13980)Memory used [KB]: 2658
% 1.36/0.57 % (13980)Time elapsed: 0.067 s
% 1.36/0.57 % (13980)Instructions burned: 194 (million)
% 1.36/0.57 % (13983)Instruction limit reached!
% 1.36/0.57 % (13983)------------------------------
% 1.36/0.57 % (13983)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.36/0.57 % (13983)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.36/0.57 % (13983)Termination reason: Time limit
% 1.36/0.57 % (13983)Termination phase: Saturation
% 1.36/0.57
% 1.36/0.57 % (13983)Memory used [KB]: 2559
% 1.36/0.57 % (13983)Time elapsed: 0.059 s
% 1.36/0.57 % (13983)Instructions burned: 163 (million)
% 1.36/0.61 % (13972)Running in auto input_syntax mode. Trying TPTP
% 1.36/0.61 % (13985)lrs+10_3:1_sil=4000:tgt=ground:i=631:kws=frequency:bd=off:drc=encompass:irc=lazy_0 on theBenchmark for (2997ds/631Mi)
% 1.36/0.61 % (13972)Running in auto input_syntax mode. Trying TPTP
% 1.36/0.61 % (13986)lrs+10_1:3_to=lpo:drc=encompass:sil=4000:tgt=full:i=901:rawr=on:ins=4:bd=off:fd=preordered_0 on theBenchmark for (2997ds/901Mi)
% 1.89/0.65 % (13982)Instruction limit reached!
% 1.89/0.65 % (13982)------------------------------
% 1.89/0.65 % (13982)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.89/0.65 % (13982)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.89/0.65 % (13982)Termination reason: Time limit
% 1.89/0.65 % (13982)Termination phase: Saturation
% 1.89/0.65
% 1.89/0.65 % (13982)Memory used [KB]: 5154
% 1.89/0.65 % (13982)Time elapsed: 0.133 s
% 1.89/0.65 % (13982)Instructions burned: 360 (million)
% 1.89/0.68 % (13981)Instruction limit reached!
% 1.89/0.68 % (13981)------------------------------
% 1.89/0.68 % (13981)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.89/0.68 % (13981)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.89/0.68 % (13981)Termination reason: Time limit
% 1.89/0.68 % (13981)Termination phase: Saturation
% 1.89/0.68
% 1.89/0.68 % (13981)Memory used [KB]: 5669
% 1.89/0.68 % (13981)Time elapsed: 0.163 s
% 1.89/0.68 % (13981)Instructions burned: 454 (million)
% 1.89/0.68 % (13972)Running in auto input_syntax mode. Trying TPTP
% 1.89/0.68 % (13987)lrs+10_1:24_drc=encompass:sil=256000:tgt=full:sp=unary_frequency:spb=non_intro:i=312:ins=2:fsr=off:kws=precedence:irc=eager:bsr=unit_only:br=off:ss=included:sgt=16:bd=preordered_0 on theBenchmark for (2997ds/312Mi)
% 2.15/0.71 % (13972)Running in auto input_syntax mode. Trying TPTP
% 2.15/0.71 % (13988)lrs+10_1:1_drc=encompass:sil=2000:slsq=on:s2a=on:i=1363:s2at=7.0_0 on theBenchmark for (2996ds/1363Mi)
% 2.38/0.76 % (13984)First to succeed.
% 2.38/0.76 % (13984)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13972"
% 2.42/0.77 % (13972)Running in auto input_syntax mode. Trying TPTP
% 2.42/0.77 % (13984)Refutation found. Thanks to Tanya!
% 2.42/0.77 % SZS status Unsatisfiable for theBenchmark
% 2.42/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 2.42/0.77 % (13984)------------------------------
% 2.42/0.77 % (13984)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 2.42/0.77 % (13984)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 2.42/0.77 % (13984)Termination reason: Refutation
% 2.42/0.77
% 2.42/0.77 % (13984)Memory used [KB]: 5928
% 2.42/0.77 % (13984)Time elapsed: 0.227 s
% 2.42/0.77 % (13984)Instructions burned: 631 (million)
% 2.42/0.77 % (13984)------------------------------
% 2.42/0.77 % (13984)------------------------------
% 2.42/0.77 % (13972)Success in time 0.392 s
%------------------------------------------------------------------------------