%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 11:52:21 AM UTC 2026
% Result : Unsatisfiable 4.49s 1.77s
% Output : Refutation 7.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of formulae : 76 ( 17 unt; 8 def)
% Number of atoms : 233 ( 2 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 311 ( 154 ~; 150 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn 118 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xcb) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_reflexivity) ).
fof(f4,definition,
sF0 = equivalent(a,a),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f5,plain,
equivalent(a,a) = sF0,
inference(reorient_equations,[],[f4]) ).
fof(f6,plain,
~ is_a_theorem(sF0),
inference(definition_folding,[],[f3,f5]) ).
fof(f7,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f2]) ).
fof(f8,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1)))
| ~ is_a_theorem(X0)
| is_a_theorem(X2) ),
inference(resolution,[],[f7,f1]) ).
fof(f22,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X1,X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f8,f2]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[],[f22,f1]) ).
fof(f30,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X2,X1),X2))
| ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f27,f7]) ).
fof(f31,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(X2,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f27,f22]) ).
fof(f35,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f30,f27]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X2) ),
inference(resolution,[],[f30,f1]) ).
fof(f48,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X2,X3)))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X3,X1)) ),
inference(resolution,[],[f35,f27]) ).
fof(f50,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(resolution,[],[f36,f2]) ).
fof(f75,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(X0)
| is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X3),equivalent(X4,X3)),X4))
| ~ is_a_theorem(equivalent(X2,X0)) ),
inference(resolution,[],[f50,f35]) ).
fof(f82,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X3),equivalent(X4,X3)),X4))
| ~ is_a_theorem(equivalent(X2,X0)) ),
inference(forward_subsumption_resolution,[],[f75,f1]) ).
fof(f84,definition,
( spl1_7
<=> ! [X2,X0] :
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X2,X0)) ) ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f85,plain,
( ! [X2,X0] :
( ~ is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(X2) )
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f87,definition,
( spl1_8
<=> ! [X4,X1,X3] :
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X3),equivalent(X4,X3)),X4)) ) ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f88,plain,
( ! [X3,X1,X4] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X3),equivalent(X4,X3)),X4))
| is_a_theorem(X1) )
| ~ spl1_8 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f89,plain,
( spl1_7
| spl1_8 ),
inference(avatar_split_clause,[],[f82,f87,f84]) ).
fof(f90,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl1_7 ),
inference(resolution,[],[f85,f2]) ).
fof(f98,plain,
( $false
| ~ spl1_7 ),
inference(resolution,[],[f90,f2]) ).
fof(f105,plain,
~ spl1_7,
inference(avatar_contradiction_clause,[],[f98]) ).
fof(f107,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X0,X2),X2)))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ spl1_8 ),
inference(resolution,[],[f88,f30]) ).
fof(f113,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X0,X3),X3))
| ~ is_a_theorem(equivalent(X2,X1)) )
| ~ spl1_8 ),
inference(resolution,[],[f107,f35]) ).
fof(f119,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X0,X3),X3))
| ~ is_a_theorem(equivalent(X2,X1)) )
| ~ spl1_8 ),
inference(forward_subsumption_resolution,[],[f113,f1]) ).
fof(f121,definition,
( spl1_9
<=> ! [X0,X3] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(X0,X3),X3)) ) ),
introduced(definition,[new_symbols(definition,[spl1_9])],[avatar_definition]) ).
fof(f122,plain,
( ! [X3,X0] :
( ~ is_a_theorem(equivalent(equivalent(X0,X3),X3))
| is_a_theorem(X0) )
| ~ spl1_9 ),
inference(avatar_component_clause,[],[f121]) ).
fof(f123,plain,
( spl1_7
| spl1_9
| ~ spl1_8 ),
inference(avatar_split_clause,[],[f119,f87,f121,f84]) ).
fof(f165,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(X3) ),
inference(resolution,[],[f48,f31]) ).
fof(f173,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(X3) ),
inference(forward_subsumption_resolution,[],[f165,f1]) ).
fof(f175,definition,
( spl1_10
<=> ! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,X0)) ) ),
introduced(definition,[new_symbols(definition,[spl1_10])],[avatar_definition]) ).
fof(f176,plain,
( ! [X0,X1] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ spl1_10 ),
inference(avatar_component_clause,[],[f175]) ).
fof(f177,plain,
( spl1_7
| spl1_10 ),
inference(avatar_split_clause,[],[f173,f175,f84]) ).
fof(f188,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) )
| ~ spl1_9
| ~ spl1_10 ),
inference(resolution,[],[f176,f122]) ).
fof(f205,plain,
( ! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X2,X0),X1))
| ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2) )
| ~ spl1_9
| ~ spl1_10 ),
inference(resolution,[],[f188,f22]) ).
fof(f212,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X2)
| is_a_theorem(X1) )
| ~ spl1_9
| ~ spl1_10 ),
inference(resolution,[],[f205,f8]) ).
fof(f218,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X0))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(X2) )
| ~ spl1_8
| ~ spl1_9
| ~ spl1_10 ),
inference(resolution,[],[f205,f88]) ).
fof(f232,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| ~ is_a_theorem(X2)
| is_a_theorem(X1) )
| ~ spl1_9
| ~ spl1_10 ),
inference(duplicate_literal_removal,[],[f212]) ).
fof(f234,definition,
( spl1_11
<=> ! [X4] : ~ is_a_theorem(X4) ),
introduced(definition,[new_symbols(definition,[spl1_11])],[avatar_definition]) ).
fof(f235,plain,
( ! [X4] : ~ is_a_theorem(X4)
| ~ spl1_11 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f245,definition,
( spl1_14
<=> ! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| is_a_theorem(X1) ) ),
introduced(definition,[new_symbols(definition,[spl1_14])],[avatar_definition]) ).
fof(f246,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| is_a_theorem(X1) )
| ~ spl1_14 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f247,plain,
( spl1_11
| spl1_14
| ~ spl1_9
| ~ spl1_10 ),
inference(avatar_split_clause,[],[f232,f175,f121,f245,f234]) ).
fof(f248,plain,
( $false
| ~ spl1_11 ),
inference(resolution,[],[f235,f2]) ).
fof(f261,plain,
~ spl1_11,
inference(avatar_contradiction_clause,[],[f248]) ).
fof(f262,plain,
( ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1)))
| ~ spl1_14 ),
inference(resolution,[],[f246,f2]) ).
fof(f305,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),X2)))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ spl1_8
| ~ spl1_9
| ~ spl1_10 ),
inference(resolution,[],[f218,f7]) ).
fof(f471,plain,
( ! [X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),X1))
| ~ is_a_theorem(X0) )
| ~ spl1_8
| ~ spl1_9
| ~ spl1_10
| ~ spl1_14 ),
inference(resolution,[],[f305,f262]) ).
fof(f479,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,X1)) )
| ~ spl1_8
| ~ spl1_9
| ~ spl1_10
| ~ spl1_14 ),
inference(resolution,[],[f471,f27]) ).
fof(f494,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,X1)) )
| ~ spl1_8
| ~ spl1_9
| ~ spl1_10
| ~ spl1_14 ),
inference(duplicate_literal_removal,[],[f479]) ).
fof(f496,definition,
( spl1_16
<=> ! [X1] : is_a_theorem(equivalent(X1,X1)) ),
introduced(definition,[new_symbols(definition,[spl1_16])],[avatar_definition]) ).
fof(f497,plain,
( ! [X1] : is_a_theorem(equivalent(X1,X1))
| ~ spl1_16 ),
inference(avatar_component_clause,[],[f496]) ).
fof(f498,plain,
( spl1_16
| spl1_11
| ~ spl1_8
| ~ spl1_9
| ~ spl1_10
| ~ spl1_14 ),
inference(avatar_split_clause,[],[f494,f245,f175,f121,f87,f234,f496]) ).
fof(f516,plain,
( is_a_theorem(sF0)
| ~ spl1_16 ),
inference(superposition,[],[f497,f5]) ).
fof(f517,plain,
( $false
| ~ spl1_16 ),
inference(forward_subsumption_resolution,[],[f516,f6]) ).
fof(f518,plain,
~ spl1_16,
inference(avatar_contradiction_clause,[],[f517]) ).
cnf(s4,plain,
( spl1_7
| spl1_8 ),
inference(sat_conversion,[],[f89]) ).
cnf(s5,plain,
~ spl1_7,
inference(sat_conversion,[],[f105]) ).
cnf(s6,plain,
( spl1_7
| ~ spl1_8
| spl1_9 ),
inference(sat_conversion,[],[f123]) ).
cnf(s8,plain,
( spl1_7
| spl1_10 ),
inference(sat_conversion,[],[f177]) ).
cnf(s11,plain,
( ~ spl1_9
| ~ spl1_10
| spl1_11
| spl1_14 ),
inference(sat_conversion,[],[f247]) ).
cnf(s14,plain,
~ spl1_11,
inference(sat_conversion,[],[f261]) ).
cnf(s16,plain,
( ~ spl1_8
| ~ spl1_9
| ~ spl1_10
| spl1_11
| ~ spl1_14
| spl1_16 ),
inference(sat_conversion,[],[f498]) ).
cnf(s17,plain,
~ spl1_16,
inference(sat_conversion,[],[f518]) ).
cnf(s18,plain,
( ~ spl1_8
| ~ spl1_9
| ~ spl1_10
| spl1_11
| ~ spl1_14 ),
inference(rat,[],[s16,s17]) ).
cnf(s19,plain,
( ~ spl1_9
| ~ spl1_10
| spl1_14 ),
inference(rat,[],[s11,s14]) ).
cnf(s22,plain,
spl1_10,
inference(rat,[],[s8,s5]) ).
cnf(s23,plain,
spl1_8,
inference(rat,[],[s4,s5]) ).
cnf(s24,plain,
spl1_9,
inference(rat,[],[s6,s5,s23]) ).
cnf(s25,plain,
~ spl1_14,
inference(rat,[],[s18,s23,s14,s22,s24]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s19,s22,s25,s24]) ).
fof(f519,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n009.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 15:41:00 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.49/1.77 % (2195226)Input is clausal, will run a generic CNF schedule.
% 4.49/1.77 % (2195334)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1947031930:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.49/1.77 % (2195335)lrs+10_1_sil=8000:sp=occurrence:random_seed=2368860180:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.49/1.77 % (2195332)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=4159674823:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.49/1.77 % (2195333)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4128807946:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.49/1.77 % (2195336)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=535916709:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.49/1.77 % (2195338)dis-21_1_sil=8000:lcm=predicate:random_seed=1925338867: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.49/1.77 % (2195337)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=719090042:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.49/1.77 % (2195335)Instruction limit reached!
% 4.49/1.77 % (2195335)------------------------------
% 4.49/1.77 % (2195335)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.77 % (2195335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.77 % (2195335)CaDiCaL version: 2.1.3
% 4.49/1.77 % (2195335)Termination reason: Instruction limit
% 4.49/1.77 % (2195335)Termination phase: Saturation
% 4.49/1.77 % (2195335)Time elapsed: 0.071 s
% 4.49/1.77 % (2195335)Peak memory usage: 88 MB
% 4.49/1.77 % (2195335)Instructions burned: 108 (million)
% 4.49/1.77 % (2195336)Instruction limit reached!
% 4.49/1.77 % (2195336)------------------------------
% 4.49/1.77 % (2195336)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.77 % (2195336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.77 % (2195336)CaDiCaL version: 2.1.3
% 4.49/1.77 % (2195336)Termination reason: Instruction limit
% 4.49/1.77 % (2195336)Termination phase: Saturation
% 4.49/1.77 % (2195336)Time elapsed: 0.088 s
% 4.49/1.77 % (2195336)Peak memory usage: 88 MB
% 4.49/1.77 % (2195336)Instructions burned: 114 (million)
% 4.49/1.77 % (2195338)Instruction limit reached!
% 4.49/1.77 % (2195338)------------------------------
% 4.49/1.77 % (2195338)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.77 % (2195338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.77 % (2195338)CaDiCaL version: 2.1.3
% 4.49/1.77 % (2195338)Termination reason: Instruction limit
% 4.49/1.77 % (2195338)Termination phase: Saturation
% 4.49/1.77 % (2195338)Time elapsed: 0.112 s
% 4.49/1.77 % (2195338)Peak memory usage: 88 MB
% 4.49/1.77 % (2195338)Instructions burned: 117 (million)
% 4.49/1.77 % (2195337)Instruction limit reached!
% 4.49/1.77 % (2195337)------------------------------
% 4.49/1.77 % (2195337)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.77 % (2195337)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.77 % (2195337)CaDiCaL version: 2.1.3
% 4.49/1.77 % (2195337)Termination reason: Instruction limit
% 4.49/1.77 % (2195337)Termination phase: Saturation
% 4.49/1.77 % (2195337)Time elapsed: 0.169 s
% 4.49/1.77 % (2195337)Peak memory usage: 89 MB
% 4.49/1.77 % (2195337)Instructions burned: 181 (million)
% 4.49/1.77 % (2195371)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=81235375:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.49/1.77 % (2195374)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3268043996: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.49/1.77 % (2195371)Refutation not found, incomplete strategy
% 4.49/1.77 % (2195371)------------------------------
% 4.49/1.77 % (2195371)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.77 % (2195371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.77 % (2195371)CaDiCaL version: 2.1.3
% 4.49/1.77 % (2195371)Termination reason: Refutation not found, incomplete strategy
% 4.49/1.77 % (2195371)Time elapsed: 0.001 s
% 4.49/1.77 % (2195371)Peak memory usage: 87 MB
% 4.49/1.77 % (2195376)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=312257373:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 4.49/1.77 % (2195376)Refutation not found, incomplete strategy
% 4.49/1.77 % (2195376)------------------------------
% 4.49/1.77 % (2195376)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.77 % (2195376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.77 % (2195376)CaDiCaL version: 2.1.3
% 4.49/1.77 % (2195376)Termination reason: Refutation not found, incomplete strategy
% 4.49/1.77 % (2195376)Time elapsed: 0.001 s
% 4.49/1.77 % (2195376)Peak memory usage: 87 MB
% 4.49/1.77 % (2195374)Instruction limit reached!
% 4.49/1.77 % (2195374)------------------------------
% 4.49/1.77 % (2195374)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.77 % (2195374)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.77 % (2195374)CaDiCaL version: 2.1.3
% 4.49/1.77 % (2195374)Termination reason: Instruction limit
% 4.49/1.77 % (2195374)Termination phase: Saturation
% 4.49/1.77 % (2195374)Time elapsed: 0.132 s
% 4.49/1.77 % (2195374)Peak memory usage: 87 MB
% 4.49/1.77 % (2195374)Instructions burned: 189 (million)
% 4.49/1.77 % (2195379)lrs+10_64_to=lpo:sil=8000:random_seed=3207561060:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 4.49/1.77 % (2195334)First to succeed.
% 4.49/1.77 % (2195334)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2195226"
% 4.49/1.77 % (2195379)Also succeeded, but the first one will report.
% 4.49/1.77 % (2195371)------------------------------
% 4.49/1.77 % (2195371)------------------------------
% 4.49/1.77 % (2195334)Refutation found. Thanks to Tanya!
% 4.49/1.77 % SZS status Unsatisfiable for theBenchmark
% 4.49/1.77 % SZS output start Proof for theBenchmark
% See solution above
% 7.06/2.07 % (2195334)------------------------------
% 7.06/2.07 % (2195334)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.06/2.07 % (2195334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.06/2.07 % (2195334)CaDiCaL version: 2.1.3
% 7.06/2.07 % (2195334)Termination reason: Refutation
% 7.06/2.07 % (2195334)Time elapsed: 0.527 s
% 7.06/2.07 % (2195334)Peak memory usage: 129 MB
% 7.06/2.07 % (2195334)Instructions burned: 997 (million)
% 7.06/2.07 % (2195334)------------------------------
% 7.06/2.07 % (2195334)------------------------------
% 7.06/2.07 % (2195226)Success in time 0.904 s
% 7.06/2.07 % Vampire exiting
%------------------------------------------------------------------------------