%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET097-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:40:06 PM UTC 2026
% Result : Unsatisfiable 3.08s 1.33s
% Output : Refutation 4.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 24
% Syntax : Number of formulae : 78 ( 24 unt; 5 def)
% Number of atoms : 174 ( 26 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 193 ( 97 ~; 92 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn 85 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( member(not_subclass_element(X0,X1),X0)
| subclass(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_subclass_members1) ).
fof(f3,axiom,
! [X0,X1] :
( ~ member(not_subclass_element(X0,X1),X1)
| subclass(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_subclass_members2) ).
fof(f7,axiom,
! [X0,X1] :
( ~ subclass(X1,X0)
| ~ subclass(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_implies_equal) ).
fof(f11,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pairs_in_universal) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set) ).
fof(f13,axiom,
! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair) ).
fof(f16,axiom,
! [X2,X3,X0,X1] :
( ~ member(X0,X1)
| ~ member(X2,X3)
| member(ordered_pair(X0,X2),cross_product(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartesian_product3) ).
fof(f23,axiom,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection3) ).
fof(f25,axiom,
! [X0,X1] :
( member(X0,complement(X1))
| ~ member(X0,universal_class)
| member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement2) ).
fof(f104,axiom,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_2_to_cartesian_product) ).
fof(f107,axiom,
! [X0,X1] :
( member(not_subclass_element(X1,X0),X1)
| member(not_subclass_element(X0,X1),X0)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality1) ).
fof(f113,axiom,
! [X0] : ~ member(X0,null_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_null_class) ).
fof(f115,axiom,
! [X0] :
( ~ subclass(X0,null_class)
| X0 = null_class ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_of_null_class_is_subclass) ).
fof(f116,plain,
! [X0] :
( ~ subclass(X0,null_class)
| null_class = X0 ),
inference(reorient_equations,[],[f115]) ).
fof(f117,axiom,
! [X0] :
( X0 = null_class
| member(not_subclass_element(X0,null_class),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',null_class_is_unique) ).
fof(f118,plain,
! [X0] :
( member(not_subclass_element(X0,null_class),X0)
| null_class = X0 ),
inference(reorient_equations,[],[f117]) ).
fof(f131,axiom,
! [X2,X0,X1] :
( subclass(unordered_pair(X0,X2),X1)
| ~ member(X2,X1)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_is_subset) ).
fof(f137,axiom,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',only_member_in_singleton) ).
fof(f156,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),intersection(complement(singleton(not_subclass_element(x,null_class))),x)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_number_of_elements_in_class_1) ).
fof(f157,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_number_of_elements_in_class_2) ).
fof(f158,plain,
x != singleton(not_subclass_element(x,null_class)),
inference(reorient_equations,[],[f157]) ).
fof(f159,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_number_of_elements_in_class_3) ).
fof(f160,plain,
null_class != x,
inference(reorient_equations,[],[f159]) ).
fof(f161,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f13,f12,f12]) ).
fof(f162,plain,
~ member(not_subclass_element(intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x),null_class),intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x)),
inference(definition_unfolding,[],[f156,f12,f12]) ).
fof(f163,plain,
x != unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)),
inference(definition_unfolding,[],[f158,f12]) ).
fof(f169,plain,
! [X0,X1] :
( ~ member(X0,unordered_pair(X1,X1))
| X0 = X1 ),
inference(definition_unfolding,[],[f137,f12]) ).
fof(f185,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3))
| member(X1,universal_class) ),
inference(definition_unfolding,[],[f104,f161]) ).
fof(f187,plain,
! [X2,X3,X0,X1] :
( member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X2,X2))),cross_product(X1,X3))
| ~ member(X2,X3)
| ~ member(X0,X1) ),
inference(definition_unfolding,[],[f16,f161]) ).
fof(f190,definition,
~ sP0(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),
introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).
fof(f191,plain,
sP0(x),
inference(inequality_splitting,[],[f163,f190]) ).
fof(f202,plain,
subclass(intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x),null_class),
inference(resolution,[],[f2,f162]) ).
fof(f206,plain,
null_class = intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x),
inference(resolution,[],[f202,f116]) ).
fof(f489,plain,
! [X0] :
( member(X0,null_class)
| ~ member(X0,x)
| ~ member(X0,complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)))) ),
inference(superposition,[],[f23,f206]) ).
fof(f495,plain,
! [X0] :
( ~ member(X0,complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))))
| ~ member(X0,x) ),
inference(forward_subsumption_resolution,[],[f489,f113]) ).
fof(f610,plain,
! [X2,X0,X1] :
( ~ subclass(X1,unordered_pair(X2,X0))
| ~ member(X2,X1)
| ~ member(X0,X1)
| unordered_pair(X2,X0) = X1 ),
inference(resolution,[],[f131,f7]) ).
fof(f1081,plain,
! [X2,X3,X0,X1] :
( ~ member(X0,X1)
| ~ member(X2,X3)
| member(X0,universal_class) ),
inference(resolution,[],[f187,f185]) ).
fof(f1112,definition,
( spl1_27
<=> ! [X2,X3] :
( ~ member(X2,X3)
| member(X2,universal_class) ) ),
introduced(definition,[new_symbols(definition,[spl1_27])],[avatar_definition]) ).
fof(f1113,plain,
( ! [X2,X3] :
( member(X2,universal_class)
| ~ member(X2,X3) )
| ~ spl1_27 ),
inference(avatar_component_clause,[],[f1112]) ).
fof(f1115,definition,
( spl1_28
<=> ! [X0,X1] : ~ member(X0,X1) ),
introduced(definition,[new_symbols(definition,[spl1_28])],[avatar_definition]) ).
fof(f1116,plain,
( ! [X0,X1] : ~ member(X0,X1)
| ~ spl1_28 ),
inference(avatar_component_clause,[],[f1115]) ).
fof(f1118,plain,
( spl1_28
| spl1_27 ),
inference(avatar_split_clause,[],[f1081,f1112,f1115]) ).
fof(f2257,plain,
! [X0] :
( ~ member(X0,x)
| ~ member(X0,universal_class)
| member(X0,unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))) ),
inference(resolution,[],[f495,f25]) ).
fof(f2283,plain,
( ! [X0] :
( member(X0,unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)))
| ~ member(X0,x) )
| ~ spl1_27 ),
inference(forward_subsumption_resolution,[],[f2257,f1113]) ).
fof(f2316,plain,
( ! [X0] :
( not_subclass_element(x,null_class) = X0
| ~ member(X0,x) )
| ~ spl1_27 ),
inference(resolution,[],[f2283,f169]) ).
fof(f2351,plain,
( ! [X0,X1] :
( ~ member(X1,x)
| X0 = X1
| ~ member(X0,x) )
| ~ spl1_27 ),
inference(superposition,[],[f2316,f2316]) ).
fof(f2366,plain,
( ! [X0,X1] :
( member(X1,unordered_pair(X0,X0))
| ~ member(X1,x)
| ~ member(X0,x) )
| ~ spl1_27 ),
inference(superposition,[],[f2283,f2316]) ).
fof(f2438,plain,
( ! [X0,X1] :
( not_subclass_element(x,X1) = X0
| ~ member(X0,x)
| subclass(x,X1) )
| ~ spl1_27 ),
inference(resolution,[],[f2351,f2]) ).
fof(f2613,plain,
( ! [X0,X1] :
( ~ member(X0,X1)
| subclass(x,X1)
| ~ member(X0,x)
| subclass(x,X1) )
| ~ spl1_27 ),
inference(superposition,[],[f3,f2438]) ).
fof(f2643,plain,
( ! [X0,X1] :
( ~ member(X0,x)
| subclass(x,X1)
| ~ member(X0,X1) )
| ~ spl1_27 ),
inference(duplicate_literal_removal,[],[f2613]) ).
fof(f2705,plain,
( ! [X0] :
( subclass(x,X0)
| ~ member(not_subclass_element(x,null_class),X0)
| null_class = x )
| ~ spl1_27 ),
inference(resolution,[],[f2643,f118]) ).
fof(f2715,plain,
( ! [X0] :
( ~ member(not_subclass_element(x,null_class),X0)
| subclass(x,X0) )
| ~ spl1_27 ),
inference(forward_subsumption_resolution,[],[f2705,f160]) ).
fof(f2743,plain,
( ! [X0] :
( subclass(x,unordered_pair(X0,X0))
| ~ member(not_subclass_element(x,null_class),x)
| ~ member(X0,x) )
| ~ spl1_27 ),
inference(resolution,[],[f2715,f2366]) ).
fof(f2753,definition,
( spl1_57
<=> member(not_subclass_element(x,null_class),x) ),
introduced(definition,[new_symbols(definition,[spl1_57])],[avatar_definition]) ).
fof(f2754,plain,
( ~ member(not_subclass_element(x,null_class),x)
| spl1_57 ),
inference(avatar_component_clause,[],[f2753]) ).
fof(f2760,definition,
( spl1_59
<=> ! [X0] :
( subclass(x,unordered_pair(X0,X0))
| ~ member(X0,x) ) ),
introduced(definition,[new_symbols(definition,[spl1_59])],[avatar_definition]) ).
fof(f2761,plain,
( ! [X0] :
( subclass(x,unordered_pair(X0,X0))
| ~ member(X0,x) )
| ~ spl1_59 ),
inference(avatar_component_clause,[],[f2760]) ).
fof(f2762,plain,
( ~ spl1_57
| spl1_59
| ~ spl1_27 ),
inference(avatar_split_clause,[],[f2743,f1112,f2760,f2753]) ).
fof(f2794,plain,
( $false
| ~ spl1_28 ),
inference(resolution,[],[f1116,f11]) ).
fof(f2812,plain,
~ spl1_28,
inference(avatar_contradiction_clause,[],[f2794]) ).
fof(f2819,plain,
( member(not_subclass_element(null_class,x),null_class)
| null_class = x
| spl1_57 ),
inference(resolution,[],[f2754,f107]) ).
fof(f2825,plain,
( null_class = x
| spl1_57 ),
inference(forward_subsumption_resolution,[],[f2819,f113]) ).
fof(f2829,plain,
( $false
| spl1_57 ),
inference(forward_subsumption_resolution,[],[f2825,f160]) ).
fof(f2830,plain,
spl1_57,
inference(avatar_contradiction_clause,[],[f2829]) ).
fof(f2899,plain,
( ! [X0] :
( ~ member(X0,x)
| ~ member(X0,x)
| ~ member(X0,x)
| unordered_pair(X0,X0) = x )
| ~ spl1_59 ),
inference(resolution,[],[f2761,f610]) ).
fof(f2910,plain,
( ! [X0] :
( unordered_pair(X0,X0) = x
| ~ member(X0,x) )
| ~ spl1_59 ),
inference(duplicate_literal_removal,[],[f2899]) ).
fof(f3008,plain,
( ~ sP0(x)
| ~ member(not_subclass_element(x,null_class),x)
| ~ spl1_59 ),
inference(superposition,[],[f190,f2910]) ).
fof(f3123,plain,
( ~ member(not_subclass_element(x,null_class),x)
| ~ spl1_59 ),
inference(forward_subsumption_resolution,[],[f3008,f191]) ).
fof(f3173,plain,
( ~ spl1_57
| ~ spl1_59 ),
inference(avatar_split_clause,[],[f3123,f2760,f2753]) ).
cnf(s48,plain,
( spl1_27
| spl1_28 ),
inference(sat_conversion,[],[f1118]) ).
cnf(s89,plain,
( ~ spl1_27
| ~ spl1_57
| spl1_59 ),
inference(sat_conversion,[],[f2762]) ).
cnf(s97,plain,
~ spl1_28,
inference(sat_conversion,[],[f2812]) ).
cnf(s102,plain,
spl1_57,
inference(sat_conversion,[],[f2830]) ).
cnf(s125,plain,
( ~ spl1_57
| ~ spl1_59 ),
inference(sat_conversion,[],[f3173]) ).
cnf(s126,plain,
~ spl1_59,
inference(rat,[],[s125,s102]) ).
cnf(s129,plain,
~ spl1_27,
inference(rat,[],[s89,s126,s102]) ).
cnf(s130,plain,
$false,
inference(rat,[],[s48,s97,s129]) ).
fof(f3174,plain,
$false,
inference(avatar_sat_refutation,[],[s130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET097-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 00:35:51 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 3.08/1.33 % (3112078)Input is clausal, will run a generic CNF schedule.
% 3.08/1.33 % (3112089)dis-21_1_sil=8000:lcm=predicate:random_seed=3890267102: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)
% 3.08/1.33 % (3112084)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2835756158:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.08/1.33 % (3112083)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=3474418077:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.08/1.33 % (3112086)lrs+10_1_sil=8000:sp=occurrence:random_seed=2444584801:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.08/1.33 % (3112085)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=165751588:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.08/1.33 % (3112088)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3561426268:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.08/1.33 % (3112087)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2404196003:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.08/1.33 % (3112089)Instruction limit reached!
% 3.08/1.33 % (3112089)------------------------------
% 3.08/1.33 % (3112089)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.08/1.33 % (3112089)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.08/1.33 % (3112089)CaDiCaL version: 2.1.3
% 3.08/1.33 % (3112089)Termination reason: Instruction limit
% 3.08/1.33 % (3112089)Termination phase: Saturation
% 3.08/1.33 % (3112089)Time elapsed: 0.041 s
% 3.08/1.33 % (3112089)Peak memory usage: 89 MB
% 3.08/1.33 % (3112089)Instructions burned: 119 (million)
% 3.08/1.33 % (3112086)Instruction limit reached!
% 3.08/1.33 % (3112086)------------------------------
% 3.08/1.33 % (3112086)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.08/1.33 % (3112086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.08/1.33 % (3112086)CaDiCaL version: 2.1.3
% 3.08/1.33 % (3112086)Termination reason: Instruction limit
% 3.08/1.33 % (3112086)Termination phase: Saturation
% 3.08/1.33 % (3112086)Time elapsed: 0.074 s
% 3.08/1.33 % (3112086)Peak memory usage: 89 MB
% 3.08/1.33 % (3112086)Instructions burned: 108 (million)
% 3.08/1.33 % (3112087)First to succeed.
% 3.08/1.33 % (3112087)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3112078"
% 3.08/1.33 % (3112097)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=3877229162:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.08/1.33 % (3112088)Instruction limit reached!
% 3.08/1.33 % (3112088)------------------------------
% 3.08/1.33 % (3112088)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.08/1.33 % (3112088)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.08/1.33 % (3112088)CaDiCaL version: 2.1.3
% 3.08/1.33 % (3112088)Termination reason: Instruction limit
% 3.08/1.33 % (3112088)Termination phase: Saturation
% 3.08/1.33 % (3112088)Time elapsed: 0.133 s
% 3.08/1.33 % (3112088)Peak memory usage: 90 MB
% 3.08/1.33 % (3112088)Instructions burned: 180 (million)
% 3.08/1.33 % (3112097)Instruction limit reached!
% 3.08/1.33 % (3112097)------------------------------
% 3.08/1.33 % (3112097)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.08/1.33 % (3112097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.08/1.33 % (3112097)CaDiCaL version: 2.1.3
% 3.08/1.33 % (3112097)Termination reason: Instruction limit
% 3.08/1.33 % (3112097)Termination phase: Saturation
% 3.08/1.33 % (3112097)Time elapsed: 0.053 s
% 3.08/1.33 % (3112097)Peak memory usage: 89 MB
% 3.08/1.33 % (3112097)Instructions burned: 144 (million)
% 3.08/1.33 % (3112098)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3152512138: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)
% 3.08/1.33 % (3112100)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=113981222:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.08/1.33 % (3112101)lrs+10_64_to=lpo:sil=8000:random_seed=1589673135:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 3.08/1.33 % (3112101)Instruction limit reached!
% 3.08/1.33 % (3112101)------------------------------
% 3.08/1.33 % (3112101)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.08/1.33 % (3112101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.08/1.33 % (3112101)CaDiCaL version: 2.1.3
% 3.08/1.33 % (3112101)Termination reason: Instruction limit
% 3.08/1.33 % (3112101)Termination phase: Saturation
% 3.08/1.33 % (3112101)Time elapsed: 0.045 s
% 3.08/1.33 % (3112101)Peak memory usage: 89 MB
% 3.08/1.33 % (3112101)Instructions burned: 126 (million)
% 3.08/1.33 % (3112098)Instruction limit reached!
% 3.08/1.33 % (3112098)------------------------------
% 3.08/1.33 % (3112098)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.08/1.33 % (3112098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.08/1.33 % (3112098)CaDiCaL version: 2.1.3
% 3.08/1.33 % (3112098)Termination reason: Instruction limit
% 3.08/1.33 % (3112098)Termination phase: Saturation
% 3.08/1.33 % (3112098)Time elapsed: 0.109 s
% 3.08/1.33 % (3112098)Peak memory usage: 91 MB
% 3.08/1.33 % (3112098)Instructions burned: 189 (million)
% 3.08/1.33 % (3112087)Refutation found. Thanks to Tanya!
% 3.08/1.33 % SZS status Unsatisfiable for theBenchmark
% 3.08/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 4.03/1.52 % (3112087)------------------------------
% 4.03/1.52 % (3112087)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.03/1.52 % (3112087)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.03/1.52 % (3112087)CaDiCaL version: 2.1.3
% 4.03/1.52 % (3112087)Termination reason: Refutation
% 4.03/1.52 % (3112087)Time elapsed: 0.080 s
% 4.03/1.52 % (3112087)Peak memory usage: 90 MB
% 4.03/1.52 % (3112087)Instructions burned: 114 (million)
% 4.03/1.52 % (3112087)------------------------------
% 4.03/1.52 % (3112087)------------------------------
% 4.03/1.52 % (3112078)Success in time 0.49 s
% 4.03/1.52 % Vampire exiting
%------------------------------------------------------------------------------