%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP085-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 10:12:33 AM UTC 2026
% Result : Unsatisfiable 4.48s 1.32s
% Output : Refutation 5.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 78 ( 57 unt; 4 def)
% Number of atoms : 107 ( 68 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 54 ( 25 ~; 25 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 134 ( 0 sgn 134 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : multiply(multiply(multiply(X0,X1),X2),inverse(multiply(X0,X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
fof(f3,plain,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| a2 != multiply(multiply(inverse(b2),b2),a2)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
inference(reorient_equations,[],[f2]) ).
fof(f5,definition,
( spl0_1
<=> multiply(a4,b4) = multiply(b4,a4) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f7,plain,
( multiply(a4,b4) != multiply(b4,a4)
| spl0_1 ),
inference(avatar_component_clause,[],[f5]) ).
fof(f9,definition,
( spl0_2
<=> multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f11,plain,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| spl0_2 ),
inference(avatar_component_clause,[],[f9]) ).
fof(f13,definition,
( spl0_3
<=> a2 = multiply(multiply(inverse(b2),b2),a2) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f15,plain,
( a2 != multiply(multiply(inverse(b2),b2),a2)
| spl0_3 ),
inference(avatar_component_clause,[],[f13]) ).
fof(f17,definition,
( spl0_4
<=> multiply(inverse(a1),a1) = multiply(inverse(b1),b1) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f19,plain,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| spl0_4 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f20,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f3,f17,f13,f9,f5]) ).
fof(f21,plain,
! [X2,X3,X0,X1] : inverse(multiply(X1,X2)) = multiply(multiply(X0,X3),inverse(multiply(multiply(multiply(X1,X0),X2),X3))),
inference(superposition,[],[f1,f1]) ).
fof(f22,plain,
! [X2,X0,X1] : multiply(X0,inverse(multiply(multiply(X1,X0),inverse(multiply(X1,X2))))) = X2,
inference(superposition,[],[f1,f1]) ).
fof(f27,plain,
! [X2,X3,X0,X1] : inverse(multiply(multiply(X3,X2),inverse(multiply(X3,X0)))) = multiply(X1,inverse(multiply(multiply(X2,X1),inverse(X0)))),
inference(superposition,[],[f22,f22]) ).
fof(f28,plain,
! [X2,X3,X0,X1] : multiply(multiply(multiply(X1,X2),inverse(multiply(multiply(X3,X1),inverse(multiply(X3,X0))))),inverse(X0)) = X2,
inference(superposition,[],[f1,f22]) ).
fof(f29,plain,
! [X2,X3,X0,X1] : inverse(multiply(multiply(X2,X1),inverse(multiply(X2,X0)))) = multiply(multiply(X0,X3),inverse(multiply(X1,X3))),
inference(superposition,[],[f1,f22]) ).
fof(f36,plain,
! [X2,X3,X0,X1,X4] : inverse(multiply(X1,X2)) = multiply(multiply(inverse(multiply(multiply(X3,X1),inverse(multiply(X3,X0)))),X4),inverse(multiply(multiply(X0,X2),X4))),
inference(superposition,[],[f21,f22]) ).
fof(f40,plain,
! [X2,X0,X1] : inverse(multiply(X1,X2)) = multiply(multiply(X0,inverse(multiply(X1,X2))),inverse(X0)),
inference(superposition,[],[f21,f1]) ).
fof(f45,plain,
! [X2,X0,X1] : inverse(multiply(X0,multiply(X1,inverse(multiply(multiply(X0,X1),X2))))) = X2,
inference(superposition,[],[f22,f21]) ).
fof(f57,plain,
! [X2,X0,X1] : inverse(multiply(multiply(X0,X1),inverse(multiply(X0,multiply(X1,X2))))) = X2,
inference(superposition,[],[f45,f21]) ).
fof(f59,plain,
! [X2,X3,X0,X1] : multiply(multiply(multiply(X1,X2),multiply(X3,inverse(multiply(multiply(X1,X3),X0)))),X0) = X2,
inference(superposition,[],[f1,f45]) ).
fof(f83,plain,
! [X3,X0] : multiply(multiply(X3,X0),inverse(X3)) = X0,
inference(superposition,[],[f40,f57]) ).
fof(f84,plain,
! [X2,X0,X1] : inverse(multiply(X1,X2)) = multiply(X0,inverse(multiply(multiply(X1,X0),X2))),
inference(superposition,[],[f40,f1]) ).
fof(f86,plain,
! [X2,X0,X1] : inverse(multiply(multiply(X1,X2),inverse(multiply(X1,X0)))) = multiply(X0,inverse(X2)),
inference(superposition,[],[f40,f22]) ).
fof(f91,plain,
! [X2,X3,X0,X1] : inverse(multiply(X2,inverse(X2))) = multiply(multiply(inverse(multiply(X0,X1)),X3),inverse(multiply(inverse(multiply(X0,X1)),X3))),
inference(superposition,[],[f21,f40]) ).
fof(f98,plain,
! [X2,X3,X0,X1] : multiply(inverse(X2),inverse(multiply(inverse(multiply(X0,X1)),inverse(multiply(multiply(X2,inverse(multiply(X0,X1))),X3))))) = X3,
inference(superposition,[],[f22,f40]) ).
fof(f105,plain,
! [X2,X0] : multiply(X0,multiply(X2,inverse(X0))) = X2,
inference(backward_demodulation,[],[f22,f86]) ).
fof(f107,plain,
! [X2,X0,X1] : multiply(X1,inverse(multiply(multiply(X2,X1),inverse(X0)))) = multiply(X0,inverse(X2)),
inference(backward_demodulation,[],[f27,f86]) ).
fof(f108,plain,
! [X2,X0,X1] : multiply(multiply(multiply(X1,X2),multiply(X0,inverse(X1))),inverse(X0)) = X2,
inference(backward_demodulation,[],[f28,f86]) ).
fof(f109,plain,
! [X3,X0,X1] : multiply(multiply(X0,X3),inverse(multiply(X1,X3))) = multiply(X0,inverse(X1)),
inference(backward_demodulation,[],[f29,f86]) ).
fof(f111,plain,
! [X2,X0,X1,X4] : inverse(multiply(X1,X2)) = multiply(multiply(multiply(X0,inverse(X1)),X4),inverse(multiply(multiply(X0,X2),X4))),
inference(backward_demodulation,[],[f36,f86]) ).
fof(f136,plain,
! [X2,X0,X1] : multiply(multiply(multiply(X1,X2),inverse(multiply(X1,X0))),X0) = X2,
inference(backward_demodulation,[],[f59,f84]) ).
fof(f139,plain,
! [X2,X3] : multiply(inverse(X2),inverse(inverse(multiply(X2,X3)))) = X3,
inference(backward_demodulation,[],[f98,f84]) ).
fof(f149,plain,
! [X2,X0,X1] : inverse(multiply(X1,X2)) = multiply(multiply(X0,inverse(X1)),inverse(multiply(X0,X2))),
inference(backward_demodulation,[],[f111,f109]) ).
fof(f152,plain,
! [X2,X0,X1] : multiply(inverse(multiply(X0,X1)),inverse(inverse(multiply(X0,X1)))) = inverse(multiply(X2,inverse(X2))),
inference(backward_demodulation,[],[f91,f109]) ).
fof(f153,plain,
! [X2,X0] : multiply(X0,inverse(X2)) = inverse(multiply(X2,inverse(X0))),
inference(forward_demodulation,[],[f107,f84]) ).
fof(f173,plain,
! [X2,X0,X1] : multiply(inverse(multiply(X0,X1)),inverse(inverse(multiply(X0,X1)))) = multiply(X2,inverse(X2)),
inference(backward_demodulation,[],[f152,f153]) ).
fof(f175,plain,
! [X2,X0,X1] : multiply(multiply(X1,X0),inverse(multiply(X1,X2))) = multiply(X0,inverse(X2)),
inference(backward_demodulation,[],[f86,f153]) ).
fof(f186,plain,
! [X2,X0] : multiply(multiply(X2,inverse(X0)),X0) = X2,
inference(backward_demodulation,[],[f136,f175]) ).
fof(f187,plain,
! [X2,X1] : inverse(multiply(X1,X2)) = multiply(inverse(X1),inverse(X2)),
inference(backward_demodulation,[],[f149,f175]) ).
fof(f200,plain,
! [X2,X3] : multiply(inverse(X2),inverse(multiply(inverse(X2),inverse(X3)))) = X3,
inference(backward_demodulation,[],[f139,f187]) ).
fof(f206,plain,
! [X2,X0,X1] : multiply(X2,inverse(X2)) = multiply(multiply(inverse(X0),inverse(X1)),inverse(multiply(inverse(X0),inverse(X1)))),
inference(backward_demodulation,[],[f173,f187]) ).
fof(f208,plain,
! [X2,X0,X1] : multiply(X0,inverse(X2)) = multiply(multiply(X1,X0),multiply(inverse(X1),inverse(X2))),
inference(backward_demodulation,[],[f175,f187]) ).
fof(f213,plain,
! [X2,X0] : multiply(X0,inverse(X2)) = multiply(inverse(X2),inverse(inverse(X0))),
inference(backward_demodulation,[],[f153,f187]) ).
fof(f218,plain,
! [X2,X0,X1] : multiply(X2,inverse(X2)) = multiply(multiply(inverse(X0),inverse(X1)),multiply(inverse(inverse(X0)),inverse(inverse(X1)))),
inference(forward_demodulation,[],[f206,f187]) ).
fof(f222,plain,
! [X2,X3] : multiply(inverse(X2),multiply(inverse(inverse(X2)),inverse(inverse(X3)))) = X3,
inference(forward_demodulation,[],[f200,f187]) ).
fof(f234,plain,
! [X2,X1] : multiply(X2,inverse(X2)) = multiply(inverse(X1),inverse(inverse(X1))),
inference(forward_demodulation,[],[f218,f208]) ).
fof(f243,plain,
! [X2,X1] : multiply(X2,inverse(X2)) = multiply(X1,inverse(X1)),
inference(forward_demodulation,[],[f234,f213]) ).
fof(f253,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X0,inverse(inverse(X1))),
inference(superposition,[],[f186,f186]) ).
fof(f262,plain,
! [X2,X3] : multiply(inverse(X2),multiply(inverse(inverse(X2)),X3)) = X3,
inference(backward_demodulation,[],[f222,f253]) ).
fof(f266,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f186,f83]) ).
fof(f267,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[],[f186,f83]) ).
fof(f274,plain,
! [X2,X3] : multiply(inverse(X2),multiply(X2,X3)) = X3,
inference(backward_demodulation,[],[f262,f266]) ).
fof(f296,plain,
( multiply(a4,b4) != multiply(a4,b4)
| spl0_1 ),
inference(superposition,[],[f7,f267]) ).
fof(f310,plain,
( $false
| spl0_1 ),
inference(trivial_inequality_removal,[],[f296]) ).
fof(f311,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f310]) ).
fof(f684,plain,
! [X2,X0,X1] : multiply(X1,X0) = multiply(multiply(X2,X0),multiply(X1,inverse(X2))),
inference(superposition,[],[f105,f108]) ).
fof(f808,plain,
! [X2,X0,X1] : multiply(X1,multiply(X2,X0)) = multiply(X0,multiply(X1,inverse(inverse(X2)))),
inference(superposition,[],[f684,f274]) ).
fof(f893,plain,
! [X2,X0,X1] : multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X2,X0)),
inference(forward_demodulation,[],[f808,f266]) ).
fof(f1008,plain,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(superposition,[],[f267,f893]) ).
fof(f1107,plain,
( multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3))
| spl0_2 ),
inference(backward_demodulation,[],[f11,f1008]) ).
fof(f1108,plain,
( $false
| spl0_2 ),
inference(trivial_inequality_removal,[],[f1107]) ).
fof(f1109,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f1108]) ).
fof(f1278,plain,
( a2 != multiply(inverse(b2),multiply(b2,a2))
| spl0_3 ),
inference(forward_demodulation,[],[f15,f1008]) ).
fof(f1279,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f1278,f274]) ).
fof(f1280,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f1279]) ).
fof(f1282,plain,
( multiply(inverse(a1),a1) != multiply(b1,inverse(b1))
| spl0_4 ),
inference(forward_demodulation,[],[f19,f267]) ).
fof(f1283,plain,
( multiply(b1,inverse(b1)) != multiply(a1,inverse(a1))
| spl0_4 ),
inference(forward_demodulation,[],[f1282,f267]) ).
fof(f1284,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f1283,f243]) ).
fof(f1285,plain,
spl0_4,
inference(avatar_contradiction_clause,[],[f1284]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f20]) ).
cnf(s3,plain,
spl0_1,
inference(sat_conversion,[],[f311]) ).
cnf(s4,plain,
spl0_2,
inference(sat_conversion,[],[f1109]) ).
cnf(s5,plain,
spl0_3,
inference(sat_conversion,[],[f1280]) ).
cnf(s6,plain,
spl0_4,
inference(sat_conversion,[],[f1285]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s6,s5,s4,s3]) ).
fof(f1286,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP085-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Sun Sep 27 09:18:20 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.33 Running first-order theorem proving
% 0.03/0.33 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.48/1.32 % (2106499)Input is clausal, will run a generic CNF schedule.
% 4.48/1.32 % (2106518)dis-21_1_sil=8000:lcm=predicate:random_seed=3647434838:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_3000 on theBenchmark for (3000ds/117Mi)
% 4.48/1.32 % (2106518)Refutation not found, incomplete strategy
% 4.48/1.32 % (2106518)------------------------------
% 4.48/1.32 % (2106518)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.32 % (2106518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.32 % (2106518)CaDiCaL version: 2.1.3
% 4.48/1.32 % (2106518)Termination reason: Refutation not found, incomplete strategy
% 4.48/1.32 % (2106518)Time elapsed: 0.001 s
% 4.48/1.32 % (2106518)Peak memory usage: 88 MB
% 4.48/1.32 % (2106513)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1157223552:i=132376:av=off_3000 on theBenchmark for (3000ds/132376Mi)
% 4.48/1.32 % (2106512)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=3868506417:i=140167_3000 on theBenchmark for (3000ds/140167Mi)
% 4.48/1.32 % (2106517)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3306625620:s2a=on:i=180:gtg=position_3000 on theBenchmark for (3000ds/180Mi)
% 4.48/1.32 % (2106515)lrs+10_1_sil=8000:sp=occurrence:random_seed=83464989:i=107:sd=3:ss=axioms:sgt=8_3000 on theBenchmark for (3000ds/107Mi)
% 4.48/1.32 % (2106516)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1825784942:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_3000 on theBenchmark for (3000ds/114Mi)
% 4.48/1.32 % (2106514)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1185469498:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_3000 on theBenchmark for (3000ds/137899Mi)
% 4.48/1.32 % (2106515)Instruction limit reached!
% 4.48/1.32 % (2106515)------------------------------
% 4.48/1.32 % (2106515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.32 % (2106515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.32 % (2106515)CaDiCaL version: 2.1.3
% 4.48/1.32 % (2106515)Termination reason: Instruction limit
% 4.48/1.32 % (2106515)Termination phase: Saturation
% 4.48/1.32 % (2106515)Time elapsed: 0.057 s
% 4.48/1.32 % (2106515)Peak memory usage: 89 MB
% 4.48/1.32 % (2106515)Instructions burned: 108 (million)
% 4.48/1.32 % (2106516)Instruction limit reached!
% 4.48/1.32 % (2106516)------------------------------
% 4.48/1.32 % (2106516)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.32 % (2106516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.32 % (2106516)CaDiCaL version: 2.1.3
% 4.48/1.32 % (2106516)Termination reason: Instruction limit
% 4.48/1.32 % (2106516)Termination phase: Saturation
% 4.48/1.32 % (2106516)Time elapsed: 0.061 s
% 4.48/1.32 % (2106516)Peak memory usage: 89 MB
% 4.48/1.32 % (2106516)Instructions burned: 115 (million)
% 4.48/1.32 % (2106517)Instruction limit reached!
% 4.48/1.32 % (2106517)------------------------------
% 4.48/1.32 % (2106517)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.32 % (2106517)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.32 % (2106517)CaDiCaL version: 2.1.3
% 4.48/1.32 % (2106517)Termination reason: Instruction limit
% 4.48/1.32 % (2106517)Termination phase: Saturation
% 4.48/1.32 % (2106517)Time elapsed: 0.086 s
% 4.48/1.32 % (2106517)Peak memory usage: 90 MB
% 4.48/1.32 % (2106517)Instructions burned: 180 (million)
% 4.48/1.32 % (2106518)------------------------------
% 4.48/1.32 % (2106518)------------------------------
% 4.48/1.32 % (2106541)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=994257707:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 4.48/1.32 % (2106541)Refutation not found, incomplete strategy
% 4.48/1.32 % (2106541)------------------------------
% 4.48/1.32 % (2106541)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.32 % (2106541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.32 % (2106541)CaDiCaL version: 2.1.3
% 4.48/1.32 % (2106541)Termination reason: Refutation not found, incomplete strategy
% 4.48/1.32 % (2106541)Time elapsed: 0.001 s
% 4.48/1.32 % (2106541)Peak memory usage: 88 MB
% 4.48/1.32 % (2106536)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=2352393823:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.48/1.32 % (2106537)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3190881604: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.48/1.32 % (2106536)Refutation not found, incomplete strategy
% 4.48/1.32 % (2106536)------------------------------
% 4.48/1.32 % (2106536)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.32 % (2106537)Refutation not found, incomplete strategy
% 4.48/1.32 % (2106537)------------------------------
% 4.48/1.32 % (2106537)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.32 % (2106536)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.32 % (2106537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.32 % (2106536)CaDiCaL version: 2.1.3
% 4.48/1.32 % (2106537)CaDiCaL version: 2.1.3
% 4.48/1.32 % (2106536)Termination reason: Refutation not found, incomplete strategy
% 4.48/1.32 % (2106536)Time elapsed: 0.001 s
% 4.48/1.32 % (2106537)Termination reason: Refutation not found, incomplete strategy
% 4.48/1.32 % (2106537)Time elapsed: 0.001 s
% 4.48/1.32 % (2106536)Peak memory usage: 88 MB
% 4.48/1.32 % (2106537)Peak memory usage: 88 MB
% 4.48/1.32 % (2106543)lrs+10_64_to=lpo:sil=8000:random_seed=3627577315:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 4.48/1.32 % (2106543)First to succeed.
% 4.48/1.32 % (2106543)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2106499"
% 4.48/1.32 % (2106541)------------------------------
% 4.48/1.32 % (2106541)------------------------------
% 4.48/1.32 % (2106537)------------------------------
% 4.48/1.32 % (2106537)------------------------------
% 4.48/1.32 % (2106536)------------------------------
% 4.48/1.32 % (2106536)------------------------------
% 4.48/1.32 % (2106552)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=221410193:avsq=on:i=194:fgj=on:bd=preordered_2994 on theBenchmark for (2994ds/194Mi)
% 4.48/1.32 % (2106513)Also succeeded, but the first one will report.
% 4.48/1.32 % (2106554)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3926453142:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 4.48/1.32 % (2106552)Also succeeded, but the first one will report.
% 4.48/1.32 % (2106543)Refutation found. Thanks to Tanya!
% 4.48/1.32 % SZS status Unsatisfiable for theBenchmark
% 4.48/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 5.63/1.43 % (2106543)------------------------------
% 5.63/1.43 % (2106543)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.43 % (2106543)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.43 % (2106543)CaDiCaL version: 2.1.3
% 5.63/1.43 % (2106543)Termination reason: Refutation
% 5.63/1.43 % (2106543)Time elapsed: 0.031 s
% 5.63/1.43 % (2106543)Peak memory usage: 89 MB
% 5.63/1.43 % (2106543)Instructions burned: 67 (million)
% 5.63/1.43 % (2106543)------------------------------
% 5.63/1.43 % (2106543)------------------------------
% 5.63/1.43 % (2106499)Success in time 0.759 s
% 5.63/1.43 % Vampire exiting
%------------------------------------------------------------------------------