%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET512-6 : 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 : n006.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:41:04 PM UTC 2026
% Result : Unsatisfiable 12.15s 2.64s
% Output : Refutation 13.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 34
% Syntax : Number of formulae : 177 ( 49 unt; 16 def)
% Number of atoms : 358 ( 116 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 298 ( 117 ~; 171 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 11 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 188 ( 0 sgn 188 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( ~ member(X2,X0)
| ~ subclass(X0,X1)
| member(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_members) ).
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(f4,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',class_elements_are_sets) ).
fof(f7,axiom,
! [X0,X1] :
( ~ subclass(X1,X0)
| ~ subclass(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_implies_equal) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_member) ).
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair2) ).
fof(f10,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X1,X0))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair3) ).
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(f21,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection1) ).
fof(f22,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection2) ).
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(f24,axiom,
! [X0,X1] :
( ~ member(X0,complement(X1))
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement1) ).
fof(f67,axiom,
! [X0] :
( X0 = null_class
| member(regular(X0),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',regularity1) ).
fof(f68,plain,
! [X0] :
( member(regular(X0),X0)
| null_class = X0 ),
inference(reorient_equations,[],[f67]) ).
fof(f69,axiom,
! [X0] :
( X0 = null_class
| intersection(X0,regular(X0)) = null_class ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',regularity2) ).
fof(f70,plain,
! [X0] :
( null_class = intersection(X0,regular(X0))
| null_class = X0 ),
inference(reorient_equations,[],[f69]) ).
fof(f122,negated_conjecture,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(universal_class,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_property_1_of_ordered_pair_1) ).
fof(f127,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(f185,plain,
unordered_pair(null_class,unordered_pair(unordered_pair(y,y),unordered_pair(y,y))) != unordered_pair(unordered_pair(universal_class,universal_class),unordered_pair(universal_class,unordered_pair(y,y))),
inference(definition_unfolding,[],[f122,f12,f12,f127]) ).
fof(f190,definition,
sF0 = unordered_pair(y,y),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f191,plain,
unordered_pair(y,y) = sF0,
inference(reorient_equations,[],[f190]) ).
fof(f192,definition,
sF1 = unordered_pair(sF0,sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f193,plain,
unordered_pair(sF0,sF0) = sF1,
inference(reorient_equations,[],[f192]) ).
fof(f194,definition,
sF2 = unordered_pair(null_class,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f195,plain,
unordered_pair(null_class,sF1) = sF2,
inference(reorient_equations,[],[f194]) ).
fof(f196,definition,
sF3 = unordered_pair(universal_class,universal_class),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f197,plain,
unordered_pair(universal_class,universal_class) = sF3,
inference(reorient_equations,[],[f196]) ).
fof(f198,definition,
sF4 = unordered_pair(universal_class,sF0),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f199,plain,
unordered_pair(universal_class,sF0) = sF4,
inference(reorient_equations,[],[f198]) ).
fof(f200,definition,
sF5 = unordered_pair(sF3,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f201,plain,
unordered_pair(sF3,sF4) = sF5,
inference(reorient_equations,[],[f200]) ).
fof(f202,plain,
sF2 != sF5,
inference(definition_folding,[],[f185,f201,f199,f191,f197,f195,f193,f191,f191]) ).
fof(f203,plain,
( member(universal_class,sF3)
| ~ member(universal_class,universal_class) ),
inference(superposition,[],[f9,f197]) ).
fof(f207,plain,
( member(sF0,sF1)
| ~ member(sF0,universal_class) ),
inference(superposition,[],[f9,f193]) ).
fof(f219,definition,
( spl6_3
<=> member(sF0,universal_class) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f221,plain,
( ~ member(sF0,universal_class)
| spl6_3 ),
inference(avatar_component_clause,[],[f219]) ).
fof(f223,definition,
( spl6_4
<=> member(sF0,sF1) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f225,plain,
( member(sF0,sF1)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f223]) ).
fof(f226,plain,
( ~ spl6_3
| spl6_4 ),
inference(avatar_split_clause,[],[f207,f223,f219]) ).
fof(f246,definition,
( spl6_9
<=> member(universal_class,universal_class) ),
introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).
fof(f248,plain,
( ~ member(universal_class,universal_class)
| spl6_9 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f250,definition,
( spl6_10
<=> member(universal_class,sF4) ),
introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).
fof(f252,plain,
( member(universal_class,sF4)
| ~ spl6_10 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f255,definition,
( spl6_11
<=> member(universal_class,sF3) ),
introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).
fof(f257,plain,
( member(universal_class,sF3)
| ~ spl6_11 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f258,plain,
( ~ spl6_9
| spl6_11 ),
inference(avatar_split_clause,[],[f203,f255,f246]) ).
fof(f294,plain,
! [X2,X0,X1] :
( subclass(unordered_pair(X0,X1),X2)
| not_subclass_element(unordered_pair(X0,X1),X2) = X0
| not_subclass_element(unordered_pair(X0,X1),X2) = X1 ),
inference(resolution,[],[f2,f8]) ).
fof(f300,plain,
! [X2,X0,X1] :
( member(not_subclass_element(X0,X2),X1)
| ~ subclass(X0,X1)
| subclass(X0,X2) ),
inference(resolution,[],[f1,f2]) ).
fof(f307,plain,
member(sF0,universal_class),
inference(superposition,[],[f11,f191]) ).
fof(f312,plain,
( $false
| spl6_3 ),
inference(forward_subsumption_resolution,[],[f307,f221]) ).
fof(f313,plain,
spl6_3,
inference(avatar_contradiction_clause,[],[f312]) ).
fof(f326,plain,
! [X0,X1] :
( regular(unordered_pair(X0,X1)) = X1
| regular(unordered_pair(X0,X1)) = X0
| unordered_pair(X0,X1) = null_class ),
inference(resolution,[],[f68,f8]) ).
fof(f335,definition,
( spl6_17
<=> null_class = sF3 ),
introduced(definition,[new_symbols(definition,[spl6_17])],[avatar_definition]) ).
fof(f337,plain,
( null_class = sF3
| ~ spl6_17 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f373,plain,
! [X0,X1] :
( X0 != X1
| regular(unordered_pair(X0,X1)) = X0
| unordered_pair(X0,X1) = null_class ),
inference(equality_factoring,[],[f326]) ).
fof(f443,plain,
! [X2,X0,X1] :
( member(not_subclass_element(intersection(X0,X1),X2),X0)
| subclass(intersection(X0,X1),X2) ),
inference(resolution,[],[f21,f2]) ).
fof(f449,plain,
! [X0] :
( regular(unordered_pair(X0,X0)) = X0
| unordered_pair(X0,X0) = null_class ),
inference(equality_resolution,[],[f373]) ).
fof(f453,plain,
! [X2,X0,X1] :
( member(not_subclass_element(intersection(X0,X1),X2),X1)
| subclass(intersection(X0,X1),X2) ),
inference(resolution,[],[f22,f2]) ).
fof(f454,plain,
! [X0,X1] :
( member(regular(intersection(X0,X1)),X1)
| intersection(X0,X1) = null_class ),
inference(resolution,[],[f22,f68]) ).
fof(f535,plain,
! [X0] :
( null_class = intersection(unordered_pair(X0,X0),X0)
| unordered_pair(X0,X0) = null_class
| unordered_pair(X0,X0) = null_class ),
inference(superposition,[],[f70,f449]) ).
fof(f536,plain,
! [X0] :
( null_class = intersection(unordered_pair(X0,X0),X0)
| unordered_pair(X0,X0) = null_class ),
inference(duplicate_literal_removal,[],[f535]) ).
fof(f547,plain,
! [X0,X1] :
( subclass(intersection(X0,X1),X0)
| subclass(intersection(X0,X1),X0) ),
inference(resolution,[],[f443,f3]) ).
fof(f559,plain,
! [X0,X1] : subclass(intersection(X0,X1),X0),
inference(duplicate_literal_removal,[],[f547]) ).
fof(f572,plain,
! [X0,X1] :
( subclass(intersection(X0,X1),X1)
| subclass(intersection(X0,X1),X1) ),
inference(resolution,[],[f453,f3]) ).
fof(f584,plain,
! [X0,X1] : subclass(intersection(X0,X1),X1),
inference(duplicate_literal_removal,[],[f572]) ).
fof(f634,plain,
! [X2,X3,X0,X1] :
( ~ subclass(intersection(X2,X1),X3)
| ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,X3) ),
inference(resolution,[],[f23,f1]) ).
fof(f635,plain,
! [X2,X0,X1] :
( ~ member(not_subclass_element(X0,intersection(X1,X2)),X2)
| ~ member(not_subclass_element(X0,intersection(X1,X2)),X1)
| subclass(X0,intersection(X1,X2)) ),
inference(resolution,[],[f23,f3]) ).
fof(f679,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,universal_class) ),
inference(resolution,[],[f634,f4]) ).
fof(f683,plain,
! [X2,X0,X1] :
( ~ member(not_subclass_element(X0,X1),X2)
| member(not_subclass_element(X0,X1),universal_class)
| subclass(X0,X1) ),
inference(resolution,[],[f679,f2]) ).
fof(f710,plain,
! [X0,X1] :
( member(not_subclass_element(X0,X1),universal_class)
| subclass(X0,X1)
| subclass(X0,X1) ),
inference(resolution,[],[f683,f2]) ).
fof(f720,plain,
! [X0,X1] :
( member(not_subclass_element(X0,X1),universal_class)
| subclass(X0,X1) ),
inference(duplicate_literal_removal,[],[f710]) ).
fof(f1013,plain,
! [X0] :
( ~ member(regular(complement(X0)),X0)
| complement(X0) = null_class ),
inference(resolution,[],[f24,f68]) ).
fof(f1207,plain,
! [X2,X0,X1] :
( ~ member(not_subclass_element(X0,intersection(X1,X2)),X1)
| subclass(X0,intersection(X1,X2))
| ~ subclass(X0,X2)
| subclass(X0,intersection(X1,X2)) ),
inference(resolution,[],[f635,f300]) ).
fof(f1217,plain,
! [X2,X0,X1] :
( ~ member(not_subclass_element(X0,intersection(X1,X2)),X1)
| subclass(X0,intersection(X1,X2))
| ~ subclass(X0,X2) ),
inference(duplicate_literal_removal,[],[f1207]) ).
fof(f2099,plain,
! [X0,X1] :
( subclass(X0,intersection(X0,X1))
| ~ subclass(X0,X1)
| subclass(X0,intersection(X0,X1)) ),
inference(resolution,[],[f1217,f2]) ).
fof(f2116,plain,
! [X0,X1] :
( subclass(X0,intersection(X0,X1))
| ~ subclass(X0,X1) ),
inference(duplicate_literal_removal,[],[f2099]) ).
fof(f2125,plain,
! [X0,X1] :
( ~ subclass(X0,X1)
| ~ subclass(intersection(X0,X1),X0)
| intersection(X0,X1) = X0 ),
inference(resolution,[],[f2116,f7]) ).
fof(f2142,plain,
! [X0,X1] :
( ~ subclass(X0,X1)
| intersection(X0,X1) = X0 ),
inference(forward_subsumption_resolution,[],[f2125,f559]) ).
fof(f2145,plain,
! [X0] : intersection(X0,universal_class) = X0,
inference(resolution,[],[f2142,f4]) ).
fof(f2148,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),X2) = X1
| not_subclass_element(unordered_pair(X0,X1),X2) = X0
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(resolution,[],[f2142,f294]) ).
fof(f2165,plain,
! [X0,X1] :
( ~ member(X1,X0)
| member(X1,universal_class) ),
inference(superposition,[],[f22,f2145]) ).
fof(f2170,plain,
! [X0] :
( member(regular(X0),universal_class)
| null_class = X0 ),
inference(superposition,[],[f454,f2145]) ).
fof(f2250,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| subclass(unordered_pair(X1,X0),X2)
| not_subclass_element(unordered_pair(X1,X0),X2) = X1
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),X2) ),
inference(superposition,[],[f720,f2148]) ).
fof(f2253,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| subclass(unordered_pair(X1,X0),X2)
| not_subclass_element(unordered_pair(X1,X0),X2) = X1
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),X2) ),
inference(superposition,[],[f3,f2148]) ).
fof(f2257,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| subclass(unordered_pair(X0,X1),X2)
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(superposition,[],[f720,f2148]) ).
fof(f2260,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| subclass(unordered_pair(X0,X1),X2)
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(superposition,[],[f3,f2148]) ).
fof(f2275,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(forward_subsumption_resolution,[],[f2260,f2142]) ).
fof(f2277,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| not_subclass_element(unordered_pair(X0,X1),X2) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),X2) ),
inference(forward_subsumption_resolution,[],[f2257,f2142]) ).
fof(f2281,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| not_subclass_element(unordered_pair(X1,X0),X2) = X1
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),X2) ),
inference(forward_subsumption_resolution,[],[f2253,f2142]) ).
fof(f2283,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| not_subclass_element(unordered_pair(X1,X0),X2) = X1
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),X2) ),
inference(forward_subsumption_resolution,[],[f2250,f2142]) ).
fof(f2322,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),unordered_pair(X0,X2)) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X0,X2))
| ~ member(X0,universal_class) ),
inference(resolution,[],[f2275,f9]) ).
fof(f2331,plain,
( ! [X0] :
( not_subclass_element(unordered_pair(sF0,X0),sF1) = X0
| unordered_pair(sF0,X0) = intersection(unordered_pair(sF0,X0),sF1) )
| ~ spl6_4 ),
inference(resolution,[],[f2275,f225]) ).
fof(f2344,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),unordered_pair(X0,X2)) = X1
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X0,X2)) ),
inference(forward_subsumption_resolution,[],[f2322,f2277]) ).
fof(f2374,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),unordered_pair(X1,X2)) = X0
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(resolution,[],[f2281,f9]) ).
fof(f2396,plain,
! [X2,X0,X1] :
( not_subclass_element(unordered_pair(X0,X1),unordered_pair(X1,X2)) = X0
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f2374,f2283]) ).
fof(f2425,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| subclass(unordered_pair(X1,X0),unordered_pair(X1,X2))
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),unordered_pair(X1,X2)) ),
inference(superposition,[],[f720,f2344]) ).
fof(f2428,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| subclass(unordered_pair(X1,X0),unordered_pair(X1,X2))
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),unordered_pair(X1,X2)) ),
inference(superposition,[],[f3,f2344]) ).
fof(f2432,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f2428,f2142]) ).
fof(f2434,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| unordered_pair(X1,X0) = intersection(unordered_pair(X1,X0),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f2425,f2142]) ).
fof(f2456,plain,
! [X0,X1] :
( unordered_pair(X0,X0) = intersection(unordered_pair(X0,X0),unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(resolution,[],[f2432,f9]) ).
fof(f2485,plain,
! [X0,X1] : unordered_pair(X0,X0) = intersection(unordered_pair(X0,X0),unordered_pair(X0,X1)),
inference(forward_subsumption_resolution,[],[f2456,f2434]) ).
fof(f2509,plain,
! [X0,X1] : subclass(unordered_pair(X0,X0),unordered_pair(X0,X1)),
inference(superposition,[],[f584,f2485]) ).
fof(f2695,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| subclass(unordered_pair(X0,X1),unordered_pair(X1,X2))
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(superposition,[],[f720,f2396]) ).
fof(f2698,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| subclass(unordered_pair(X0,X1),unordered_pair(X1,X2))
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(superposition,[],[f3,f2396]) ).
fof(f2702,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f2698,f2142]) ).
fof(f2704,plain,
! [X2,X0,X1] :
( member(X0,universal_class)
| unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X2)) ),
inference(forward_subsumption_resolution,[],[f2695,f2142]) ).
fof(f2728,plain,
! [X0,X1] :
( unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X0))
| ~ member(X0,universal_class) ),
inference(resolution,[],[f2702,f10]) ).
fof(f2758,plain,
! [X0,X1] : unordered_pair(X0,X1) = intersection(unordered_pair(X0,X1),unordered_pair(X1,X0)),
inference(forward_subsumption_resolution,[],[f2728,f2704]) ).
fof(f2787,plain,
! [X0,X1] : subclass(unordered_pair(X0,X1),unordered_pair(X1,X0)),
inference(superposition,[],[f584,f2758]) ).
fof(f2900,plain,
! [X0,X1] :
( ~ subclass(unordered_pair(X0,X1),unordered_pair(X1,X0))
| unordered_pair(X0,X1) = unordered_pair(X1,X0) ),
inference(resolution,[],[f2787,f7]) ).
fof(f2923,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(forward_subsumption_resolution,[],[f2900,f2787]) ).
fof(f3016,plain,
sF4 = unordered_pair(sF0,universal_class),
inference(superposition,[],[f199,f2923]) ).
fof(f3081,plain,
subclass(unordered_pair(sF0,sF0),sF4),
inference(superposition,[],[f2509,f3016]) ).
fof(f3094,plain,
subclass(sF1,sF4),
inference(forward_demodulation,[],[f3081,f193]) ).
fof(f3148,plain,
( ~ subclass(sF4,sF1)
| sF1 = sF4 ),
inference(resolution,[],[f3094,f7]) ).
fof(f3150,definition,
( spl6_76
<=> sF1 = sF4 ),
introduced(definition,[new_symbols(definition,[spl6_76])],[avatar_definition]) ).
fof(f3152,plain,
( sF1 = sF4
| ~ spl6_76 ),
inference(avatar_component_clause,[],[f3150]) ).
fof(f3154,definition,
( spl6_77
<=> subclass(sF4,sF1) ),
introduced(definition,[new_symbols(definition,[spl6_77])],[avatar_definition]) ).
fof(f3156,plain,
( ~ subclass(sF4,sF1)
| spl6_77 ),
inference(avatar_component_clause,[],[f3154]) ).
fof(f3157,plain,
( spl6_76
| ~ spl6_77 ),
inference(avatar_split_clause,[],[f3148,f3154,f3150]) ).
fof(f3242,definition,
( spl6_78
<=> sF4 = intersection(sF4,sF1) ),
introduced(definition,[new_symbols(definition,[spl6_78])],[avatar_definition]) ).
fof(f3243,plain,
( sF4 != intersection(sF4,sF1)
| spl6_78 ),
inference(avatar_component_clause,[],[f3242]) ).
fof(f3244,plain,
( sF4 = intersection(sF4,sF1)
| ~ spl6_78 ),
inference(avatar_component_clause,[],[f3242]) ).
fof(f3258,plain,
( subclass(sF4,sF1)
| ~ spl6_78 ),
inference(superposition,[],[f584,f3244]) ).
fof(f3265,plain,
( $false
| spl6_77
| ~ spl6_78 ),
inference(forward_subsumption_resolution,[],[f3258,f3156]) ).
fof(f3266,plain,
( spl6_77
| ~ spl6_78 ),
inference(avatar_contradiction_clause,[],[f3265]) ).
fof(f3454,plain,
( ! [X0] :
( member(X0,unordered_pair(sF0,X0))
| subclass(unordered_pair(sF0,X0),sF1)
| unordered_pair(sF0,X0) = intersection(unordered_pair(sF0,X0),sF1) )
| ~ spl6_4 ),
inference(superposition,[],[f2,f2331]) ).
fof(f3456,plain,
( ! [X0] :
( member(X0,unordered_pair(sF0,X0))
| unordered_pair(sF0,X0) = intersection(unordered_pair(sF0,X0),sF1) )
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f3454,f2142]) ).
fof(f3473,plain,
( member(universal_class,sF4)
| sF4 = intersection(sF4,sF1)
| ~ spl6_4 ),
inference(superposition,[],[f3456,f3016]) ).
fof(f3479,plain,
( member(universal_class,sF4)
| ~ spl6_4
| spl6_78 ),
inference(forward_subsumption_resolution,[],[f3473,f3243]) ).
fof(f3481,plain,
( spl6_10
| ~ spl6_4
| spl6_78 ),
inference(avatar_split_clause,[],[f3479,f3242,f223,f250]) ).
fof(f3485,plain,
( member(universal_class,universal_class)
| ~ spl6_10 ),
inference(resolution,[],[f252,f2165]) ).
fof(f3488,plain,
( $false
| spl6_9
| ~ spl6_10 ),
inference(forward_subsumption_resolution,[],[f3485,f248]) ).
fof(f3489,plain,
( spl6_9
| ~ spl6_10 ),
inference(avatar_contradiction_clause,[],[f3488]) ).
fof(f4350,plain,
( null_class = unordered_pair(universal_class,universal_class)
| null_class = unordered_pair(universal_class,universal_class) ),
inference(superposition,[],[f2145,f536]) ).
fof(f4353,plain,
null_class = unordered_pair(universal_class,universal_class),
inference(duplicate_literal_removal,[],[f4350]) ).
fof(f4356,plain,
null_class = sF3,
inference(forward_demodulation,[],[f4353,f197]) ).
fof(f4715,plain,
spl6_17,
inference(avatar_split_clause,[],[f4356,f335]) ).
fof(f4777,plain,
( sF2 = unordered_pair(sF3,sF1)
| ~ spl6_17 ),
inference(superposition,[],[f195,f337]) ).
fof(f5231,definition,
( spl6_132
<=> sF3 = complement(universal_class) ),
introduced(definition,[new_symbols(definition,[spl6_132])],[avatar_definition]) ).
fof(f5233,plain,
( sF3 = complement(universal_class)
| ~ spl6_132 ),
inference(avatar_component_clause,[],[f5231]) ).
fof(f5317,plain,
( null_class = complement(universal_class)
| null_class = complement(universal_class) ),
inference(resolution,[],[f2170,f1013]) ).
fof(f5334,plain,
null_class = complement(universal_class),
inference(duplicate_literal_removal,[],[f5317]) ).
fof(f5338,plain,
( sF3 = complement(universal_class)
| ~ spl6_17 ),
inference(forward_demodulation,[],[f5334,f337]) ).
fof(f5339,plain,
( spl6_132
| ~ spl6_17 ),
inference(avatar_split_clause,[],[f5338,f335,f5231]) ).
fof(f5342,plain,
( ! [X0] :
( ~ member(X0,sF3)
| ~ member(X0,universal_class) )
| ~ spl6_132 ),
inference(superposition,[],[f24,f5233]) ).
fof(f5343,plain,
( ! [X0] : ~ member(X0,sF3)
| ~ spl6_132 ),
inference(forward_subsumption_resolution,[],[f5342,f2165]) ).
fof(f5345,plain,
( $false
| ~ spl6_11
| ~ spl6_132 ),
inference(resolution,[],[f5343,f257]) ).
fof(f5355,plain,
( ~ spl6_11
| ~ spl6_132 ),
inference(avatar_contradiction_clause,[],[f5345]) ).
fof(f5463,plain,
( sF5 = unordered_pair(sF3,sF1)
| ~ spl6_76 ),
inference(superposition,[],[f201,f3152]) ).
fof(f5479,plain,
( sF2 = sF5
| ~ spl6_17
| ~ spl6_76 ),
inference(forward_demodulation,[],[f5463,f4777]) ).
fof(f5481,plain,
( $false
| ~ spl6_17
| ~ spl6_76 ),
inference(forward_subsumption_resolution,[],[f5479,f202]) ).
fof(f5482,plain,
( ~ spl6_17
| ~ spl6_76 ),
inference(avatar_contradiction_clause,[],[f5481]) ).
cnf(s2,plain,
( ~ spl6_3
| spl6_4 ),
inference(sat_conversion,[],[f226]) ).
cnf(s6,plain,
( ~ spl6_9
| spl6_11 ),
inference(sat_conversion,[],[f258]) ).
cnf(s10,plain,
spl6_3,
inference(sat_conversion,[],[f313]) ).
cnf(s84,plain,
( spl6_76
| ~ spl6_77 ),
inference(sat_conversion,[],[f3157]) ).
cnf(s86,plain,
( spl6_77
| ~ spl6_78 ),
inference(sat_conversion,[],[f3266]) ).
cnf(s94,plain,
( ~ spl6_4
| spl6_10
| spl6_78 ),
inference(sat_conversion,[],[f3481]) ).
cnf(s95,plain,
( spl6_9
| ~ spl6_10 ),
inference(sat_conversion,[],[f3489]) ).
cnf(s195,plain,
spl6_17,
inference(sat_conversion,[],[f4715]) ).
cnf(s208,plain,
( ~ spl6_17
| spl6_132 ),
inference(sat_conversion,[],[f5339]) ).
cnf(s209,plain,
( ~ spl6_11
| ~ spl6_132 ),
inference(sat_conversion,[],[f5355]) ).
cnf(s217,plain,
( ~ spl6_17
| ~ spl6_76 ),
inference(sat_conversion,[],[f5482]) ).
cnf(s218,plain,
~ spl6_76,
inference(rat,[],[s217,s195]) ).
cnf(s219,plain,
spl6_132,
inference(rat,[],[s208,s195]) ).
cnf(s220,plain,
~ spl6_11,
inference(rat,[],[s209,s219]) ).
cnf(s227,plain,
~ spl6_77,
inference(rat,[],[s84,s218]) ).
cnf(s228,plain,
~ spl6_78,
inference(rat,[],[s86,s227]) ).
cnf(s234,plain,
~ spl6_9,
inference(rat,[],[s6,s220]) ).
cnf(s235,plain,
~ spl6_10,
inference(rat,[],[s95,s234]) ).
cnf(s237,plain,
~ spl6_4,
inference(rat,[],[s94,s228,s235]) ).
cnf(s239,plain,
$false,
inference(rat,[],[s2,s237,s10]) ).
fof(f5483,plain,
$false,
inference(avatar_sat_refutation,[],[s239]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET512-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 02:00:55 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 12.15/2.63 % (3516763)Input is clausal, will run a generic CNF schedule.
% 12.15/2.63 % (3516872)lrs+10_1_sil=8000:sp=occurrence:random_seed=3514111810:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 12.15/2.63 % (3516872)Refutation not found, incomplete strategy
% 12.15/2.63 % (3516872)------------------------------
% 12.15/2.63 % (3516872)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.63 % (3516872)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.63 % (3516872)CaDiCaL version: 2.1.3
% 12.15/2.63 % (3516872)Termination reason: Refutation not found, incomplete strategy
% 12.15/2.63 % (3516872)Time elapsed: 0.001 s
% 12.15/2.63 % (3516872)Peak memory usage: 88 MB
% 12.15/2.63 % (3516872)Instructions burned: 1 (million)
% 12.15/2.63 % (3516871)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4084774461:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 12.15/2.63 % (3516869)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=924221316:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 12.15/2.63 % (3516870)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1424648846:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 12.15/2.63 % (3516875)dis-21_1_sil=8000:lcm=predicate:random_seed=3670784856: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)
% 12.15/2.63 % (3516873)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4158726745:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 12.15/2.63 % (3516874)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1905297882:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 12.15/2.63 % (3516875)Instruction limit reached!
% 12.15/2.63 % (3516875)------------------------------
% 12.15/2.63 % (3516875)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.63 % (3516875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.63 % (3516875)CaDiCaL version: 2.1.3
% 12.15/2.63 % (3516875)Termination reason: Instruction limit
% 12.15/2.63 % (3516875)Termination phase: Saturation
% 12.15/2.63 % (3516875)Time elapsed: 0.078 s
% 12.15/2.63 % (3516875)Peak memory usage: 89 MB
% 12.15/2.63 % (3516875)Instructions burned: 117 (million)
% 12.15/2.63 % (3516873)Instruction limit reached!
% 12.15/2.63 % (3516873)------------------------------
% 12.15/2.63 % (3516873)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.63 % (3516873)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.63 % (3516873)CaDiCaL version: 2.1.3
% 12.15/2.63 % (3516873)Termination reason: Instruction limit
% 12.15/2.63 % (3516873)Termination phase: Saturation
% 12.15/2.63 % (3516873)Time elapsed: 0.080 s
% 12.15/2.63 % (3516873)Peak memory usage: 88 MB
% 12.15/2.63 % (3516873)Instructions burned: 115 (million)
% 12.15/2.63 % (3516872)------------------------------
% 12.15/2.63 % (3516872)------------------------------
% 12.15/2.63 % (3516874)Instruction limit reached!
% 12.15/2.63 % (3516874)------------------------------
% 12.15/2.63 % (3516874)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.63 % (3516874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.63 % (3516874)CaDiCaL version: 2.1.3
% 12.15/2.63 % (3516874)Termination reason: Instruction limit
% 12.15/2.63 % (3516874)Termination phase: Saturation
% 12.15/2.63 % (3516874)Time elapsed: 0.198 s
% 12.15/2.63 % (3516874)Peak memory usage: 90 MB
% 12.15/2.63 % (3516874)Instructions burned: 180 (million)
% 12.15/2.63 % (3516912)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=424495034:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 12.15/2.63 % (3516912)Refutation not found, incomplete strategy
% 12.15/2.63 % (3516912)------------------------------
% 12.15/2.63 % (3516912)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.63 % (3516912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.63 % (3516912)CaDiCaL version: 2.1.3
% 12.15/2.63 % (3516912)Termination reason: Refutation not found, incomplete strategy
% 12.15/2.63 % (3516912)Time elapsed: 0.003 s
% 12.15/2.63 % (3516912)Peak memory usage: 88 MB
% 12.15/2.63 % (3516912)Instructions burned: 4 (million)
% 12.15/2.64 % (3516910)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=2587291135:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 12.15/2.64 % (3516911)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3776892002: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)
% 12.15/2.64 % (3516910)Refutation not found, incomplete strategy
% 12.15/2.64 % (3516910)------------------------------
% 12.15/2.64 % (3516910)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3516910)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3516910)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3516910)Termination reason: Refutation not found, incomplete strategy
% 12.15/2.64 % (3516910)Time elapsed: 0.005 s
% 12.15/2.64 % (3516910)Peak memory usage: 88 MB
% 12.15/2.64 % (3516910)Instructions burned: 3 (million)
% 12.15/2.64 % (3516917)lrs+10_64_to=lpo:sil=8000:random_seed=3316072881:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 12.15/2.64 % (3516911)Instruction limit reached!
% 12.15/2.64 % (3516911)------------------------------
% 12.15/2.64 % (3516911)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3516911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3516911)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3516911)Termination reason: Instruction limit
% 12.15/2.64 % (3516911)Termination phase: Saturation
% 12.15/2.64 % (3516911)Time elapsed: 0.193 s
% 12.15/2.64 % (3516911)Peak memory usage: 91 MB
% 12.15/2.64 % (3516911)Instructions burned: 189 (million)
% 12.15/2.64 % (3516912)------------------------------
% 12.15/2.64 % (3516912)------------------------------
% 12.15/2.64 % (3516917)Instruction limit reached!
% 12.15/2.64 % (3516917)------------------------------
% 12.15/2.64 % (3516917)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3516917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3516917)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3516917)Termination reason: Instruction limit
% 12.15/2.64 % (3516917)Termination phase: Saturation
% 12.15/2.64 % (3516917)Time elapsed: 0.138 s
% 12.15/2.64 % (3516917)Peak memory usage: 89 MB
% 12.15/2.64 % (3516917)Instructions burned: 126 (million)
% 12.15/2.64 % (3516910)------------------------------
% 12.15/2.64 % (3516910)------------------------------
% 12.15/2.64 % (3516931)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=2188857539:i=157:gtg=all_2992 on theBenchmark for (2992ds/157Mi)
% 12.15/2.64 % (3516930)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2387252759:avsq=on:i=194:fgj=on:bd=preordered_2992 on theBenchmark for (2992ds/194Mi)
% 12.15/2.64 % (3516931)Instruction limit reached!
% 12.15/2.64 % (3516931)------------------------------
% 12.15/2.64 % (3516931)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3516931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3516931)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3516931)Termination reason: Instruction limit
% 12.15/2.64 % (3516931)Termination phase: Saturation
% 12.15/2.64 % (3516931)Time elapsed: 0.056 s
% 12.15/2.64 % (3516931)Peak memory usage: 91 MB
% 12.15/2.64 % (3516931)Instructions burned: 159 (million)
% 12.15/2.64 % (3516932)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=3443110383:i=3394:sd=4:ss=included:sgt=64_2991 on theBenchmark for (2991ds/3394Mi)
% 12.15/2.64 % (3516930)Instruction limit reached!
% 12.15/2.64 % (3516930)------------------------------
% 12.15/2.64 % (3516930)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3516930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3516930)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3516930)Termination reason: Instruction limit
% 12.15/2.64 % (3516930)Termination phase: Saturation
% 12.15/2.64 % (3516930)Time elapsed: 0.123 s
% 12.15/2.64 % (3516930)Peak memory usage: 89 MB
% 12.15/2.64 % (3516930)Instructions burned: 196 (million)
% 12.15/2.64 % (3516934)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=1292438514:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2991 on theBenchmark for (2991ds/106Mi)
% 12.15/2.64 % (3516937)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=2446594304:i=107_2990 on theBenchmark for (2990ds/107Mi)
% 12.15/2.64 % (3516937)Refutation not found, incomplete strategy
% 12.15/2.64 % (3516937)------------------------------
% 12.15/2.64 % (3516937)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3516937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3516937)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3516937)Termination reason: Refutation not found, incomplete strategy
% 12.15/2.64 % (3516937)Time elapsed: 0.003 s
% 12.15/2.64 % (3516937)Peak memory usage: 88 MB
% 12.15/2.64 % (3516937)Instructions burned: 8 (million)
% 12.15/2.64 % (3516934)Instruction limit reached!
% 12.15/2.64 % (3516934)------------------------------
% 12.15/2.64 % (3516934)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3516934)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3516934)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3516934)Termination reason: Instruction limit
% 12.15/2.64 % (3516934)Termination phase: Saturation
% 12.15/2.64 % (3516934)Time elapsed: 0.057 s
% 12.15/2.64 % (3516934)Peak memory usage: 91 MB
% 12.15/2.64 % (3516934)Instructions burned: 107 (million)
% 12.15/2.64 % (3516946)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2486961383:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2989 on theBenchmark for (2989ds/242Mi)
% 12.15/2.64 % (3516937)------------------------------
% 12.15/2.64 % (3516937)------------------------------
% 12.15/2.64 % (3516977)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1425473125:cond=fast:i=5208:av=off_2989 on theBenchmark for (2989ds/5208Mi)
% 12.15/2.64 % (3517020)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=1234469341:i=134:sd=2:doe=on:ss=axioms:sgt=14_2987 on theBenchmark for (2987ds/134Mi)
% 12.15/2.64 % (3516946)Instruction limit reached!
% 12.15/2.64 % (3516946)------------------------------
% 12.15/2.64 % (3516946)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3516946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3516946)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3516946)Termination reason: Instruction limit
% 12.15/2.64 % (3516946)Termination phase: Saturation
% 12.15/2.64 % (3516946)Time elapsed: 0.172 s
% 12.15/2.64 % (3516946)Peak memory usage: 90 MB
% 12.15/2.64 % (3516946)Instructions burned: 243 (million)
% 12.15/2.64 % (3517020)Instruction limit reached!
% 12.15/2.64 % (3517020)------------------------------
% 12.15/2.64 % (3517020)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3517020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3517020)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3517020)Termination reason: Instruction limit
% 12.15/2.64 % (3517020)Termination phase: Saturation
% 12.15/2.64 % (3517020)Time elapsed: 0.052 s
% 12.15/2.64 % (3517020)Peak memory usage: 90 MB
% 12.15/2.64 % (3517020)Instructions burned: 136 (million)
% 12.15/2.64 % (3517053)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=3934000575:i=191:fgj=on:bd=all_2986 on theBenchmark for (2986ds/191Mi)
% 12.15/2.64 % (3517052)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=2628987900:i=499:bd=all_2986 on theBenchmark for (2986ds/499Mi)
% 12.15/2.64 % (3516869)First to succeed.
% 12.15/2.64 % (3516869)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3516763"
% 12.15/2.64 % (3517053)Instruction limit reached!
% 12.15/2.64 % (3517053)------------------------------
% 12.15/2.64 % (3517053)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3517053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3517053)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3517053)Termination reason: Instruction limit
% 12.15/2.64 % (3517053)Termination phase: Saturation
% 12.15/2.64 % (3517053)Time elapsed: 0.059 s
% 12.15/2.64 % (3517053)Peak memory usage: 89 MB
% 12.15/2.64 % (3517053)Instructions burned: 192 (million)
% 12.15/2.64 % (3517101)lrs-11_32_anc=all:sil=8000:spb=goal_then_units:sac=on:random_seed=4282513280:i=264:kws=precedence:fsr=off_2984 on theBenchmark for (2984ds/264Mi)
% 12.15/2.64 % (3517101)Instruction limit reached!
% 12.15/2.64 % (3517101)------------------------------
% 12.15/2.64 % (3517101)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.15/2.64 % (3517101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.15/2.64 % (3517101)CaDiCaL version: 2.1.3
% 12.15/2.64 % (3517101)Termination reason: Instruction limit
% 12.15/2.64 % (3517101)Termination phase: Saturation
% 12.15/2.64 % (3517101)Time elapsed: 0.096 s
% 12.15/2.64 % (3517101)Peak memory usage: 92 MB
% 12.15/2.64 % (3517101)Instructions burned: 265 (million)
% 12.15/2.64 % (3516869)Refutation found. Thanks to Tanya!
% 12.15/2.64 % SZS status Unsatisfiable for theBenchmark
% 12.15/2.64 % SZS output start Proof for theBenchmark
% See solution above
% 13.09/2.74 % (3516869)------------------------------
% 13.09/2.74 % (3516869)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.09/2.74 % (3516869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.09/2.74 % (3516869)CaDiCaL version: 2.1.3
% 13.09/2.74 % (3516869)Termination reason: Refutation
% 13.09/2.74 % (3516869)Time elapsed: 1.355 s
% 13.09/2.74 % (3516869)Peak memory usage: 136 MB
% 13.09/2.74 % (3516869)Instructions burned: 1682 (million)
% 13.09/2.74 % (3516869)------------------------------
% 13.09/2.74 % (3516869)------------------------------
% 13.09/2.74 % (3516763)Success in time 1.779 s
% 13.09/2.74 % Vampire exiting
%------------------------------------------------------------------------------