%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : FLD007-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 09:48:57 AM UTC 2026
% Result : Unsatisfiable 4.68s 1.39s
% Output : Refutation 5.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 10 unt; 2 def)
% Number of atoms : 206 ( 4 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 298 ( 150 ~; 148 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 112 ( 112 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( equalish(add(X0,add(X1,X2)),add(add(X0,X1),X2))
| ~ defined(X0)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_addition) ).
fof(f2,axiom,
! [X0] :
( equalish(add(additive_identity,X0),X0)
| ~ defined(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_identity_addition) ).
fof(f3,axiom,
! [X0] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_inverse_addition) ).
fof(f4,axiom,
! [X0,X1] :
( equalish(add(X0,X1),add(X1,X0))
| ~ defined(X0)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_addition) ).
fof(f10,axiom,
! [X0,X1] :
( defined(add(X0,X1))
| ~ defined(X0)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',well_definedness_of_addition) ).
fof(f12,axiom,
! [X0] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',well_definedness_of_additive_inverse) ).
fof(f22,axiom,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_equality) ).
fof(f23,axiom,
! [X2,X0,X1] :
( ~ equalish(X2,X1)
| ~ equalish(X0,X2)
| equalish(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_equality) ).
fof(f24,axiom,
! [X2,X0,X1] :
( equalish(add(X0,X1),add(X2,X1))
| ~ defined(X1)
| ~ equalish(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compatibility_of_equality_and_addition) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
fof(f29,negated_conjecture,
~ equalish(additive_inverse(additive_inverse(a)),a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_inverse_not_equal_to_a_2) ).
fof(f30,definition,
sF0 = additive_inverse(a),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f31,plain,
additive_inverse(a) = sF0,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF1 = additive_inverse(sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f33,plain,
additive_inverse(sF0) = sF1,
inference(reorient_equations,[],[f32]) ).
fof(f34,plain,
~ equalish(sF1,a),
inference(definition_folding,[],[f29,f33,f31]) ).
fof(f54,plain,
! [X0,X1] :
( ~ equalish(X1,add(additive_identity,X0))
| ~ defined(X0)
| equalish(X1,X0) ),
inference(resolution,[],[f2,f23]) ).
fof(f71,plain,
! [X0,X1] :
( ~ defined(X0)
| ~ equalish(X1,additive_identity)
| ~ defined(X0)
| equalish(add(X1,X0),X0) ),
inference(resolution,[],[f24,f54]) ).
fof(f74,plain,
! [X0,X1] :
( equalish(add(X1,X0),X0)
| ~ equalish(X1,additive_identity)
| ~ defined(X0) ),
inference(duplicate_literal_removal,[],[f71]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ equalish(X2,add(X0,X1))
| ~ defined(X1)
| ~ equalish(X0,additive_identity)
| equalish(X2,X1) ),
inference(resolution,[],[f74,f23]) ).
fof(f80,plain,
! [X2,X0,X1] :
( ~ defined(X0)
| ~ equalish(add(X1,X2),additive_identity)
| equalish(add(X1,add(X2,X0)),X0)
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X0) ),
inference(resolution,[],[f75,f1]) ).
fof(f84,plain,
! [X2,X0,X1] :
( equalish(add(X1,add(X2,X0)),X0)
| ~ equalish(add(X1,X2),additive_identity)
| ~ defined(X0)
| ~ defined(X1)
| ~ defined(X2) ),
inference(duplicate_literal_removal,[],[f80]) ).
fof(f125,plain,
! [X2,X3,X0,X1] :
( ~ equalish(X3,add(X0,add(X1,X2)))
| ~ defined(X2)
| ~ defined(X0)
| ~ defined(X1)
| ~ equalish(add(X0,X1),additive_identity)
| equalish(X3,X2) ),
inference(resolution,[],[f84,f23]) ).
fof(f129,plain,
! [X2,X0,X1] :
( ~ defined(X0)
| ~ defined(X1)
| ~ defined(X2)
| ~ equalish(add(X1,X2),additive_identity)
| equalish(add(add(X2,X0),X1),X0)
| ~ defined(add(X2,X0))
| ~ defined(X1) ),
inference(resolution,[],[f125,f4]) ).
fof(f138,plain,
! [X2,X0,X1] :
( ~ defined(X0)
| ~ defined(X1)
| ~ defined(X2)
| ~ equalish(add(X1,X2),additive_identity)
| equalish(add(add(X2,X0),X1),X0)
| ~ defined(add(X2,X0)) ),
inference(duplicate_literal_removal,[],[f129]) ).
fof(f141,plain,
! [X2,X0,X1] :
( equalish(add(add(X2,X0),X1),X0)
| ~ defined(X1)
| ~ defined(X2)
| ~ equalish(add(X1,X2),additive_identity)
| ~ defined(X0) ),
inference(forward_subsumption_resolution,[],[f138,f10]) ).
fof(f144,plain,
! [X2,X3,X0,X1] :
( ~ equalish(X3,add(add(X1,X2),X0))
| ~ defined(X1)
| ~ equalish(add(X0,X1),additive_identity)
| ~ defined(X2)
| ~ defined(X0)
| equalish(X3,X2) ),
inference(resolution,[],[f141,f23]) ).
fof(f150,plain,
! [X2,X3,X0,X1] :
( ~ defined(X0)
| ~ equalish(add(X1,X0),additive_identity)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X3,X1),X2)
| ~ defined(X1)
| ~ equalish(X3,add(X0,X2)) ),
inference(resolution,[],[f144,f24]) ).
fof(f161,plain,
! [X2,X3,X0,X1] :
( ~ equalish(add(X1,X0),additive_identity)
| ~ defined(X0)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X3,X1),X2)
| ~ equalish(X3,add(X0,X2)) ),
inference(duplicate_literal_removal,[],[f150]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ defined(additive_inverse(X0))
| ~ defined(X1)
| ~ defined(X0)
| equalish(add(X2,X0),X1)
| ~ equalish(X2,add(additive_inverse(X0),X1))
| ~ defined(X0) ),
inference(resolution,[],[f161,f3]) ).
fof(f176,plain,
! [X2,X0,X1] :
( ~ defined(additive_inverse(X0))
| ~ defined(X1)
| ~ defined(X0)
| equalish(add(X2,X0),X1)
| ~ equalish(X2,add(additive_inverse(X0),X1)) ),
inference(duplicate_literal_removal,[],[f163]) ).
fof(f184,plain,
! [X2,X0,X1] :
( ~ equalish(X2,add(additive_inverse(X0),X1))
| ~ defined(X0)
| equalish(add(X2,X0),X1)
| ~ defined(X1) ),
inference(forward_subsumption_resolution,[],[f176,f12]) ).
fof(f187,plain,
! [X0,X1] :
( ~ defined(X0)
| equalish(add(add(X1,additive_inverse(X0)),X0),X1)
| ~ defined(X1)
| ~ defined(X1)
| ~ defined(additive_inverse(X0)) ),
inference(resolution,[],[f184,f4]) ).
fof(f200,plain,
! [X0,X1] :
( ~ defined(X0)
| equalish(add(add(X1,additive_inverse(X0)),X0),X1)
| ~ defined(X1)
| ~ defined(additive_inverse(X0)) ),
inference(duplicate_literal_removal,[],[f187]) ).
fof(f201,plain,
! [X0,X1] :
( equalish(add(add(X1,additive_inverse(X0)),X0),X1)
| ~ defined(X0)
| ~ defined(X1) ),
inference(forward_subsumption_resolution,[],[f200,f12]) ).
fof(f204,plain,
! [X2,X0,X1] :
( ~ equalish(X2,add(add(X1,additive_inverse(X0)),X0))
| ~ defined(X1)
| ~ defined(X0)
| equalish(X2,X1) ),
inference(resolution,[],[f201,f23]) ).
fof(f218,plain,
! [X2,X0,X1] :
( ~ defined(X0)
| ~ defined(X1)
| equalish(add(X2,X1),X0)
| ~ defined(X1)
| ~ equalish(X2,add(X0,additive_inverse(X1))) ),
inference(resolution,[],[f204,f24]) ).
fof(f232,plain,
! [X2,X0,X1] :
( ~ equalish(X2,add(X0,additive_inverse(X1)))
| ~ defined(X1)
| equalish(add(X2,X1),X0)
| ~ defined(X0) ),
inference(duplicate_literal_removal,[],[f218]) ).
fof(f237,plain,
! [X0,X1] :
( ~ defined(X0)
| equalish(add(add(additive_inverse(X0),X1),X0),X1)
| ~ defined(X1)
| ~ defined(additive_inverse(X0))
| ~ defined(X1) ),
inference(resolution,[],[f232,f4]) ).
fof(f250,plain,
! [X0,X1] :
( ~ defined(X0)
| equalish(add(add(additive_inverse(X0),X1),X0),X1)
| ~ defined(X1)
| ~ defined(additive_inverse(X0)) ),
inference(duplicate_literal_removal,[],[f237]) ).
fof(f256,plain,
! [X0,X1] :
( equalish(add(add(additive_inverse(X0),X1),X0),X1)
| ~ defined(X0)
| ~ defined(X1) ),
inference(forward_subsumption_resolution,[],[f250,f12]) ).
fof(f260,plain,
! [X2,X0,X1] :
( ~ equalish(X2,add(add(additive_inverse(X0),X1),X0))
| ~ defined(X1)
| ~ defined(X0)
| equalish(X2,X1) ),
inference(resolution,[],[f256,f23]) ).
fof(f295,plain,
! [X0,X1] :
( ~ defined(X0)
| ~ defined(X1)
| equalish(add(additive_inverse(X1),add(X0,X1)),X0)
| ~ defined(additive_inverse(X1))
| ~ defined(X0)
| ~ defined(X1) ),
inference(resolution,[],[f260,f1]) ).
fof(f310,plain,
! [X0,X1] :
( ~ defined(X0)
| ~ defined(X1)
| equalish(add(additive_inverse(X1),add(X0,X1)),X0)
| ~ defined(additive_inverse(X1)) ),
inference(duplicate_literal_removal,[],[f295]) ).
fof(f315,plain,
! [X0,X1] :
( equalish(add(additive_inverse(X1),add(X0,X1)),X0)
| ~ defined(X1)
| ~ defined(X0) ),
inference(forward_subsumption_resolution,[],[f310,f12]) ).
fof(f631,plain,
! [X2,X0,X1] :
( ~ equalish(X2,add(additive_inverse(X0),add(X1,X0)))
| ~ defined(X1)
| ~ defined(X0)
| equalish(X2,X1) ),
inference(resolution,[],[f315,f23]) ).
fof(f651,plain,
! [X0,X1] :
( ~ defined(X0)
| ~ defined(X1)
| equalish(add(add(X0,X1),additive_inverse(X1)),X0)
| ~ defined(add(X0,X1))
| ~ defined(additive_inverse(X1)) ),
inference(resolution,[],[f631,f4]) ).
fof(f675,plain,
! [X0,X1] :
( ~ defined(X0)
| ~ defined(X1)
| equalish(add(add(X0,X1),additive_inverse(X1)),X0)
| ~ defined(additive_inverse(X1)) ),
inference(forward_subsumption_resolution,[],[f651,f10]) ).
fof(f676,plain,
! [X0,X1] :
( equalish(add(add(X0,X1),additive_inverse(X1)),X0)
| ~ defined(X1)
| ~ defined(X0) ),
inference(forward_subsumption_resolution,[],[f675,f12]) ).
fof(f681,plain,
! [X0,X1] :
( equalish(X1,add(add(X1,X0),additive_inverse(X0)))
| ~ defined(X1)
| ~ defined(X0) ),
inference(resolution,[],[f676,f22]) ).
fof(f820,plain,
! [X0] :
( ~ defined(additive_inverse(additive_inverse(X0)))
| ~ defined(X0)
| ~ defined(X0)
| ~ defined(additive_inverse(X0))
| equalish(additive_inverse(additive_inverse(X0)),X0) ),
inference(resolution,[],[f681,f260]) ).
fof(f831,plain,
! [X0] :
( ~ defined(additive_inverse(additive_inverse(X0)))
| ~ defined(X0)
| ~ defined(additive_inverse(X0))
| equalish(additive_inverse(additive_inverse(X0)),X0) ),
inference(duplicate_literal_removal,[],[f820]) ).
fof(f837,plain,
! [X0] :
( ~ defined(X0)
| ~ defined(additive_inverse(X0))
| equalish(additive_inverse(additive_inverse(X0)),X0) ),
inference(forward_subsumption_resolution,[],[f831,f12]) ).
fof(f838,plain,
! [X0] :
( equalish(additive_inverse(additive_inverse(X0)),X0)
| ~ defined(X0) ),
inference(forward_subsumption_resolution,[],[f837,f12]) ).
fof(f857,plain,
( equalish(additive_inverse(sF0),a)
| ~ defined(a) ),
inference(superposition,[],[f838,f31]) ).
fof(f860,plain,
equalish(additive_inverse(sF0),a),
inference(forward_subsumption_resolution,[],[f857,f28]) ).
fof(f861,plain,
equalish(sF1,a),
inference(forward_demodulation,[],[f860,f33]) ).
fof(f862,plain,
$false,
inference(forward_subsumption_resolution,[],[f861,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD007-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.16 % Computer : n009.cluster.edu
% 0.07/0.16 % Model : x86_64 x86_64
% 0.07/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.16 % Memory : 8046.5625MB
% 0.07/0.16 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 00:22:30 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 Running first-order theorem proving
% 0.07/0.20 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.68/1.39 % (3650894)Input is clausal, will run a generic CNF schedule.
% 4.68/1.39 % (3650899)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3716006561:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.68/1.39 % (3650900)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2443880147:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.68/1.39 % (3650904)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1612060884:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.68/1.39 % (3650902)lrs+10_1_sil=8000:sp=occurrence:random_seed=1925787410:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.68/1.39 % (3650905)dis-21_1_sil=8000:lcm=predicate:random_seed=1023584199:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 4.68/1.39 % (3650903)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1443246232:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.68/1.39 % (3650901)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2224408802:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.68/1.39 % (3650902)Instruction limit reached!
% 4.68/1.39 % (3650902)------------------------------
% 4.68/1.39 % (3650902)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.39 % (3650902)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.39 % (3650902)CaDiCaL version: 2.1.3
% 4.68/1.39 % (3650902)Termination reason: Instruction limit
% 4.68/1.39 % (3650902)Termination phase: Saturation
% 4.68/1.39 % (3650902)Time elapsed: 0.068 s
% 4.68/1.39 % (3650902)Peak memory usage: 89 MB
% 4.68/1.39 % (3650902)Instructions burned: 108 (million)
% 4.68/1.39 % (3650903)Instruction limit reached!
% 4.68/1.39 % (3650903)------------------------------
% 4.68/1.39 % (3650903)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.39 % (3650903)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.39 % (3650903)CaDiCaL version: 2.1.3
% 4.68/1.39 % (3650903)Termination reason: Instruction limit
% 4.68/1.39 % (3650903)Termination phase: Saturation
% 4.68/1.39 % (3650903)Time elapsed: 0.069 s
% 4.68/1.39 % (3650903)Peak memory usage: 88 MB
% 4.68/1.39 % (3650903)Instructions burned: 115 (million)
% 4.68/1.39 % (3650905)Instruction limit reached!
% 4.68/1.39 % (3650905)------------------------------
% 4.68/1.39 % (3650905)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.39 % (3650905)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.39 % (3650905)CaDiCaL version: 2.1.3
% 4.68/1.39 % (3650905)Termination reason: Instruction limit
% 4.68/1.39 % (3650905)Termination phase: Saturation
% 4.68/1.39 % (3650905)Time elapsed: 0.075 s
% 4.68/1.39 % (3650905)Peak memory usage: 89 MB
% 4.68/1.39 % (3650905)Instructions burned: 118 (million)
% 4.68/1.39 % (3650904)Instruction limit reached!
% 4.68/1.39 % (3650904)------------------------------
% 4.68/1.39 % (3650904)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.39 % (3650904)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.39 % (3650904)CaDiCaL version: 2.1.3
% 4.68/1.39 % (3650904)Termination reason: Instruction limit
% 4.68/1.39 % (3650904)Termination phase: Saturation
% 4.68/1.39 % (3650904)Time elapsed: 0.116 s
% 4.68/1.39 % (3650904)Peak memory usage: 88 MB
% 4.68/1.39 % (3650904)Instructions burned: 181 (million)
% 4.68/1.39 % (3650914)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=438769800:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 4.68/1.39 % (3650913)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1730944728:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.68/1.39 % (3650915)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=27542920:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 4.68/1.39 % (3650913)Refutation not found, incomplete strategy
% 4.68/1.39 % (3650913)------------------------------
% 4.68/1.39 % (3650913)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.39 % (3650913)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.39 % (3650913)CaDiCaL version: 2.1.3
% 4.68/1.39 % (3650913)Termination reason: Refutation not found, incomplete strategy
% 4.68/1.39 % (3650913)Time elapsed: 0.001 s
% 4.68/1.39 % (3650913)Peak memory usage: 87 MB
% 4.68/1.39 % (3650916)lrs+10_64_to=lpo:sil=8000:random_seed=2290411870:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 4.68/1.39 % (3650914)Instruction limit reached!
% 4.68/1.39 % (3650914)------------------------------
% 4.68/1.39 % (3650914)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.39 % (3650914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.39 % (3650914)CaDiCaL version: 2.1.3
% 4.68/1.39 % (3650914)Termination reason: Instruction limit
% 4.68/1.39 % (3650914)Termination phase: Saturation
% 4.68/1.39 % (3650914)Time elapsed: 0.095 s
% 4.68/1.39 % (3650914)Peak memory usage: 94 MB
% 4.68/1.39 % (3650914)Instructions burned: 190 (million)
% 4.68/1.39 % (3650915)Instruction limit reached!
% 4.68/1.39 % (3650915)------------------------------
% 4.68/1.39 % (3650915)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.39 % (3650915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.39 % (3650915)CaDiCaL version: 2.1.3
% 4.68/1.39 % (3650915)Termination reason: Instruction limit
% 4.68/1.39 % (3650915)Termination phase: Saturation
% 4.68/1.39 % (3650915)Time elapsed: 0.135 s
% 4.68/1.39 % (3650915)Peak memory usage: 89 MB
% 4.68/1.39 % (3650915)Instructions burned: 219 (million)
% 4.68/1.39 % (3650916)Instruction limit reached!
% 4.68/1.39 % (3650916)------------------------------
% 4.68/1.39 % (3650916)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/1.39 % (3650916)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/1.39 % (3650916)CaDiCaL version: 2.1.3
% 4.68/1.39 % (3650916)Termination reason: Instruction limit
% 4.68/1.39 % (3650916)Termination phase: Saturation
% 4.68/1.39 % (3650916)Time elapsed: 0.082 s
% 4.68/1.39 % (3650916)Peak memory usage: 89 MB
% 4.68/1.39 % (3650916)Instructions burned: 127 (million)
% 4.68/1.39 % (3650899)First to succeed.
% 4.68/1.39 % (3650899)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3650894"
% 4.68/1.39 % (3650913)------------------------------
% 4.68/1.39 % (3650913)------------------------------
% 4.68/1.39 % (3650921)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=1479613261:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 4.68/1.39 % (3650923)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=3815374020:i=3394:sd=4:ss=included:sgt=64_2994 on theBenchmark for (2994ds/3394Mi)
% 4.68/1.39 % (3650922)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=4275139968:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 4.68/1.39 % (3650899)Refutation found. Thanks to Tanya!
% 4.68/1.39 % SZS status Unsatisfiable for theBenchmark
% 4.68/1.39 % SZS output start Proof for theBenchmark
% See solution above
% 5.78/1.58 % (3650899)------------------------------
% 5.78/1.58 % (3650899)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.78/1.58 % (3650899)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.78/1.58 % (3650899)CaDiCaL version: 2.1.3
% 5.78/1.58 % (3650899)Termination reason: Refutation
% 5.78/1.58 % (3650899)Time elapsed: 0.453 s
% 5.78/1.58 % (3650899)Peak memory usage: 130 MB
% 5.78/1.58 % (3650899)Instructions burned: 1146 (million)
% 5.78/1.58 % (3650899)------------------------------
% 5.78/1.58 % (3650899)------------------------------
% 5.78/1.58 % (3650894)Success in time 0.742 s
% 5.78/1.58 % Vampire exiting
%------------------------------------------------------------------------------