%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET021-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 12:39:37 PM UTC 2026
% Result : Unsatisfiable 5.09s 1.76s
% Output : Refutation 6.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 20
% Syntax : Number of formulae : 77 ( 28 unt; 7 def)
% Number of atoms : 170 ( 47 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 185 ( 92 ~; 90 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( member(f1(X0,X1),X1)
| member(f1(X0,X1),X0)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality2) ).
fof(f4,axiom,
! [X0,X1] :
( ~ member(f1(X0,X1),X1)
| ~ member(f1(X0,X1),X0)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality3) ).
fof(f9,axiom,
! [X0] : singleton_set(X0) = non_ordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set) ).
fof(f10,axiom,
! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(singleton_set(X0),non_ordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair) ).
fof(f24,axiom,
! [X0,X1] :
( ~ member(X0,second(X1))
| little_set(f6(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',second1) ).
fof(f25,axiom,
! [X0,X1] :
( ~ member(X0,second(X1))
| little_set(f7(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',second2) ).
fof(f26,axiom,
! [X0,X1] :
( ~ member(X0,second(X1))
| X1 = ordered_pair(f6(X0,X1),f7(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',second3) ).
fof(f27,plain,
! [X0,X1] :
( ~ member(X0,second(X1))
| ordered_pair(f6(X0,X1),f7(X0,X1)) = X1 ),
inference(reorient_equations,[],[f26]) ).
fof(f28,axiom,
! [X0,X1] :
( member(X0,f7(X0,X1))
| ~ member(X0,second(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',second4) ).
fof(f29,axiom,
! [X2,X3,X0,X1] :
( member(X0,second(X1))
| ~ little_set(X2)
| ~ little_set(X3)
| X1 != ordered_pair(X2,X3)
| ~ member(X0,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',second5) ).
fof(f30,plain,
! [X2,X3,X0,X1] :
( member(X0,second(X1))
| ~ little_set(X2)
| ~ little_set(X3)
| ordered_pair(X2,X3) != X1
| ~ member(X0,X3) ),
inference(reorient_equations,[],[f29]) ).
fof(f165,axiom,
! [X2,X3,X0,X1] :
( ~ little_set(X0)
| ~ little_set(X1)
| ~ little_set(X2)
| ~ little_set(X3)
| ordered_pair(X0,X1) != ordered_pair(X2,X3)
| X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',second_components_are_equal) ).
fof(f168,axiom,
little_set(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_little_set) ).
fof(f169,axiom,
little_set(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_little_set) ).
fof(f170,negated_conjecture,
second(ordered_pair(a,b)) != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_second_is_second) ).
fof(f171,plain,
b != second(ordered_pair(a,b)),
inference(reorient_equations,[],[f170]) ).
fof(f173,plain,
! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)),
inference(definition_unfolding,[],[f10,f9]) ).
fof(f179,plain,
! [X0,X1] :
( ~ member(X0,second(X1))
| non_ordered_pair(non_ordered_pair(f6(X0,X1),f6(X0,X1)),non_ordered_pair(f6(X0,X1),f7(X0,X1))) = X1 ),
inference(definition_unfolding,[],[f27,f173]) ).
fof(f180,plain,
! [X2,X3,X0,X1] :
( member(X0,second(X1))
| ~ little_set(X2)
| ~ little_set(X3)
| non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3)) != X1
| ~ member(X0,X3) ),
inference(definition_unfolding,[],[f30,f173]) ).
fof(f201,plain,
! [X2,X3,X0,X1] :
( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3))
| ~ little_set(X1)
| ~ little_set(X2)
| ~ little_set(X3)
| ~ little_set(X0)
| X1 = X3 ),
inference(definition_unfolding,[],[f165,f173,f173]) ).
fof(f203,plain,
b != second(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),
inference(definition_unfolding,[],[f171,f173]) ).
fof(f208,plain,
! [X2,X3,X0] :
( member(X0,second(non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3))))
| ~ little_set(X2)
| ~ little_set(X3)
| ~ member(X0,X3) ),
inference(equality_resolution,[],[f180]) ).
fof(f218,definition,
sF0 = non_ordered_pair(a,a),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f219,plain,
non_ordered_pair(a,a) = sF0,
inference(reorient_equations,[],[f218]) ).
fof(f220,definition,
sF1 = non_ordered_pair(a,b),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f221,plain,
non_ordered_pair(a,b) = sF1,
inference(reorient_equations,[],[f220]) ).
fof(f222,definition,
sF2 = non_ordered_pair(sF0,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f223,plain,
non_ordered_pair(sF0,sF1) = sF2,
inference(reorient_equations,[],[f222]) ).
fof(f224,definition,
sF3 = second(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f225,plain,
second(sF2) = sF3,
inference(reorient_equations,[],[f224]) ).
fof(f226,plain,
b != sF3,
inference(definition_folding,[],[f203,f225,f223,f221,f219]) ).
fof(f233,plain,
! [X0,X1] :
( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(non_ordered_pair(a,a),sF1)
| ~ little_set(X1)
| ~ little_set(a)
| ~ little_set(b)
| ~ little_set(X0)
| b = X1 ),
inference(superposition,[],[f201,f221]) ).
fof(f251,plain,
! [X0,X1] :
( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(non_ordered_pair(a,a),sF1)
| ~ little_set(X1)
| ~ little_set(b)
| ~ little_set(X0)
| b = X1 ),
inference(forward_subsumption_resolution,[],[f233,f168]) ).
fof(f258,plain,
! [X0,X1] :
( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(non_ordered_pair(a,a),sF1)
| ~ little_set(X1)
| ~ little_set(X0)
| b = X1 ),
inference(forward_subsumption_resolution,[],[f251,f169]) ).
fof(f260,plain,
! [X0,X1] :
( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(sF0,sF1)
| ~ little_set(X1)
| ~ little_set(X0)
| b = X1 ),
inference(forward_demodulation,[],[f258,f219]) ).
fof(f262,plain,
! [X0,X1] :
( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != sF2
| ~ little_set(X1)
| ~ little_set(X0)
| b = X1 ),
inference(forward_demodulation,[],[f260,f223]) ).
fof(f315,plain,
! [X0] :
( member(X0,second(non_ordered_pair(non_ordered_pair(a,a),sF1)))
| ~ little_set(a)
| ~ little_set(b)
| ~ member(X0,b) ),
inference(superposition,[],[f208,f221]) ).
fof(f318,plain,
! [X0] :
( member(X0,second(non_ordered_pair(non_ordered_pair(a,a),sF1)))
| ~ little_set(b)
| ~ member(X0,b) ),
inference(forward_subsumption_resolution,[],[f315,f168]) ).
fof(f321,plain,
! [X0] :
( member(X0,second(non_ordered_pair(non_ordered_pair(a,a),sF1)))
| ~ member(X0,b) ),
inference(forward_subsumption_resolution,[],[f318,f169]) ).
fof(f322,plain,
! [X0] :
( member(X0,second(non_ordered_pair(sF0,sF1)))
| ~ member(X0,b) ),
inference(forward_demodulation,[],[f321,f219]) ).
fof(f323,plain,
! [X0] :
( member(X0,second(sF2))
| ~ member(X0,b) ),
inference(forward_demodulation,[],[f322,f223]) ).
fof(f324,plain,
! [X0] :
( ~ member(X0,b)
| member(X0,sF3) ),
inference(forward_demodulation,[],[f323,f225]) ).
fof(f326,plain,
! [X0] :
( ~ member(X0,sF3)
| sF2 = non_ordered_pair(non_ordered_pair(f6(X0,sF2),f6(X0,sF2)),non_ordered_pair(f6(X0,sF2),f7(X0,sF2))) ),
inference(superposition,[],[f179,f225]) ).
fof(f397,plain,
! [X0] :
( little_set(f7(X0,sF2))
| ~ member(X0,sF3) ),
inference(superposition,[],[f25,f225]) ).
fof(f408,plain,
! [X0] :
( little_set(f6(X0,sF2))
| ~ member(X0,sF3) ),
inference(superposition,[],[f24,f225]) ).
fof(f470,plain,
! [X0] :
( member(f1(b,X0),sF3)
| member(f1(b,X0),X0)
| b = X0 ),
inference(resolution,[],[f3,f324]) ).
fof(f485,plain,
( member(f1(b,sF3),sF3)
| b = sF3 ),
inference(factoring,[],[f470]) ).
fof(f487,plain,
member(f1(b,sF3),sF3),
inference(forward_subsumption_resolution,[],[f485,f226]) ).
fof(f488,plain,
( ~ member(f1(b,sF3),b)
| b = sF3 ),
inference(resolution,[],[f487,f4]) ).
fof(f489,plain,
sF2 = non_ordered_pair(non_ordered_pair(f6(f1(b,sF3),sF2),f6(f1(b,sF3),sF2)),non_ordered_pair(f6(f1(b,sF3),sF2),f7(f1(b,sF3),sF2))),
inference(resolution,[],[f487,f326]) ).
fof(f491,plain,
~ member(f1(b,sF3),b),
inference(forward_subsumption_resolution,[],[f488,f226]) ).
fof(f499,plain,
( sF2 != sF2
| ~ little_set(f7(f1(b,sF3),sF2))
| ~ little_set(f6(f1(b,sF3),sF2))
| b = f7(f1(b,sF3),sF2) ),
inference(superposition,[],[f262,f489]) ).
fof(f517,plain,
( ~ little_set(f7(f1(b,sF3),sF2))
| ~ little_set(f6(f1(b,sF3),sF2))
| b = f7(f1(b,sF3),sF2) ),
inference(trivial_inequality_removal,[],[f499]) ).
fof(f536,definition,
( spl4_14
<=> little_set(f6(f1(b,sF3),sF2)) ),
introduced(definition,[new_symbols(definition,[spl4_14])],[avatar_definition]) ).
fof(f538,plain,
( ~ little_set(f6(f1(b,sF3),sF2))
| spl4_14 ),
inference(avatar_component_clause,[],[f536]) ).
fof(f541,definition,
( spl4_15
<=> b = f7(f1(b,sF3),sF2) ),
introduced(definition,[new_symbols(definition,[spl4_15])],[avatar_definition]) ).
fof(f543,plain,
( b = f7(f1(b,sF3),sF2)
| ~ spl4_15 ),
inference(avatar_component_clause,[],[f541]) ).
fof(f545,definition,
( spl4_16
<=> little_set(f7(f1(b,sF3),sF2)) ),
introduced(definition,[new_symbols(definition,[spl4_16])],[avatar_definition]) ).
fof(f547,plain,
( ~ little_set(f7(f1(b,sF3),sF2))
| spl4_16 ),
inference(avatar_component_clause,[],[f545]) ).
fof(f548,plain,
( spl4_15
| ~ spl4_14
| ~ spl4_16 ),
inference(avatar_split_clause,[],[f517,f545,f536,f541]) ).
fof(f597,plain,
( ~ member(f1(b,sF3),sF3)
| spl4_14 ),
inference(resolution,[],[f538,f408]) ).
fof(f598,plain,
( $false
| spl4_14 ),
inference(forward_subsumption_resolution,[],[f597,f487]) ).
fof(f599,plain,
spl4_14,
inference(avatar_contradiction_clause,[],[f598]) ).
fof(f605,plain,
( ~ member(f1(b,sF3),sF3)
| spl4_16 ),
inference(resolution,[],[f547,f397]) ).
fof(f606,plain,
( $false
| spl4_16 ),
inference(forward_subsumption_resolution,[],[f605,f487]) ).
fof(f607,plain,
spl4_16,
inference(avatar_contradiction_clause,[],[f606]) ).
fof(f614,plain,
( member(f1(b,sF3),b)
| ~ member(f1(b,sF3),second(sF2))
| ~ spl4_15 ),
inference(superposition,[],[f28,f543]) ).
fof(f615,plain,
( ~ member(f1(b,sF3),second(sF2))
| ~ spl4_15 ),
inference(forward_subsumption_resolution,[],[f614,f491]) ).
fof(f617,plain,
( ~ member(f1(b,sF3),sF3)
| ~ spl4_15 ),
inference(forward_demodulation,[],[f615,f225]) ).
fof(f619,plain,
( $false
| ~ spl4_15 ),
inference(forward_subsumption_resolution,[],[f617,f487]) ).
fof(f620,plain,
~ spl4_15,
inference(avatar_contradiction_clause,[],[f619]) ).
cnf(s13,plain,
( ~ spl4_14
| spl4_15
| ~ spl4_16 ),
inference(sat_conversion,[],[f548]) ).
cnf(s23,plain,
spl4_14,
inference(sat_conversion,[],[f599]) ).
cnf(s24,plain,
spl4_16,
inference(sat_conversion,[],[f607]) ).
cnf(s25,plain,
~ spl4_15,
inference(sat_conversion,[],[f620]) ).
cnf(s30,plain,
$false,
inference(rat,[],[s13,s24,s25,s23]) ).
fof(f622,plain,
$false,
inference(avatar_sat_refutation,[],[s30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET021-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n013.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 28 00:08:51 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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
% 5.09/1.75 % (684686)Input is clausal, will run a generic CNF schedule.
% 5.09/1.75 % (684766)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=4050881705:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 5.09/1.75 % (684769)lrs+10_1_sil=8000:sp=occurrence:random_seed=3841253762:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 5.09/1.75 % (684769)Refutation not found, incomplete strategy
% 5.09/1.75 % (684769)------------------------------
% 5.09/1.75 % (684769)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.09/1.75 % (684769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.09/1.75 % (684769)CaDiCaL version: 2.1.3
% 5.09/1.75 % (684769)Termination reason: Refutation not found, incomplete strategy
% 5.09/1.75 % (684769)Time elapsed: 0.002 s
% 5.09/1.75 % (684769)Peak memory usage: 88 MB
% 5.09/1.75 % (684769)Instructions burned: 1 (million)
% 5.09/1.75 % (684768)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2428281186:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 5.09/1.75 % (684767)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=746527214:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 5.09/1.75 % (684771)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1537445292:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 5.09/1.75 % (684770)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1820261946:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 5.09/1.75 % (684770)Refutation not found, incomplete strategy
% 5.09/1.75 % (684770)------------------------------
% 5.09/1.75 % (684770)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.09/1.75 % (684770)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.09/1.75 % (684770)CaDiCaL version: 2.1.3
% 5.09/1.75 % (684770)Termination reason: Refutation not found, incomplete strategy
% 5.09/1.75 % (684770)Time elapsed: 0.003 s
% 5.09/1.75 % (684770)Peak memory usage: 88 MB
% 5.09/1.76 % (684770)Instructions burned: 1 (million)
% 5.09/1.76 % (684774)dis-21_1_sil=8000:lcm=predicate:random_seed=4008389330: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)
% 5.09/1.76 % (684774)Instruction limit reached!
% 5.09/1.76 % (684774)------------------------------
% 5.09/1.76 % (684774)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.09/1.76 % (684774)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.09/1.76 % (684774)CaDiCaL version: 2.1.3
% 5.09/1.76 % (684774)Termination reason: Instruction limit
% 5.09/1.76 % (684774)Termination phase: Saturation
% 5.09/1.76 % (684774)Time elapsed: 0.113 s
% 5.09/1.76 % (684774)Peak memory usage: 89 MB
% 5.09/1.76 % (684774)Instructions burned: 117 (million)
% 5.09/1.76 % (684771)Instruction limit reached!
% 5.09/1.76 % (684771)------------------------------
% 5.09/1.76 % (684771)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.09/1.76 % (684771)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.09/1.76 % (684771)CaDiCaL version: 2.1.3
% 5.09/1.76 % (684771)Termination reason: Instruction limit
% 5.09/1.76 % (684771)Termination phase: Saturation
% 5.09/1.76 % (684771)Time elapsed: 0.183 s
% 5.09/1.76 % (684771)Peak memory usage: 90 MB
% 5.09/1.76 % (684771)Instructions burned: 180 (million)
% 5.09/1.76 % (684769)------------------------------
% 5.09/1.76 % (684769)------------------------------
% 5.09/1.76 % (684830)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=4243210427:i=143:sd=2:aac=none:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/143Mi)
% 5.09/1.76 % (684830)Refutation not found, incomplete strategy
% 5.09/1.76 % (684830)------------------------------
% 5.09/1.76 % (684830)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.09/1.76 % (684830)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.09/1.76 % (684830)CaDiCaL version: 2.1.3
% 5.09/1.76 % (684830)Termination reason: Refutation not found, incomplete strategy
% 5.09/1.76 % (684830)Time elapsed: 0.002 s
% 5.09/1.76 % (684830)Peak memory usage: 88 MB
% 5.09/1.76 % (684770)------------------------------
% 5.09/1.76 % (684770)------------------------------
% 5.09/1.76 % (684766)First to succeed.
% 5.09/1.76 % (684766)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-684686"
% 5.09/1.76 % (684835)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=552438531:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2995 on theBenchmark for (2995ds/189Mi)
% 5.09/1.76 % (684844)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1316641313:st=4:i=219:sd=3:ss=axioms_2994 on theBenchmark for (2994ds/219Mi)
% 5.09/1.76 % (684844)Refutation not found, incomplete strategy
% 5.09/1.76 % (684844)------------------------------
% 5.09/1.76 % (684844)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.09/1.76 % (684844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.09/1.76 % (684844)CaDiCaL version: 2.1.3
% 5.09/1.76 % (684844)Termination reason: Refutation not found, incomplete strategy
% 5.09/1.76 % (684844)Time elapsed: 0.005 s
% 5.09/1.76 % (684844)Peak memory usage: 88 MB
% 5.09/1.76 % (684844)Instructions burned: 3 (million)
% 5.09/1.76 % (684766)Refutation found. Thanks to Tanya!
% 5.09/1.76 % SZS status Unsatisfiable for theBenchmark
% 5.09/1.76 % SZS output start Proof for theBenchmark
% See solution above
% 6.79/2.01 % (684766)------------------------------
% 6.79/2.01 % (684766)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.79/2.01 % (684766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.79/2.01 % (684766)CaDiCaL version: 2.1.3
% 6.79/2.01 % (684766)Termination reason: Refutation
% 6.79/2.01 % (684766)Time elapsed: 0.506 s
% 6.79/2.01 % (684766)Peak memory usage: 131 MB
% 6.79/2.01 % (684766)Instructions burned: 1024 (million)
% 6.79/2.01 % (684766)------------------------------
% 6.79/2.01 % (684766)------------------------------
% 6.79/2.01 % (684686)Success in time 0.875 s
% 6.79/2.01 % Vampire exiting
%------------------------------------------------------------------------------